{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:38Z","timestamp":1750307678212,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":0,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1145\/1544012.1544018","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"1-12","source":"Crossref","is-referenced-by-count":5,"title":["EGOIST"],"prefix":"10.1145","author":[{"given":"Georgios","family":"Smaragdakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Lekakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Laoutaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azer","family":"Bestavros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Byers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mema","family":"Roussopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","event":{"number":"4","sponsor":["ACM, Association for Computing Machinery","ACM SIGCOMM"],"acronym":"CONEXT '08","name":"the 2008 ACM CoNEXT Conference","start":{"date-parts":[[2008,12,9]]},"location":"Madrid, Spain","end":{"date-parts":[[2008,12,12]]}},"container-title":["Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1544012.1544018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=1544018&ftid=645348&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:43Z","timestamp":1750253383000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=1544012.1544018"}},"subtitle":["overlay routing using selfish neighbor selection"],"short-title":[],"issued":{"date-parts":[[2008]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1145\/1544012.1544018","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}