Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2942449404', 'doi': None, 'title': 'Kolmogorov Complexity of Graphs', 'display_name': 'Kolmogorov Complexity of Graphs', 'publication_year': 2006, 'publication_date': '2006-01-01', 'ids': {'openalex': 'https://openalex.org/W2942449404', 'mag': '2942449404'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1185&context=hmc_theses', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': [], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5103703350', 'display_name': 'John P. Hearn', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'John Hearn', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5103703350'], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 61}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12002', 'display_name': 'Computational Complexity and Algorithmic Information Theory', 'score': 1.0, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, 'topics': [{'id': 'https://openalex.org/T12002', 'display_name': 'Computational Complexity and Algorithmic Information Theory', 'score': 1.0, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T11567', 'display_name': 'Automata Theory and Formal Languages', 'score': 0.9643, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}, {'id': 'https://openalex.org/T12162', 'display_name': 'Theory and Applications of Cellular Automata', 'score': 0.9616, 'subfield': {'id': 'https://openalex.org/subfields/1703', 'display_name': 'Computational Theory and Mathematics'}, 'field': {'id': 'https://openalex.org/fields/17', 'display_name': 'Computer Science'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/kolmogorov-complexity', 'display_name': 'Kolmogorov Complexity', 'score': 0.857535}, {'id': 'https://openalex.org/keywords/state-complexity', 'display_name': 'State Complexity', 'score': 0.652009}, {'id': 'https://openalex.org/keywords/complex-systems', 'display_name': 'Complex Systems', 'score': 0.597868}, {'id': 'https://openalex.org/keywords/computational-depth', 'display_name': 'Computational Depth', 'score': 0.585761}, {'id': 'https://openalex.org/keywords/computation', 'display_name': 'Computation', 'score': 0.53338}], 'concepts': [{'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.4306678}, {'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.38734087}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.38630778}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.3269899}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1185&context=hmc_theses', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 2, 'referenced_works': ['https://openalex.org/W1638203394', 'https://openalex.org/W379787278'], 'related_works': ['https://openalex.org/W379787278', 'https://openalex.org/W3199012062', 'https://openalex.org/W3195110049', 'https://openalex.org/W2996560789', 'https://openalex.org/W2963959716', 'https://openalex.org/W2963588508', 'https://openalex.org/W265666130', 'https://openalex.org/W2566595133', 'https://openalex.org/W2557365628', 'https://openalex.org/W2293341947', 'https://openalex.org/W2167816279', 'https://openalex.org/W2131798840', 'https://openalex.org/W2119369563', 'https://openalex.org/W2118511388', 'https://openalex.org/W2028930979', 'https://openalex.org/W2007512406', 'https://openalex.org/W1976714922', 'https://openalex.org/W187410065', 'https://openalex.org/W1606750476', 'https://openalex.org/W1579803260'], 'abstract_inverted_index': None, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2942449404', 'counts_by_year': [], 'updated_date': '2024-09-15T14:09:32.193311', 'created_date': '2019-05-03'}