{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:51:23Z","timestamp":1747806683727},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00088-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"189-197","source":"Crossref","is-referenced-by-count":3,"title":["Better bounds for perpetual gossiping"],"prefix":"10.1016","volume":"75","author":[{"given":"A.D.","family":"Scott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00088-1_BIB1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","article-title":"A problem with telephones","volume":"2","author":"Bumby","year":"1981","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/S0166-218X(96)00088-1_BIB2","first-page":"xx + 488","article-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0166-218X(96)00088-1_BIB3","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1002\/net.3230180406","article-title":"A survey of broadcasting and gossiping on communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(96)00088-1_BIB4","doi-asserted-by":"crossref","unstructured":"A.L. Liestman and D. Richards, Perpetual gossiping, Parallel Processing, to appear.","DOI":"10.1142\/S0129626493000381"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:29Z","timestamp":1556666789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000881"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00088-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}