{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N4NXLNVQU66ROALJWPPRZRSUZM","short_pith_number":"pith:N4NXLNVQ","canonical_record":{"source":{"id":"1103.1302","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-07T15:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"3fe31061b1f2cababe8c9938bf9c8bac3d04644670915c691bbbf83ea3e5a859","abstract_canon_sha256":"90b9f45c63bd044c8bdf5bd252983db66b2a534ee6c4e453f044cb447d0841b9"},"schema_version":"1.0"},"canonical_sha256":"6f1b75b6b0a7bd170169b3df1cc654cb018ef83fa05e39faeb2896eb3bd30129","source":{"kind":"arxiv","id":"1103.1302","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1302","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1302v9","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1302","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"pith_short_12","alias_value":"N4NXLNVQU66R","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4NXLNVQU66ROALJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4NXLNVQ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N4NXLNVQU66ROALJWPPRZRSUZM","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1302","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-07T15:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"3fe31061b1f2cababe8c9938bf9c8bac3d04644670915c691bbbf83ea3e5a859","abstract_canon_sha256":"90b9f45c63bd044c8bdf5bd252983db66b2a534ee6c4e453f044cb447d0841b9"},"schema_version":"1.0"},"canonical_sha256":"6f1b75b6b0a7bd170169b3df1cc654cb018ef83fa05e39faeb2896eb3bd30129","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:46.390948Z","signature_b64":"stV2fuDFUc4tTDkBjIivUkGVC/jdid6eYHveHTpoW9SgNBdhzubwRgCd4R6Hyi6QOOjKPMgi9GXGNQtelGVxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f1b75b6b0a7bd170169b3df1cc654cb018ef83fa05e39faeb2896eb3bd30129","last_reissued_at":"2026-05-18T03:19:46.390071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:46.390071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1302","source_version":9,"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-18T03:19:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFV2EKvzlYztbrBoJftcLvsrtt+VGEPbHALo4AieobfDjQO1S0PsJVD1kKg9+kSwU242MXtQldN1HTOhX8YMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:46:58.135475Z"},"content_sha256":"690d2ad02e08fbff6fb710265c5eb38a298f32f018110852661e5c3feb500fa3","schema_version":"1.0","event_id":"sha256:690d2ad02e08fbff6fb710265c5eb38a298f32f018110852661e5c3feb500fa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N4NXLNVQU66ROALJWPPRZRSUZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Cost of Concurrency in Transactional Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Srivatsan Ravi","submitted_at":"2011-03-07T15:37:44Z","abstract_excerpt":"The crux of software transactional memory (STM) is to combine an easy-to-use programming interface with an efficient utilization of the concurrent-computing abilities provided by modern machines. But does this combination come with an inherent cost? We evaluate the cost of concurrency by measuring the amount of expensive synchronization that must be employed in an STM implementation that ensures positive concurrency, i.e., allows for concurrent transaction processing in some executions. We focus on two popular progress conditions that provide positive concurrency: progressiveness and permissiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1302","kind":"arxiv","version":9},"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-18T03:19:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i53kGPukEZZQ68+kjv0b1HRwBaAaMnssbf/twhyrC+pSMxs3CD4+GldZRSgE0kH1IOH3okfzc6ARGbWyxipNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:46:58.136150Z"},"content_sha256":"a187861599697166730920419e5a3a25eb53c05ef39839009ffe297a8f7dfbd2","schema_version":"1.0","event_id":"sha256:a187861599697166730920419e5a3a25eb53c05ef39839009ffe297a8f7dfbd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4NXLNVQU66ROALJWPPRZRSUZM/bundle.json","state_url":"https://pith.science/pith/N4NXLNVQU66ROALJWPPRZRSUZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4NXLNVQU66ROALJWPPRZRSUZM/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-09T11:46:58Z","links":{"resolver":"https://pith.science/pith/N4NXLNVQU66ROALJWPPRZRSUZM","bundle":"https://pith.science/pith/N4NXLNVQU66ROALJWPPRZRSUZM/bundle.json","state":"https://pith.science/pith/N4NXLNVQU66ROALJWPPRZRSUZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4NXLNVQU66ROALJWPPRZRSUZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N4NXLNVQU66ROALJWPPRZRSUZM","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":"90b9f45c63bd044c8bdf5bd252983db66b2a534ee6c4e453f044cb447d0841b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-07T15:37:44Z","title_canon_sha256":"3fe31061b1f2cababe8c9938bf9c8bac3d04644670915c691bbbf83ea3e5a859"},"schema_version":"1.0","source":{"id":"1103.1302","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1302","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1302v9","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1302","created_at":"2026-05-18T03:19:46Z"},{"alias_kind":"pith_short_12","alias_value":"N4NXLNVQU66R","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N4NXLNVQU66ROALJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N4NXLNVQ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:a187861599697166730920419e5a3a25eb53c05ef39839009ffe297a8f7dfbd2","target":"graph","created_at":"2026-05-18T03:19:46Z","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 crux of software transactional memory (STM) is to combine an easy-to-use programming interface with an efficient utilization of the concurrent-computing abilities provided by modern machines. But does this combination come with an inherent cost? We evaluate the cost of concurrency by measuring the amount of expensive synchronization that must be employed in an STM implementation that ensures positive concurrency, i.e., allows for concurrent transaction processing in some executions. We focus on two popular progress conditions that provide positive concurrency: progressiveness and permissiv","authors_text":"Petr Kuznetsov, Srivatsan Ravi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-07T15:37:44Z","title":"On the Cost of Concurrency in Transactional Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1302","kind":"arxiv","version":9},"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:690d2ad02e08fbff6fb710265c5eb38a298f32f018110852661e5c3feb500fa3","target":"record","created_at":"2026-05-18T03:19:46Z","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":"90b9f45c63bd044c8bdf5bd252983db66b2a534ee6c4e453f044cb447d0841b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-03-07T15:37:44Z","title_canon_sha256":"3fe31061b1f2cababe8c9938bf9c8bac3d04644670915c691bbbf83ea3e5a859"},"schema_version":"1.0","source":{"id":"1103.1302","kind":"arxiv","version":9}},"canonical_sha256":"6f1b75b6b0a7bd170169b3df1cc654cb018ef83fa05e39faeb2896eb3bd30129","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f1b75b6b0a7bd170169b3df1cc654cb018ef83fa05e39faeb2896eb3bd30129","first_computed_at":"2026-05-18T03:19:46.390071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:46.390071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"stV2fuDFUc4tTDkBjIivUkGVC/jdid6eYHveHTpoW9SgNBdhzubwRgCd4R6Hyi6QOOjKPMgi9GXGNQtelGVxCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:46.390948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1302","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:690d2ad02e08fbff6fb710265c5eb38a298f32f018110852661e5c3feb500fa3","sha256:a187861599697166730920419e5a3a25eb53c05ef39839009ffe297a8f7dfbd2"],"state_sha256":"10c3337ae6eb9106b723c85b36ddff73924b54742efd30ccd7ccd7a0942e12dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCxBW93nPhQqlplvA/gd4+/JyOxFoko7bkK99bkOdKpynJOgpujnpvGT6z6RiiFSCiQpBjkPn6uJ3u+oQy4XDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:46:58.139819Z","bundle_sha256":"28e4fc0053bcc1bd27278652e7459b44cce4555a89d5e656029c3f52bcdb781f"}}