{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GK4YDDM5LF7CRVU776MLAPTDCH","short_pith_number":"pith:GK4YDDM5","schema_version":"1.0","canonical_sha256":"32b9818d9d597e28d69fff98b03e6311f157ea6e9d810a7e1057e48e9545fb4a","source":{"kind":"arxiv","id":"2109.10554","version":2},"attestation_state":"computed","paper":{"title":"On Conflict-Free Replicated Data Types and Equivocation in Byzantine Setups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Florian Jacob, Hannes Hartenstein, Saskia Bayreuther","submitted_at":"2021-09-22T07:37:25Z","abstract_excerpt":"We explore the property of equivocation tolerance for Conflict-Free Replicated Data Types (CRDTs). We show that a subclass of CRDTs is equivocation-tolerant and can thereby cope with any number of Byzantine faults: Without equivocation detection, prevention or remediation, they still fulfill strong eventual consistency (SEC). We also conjecture that there is only one operation-based CRDT design supporting non-commutative operations that fulfills SEC in Byzantine environments with any number of faults."},"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":"2109.10554","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-09-22T07:37:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4cace8f6418f79be1d6dc18fd96b9979528c321a067d079ac2134f3778f2982f","abstract_canon_sha256":"c3505ae2cc8ec21b39f15587a1f38c9feaa050b960d93f71129edd5845a65f2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:57.364249Z","signature_b64":"eEpOi11bVcFaH021V3iQaQhNi6Nv3hyP3N9ipPPPBBXdymNiK2iFKNGc1Ckd3P6Z/VLa+u06/ZWXK7KN6L7eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32b9818d9d597e28d69fff98b03e6311f157ea6e9d810a7e1057e48e9545fb4a","last_reissued_at":"2026-07-05T03:20:57.363758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:57.363758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Conflict-Free Replicated Data Types and Equivocation in Byzantine Setups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Florian Jacob, Hannes Hartenstein, Saskia Bayreuther","submitted_at":"2021-09-22T07:37:25Z","abstract_excerpt":"We explore the property of equivocation tolerance for Conflict-Free Replicated Data Types (CRDTs). We show that a subclass of CRDTs is equivocation-tolerant and can thereby cope with any number of Byzantine faults: Without equivocation detection, prevention or remediation, they still fulfill strong eventual consistency (SEC). We also conjecture that there is only one operation-based CRDT design supporting non-commutative operations that fulfills SEC in Byzantine environments with any number of faults."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.10554","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/2109.10554/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":"2109.10554","created_at":"2026-07-05T03:20:57.363831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.10554v2","created_at":"2026-07-05T03:20:57.363831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.10554","created_at":"2026-07-05T03:20:57.363831+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK4YDDM5LF7C","created_at":"2026-07-05T03:20:57.363831+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK4YDDM5LF7CRVU7","created_at":"2026-07-05T03:20:57.363831+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK4YDDM5","created_at":"2026-07-05T03:20:57.363831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.22963","citing_title":"ERA: Epoch-Resolved Arbitration for Duelling Admins in Group Management CRDTs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH","json":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH.json","graph_json":"https://pith.science/api/pith-number/GK4YDDM5LF7CRVU776MLAPTDCH/graph.json","events_json":"https://pith.science/api/pith-number/GK4YDDM5LF7CRVU776MLAPTDCH/events.json","paper":"https://pith.science/paper/GK4YDDM5"},"agent_actions":{"view_html":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH","download_json":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH.json","view_paper":"https://pith.science/paper/GK4YDDM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.10554&json=true","fetch_graph":"https://pith.science/api/pith-number/GK4YDDM5LF7CRVU776MLAPTDCH/graph.json","fetch_events":"https://pith.science/api/pith-number/GK4YDDM5LF7CRVU776MLAPTDCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH/action/storage_attestation","attest_author":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH/action/author_attestation","sign_citation":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH/action/citation_signature","submit_replication":"https://pith.science/pith/GK4YDDM5LF7CRVU776MLAPTDCH/action/replication_record"}},"created_at":"2026-07-05T03:20:57.363831+00:00","updated_at":"2026-07-05T03:20:57.363831+00:00"}