{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BPQTTHYPP22SM2USXT4ZNS6YXP","short_pith_number":"pith:BPQTTHYP","canonical_record":{"source":{"id":"1904.04702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-04-09T14:35:42Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"71ff9db11350e0cb4cdcdf19711ff53040cc4c71da211052b8ebe35c32de378c","abstract_canon_sha256":"3ba2b5a49ae3588a7d417c2680c822c90adcafd4f2cc2bc213ea9ce079b34368"},"schema_version":"1.0"},"canonical_sha256":"0be1399f0f7eb5266a92bcf996cbd8bbe2d5234f3833a1bac2bb70f1c11ae16f","source":{"kind":"arxiv","id":"1904.04702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04702","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04702v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04702","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"BPQTTHYPP22S","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BPQTTHYPP22SM2US","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BPQTTHYP","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BPQTTHYPP22SM2USXT4ZNS6YXP","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-04-09T14:35:42Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"71ff9db11350e0cb4cdcdf19711ff53040cc4c71da211052b8ebe35c32de378c","abstract_canon_sha256":"3ba2b5a49ae3588a7d417c2680c822c90adcafd4f2cc2bc213ea9ce079b34368"},"schema_version":"1.0"},"canonical_sha256":"0be1399f0f7eb5266a92bcf996cbd8bbe2d5234f3833a1bac2bb70f1c11ae16f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.364373Z","signature_b64":"9ZbOBalDPtE3lFCoXqXCm7+wNlYwmdL/KuYug6Lup4qttEdWkeZPetPeR7GLP4ADGpZgGaPFVZTHa2M+1kFCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be1399f0f7eb5266a92bcf996cbd8bbe2d5234f3833a1bac2bb70f1c11ae16f","last_reissued_at":"2026-05-17T23:48:58.363974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.363974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04702","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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6StvcfePLmz2dlrlxdckac+xWxvZ25RjFNdYk+mN/nOBXP+1p10sngdNe2qczwhQ+KVekYHpWXKXmFujojG6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:45:53.491478Z"},"content_sha256":"44816e5158dd91396a55a8e2c5038867f7c7b5d35808fe222ca543d665c69b5d","schema_version":"1.0","event_id":"sha256:44816e5158dd91396a55a8e2c5038867f7c7b5d35808fe222ca543d665c69b5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BPQTTHYPP22SM2USXT4ZNS6YXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Corruption in Eventually-Consistent Graph Databases","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.DB","authors_text":"Isi Mitrani, Jim Webber, Paul Ezhilchelvan","submitted_at":"2019-04-09T14:35:42Z","abstract_excerpt":"We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from contemporary graph database management systems. To explore the problem space, we use two common graph topologies as data models for realistic experimentation. The analysis reveals, even assuming completely fault-free hardware and bug-free software, that if it is possible for updates to interfere with one-another, corruption will occur and spread significantly throu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04702","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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAgWpwDcEfvfKad8CrGpz/3D40Dtn+7CbFT5IPZ2fGqk3crzSQijYIsk/gLY0/4hPAEZtH+U7Rad73m+ELHDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:45:53.491822Z"},"content_sha256":"59b5c8ddc59aad1dbb455bf8b3d4f3da6ea386bac5928b2f43cc0ed4948ff524","schema_version":"1.0","event_id":"sha256:59b5c8ddc59aad1dbb455bf8b3d4f3da6ea386bac5928b2f43cc0ed4948ff524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/bundle.json","state_url":"https://pith.science/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/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-07-02T11:45:53Z","links":{"resolver":"https://pith.science/pith/BPQTTHYPP22SM2USXT4ZNS6YXP","bundle":"https://pith.science/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/bundle.json","state":"https://pith.science/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPQTTHYPP22SM2USXT4ZNS6YXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BPQTTHYPP22SM2USXT4ZNS6YXP","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":"3ba2b5a49ae3588a7d417c2680c822c90adcafd4f2cc2bc213ea9ce079b34368","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-04-09T14:35:42Z","title_canon_sha256":"71ff9db11350e0cb4cdcdf19711ff53040cc4c71da211052b8ebe35c32de378c"},"schema_version":"1.0","source":{"id":"1904.04702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04702","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04702v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04702","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"BPQTTHYPP22S","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BPQTTHYPP22SM2US","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BPQTTHYP","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:59b5c8ddc59aad1dbb455bf8b3d4f3da6ea386bac5928b2f43cc0ed4948ff524","target":"graph","created_at":"2026-05-17T23:48:58Z","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 present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from contemporary graph database management systems. To explore the problem space, we use two common graph topologies as data models for realistic experimentation. The analysis reveals, even assuming completely fault-free hardware and bug-free software, that if it is possible for updates to interfere with one-another, corruption will occur and spread significantly throu","authors_text":"Isi Mitrani, Jim Webber, Paul Ezhilchelvan","cross_cats":["cs.DC","cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-04-09T14:35:42Z","title":"Modeling Corruption in Eventually-Consistent Graph Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04702","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:44816e5158dd91396a55a8e2c5038867f7c7b5d35808fe222ca543d665c69b5d","target":"record","created_at":"2026-05-17T23:48:58Z","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":"3ba2b5a49ae3588a7d417c2680c822c90adcafd4f2cc2bc213ea9ce079b34368","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2019-04-09T14:35:42Z","title_canon_sha256":"71ff9db11350e0cb4cdcdf19711ff53040cc4c71da211052b8ebe35c32de378c"},"schema_version":"1.0","source":{"id":"1904.04702","kind":"arxiv","version":1}},"canonical_sha256":"0be1399f0f7eb5266a92bcf996cbd8bbe2d5234f3833a1bac2bb70f1c11ae16f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be1399f0f7eb5266a92bcf996cbd8bbe2d5234f3833a1bac2bb70f1c11ae16f","first_computed_at":"2026-05-17T23:48:58.363974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:58.363974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ZbOBalDPtE3lFCoXqXCm7+wNlYwmdL/KuYug6Lup4qttEdWkeZPetPeR7GLP4ADGpZgGaPFVZTHa2M+1kFCAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:58.364373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44816e5158dd91396a55a8e2c5038867f7c7b5d35808fe222ca543d665c69b5d","sha256:59b5c8ddc59aad1dbb455bf8b3d4f3da6ea386bac5928b2f43cc0ed4948ff524"],"state_sha256":"f3fef87ca135e1ad3e778e15d797525131f371454cf728b6bb1226862cb87bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ny6sktmGR+4zYYuRsyvl7Lr9pg0LLg27a7szs5Uu96kBbygCFbh0Ltys0eLVYmtboleQJWf67If6AMvQPCpMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T11:45:53.493729Z","bundle_sha256":"71cd6cebaa0b253d2b6e7be9572de272738bd0835db4a9370bf05b3d455ad78d"}}