{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5JDRBHLHGZZD5PXF2ALMCHXBXO","short_pith_number":"pith:5JDRBHLH","schema_version":"1.0","canonical_sha256":"ea47109d6736723ebee5d016c11ee1bbb2403442a109dd7090363fb970f0ed00","source":{"kind":"arxiv","id":"1212.6844","version":1},"attestation_state":"computed","paper":{"title":"Improving Robustness via Disjunctive Statements in Imperative Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon, Mi-Young Park, Sungwoo Hur","submitted_at":"2012-12-31T09:20:05Z","abstract_excerpt":"To deal with failures as simply as possible, we propose a new foun- dation for the core (untyped) C, which is based on a new logic called task logic or imperative logic. We then introduce a sequential-disjunctive statement of the form S : R. This statement has the following semantics: execute S and R sequentially. It is considered a success if at least one of S;R is a success. This statement is useful for dealing with inessential errors without explicitly catching them."},"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":"1212.6844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-12-31T09:20:05Z","cross_cats_sorted":[],"title_canon_sha256":"4878d42abc708fdf4ca3feaea929fdf7c32bc95912b6e3fa852bf5a33e027406","abstract_canon_sha256":"5d7fe2e5bee7816d632ddade8beda7f8497820f5100386cb295df8c9daa09874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:22.671261Z","signature_b64":"PBGi6821jXnws21kcpg+O+m1mP2mkOq559CfvJM71TeDjBgcgEG5t64SPnZY9pDcjjvqcm+LRsYU8WYsAs/fCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea47109d6736723ebee5d016c11ee1bbb2403442a109dd7090363fb970f0ed00","last_reissued_at":"2026-05-18T01:52:22.670876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:22.670876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Robustness via Disjunctive Statements in Imperative Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon, Mi-Young Park, Sungwoo Hur","submitted_at":"2012-12-31T09:20:05Z","abstract_excerpt":"To deal with failures as simply as possible, we propose a new foun- dation for the core (untyped) C, which is based on a new logic called task logic or imperative logic. We then introduce a sequential-disjunctive statement of the form S : R. This statement has the following semantics: execute S and R sequentially. It is considered a success if at least one of S;R is a success. This statement is useful for dealing with inessential errors without explicitly catching them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6844","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":"1212.6844","created_at":"2026-05-18T01:52:22.670934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6844v1","created_at":"2026-05-18T01:52:22.670934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6844","created_at":"2026-05-18T01:52:22.670934+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JDRBHLHGZZD","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JDRBHLHGZZD5PXF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JDRBHLH","created_at":"2026-05-18T12:26:53.410803+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/5JDRBHLHGZZD5PXF2ALMCHXBXO","json":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO.json","graph_json":"https://pith.science/api/pith-number/5JDRBHLHGZZD5PXF2ALMCHXBXO/graph.json","events_json":"https://pith.science/api/pith-number/5JDRBHLHGZZD5PXF2ALMCHXBXO/events.json","paper":"https://pith.science/paper/5JDRBHLH"},"agent_actions":{"view_html":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO","download_json":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO.json","view_paper":"https://pith.science/paper/5JDRBHLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6844&json=true","fetch_graph":"https://pith.science/api/pith-number/5JDRBHLHGZZD5PXF2ALMCHXBXO/graph.json","fetch_events":"https://pith.science/api/pith-number/5JDRBHLHGZZD5PXF2ALMCHXBXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO/action/storage_attestation","attest_author":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO/action/author_attestation","sign_citation":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO/action/citation_signature","submit_replication":"https://pith.science/pith/5JDRBHLHGZZD5PXF2ALMCHXBXO/action/replication_record"}},"created_at":"2026-05-18T01:52:22.670934+00:00","updated_at":"2026-05-18T01:52:22.670934+00:00"}