{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MFRMGQ5VXYLG4SMZ74QM7FS4RS","short_pith_number":"pith:MFRMGQ5V","schema_version":"1.0","canonical_sha256":"6162c343b5be166e4999ff20cf965c8c88df103f86113306f96caff760d7d168","source":{"kind":"arxiv","id":"1203.4751","version":8},"attestation_state":"computed","paper":{"title":"Optimism for Boosting Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Srivatsan Ravi, Vincent Gramoli","submitted_at":"2012-03-21T14:44:40Z","abstract_excerpt":"Modern concurrent programming benefits from a large variety of synchronization techniques. These include conventional pessimistic locking, as well as optimistic techniques based on conditional synchronization primitives or transactional memory. Yet, it is unclear which of these approaches better leverage the concurrency inherent to multi-cores.\n  In this paper, we compare the level of concurrency one can obtain by converting a sequential program into a concurrent one using optimistic or pessimistic techniques. To establish fair comparison of such implementations, we introduce a new correctness"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.4751","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-03-21T14:44:40Z","cross_cats_sorted":[],"title_canon_sha256":"e8537bc5fb94d40856ca27fad339850f51452448f383c474ffe1e178a16b74de","abstract_canon_sha256":"4bbaaa41a0845ae016f16af4e2b6282d1af4b58ce629d1b95852895bba510c2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.873461Z","signature_b64":"sRuLMLDp/68kSk+Y5+YuL361Y9N7Sv+mSr3bfDhk9VyYzsOrVa9ueZUc67BPiM43SJIm5KEhD7h2IVE/3TK7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6162c343b5be166e4999ff20cf965c8c88df103f86113306f96caff760d7d168","last_reissued_at":"2026-05-18T01:30:15.872874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.872874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimism for Boosting Concurrency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Petr Kuznetsov, Srivatsan Ravi, Vincent Gramoli","submitted_at":"2012-03-21T14:44:40Z","abstract_excerpt":"Modern concurrent programming benefits from a large variety of synchronization techniques. These include conventional pessimistic locking, as well as optimistic techniques based on conditional synchronization primitives or transactional memory. Yet, it is unclear which of these approaches better leverage the concurrency inherent to multi-cores.\n  In this paper, we compare the level of concurrency one can obtain by converting a sequential program into a concurrent one using optimistic or pessimistic techniques. To establish fair comparison of such implementations, we introduce a new correctness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4751","kind":"arxiv","version":8},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.4751","created_at":"2026-05-18T01:30:15.872964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4751v8","created_at":"2026-05-18T01:30:15.872964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4751","created_at":"2026-05-18T01:30:15.872964+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFRMGQ5VXYLG","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFRMGQ5VXYLG4SMZ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFRMGQ5V","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS","json":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS.json","graph_json":"https://pith.science/api/pith-number/MFRMGQ5VXYLG4SMZ74QM7FS4RS/graph.json","events_json":"https://pith.science/api/pith-number/MFRMGQ5VXYLG4SMZ74QM7FS4RS/events.json","paper":"https://pith.science/paper/MFRMGQ5V"},"agent_actions":{"view_html":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS","download_json":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS.json","view_paper":"https://pith.science/paper/MFRMGQ5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4751&json=true","fetch_graph":"https://pith.science/api/pith-number/MFRMGQ5VXYLG4SMZ74QM7FS4RS/graph.json","fetch_events":"https://pith.science/api/pith-number/MFRMGQ5VXYLG4SMZ74QM7FS4RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS/action/storage_attestation","attest_author":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS/action/author_attestation","sign_citation":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS/action/citation_signature","submit_replication":"https://pith.science/pith/MFRMGQ5VXYLG4SMZ74QM7FS4RS/action/replication_record"}},"created_at":"2026-05-18T01:30:15.872964+00:00","updated_at":"2026-05-18T01:30:15.872964+00:00"}