{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985480,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P021247\/1","EP\/P020372\/1"],"award-info":[{"award-number":["EP\/P021247\/1","EP\/P020372\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733523","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"541-544","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5685-4944","authenticated-orcid":false,"given":"Henry","family":"Austin","sequence":"first","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4701-738X","authenticated-orcid":false,"given":"Maximilien","family":"Gadouleau","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7182-585X","authenticated-orcid":false,"given":"George","family":"Mertzios","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2998-0933","authenticated-orcid":false,"given":"Amitabh","family":"Trehan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Durham University, Durham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/983102"},{"key":"e_1_3_2_1_2_1","volume-title":"Amnesiac Flooding: Easy to break, hard to escape. arXiv:2502.06001 [cs.DC] https:\/\/arxiv.org\/abs\/2502.06001","author":"Austin Henry","year":"2025","unstructured":"Henry Austin, Maximilien Gadouleau, George B. Mertzios, and Amitabh Trehan. 2025. Amnesiac Flooding: Easy to break, hard to escape. arXiv:2502.06001 [cs.DC] https:\/\/arxiv.org\/abs\/2502.06001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91014-3_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2013.08.011"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2024.18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993640"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347107"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.769773"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331586"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.STACS.2020.17"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-023-00448-y"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538415"},{"key":"e_1_3_2_1_13_1","volume-title":"Distributed Algorithms","author":"Lynch N.","unstructured":"N. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo, CA."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2024.35"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_16_1","volume-title":"Computer networks","author":"Tanenbaum Andrew","unstructured":"Andrew Tanenbaum. 2011. Computer networks. Pearson Prentice Hall, Boston."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724"},{"key":"e_1_3_2_1_18_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Turau Volker","unstructured":"Volker Turau. 2020. Stateless information dissemination algorithms. In International Colloquium on Structural Information and Communication Complexity. Springer, 183\u2013199."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67731-2_5"},{"key":"e_1_3_2_1_20_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Turau Volker","unstructured":"Volker Turau. 2021. Synchronous concurrent broadcasts for intermittent channels with bounded capacities. In International Colloquium on Structural Information and Communication Complexity. Springer, 296\u2013312."}],"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.3733523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:54Z","timestamp":1749824634000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":20,"alternative-id":["10.1145\/3732772.3733523","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733523","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"}}]}}