{"paper":{"title":"Semantic Conflict Model for Collaborative Data Structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Georgii Semenov, Vitaly Aksenov","submitted_at":"2026-02-22T15:22:43Z","abstract_excerpt":"Digital collaboration systems support asynchronous work over replicated data, where conflicts arise when concurrent operations cannot be unambiguously integrated into a shared history. While Conflict-Free Replicated Data Types (CRDTs) ensure convergence through built-in conflict resolution, this resolution is typically implicit and opaque to users, whereas existing reconciliation techniques often rely on centralized coordination. This paper introduces a conflict model for collaborative data structures that enables explicit, local-first conflict resolution without central coordination. The mode"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The model identifies conflicts using semantic dependencies between operations and resolves them by rebasing conflicting operations onto a reconciling operation via a three-way merge over a replicated journal.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Semantic dependencies between operations can be identified locally and used to drive conflict resolution without requiring central coordination or additional mechanisms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A semantic conflict model enables explicit local-first resolution in collaborative data structures by using operation dependencies and three-way merges on a replicated journal, demonstrated on registers including Last-Writer-Wins.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fde88da9b9f4d9fa8353e0d39fea0532ee7504e71203a6f3b28ba9f0a837c8f6"},"source":{"id":"2602.19231","kind":"arxiv","version":1},"verdict":{"id":"41d17ba6-4895-4bfd-a2ea-0c386a6a1afd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T20:49:01.210249Z","strongest_claim":"The model identifies conflicts using semantic dependencies between operations and resolves them by rebasing conflicting operations onto a reconciling operation via a three-way merge over a replicated journal.","one_line_summary":"A semantic conflict model enables explicit local-first resolution in collaborative data structures by using operation dependencies and three-way merges on a replicated journal, demonstrated on registers including Last-Writer-Wins.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Semantic dependencies between operations can be identified locally and used to drive conflict resolution without requiring central coordination or additional mechanisms.","pith_extraction_headline":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal."},"references":{"count":23,"sample":[{"doi":"10.1145/97444.97701","year":1990,"title":"J. Aspnes and M. Herlihy. 1990. Wait-free data structures in the asyn- chronous PRAM model. InProceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures(Island of Crete, G","work_id":"367e91ad-fef4-42fe-a0b5-9de1f8eac258","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Alexandru Baltag and Sonja Smets. 2008. A qualitative theory of dynamic interactive belief revision.Logic and the foundations of game and decision theory (LOFT 7)3 (2008), 9–58","work_id":"47266fcb-037f-4997-bf72-2859285b7764","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Carlos Baquero, Paulo Sérgio Almeida, Alcino Cunha, Carla Ferreira, et al. 2017. Composition in state-based replicated data types.Bulletin of EATCS3, 123 (2017)","work_id":"b11965de-205a-45e1-9254-bf39542a1355","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/66926","year":1989,"title":"C. A. Ellis and S. J. Gibbs. 1989. Concurrency control in groupware systems.SIGMOD Rec.18, 2 (June 1989), 399–407. doi:10.1145/66926. 66963","work_id":"eb587eb4-bde0-4438-b493-b3a62567772f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3360580","year":2019,"title":"Gowtham Kaki, Swarn Priya, KC Sivaramakrishnan, and Suresh Jagan- nathan. 2019. Mergeable replicated data types.Proc. ACM Program. Lang.3, OOPSLA, Article 154 (Oct. 2019), 29 pages. doi:10.1145/336058","work_id":"a7eb9723-e3ac-4d88-962b-ed9b7586b99e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"f9c246f4b5df80db40e39790e7d1dacff0b2d7c7547c5258541119414cd02b3e","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7e0703e5f82326ac15414955243d7213547c5f9f94f044dfaff0c555d24f32c0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}