{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6CNBBOAO35PPH3TMIPMIXYXFW7","short_pith_number":"pith:6CNBBOAO","canonical_record":{"source":{"id":"1403.1749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac4ba7a48cf84c4d66cd9c740377c6f91df61d26df6a21a1d52d969c87074723","abstract_canon_sha256":"065e0013591f5424786d1e9a798fad6839128de5486e5549ab1624e58a157ea7"},"schema_version":"1.0"},"canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","source":{"kind":"arxiv","id":"1403.1749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1749","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1749v1","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1749","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"6CNBBOAO35PP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6CNBBOAO35PPH3TM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6CNBBOAO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6CNBBOAO35PPH3TMIPMIXYXFW7","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac4ba7a48cf84c4d66cd9c740377c6f91df61d26df6a21a1d52d969c87074723","abstract_canon_sha256":"065e0013591f5424786d1e9a798fad6839128de5486e5549ab1624e58a157ea7"},"schema_version":"1.0"},"canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:52.635890Z","signature_b64":"ppWsgV8qCkVNqZdOqmvwE/iPz6X7ghjsIIOw+HFY6Td6LNo4omH48Zxs1CIlmCB9VKSQ/Z75K+z4YjUwX2m0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","last_reissued_at":"2026-05-18T02:56:52.635327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:52.635327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1749","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-18T02:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB+QlcUuXa2JWjLLac6cAGIIAfg3ixx8Bqgk5C+2Pqp6XvDE4uoqQYmut3SdBQ7aEf6V7AgE+meHue4sRfD9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:11.458024Z"},"content_sha256":"146da1da97ac29c3015ed30044c738cb293f745b4ff3106e27cc5628e89c280a","schema_version":"1.0","event_id":"sha256:146da1da97ac29c3015ed30044c738cb293f745b4ff3106e27cc5628e89c280a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6CNBBOAO35PPH3TMIPMIXYXFW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatically finding atomic regions for fixing bugs in Concurrent programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Akash Lal, Saurabh Joshi","submitted_at":"2014-03-07T13:46:25Z","abstract_excerpt":"This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the smallest atomic regions that remove all bugs in a given program. Keeping the atomic regions small allows for maximum concurrency. We have implemented our approach in a tool called AtomicInf. A user of Atomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1749","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-18T02:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wei2Jtic/iITQCXALWG4tlnh5EYsCc560S5vHF7oVdroyLq32BF0etuorxu9r9tzNpi1iXnz7JCmv96dLJmXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:31:11.458370Z"},"content_sha256":"d0623fe696fc39752350890b85be17542dc2b8c6349e948769c6325a48231170","schema_version":"1.0","event_id":"sha256:d0623fe696fc39752350890b85be17542dc2b8c6349e948769c6325a48231170"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/bundle.json","state_url":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/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-20T18:31:11Z","links":{"resolver":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7","bundle":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/bundle.json","state":"https://pith.science/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CNBBOAO35PPH3TMIPMIXYXFW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6CNBBOAO35PPH3TMIPMIXYXFW7","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":"065e0013591f5424786d1e9a798fad6839128de5486e5549ab1624e58a157ea7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","title_canon_sha256":"ac4ba7a48cf84c4d66cd9c740377c6f91df61d26df6a21a1d52d969c87074723"},"schema_version":"1.0","source":{"id":"1403.1749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1749","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1749v1","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1749","created_at":"2026-05-18T02:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"6CNBBOAO35PP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6CNBBOAO35PPH3TM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6CNBBOAO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d0623fe696fc39752350890b85be17542dc2b8c6349e948769c6325a48231170","target":"graph","created_at":"2026-05-18T02:56:52Z","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":"This paper presents a technique for automatically constructing a fix for buggy concurrent programs: given a concurrent program that does not satisfy user-provided assertions, we infer atomic blocks that fix the program. An atomic block protects a piece of code and ensures that it runs without interruption from other threads. Our technique uses a verification tool as a subroutine to find the smallest atomic regions that remove all bugs in a given program. Keeping the atomic regions small allows for maximum concurrency. We have implemented our approach in a tool called AtomicInf. A user of Atomi","authors_text":"Akash Lal, Saurabh Joshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","title":"Automatically finding atomic regions for fixing bugs in Concurrent programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1749","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:146da1da97ac29c3015ed30044c738cb293f745b4ff3106e27cc5628e89c280a","target":"record","created_at":"2026-05-18T02:56:52Z","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":"065e0013591f5424786d1e9a798fad6839128de5486e5549ab1624e58a157ea7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-03-07T13:46:25Z","title_canon_sha256":"ac4ba7a48cf84c4d66cd9c740377c6f91df61d26df6a21a1d52d969c87074723"},"schema_version":"1.0","source":{"id":"1403.1749","kind":"arxiv","version":1}},"canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09a10b80edf5ef3ee6c43d88be2e5b7c7586d97971bc79ee8322296ccb81987","first_computed_at":"2026-05-18T02:56:52.635327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:52.635327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ppWsgV8qCkVNqZdOqmvwE/iPz6X7ghjsIIOw+HFY6Td6LNo4omH48Zxs1CIlmCB9VKSQ/Z75K+z4YjUwX2m0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:52.635890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:146da1da97ac29c3015ed30044c738cb293f745b4ff3106e27cc5628e89c280a","sha256:d0623fe696fc39752350890b85be17542dc2b8c6349e948769c6325a48231170"],"state_sha256":"f391dc8c9f67ea5924edbb7c01b3f440e83d647960dab7476b29344e9666418f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sm8pWuU0p0OI2eyPNpPC6cMkZ/3G80XoOSenquhifZ0sj/QHDhCqf0liEitdphOGT4VGEl72dHWdW/dGCLJeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:31:11.460171Z","bundle_sha256":"02e488b08200e7f83104dff32f2360130ac806526c1837974c1db7c07931fdd9"}}