{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:50:06Z","timestamp":1782971406686,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","funder":[{"name":"National Nature Science Foundation of China","award":["62172207"],"award-info":[{"award-number":["62172207"]}]},{"name":"National Nature Science Foundation of China","award":["62332009"],"award-info":[{"award-number":["62332009"]}]},{"name":"Hunan Provincial Natural Science Foundation","award":["2024JJ5128"],"award-info":[{"award-number":["2024JJ5128"]}]},{"name":"New Cornerstone Science Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733561","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"264-267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3923-8464","authenticated-orcid":false,"given":"Sirui","family":"Bai","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1233-8546","authenticated-orcid":false,"given":"Xinyu","family":"Fu","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3705-4320","authenticated-orcid":false,"given":"Yuheng","family":"Wang","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7273-9873","authenticated-orcid":false,"given":"Yuyi","family":"Wang","sequence":"additional","affiliation":[{"name":"CRRC Zhuzhou Institute, Zhuzhou, China"},{"name":"Tengen Intelligence Institute, Zhuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2618-687X","authenticated-orcid":false,"given":"Chaodong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"},{"name":"New Cornerstone Science Laboratory, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Dan Alistarh. 2015. The Renaming Problem: Recent Developments and Open Questions. http:\/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/381\/361."},{"key":"e_1_3_2_1_2_1","volume-title":"Structural Information and Communication Complexity (SIROCCO '12)","author":"Alistarh Dan","unstructured":"Dan Alistarh, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. 2012. Early Deciding Synchronous Renaming in O(log(f)) Rounds or Less. In Structural Information and Communication Complexity (SIROCCO '12). Springer Berlin Heidelberg, 195\u2013206."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611499"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767420"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79158"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 34th International Symposium on Distributed Computing (DISC '20)","author":"Augustine John","year":"2020","unstructured":"John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, and Jared Saia. 2020. Scalable and secure computation among strangers: Message-competitive byzantine protocols. In Proceedings of the 34th International Symposium on Distributed Computing (DISC '20). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 31:1\u201331:19."},{"key":"e_1_3_2_1_7_1","volume-title":"William K Moses Jr, and Gopal Pandurangan","author":"Augustine John","year":"2024","unstructured":"John Augustine, William K Moses Jr, and Gopal Pandurangan. 2024. Awake complexity of distributed minimum spanning tree. In International Colloquium on Structural Information and Communication Complexity (SIROCCO '24). Springer, 45\u201363."},{"key":"e_1_3_2_1_8_1","volume-title":"Distributed graph coloring: Fundamentals and recent developments","author":"Barenboim Leonid","unstructured":"Leonid Barenboim and Michael Elkin. 2013. Distributed graph coloring: Fundamentals and recent developments. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2011.04.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00242-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484261"},{"key":"e_1_3_2_1_13_1","volume-title":"Order-Preserving Renaming in Synchronous Systems with Byzantine Faults. In IEEE 33rd International Conference on Distributed Computing Systems (ICDCS '13)","author":"Denysyuk Oksana","year":"2013","unstructured":"Oksana Denysyuk and Lu\u00eds Rodrigues. 2013. Order-Preserving Renaming in Synchronous Systems with Byzantine Faults. In IEEE 33rd International Conference on Distributed Computing Systems (ICDCS '13). IEEE, 276\u2013285."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.173"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538425"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11864219_2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0045-x"}],"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.3733561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:24Z","timestamp":1749824664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":18,"alternative-id":["10.1145\/3732772.3733561","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733561","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"}}]}}