{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YJZJV3WA2TBR5YPMS4WCOHWLKX","short_pith_number":"pith:YJZJV3WA","schema_version":"1.0","canonical_sha256":"c2729aeec0d4c31ee1ec972c271ecb55e45268ebdb357058e5aa1189e402adc0","source":{"kind":"arxiv","id":"1606.04240","version":1},"attestation_state":"computed","paper":{"title":"For-loops 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":"2016-06-14T08:06:01Z","abstract_excerpt":"Logic programming has traditiLogic programming has traditionally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\\seqandq{x}{L} G$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. $\\seqandq{x}{L}$ is called a parallel bounded quantifier. These goals allow us to specify the following task: iterate $G$ with $x$ ranging over all the elements of $L$. onally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\\seqandq{x}{L} G$ wher"},"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":"1606.04240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-06-14T08:06:01Z","cross_cats_sorted":[],"title_canon_sha256":"adb9f874fbc209d8c91a477103b19057c8ce08b4a870dd67595d0dceed5b8033","abstract_canon_sha256":"565b54b495207fc12ca9ebae2434d0e9216081e848e40e94564262a57eb4508d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.889489Z","signature_b64":"TM8pbklORr0rfWjQD1Zdi0m9u6pbXVqiErbP1yJZFeZtIUjPQm2ZkJ9m5kdb2u9s63MA43FHeCTu4/SZ/F/EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2729aeec0d4c31ee1ec972c271ecb55e45268ebdb357058e5aa1189e402adc0","last_reissued_at":"2026-05-18T01:12:25.889158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.889158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"For-loops 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":"2016-06-14T08:06:01Z","abstract_excerpt":"Logic programming has traditiLogic programming has traditionally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\\seqandq{x}{L} G$ where $G$ is a goal, $x$ is a variable, and $L$ is a list. $\\seqandq{x}{L}$ is called a parallel bounded quantifier. These goals allow us to specify the following task: iterate $G$ with $x$ ranging over all the elements of $L$. onally lacked devices for expressing iterative tasks. To overcome this problem, this paper proposes iterative goal formulas of the form $\\seqandq{x}{L} G$ wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04240","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":"1606.04240","created_at":"2026-05-18T01:12:25.889205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04240v1","created_at":"2026-05-18T01:12:25.889205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04240","created_at":"2026-05-18T01:12:25.889205+00:00"},{"alias_kind":"pith_short_12","alias_value":"YJZJV3WA2TBR","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YJZJV3WA2TBR5YPM","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YJZJV3WA","created_at":"2026-05-18T12:30:53.716459+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/YJZJV3WA2TBR5YPMS4WCOHWLKX","json":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX.json","graph_json":"https://pith.science/api/pith-number/YJZJV3WA2TBR5YPMS4WCOHWLKX/graph.json","events_json":"https://pith.science/api/pith-number/YJZJV3WA2TBR5YPMS4WCOHWLKX/events.json","paper":"https://pith.science/paper/YJZJV3WA"},"agent_actions":{"view_html":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX","download_json":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX.json","view_paper":"https://pith.science/paper/YJZJV3WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04240&json=true","fetch_graph":"https://pith.science/api/pith-number/YJZJV3WA2TBR5YPMS4WCOHWLKX/graph.json","fetch_events":"https://pith.science/api/pith-number/YJZJV3WA2TBR5YPMS4WCOHWLKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX/action/storage_attestation","attest_author":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX/action/author_attestation","sign_citation":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX/action/citation_signature","submit_replication":"https://pith.science/pith/YJZJV3WA2TBR5YPMS4WCOHWLKX/action/replication_record"}},"created_at":"2026-05-18T01:12:25.889205+00:00","updated_at":"2026-05-18T01:12:25.889205+00:00"}