{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NQ4EUPHWBDNQYBXBRLCAXI23JA","short_pith_number":"pith:NQ4EUPHW","canonical_record":{"source":{"id":"1707.01747","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T12:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"051b501109afde4bf81100bb77604bbd1b2632ed2cbb625a7d9c2b227fb0f0fa","abstract_canon_sha256":"e02b1eb2bd56cf36e3bb3f675318a123694ec2e8c295f8765c396498e17de8ee"},"schema_version":"1.0"},"canonical_sha256":"6c384a3cf608db0c06e18ac40ba35b4821a864243d2dce69c97f907c8d73a96d","source":{"kind":"arxiv","id":"1707.01747","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01747","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01747v3","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01747","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"pith_short_12","alias_value":"NQ4EUPHWBDNQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQ4EUPHWBDNQYBXB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQ4EUPHW","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NQ4EUPHWBDNQYBXBRLCAXI23JA","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01747","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T12:35:08Z","cross_cats_sorted":[],"title_canon_sha256":"051b501109afde4bf81100bb77604bbd1b2632ed2cbb625a7d9c2b227fb0f0fa","abstract_canon_sha256":"e02b1eb2bd56cf36e3bb3f675318a123694ec2e8c295f8765c396498e17de8ee"},"schema_version":"1.0"},"canonical_sha256":"6c384a3cf608db0c06e18ac40ba35b4821a864243d2dce69c97f907c8d73a96d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:28.767158Z","signature_b64":"OG6o4Mbfx4sYh1GxVpgVteE1T6gIs4ToBcgh6N8EKjm0WbOHQUx2HA329u3FGYGccvKdU1JvfEaoCMuOKS97AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c384a3cf608db0c06e18ac40ba35b4821a864243d2dce69c97f907c8d73a96d","last_reissued_at":"2026-05-18T00:36:28.766509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:28.766509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01747","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCSq5Ut4OuqqeZHLz/vSjyKjX9ypIhXDO47TtFodvUjWknzbvVZ3e5Y/5aEvOfMkUph5fbn5DoCGdPtO49+KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:08:24.494995Z"},"content_sha256":"7e90a7c80404a1ddeb6e85455f603d8e6c4204f0fdc7223f3bbaf026f9996b69","schema_version":"1.0","event_id":"sha256:7e90a7c80404a1ddeb6e85455f603d8e6c4204f0fdc7223f3bbaf026f9996b69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NQ4EUPHWBDNQYBXBRLCAXI23JA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Strong Eventual Consistency in Distributed Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alastair R. Beresford, Dominic P. Mulligan, Martin Kleppmann, Victor B. F. Gomes","submitted_at":"2017-07-06T12:35:08Z","abstract_excerpt":"Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly understood. Indeed, many published algorithms have later been shown to be incorrect, even some that were accompanied by supposed mechanised proofs of correctness. In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01747","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLbLpxBXkkK91zO24Yt2LVz4UXXi8FqWA47ylh/9DfgR0jOabjuhjshueJA5NdEgXOka/Cn+h8vHqUeiv8FgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:08:24.495622Z"},"content_sha256":"e47bd17663bc7410064e2bffacc6dc4c7620ef62eb7176cf8a4f5ced810eab06","schema_version":"1.0","event_id":"sha256:e47bd17663bc7410064e2bffacc6dc4c7620ef62eb7176cf8a4f5ced810eab06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/bundle.json","state_url":"https://pith.science/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T00:08:24Z","links":{"resolver":"https://pith.science/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA","bundle":"https://pith.science/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/bundle.json","state":"https://pith.science/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQ4EUPHWBDNQYBXBRLCAXI23JA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NQ4EUPHWBDNQYBXBRLCAXI23JA","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":"e02b1eb2bd56cf36e3bb3f675318a123694ec2e8c295f8765c396498e17de8ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T12:35:08Z","title_canon_sha256":"051b501109afde4bf81100bb77604bbd1b2632ed2cbb625a7d9c2b227fb0f0fa"},"schema_version":"1.0","source":{"id":"1707.01747","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01747","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01747v3","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01747","created_at":"2026-05-18T00:36:28Z"},{"alias_kind":"pith_short_12","alias_value":"NQ4EUPHWBDNQ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQ4EUPHWBDNQYBXB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQ4EUPHW","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:e47bd17663bc7410064e2bffacc6dc4c7620ef62eb7176cf8a4f5ced810eab06","target":"graph","created_at":"2026-05-18T00:36:28Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly understood. Indeed, many published algorithms have later been shown to be incorrect, even some that were accompanied by supposed mechanised proofs of correctness. In this work, we focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data. We de","authors_text":"Alastair R. Beresford, Dominic P. Mulligan, Martin Kleppmann, Victor B. F. Gomes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T12:35:08Z","title":"Verifying Strong Eventual Consistency in Distributed Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01747","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e90a7c80404a1ddeb6e85455f603d8e6c4204f0fdc7223f3bbaf026f9996b69","target":"record","created_at":"2026-05-18T00:36:28Z","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":"e02b1eb2bd56cf36e3bb3f675318a123694ec2e8c295f8765c396498e17de8ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T12:35:08Z","title_canon_sha256":"051b501109afde4bf81100bb77604bbd1b2632ed2cbb625a7d9c2b227fb0f0fa"},"schema_version":"1.0","source":{"id":"1707.01747","kind":"arxiv","version":3}},"canonical_sha256":"6c384a3cf608db0c06e18ac40ba35b4821a864243d2dce69c97f907c8d73a96d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c384a3cf608db0c06e18ac40ba35b4821a864243d2dce69c97f907c8d73a96d","first_computed_at":"2026-05-18T00:36:28.766509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:28.766509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OG6o4Mbfx4sYh1GxVpgVteE1T6gIs4ToBcgh6N8EKjm0WbOHQUx2HA329u3FGYGccvKdU1JvfEaoCMuOKS97AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:28.767158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01747","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e90a7c80404a1ddeb6e85455f603d8e6c4204f0fdc7223f3bbaf026f9996b69","sha256:e47bd17663bc7410064e2bffacc6dc4c7620ef62eb7176cf8a4f5ced810eab06"],"state_sha256":"eed09214961d9f042dcb9e0d31db8c104ed4814d5032ba68ba1f4c44e88dee5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTbVzYFj6nn9tm7pQXUGUv1QjdNtXxAPpMkjmGmCwqMvvwLG8qqhp6VJycvoPK3amNN+ZcoDnKh2hbJo28P6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:08:24.499391Z","bundle_sha256":"150dffb78e7cd4e1d7652aa2653ef36b01fd57520deb3640bc928c730f638529"}}