{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:11Z","timestamp":1750309211874,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["ANR-20-CE25-0002-01","ANR-10-LABX-07-81"],"award-info":[{"award-number":["ANR-20-CE25-0002-01","ANR-10-LABX-07-81"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662818","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"343-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6308-0500","authenticated-orcid":false,"given":"Sylvain","family":"Gay","sequence":"first","affiliation":[{"name":"D\u00e9partement Informatique, \u00c9cole Normale Sup\u00e9rieure, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-4635","authenticated-orcid":false,"given":"Achour","family":"Mostefaoui","sequence":"additional","affiliation":[{"name":"LS2N, Nantes Universit\u00e9, Nantes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8019-0830","authenticated-orcid":false,"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[{"name":"LS2N, Nantes Universit\u00e9, Nantes, France"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167119"},{"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.1006\/inco.1993.1043"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594569"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.16"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_7_1","volume-title":"No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version). Nantes Universit\u00e9. Retrieved","author":"Gay Sylvain","year":"2024","unstructured":"Sylvain Gay, Achour Most\u00e9faoui, and Matthieu Perrin. 2024. No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version). Nantes Universit\u00e9. Retrieved May 8, 2024 from https:\/\/hal.science\/hal-04571653"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167125"},{"key":"e_1_3_2_1_9_1","volume-title":"31st International Symposium on Distributed Computing, DISC 2017","volume":"16","author":"Imbs Damien","year":"2017","unstructured":"Damien Imbs, Achour Most\u00e9faoui, Matthieu Perrin, and Michel Raynal. 2017. Which Broadcast Abstraction Captures k-Set Agreement?. In 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria (LIPIcs, Vol. 91). 27:1--27:16."},{"key":"e_1_3_2_1_10_1","unstructured":"Leslie Lamport. 2005. Generalized consensus and Paxos. (2005)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48169-9_7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/227210.227225"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"Michael","year":"1993","unstructured":"Michael E. Saks and Fotios Zaharoglou. 1993. Wait-free k-set agreement is impossible: the topology of public knowledge. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM, 101--110."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of Asilomar Workshop on Fault-Tolerant Distributed Computing (LNCS","volume":"41","author":"Schneider Fred B.","year":"1986","unstructured":"Fred B. Schneider. 1986. The State Machine Approach: A Tutorial. In Proc. of Asilomar Workshop on Fault-Tolerant Distributed Computing (LNCS, Vol. 448). Springer, 18--41."}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Nantes France","acronym":"PODC '24"},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":14,"alternative-id":["10.1145\/3662158.3662818","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662818","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}