{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:57Z","timestamp":1781259537944,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","funder":[{"name":"Ministry of Education, Singapore","award":["24-1323-A0001"],"award-info":[{"award-number":["24-1323-A0001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733503","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"99-109","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Local Certification on Graphs of Bounded Pathwidth"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8102-2895","authenticated-orcid":false,"given":"Dan Alden","family":"Baterisna","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/112007.112009"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_3_1","volume-title":"Optimal local certification on graphs of bounded pathwidth. arXiv preprint arXiv:2502.00676","author":"Baterisna Dan Alden","year":"2025","unstructured":"Dan Alden Baterisna and Yi-Jun Chang. 2025. Optimal local certification on graphs of bounded pathwidth. arXiv preprint arXiv:2502.00676 (2025)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50728-0_32"},{"key":"e_1_3_2_1_5_1","volume-title":"A partial k-arboretum of graphs with bounded treewidth. Theoretical computer science 209, 1\u20132","author":"Bodlaender Hans L","year":"1998","unstructured":"Hans L Bodlaender. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical computer science 209, 1\u20132 (1998), 1\u201345."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758777"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.104954"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.08.020"},{"key":"e_1_3_2_1_9_1","volume-title":"Eun Jung Kim, and Tom\u00e1\u0161 Masa\u0159\u00edk","author":"Cook Linda","year":"2025","unstructured":"Linda Cook, Eun Jung Kim, and Tom\u00e1\u0161 Masa\u0159\u00edk. 2025. A Tight Meta-theorem for LOCAL Certification of MSO2 Properties within Bounded Treewidth Graphs. arXiv preprint arXiv:2503.19671 (2025)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2022.105643"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.01.023"},{"key":"e_1_3_2_1_14_1","volume-title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"15","author":"Esperet Louis","year":"2022","unstructured":"Louis Esperet and Sergey Norin. 2022. Testability and Local Certification of Monotone Properties in Minor-Closed Classes. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 229), Miko\u0142aj Boja\u0144czyk, Emanuela Merelli, and David P. Woodruff (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 58:1\u201358:15."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.6280"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538416"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00823-w"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.10.004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2024.25"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-023-01185-1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0340-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2016.v012a019"},{"key":"e_1_3_2_1_23_1","volume-title":"International Colloquium on Structural Information and Communication Complexity (SIROCCO)","author":"Jauregui Benjamin","unstructured":"Benjamin Jauregui, Pedro Montealegre, and Ivan Rapaport. 2022. Distributed interactive proofs for the recognition of some geometric intersection graph classes. In International Colloquium on Structural Information and Communication Complexity (SIROCCO). Springer, 212\u2013233."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212771"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91081-5_26"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.67"},{"key":"e_1_3_2_1_28_1","volume-title":"Sparsity: graphs, structures, and algorithms","author":"Ne\u0161et\u0159il Jaroslav","unstructured":"Jaroslav Ne\u0161et\u0159il and Patrice Ossona De Mendez. 2012. Sparsity: graphs, structures, and algorithms. Vol. 28. Springer Science & Business Media."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0251-x"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2013"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:25:48Z","timestamp":1749824748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":33,"alternative-id":["10.1145\/3732772.3733503","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733503","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}