{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:40:59Z","timestamp":1757544059296},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90272-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"281-287","source":"Crossref","is-referenced-by-count":3,"title":["The visually distinct configurations of k sets"],"prefix":"10.1016","volume":"33","author":[{"given":"James F.","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90272-7_BIB1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(77)90116-9","article-title":"The number of finite relational structures","volume":"19","author":"Fagin","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90272-7_BIB2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(81)90272-7_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0097-3165(75)90095-3","article-title":"An asymptotic formula for the number of classes of sets of n indistinguishable elements","volume":"19","author":"Lynch","year":"1975","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(81)90272-7_BIB4","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1090\/S0002-9904-1972-13097-0","article-title":"The number of unlabelled graphs with many nodes and edges","volume":"78","author":"Wright","year":"1972","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902727?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902727?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T12:21:48Z","timestamp":1554898908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902727"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90272-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}