{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:07Z","timestamp":1759063687616},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1988,4]]},"DOI":"10.1016\/0095-8956(88)90087-1","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:35:48Z","timestamp":1103661348000},"page":"187-200","source":"Crossref","is-referenced-by-count":5,"title":["Hypomorphisms, orbits, and reconstruction"],"prefix":"10.1016","volume":"44","author":[{"given":"W.L","family":"Kocay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90087-1_BIB1","author":"Bondy","year":"1976"},{"key":"10.1016\/0095-8956(88)90087-1_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.3190010306","article-title":"Graph reconstruction\u2014A survey","volume":"1","author":"Bondy","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(88)90087-1_BIB3","series-title":"Graph reconstruction","author":"Bondy","year":"1984"},{"key":"10.1016\/0095-8956(88)90087-1_BIB4","doi-asserted-by":"crossref","unstructured":"W. L. Kocay, On Stockmeyer's non-reconstructible tournaments, J. Graph Theory, in press.","DOI":"10.1002\/jgt.3190090406"},{"key":"10.1016\/0095-8956(88)90087-1_BIB5","unstructured":"W. L. Kocay, A family of non-reconstructible hypergraphs, submitted for publication."},{"key":"10.1016\/0095-8956(88)90087-1_BIB6","series-title":"Selected Topics in Graph Theory","first-page":"205","article-title":"The reconstruction problem","author":"Nash-Williams","year":"1978"},{"key":"10.1016\/0095-8956(88)90087-1_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.3190010108","article-title":"The falsity of the reconstruction conjecture for tournaments","volume":"1","author":"Stockmeyer","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(88)90087-1_BIB8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0095-8956(81)80027-5","article-title":"A census of non-reconstructible digraphs. I","volume":"31","author":"Stockmeyer","year":"1981","journal-title":"J. Combin Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900871?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900871?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T15:51:50Z","timestamp":1548863510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["0095895688900871"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90087-1","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}