{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:19:08Z","timestamp":1743056348181,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745799"},{"type":"electronic","value":"9783031745805"}],"license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74580-5_14","type":"book-chapter","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T15:35:49Z","timestamp":1735227349000},"page":"188-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Decreasing Verification Radius in\u00a0Local Certification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-0898","authenticated-orcid":false,"given":"Laurent","family":"Feuilloley","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9329-1000","authenticated-orcid":false,"given":"Jan","family":"Janou\u0161ek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6657-0020","authenticated-orcid":false,"given":"Jan Maty\u00e1\u0161","family":"K\u0159i\u0161\u0165an","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7429-2937","authenticated-orcid":false,"given":"Josef Erik","family":"Sedl\u00e1\u010dek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2019). https:\/\/doi.org\/10.2200\/S00908ED1V01Y201903DCT015","DOI":"10.2200\/S00908ED1V01Y201903DCT015"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ard\u00e9vol\u00a0Mart\u00ednez, V., Caoduro, M., Feuilloley, L., Narboni, J., Pournajafi, P., Raymond, J.-F.: Lower bound for constant-size local certification. In: International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pp. 239\u2013253. Springer (2022)","DOI":"10.1007\/978-3-031-21017-4_16"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.tcs.2018.08.020","volume":"811","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel, K., Paz, A., Perry, M.: Approximate proof-labeling schemes. Theor. Comput. Sci. 811, 112\u2013124 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-Stabilization. MIT Press (2000). http:\/\/www.cs.bgu.ac.il\/%7Edolev\/book\/book.html","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Feuilloley, L.: Introduction to local certification. Discrete Math. Theor. Comput. Sci. 23 (2021). (Distributed Computing and Networking)","DOI":"10.46298\/dmtcs.6280"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/S00446-020-00386-Z","volume":"34","author":"L Feuilloley","year":"2021","unstructured":"Feuilloley, L., Fraigniaud, P., Hirvonen, J., Paz, A., Perry, M.: Redundancy in distributed proofs. Distrib. Comput. 34(2), 113\u2013132 (2021). https:\/\/doi.org\/10.1007\/S00446-020-00386-Z","journal-title":"Distrib. Comput."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., R\u00e9mila, \u00c9., Todinca, I.: Local certification of graphs with bounded genus. Discrete Appl. Math. 325, 9\u201336 (2023). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X22003833. https:\/\/doi.org\/10.1016\/j.dam.2022.10.004","DOI":"10.1016\/j.dam.2022.10.004"},{"key":"14_CR8","unstructured":"Feuilloley, L., Janou\u0161ek, J., K\u0159i\u0161\u0165an, J.M., Sedl\u00e1\u010dek, J.E.: Decreasing verification radius in local certification. arXiv preprint https:\/\/arxiv.org\/abs\/2408.10757 (2024)"},{"key":"14_CR9","unstructured":"Fischer, O., Oshman, R., Shamir, D.: Explicit space-time tradeoffs for proof labeling schemes in graphs with small separators. In: 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., G\u00f6\u00f6s, M., Korman, A., Suomela, J.: What can be decided locally without identifiers? In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, pp. 157\u2013165 (2013)","DOI":"10.1145\/2484239.2484264"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2017.01.011","volume":"751","author":"P Fraigniaud","year":"2018","unstructured":"Fraigniaud, P., Hirvonen, J., Suomela, J.: Node labels in local decision. Theor. Comput. Sci. 751, 61\u201373 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2499228","volume":"60","author":"P Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM (JACM) 60(5), 1\u201326 (2013)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"14_CR13","first-page":"1","volume":"12","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Suomela, J.: Locally checkable proofs in distributed computing. Theory Comput. 12(1), 1\u201333 (2016)","journal-title":"Theory Comput."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Korman, A., Kutten, S.: Distributed verification of minimum spanning trees. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1146381.1146389","DOI":"10.1145\/1146381.1146389"},{"issue":"4","key":"14_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/S00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215\u2013233 (2010). https:\/\/doi.org\/10.1007\/S00446-010-0095-3","journal-title":"Distrib. Comput."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Perry, M., Rosenbaum, W.: Space-time tradeoffs for distributed verification. In: Das, S., Tixeuil, S. (eds.) Structural Information and Communication Complexity, pp. 53\u201370. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-72050-0_4"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74580-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T16:03:22Z","timestamp":1735229002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74580-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"ISBN":["9783031745799","9783031745805"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74580-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algowin\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}