{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TQURVT637BIP6LBKWFXBGEPECF","short_pith_number":"pith:TQURVT63","schema_version":"1.0","canonical_sha256":"9c291acfdbf850ff2c2ab16e1311e4117c3e7762f66806ace0baf880164611cb","source":{"kind":"arxiv","id":"1411.3967","version":2},"attestation_state":"computed","paper":{"title":"Relatively Complete Counterexamples for Higher-Order Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn, Phuc C. Nguyen","submitted_at":"2014-11-14T16:44:31Z","abstract_excerpt":"In this paper, we study the problem of generating inputs to a higher-order program causing it to error. We first study the problem in the setting of PCF, a typed, core functional language and contribute the first relatively complete method for constructing counterexamples for PCF programs. The method is relatively complete in the sense of Hoare logic; completeness is reduced to the completeness of a first-order solver over the base types of PCF. In practice, this means an SMT solver can be used for the effective, automated generation of higher-order counterexamples for a large class of program"},"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":"1411.3967","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-11-14T16:44:31Z","cross_cats_sorted":[],"title_canon_sha256":"cd6cabe51b52b1ef8dc768a32a3f39f71b4b9ba0c970770381cba55d15c0a0e3","abstract_canon_sha256":"4b100c25c3f55b82920d28d34f611b687966bdef2d45dd9ac0d263b88d5b4f73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:21.735354Z","signature_b64":"RTd1N7ZInSTi28wjCE3z7qszySeZz3Pic+cgAhZcdYJtGl/P1pVa/khHbZ04ndfmHWcipjC4xh2HXiVpzjD1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c291acfdbf850ff2c2ab16e1311e4117c3e7762f66806ace0baf880164611cb","last_reissued_at":"2026-05-18T02:18:21.734734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:21.734734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relatively Complete Counterexamples for Higher-Order Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn, Phuc C. Nguyen","submitted_at":"2014-11-14T16:44:31Z","abstract_excerpt":"In this paper, we study the problem of generating inputs to a higher-order program causing it to error. We first study the problem in the setting of PCF, a typed, core functional language and contribute the first relatively complete method for constructing counterexamples for PCF programs. The method is relatively complete in the sense of Hoare logic; completeness is reduced to the completeness of a first-order solver over the base types of PCF. In practice, this means an SMT solver can be used for the effective, automated generation of higher-order counterexamples for a large class of program"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3967","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":"1411.3967","created_at":"2026-05-18T02:18:21.734814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3967v2","created_at":"2026-05-18T02:18:21.734814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3967","created_at":"2026-05-18T02:18:21.734814+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQURVT637BIP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQURVT637BIP6LBK","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQURVT63","created_at":"2026-05-18T12:28:49.207871+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/TQURVT637BIP6LBKWFXBGEPECF","json":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF.json","graph_json":"https://pith.science/api/pith-number/TQURVT637BIP6LBKWFXBGEPECF/graph.json","events_json":"https://pith.science/api/pith-number/TQURVT637BIP6LBKWFXBGEPECF/events.json","paper":"https://pith.science/paper/TQURVT63"},"agent_actions":{"view_html":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF","download_json":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF.json","view_paper":"https://pith.science/paper/TQURVT63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3967&json=true","fetch_graph":"https://pith.science/api/pith-number/TQURVT637BIP6LBKWFXBGEPECF/graph.json","fetch_events":"https://pith.science/api/pith-number/TQURVT637BIP6LBKWFXBGEPECF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF/action/storage_attestation","attest_author":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF/action/author_attestation","sign_citation":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF/action/citation_signature","submit_replication":"https://pith.science/pith/TQURVT637BIP6LBKWFXBGEPECF/action/replication_record"}},"created_at":"2026-05-18T02:18:21.734814+00:00","updated_at":"2026-05-18T02:18:21.734814+00:00"}