{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:27IU2A532OCX25ZRXE3B3JYSKF","short_pith_number":"pith:27IU2A53","canonical_record":{"source":{"id":"1509.04048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-14T12:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"f101d636f078482f4d11eeb8feeb1c70ce205f1e9d2ca81f6b9ade082fcbc64c","abstract_canon_sha256":"32d19306d8fc390d692087a3c99c7141101359eb9ed9a2dcb8fa6984f0cce3d4"},"schema_version":"1.0"},"canonical_sha256":"d7d14d03bbd3857d7731b9361da7125177e7b9b96e6976c794409ec6f9e2740e","source":{"kind":"arxiv","id":"1509.04048","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04048","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04048v2","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04048","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"27IU2A532OCX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"27IU2A532OCX25ZR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"27IU2A53","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:27IU2A532OCX25ZRXE3B3JYSKF","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-14T12:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"f101d636f078482f4d11eeb8feeb1c70ce205f1e9d2ca81f6b9ade082fcbc64c","abstract_canon_sha256":"32d19306d8fc390d692087a3c99c7141101359eb9ed9a2dcb8fa6984f0cce3d4"},"schema_version":"1.0"},"canonical_sha256":"d7d14d03bbd3857d7731b9361da7125177e7b9b96e6976c794409ec6f9e2740e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.959948Z","signature_b64":"V5QbQUj988o4u4yoItR5IyPmx5Ol9gYsT1ZyEEfZbISjHtPcegOYe814ObIerEEP3i/w5Z/nifrc2sQPPrC0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7d14d03bbd3857d7731b9361da7125177e7b9b96e6976c794409ec6f9e2740e","last_reissued_at":"2026-05-18T01:32:58.959221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.959221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04048","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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fP0t8iQX0stnc2WeLOMwPmP2AaZ3iJyrY4O+uBuSJrgkrZGpWGtK1A4Xf6of5yIevjby/1dyvb8sFGF7md0cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:38:20.944567Z"},"content_sha256":"6e9be35743d603e3d479ce93e81be6c9d43ad462d12e0c9a611c898a20607960","schema_version":"1.0","event_id":"sha256:6e9be35743d603e3d479ce93e81be6c9d43ad462d12e0c9a611c898a20607960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:27IU2A532OCX25ZRXE3B3JYSKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiversion Conflict Notion for Transactional Memory Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Priyanka Kumar, Sathya Peri","submitted_at":"2015-09-14T12:07:49Z","abstract_excerpt":"In recent years, Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing concurrency issues in memory. STM systems take optimistic approach. Multiple transactions are allowed to execute concurrently. On completion, each transaction is validated and if any inconsistency is observed it is aborted. Otherwise it is allowed to commit.\n  In databases a class of histories called as conflict-serializability (CSR) based on the notion of conflicts have been identified, whose membership can be efficiently verified. As a result, CSR is the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04048","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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hT8RsODByYCDkdw5RGygd32YCpHomPwM2oMsNcGqD42Xej5TQg0BXByFyHP48ccs0ubk2I7erJMfXA2TNYN9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:38:20.945265Z"},"content_sha256":"808b226a0705e80814d5fcab7242568072016aee8aca0f6039569af545d42837","schema_version":"1.0","event_id":"sha256:808b226a0705e80814d5fcab7242568072016aee8aca0f6039569af545d42837"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27IU2A532OCX25ZRXE3B3JYSKF/bundle.json","state_url":"https://pith.science/pith/27IU2A532OCX25ZRXE3B3JYSKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27IU2A532OCX25ZRXE3B3JYSKF/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-27T00:38:20Z","links":{"resolver":"https://pith.science/pith/27IU2A532OCX25ZRXE3B3JYSKF","bundle":"https://pith.science/pith/27IU2A532OCX25ZRXE3B3JYSKF/bundle.json","state":"https://pith.science/pith/27IU2A532OCX25ZRXE3B3JYSKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27IU2A532OCX25ZRXE3B3JYSKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:27IU2A532OCX25ZRXE3B3JYSKF","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":"32d19306d8fc390d692087a3c99c7141101359eb9ed9a2dcb8fa6984f0cce3d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-14T12:07:49Z","title_canon_sha256":"f101d636f078482f4d11eeb8feeb1c70ce205f1e9d2ca81f6b9ade082fcbc64c"},"schema_version":"1.0","source":{"id":"1509.04048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04048","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04048v2","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04048","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"27IU2A532OCX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"27IU2A532OCX25ZR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"27IU2A53","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:808b226a0705e80814d5fcab7242568072016aee8aca0f6039569af545d42837","target":"graph","created_at":"2026-05-18T01:32:58Z","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":"In recent years, Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing concurrency issues in memory. STM systems take optimistic approach. Multiple transactions are allowed to execute concurrently. On completion, each transaction is validated and if any inconsistency is observed it is aborted. Otherwise it is allowed to commit.\n  In databases a class of histories called as conflict-serializability (CSR) based on the notion of conflicts have been identified, whose membership can be efficiently verified. As a result, CSR is the c","authors_text":"Priyanka Kumar, Sathya Peri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-14T12:07:49Z","title":"Multiversion Conflict Notion for Transactional Memory Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04048","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:6e9be35743d603e3d479ce93e81be6c9d43ad462d12e0c9a611c898a20607960","target":"record","created_at":"2026-05-18T01:32:58Z","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":"32d19306d8fc390d692087a3c99c7141101359eb9ed9a2dcb8fa6984f0cce3d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-09-14T12:07:49Z","title_canon_sha256":"f101d636f078482f4d11eeb8feeb1c70ce205f1e9d2ca81f6b9ade082fcbc64c"},"schema_version":"1.0","source":{"id":"1509.04048","kind":"arxiv","version":2}},"canonical_sha256":"d7d14d03bbd3857d7731b9361da7125177e7b9b96e6976c794409ec6f9e2740e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7d14d03bbd3857d7731b9361da7125177e7b9b96e6976c794409ec6f9e2740e","first_computed_at":"2026-05-18T01:32:58.959221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:58.959221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5QbQUj988o4u4yoItR5IyPmx5Ol9gYsT1ZyEEfZbISjHtPcegOYe814ObIerEEP3i/w5Z/nifrc2sQPPrC0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:58.959948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e9be35743d603e3d479ce93e81be6c9d43ad462d12e0c9a611c898a20607960","sha256:808b226a0705e80814d5fcab7242568072016aee8aca0f6039569af545d42837"],"state_sha256":"0c55e4515bc86694bc8e93099c816c0e6e68448d56edcd92c69509148ee7606e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzxO38U8MWSiq/ShtiRFHVRTGDldUuou256VuyYOG8Crd5Om2kcjJV7hEQ/G1ZMkJOQzcyPWvjg+RfJX+bwYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:38:20.948099Z","bundle_sha256":"7c3a97ef201e9efa2de7ad85d31d356267f8d60328a03356d0b5f93d4bba2d15"}}