{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T08:34:20Z","timestamp":1789547660072,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"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":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767421","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:28:49Z","timestamp":1437139729000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Randomized Proof-Labeling Schemes"],"prefix":"10.1145","author":[{"given":"Mor","family":"Baruch","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"CNRS and Univ. Paris Diderot, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00286-1"},{"key":"e_1_3_2_1_2_1","first-page":"689","volume-title":"14th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Alstrup S.","year":"2003","unstructured":"S. Alstrup , P. Bille , and T. Rauhe . Labeling schemes for small distances in trees . In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 689 -- 698 , 2003 . S. Alstrup, P. Bille, and T. Rauhe. Labeling schemes for small distances in trees. In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 689--698, 2003."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564914"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652151"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12340-0_2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2718693.2718703"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185378"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11764-5_2"},{"key":"e_1_3_2_1_9_1","first-page":"937","volume-title":"13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 937--946, 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684110"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696161"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584031"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499228"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0188-x"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11164-3_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740493"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00374-9"},{"key":"e_1_3_2_1_19_1","first-page":"210","volume-title":"12th ACM Symposium on Discrete Algorithms (SODA)","author":"Gavoille C.","year":"2001","unstructured":"C. Gavoille , D. Peleg , S. Perennes , and R. Raz . Distance labeling in graphs . In 12th ACM Symposium on Discrete Algorithms (SODA) , pages 210 -- 219 , 2001 . C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In 12th ACM Symposium on Discrete Algorithms (SODA), pages 210--219, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993829"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365691"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645933.673351"},{"key":"e_1_3_2_1_25_1","first-page":"927","volume-title":"13th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Katz M.","year":"2002","unstructured":"M. Katz , N. A. Katz , A. Korman , and D. Peleg . Labeling schemes for flow and connectivity . In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 927 -- 936 , 2002 . M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 927--936, 2002."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.03.005"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721855"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0025-1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993866"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9226-7"},{"key":"e_1_3_2_1_32_1","volume-title":"Communication complexity","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and N. Nisan . Communication complexity . Cambridge University Press , 1997 . E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_33_1","volume-title":"Computational Complexity","author":"Papadimitriou C. H.","year":"1994","unstructured":"C. H. Papadimitriou . Computational Complexity . Addison Wesley Longman , 1994 . C. H. Papadimitriou. Computational Complexity. Addison Wesley Longman, 1994."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/647680.732175"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.015"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875578"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"}],"event":{"name":"PODC '15: ACM Symposium on Principles of Distributed Computing","location":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":37,"alternative-id":["10.1145\/2767386.2767421","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767421","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}