{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GW3T5WFENDW7RBQ6QHYQZBRHMU","short_pith_number":"pith:GW3T5WFE","schema_version":"1.0","canonical_sha256":"35b73ed8a468edf8861e81f10c86276527f8987ea64df37acaff002f22a67630","source":{"kind":"arxiv","id":"1701.01785","version":1},"attestation_state":"computed","paper":{"title":"A Concurrent Model for Imperative Languages with Improved Atomicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Daeseong Kang, Keehang Kwon","submitted_at":"2017-01-07T01:55:13Z","abstract_excerpt":"We propose a new concurrent model for imperative languages where concurrency occurs at a subprogram level. This model introduces a new {\\it block sequential} statement of the form $#(G_1,\\ldots,G_n)$ where each $G_i$ is a statement. This statement tells the machine to execute $G_1,\\ldots,G_n$ sequentially and atomically (\\ie, without interleaving). It therefore enhances atomicity and predictability in concurrent programming. We illustrate our idea via $C^{\\|}$, an extension of the core concurrent C with the new block sequential statement."},"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":"1701.01785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-01-07T01:55:13Z","cross_cats_sorted":[],"title_canon_sha256":"3d3ea9d9ac52b2a4b793f0bd810ec648a944408a7678d5bfc66cde24f59045e0","abstract_canon_sha256":"406399953471397a1fabf7ad69a35234085db2e10cc13900cf4efa00e060d43d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:15.107072Z","signature_b64":"La/vj6WYb1bJyRLHRrVqfBPIEt+Ae6aQJ+w9wC77YYPuXE/65tH1Rc5sGg1QrEtBWB6aDcdsPmspF1lUmpe1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b73ed8a468edf8861e81f10c86276527f8987ea64df37acaff002f22a67630","last_reissued_at":"2026-05-18T00:53:15.106624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:15.106624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Concurrent Model for Imperative Languages with Improved Atomicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Daeseong Kang, Keehang Kwon","submitted_at":"2017-01-07T01:55:13Z","abstract_excerpt":"We propose a new concurrent model for imperative languages where concurrency occurs at a subprogram level. This model introduces a new {\\it block sequential} statement of the form $#(G_1,\\ldots,G_n)$ where each $G_i$ is a statement. This statement tells the machine to execute $G_1,\\ldots,G_n$ sequentially and atomically (\\ie, without interleaving). It therefore enhances atomicity and predictability in concurrent programming. We illustrate our idea via $C^{\\|}$, an extension of the core concurrent C with the new block sequential statement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01785","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":"1701.01785","created_at":"2026-05-18T00:53:15.106702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01785v1","created_at":"2026-05-18T00:53:15.106702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01785","created_at":"2026-05-18T00:53:15.106702+00:00"},{"alias_kind":"pith_short_12","alias_value":"GW3T5WFENDW7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GW3T5WFENDW7RBQ6","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GW3T5WFE","created_at":"2026-05-18T12:31:18.294218+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/GW3T5WFENDW7RBQ6QHYQZBRHMU","json":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU.json","graph_json":"https://pith.science/api/pith-number/GW3T5WFENDW7RBQ6QHYQZBRHMU/graph.json","events_json":"https://pith.science/api/pith-number/GW3T5WFENDW7RBQ6QHYQZBRHMU/events.json","paper":"https://pith.science/paper/GW3T5WFE"},"agent_actions":{"view_html":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU","download_json":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU.json","view_paper":"https://pith.science/paper/GW3T5WFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01785&json=true","fetch_graph":"https://pith.science/api/pith-number/GW3T5WFENDW7RBQ6QHYQZBRHMU/graph.json","fetch_events":"https://pith.science/api/pith-number/GW3T5WFENDW7RBQ6QHYQZBRHMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU/action/storage_attestation","attest_author":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU/action/author_attestation","sign_citation":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU/action/citation_signature","submit_replication":"https://pith.science/pith/GW3T5WFENDW7RBQ6QHYQZBRHMU/action/replication_record"}},"created_at":"2026-05-18T00:53:15.106702+00:00","updated_at":"2026-05-18T00:53:15.106702+00:00"}