{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4OLSXQIGGPSLJ2GEN5B6K6QUB3","short_pith_number":"pith:4OLSXQIG","schema_version":"1.0","canonical_sha256":"e3972bc10633e4b4e8c46f43e57a140ee84aa9c8fccf397c21dcf42224511a81","source":{"kind":"arxiv","id":"2004.00107","version":2},"attestation_state":"computed","paper":{"title":"Merkle-CRDTs: Merkle-DAGs meet CRDTs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hector Sanjuan, Ioannis Psaras, Pedro Teixeira, Samuli Poyhtari","submitted_at":"2020-03-31T21:00:54Z","abstract_excerpt":"We study Merkle-DAGs as a transport and persistence layer for Conflict-Free Replicated Data Types (CRDTs), coining the term Merkle-CRDTs and providing an overview of the different concepts, properties, advantages and limitations involved. We show how Merkle-DAGs can act as logical clocks giving Merkle-CRDTs the potential to greatly simplify the design and implementation of convergent data types in systems with weak messaging layer guarantees and a very large number of replicas. Merkle-CRDTs can leverage highly scalable distributed technologies like DHTs and PubSub algorithms running underneath"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2004.00107","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2020-03-31T21:00:54Z","cross_cats_sorted":[],"title_canon_sha256":"484a5b7c1770fda7845990d730335a066b020c529264dbe61d315d2090a0dc6d","abstract_canon_sha256":"2f0a493121b6b32bde51b83fe3008958f5f8339c63ac691dc8e67c70ec861e2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:51.551878Z","signature_b64":"xMoEmCxyGmPOOuo6V1h5dpBlpFw0arPYuYFP+XU3fdHDHxX6Qe8qY991q04d0Sa5RTqzwFXDPtWFw3daBnyfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3972bc10633e4b4e8c46f43e57a140ee84aa9c8fccf397c21dcf42224511a81","last_reissued_at":"2026-07-05T00:58:51.551405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:51.551405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Merkle-CRDTs: Merkle-DAGs meet CRDTs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hector Sanjuan, Ioannis Psaras, Pedro Teixeira, Samuli Poyhtari","submitted_at":"2020-03-31T21:00:54Z","abstract_excerpt":"We study Merkle-DAGs as a transport and persistence layer for Conflict-Free Replicated Data Types (CRDTs), coining the term Merkle-CRDTs and providing an overview of the different concepts, properties, advantages and limitations involved. We show how Merkle-DAGs can act as logical clocks giving Merkle-CRDTs the potential to greatly simplify the design and implementation of convergent data types in systems with weak messaging layer guarantees and a very large number of replicas. Merkle-CRDTs can leverage highly scalable distributed technologies like DHTs and PubSub algorithms running underneath"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.00107","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.00107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.00107","created_at":"2026-07-05T00:58:51.551474+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.00107v2","created_at":"2026-07-05T00:58:51.551474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.00107","created_at":"2026-07-05T00:58:51.551474+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OLSXQIGGPSL","created_at":"2026-07-05T00:58:51.551474+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OLSXQIGGPSLJ2GE","created_at":"2026-07-05T00:58:51.551474+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OLSXQIG","created_at":"2026-07-05T00:58:51.551474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29574","citing_title":"Stateless Network-Aware Adaptive Bitrate Streaming over IPFS","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19373","citing_title":"Conflict-Free Replicated Data Types for Neural Network Model Merging: A Two-Layer Architecture Enabling CRDT-Compliant Model Merging Across 26 Strategies","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23560","citing_title":"Towards System-Oriented Formal Verification of Local-First Access Control","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3","json":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3.json","graph_json":"https://pith.science/api/pith-number/4OLSXQIGGPSLJ2GEN5B6K6QUB3/graph.json","events_json":"https://pith.science/api/pith-number/4OLSXQIGGPSLJ2GEN5B6K6QUB3/events.json","paper":"https://pith.science/paper/4OLSXQIG"},"agent_actions":{"view_html":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3","download_json":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3.json","view_paper":"https://pith.science/paper/4OLSXQIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.00107&json=true","fetch_graph":"https://pith.science/api/pith-number/4OLSXQIGGPSLJ2GEN5B6K6QUB3/graph.json","fetch_events":"https://pith.science/api/pith-number/4OLSXQIGGPSLJ2GEN5B6K6QUB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3/action/storage_attestation","attest_author":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3/action/author_attestation","sign_citation":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3/action/citation_signature","submit_replication":"https://pith.science/pith/4OLSXQIGGPSLJ2GEN5B6K6QUB3/action/replication_record"}},"created_at":"2026-07-05T00:58:51.551474+00:00","updated_at":"2026-07-05T00:58:51.551474+00:00"}