{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E3SBSU5YYRKXVVNFZ3MBHWGZD4","short_pith_number":"pith:E3SBSU5Y","canonical_record":{"source":{"id":"1803.04237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T13:18:05Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"9eebe983f02787c3c5afa7b70b853858ee1a865574013d6289026053a5c3d024","abstract_canon_sha256":"e4fb04278ca6de505c2ce0e920259951a15fc6e6503d762cd559d34b7f770cc0"},"schema_version":"1.0"},"canonical_sha256":"26e41953b8c4557ad5a5ced813d8d91f17f90b53ac636916d16fc42abd328a97","source":{"kind":"arxiv","id":"1803.04237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04237","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04237v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04237","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"E3SBSU5YYRKX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E3SBSU5YYRKXVVNF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E3SBSU5Y","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E3SBSU5YYRKXVVNFZ3MBHWGZD4","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T13:18:05Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"9eebe983f02787c3c5afa7b70b853858ee1a865574013d6289026053a5c3d024","abstract_canon_sha256":"e4fb04278ca6de505c2ce0e920259951a15fc6e6503d762cd559d34b7f770cc0"},"schema_version":"1.0"},"canonical_sha256":"26e41953b8c4557ad5a5ced813d8d91f17f90b53ac636916d16fc42abd328a97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:32.204563Z","signature_b64":"45QZPS4HUOIN7LjMwxjyf/HdlIqBoq4wG6FfbhWXYLgB8BxKjVGQZpELGPqlMxImBOjlVWHfXkNBGmQNgST2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26e41953b8c4557ad5a5ced813d8d91f17f90b53ac636916d16fc42abd328a97","last_reissued_at":"2026-05-18T00:21:32.203871Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:32.203871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04237","source_version":1,"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:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FsqAF9NmRi7GzTUNbVSCOodL0BuBulvmy9UxFxzrgpZlUXs8Nd5YVuG+NEVLWHmNOmNFBGbaVuKg+CyPNdBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:38:24.114566Z"},"content_sha256":"3f179c947e8d46845dad94fd3a605cd95b98a0dca1026cacca92f14d989f811d","schema_version":"1.0","event_id":"sha256:3f179c947e8d46845dad94fd3a605cd95b98a0dca1026cacca92f14d989f811d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E3SBSU5YYRKXVVNFZ3MBHWGZD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Causal Consistency and Latency Optimality: Friend or Foe?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Diego Didona, Jingjing Wang, Rachid Guerraoui, Willy Zwaenepoel","submitted_at":"2018-03-12T13:18:05Z","abstract_excerpt":"Causal consistency is an attractive consistency model for replicated data stores. It is provably the strongest model that tolerates partitions, it avoids the long latencies associated with strong consistency, and, especially when using read-only transactions, it prevents many of the anomalies of weaker consistency models. Recent work has shown that causal consistency allows \"latency-optimal\" read-only transactions, that are nonblocking, single-version and single-round in terms of communication. On the surface, this latency optimality is very appealing, as the vast majority of applications are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04237","kind":"arxiv","version":1},"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:21:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2spWb/21wa07YB4cHIYp36BaGHzgI4motvhUOP3L9seLH2PCekTxVL41TdgcDwxbXaqwdSbqQ2jhG0MVtG+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:38:24.114909Z"},"content_sha256":"cdf4d8b92b2da35d96001f66e8f4c57a9dafd592a4f1ee32d3f0a288ac805e8b","schema_version":"1.0","event_id":"sha256:cdf4d8b92b2da35d96001f66e8f4c57a9dafd592a4f1ee32d3f0a288ac805e8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/bundle.json","state_url":"https://pith.science/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/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-20T15:38:24Z","links":{"resolver":"https://pith.science/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4","bundle":"https://pith.science/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/bundle.json","state":"https://pith.science/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3SBSU5YYRKXVVNFZ3MBHWGZD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E3SBSU5YYRKXVVNFZ3MBHWGZD4","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":"e4fb04278ca6de505c2ce0e920259951a15fc6e6503d762cd559d34b7f770cc0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T13:18:05Z","title_canon_sha256":"9eebe983f02787c3c5afa7b70b853858ee1a865574013d6289026053a5c3d024"},"schema_version":"1.0","source":{"id":"1803.04237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04237","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04237v1","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04237","created_at":"2026-05-18T00:21:32Z"},{"alias_kind":"pith_short_12","alias_value":"E3SBSU5YYRKX","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E3SBSU5YYRKXVVNF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E3SBSU5Y","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:cdf4d8b92b2da35d96001f66e8f4c57a9dafd592a4f1ee32d3f0a288ac805e8b","target":"graph","created_at":"2026-05-18T00:21:32Z","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":"Causal consistency is an attractive consistency model for replicated data stores. It is provably the strongest model that tolerates partitions, it avoids the long latencies associated with strong consistency, and, especially when using read-only transactions, it prevents many of the anomalies of weaker consistency models. Recent work has shown that causal consistency allows \"latency-optimal\" read-only transactions, that are nonblocking, single-version and single-round in terms of communication. On the surface, this latency optimality is very appealing, as the vast majority of applications are ","authors_text":"Diego Didona, Jingjing Wang, Rachid Guerraoui, Willy Zwaenepoel","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T13:18:05Z","title":"Causal Consistency and Latency Optimality: Friend or Foe?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04237","kind":"arxiv","version":1},"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:3f179c947e8d46845dad94fd3a605cd95b98a0dca1026cacca92f14d989f811d","target":"record","created_at":"2026-05-18T00:21:32Z","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":"e4fb04278ca6de505c2ce0e920259951a15fc6e6503d762cd559d34b7f770cc0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-12T13:18:05Z","title_canon_sha256":"9eebe983f02787c3c5afa7b70b853858ee1a865574013d6289026053a5c3d024"},"schema_version":"1.0","source":{"id":"1803.04237","kind":"arxiv","version":1}},"canonical_sha256":"26e41953b8c4557ad5a5ced813d8d91f17f90b53ac636916d16fc42abd328a97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26e41953b8c4557ad5a5ced813d8d91f17f90b53ac636916d16fc42abd328a97","first_computed_at":"2026-05-18T00:21:32.203871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:32.203871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"45QZPS4HUOIN7LjMwxjyf/HdlIqBoq4wG6FfbhWXYLgB8BxKjVGQZpELGPqlMxImBOjlVWHfXkNBGmQNgST2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:32.204563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f179c947e8d46845dad94fd3a605cd95b98a0dca1026cacca92f14d989f811d","sha256:cdf4d8b92b2da35d96001f66e8f4c57a9dafd592a4f1ee32d3f0a288ac805e8b"],"state_sha256":"885dde0b3322b715878e66138427ba17353c7f60fac6188167cd480789347ddf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uzf3GnFf0RXwyQV+kEKeooPEeWpb5Trk56/u3cdcf+B+6HyJkewPfSkYYhGTrRnZl6y7HwOWp+nRAfmMQWZcDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:38:24.116865Z","bundle_sha256":"5afc8040904e7bc0a5e58427459fd5475a2570d7d239719725ddb47dba1933b8"}}