{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:01:52Z","timestamp":1773158512571,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-1600592"],"award-info":[{"award-number":["DMS-1600592"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-01-00353A"],"award-info":[{"award-number":["18-01-00353A"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["19-01-00682"],"award-info":[{"award-number":["19-01-00682"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871439"],"award-info":[{"award-number":["11871439"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971439"],"award-info":[{"award-number":["11971439"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/tit.2020.2983678","type":"journal-article","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T20:03:53Z","timestamp":1585339433000},"page":"3278-3286","source":"Crossref","is-referenced-by-count":9,"title":["On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting \u2113 Vertices"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6363-3804","authenticated-orcid":false,"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8818-1667","authenticated-orcid":false,"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"281","article-title":"Finite graphs and digraphs which are not reconstructible from their large cardinality restricted subraphs","volume":"22","author":"n\u00fddl","year":"1981","journal-title":"Comment Math Univ Carolin"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90053-I"},{"key":"ref33","first-page":"289","article-title":"On pairs of graphs having $n-2$ cards in common","volume":"124","author":"monikandan","year":"2016","journal-title":"Ars Combin"},{"key":"ref32","first-page":"85","article-title":"Graph reconstruction numbers","volume":"62","author":"mcmullen","year":"2007","journal-title":"J Combin Math Combin Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(74)90064-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2002.10697932"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140203"},{"key":"ref36","first-page":"123","article-title":"The ally-reconstruction number of a disconnected graph","volume":"28","author":"myrvold","year":"1989","journal-title":"Ars Combin"},{"key":"ref35","article-title":"Ally and adversary reconstruction problems","author":"myrvold","year":"1988"},{"key":"ref34","first-page":"709","article-title":"Probabilistic reconstruction from subgraphs","volume":"17","author":"m\u00fcller","year":"1976","journal-title":"Comment Math Univ Carolinae"},{"key":"ref28","first-page":"1525","article-title":"Deux résultats concernant la détermination d’une relation par les types d’isomorphie de ses restrictions","volume":"274","author":"lopez","year":"1972","journal-title":"C R Acad Sci Paris"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.11.016"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19780241905"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140102"},{"key":"ref1","first-page":"443","article-title":"A survey of some open questions in reconstruction numbers","volume":"97","author":"asciak","year":"2010","journal-title":"Ars Combin"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/12089332X"},{"key":"ref22","article-title":"3-regular graphs are 2-reconstructible","author":"kostochka","year":"0","journal-title":"Eur J Combinatorics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-020-02131-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316669846"},{"key":"ref23","first-page":"77","article-title":"Pseudosimilarity in graphs—A survey","volume":"46","author":"lauri","year":"1997","journal-title":"Ars Combin"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.09.027"},{"key":"ref25","first-page":"257","article-title":"New problems of graph reconstruction","volume":"71","author":"levenshtein","year":"2005","journal-title":"Bayreut Math Schr"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010108"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90035-G"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.06.015"},{"key":"ref52","article-title":"A collection of mathematical problems","volume":"8","author":"ulam","year":"1960","journal-title":"Interscience Tracts in Pure and Applied Mathematics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.08.026"},{"key":"ref11","first-page":"44","article-title":"Some additions to an article by B. Manvel: Some basic observations on Kellys conjecture for graphs","author":"zh chernyak","year":"1982","journal-title":"Vestsi Akad Navuk BSSR Ser Fiz -Math"},{"key":"ref40","first-page":"243","article-title":"Some results concerning reconstruction conjecture","author":"n\u00fddl","year":"1984","journal-title":"Rend Circ Mat Palermo"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0059425"},{"key":"ref13","first-page":"313","article-title":"L’Intervalle en théorie des relations, ses généralisations, filtre intervallaire et clôture d’une relation","author":"fra\u00efss\u00e9","year":"1984","journal-title":"Orders description and roles"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90046-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01838185"},{"key":"ref16","article-title":"Size reconstructibility of graphs","author":"groenland","year":"2018","journal-title":"arXiv 1807 11733"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090403"},{"key":"ref18","article-title":"On isometric transformations","author":"kelly","year":"1942"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.961"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010306"},{"key":"ref3","first-page":"221","article-title":"A graph reconstructor’s manual","author":"bondy","year":"1991","journal-title":"Surveys in Combinatorics"},{"key":"ref6","first-page":"117","article-title":"The mathematics of Gérard Lopez and Maurice Pouzet","volume":"27","author":"boudabbous","year":"2016","journal-title":"J Mult -Valued Log Soft-Comput"},{"key":"ref5","first-page":"51","article-title":"Reconstruction by enumeration—Some applications of a counting theorem to the graph reconstruction problem","author":"bondy","year":"1978","journal-title":"Proc Problèmes Combinatoires et Théorie Des Graphes Colloq Internat"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1002\/jgt.20415","article-title":"Families of pairs of graphs with a large number of common cards","volume":"63","author":"bowler","year":"2010","journal-title":"J Graph Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.08.016"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"296","DOI":"10.4169\/amer.math.monthly.123.3.296","article-title":"Problems and solutions","volume":"123","author":"stanley","year":"2016","journal-title":"Amer Math Monthly"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20531"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF01387756"},{"key":"ref45","first-page":"213","article-title":"Pairs of graphs having $n-2$ cards in common","volume":"112","author":"ramachandran","year":"2013","journal-title":"Ars Combin"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22409"},{"key":"ref47","first-page":"303","article-title":"Multi-vertex deletion graph reconstruction numbers","volume":"78","author":"rivshin","year":"2011","journal-title":"J Combin Math Combin Comput"},{"key":"ref42","first-page":"71","article-title":"A note on reconstructing finite tree from small subtrees","volume":"31","author":"n\u00fddl","year":"1990","journal-title":"Acta Univ Carolina Math Phys"},{"key":"ref41","first-page":"71","article-title":"Reconstructing equivalences","author":"n\u00fddl","year":"1985","journal-title":"Rend Circ Mat Palermo"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00287-9"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90689-D"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9437276\/9049107-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9437276\/09049107.pdf?arnumber=9049107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T00:17:38Z","timestamp":1722644258000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9049107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":53,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2983678","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}