{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A3XZLBYQXCU7JDRDE2OSWLFMG5","short_pith_number":"pith:A3XZLBYQ","canonical_record":{"source":{"id":"1211.6535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-28T08:02:16Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"43d42fab1717bde04098ab8c252e8688cda768886e48da6353902f6d0bde833d","abstract_canon_sha256":"79187d5fe49c0be0d76dc26b4bc489eb416aba756e451d46c63041b358a8d990"},"schema_version":"1.0"},"canonical_sha256":"06ef958710b8a9f48e23269d2b2cac37558372f8a7bca581376e76378f4b78c6","source":{"kind":"arxiv","id":"1211.6535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6535","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6535v2","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6535","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"A3XZLBYQXCU7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A3XZLBYQXCU7JDRD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A3XZLBYQ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A3XZLBYQXCU7JDRDE2OSWLFMG5","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-28T08:02:16Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"43d42fab1717bde04098ab8c252e8688cda768886e48da6353902f6d0bde833d","abstract_canon_sha256":"79187d5fe49c0be0d76dc26b4bc489eb416aba756e451d46c63041b358a8d990"},"schema_version":"1.0"},"canonical_sha256":"06ef958710b8a9f48e23269d2b2cac37558372f8a7bca581376e76378f4b78c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:33.300939Z","signature_b64":"GgFHyepTLeXqEe5G67vwpEm8+eRX7aFO3l0AkYirnhL7RGR0z1h+oxKV5MdSaZutVko1xyF4QslBngKokuH3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ef958710b8a9f48e23269d2b2cac37558372f8a7bca581376e76378f4b78c6","last_reissued_at":"2026-05-18T01:37:33.300359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:33.300359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6535","source_version":2,"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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIwR4iZJT0i6YCWpAaFAuMgangWOqzTNTRakBsaFNPJ+3aAOsDJ5J2wEfskVH4oESh+y+qVx1jEoT3BaHRt7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:49.882068Z"},"content_sha256":"f59aaeaa133a96fd06bbb23e0f40b308949b62e8be6860e823908f0dbdc465ff","schema_version":"1.0","event_id":"sha256:f59aaeaa133a96fd06bbb23e0f40b308949b62e8be6860e823908f0dbdc465ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A3XZLBYQXCU7JDRDE2OSWLFMG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Interactive Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Keehang Kwon, Mi-Young Park","submitted_at":"2012-11-28T08:02:16Z","abstract_excerpt":"Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal $G_1 \\& G_2$ from a program $P$ simply terminates with a success if both $G_1$ and $G_2$ are solvable from $P$. This is an unsatisfactory situation, as a central action of \\& -- the action of choosing either $G_1$ or $G_2$ by the user -- is missing in this semantics.\n  We propose to modify the operational semantics above to allow for more active participation from the user. We illustrate our idea via muProlog, an extension of Prolog "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6535","kind":"arxiv","version":2},"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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkLKFT3eX4WYTiC6taby/AhXI/kLlzOA+HORty/gkkoEUJ/FN1pjNl/zqHln56kPzVfaVUkYvnwk1X1ycF2QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:49.882729Z"},"content_sha256":"8f7c9f279bf394395c0abf63acc9d94b1c0d8b5586ecaf0666ebe21612810ee1","schema_version":"1.0","event_id":"sha256:8f7c9f279bf394395c0abf63acc9d94b1c0d8b5586ecaf0666ebe21612810ee1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/bundle.json","state_url":"https://pith.science/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/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-31T04:17:49Z","links":{"resolver":"https://pith.science/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5","bundle":"https://pith.science/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/bundle.json","state":"https://pith.science/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3XZLBYQXCU7JDRDE2OSWLFMG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A3XZLBYQXCU7JDRDE2OSWLFMG5","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":"79187d5fe49c0be0d76dc26b4bc489eb416aba756e451d46c63041b358a8d990","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-28T08:02:16Z","title_canon_sha256":"43d42fab1717bde04098ab8c252e8688cda768886e48da6353902f6d0bde833d"},"schema_version":"1.0","source":{"id":"1211.6535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6535","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6535v2","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6535","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"A3XZLBYQXCU7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A3XZLBYQXCU7JDRD","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A3XZLBYQ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:8f7c9f279bf394395c0abf63acc9d94b1c0d8b5586ecaf0666ebe21612810ee1","target":"graph","created_at":"2026-05-18T01:37:33Z","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":"Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal $G_1 \\& G_2$ from a program $P$ simply terminates with a success if both $G_1$ and $G_2$ are solvable from $P$. This is an unsatisfactory situation, as a central action of \\& -- the action of choosing either $G_1$ or $G_2$ by the user -- is missing in this semantics.\n  We propose to modify the operational semantics above to allow for more active participation from the user. We illustrate our idea via muProlog, an extension of Prolog ","authors_text":"Keehang Kwon, Mi-Young Park","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-28T08:02:16Z","title":"Towards Interactive Logic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6535","kind":"arxiv","version":2},"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:f59aaeaa133a96fd06bbb23e0f40b308949b62e8be6860e823908f0dbdc465ff","target":"record","created_at":"2026-05-18T01:37:33Z","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":"79187d5fe49c0be0d76dc26b4bc489eb416aba756e451d46c63041b358a8d990","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-28T08:02:16Z","title_canon_sha256":"43d42fab1717bde04098ab8c252e8688cda768886e48da6353902f6d0bde833d"},"schema_version":"1.0","source":{"id":"1211.6535","kind":"arxiv","version":2}},"canonical_sha256":"06ef958710b8a9f48e23269d2b2cac37558372f8a7bca581376e76378f4b78c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06ef958710b8a9f48e23269d2b2cac37558372f8a7bca581376e76378f4b78c6","first_computed_at":"2026-05-18T01:37:33.300359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:33.300359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GgFHyepTLeXqEe5G67vwpEm8+eRX7aFO3l0AkYirnhL7RGR0z1h+oxKV5MdSaZutVko1xyF4QslBngKokuH3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:33.300939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f59aaeaa133a96fd06bbb23e0f40b308949b62e8be6860e823908f0dbdc465ff","sha256:8f7c9f279bf394395c0abf63acc9d94b1c0d8b5586ecaf0666ebe21612810ee1"],"state_sha256":"cbce585ad845fd3fedca19af19e0b6edc87a4db178a7ca5e144358804d2bdf0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibaxUm09sO2gHcR+XcuTh29N/CcDQPXMb4TbeNHnQhHIeYtCHlWJ1GI3/UOp1SZv7LK57Zks+NdXXS5KzVJJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:17:49.886145Z","bundle_sha256":"0eed1720da2dad5579125f0601a020d1fa9cec4c4b2fdabb815ea35962c2f91b"}}