{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:03Z","timestamp":1759638123497,"version":"3.37.3"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T00:00:00Z","timestamp":1535414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["285721"],"award-info":[{"award-number":["285721"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French Agence Nationale de la Recherche"},{"DOI":"10.13039\/501100014350","name":"Gran Sasso Science Institute","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014350","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100012950","name":"Institut National de Recherche en Informatique et en Automatique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012950","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5,1]]},"DOI":"10.1093\/comjnl\/bxy089","type":"journal-article","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T19:10:06Z","timestamp":1533150606000},"page":"730-746","source":"Crossref","is-referenced-by-count":2,"title":["Certification of Compact Low-Stretch Routing Schemes"],"prefix":"10.1093","volume":"62","author":[{"given":"Alkida","family":"Balliu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Aalto University, Konemiehentie 2, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"IRIF, CNRS, University Paris Diderot, B\u00e2timent Sophie Germain, 8 Place Aur\u00e9lie Nemours, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,8,28]]},"reference":[{"year":"2006","author":"Abraham","key":"2019042411130899600_bxy089C1"},{"year":"2004","author":"Abraham","key":"2019042411130899600_bxy089C2"},{"year":"2003","author":"Arias","key":"2019042411130899600_bxy089C3"},{"year":"1989","author":"Awerbuch","key":"2019042411130899600_bxy089C4"},{"year":"2001","author":"Fraigniaud","key":"2019042411130899600_bxy089C5"},{"key":"2019042411130899600_bxy089C6","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","article-title":"Space-efficiency for routing schemes of stretch factor three","volume":"61","author":"Gavoille","year":"2001","journal-title":"J. Parallel Distrib. Comput."},{"year":"1988","author":"Peleg","key":"2019042411130899600_bxy089C7"},{"key":"2019042411130899600_bxy089C8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","article-title":"Labelling and implicit routing in networks","volume":"28","author":"Santoro","year":"1985","journal-title":"Comput. J."},{"year":"2001","author":"Thorup","key":"2019042411130899600_bxy089C9"},{"key":"2019042411130899600_bxy089C10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","article-title":"Proof labeling schemes","volume":"22","author":"Korman","year":"2010","journal-title":"Distrib. Comput."},{"key":"2019042411130899600_bxy089C11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/568438.568451","article-title":"Routing in distributed networks: overview and open problems","volume":"32","author":"Gavoille","year":"2001","journal-title":"SIGACT News"},{"key":"2019042411130899600_bxy089C12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","article-title":"Compact and localized distributed data structures","volume":"16","author":"Gavoille","year":"2003","journal-title":"Distrib. Comput."},{"year":"2002","author":"Fraigniaud","key":"2019042411130899600_bxy089C13"},{"year":"1996","author":"Gavoille","key":"2019042411130899600_bxy089C14"},{"year":"2013","author":"Chechik","key":"2019042411130899600_bxy089C15"},{"year":"1990","author":"Awerbuch","key":"2019042411130899600_bxy089C16"},{"year":"2013","author":"Schmid","key":"2019042411130899600_bxy089C17"},{"key":"2019042411130899600_bxy089C18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.tcs.2016.11.018","article-title":"Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in sdns","volume":"709","author":"F\u00f6rster","year":"2018","journal-title":"Theor. Comput. Sci."},{"year":"2015","author":"Baruch","key":"2019042411130899600_bxy089C19"},{"key":"2019042411130899600_bxy089C20","doi-asserted-by":"crossref","first-page":"35:1","DOI":"10.1145\/2499228","article-title":"Towards a complexity theory for local distributed computing","volume":"60","author":"Fraigniaud","year":"2013","journal-title":"J. ACM"},{"key":"2019042411130899600_bxy089C21","first-page":"1","article-title":"Locally checkable proofs in distributed computing","volume":"12","author":"G\u00f6\u00f6s","year":"2016","journal-title":"Theory Comput."},{"key":"2019042411130899600_bxy089C22","article-title":"Survey of distributed decision","volume":"119","author":"Feuilloley","year":"2016","journal-title":"Bull. EATCS"},{"volume-title":"Cryptography Engineering: Design Principles and Practical Applications","year":"2010","author":"Ferguson","key":"2019042411130899600_bxy089C23"},{"year":"1979","author":"Yao","key":"2019042411130899600_bxy089C24"},{"year":"2001","author":"Thorup","key":"2019042411130899600_bxy089C25"},{"year":"2017","author":"Balliu","key":"2019042411130899600_bxy089C26"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/62\/5\/730\/28518767\/bxy089.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T22:48:14Z","timestamp":1589928494000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/62\/5\/730\/5085053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,28]]},"references-count":26,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,8,28]]},"published-print":{"date-parts":[[2019,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy089","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2019,5]]},"published":{"date-parts":[[2018,8,28]]}}}