{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T02:56:50Z","timestamp":1773975410864,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"publisher","award":["G062721N"],"award-info":[{"award-number":["G062721N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.is.2026.102691","type":"journal-article","created":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T16:25:05Z","timestamp":1768580705000},"page":"102691","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A Generalized CALM Theorem for Non-Deterministic Computation in Asynchronous Distributed Systems"],"prefix":"10.1016","volume":"138","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7115-204X","authenticated-orcid":false,"given":"Tim","family":"Baccaert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4032-0709","authenticated-orcid":false,"given":"Bas","family":"Ketsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.is.2026.102691_b1","series-title":"Proceedings of Datalog Reloaded: 1st International Workshop (Datalog 2010), March 16-19, 2010, Oxford, UK","first-page":"262","article-title":"Dedalus: Datalog in Time and Space","author":"Alvaro","year":"2010"},{"issue":"4","key":"10.1016\/j.is.2026.102691_b2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1017\/S1471068415000381","article-title":"Putting Logic-Based Distributed Systems on Stable Grounds","volume":"16","author":"Ameloot","year":"2016","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.is.2026.102691_b3","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2013), June 22-27, 2013, New York, NY , USA","first-page":"965","article-title":"Rule-based Application Development Using Webdamlog","author":"Abiteboul","year":"2013"},{"key":"10.1016\/j.is.2026.102691_b4","series-title":"Proceedings of the 5th Biennial Conference on Innovative Data Systems Research (CIDR 2011), January 9-12, 2011, Asilomar, CA, USA","first-page":"249","article-title":"Consistency analysis in bloom: a CALM and collected approach","author":"Alvaro","year":"2011"},{"issue":"1","key":"10.1016\/j.is.2026.102691_b5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1860702.1860704","article-title":"The Declarative Imperative: Experiences and Conjectures in Distributed Logic","volume":"39","author":"Hellerstein","year":"2010","journal-title":"SIGMOD Rec."},{"issue":"9","key":"10.1016\/j.is.2026.102691_b6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/3369736","article-title":"Keeping CALM: When Distributed Consistency is Easy","volume":"63","author":"Hellerstein","year":"2020","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/j.is.2026.102691_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2450142.2450151","article-title":"Relational Transducers for Declarative Networking","volume":"60","author":"Ameloot","year":"2013","journal-title":"J. ACM"},{"key":"10.1016\/j.is.2026.102691_b8","series-title":"Proceedings of the 15th International Conference on Database Theory (ICDT 2012), March 26-29, 2012, Berlin, Germany","first-page":"99","article-title":"Win-move is coordination-free (sometimes)","author":"Zinn","year":"2012"},{"issue":"4","key":"10.1016\/j.is.2026.102691_b9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2809784","article-title":"Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture","volume":"40","author":"Ameloot","year":"2016","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2026.102691_b10","series-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2012, Scottsdale, AZ, USA, May 20-24, 2012","first-page":"13","article-title":"Advanced partitioning techniques for massively distributed computation","author":"Zhou","year":"2012"},{"key":"10.1016\/j.is.2026.102691_b11","series-title":"Peer-To-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers","first-page":"53","article-title":"Kademlia: A peer-to-peer information system based on the XOR metric","volume":"2429","author":"Maymounkov","year":"2002"},{"issue":"11","key":"10.1016\/j.is.2026.102691_b12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1592761.1592785","article-title":"Declarative Networking","volume":"52","author":"Loo","year":"2009","journal-title":"Commun. ACM"},{"key":"10.1016\/j.is.2026.102691_b13","series-title":"Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2023, Seattle, WA, USA , June 18-23, 2023","first-page":"47","article-title":"Distributed consistency beyond queries","author":"Baccaert","year":"2023"},{"key":"10.1016\/j.is.2026.102691_b14","series-title":"Proceedings of the Twenty-Third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 14-16, 2004, Paris, France","first-page":"307","article-title":"Processing first-order queries under limited access patterns","author":"Nash","year":"2004"},{"key":"10.1016\/j.is.2026.102691_b15","series-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC 1980), April 28-30, 1980, Los Angeles, CA, USA","first-page":"82","article-title":"Local and global properties in networks of processors","author":"Angluin","year":"1980"},{"key":"10.1016\/j.is.2026.102691_b16","series-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"10.1016\/j.is.2026.102691_b17","series-title":"Communication Cost in Parallel Query Processing","author":"Beame","year":"2016"},{"key":"10.1016\/j.is.2026.102691_b18","series-title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA","first-page":"147","article-title":"Relational queries computable in polynomial time (extended abstract)","author":"Immerman","year":"1982"},{"key":"10.1016\/j.is.2026.102691_b19","series-title":"Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA","first-page":"137","article-title":"The Complexity of Relational Query Languages","author":"Vardi","year":"1982"},{"key":"10.1016\/j.is.2026.102691_b20","series-title":"28th International Conference on Database Theory, ICDT 2025, March 25-28, 2025, Barcelona, Spain","first-page":"32:1","article-title":"The free termination property of queries over time","volume":"vol. 328","author":"Power","year":"2025"},{"key":"10.1016\/j.is.2026.102691_b21","series-title":"Reasoning About Knowledge","author":"Fagin","year":"1995"},{"issue":"1","key":"10.1016\/j.is.2026.102691_b22","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","article-title":"How processes learn","volume":"1","author":"Chandy","year":"1986","journal-title":"Distrib. Comput."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000050?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:56:48Z","timestamp":1773971808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437926000050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":22,"alternative-id":["S0306437926000050"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2026.102691","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Generalized CALM Theorem for Non-Deterministic Computation in Asynchronous Distributed Systems","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2026.102691","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102691"}}