{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:38:56Z","timestamp":1775403536551,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T00:00:00Z","timestamp":1125619200000},"content-version":"vor","delay-in-days":6760,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0097-3165(87)90037-9","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T23:49:18Z","timestamp":1107992958000},"page":"304-309","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Every finite distributive lattice is a set of stable matchings for a small stable marriage instance"],"prefix":"10.1016","volume":"44","author":[{"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[]},{"given":"Robert","family":"Irving","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Leather","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(87)90037-9_BIB1","series-title":"Lattice Theory","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0097-3165(87)90037-9_BIB2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0097-3165(84)90056-6","article-title":"Every finite distributive lattice is a set of stable matchings","volume":"37","author":"Blair","year":"1984","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/0097-3165(87)90037-9_BIB3","series-title":"Lattice Theory","author":"Gratzer","year":"1971"},{"key":"10.1016\/0097-3165(87)90037-9_BIB4","article-title":"Three Fast Algorithms for Four Problems in Stable Marriage","author":"Gusfield","year":"1985","journal-title":"Yale University Computer Science Technical Report No. 407"},{"key":"10.1016\/0097-3165(87)90037-9_BIB5","article-title":"The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments","author":"Gusfield","year":"1986","journal-title":"Yale University Computer Science Technical Report No. 482"},{"key":"10.1016\/0097-3165(87)90037-9_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0097-3165(87)90037-9_BIB7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0215048","article-title":"The complexity of counting stable marriages","volume":"15","author":"Irving","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0097-3165(87)90037-9_BIB8","series-title":"An efficient algorithm for the optimal stable marriage","author":"Irving","year":"1985"},{"key":"10.1016\/0097-3165(87)90037-9_BIB9","series-title":"Marriages Stables","author":"Knuth","year":"1976"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316587900379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316587900379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T18:16:46Z","timestamp":1757441806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316587900379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0097316587900379"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(87)90037-9","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Every finite distributive lattice is a set of stable matchings for a small stable marriage instance","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0097-3165(87)90037-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}