{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UEZ2CW4BJBE6JHRMP3FU3PG5IB","short_pith_number":"pith:UEZ2CW4B","schema_version":"1.0","canonical_sha256":"a133a15b814849e49e2c7ecb4dbcdd406167f98624300ebbd0fe7f3a85dcda20","source":{"kind":"arxiv","id":"1411.5110","version":1},"attestation_state":"computed","paper":{"title":"Mutually Exclusive Procedures in Imperative Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2014-11-19T04:34:35Z","abstract_excerpt":"To represent mutually exclusive procedures, we propose a choice-conjunctive declaration statement of the form $uchoo(S,R)$ where $S, R$ are the procedure declaration statements within a module. This statement has the following semantics: request the machine to choose a successful one between $S$ and $R$. This statement is useful for representing objects with mutually exclusive procedures. We illustrate our idea via C^uchoo, an extension of the core C with a new 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":"1411.5110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-19T04:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"2f553d2487b2565aad2e038f6bd5203eeb45843f7e017c316f9f52eeeb293931","abstract_canon_sha256":"55dd487b94a56c288cd7309073deee4090a4cdc65982c441433eee99e86dc0ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:44.349079Z","signature_b64":"YE2cDSDyRo4K9VAZy4yiojVU1o047liIM6KCcZVhM+fYs4ExvB1PqnZ2kHBstuJiHKEOlFiQddR3gYU/G9UGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a133a15b814849e49e2c7ecb4dbcdd406167f98624300ebbd0fe7f3a85dcda20","last_reissued_at":"2026-05-18T02:34:44.348632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:44.348632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutually Exclusive Procedures in Imperative Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2014-11-19T04:34:35Z","abstract_excerpt":"To represent mutually exclusive procedures, we propose a choice-conjunctive declaration statement of the form $uchoo(S,R)$ where $S, R$ are the procedure declaration statements within a module. This statement has the following semantics: request the machine to choose a successful one between $S$ and $R$. This statement is useful for representing objects with mutually exclusive procedures. We illustrate our idea via C^uchoo, an extension of the core C with a new statement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5110","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":"1411.5110","created_at":"2026-05-18T02:34:44.348699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5110v1","created_at":"2026-05-18T02:34:44.348699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5110","created_at":"2026-05-18T02:34:44.348699+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEZ2CW4BJBE6","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEZ2CW4BJBE6JHRM","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEZ2CW4B","created_at":"2026-05-18T12:28:52.271510+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/UEZ2CW4BJBE6JHRMP3FU3PG5IB","json":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB.json","graph_json":"https://pith.science/api/pith-number/UEZ2CW4BJBE6JHRMP3FU3PG5IB/graph.json","events_json":"https://pith.science/api/pith-number/UEZ2CW4BJBE6JHRMP3FU3PG5IB/events.json","paper":"https://pith.science/paper/UEZ2CW4B"},"agent_actions":{"view_html":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB","download_json":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB.json","view_paper":"https://pith.science/paper/UEZ2CW4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5110&json=true","fetch_graph":"https://pith.science/api/pith-number/UEZ2CW4BJBE6JHRMP3FU3PG5IB/graph.json","fetch_events":"https://pith.science/api/pith-number/UEZ2CW4BJBE6JHRMP3FU3PG5IB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB/action/storage_attestation","attest_author":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB/action/author_attestation","sign_citation":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB/action/citation_signature","submit_replication":"https://pith.science/pith/UEZ2CW4BJBE6JHRMP3FU3PG5IB/action/replication_record"}},"created_at":"2026-05-18T02:34:44.348699+00:00","updated_at":"2026-05-18T02:34:44.348699+00:00"}