{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:13:44Z","timestamp":1648883624244},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,4,13]],"date-time":"2013-04-13T00:00:00Z","timestamp":1365811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10472-013-9349-7","type":"journal-article","created":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T04:07:08Z","timestamp":1365739628000},"page":"125-138","source":"Crossref","is-referenced-by-count":0,"title":["A model for learning the news in social networks"],"prefix":"10.1007","volume":"73","author":[{"given":"Krishnan","family":"Rajagopalan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,13]]},"reference":[{"key":"9349_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R Cori","year":"1993","unstructured":"Cori, R., Metivier, Y.: Asynchronous mappings and asynchronous cellular automata. Inf. Comput. 106, 159\u2013202 (1993)","journal-title":"Inf. Comput."},{"key":"9349_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/eujc.1993.1013","volume":"14","author":"R Cori","year":"1993","unstructured":"Cori, R., Sopena, E.: Some combinatorial aspects of time-stamp systems. European J. Combin. 14, 95\u2013102 (1993)","journal-title":"European J. Combin."},{"key":"9349_CR3","doi-asserted-by":"crossref","unstructured":"Dolev, D., Shavit, N.: Bounded concurrent time-stamps are constructible. In: Proc. of 21th Annual ACM Symposium on Theory of Computing, pp.\u00a0454\u2013466 (1989)","DOI":"10.21236\/ADA213853"},{"key":"9349_CR4","doi-asserted-by":"crossref","unstructured":"Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping or bounded concurrent time-stamps are comprehensible. In: Proc. of 24th Annual ACM Symposium on Theory of Computing, pp.\u00a0655\u2013666 (1992)","DOI":"10.1145\/129712.129776"},{"key":"9349_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F., Wijsen, J.: Determining the currency of data. In: Proc. of the 30th ACM Symposium on Principles of Database Systems, pp.\u00a071\u201382 (2011)","DOI":"10.1145\/1989284.1989295"},{"key":"9349_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319\u2013349 (1988)","journal-title":"Networks"},{"key":"9349_CR7","doi-asserted-by":"crossref","unstructured":"Israeli, A., Li, M.: Bounded time-stamps. In: Proc. of 28th IEEE Conference on Foundations of Computer Science, pp.\u00a0371\u2013382 (1987)","DOI":"10.1109\/SFCS.1987.10"},{"issue":"3","key":"9349_CR8","doi-asserted-by":"crossref","first-page":"036117","DOI":"10.1103\/PhysRevE.76.036117","volume":"76","author":"PG Lind","year":"2007","unstructured":"Lind, P.G., da\u00a0Silva, L.R., Andrade, J.S., Jr, Herrmann, H.J.: Spreading gossip in social networks. Phys. Rev. E 76(3), 036117 (2007)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"9349_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s004460050031","volume":"10","author":"M Mukund","year":"1997","unstructured":"Mukund, M., Sohoni, M.: Keeping track of the latest gossip in a distributed system. Distrib. Comput. 10(3), 137\u2013148 (1997)","journal-title":"Distrib. Comput."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9349-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9349-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9349-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T09:13:10Z","timestamp":1562922790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9349-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,13]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9349"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9349-7","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,13]]}}}