{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6TDQAVBXWFXKHFGAAA77OSFRXF","short_pith_number":"pith:6TDQAVBX","canonical_record":{"source":{"id":"1908.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-13T06:19:26Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e782528da9cf4010e915fd43ec7017cb6c49b1b312ad90a2c2435e1c56cf8e36","abstract_canon_sha256":"f1d109179857da142315c1210c731959eb2efa2fe8e1656d3628d7a263dfc808"},"schema_version":"1.0"},"canonical_sha256":"f4c7005437b16ea394c0003ff748b1b96c6f78782f1856695745a4621781465e","source":{"kind":"arxiv","id":"1908.04509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04509","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04509v1","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04509","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_12","alias_value":"6TDQAVBXWFXK","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_16","alias_value":"6TDQAVBXWFXKHFGA","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_8","alias_value":"6TDQAVBX","created_at":"2026-07-04T23:55:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6TDQAVBXWFXKHFGAAA77OSFRXF","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-13T06:19:26Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"e782528da9cf4010e915fd43ec7017cb6c49b1b312ad90a2c2435e1c56cf8e36","abstract_canon_sha256":"f1d109179857da142315c1210c731959eb2efa2fe8e1656d3628d7a263dfc808"},"schema_version":"1.0"},"canonical_sha256":"f4c7005437b16ea394c0003ff748b1b96c6f78782f1856695745a4621781465e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:14.325386Z","signature_b64":"ysnzBygzIFFKvkq7Nm+6+qa7HcQbyCV8SxJ7tpoFwWTuNeZi2LXABi69U5Dy5RS2Lb8/6bHNe+RAM/lb/9OXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4c7005437b16ea394c0003ff748b1b96c6f78782f1856695745a4621781465e","last_reissued_at":"2026-07-04T23:55:14.325013Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:14.325013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04509","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-07-04T23:55:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOnGBKWdNA7IvRCk86o3cjf/OL8biM2eXTkZp5gPUFX9klNv5bauSVTTmdzmVghKT6h9Iv2R4I5+N8/scQumCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:55:17.472068Z"},"content_sha256":"a074d361256b61564d3c42877837fe4af07bc119506ca68276dde5f7e8d5438c","schema_version":"1.0","event_id":"sha256:a074d361256b61564d3c42877837fe4af07bc119506ca68276dde5f7e8d5438c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6TDQAVBXWFXKHFGAAA77OSFRXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Checking Transactional Consistency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Constantin Enea, Ranadeep Biswas","submitted_at":"2019-08-13T06:19:26Z","abstract_excerpt":"Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. Modern databases provide different consistency models for transactions corresponding to different tradeoffs between consistency and availability. In this work, we investigate the problem of checking whether a given execution of a transactional database adheres to some consistency model. We show that consistency models like read committed, read atomic, and causal consistency are polynomial time checkable while prefix consistency"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04509","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04509/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"},"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-07-04T23:55:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZw3E/KTU4Hjsu7HzGTZLtOP7sv60uPJR9c/Sk8ipCkBIdyplg60T4IQ0p3cRqc/ltkWgFZNOWN9vuai5T//Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:55:17.472460Z"},"content_sha256":"83358efbe47408b44620797cffa3702b24c895cce1d409e1e78401ed78e792f9","schema_version":"1.0","event_id":"sha256:83358efbe47408b44620797cffa3702b24c895cce1d409e1e78401ed78e792f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/bundle.json","state_url":"https://pith.science/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/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-13T10:55:17Z","links":{"resolver":"https://pith.science/pith/6TDQAVBXWFXKHFGAAA77OSFRXF","bundle":"https://pith.science/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/bundle.json","state":"https://pith.science/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TDQAVBXWFXKHFGAAA77OSFRXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6TDQAVBXWFXKHFGAAA77OSFRXF","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":"f1d109179857da142315c1210c731959eb2efa2fe8e1656d3628d7a263dfc808","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-13T06:19:26Z","title_canon_sha256":"e782528da9cf4010e915fd43ec7017cb6c49b1b312ad90a2c2435e1c56cf8e36"},"schema_version":"1.0","source":{"id":"1908.04509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04509","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04509v1","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04509","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_12","alias_value":"6TDQAVBXWFXK","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_16","alias_value":"6TDQAVBXWFXKHFGA","created_at":"2026-07-04T23:55:14Z"},{"alias_kind":"pith_short_8","alias_value":"6TDQAVBX","created_at":"2026-07-04T23:55:14Z"}],"graph_snapshots":[{"event_id":"sha256:83358efbe47408b44620797cffa3702b24c895cce1d409e1e78401ed78e792f9","target":"graph","created_at":"2026-07-04T23:55:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. Modern databases provide different consistency models for transactions corresponding to different tradeoffs between consistency and availability. In this work, we investigate the problem of checking whether a given execution of a transactional database adheres to some consistency model. We show that consistency models like read committed, read atomic, and causal consistency are polynomial time checkable while prefix consistency","authors_text":"Constantin Enea, Ranadeep Biswas","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-13T06:19:26Z","title":"On the Complexity of Checking Transactional Consistency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04509","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:a074d361256b61564d3c42877837fe4af07bc119506ca68276dde5f7e8d5438c","target":"record","created_at":"2026-07-04T23:55:14Z","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":"f1d109179857da142315c1210c731959eb2efa2fe8e1656d3628d7a263dfc808","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-13T06:19:26Z","title_canon_sha256":"e782528da9cf4010e915fd43ec7017cb6c49b1b312ad90a2c2435e1c56cf8e36"},"schema_version":"1.0","source":{"id":"1908.04509","kind":"arxiv","version":1}},"canonical_sha256":"f4c7005437b16ea394c0003ff748b1b96c6f78782f1856695745a4621781465e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4c7005437b16ea394c0003ff748b1b96c6f78782f1856695745a4621781465e","first_computed_at":"2026-07-04T23:55:14.325013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:14.325013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ysnzBygzIFFKvkq7Nm+6+qa7HcQbyCV8SxJ7tpoFwWTuNeZi2LXABi69U5Dy5RS2Lb8/6bHNe+RAM/lb/9OXBA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:14.325386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a074d361256b61564d3c42877837fe4af07bc119506ca68276dde5f7e8d5438c","sha256:83358efbe47408b44620797cffa3702b24c895cce1d409e1e78401ed78e792f9"],"state_sha256":"eb376b2a27fcda73b0ba4baa2768d8f29dcb84b5df8f864cff842e19fb3da6d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVEI1I/7s6uZZ/v6+9PAIltOjTz1785iUcQJE7VTizOwNfxXU3cfkZ8b3tktBzfssCXjtJI2biBY9hLIYN3kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T10:55:17.474759Z","bundle_sha256":"f5642246523c5974a4f8315309c61103eff91cc0302dd73807c981361ccc8f03"}}