{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S5HE4S7MSMWSCH5DUEKKKC37R4","short_pith_number":"pith:S5HE4S7M","canonical_record":{"source":{"id":"1805.04263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-11T07:36:33Z","cross_cats_sorted":[],"title_canon_sha256":"2e3f2e6e8645c843714970031751029a1f76bb36e595fc4b835c4e57f2614d54","abstract_canon_sha256":"55058deffd9add19c19e4d1a0b04c6ca87bd3644d7d36e287ed79434810593ba"},"schema_version":"1.0"},"canonical_sha256":"974e4e4bec932d211fa3a114a50b7f8f0089079820090587600cc7e54cab2517","source":{"kind":"arxiv","id":"1805.04263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04263","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04263v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04263","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"S5HE4S7MSMWS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5HE4S7MSMWSCH5D","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5HE4S7M","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S5HE4S7MSMWSCH5DUEKKKC37R4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-11T07:36:33Z","cross_cats_sorted":[],"title_canon_sha256":"2e3f2e6e8645c843714970031751029a1f76bb36e595fc4b835c4e57f2614d54","abstract_canon_sha256":"55058deffd9add19c19e4d1a0b04c6ca87bd3644d7d36e287ed79434810593ba"},"schema_version":"1.0"},"canonical_sha256":"974e4e4bec932d211fa3a114a50b7f8f0089079820090587600cc7e54cab2517","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.234029Z","signature_b64":"LAEteRruOauWj7O/vFuLeR7OMawgu6jJKr8zCDxTCCJfk5UJhT+4ACqGM4aBqWY2Qv218WjpNAbJ4/p6t/6zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974e4e4bec932d211fa3a114a50b7f8f0089079820090587600cc7e54cab2517","last_reissued_at":"2026-05-18T00:16:07.233509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04263","source_version":2,"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKZthswPtBEdxCIBdmMkbHFhIhqD44FDwPCJG6dN4ifJla9iAUY7tDAlKjWWsFPCL3r6yiy3hYinJjyzbBHaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:52.997131Z"},"content_sha256":"346eabee7b762a3892d2f1db7df9f5ba04e42c785dfc35f808bc6fc0a08b3bb8","schema_version":"1.0","event_id":"sha256:346eabee7b762a3892d2f1db7df9f5ba04e42c785dfc35f808bc6fc0a08b3bb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S5HE4S7MSMWSCH5DUEKKKC37R4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OpSets: Sequential Specifications for Replicated Datatypes (Extended Version)","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":"2018-05-11T07:36:33Z","abstract_excerpt":"We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these datatypes. Our approach is simple but expressive, allowing us to succinctly specify a variety of abstract datatypes, including maps, sets, lists, text, graphs, trees, and registers. Our datatypes are also composable, enabling the construction of complex data structures. To demonstrate the utility of OpSets for analysing replication algorithms, we highlight a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04263","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":""},"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EO8DqI1NF5xH8pCm5f0zCprlEb6l1EjQKavQmLC5hqZCTzWAEcCHf9+IZw3Bw0fxIJENtpimD5ZrqFpdrlhDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:34:52.997495Z"},"content_sha256":"77d0d6b6109f832d76ae481baec92f38cc1f5edf30ea979162c9eb588e879823","schema_version":"1.0","event_id":"sha256:77d0d6b6109f832d76ae481baec92f38cc1f5edf30ea979162c9eb588e879823"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/bundle.json","state_url":"https://pith.science/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/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-06T16:34:52Z","links":{"resolver":"https://pith.science/pith/S5HE4S7MSMWSCH5DUEKKKC37R4","bundle":"https://pith.science/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/bundle.json","state":"https://pith.science/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5HE4S7MSMWSCH5DUEKKKC37R4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S5HE4S7MSMWSCH5DUEKKKC37R4","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":"55058deffd9add19c19e4d1a0b04c6ca87bd3644d7d36e287ed79434810593ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-11T07:36:33Z","title_canon_sha256":"2e3f2e6e8645c843714970031751029a1f76bb36e595fc4b835c4e57f2614d54"},"schema_version":"1.0","source":{"id":"1805.04263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04263","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04263v2","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04263","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"S5HE4S7MSMWS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5HE4S7MSMWSCH5D","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5HE4S7M","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:77d0d6b6109f832d76ae481baec92f38cc1f5edf30ea979162c9eb588e879823","target":"graph","created_at":"2026-05-18T00:16:07Z","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":"We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these datatypes. Our approach is simple but expressive, allowing us to succinctly specify a variety of abstract datatypes, including maps, sets, lists, text, graphs, trees, and registers. Our datatypes are also composable, enabling the construction of complex data structures. To demonstrate the utility of OpSets for analysing replication algorithms, we highlight a","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":"2018-05-11T07:36:33Z","title":"OpSets: Sequential Specifications for Replicated Datatypes (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04263","kind":"arxiv","version":2},"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:346eabee7b762a3892d2f1db7df9f5ba04e42c785dfc35f808bc6fc0a08b3bb8","target":"record","created_at":"2026-05-18T00:16:07Z","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":"55058deffd9add19c19e4d1a0b04c6ca87bd3644d7d36e287ed79434810593ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-11T07:36:33Z","title_canon_sha256":"2e3f2e6e8645c843714970031751029a1f76bb36e595fc4b835c4e57f2614d54"},"schema_version":"1.0","source":{"id":"1805.04263","kind":"arxiv","version":2}},"canonical_sha256":"974e4e4bec932d211fa3a114a50b7f8f0089079820090587600cc7e54cab2517","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"974e4e4bec932d211fa3a114a50b7f8f0089079820090587600cc7e54cab2517","first_computed_at":"2026-05-18T00:16:07.233509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:07.233509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAEteRruOauWj7O/vFuLeR7OMawgu6jJKr8zCDxTCCJfk5UJhT+4ACqGM4aBqWY2Qv218WjpNAbJ4/p6t/6zAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:07.234029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:346eabee7b762a3892d2f1db7df9f5ba04e42c785dfc35f808bc6fc0a08b3bb8","sha256:77d0d6b6109f832d76ae481baec92f38cc1f5edf30ea979162c9eb588e879823"],"state_sha256":"f50c94a5b48fb7e70030a351265ad38a74c1721da7b9e021b1aa6580ff444524"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/BDF7K3eSKjdgetlI8z4VcrKfRl7KCgbcj0EUNtytz6Ug36U8aFs0ML/o7m8b70aNMC4rfZNgjjs45QOQF5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:34:52.999386Z","bundle_sha256":"9d466e8a735b8dc5bac93c00924f00fb0793b5b3ee08a68e8f475bba32cffd09"}}