{"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":1749873985256,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101019564"],"award-info":[{"award-number":["101019564"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German Research Foundation","award":["470029389"],"award-info":[{"award-number":["470029389"]}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["DOI 10.55776\/I5982","DOI 10.55776\/P33775"],"award-info":[{"award-number":["DOI 10.55776\/I5982","DOI 10.55776\/P33775"]}],"id":[{"id":"10.13039\/501100002428","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.3733512","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"549-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2875-1945","authenticated-orcid":false,"given":"Tom-Lukas","family":"Breitkopf","sequence":"first","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1286-1373","authenticated-orcid":false,"given":"Julien","family":"Dallot","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4268-7368","authenticated-orcid":false,"given":"Antoine","family":"El-Hayek","sequence":"additional","affiliation":[{"name":"Institute of Science and Technology Austria, Klosterneuburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"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.1145\/3289137.3289150"},{"key":"e_1_3_2_1_2_1","volume-title":"Computation in networks of passively mobile finite-state sensors. Distributed computing 18, 4","author":"Angluin Dana","year":"2006","unstructured":"Dana Angluin, James Aspnes, Zo\u00eb Diamadi, Michael J. Fischer, and Ren\u00e9 Peralta. 2006. Computation in networks of passively mobile finite-state sensors. Distributed computing 18, 4 (2006), 235\u2013253."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538447"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.27"},{"key":"e_1_3_2_1_6_1","volume-title":"How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory of computing systems 50, 3","author":"Cai Shukai","year":"2012","unstructured":"Shukai Cai, Taisuke Izumi, and Koichi Wada. 2012. How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory of computing systems 50, 3 (2012), 433\u2013445."},{"key":"e_1_3_2_1_7_1","volume-title":"Lower bounds on the state complexity of population protocols. Distributed computing 36, 3","author":"Czerner Philipp","year":"2023","unstructured":"Philipp Czerner, Javier Esparza, and J\u00e9r\u00f4me Leroux. 2023. Lower bounds on the state complexity of population protocols. Distributed computing 36, 3 (2023), 209\u2013218."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.57"},{"key":"e_1_3_2_1_9_1","unstructured":"Robert Els\u00e4sser and Tomasz Radzik. 2018. Recent Results in Population Protocols for Exact Majority and Leader Election. In The Distributed Computing Column Stefan Schmid (Ed.)."},{"key":"e_1_3_2_1_10_1","volume-title":"Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems (OPODIS","author":"G\u0105sieniec Leszek","year":"2017","unstructured":"Leszek G\u0105sieniec, David Hamilton, Russell Martin, Paul G. Spirakis, and Grzegorz Stachowiak. 2017. Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Madrid (Spain), 14:1\u201314:14."},{"key":"e_1_3_2_1_11_1","unstructured":"Richard J. Lipton. 1976. The Reachability Problem Requires Exponential Space. (1976)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17402-6_27"}],"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.3733512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:53Z","timestamp":1749824693000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":12,"alternative-id":["10.1145\/3732772.3733512","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733512","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"}}]}}