{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:P5DZJ6JGCPWQRYZT72DCTNDQPS","short_pith_number":"pith:P5DZJ6JG","canonical_record":{"source":{"id":"1009.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"af8e1adb8a3b0f3f79bba179084a34945ccbbe5a2949dc0d5676577d00cfb278","abstract_canon_sha256":"aaf680373cb9273c02e6c30f2229b4a5c7f1680b0e17f26fd3a7379a881d6314"},"schema_version":"1.0"},"canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","source":{"kind":"arxiv","id":"1009.0056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0056","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0056v1","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0056","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"P5DZJ6JGCPWQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5DZJ6JGCPWQRYZT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5DZJ6JG","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:P5DZJ6JGCPWQRYZT72DCTNDQPS","target":"record","payload":{"canonical_record":{"source":{"id":"1009.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"af8e1adb8a3b0f3f79bba179084a34945ccbbe5a2949dc0d5676577d00cfb278","abstract_canon_sha256":"aaf680373cb9273c02e6c30f2229b4a5c7f1680b0e17f26fd3a7379a881d6314"},"schema_version":"1.0"},"canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:35.630906Z","signature_b64":"lJxD4vkGpAzNKFlShUDhczp/m8tmqcQt1ohgugCxVKkJiZcxCw6iPFBhThwe8b9hZxPxJCfPb+aLRc+yjxBYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","last_reissued_at":"2026-05-18T04:41:35.630449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:35.630449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.0056","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-18T04:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cosDC8yejyC1MMU+7jGHlqFIA0YqPTas2pxGMokOy1SwUOII0OgexiaZW50MM5Md+HWi4x97NN9riX3Hm8vvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:32:37.708519Z"},"content_sha256":"a1943f41bcb05793092f3d15192827afd8544cb8def0364427dd69f59d716181","schema_version":"1.0","event_id":"sha256:a1943f41bcb05793092f3d15192827afd8544cb8def0364427dd69f59d716181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:P5DZJ6JGCPWQRYZT72DCTNDQPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Competitive Analysis for Balanced Transactional Memory Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Costas Busch, Gokarna Sharma","submitted_at":"2010-08-31T23:54:57Z","abstract_excerpt":"We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new contention management algorithms. The first algorithm Clairvoyant is O(\\surd s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0056","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-18T04:41:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wamYIPm6y0nnydcAh9HEReSQfyDPCbgvscv4xZtc+XQaLJnreDBDG/rmpWXsFjMaMZpfZMU6QaGAY6swEPuUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:32:37.708874Z"},"content_sha256":"80ddbed5f04435c86c2ef3ef82bede84059daded78096f76ff6133f182204a1b","schema_version":"1.0","event_id":"sha256:80ddbed5f04435c86c2ef3ef82bede84059daded78096f76ff6133f182204a1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/bundle.json","state_url":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/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-04T19:32:37Z","links":{"resolver":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS","bundle":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/bundle.json","state":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:P5DZJ6JGCPWQRYZT72DCTNDQPS","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":"aaf680373cb9273c02e6c30f2229b4a5c7f1680b0e17f26fd3a7379a881d6314","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","title_canon_sha256":"af8e1adb8a3b0f3f79bba179084a34945ccbbe5a2949dc0d5676577d00cfb278"},"schema_version":"1.0","source":{"id":"1009.0056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0056","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0056v1","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0056","created_at":"2026-05-18T04:41:35Z"},{"alias_kind":"pith_short_12","alias_value":"P5DZJ6JGCPWQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5DZJ6JGCPWQRYZT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5DZJ6JG","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:80ddbed5f04435c86c2ef3ef82bede84059daded78096f76ff6133f182204a1b","target":"graph","created_at":"2026-05-18T04:41:35Z","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":"We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new contention management algorithms. The first algorithm Clairvoyant is O(\\surd s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The secon","authors_text":"Costas Busch, Gokarna Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","title":"A Competitive Analysis for Balanced Transactional Memory Workloads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0056","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:a1943f41bcb05793092f3d15192827afd8544cb8def0364427dd69f59d716181","target":"record","created_at":"2026-05-18T04:41:35Z","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":"aaf680373cb9273c02e6c30f2229b4a5c7f1680b0e17f26fd3a7379a881d6314","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","title_canon_sha256":"af8e1adb8a3b0f3f79bba179084a34945ccbbe5a2949dc0d5676577d00cfb278"},"schema_version":"1.0","source":{"id":"1009.0056","kind":"arxiv","version":1}},"canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","first_computed_at":"2026-05-18T04:41:35.630449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:35.630449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJxD4vkGpAzNKFlShUDhczp/m8tmqcQt1ohgugCxVKkJiZcxCw6iPFBhThwe8b9hZxPxJCfPb+aLRc+yjxBYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:35.630906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1943f41bcb05793092f3d15192827afd8544cb8def0364427dd69f59d716181","sha256:80ddbed5f04435c86c2ef3ef82bede84059daded78096f76ff6133f182204a1b"],"state_sha256":"599520527c8924e4fe80390966991447a2c95b8ce51f28f3e77e872f97dff018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4bbbwm7sMpL3bqCSGQc+M2K3JZ7BDvEW/qEbTrjgE9d42eU92tLTugO0d5Zxm/EI4SUGNsJCChKirhfjeQFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:32:37.710949Z","bundle_sha256":"6a8c39060f11a889e5d925e0a3a5c62149a8633bc9a0818492892852806dcaea"}}