{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TCYYFPF66GVKNQ63UC4K4SJQOD","short_pith_number":"pith:TCYYFPF6","schema_version":"1.0","canonical_sha256":"98b182bcbef1aaa6c3dba0b8ae493070f758d21238e225c93f9bc3ae8a1299b8","source":{"kind":"arxiv","id":"1508.03263","version":4},"attestation_state":"computed","paper":{"title":"Logic Programming with Macro Connectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2015-08-13T16:34:22Z","abstract_excerpt":"Logic programming such as Prolog is often sequential and slow because each execution step processes only a single, $micro$ connective. To fix this problem, we propose to use $macro$ connectives as the means of improving both readability and performance."},"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":"1508.03263","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-08-13T16:34:22Z","cross_cats_sorted":[],"title_canon_sha256":"ee35cf40a7ec92cd0d29fb0a8d52f961fe5ee83222fa719897f3cf5731b6fdb9","abstract_canon_sha256":"9157afd48ed4b8abaeadbb5a6cf7053dfdae43631a11fb6ce8514bd1c904287f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:45.995413Z","signature_b64":"w4OIHjh/4wKPqXibJa2u6bEZP130pKWVscUCikhSj031vxaZ9HNb+xjroGgarTnaBPklcy7OaF1WiV6zgH56Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b182bcbef1aaa6c3dba0b8ae493070f758d21238e225c93f9bc3ae8a1299b8","last_reissued_at":"2026-05-18T00:16:45.994796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:45.994796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logic Programming with Macro Connectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keehang Kwon","submitted_at":"2015-08-13T16:34:22Z","abstract_excerpt":"Logic programming such as Prolog is often sequential and slow because each execution step processes only a single, $micro$ connective. To fix this problem, we propose to use $macro$ connectives as the means of improving both readability and performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03263","kind":"arxiv","version":4},"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":"1508.03263","created_at":"2026-05-18T00:16:45.994880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03263v4","created_at":"2026-05-18T00:16:45.994880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03263","created_at":"2026-05-18T00:16:45.994880+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCYYFPF66GVK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCYYFPF66GVKNQ63","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCYYFPF6","created_at":"2026-05-18T12:29:42.218222+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/TCYYFPF66GVKNQ63UC4K4SJQOD","json":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD.json","graph_json":"https://pith.science/api/pith-number/TCYYFPF66GVKNQ63UC4K4SJQOD/graph.json","events_json":"https://pith.science/api/pith-number/TCYYFPF66GVKNQ63UC4K4SJQOD/events.json","paper":"https://pith.science/paper/TCYYFPF6"},"agent_actions":{"view_html":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD","download_json":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD.json","view_paper":"https://pith.science/paper/TCYYFPF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03263&json=true","fetch_graph":"https://pith.science/api/pith-number/TCYYFPF66GVKNQ63UC4K4SJQOD/graph.json","fetch_events":"https://pith.science/api/pith-number/TCYYFPF66GVKNQ63UC4K4SJQOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD/action/storage_attestation","attest_author":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD/action/author_attestation","sign_citation":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD/action/citation_signature","submit_replication":"https://pith.science/pith/TCYYFPF66GVKNQ63UC4K4SJQOD/action/replication_record"}},"created_at":"2026-05-18T00:16:45.994880+00:00","updated_at":"2026-05-18T00:16:45.994880+00:00"}