{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F2UDWCGGB6C4BBJEK7CIBUCUJ3","short_pith_number":"pith:F2UDWCGG","canonical_record":{"source":{"id":"1811.04967","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"581bc5afb3b25b0dee294c5ee77e219600afcc6c591e3449ebdf62bd6fce6283","abstract_canon_sha256":"c9f466df2440b34b7091340dde4e6bc6c76556dc876e5bb08a9d0882786763d7"},"schema_version":"1.0"},"canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","source":{"kind":"arxiv","id":"1811.04967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04967","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04967v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04967","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"F2UDWCGGB6C4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2UDWCGGB6C4BBJE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2UDWCGG","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F2UDWCGGB6C4BBJEK7CIBUCUJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04967","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"581bc5afb3b25b0dee294c5ee77e219600afcc6c591e3449ebdf62bd6fce6283","abstract_canon_sha256":"c9f466df2440b34b7091340dde4e6bc6c76556dc876e5bb08a9d0882786763d7"},"schema_version":"1.0"},"canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.552086Z","signature_b64":"bnCSDsAh5ZRVf/pRkvLp8lbMAuMKayPsrt+r4kWwl02JgkzWwNd2ncu+Xql34DVlpubC2RBUaWTre95lP7GjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","last_reissued_at":"2026-05-18T00:01:01.551513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.551513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04967","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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hr+mr2QnEJXR+xiRnDijil31c2siGAJnpsDd5gFkFxILAbsfVHteGHIrkmukUr/FyKsVEO9WM2GuW5ZTLQj7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:23:09.051750Z"},"content_sha256":"d29c30345e67a8f50641bc63be46ac2887bca3aa8a53673b046dad3da2308d49","schema_version":"1.0","event_id":"sha256:d29c30345e67a8f50641bc63be46ac2887bca3aa8a53673b046dad3da2308d49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F2UDWCGGB6C4BBJEK7CIBUCUJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Impact of Timestamp Granularity in Optimistic Concurrency Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Barbara Liskov, Eddie Kohler, Hao Bai, Liuba Shrira, Yihe Huang","submitted_at":"2018-11-12T19:15:27Z","abstract_excerpt":"Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high contention levels, OCC is susceptible to frequent aborts, leading to wasted work and degraded performance. Contention managers, mixed optimistic/pessimistic concurrency control algorithms, and novel optimistic-inspired concurrency control algorithms, such as TicToc, aim to address this problem, but these mechanisms introduce sometimes-high overheads of thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04967","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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFpm9J28LzmsHe2cpJmP/Ujk7XWdNBCrd/FGLKTgPevsRfZow2xcwsIWqsPAK3cwDdiEZyhXUddwkmXbqh0yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:23:09.052087Z"},"content_sha256":"0c0b8d091dd39e7d553c3805eb663cacb069e5780a783f1a5d15d5c3ec968e11","schema_version":"1.0","event_id":"sha256:0c0b8d091dd39e7d553c3805eb663cacb069e5780a783f1a5d15d5c3ec968e11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/bundle.json","state_url":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/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-22T09:23:09Z","links":{"resolver":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3","bundle":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/bundle.json","state":"https://pith.science/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2UDWCGGB6C4BBJEK7CIBUCUJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F2UDWCGGB6C4BBJEK7CIBUCUJ3","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":"c9f466df2440b34b7091340dde4e6bc6c76556dc876e5bb08a9d0882786763d7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","title_canon_sha256":"581bc5afb3b25b0dee294c5ee77e219600afcc6c591e3449ebdf62bd6fce6283"},"schema_version":"1.0","source":{"id":"1811.04967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04967","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04967v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04967","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"F2UDWCGGB6C4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2UDWCGGB6C4BBJE","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2UDWCGG","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0c0b8d091dd39e7d553c3805eb663cacb069e5780a783f1a5d15d5c3ec968e11","target":"graph","created_at":"2026-05-18T00:01:01Z","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":"Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high contention levels, OCC is susceptible to frequent aborts, leading to wasted work and degraded performance. Contention managers, mixed optimistic/pessimistic concurrency control algorithms, and novel optimistic-inspired concurrency control algorithms, such as TicToc, aim to address this problem, but these mechanisms introduce sometimes-high overheads of thei","authors_text":"Barbara Liskov, Eddie Kohler, Hao Bai, Liuba Shrira, Yihe Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","title":"The Impact of Timestamp Granularity in Optimistic Concurrency Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04967","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:d29c30345e67a8f50641bc63be46ac2887bca3aa8a53673b046dad3da2308d49","target":"record","created_at":"2026-05-18T00:01:01Z","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":"c9f466df2440b34b7091340dde4e6bc6c76556dc876e5bb08a9d0882786763d7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-11-12T19:15:27Z","title_canon_sha256":"581bc5afb3b25b0dee294c5ee77e219600afcc6c591e3449ebdf62bd6fce6283"},"schema_version":"1.0","source":{"id":"1811.04967","kind":"arxiv","version":1}},"canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea83b08c60f85c0852457c480d0544efb98fcfa0ca5d26ed752e000d9524815","first_computed_at":"2026-05-18T00:01:01.551513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:01.551513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bnCSDsAh5ZRVf/pRkvLp8lbMAuMKayPsrt+r4kWwl02JgkzWwNd2ncu+Xql34DVlpubC2RBUaWTre95lP7GjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:01.552086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d29c30345e67a8f50641bc63be46ac2887bca3aa8a53673b046dad3da2308d49","sha256:0c0b8d091dd39e7d553c3805eb663cacb069e5780a783f1a5d15d5c3ec968e11"],"state_sha256":"ea2b9ee320605e2455764bd56353d4fce673001c122611ccda4c294a2808458a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgguxY5adbZNA2dReo5AqJYbNNzMaCcf+CnewWbYCwzH3yHKzfv3kV0+3A23MLSXtrc04D77rkr/BLFYSE7zDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:23:09.054076Z","bundle_sha256":"34b052da5a4c09512a8c4fd53d8a02e15d0bb41132f96d3905a9ae1089cfbee8"}}