{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:40:08Z","timestamp":1747867208719,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031917356","type":"print"},{"value":"9783031917363","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-91736-3_4","type":"book-chapter","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:03:27Z","timestamp":1747865007000},"page":"56-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Existence of\u00a0Extension-Based Proofs of\u00a0Impossibility for\u00a0Set-Agreement"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Paz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1137\/20M1375851","volume":"52","author":"D Alistarh","year":"2023","unstructured":"Alistarh, D., Aspnes, J., Ellen, F., Gelashvili, R., Zhu, L.: Why extension-based proofs fail. SIAM J. Comput. 52(4), 913\u2013944 (2023)","journal-title":"SIAM J. Comput."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jpdc.2022.01.025","volume":"163","author":"H Attiya","year":"2022","unstructured":"Attiya, H., Casta\u00f1eda, A., Hendler, D., Perrin, M.: Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. J. Parallel Distrib. Comput. 163, 181\u2013197 (2022)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jpdc.2023.02.002","volume":"176","author":"H Attiya","year":"2023","unstructured":"Attiya, H., Casta\u00f1eda, A., Rajsbaum, S.: Locally solvable tasks and the limitations of valency arguments. J. Parallel Distrib. Comput. 176, 28\u201340 (2023)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR4","unstructured":"Attiya, H., Fraigniaud, P., Paz, A., Rajsbaum, S.: One step forward, one step back: FLP-style proofs and the round-reduction technique for colorless tasks. In: DISC. LIPIcs, vol.\u00a0281, pp. 4:1\u20134:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Hoboken (2004)","DOI":"10.1002\/0471478210"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computations. In: 16th ACM Symposium on Principles of Distributed Computing (PODC), pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Brusse, K., Ellen, F.: Reductions and extension-based proofs. In: 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 497\u2013507 (2021)","DOI":"10.1145\/3465084.3467906"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TRO.2023.3341570","volume":"40","author":"M Cavorsi","year":"2024","unstructured":"Cavorsi, M., Sabattini, L., Gil, S.: Multirobot adversarial resilience using control barrier functions. IEEE Trans. Rob. 40, 797\u2013815 (2024)","journal-title":"IEEE Trans. Rob."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-47666-6_42","volume-title":"Automata, Languages, and Programming","author":"B Charron-Bost","year":"2015","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 528\u2013539. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_42"},{"issue":"2","key":"4_CR10","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.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M.: Impossibility results for asynchronous PRAM. In: 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 327\u2013336 (1991)","DOI":"10.1145\/113379.113409"},{"key":"4_CR12","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2013)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.04.007","volume":"683","author":"M Herlihy","year":"2017","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683, 1\u201321 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539701397412","volume":"36","author":"G Hoest","year":"2006","unstructured":"Hoest, G., Shavit, N.: Toward a topological characterization of asynchronous complexity. SIAM J. Comput. 36(2), 457\u2013497 (2006)","journal-title":"SIAM J. Comput."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-12200-2_36","volume-title":"LATIN 2010: Theoretical Informatics","author":"S Rajsbaum","year":"2010","unstructured":"Rajsbaum, S.: Iterated shared memory models. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 407\u2013416. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_36"},{"key":"4_CR16","unstructured":"Sheng, Y., Ellen, F.: Extension-based proofs for synchronous message passing. In: DISC. LIPIcs, vol.\u00a0209, pp. 36:1\u201336:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"4_CR17","unstructured":"Shi, Y., Liu, W.: Brief announcement: colorless tasks and extension-based proofs. In: DISC. LIPIcs, vol.\u00a0319, pp. 54:1\u201354:6. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91736-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:03:33Z","timestamp":1747865013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91736-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031917356","9783031917363"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91736-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delphi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.torontomu.ca\/sirocco-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}