{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:48:12Z","timestamp":1765295292033,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006087","name":"Direcci\u00f3n General de Asuntos del Personal Acad\u00e9mico, Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"publisher","award":["PAPIIT IA102417"],"award-info":[{"award-number":["PAPIIT IA102417"]}],"id":[{"id":"10.13039\/501100006087","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1520\/11","230\/10"],"award-info":[{"award-number":["1520\/11","230\/10"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["249159"],"award-info":[{"award-number":["249159"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00446-021-00417-3","type":"journal-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T07:07:27Z","timestamp":1641971247000},"page":"123-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Unbeatable consensus"],"prefix":"10.1007","volume":"35","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannai A.","family":"Gonczarowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"417_CR1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Casta\u00f1eda, Y.\u00a0A. Gonczarowski, and Y.\u00a0Moses. Unbeatable set consensus via topological and combinatorial reasoning. In: proceedings of the 2016 ACM symposium on principles of distributed computing, PODC 2016, Chicago, IL, USA, July 25-28, pp. 107\u2013116, (2016)","DOI":"10.1145\/2933057.2933120"},{"key":"417_CR2","doi-asserted-by":"crossref","unstructured":"A.\u00a0Casta\u00f1eda, Y.\u00a0Moses, M.\u00a0Raynal, and M.\u00a0Roy. Early decision and stopping in synchronous consensus: a predicate-based guided tour. In: proceedings 5th international conference networked systems, NETYS 2017, Marrakech, Morocco, May 17-19, pp. 206\u2013221, (2017)","DOI":"10.1007\/978-3-319-59647-1_16"},{"issue":"1","key":"417_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jalgor.2003.11.001","volume":"51","author":"B Charron-Bost","year":"2004","unstructured":"Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus. J. Algorithms 51(1), 15\u201337 (2004)","journal-title":"J. Algorithms"},{"key":"417_CR4","doi-asserted-by":"crossref","unstructured":"B.\u00a0Coan. A communication-efficient canonical form for fault-tolerant distributed protocols. In: proceedings 5th ACM symposium on principles of distributed computing, pp. 63\u201372, (1986)","DOI":"10.1145\/10590.10596"},{"key":"417_CR5","doi-asserted-by":"crossref","unstructured":"A.\u00a0Dan, R.\u00a0Manohar, and Y.\u00a0Moses. On using time without clocks via zigzag causality. In: proceedings of the ACM symposium on principles of distributed computing, PODC 2017, Washington, DC, USA, July 25-27, pp. 241\u2013250, (2017)","DOI":"10.1145\/3087801.3087839"},{"key":"417_CR6","unstructured":"D.\u00a0Dolev. Beep protocols (personal communication)"},{"issue":"7","key":"417_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"34","author":"D Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in Byzantine agreement. J. ACM 34(7), 720\u2013741 (1990)","journal-title":"J. ACM"},{"key":"417_CR8","unstructured":"D.\u00a0Dolev and H.\u00a0R. Strong. Requirements for agreement in a distributed system. In: H.\u00a0J. Schneider, editor, Distributed data bases, pp. 115\u2013129. North-Holland, (1982)"},{"issue":"3","key":"417_CR9","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/S0097539704446220","volume":"37","author":"P Dutta","year":"2007","unstructured":"Dutta, P., Guerraoui, R., Pochon, B.: The time-complexity of local decision in distributed agreement. SIAM J. Comput. 37(3), 722\u2013756 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"417_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C Dwork","year":"1990","unstructured":"Dwork, C., Moses, Y.: Knowledge and common knowledge in a Byzantine environment: crash failures. Inf. Comput. 88(2), 156\u2013186 (1990)","journal-title":"Inf. Comput."},{"key":"417_CR11","volume-title":"Reasoning about Knowledge","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, London (2003)"},{"issue":"2","key":"417_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty processor. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"417_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/050640746","volume":"40","author":"E Gafni","year":"2011","unstructured":"Gafni, E., Guerraoui, R., Pochon, B.: The complexity of early deciding set agreement. SIAM J. Comput. 40(1), 63\u201378 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"417_CR14","first-page":"1","volume":"67","author":"G Goren","year":"2020","unstructured":"Goren, G., Moses, Y.: A preliminary version appeared in PODC 2018. Silence. J. ACM 67(1), 1\u201326 (2020)","journal-title":"Silence. J. ACM"},{"key":"417_CR15","doi-asserted-by":"crossref","unstructured":"V.\u00a0Hadzilacos. On the relationship between the atomic commitment and consensus problems. In: fault-tolerant distributed computing, pp. 201\u2013208, (1986)","DOI":"10.1007\/BFb0042336"},{"issue":"3","key":"417_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. A preliminary version appeared in PODC, 1984. J. ACM 37(3), 549\u2013587 (1990)","journal-title":"J. ACM"},{"issue":"3","key":"417_CR17","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S0097539798340217","volume":"31","author":"JY Halpern","year":"2001","unstructured":"Halpern, J.Y., Moses, Y., Waarts, O.: A characterization of eventual byzantine agreement. SIAM J. Comput. 31(3), 838\u2013865 (2001)","journal-title":"SIAM J. Comput."},{"key":"417_CR18","doi-asserted-by":"crossref","unstructured":"M.\u00a0Herlihy, Y.\u00a0Moses, and M.\u00a0R. Tuttle. Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions. In PODC, pp. 231\u2013238, (2011)","DOI":"10.1145\/1993806.1993849"},{"issue":"1","key":"417_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A simple proof of the uniform consensus synchronous lower bound. Inf. Process. Lett. 85(1), 47\u201352 (2003)","journal-title":"Inf. Process. Lett."},{"key":"417_CR20","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Moses. Relating knowledge and coordinated action: the knowledge of preconditions principle. In: proceedings fifteenth conference on theoretical aspects of rationality and knowledge, TARK 2015, Carnegie Mellon University, Pittsburgh, USA, June 4-6, 2015., pp. 231\u2013245, (2015)","DOI":"10.4204\/EPTCS.215.17"},{"key":"417_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01762112","volume":"3","author":"Y Moses","year":"1988","unstructured":"Moses, Y., Tuttle, M.R.: Programming simultaneous actions using common knowledge. Algorithmica 3, 121\u2013169 (1988)","journal-title":"Algorithmica"},{"issue":"2","key":"417_CR22","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"417_CR23","doi-asserted-by":"crossref","unstructured":"M.\u00a0Raynal. Optimal early stopping uniform consensus in synchronous systems with process omission failures. In: SPAA, pp. 302\u2013310. ACM Press, (2004)","DOI":"10.1145\/1007912.1007963"},{"issue":"5","key":"417_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2005.08.002","volume":"96","author":"X Wang","year":"2005","unstructured":"Wang, X., Teo, Y.M., Cao, J.: A bivalency proof of the lower bound for uniform consensus. Inf. Process. Lett. 96(5), 167\u2013174 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00417-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-021-00417-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-021-00417-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T03:41:30Z","timestamp":1726458090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-021-00417-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["417"],"URL":"https:\/\/doi.org\/10.1007\/s00446-021-00417-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2022,1,12]]},"assertion":[{"value":"19 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}