{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WZEBBW7RLCPMM7HQDKHK7ZVDFT","short_pith_number":"pith:WZEBBW7R","canonical_record":{"source":{"id":"1903.02990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-07T15:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"f308b91d323b151c6965a9d7bd27905893dc67dffae26eb1195d9acc0dd0745e","abstract_canon_sha256":"bcbe2cc709e500b8fe21088df24612847c3e65567d7c7db8a4755d507b5d54f7"},"schema_version":"1.0"},"canonical_sha256":"b64810dbf1589ec67cf01a8eafe6a32cc08a324afc871c292a68344517d84041","source":{"kind":"arxiv","id":"1903.02990","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02990","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02990v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02990","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"WZEBBW7RLCPM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WZEBBW7RLCPMM7HQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WZEBBW7R","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WZEBBW7RLCPMM7HQDKHK7ZVDFT","target":"record","payload":{"canonical_record":{"source":{"id":"1903.02990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-07T15:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"f308b91d323b151c6965a9d7bd27905893dc67dffae26eb1195d9acc0dd0745e","abstract_canon_sha256":"bcbe2cc709e500b8fe21088df24612847c3e65567d7c7db8a4755d507b5d54f7"},"schema_version":"1.0"},"canonical_sha256":"b64810dbf1589ec67cf01a8eafe6a32cc08a324afc871c292a68344517d84041","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.470241Z","signature_b64":"2d+oogSUneCwyJakpZ6wU72KkaR9QzdNs4x7YXpjg7CJ4W30uSHj8K/DXGTZMietF29rD4dGoX4LlS9Z7dA6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b64810dbf1589ec67cf01a8eafe6a32cc08a324afc871c292a68344517d84041","last_reissued_at":"2026-05-17T23:44:47.469577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.469577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.02990","source_version":2,"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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWu9XttBWRj1EiQ29MDmXhuLFTBvgUbXLHWzHg0uk0QLxnWaxp8znI7ovXbJU1tAK+87qJpWDi6SiPPmU0isBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:01:02.607905Z"},"content_sha256":"3159376c8870b80409e075878f2671015db5a019724ab9d4c704422447e3a18c","schema_version":"1.0","event_id":"sha256:3159376c8870b80409e075878f2671015db5a019724ab9d4c704422447e3a18c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WZEBBW7RLCPMM7HQDKHK7ZVDFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling OLTP Transactions via Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andrew Pavlo, Anthony Tomasic, Tieying Zhang, Yangjun Sheng","submitted_at":"2019-03-07T15:27:30Z","abstract_excerpt":"Current main memory database system architectures are still challenged by high contention workloads and this challenge will continue to grow as the number of cores in processors continues to increase. These systems schedule transactions randomly across cores to maximize concurrency and to produce a uniform load across cores. Scheduling never considers potential conflicts. Performance could be improved if scheduling balanced between concurrency to maximize throughput and scheduling transactions linearly to avoid conflicts. In this paper, we present the design of several intelligent transaction "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02990","kind":"arxiv","version":2},"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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwU1FJzjd8ijcAnLgSd27dUSN/1T/Ojknk27wQ6LtugcmT6YXCU4rIoHeGr8gUOqeLMWSvigbHdaHznPnRAEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:01:02.608619Z"},"content_sha256":"c07c5151a73fbe38307d916c9d2416295c1a98614708f275b7d9fcd3d807d006","schema_version":"1.0","event_id":"sha256:c07c5151a73fbe38307d916c9d2416295c1a98614708f275b7d9fcd3d807d006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/bundle.json","state_url":"https://pith.science/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/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-29T18:01:02Z","links":{"resolver":"https://pith.science/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT","bundle":"https://pith.science/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/bundle.json","state":"https://pith.science/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZEBBW7RLCPMM7HQDKHK7ZVDFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WZEBBW7RLCPMM7HQDKHK7ZVDFT","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":"bcbe2cc709e500b8fe21088df24612847c3e65567d7c7db8a4755d507b5d54f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-07T15:27:30Z","title_canon_sha256":"f308b91d323b151c6965a9d7bd27905893dc67dffae26eb1195d9acc0dd0745e"},"schema_version":"1.0","source":{"id":"1903.02990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02990","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02990v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02990","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"WZEBBW7RLCPM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"WZEBBW7RLCPMM7HQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"WZEBBW7R","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:c07c5151a73fbe38307d916c9d2416295c1a98614708f275b7d9fcd3d807d006","target":"graph","created_at":"2026-05-17T23:44:47Z","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":"Current main memory database system architectures are still challenged by high contention workloads and this challenge will continue to grow as the number of cores in processors continues to increase. These systems schedule transactions randomly across cores to maximize concurrency and to produce a uniform load across cores. Scheduling never considers potential conflicts. Performance could be improved if scheduling balanced between concurrency to maximize throughput and scheduling transactions linearly to avoid conflicts. In this paper, we present the design of several intelligent transaction ","authors_text":"Andrew Pavlo, Anthony Tomasic, Tieying Zhang, Yangjun Sheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-07T15:27:30Z","title":"Scheduling OLTP Transactions via Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02990","kind":"arxiv","version":2},"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:3159376c8870b80409e075878f2671015db5a019724ab9d4c704422447e3a18c","target":"record","created_at":"2026-05-17T23:44:47Z","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":"bcbe2cc709e500b8fe21088df24612847c3e65567d7c7db8a4755d507b5d54f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-03-07T15:27:30Z","title_canon_sha256":"f308b91d323b151c6965a9d7bd27905893dc67dffae26eb1195d9acc0dd0745e"},"schema_version":"1.0","source":{"id":"1903.02990","kind":"arxiv","version":2}},"canonical_sha256":"b64810dbf1589ec67cf01a8eafe6a32cc08a324afc871c292a68344517d84041","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b64810dbf1589ec67cf01a8eafe6a32cc08a324afc871c292a68344517d84041","first_computed_at":"2026-05-17T23:44:47.469577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.469577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2d+oogSUneCwyJakpZ6wU72KkaR9QzdNs4x7YXpjg7CJ4W30uSHj8K/DXGTZMietF29rD4dGoX4LlS9Z7dA6BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.470241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3159376c8870b80409e075878f2671015db5a019724ab9d4c704422447e3a18c","sha256:c07c5151a73fbe38307d916c9d2416295c1a98614708f275b7d9fcd3d807d006"],"state_sha256":"87689b4f70c1139cfca14c58058a7f041ee03ed33297074a58f5c8d36057c54a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JZ0d6Dx420odVtjTxcODDJoZbRil0xAc+UtDwguJw1bivHLg5i9spAFq4PVOs49QAvhQPhBWxrz26WBegBFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:01:02.612844Z","bundle_sha256":"c9ea72b44577efe3680b74d3ad6ce0e711e0e1767055e341017368e7a33d9dd4"}}