Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W4249743500', 'doi': 'https://doi.org/10.1002/jgt.20424', 'title': 'Reconstructing trees from two cards', 'display_name': 'Reconstructing trees from two cards', 'publication_year': 2009, 'publication_date': '2009-05-11', 'ids': {'openalex': 'https://openalex.org/W4249743500', 'doi': 'https://doi.org/10.1002/jgt.20424'}, 'language': 'en', 'primary_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.1002/jgt.20424', 'pdf_url': 'https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.20424', 'source': {'id': 'https://openalex.org/S193368155', 'display_name': 'Journal of Graph Theory', 'issn_l': '0364-9024', 'issn': ['0364-9024', '1097-0118'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320595', 'host_organization_name': 'Wiley', 'host_organization_lineage': ['https://openalex.org/P4310320595'], 'host_organization_lineage_names': ['Wiley'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'type': 'article', 'type_crossref': 'journal-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': True, 'oa_status': 'bronze', 'oa_url': 'https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.20424', 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5027424005', 'display_name': 'Manuel Welhan', 'orcid': None}, 'institutions': [], 'countries': [], 'is_corresponding': True, 'raw_author_name': 'Manuel Welhan', 'raw_affiliation_strings': [], 'affiliations': []}], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': ['https://openalex.org/A5027424005'], 'corresponding_institution_ids': [], 'apc_list': {'value': 3760, 'currency': 'USD', 'value_usd': 3760, 'provenance': 'doaj'}, 'apc_paid': None, 'fwci': 0.334, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 1, 'citation_normalized_percentile': {'value': 0.431264, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 64, 'max': 71}, 'biblio': {'volume': '63', 'issue': '3', 'first_page': '243', 'last_page': '257'}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9998, '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/T10374', 'display_name': 'Graph Theory and Algorithms', 'score': 0.9998, '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/T12541', 'display_name': 'Graph Labeling and Dimension Problems', 'score': 0.9979, '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/T11797', 'display_name': 'Optical Code Division Multiple Access', 'score': 0.9968, 'subfield': {'id': 'https://openalex.org/subfields/2208', 'display_name': 'Electrical and Electronic Engineering'}, 'field': {'id': 'https://openalex.org/fields/22', 'display_name': 'Engineering'}, 'domain': {'id': 'https://openalex.org/domains/3', 'display_name': 'Physical Sciences'}}], 'keywords': [{'id': 'https://openalex.org/keywords/tree', 'display_name': 'Tree (set theory)', 'score': 0.5936031}, {'id': 'https://openalex.org/keywords/graph-labeling', 'display_name': 'Graph Labeling', 'score': 0.479138}], 'concepts': [{'id': 'https://openalex.org/C114614502', 'wikidata': 'https://www.wikidata.org/wiki/Q76592', 'display_name': 'Combinatorics', 'level': 1, 'score': 0.79796934}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.74050856}, {'id': 'https://openalex.org/C2780990831', 'wikidata': 'https://www.wikidata.org/wiki/Q319141', 'display_name': 'Conjecture', 'level': 2, 'score': 0.6989396}, {'id': 'https://openalex.org/C80899671', 'wikidata': 'https://www.wikidata.org/wiki/Q1304193', 'display_name': 'Vertex (graph theory)', 'level': 3, 'score': 0.66013646}, {'id': 'https://openalex.org/C113174947', 'wikidata': 'https://www.wikidata.org/wiki/Q2859736', 'display_name': 'Tree (set theory)', 'level': 2, 'score': 0.5936031}, {'id': 'https://openalex.org/C2778966251', 'wikidata': 'https://www.wikidata.org/wiki/Q208123', 'display_name': 'Deck', 'level': 2, 'score': 0.59089446}, {'id': 'https://openalex.org/C132525143', 'wikidata': 'https://www.wikidata.org/wiki/Q141488', 'display_name': 'Graph', 'level': 2, 'score': 0.53048617}, {'id': 'https://openalex.org/C118615104', 'wikidata': 'https://www.wikidata.org/wiki/Q121416', 'display_name': 'Discrete mathematics', 'level': 1, 'score': 0.43676585}, {'id': 'https://openalex.org/C2777212361', 'wikidata': 'https://www.wikidata.org/wiki/Q5127848', 'display_name': 'Class (philosophy)', 'level': 2, 'score': 0.4182223}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.21023935}, {'id': 'https://openalex.org/C154945302', 'wikidata': 'https://www.wikidata.org/wiki/Q11660', 'display_name': 'Artificial intelligence', 'level': 1, 'score': 0.139525}, {'id': 'https://openalex.org/C66938386', 'wikidata': 'https://www.wikidata.org/wiki/Q633538', 'display_name': 'Structural engineering', 'level': 1, 'score': 0.0}, {'id': 'https://openalex.org/C127413603', 'wikidata': 'https://www.wikidata.org/wiki/Q11023', 'display_name': 'Engineering', 'level': 0, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': True, 'landing_page_url': 'https://doi.org/10.1002/jgt.20424', 'pdf_url': 'https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.20424', 'source': {'id': 'https://openalex.org/S193368155', 'display_name': 'Journal of Graph Theory', 'issn_l': '0364-9024', 'issn': ['0364-9024', '1097-0118'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320595', 'host_organization_name': 'Wiley', 'host_organization_lineage': ['https://openalex.org/P4310320595'], 'host_organization_lineage_names': ['Wiley'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}], 'best_oa_location': {'is_oa': True, 'landing_page_url': 'https://doi.org/10.1002/jgt.20424', 'pdf_url': 'https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/jgt.20424', 'source': {'id': 'https://openalex.org/S193368155', 'display_name': 'Journal of Graph Theory', 'issn_l': '0364-9024', 'issn': ['0364-9024', '1097-0118'], 'is_oa': False, 'is_in_doaj': False, 'is_core': True, 'host_organization': 'https://openalex.org/P4310320595', 'host_organization_name': 'Wiley', 'host_organization_lineage': ['https://openalex.org/P4310320595'], 'host_organization_lineage_names': ['Wiley'], 'type': 'journal'}, 'license': None, 'license_id': None, 'version': 'publishedVersion', 'is_accepted': True, 'is_published': True}, 'sustainable_development_goals': [{'score': 0.59, 'display_name': 'Sustainable cities and communities', 'id': 'https://metadata.un.org/sdg/11'}], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 10, 'referenced_works': ['https://openalex.org/W1984659116', 'https://openalex.org/W1985195383', 'https://openalex.org/W1986840405', 'https://openalex.org/W2003824380', 'https://openalex.org/W2066583939', 'https://openalex.org/W2075084424', 'https://openalex.org/W2078587865', 'https://openalex.org/W2125649835', 'https://openalex.org/W2317491378', 'https://openalex.org/W2331385464'], 'related_works': ['https://openalex.org/W4311866332', 'https://openalex.org/W4235740172', 'https://openalex.org/W4200226287', 'https://openalex.org/W24630749', 'https://openalex.org/W2360284406', 'https://openalex.org/W2320461077', 'https://openalex.org/W2115421759', 'https://openalex.org/W2090627601', 'https://openalex.org/W2029142719', 'https://openalex.org/W1985405103'], 'abstract_inverted_index': {'Abstract': [0], 'Let': [1], '𝒯': [2], 'be': [3, 45, 91], 'the': [4, 32, 57, 63, 99, 139], 'class': [5], 'of': [6, 13, 23, 51, 82, 102], 'unlabeled': [7, 10, 59], 'trees.': [8, 146], 'An': [9], 'vertex‐deleted': [11], 'subgraph': [12], 'a': [14, 19, 27, 36, 83, 105], 'tree': [15, 33, 60], 'T': [16, 34, 52, 55, 70, 89, 96, 110, 121, 129, 134], 'is': [17, 25, 56, 71, 86, 111, 117, 125], 'called': [18, 26], 'card.': [20], 'A': [21], 'collection': [22], 'cards': [24, 103], 'deck.': [28], 'We': [29, 76, 93, 136], 'say': [30, 68], 'that': [31, 61, 69, 109, 119, 127, 138], 'has': [35, 62], 'deck': [37, 64, 84, 106], 'D': [38, 43, 65, 74, 85, 107, 114], 'if': [39], 'each': [40], 'card': [41], 'in': [42, 104], 'can': [44], 'obtained': [46], 'by': [47], 'deleting': [48], 'distinct': [49], 'vertices': [50], '.': [53, 75, 115, 135], 'If': [54], 'only': [58], ',': [66], 'we': [67], '𝒯‐reconstructible': [72, 112], 'from': [73, 113], 'want': [77], 'to': [78, 90], 'know': [79], 'how': [80], 'large': [81], 'necessary': [87], 'for': [88, 131, 142], '𝒯‐reconstructible.': [92], 'define': [94], '𝒯rn(': [95, 120, 128], ')': [97], 'as': [98], 'minimum': [100], 'number': [101], 'such': [108], 'It': [116], 'known': [118], ')≤3,': [122], 'but': [123], 'it': [124], 'conjectured': [126], ')≤2': [130], 'all': [132, 143], 'trees': [133], 'prove': [137], 'conjecture': [140], 'holds': [141], 'homeomorphically': [144], 'irreducible': [145], '©': [147], '2009': [148], 'Wiley': [149], 'Periodicals,': [150], 'Inc.': [151], 'J': [152], 'Graph': [153], 'Theory': [154], '63:': [155], '243–257,': [156], '2010': [157]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W4249743500', 'counts_by_year': [], 'updated_date': '2024-09-18T20:55:01.648115', 'created_date': '2022-05-12'}