{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CGZ2VKR7JC2IN3LEK2TUZ4P4SM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1eb1ba484ada6f229aca99e80e4de0c0d5fb5dc9ec5732f5247dac9928fb8c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-02-22T15:22:43Z","title_canon_sha256":"04eb46b32052b9ddc0d457cf5f40f5fed8e3eead8e6e6d5b8f73997f7b7077c9"},"schema_version":"1.0","source":{"id":"2602.19231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.19231","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2602.19231v1","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19231","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"CGZ2VKR7JC2I","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"CGZ2VKR7JC2IN3LE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"CGZ2VKR7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:54f2b0efe41f95cf4fdafb88649a6c6b29419418fe325b2a99ba2b1ef5447a5a","target":"graph","created_at":"2026-05-18T03:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Semantic dependencies between operations can be identified locally and used to drive conflict resolution without requiring central coordination or additional mechanisms."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal."}],"snapshot_sha256":"fde88da9b9f4d9fa8353e0d39fea0532ee7504e71203a6f3b28ba9f0a837c8f6"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"7e0703e5f82326ac15414955243d7213547c5f9f94f044dfaff0c555d24f32c0"},"paper":{"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","authors_text":"Georgii Semenov, Vitaly Aksenov","cross_cats":[],"headline":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-02-22T15:22:43Z","title":"Semantic Conflict Model for Collaborative Data Structures"},"references":{"count":23,"internal_anchors":0,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"10.1145/97444.97701","is_internal_anchor":false,"ref_index":1,"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","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"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","year":2017},{"cited_arxiv_id":"","doi":"10.1145/66926","is_internal_anchor":false,"ref_index":4,"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","year":1989},{"cited_arxiv_id":"","doi":"10.1145/3360580","is_internal_anchor":false,"ref_index":5,"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","year":2019}],"snapshot_sha256":"f9c246f4b5df80db40e39790e7d1dacff0b2d7c7547c5258541119414cd02b3e"},"source":{"id":"2602.19231","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T20:49:01.210249Z","id":"41d17ba6-4895-4bfd-a2ea-0c386a6a1afd","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A semantic conflict model resolves operation conflicts locally by identifying dependencies and rebasing via three-way merge on a replicated journal.","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.","weakest_assumption":"Semantic dependencies between operations can be identified locally and used to drive conflict resolution without requiring central coordination or additional mechanisms."}},"verdict_id":"41d17ba6-4895-4bfd-a2ea-0c386a6a1afd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3715e84b753aaa8965ec8ab1bc3ad6cc8e388b9312b70b4a6f17c955ba31d004","target":"record","created_at":"2026-05-18T03:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f1eb1ba484ada6f229aca99e80e4de0c0d5fb5dc9ec5732f5247dac9928fb8c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-02-22T15:22:43Z","title_canon_sha256":"04eb46b32052b9ddc0d457cf5f40f5fed8e3eead8e6e6d5b8f73997f7b7077c9"},"schema_version":"1.0","source":{"id":"2602.19231","kind":"arxiv","version":1}},"canonical_sha256":"11b3aaaa3f48b486ed6456a74cf1fc93286b11a77d096f23f4f017f9c6738707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11b3aaaa3f48b486ed6456a74cf1fc93286b11a77d096f23f4f017f9c6738707","first_computed_at":"2026-05-18T03:10:03.531576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:03.531576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JFyZNjiRf7VR4nw21xN99u45mpDh6BijM0XV5wPQ1A1iWuDkqKiKtCx8h5tHhWU3ktBh3EKGniyFs3TmAMrTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:03.532371Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.19231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3715e84b753aaa8965ec8ab1bc3ad6cc8e388b9312b70b4a6f17c955ba31d004","sha256:54f2b0efe41f95cf4fdafb88649a6c6b29419418fe325b2a99ba2b1ef5447a5a"],"state_sha256":"d90d05ce9480633e28d4d902939696b838d8d913c5d41414f3b1a0faaefc4d70"}