{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3YO64H5DXTROFHFJJ2NDB5OZ36","short_pith_number":"pith:3YO64H5D","canonical_record":{"source":{"id":"1804.00947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-03T13:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"cbceee3c119b18a4dba7232546a3ccdb6acc952b9f66b7444c99ae2f0abf63be","abstract_canon_sha256":"ff38ded02e3501cd518dea47344d6fefa37b35ba3a93fd181054eac74482a762"},"schema_version":"1.0"},"canonical_sha256":"de1dee1fa3bce2e29ca94e9a30f5d9df9fc939ab39ef9d98d0ec94bbada94c9c","source":{"kind":"arxiv","id":"1804.00947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00947","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00947v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00947","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"3YO64H5DXTRO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YO64H5DXTROFHFJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YO64H5D","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3YO64H5DXTROFHFJJ2NDB5OZ36","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-03T13:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"cbceee3c119b18a4dba7232546a3ccdb6acc952b9f66b7444c99ae2f0abf63be","abstract_canon_sha256":"ff38ded02e3501cd518dea47344d6fefa37b35ba3a93fd181054eac74482a762"},"schema_version":"1.0"},"canonical_sha256":"de1dee1fa3bce2e29ca94e9a30f5d9df9fc939ab39ef9d98d0ec94bbada94c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:31.728671Z","signature_b64":"u+LYhCad37+pHSb2RvkqSH0ZB1MkBTo5nX2JQKg0HgJ1J6PLpZuLdXGItsKsxYzYk/1psIXIkKUc9dlsPEziAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1dee1fa3bce2e29ca94e9a30f5d9df9fc939ab39ef9d98d0ec94bbada94c9c","last_reissued_at":"2026-05-18T00:19:31.728281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:31.728281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00947","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQPmqOX/8j6fwz4N6OC5hV8b6EMvTzVTqFFsjDNOSh8ENVdKoqfggKdDDW4yiiFjdGglG49z9renjcIoySu5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:02:37.240514Z"},"content_sha256":"d0d365274fe50130549bb66dbc509a7ab92cec4edfb8b0056fa9513b02313c18","schema_version":"1.0","event_id":"sha256:d0d365274fe50130549bb66dbc509a7ab92cec4edfb8b0056fa9513b02313c18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3YO64H5DXTROFHFJJ2NDB5OZ36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Transactional Conflict Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Alistarh, Giorgi Nadiradze, Raphael K\\\"ubler, Syed Kamran Haider","submitted_at":"2018-04-03T13:15:20Z","abstract_excerpt":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item.\n  While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00947","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:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3lZzS9fo/wh9JmWY6Wt430tPfDsj55NLfo3J/Z7hbWL5mXYcCZinMRFiIymWdftH9KrG2QXqw/KvSOvbi8JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:02:37.240892Z"},"content_sha256":"369f0f2add33cb29f6d464b62d9faa49a0a5d487cd622079506dedf831d8bbea","schema_version":"1.0","event_id":"sha256:369f0f2add33cb29f6d464b62d9faa49a0a5d487cd622079506dedf831d8bbea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/bundle.json","state_url":"https://pith.science/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/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-11T09:02:37Z","links":{"resolver":"https://pith.science/pith/3YO64H5DXTROFHFJJ2NDB5OZ36","bundle":"https://pith.science/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/bundle.json","state":"https://pith.science/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YO64H5DXTROFHFJJ2NDB5OZ36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3YO64H5DXTROFHFJJ2NDB5OZ36","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":"ff38ded02e3501cd518dea47344d6fefa37b35ba3a93fd181054eac74482a762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-03T13:15:20Z","title_canon_sha256":"cbceee3c119b18a4dba7232546a3ccdb6acc952b9f66b7444c99ae2f0abf63be"},"schema_version":"1.0","source":{"id":"1804.00947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00947","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00947v1","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00947","created_at":"2026-05-18T00:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"3YO64H5DXTRO","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3YO64H5DXTROFHFJ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3YO64H5D","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:369f0f2add33cb29f6d464b62d9faa49a0a5d487cd622079506dedf831d8bbea","target":"graph","created_at":"2026-05-18T00:19:31Z","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":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item.\n  While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propos","authors_text":"Dan Alistarh, Giorgi Nadiradze, Raphael K\\\"ubler, Syed Kamran Haider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-03T13:15:20Z","title":"The Transactional Conflict Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00947","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:d0d365274fe50130549bb66dbc509a7ab92cec4edfb8b0056fa9513b02313c18","target":"record","created_at":"2026-05-18T00:19:31Z","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":"ff38ded02e3501cd518dea47344d6fefa37b35ba3a93fd181054eac74482a762","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-03T13:15:20Z","title_canon_sha256":"cbceee3c119b18a4dba7232546a3ccdb6acc952b9f66b7444c99ae2f0abf63be"},"schema_version":"1.0","source":{"id":"1804.00947","kind":"arxiv","version":1}},"canonical_sha256":"de1dee1fa3bce2e29ca94e9a30f5d9df9fc939ab39ef9d98d0ec94bbada94c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de1dee1fa3bce2e29ca94e9a30f5d9df9fc939ab39ef9d98d0ec94bbada94c9c","first_computed_at":"2026-05-18T00:19:31.728281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:31.728281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+LYhCad37+pHSb2RvkqSH0ZB1MkBTo5nX2JQKg0HgJ1J6PLpZuLdXGItsKsxYzYk/1psIXIkKUc9dlsPEziAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:31.728671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0d365274fe50130549bb66dbc509a7ab92cec4edfb8b0056fa9513b02313c18","sha256:369f0f2add33cb29f6d464b62d9faa49a0a5d487cd622079506dedf831d8bbea"],"state_sha256":"f354a61548d22dc83cf0f3446517278e7ccb513c5ab400a43d0896f5daa98ac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VlCHtqeKLEq7r5+jHz0sbudJ03/wv2/nfxE2ApKLZ8BlUIwtrQaVBz6j0oqfWl/H519A9+Y6fkEa4ocRn6RAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:02:37.242849Z","bundle_sha256":"93e15c323d68b35a213628a469d6ce69935171e5a179ed78f3996d1cfc6c0a12"}}