{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:26:18Z","timestamp":1772821578375,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11097,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1016\/s0019-9958(83)80004-7","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T11:12:14Z","timestamp":1115118734000},"page":"183-198","source":"Crossref","is-referenced-by-count":116,"title":["Succinct representations of graphs"],"prefix":"10.1016","volume":"56","author":[{"given":"Hana","family":"Galperin","sequence":"first","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(83)80004-7_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1979"},{"key":"10.1016\/S0019-9958(83)80004-7_bib2","series-title":"Proceedings, Third Annual STOC","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0019-9958(83)80004-7_bib3","series-title":"Ph.D. thesis","article-title":"Succinct Representations of Graphs","author":"Galperin","year":"1982"},{"key":"10.1016\/S0019-9958(83)80004-7_bib4","series-title":"Proceedings of SIGACT Conference","first-page":"310","article-title":"On some deterministic space complexity problems","author":"Hong","year":"1980"},{"key":"10.1016\/S0019-9958(83)80004-7_bib5","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0019-9958(83)80004-7_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T19:56:01Z","timestamp":1548532561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995883800047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["S0019995883800047"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80004-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}