{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:12Z","timestamp":1781077692631,"version":"3.54.1"},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"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":11430,"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":[[1982,4]]},"DOI":"10.1016\/0304-3975(82)90113-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"89-93","source":"Crossref","is-referenced-by-count":10,"title":["A family of graphs with expensive depth-reduction"],"prefix":"10.1016","volume":"18","author":[{"given":"Georg","family":"Schnitger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90113-X_BIB1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0898-1221(75)90037-1","article-title":"On sparse graphs with dense long paths","volume":"1","author":"Erd\u00f6s","year":"1977","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0304-3975(82)90113-X_BIB2","unstructured":"W.J. Paul and R. Reischuk, A graph theoretical approach to determinism versus nondeterminism, Acta Informat., to appear."},{"key":"10.1016\/0304-3975(82)90113-X_BIB3","article-title":"Graph-theoretic arguments in low-level complexity","author":"Valiant","year":"1978","journal-title":"Proc. 6th Symposium on Mathematical Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290113X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290113X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:15Z","timestamp":1555111575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758290113X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["030439758290113X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90113-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}