{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:13Z","timestamp":1750307893893,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T00:00:00Z","timestamp":1219017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,18]]},"DOI":"10.1145\/1400751.1400806","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T12:38:39Z","timestamp":1219149519000},"page":"415-415","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Forget him and keep on moving"],"prefix":"10.1145","author":[{"given":"Augustin","family":"Chaintreau","sequence":"first","affiliation":[{"name":"Thomson, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"CNRS and University Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuelle","family":"Lebhar","sequence":"additional","affiliation":[{"name":"CNRS and University Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397752"},{"key":"e_1_3_2_1_3_1","volume-title":"How do networks become navigable? arxiv:cond-mat\/0309415v2","author":"Clauset A.","year":"2003","unstructured":"A. Clauset and C. Moore . How do networks become navigable? arxiv:cond-mat\/0309415v2 , 2003 . A. Clauset and C. Moore. How do networks become navigable? arxiv:cond-mat\/0309415v2, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_5_1","volume-title":"The evolution of navigable small-world networks. arXiv:cs\/0607025v1","author":"Sandberg O.","year":"2007","unstructured":"O. Sandberg and I. Clarke . The evolution of navigable small-world networks. arXiv:cs\/0607025v1 , 2007 . O. Sandberg and I. Clarke. The evolution of navigable small-world networks. arXiv:cs\/0607025v1, 2007."}],"event":{"name":"PODC '08: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Toronto Canada","acronym":"PODC '08"},"container-title":["Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1400751.1400806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:23Z","timestamp":1750258043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,18]]},"references-count":5,"alternative-id":["10.1145\/1400751.1400806","10.1145\/1400751"],"URL":"https:\/\/doi.org\/10.1145\/1400751.1400806","relation":{},"subject":[],"published":{"date-parts":[[2008,8,18]]},"assertion":[{"value":"2008-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}