{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:44:43Z","timestamp":1648982683835},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90032-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"215-219","source":"Crossref","is-referenced-by-count":9,"title":["A geometric construction of a superconcentrator of depth 2"],"prefix":"10.1016","volume":"32","author":[{"given":"Roy","family":"Meshulam","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90032-X_BIB1","first-page":"421","article-title":"On a combinatorial problem","volume":"10","author":"de Bruijin","year":"1948","journal-title":"Indagationes Math."},{"key":"10.1016\/0304-3975(84)90032-X_BIB2","series-title":"Combinatorial Problems and Exercises","author":"Lovasz","year":"1979"},{"key":"10.1016\/0304-3975(84)90032-X_BIB3","doi-asserted-by":"crossref","unstructured":"R. Meshulam, On multi-coloured lines in a linear space, J. Combin. Theory Ser. A, to appear.","DOI":"10.1016\/0097-3165(85)90053-6"},{"key":"10.1016\/0304-3975(84)90032-X_BIB4","first-page":"82","article-title":"Superconcentrators of depth 2","volume":"24","author":"Pippenger","year":"1982","journal-title":"JCSS"},{"key":"10.1016\/0304-3975(84)90032-X_BIB5","author":"Pippenger","year":"1983","journal-title":"Explicit construction of highly expanding graphs"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490032X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490032X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:11Z","timestamp":1555127471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758490032X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["030439758490032X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90032-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}