{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RN7K7CA42UJRF4YMZU7S7EVXJL","short_pith_number":"pith:RN7K7CA4","schema_version":"1.0","canonical_sha256":"8b7eaf881cd51312f30ccd3f2f92b74afa53ab12f6eaabaf251b57657592d5a9","source":{"kind":"arxiv","id":"1305.6108","version":2},"attestation_state":"computed","paper":{"title":"Bounded Choice Queries for Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2013-05-27T05:22:24Z","abstract_excerpt":"Adding versatile interactions to goals and queries in logic programming is an essential task. Unfortunately, existing logic languages can take input from the user only via the $read$ construct.\n  We propose to add a new interactive goal to allow for more controlled and more guided participation from the user. We illustrate our idea via \\muprolog, an extension of Prolog with bounded choice goals."},"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":"1305.6108","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-05-27T05:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"39941ec7a6bc9f5027d96908cec0f1e26e7b96c967201c6b1df9d0f7fe191ac4","abstract_canon_sha256":"e702f2eff507af35939af49f3bd05673ee90995059f2e0331c0edbabec7634ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:49.000692Z","signature_b64":"WsAiPEKlzoTxB43WZ5yWhM1GTI/eTDDsPINbk8oqof0ctWnWMS9xlY/Y5VwjzVtEaNeGnCwryhkqgnhDVEiJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b7eaf881cd51312f30ccd3f2f92b74afa53ab12f6eaabaf251b57657592d5a9","last_reissued_at":"2026-05-18T03:16:49.000052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:49.000052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Choice Queries for Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2013-05-27T05:22:24Z","abstract_excerpt":"Adding versatile interactions to goals and queries in logic programming is an essential task. Unfortunately, existing logic languages can take input from the user only via the $read$ construct.\n  We propose to add a new interactive goal to allow for more controlled and more guided participation from the user. We illustrate our idea via \\muprolog, an extension of Prolog with bounded choice goals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6108","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.6108","created_at":"2026-05-18T03:16:49.000145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6108v2","created_at":"2026-05-18T03:16:49.000145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6108","created_at":"2026-05-18T03:16:49.000145+00:00"},{"alias_kind":"pith_short_12","alias_value":"RN7K7CA42UJR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RN7K7CA42UJRF4YM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RN7K7CA4","created_at":"2026-05-18T12:27:59.945178+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/RN7K7CA42UJRF4YMZU7S7EVXJL","json":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL.json","graph_json":"https://pith.science/api/pith-number/RN7K7CA42UJRF4YMZU7S7EVXJL/graph.json","events_json":"https://pith.science/api/pith-number/RN7K7CA42UJRF4YMZU7S7EVXJL/events.json","paper":"https://pith.science/paper/RN7K7CA4"},"agent_actions":{"view_html":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL","download_json":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL.json","view_paper":"https://pith.science/paper/RN7K7CA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6108&json=true","fetch_graph":"https://pith.science/api/pith-number/RN7K7CA42UJRF4YMZU7S7EVXJL/graph.json","fetch_events":"https://pith.science/api/pith-number/RN7K7CA42UJRF4YMZU7S7EVXJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL/action/storage_attestation","attest_author":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL/action/author_attestation","sign_citation":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL/action/citation_signature","submit_replication":"https://pith.science/pith/RN7K7CA42UJRF4YMZU7S7EVXJL/action/replication_record"}},"created_at":"2026-05-18T03:16:49.000145+00:00","updated_at":"2026-05-18T03:16:49.000145+00:00"}