{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T21:29:55Z","timestamp":1695418195579},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5674,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1993,3]]},"abstract":"<jats:p>In this paper we prove that given a finite collection of finite graphs, and the subsets of vertices of a random graph <jats:italic>G<\/jats:italic> that induce those graphs, it is almost always possible to uniquely reconstruct a class of graphs equivalent to <jats:italic>G<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s0963548300000444","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:18:20Z","timestamp":1221218300000},"page":"1-9","source":"Crossref","is-referenced-by-count":6,"title":["A Theorem on Reconstruction of Random Graphs"],"prefix":"10.1017","volume":"2","author":[{"given":"Peter J.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cleide","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S0963548300000444_ref008","volume-title":"Accademia Nazionale dei Lincei Atti dei Convegni Lincei 17","author":"Seidel","year":"1973"},{"key":"S0963548300000444_ref007","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"S0963548300000444_ref004","doi-asserted-by":"publisher","DOI":"10.1017\/S0022481200051756"},{"key":"S0963548300000444_ref001","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030305"},{"key":"S0963548300000444_ref003","volume-title":"London Math. Soc. Lecture Note Series","volume":"152","author":"Cameron","year":"1990"},{"key":"S0963548300000444_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90022-0"},{"key":"S0963548300000444_ref009","doi-asserted-by":"publisher","DOI":"10.2307\/2274912"},{"key":"S0963548300000444_ref005","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1959.11989408"},{"key":"S0963548300000444_ref002","first-page":"65","volume-title":"Graph Theory and Combinatorics","author":"Cameron","year":"1984"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548300000444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:45:42Z","timestamp":1557963942000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548300000444\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["S0963548300000444"],"URL":"https:\/\/doi.org\/10.1017\/s0963548300000444","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}