{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:26Z","timestamp":1749873986062,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733541","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"58-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Revisiting Lower Bounds for Two-Step Consensus"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4175-0361","authenticated-orcid":false,"given":"Fedor","family":"Ryabinin","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"},{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2454-4171","authenticated-orcid":false,"given":"Alexey","family":"Gotsman","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0573-2572","authenticated-orcid":false,"given":"Pierre","family":"Sutra","sequence":"additional","affiliation":[{"name":"T\u00e9l\u00e9com SudParis, Palaiseau, France"},{"name":"Inria Saclay, Palaiseau, France"},{"name":"Institut Polytechnique de Paris, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3266457"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.11.001"},{"key":"e_1_3_2_1_4_1","volume-title":"Fast Indulgent Consensus with Zero Degradation. In European Dependable Computing Conference (EDCC).","author":"Dutta Partha","year":"2002","unstructured":"Partha Dutta and Rachid Guerraoui. 2002. Fast Indulgent Consensus with Zero Degradation. In European Dependable Computing Conference (EDCC)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_6_1","volume-title":"Limits. In International Symposium on Distributed Computing (DISC).","author":"Rezende Tuanir Fran\u00e7a","year":"2020","unstructured":"Tuanir Fran\u00e7a Rezende and Pierre Sutra. 2020. Leaderless State-Machine Replication: Specification, Properties, Limits. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_7_1","volume-title":"Revisiting Optimal Resilience of Fast Byzantine Consensus. In Symposium on Principles of Distributed Computing (PODC).","author":"Kuznetsov Petr","year":"2021","unstructured":"Petr Kuznetsov, Andrei Tonkikh, and Yan X Zhang. 2021. Revisiting Optimal Resilience of Fast Byzantine Consensus. In Symposium on Principles of Distributed Computing (PODC)."},{"key":"e_1_3_2_1_8_1","volume-title":"Distributed Computing 19","author":"Lamport Leslie","year":"2006","unstructured":"Leslie Lamport. 2006. Fast Paxos. Distributed Computing 19 (2006)."},{"key":"e_1_3_2_1_9_1","volume-title":"Lower Bounds for Asynchronous Consensus. Distributed Computing 19","author":"Lamport Leslie","year":"2006","unstructured":"Leslie Lamport. 2006. Lower Bounds for Asynchronous Consensus. Distributed Computing 19 (2006)."},{"key":"e_1_3_2_1_10_1","volume-title":"There Is More Consensus in Egalitarian Parliaments. In Symposium on Operating Systems Principles (SOSP).","author":"Moraru Iulian","year":"2013","unstructured":"Iulian Moraru, David G. Andersen, and Michael Kaminsky. 2013. There Is More Consensus in Egalitarian Parliaments. In Symposium on Operating Systems Principles (SOSP)."},{"key":"e_1_3_2_1_11_1","volume-title":"Generic Broadcast. In International Symposium on Distributed Computing (DISC).","author":"Pedone Fernando","year":"1999","unstructured":"Fernando Pedone and Andr\u00e9 Schiper. 1999. Generic Broadcast. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_12_1","unstructured":"Fedor Ryabinin Alexey Gotsman and Pierre Sutra. 2025. Revisiting Lower Bounds for Two-Step Consensus. arXiv:0 [cs.DC]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"}],"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.3733541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:13Z","timestamp":1749824773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":13,"alternative-id":["10.1145\/3732772.3733541","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733541","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"}}]}}