{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:46:08Z","timestamp":1761806768268},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0304-3975(96)00204-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"283-292","source":"Crossref","is-referenced-by-count":22,"title":["On-line chain partitions of orders"],"prefix":"10.1016","volume":"175","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00204-6_BIB1","first-page":"63","article-title":"An effective version of Dilworth theorem","volume":"268","author":"Kierstead","year":"1981","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(96)00204-6_BIB2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/conm\/057\/856233","article-title":"Recursive ordered sets","volume":"57","author":"Kierstead","year":"1986","journal-title":"Contemp. Math."},{"key":"10.1016\/S0304-3975(96)00204-6_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00396274","article-title":"A theory of recursive dimension for ordered sets","volume":"1","author":"Kierstead","year":"1984","journal-title":"Order"},{"key":"10.1016\/S0304-3975(96)00204-6_BIB4","series-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"Trotter","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:57:30Z","timestamp":1555419450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0304397596002046"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00204-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}