{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OGD3KVOI6Y56BUTO2LD676CXYQ","short_pith_number":"pith:OGD3KVOI","canonical_record":{"source":{"id":"1907.02669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-05T04:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"f22485ae336189a66d51c2f3f0ca4fe5d37a903fe8597a77faf75589574a5a63","abstract_canon_sha256":"07b94a31cab34c9dcb4b84f365814f4976fa044e69b4eb1ddd2921dadcd507d9"},"schema_version":"1.0"},"canonical_sha256":"7187b555c8f63be0d26ed2c7eff857c428b15ce6028029478fee9a50ba748e9a","source":{"kind":"arxiv","id":"1907.02669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02669","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02669v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02669","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"OGD3KVOI6Y56","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OGD3KVOI6Y56BUTO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OGD3KVOI","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OGD3KVOI6Y56BUTO2LD676CXYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-05T04:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"f22485ae336189a66d51c2f3f0ca4fe5d37a903fe8597a77faf75589574a5a63","abstract_canon_sha256":"07b94a31cab34c9dcb4b84f365814f4976fa044e69b4eb1ddd2921dadcd507d9"},"schema_version":"1.0"},"canonical_sha256":"7187b555c8f63be0d26ed2c7eff857c428b15ce6028029478fee9a50ba748e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.552039Z","signature_b64":"I42a5VYexn/oiJgK/T+eHQSM7SaryS08UpTBPFy17XUtCaxAm645FnYCPiVuADhqWRmIzal2eZdal2tq4AIEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7187b555c8f63be0d26ed2c7eff857c428b15ce6028029478fee9a50ba748e9a","last_reissued_at":"2026-05-17T23:41:23.551343Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.551343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02669","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-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qX80gXcHjODcqYa68eLz6enaUtdk2XtlsKg/cydBeC+Kh9oHcZlr4x42/ppj/Z6Mnb5SpREwglEnGuJy+KyaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:59:10.141818Z"},"content_sha256":"6e326f6920dcea0a8c01066b7ae7bf3ec4e659641f10f341c0a7bd9f6876c43f","schema_version":"1.0","event_id":"sha256:6e326f6920dcea0a8c01066b7ae7bf3ec4e659641f10f341c0a7bd9f6876c43f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OGD3KVOI6Y56BUTO2LD676CXYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Cost of Concurrency in Hybrid Transactional Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Srivatsan Ravi, Trevor Brown","submitted_at":"2019-07-05T04:01:30Z","abstract_excerpt":"State-of-the-art \\emph{software transactional memory (STM)} implementations achieve good performance by carefully avoiding the overhead of \\emph{incremental validation} (i.e., re-reading previously read data items to avoid inconsistency) while still providing \\emph{progressiveness} (allowing transactional aborts only due to \\emph{data conflicts}). Hardware transactional memory (HTM) implementations promise even better performance, but offer no progress guarantees. Thus, they must be combined with STMs, leading to \\emph{hybrid} TMs (HyTMs) in which hardware transactions must be \\emph{instrument"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02669","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-17T23:41:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c85Os6cwyQP0kDLPCj481+JSscWJ9//ME+ZsO1yXVIcmqEeNNmGburdWqT9RwT32ohyWfzxXIsZ7GqeBEum1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:59:10.142537Z"},"content_sha256":"7e51a97178edd0f1642935a16b9ce650d3f997971bd88625854f78ff4bc56149","schema_version":"1.0","event_id":"sha256:7e51a97178edd0f1642935a16b9ce650d3f997971bd88625854f78ff4bc56149"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/bundle.json","state_url":"https://pith.science/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/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-25T15:59:10Z","links":{"resolver":"https://pith.science/pith/OGD3KVOI6Y56BUTO2LD676CXYQ","bundle":"https://pith.science/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/bundle.json","state":"https://pith.science/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGD3KVOI6Y56BUTO2LD676CXYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OGD3KVOI6Y56BUTO2LD676CXYQ","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":"07b94a31cab34c9dcb4b84f365814f4976fa044e69b4eb1ddd2921dadcd507d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-05T04:01:30Z","title_canon_sha256":"f22485ae336189a66d51c2f3f0ca4fe5d37a903fe8597a77faf75589574a5a63"},"schema_version":"1.0","source":{"id":"1907.02669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02669","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02669v1","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02669","created_at":"2026-05-17T23:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"OGD3KVOI6Y56","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OGD3KVOI6Y56BUTO","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OGD3KVOI","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7e51a97178edd0f1642935a16b9ce650d3f997971bd88625854f78ff4bc56149","target":"graph","created_at":"2026-05-17T23:41:23Z","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":"State-of-the-art \\emph{software transactional memory (STM)} implementations achieve good performance by carefully avoiding the overhead of \\emph{incremental validation} (i.e., re-reading previously read data items to avoid inconsistency) while still providing \\emph{progressiveness} (allowing transactional aborts only due to \\emph{data conflicts}). Hardware transactional memory (HTM) implementations promise even better performance, but offer no progress guarantees. Thus, they must be combined with STMs, leading to \\emph{hybrid} TMs (HyTMs) in which hardware transactions must be \\emph{instrument","authors_text":"Srivatsan Ravi, Trevor Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-05T04:01:30Z","title":"On the Cost of Concurrency in Hybrid Transactional Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02669","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:6e326f6920dcea0a8c01066b7ae7bf3ec4e659641f10f341c0a7bd9f6876c43f","target":"record","created_at":"2026-05-17T23:41:23Z","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":"07b94a31cab34c9dcb4b84f365814f4976fa044e69b4eb1ddd2921dadcd507d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-05T04:01:30Z","title_canon_sha256":"f22485ae336189a66d51c2f3f0ca4fe5d37a903fe8597a77faf75589574a5a63"},"schema_version":"1.0","source":{"id":"1907.02669","kind":"arxiv","version":1}},"canonical_sha256":"7187b555c8f63be0d26ed2c7eff857c428b15ce6028029478fee9a50ba748e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7187b555c8f63be0d26ed2c7eff857c428b15ce6028029478fee9a50ba748e9a","first_computed_at":"2026-05-17T23:41:23.551343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:23.551343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I42a5VYexn/oiJgK/T+eHQSM7SaryS08UpTBPFy17XUtCaxAm645FnYCPiVuADhqWRmIzal2eZdal2tq4AIEDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:23.552039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e326f6920dcea0a8c01066b7ae7bf3ec4e659641f10f341c0a7bd9f6876c43f","sha256:7e51a97178edd0f1642935a16b9ce650d3f997971bd88625854f78ff4bc56149"],"state_sha256":"f21706cdbc537c647f464b7f4bff0240c95608cf02135df33deda46ad897fcb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWTRnxt05wZCypVgeQp4tCcQL3QtneEjJqdD4IsHXuMbsvTe9JNWomJDWpZO8arMI7KR5AL7fQzcqi0/gyiwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:59:10.146503Z","bundle_sha256":"763bd46f8e891561e3671a1c21304940e1d50ddef9b10038276a6dd11f56b9d6"}}