{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NGN7JDKFILFEHXHB57ZLR6UJQN","short_pith_number":"pith:NGN7JDKF","schema_version":"1.0","canonical_sha256":"699bf48d4542ca43dce1eff2b8fa89836b4c81c5052045561d30336921e8fe61","source":{"kind":"arxiv","id":"1207.0868","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0868","created_at":"2026-05-18T03:51:48.179309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0868v1","created_at":"2026-05-18T03:51:48.179309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0868","created_at":"2026-05-18T03:51:48.179309+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGN7JDKFILFE","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGN7JDKFILFEHXHB","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGN7JDKF","created_at":"2026-05-18T12:27:16.716162+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/NGN7JDKFILFEHXHB57ZLR6UJQN","json":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN.json","graph_json":"https://pith.science/api/pith-number/NGN7JDKFILFEHXHB57ZLR6UJQN/graph.json","events_json":"https://pith.science/api/pith-number/NGN7JDKFILFEHXHB57ZLR6UJQN/events.json","paper":"https://pith.science/paper/NGN7JDKF"},"agent_actions":{"view_html":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN","download_json":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN.json","view_paper":"https://pith.science/paper/NGN7JDKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0868&json=true","fetch_graph":"https://pith.science/api/pith-number/NGN7JDKFILFEHXHB57ZLR6UJQN/graph.json","fetch_events":"https://pith.science/api/pith-number/NGN7JDKFILFEHXHB57ZLR6UJQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/action/storage_attestation","attest_author":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/action/author_attestation","sign_citation":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/action/citation_signature","submit_replication":"https://pith.science/pith/NGN7JDKFILFEHXHB57ZLR6UJQN/action/replication_record"}},"created_at":"2026-05-18T03:51:48.179309+00:00","updated_at":"2026-05-18T03:51:48.179309+00:00"}