{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:55Z","timestamp":1760245015786},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90156-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"323-328","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Lower bounds on communication overlap of networks"],"prefix":"10.1016","volume":"47","author":[{"given":"J.W.","family":"Hong","sequence":"first","affiliation":[]},{"given":"Q.","family":"Zuo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90156-8_BIB1","series-title":"Proc. 6th IEEE Symp. on Switching Circuit Theory and Logical Design","article-title":"Memory bound for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/0304-3975(86)90156-8_BIB2","series-title":"Proc. Conf. on Theoretical Computer Science","first-page":"1","article-title":"A separator theorem for planar graphs","author":"Lipton","year":"1977"},{"key":"10.1016\/0304-3975(86)90156-8_BIB3","series-title":"Intern. Rept., STAN-CS-75-504","article-title":"On sparse graphs with dense long paths","author":"Erd\u00f6s","year":"1975"},{"issue":"12","key":"10.1016\/0304-3975(86)90156-8_BIB4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","article-title":"A survey of interconnection networks","volume":"14","author":"Feng","year":"1981","journal-title":"Computer"},{"issue":"1","key":"10.1016\/0304-3975(86)90156-8_BIB5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Commun. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901568?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901568?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:53:15Z","timestamp":1553172795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":5,"alternative-id":["0304397586901568"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90156-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}