{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:44:13Z","timestamp":1782927853425,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["(22\/1425"],"award-info":[{"award-number":["(22\/1425"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["25\/1849"],"award-info":[{"award-number":["25\/1849"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"French National Research Agency","award":["CENTEANES"],"award-info":[{"award-number":["CENTEANES"]}]},{"name":"DGAPA PAPIIT","award":["IN108723"],"award-info":[{"award-number":["IN108723"]}]},{"name":"SECIHTI","award":["CBF-2025-I-393"],"award-info":[{"award-number":["CBF-2025-I-393"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815906","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"445-455","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Impossibility Results for Strong Linearizability: The Difficulty of Consistent Refereeing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-6457","authenticated-orcid":false,"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-8639","authenticated-orcid":false,"given":"Armando","family":"Casta\u00f1eda","sequence":"additional","affiliation":[{"name":"Instituto de Matem\u00e1ticas, Universidad Nacional Aut\u00f3noma de M\u00e9xico (UNAM), Mexico City, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2727-8865","authenticated-orcid":false,"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[{"name":"LIX, CNRS, Ecole polytechnique, Institut Polytechnique de Paris, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0023-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0969"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164071"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662790"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.004"},{"key":"e_1_3_2_1_6_1","unstructured":"Hagit Attiya Armando Casta\u00f1eda and Constantin Enea. 2025. The Power of Strong Linearizability: the Difficulty of Consistent Refereeing. arXiv:2506.18401 [cs.DC] https:\/\/arxiv.org\/abs\/2506.18401"},{"key":"e_1_3_2_1_7_1","volume-title":"Impossibility results for distributed computing","author":"Attiya Hagit","unstructured":"Hagit Attiya and Faith Ellen. 2014. Impossibility results for distributed computing. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2019.2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2024.8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248083"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0393"},{"key":"e_1_3_2_1_12_1","volume-title":"Distributed Computing - 29th International Symposium (DISC)","author":"Denysyuk Oksana","unstructured":"Oksana Denysyuk and Philipp Woelfel. 2015. Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. In Distributed Computing - 29th International Symposium (DISC). Springer, 60\u201374."},{"key":"e_1_3_2_1_13_1","volume-title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR","author":"Dongol Brijesh","year":"2022","unstructured":"Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. 2022. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR 2022)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Wojciech Golab Lisa Higham and Philipp Woelfel. 2011. Linearizable Implementations Do Not Suffice for Randomized Distributed Computation. In STOC. 373\u2013382.","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_15_1","volume-title":"On Linearizability and the Termination of Randomized Algorithms. CoRR abs\/2010.15210","author":"Hadzilacos Vassos","year":"2020","unstructured":"Vassos Hadzilacos, Xing Hu, and Sam Toueg. 2020. On Linearizability and the Termination of Randomized Algorithms. CoRR abs\/2010.15210 (2020). http:\/\/arxiv.org\/abs\/2010.15210"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332508"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_19_1","volume-title":"Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS","author":"Hwang Steven Munsu","year":"2022","unstructured":"Steven Munsu Hwang and Philipp Woelfel. 2022. Strongly Linearizable Linked List and Queue. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626418500068"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Sean Ovens and Philipp Woelfel. 2019. Strongly Linearizable Implementations of Snapshots and Other Types. In PODC. 197\u2013206.","DOI":"10.1145\/3293611.3331632"}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","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\/3796701.3815906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:47:36Z","timestamp":1782924456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":21,"alternative-id":["10.1145\/3796701.3815906","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815906","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}