{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NGN7JDKFILFEHXHB57ZLR6UJQN","short_pith_number":"pith:NGN7JDKF","canonical_record":{"source":{"id":"1207.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:21:54Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"5658ce865e22e3c9f294bdc277d57b6cfab2e0e5ebcae18b5844d17ece5ba2a3","abstract_canon_sha256":"89c560d282b4dcc515870aafe9aea293e7d2147738225b53a85cfeb6138b0723"},"schema_version":"1.0"},"canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","source":{"kind":"arxiv","id":"1207.0868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0868","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0868v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0868","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"NGN7JDKFILFE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NGN7JDKFILFEHXHB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NGN7JDKF","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NGN7JDKFILFEHXHB57ZLR6UJQN","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:21:54Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"5658ce865e22e3c9f294bdc277d57b6cfab2e0e5ebcae18b5844d17ece5ba2a3","abstract_canon_sha256":"89c560d282b4dcc515870aafe9aea293e7d2147738225b53a85cfeb6138b0723"},"schema_version":"1.0"},"canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.180414Z","signature_b64":"tEw4fieu7FwEr8ME4wVzDzw50Y0vHh3/bXpRDPryL7A0dlCXHIU8NzIdztdXclanlY5MI0QHnDwU0daHAqXYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","last_reissued_at":"2026-05-18T03:51:48.179213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.179213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0868","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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLFK4trNamHeIOhtWG6zFJ1v9j0tx+AeOGb5Sk4FGCQn90DrfrtCXeJSjF/McJ62Yd5WsculeUqmOk4rmkisAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:27:40.599810Z"},"content_sha256":"93f6ab012bb89a94a4dddeffb59184b4cc33e0f4071b5e1b587bb10105bd4c78","schema_version":"1.0","event_id":"sha256:93f6ab012bb89a94a4dddeffb59184b4cc33e0f4071b5e1b587bb10105bd4c78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NGN7JDKFILFEHXHB57ZLR6UJQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Austin), Roopsha Samanta (UT","submitted_at":"2012-07-04T01:21:54Z","abstract_excerpt":"We present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization ensuring correct global behaviour. Our methodology supports finite-state concurrent programs composed of processes that may have local and shared variables, may be straight-line or branching programs, may be ongoing or terminating, and may have program-initialized or user-initialized variables. The specification language is an extension of propositional Computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0868","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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmvxpAc7wurreNPW6Y0Oj4Aj0kqgZBQe3US8YPkvq/byml3MvP9qeNfxzlLkhUoX+afrfih11ZrNI/vRn2c2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:27:40.600460Z"},"content_sha256":"5a3113ee679006cd7b52d0a48bac852ae6cf5c505481fc8f9791257d7750e605","schema_version":"1.0","event_id":"sha256:5a3113ee679006cd7b52d0a48bac852ae6cf5c505481fc8f9791257d7750e605"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/bundle.json","state_url":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/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-25T09:27:40Z","links":{"resolver":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN","bundle":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/bundle.json","state":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NGN7JDKFILFEHXHB57ZLR6UJQN","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":"89c560d282b4dcc515870aafe9aea293e7d2147738225b53a85cfeb6138b0723","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:21:54Z","title_canon_sha256":"5658ce865e22e3c9f294bdc277d57b6cfab2e0e5ebcae18b5844d17ece5ba2a3"},"schema_version":"1.0","source":{"id":"1207.0868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0868","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0868v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0868","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"NGN7JDKFILFE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NGN7JDKFILFEHXHB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NGN7JDKF","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:5a3113ee679006cd7b52d0a48bac852ae6cf5c505481fc8f9791257d7750e605","target":"graph","created_at":"2026-05-18T03:51:48Z","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 present a framework that takes a concurrent program composed of unsynchronized processes, along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization ensuring correct global behaviour. Our methodology supports finite-state concurrent programs composed of processes that may have local and shared variables, may be straight-line or branching programs, may be ongoing or terminating, and may have program-initialized or user-initialized variables. The specification language is an extension of propositional Computa","authors_text":"Austin), Roopsha Samanta (UT","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:21:54Z","title":"Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0868","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:93f6ab012bb89a94a4dddeffb59184b4cc33e0f4071b5e1b587bb10105bd4c78","target":"record","created_at":"2026-05-18T03:51:48Z","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":"89c560d282b4dcc515870aafe9aea293e7d2147738225b53a85cfeb6138b0723","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T01:21:54Z","title_canon_sha256":"5658ce865e22e3c9f294bdc277d57b6cfab2e0e5ebcae18b5844d17ece5ba2a3"},"schema_version":"1.0","source":{"id":"1207.0868","kind":"arxiv","version":1}},"canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","first_computed_at":"2026-05-18T03:51:48.179213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:48.179213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tEw4fieu7FwEr8ME4wVzDzw50Y0vHh3/bXpRDPryL7A0dlCXHIU8NzIdztdXclanlY5MI0QHnDwU0daHAqXYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:48.180414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f6ab012bb89a94a4dddeffb59184b4cc33e0f4071b5e1b587bb10105bd4c78","sha256:5a3113ee679006cd7b52d0a48bac852ae6cf5c505481fc8f9791257d7750e605"],"state_sha256":"e60065e733cabd3ffcf6c43971364db0cddca7cb6ff2b3531df53dbe1ff055d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVz+qCttPYpwzY8615aaWKaUJQcj+PVPZFqHdPPj6aw/mf+TlTKXPrQjg8HZ/k+E3YNgxpge/tvs3X7j1wi2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:27:40.604135Z","bundle_sha256":"d90fcea5a883881255d9c67906cec3caaf1e579a501456787f52513e3b142c1c"}}