{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ONN3TEMFWPNNTQF2I772TNNFVG","short_pith_number":"pith:ONN3TEMF","canonical_record":{"source":{"id":"1201.0228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"5ccf7408e0d2527b571439169b890c774388c25ebf651646ab650335d6fd7b03","abstract_canon_sha256":"dbb1d593514f3f782a99804d087f29af098094c3ec1c9179f82bc8b702f69b16"},"schema_version":"1.0"},"canonical_sha256":"735bb99185b3dad9c0ba47ffa9b5a5a99f1096019545adc7a8a5e5348b67919c","source":{"kind":"arxiv","id":"1201.0228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0228","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0228v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0228","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"ONN3TEMFWPNN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"ONN3TEMFWPNNTQF2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"ONN3TEMF","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ONN3TEMFWPNNTQF2I772TNNFVG","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"5ccf7408e0d2527b571439169b890c774388c25ebf651646ab650335d6fd7b03","abstract_canon_sha256":"dbb1d593514f3f782a99804d087f29af098094c3ec1c9179f82bc8b702f69b16"},"schema_version":"1.0"},"canonical_sha256":"735bb99185b3dad9c0ba47ffa9b5a5a99f1096019545adc7a8a5e5348b67919c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:25.778659Z","signature_b64":"Y7Ame+SuzDsmgySgXcYZpkAs960ThvrMVJ2g76pFxNagqV37xozXgFK70nWQ8mJq31HEa+q0TPFW/8rsu9gRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735bb99185b3dad9c0ba47ffa9b5a5a99f1096019545adc7a8a5e5348b67919c","last_reissued_at":"2026-05-18T04:05:25.777892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:25.777892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0228","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytq2/NxmoQzdoDxIpsK+g1nLZCtfSsZjmhjDQQuou6bU8ZaxtMLXuUAojIoPKNdWLb8jRywM0lmV9soggyMqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:08.950756Z"},"content_sha256":"8cf24a20231c7a06be69ffef60caf264ddbbd59dfe5cf2b26178f61fadc0accf","schema_version":"1.0","event_id":"sha256:8cf24a20231c7a06be69ffef60caf264ddbbd59dfe5cf2b26178f61fadc0accf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ONN3TEMFWPNNTQF2I772TNNFVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Performance Concurrency Control Mechanisms for Main-Memory Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Craig Freedman, Cristian Diaconu, Jignesh M. Patel, Mike Zwilling, Per-{\\AA}ke Larson, Spyros Blanas","submitted_at":"2011-12-31T05:34:34Z","abstract_excerpt":"A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured: one is optimistic and one is pessimistic. To avoid expensive context switching, transactions never block during normal processin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0228","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUL4bOx8icw326SP2GZ+dgrqQ7CJUl3RdQhJ6JQ+HQ0GED2Z4LrHne+PdtEcbWMfK75mPztDPb+Wb78EJohrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:44:08.951426Z"},"content_sha256":"675307c2e9cc022f9dc45f205131bb2a23338eee19af953dcbf94ffe878a5075","schema_version":"1.0","event_id":"sha256:675307c2e9cc022f9dc45f205131bb2a23338eee19af953dcbf94ffe878a5075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONN3TEMFWPNNTQF2I772TNNFVG/bundle.json","state_url":"https://pith.science/pith/ONN3TEMFWPNNTQF2I772TNNFVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONN3TEMFWPNNTQF2I772TNNFVG/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-30T22:44:08Z","links":{"resolver":"https://pith.science/pith/ONN3TEMFWPNNTQF2I772TNNFVG","bundle":"https://pith.science/pith/ONN3TEMFWPNNTQF2I772TNNFVG/bundle.json","state":"https://pith.science/pith/ONN3TEMFWPNNTQF2I772TNNFVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONN3TEMFWPNNTQF2I772TNNFVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ONN3TEMFWPNNTQF2I772TNNFVG","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":"dbb1d593514f3f782a99804d087f29af098094c3ec1c9179f82bc8b702f69b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:34Z","title_canon_sha256":"5ccf7408e0d2527b571439169b890c774388c25ebf651646ab650335d6fd7b03"},"schema_version":"1.0","source":{"id":"1201.0228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0228","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0228v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0228","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"ONN3TEMFWPNN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"ONN3TEMFWPNNTQF2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"ONN3TEMF","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:675307c2e9cc022f9dc45f205131bb2a23338eee19af953dcbf94ffe878a5075","target":"graph","created_at":"2026-05-18T04:05:25Z","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":"A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured: one is optimistic and one is pessimistic. To avoid expensive context switching, transactions never block during normal processin","authors_text":"Craig Freedman, Cristian Diaconu, Jignesh M. Patel, Mike Zwilling, Per-{\\AA}ke Larson, Spyros Blanas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:34Z","title":"High-Performance Concurrency Control Mechanisms for Main-Memory Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0228","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:8cf24a20231c7a06be69ffef60caf264ddbbd59dfe5cf2b26178f61fadc0accf","target":"record","created_at":"2026-05-18T04:05:25Z","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":"dbb1d593514f3f782a99804d087f29af098094c3ec1c9179f82bc8b702f69b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:34:34Z","title_canon_sha256":"5ccf7408e0d2527b571439169b890c774388c25ebf651646ab650335d6fd7b03"},"schema_version":"1.0","source":{"id":"1201.0228","kind":"arxiv","version":1}},"canonical_sha256":"735bb99185b3dad9c0ba47ffa9b5a5a99f1096019545adc7a8a5e5348b67919c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"735bb99185b3dad9c0ba47ffa9b5a5a99f1096019545adc7a8a5e5348b67919c","first_computed_at":"2026-05-18T04:05:25.777892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:25.777892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y7Ame+SuzDsmgySgXcYZpkAs960ThvrMVJ2g76pFxNagqV37xozXgFK70nWQ8mJq31HEa+q0TPFW/8rsu9gRBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:25.778659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cf24a20231c7a06be69ffef60caf264ddbbd59dfe5cf2b26178f61fadc0accf","sha256:675307c2e9cc022f9dc45f205131bb2a23338eee19af953dcbf94ffe878a5075"],"state_sha256":"6c23274433b58715c74edd496cb30da664bdeb61e5c0eb14cf3f3e4627374b7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Az0dIl0SgD53mbBzEwp9yUvsUja6a7dkrRNFmB7IwOKYj/V8W9nRd3MyNgbF7KaIHICp0wtXXRhmgj8Z5XlJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:44:08.955912Z","bundle_sha256":"64bac2ac224cd63926f32ee66a26c78f73274d9bed74130e437e8af9ac47caf7"}}