{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QTNLCANWZKM4DAYAWWKPVKQYNN","short_pith_number":"pith:QTNLCANW","canonical_record":{"source":{"id":"1810.01997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"346e793ff35bad2ad1b1ceaa066bc3f0e98a299a5230f4202c53970c64b10551","abstract_canon_sha256":"c6fc75f09a95d92662878e849ffff175de08d1b66773c02689d79ade49e78a59"},"schema_version":"1.0"},"canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","source":{"kind":"arxiv","id":"1810.01997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01997","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01997v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01997","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QTNLCANWZKM4","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTNLCANWZKM4DAYA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTNLCANW","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QTNLCANWZKM4DAYAWWKPVKQYNN","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"346e793ff35bad2ad1b1ceaa066bc3f0e98a299a5230f4202c53970c64b10551","abstract_canon_sha256":"c6fc75f09a95d92662878e849ffff175de08d1b66773c02689d79ade49e78a59"},"schema_version":"1.0"},"canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.591513Z","signature_b64":"DxbELKCAU4+g3nEpYPrGqH4uYKJjNvBdC3OJNU2VcMp/uR6Yr4tX09cbzw8nX1wz89C+eMykIovNEXJsTRDuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","last_reissued_at":"2026-05-18T00:04:06.590744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.590744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01997","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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuOYnBxdpR95NJE5UN3T7/dX4j8fuGoFU7afQ5Ae3QT8CLgMk1EmEPSEFPNv0YPHcbpZ4DC6H1cv1b62IA6eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:19.002869Z"},"content_sha256":"d40c1125f1a5fe69e9d11a77750bf9e3c5b9f7bc776754ac5c07d2716cffa19a","schema_version":"1.0","event_id":"sha256:d40c1125f1a5fe69e9d11a77750bf9e3c5b9f7bc776754ac5c07d2716cffa19a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QTNLCANWZKM4DAYAWWKPVKQYNN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving High Contention OLTP Performance via Transaction Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alvin Cheung, Dan Suciu, Guna Prasaad","submitted_at":"2018-10-03T22:53:29Z","abstract_excerpt":"Research in transaction processing has made significant progress in improving the performance of multi-core in-memory transactional systems. However, the focus has mainly been on low-contention workloads. Modern transactional systems perform poorly on workloads with transactions accessing a few highly contended data items. We observe that most transactional workloads, including those with high contention, can be divided into clusters of data conflict-free transactions and a small set of residuals. In this paper, we introduce a new concurrency control protocol called Strife that leverages the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01997","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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8KXCvuD/DZ4+GjbyPofTPW5OunjflLxmNs0hLVKS0EizGnVGtYOGRg9PfQNxutMKQFw6jcmrEl/dTZPoG/qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:19.003221Z"},"content_sha256":"10414d0d255f2910023b9313bc456029f6b351498a95876cd4e4a688483c14fc","schema_version":"1.0","event_id":"sha256:10414d0d255f2910023b9313bc456029f6b351498a95876cd4e4a688483c14fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/bundle.json","state_url":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/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-05-25T23:42:19Z","links":{"resolver":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN","bundle":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/bundle.json","state":"https://pith.science/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTNLCANWZKM4DAYAWWKPVKQYNN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QTNLCANWZKM4DAYAWWKPVKQYNN","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":"c6fc75f09a95d92662878e849ffff175de08d1b66773c02689d79ade49e78a59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","title_canon_sha256":"346e793ff35bad2ad1b1ceaa066bc3f0e98a299a5230f4202c53970c64b10551"},"schema_version":"1.0","source":{"id":"1810.01997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01997","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01997v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01997","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QTNLCANWZKM4","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTNLCANWZKM4DAYA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTNLCANW","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:10414d0d255f2910023b9313bc456029f6b351498a95876cd4e4a688483c14fc","target":"graph","created_at":"2026-05-18T00:04:06Z","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":"Research in transaction processing has made significant progress in improving the performance of multi-core in-memory transactional systems. However, the focus has mainly been on low-contention workloads. Modern transactional systems perform poorly on workloads with transactions accessing a few highly contended data items. We observe that most transactional workloads, including those with high contention, can be divided into clusters of data conflict-free transactions and a small set of residuals. In this paper, we introduce a new concurrency control protocol called Strife that leverages the a","authors_text":"Alvin Cheung, Dan Suciu, Guna Prasaad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","title":"Improving High Contention OLTP Performance via Transaction Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01997","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:d40c1125f1a5fe69e9d11a77750bf9e3c5b9f7bc776754ac5c07d2716cffa19a","target":"record","created_at":"2026-05-18T00:04:06Z","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":"c6fc75f09a95d92662878e849ffff175de08d1b66773c02689d79ade49e78a59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-03T22:53:29Z","title_canon_sha256":"346e793ff35bad2ad1b1ceaa066bc3f0e98a299a5230f4202c53970c64b10551"},"schema_version":"1.0","source":{"id":"1810.01997","kind":"arxiv","version":1}},"canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84dab101b6ca99c18300b594faaa186b416e04f1b1a18c3e1b275706a86637ba","first_computed_at":"2026-05-18T00:04:06.590744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:06.590744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DxbELKCAU4+g3nEpYPrGqH4uYKJjNvBdC3OJNU2VcMp/uR6Yr4tX09cbzw8nX1wz89C+eMykIovNEXJsTRDuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:06.591513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d40c1125f1a5fe69e9d11a77750bf9e3c5b9f7bc776754ac5c07d2716cffa19a","sha256:10414d0d255f2910023b9313bc456029f6b351498a95876cd4e4a688483c14fc"],"state_sha256":"2a7328d941147b4ea5f80af4e43efdf551da263c0558e69d8c2626885e28ea46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtiA+jGedbTaWAohPV5AyBqm1f3svcz9MFLhsfbpe36p7UkbRQvfVtb4+00uhcn81p0I01npwwLVGJ3khWozCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:42:19.006596Z","bundle_sha256":"d3817038b0563dc916aba0716e5387e895b6706b8bad808e4e18961be4b89f35"}}