{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KJWAYGZ6WI5QHKR4DQT7UIPIM4","short_pith_number":"pith:KJWAYGZ6","canonical_record":{"source":{"id":"1506.04857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"a2962dca18ca7c8378b382d0c614fa20f7b6edfd74f3f020dbf030b45260ae98","abstract_canon_sha256":"93bd4edcde248a484bb7955aad5e73bbedf1b556d3c5c63515b810056a2731c7"},"schema_version":"1.0"},"canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","source":{"kind":"arxiv","id":"1506.04857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04857","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04857v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04857","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"KJWAYGZ6WI5Q","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJWAYGZ6WI5QHKR4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJWAYGZ6","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KJWAYGZ6WI5QHKR4DQT7UIPIM4","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"a2962dca18ca7c8378b382d0c614fa20f7b6edfd74f3f020dbf030b45260ae98","abstract_canon_sha256":"93bd4edcde248a484bb7955aad5e73bbedf1b556d3c5c63515b810056a2731c7"},"schema_version":"1.0"},"canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:05.713603Z","signature_b64":"UF5N3BGXfEJAx0S09pxp8zfp6gV6mKspzKV+oaPD1c5eMh/1B9LSeo2iOkUsCfUc6meA4hRri8vHytuk3C8ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","last_reissued_at":"2026-05-18T01:48:05.713068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:05.713068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04857","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4IiaTlE8oH09ufJ7Bl99JoWCUWGSfx6EBQZT2RdJ28gasLoi5f/Uy3K6Aj/a7XpFSX5hxrcn2bkAwpsd5ERFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:15.888817Z"},"content_sha256":"c592d230b11ae833d6e1e50bc7bea0d943489461bf1aae48bb01b238dbd3d28d","schema_version":"1.0","event_id":"sha256:c592d230b11ae833d6e1e50bc7bea0d943489461bf1aae48bb01b238dbd3d28d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KJWAYGZ6WI5QHKR4DQT7UIPIM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mutually Exclusive Modules in Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2015-06-16T07:09:05Z","abstract_excerpt":"Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \\& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \\& D_1$ -- $exec(D_0 \\& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04857","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-18T01:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTxuI4rNQe0ZNDnLXcJfHN/mXWOvjN8ri7c9Hi5vhvybQpjf63MEQRrMQmrNdbdYij2BAJUZ7jrXXoTWD2DrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:13:15.889448Z"},"content_sha256":"957c2ef7eee936fab622c3ccf8420b9880605fce98a531710a34653f14b5e8b7","schema_version":"1.0","event_id":"sha256:957c2ef7eee936fab622c3ccf8420b9880605fce98a531710a34653f14b5e8b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/bundle.json","state_url":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/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-31T02:13:15Z","links":{"resolver":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4","bundle":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/bundle.json","state":"https://pith.science/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJWAYGZ6WI5QHKR4DQT7UIPIM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KJWAYGZ6WI5QHKR4DQT7UIPIM4","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":"93bd4edcde248a484bb7955aad5e73bbedf1b556d3c5c63515b810056a2731c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","title_canon_sha256":"a2962dca18ca7c8378b382d0c614fa20f7b6edfd74f3f020dbf030b45260ae98"},"schema_version":"1.0","source":{"id":"1506.04857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04857","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04857v1","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04857","created_at":"2026-05-18T01:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"KJWAYGZ6WI5Q","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJWAYGZ6WI5QHKR4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJWAYGZ6","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:957c2ef7eee936fab622c3ccf8420b9880605fce98a531710a34653f14b5e8b7","target":"graph","created_at":"2026-05-18T01:48:05Z","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":"Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form $D_0 \\& D_1$ where $D_0, D_1$ are a conjunction of Horn clauses and $\\&$ is a linear logic connective. Solving a goal $G$ using $D_0 \\& D_1$ -- $exec(D_0 \\& D_1,G)$ -- has the following operational semantics: $choose$ a successful one between $exec(D_0,G)$ and $exec(D_1,G)$. In other words, if $D_0$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive mod","authors_text":"Keehang Kwon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","title":"Mutually Exclusive Modules in Logic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04857","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:c592d230b11ae833d6e1e50bc7bea0d943489461bf1aae48bb01b238dbd3d28d","target":"record","created_at":"2026-05-18T01:48:05Z","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":"93bd4edcde248a484bb7955aad5e73bbedf1b556d3c5c63515b810056a2731c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-06-16T07:09:05Z","title_canon_sha256":"a2962dca18ca7c8378b382d0c614fa20f7b6edfd74f3f020dbf030b45260ae98"},"schema_version":"1.0","source":{"id":"1506.04857","kind":"arxiv","version":1}},"canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"526c0c1b3eb23b03aa3c1c27fa21e86728f34c2cc4ba93a3c3b5b31f239ff2da","first_computed_at":"2026-05-18T01:48:05.713068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:05.713068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UF5N3BGXfEJAx0S09pxp8zfp6gV6mKspzKV+oaPD1c5eMh/1B9LSeo2iOkUsCfUc6meA4hRri8vHytuk3C8ZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:05.713603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c592d230b11ae833d6e1e50bc7bea0d943489461bf1aae48bb01b238dbd3d28d","sha256:957c2ef7eee936fab622c3ccf8420b9880605fce98a531710a34653f14b5e8b7"],"state_sha256":"a134352ba082cb6958e7ecc39bf22432c709fc0ae85f8b344956d8c6782b5d08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+KgzqOInT9V+5NTFvD0BzbCIYcPhgxvegDs5wIx0VVNpTsr7gUeZxMSQuN2CcfWsB4cWz2n8q3YmNXsWReWLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:13:15.892828Z","bundle_sha256":"5daf01c6e6b3442e3563e74e8314be20c7b0b419b8833e539d17abca7c825e70"}}