{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NFPUHMVQDKEXJQT3YM7E5BLF2Y","short_pith_number":"pith:NFPUHMVQ","schema_version":"1.0","canonical_sha256":"695f43b2b01a8974c27bc33e4e8565d63c5d2588a7cb79488e38b71cdb97b6ff","source":{"kind":"arxiv","id":"2601.04045","version":2},"attestation_state":"computed","paper":{"title":"Recursive Program Synthesis from Sketches and Mixed-Quantifier Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Derek Egolf, Stavros Tripakis","submitted_at":"2026-01-07T16:00:43Z","abstract_excerpt":"We present a novel approach for the synthesis of recursive programs from mixed-quantifier first-order logic properties. We solve this problem using a sketching-based, enumerative, counterexample-guided approach. Our algorithm learns syntactic constraints from counterexamples to prune the candidate space and employs a prophylactic pruning technique to avoid enumerating invalid candidates altogether. We implement our technique in a tool called Cataclyst and evaluate it on a suite of 60 benchmarks. We demonstrate that both counterexample generalization and prophylactic pruning significantly impro"},"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":"2601.04045","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-01-07T16:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"228e0af27f31d21033f2007a79afb4e4dca9bb7c33dfeb4ba9530df88cd68e2b","abstract_canon_sha256":"61646f8f8091dfa878eee8af51dbd866a23eafacfd009ea01c2d873720e75e9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:19.857937Z","signature_b64":"UkPvghOu8mWLjGPfNvfn95CdJCIBA0zjQh1jOAXBctuf6zgbi6Szip3ar1eNoi4IY2S38lFpAUGTNAUvcowFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"695f43b2b01a8974c27bc33e4e8565d63c5d2588a7cb79488e38b71cdb97b6ff","last_reissued_at":"2026-07-23T01:24:19.857005Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:19.857005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Program Synthesis from Sketches and Mixed-Quantifier Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Derek Egolf, Stavros Tripakis","submitted_at":"2026-01-07T16:00:43Z","abstract_excerpt":"We present a novel approach for the synthesis of recursive programs from mixed-quantifier first-order logic properties. We solve this problem using a sketching-based, enumerative, counterexample-guided approach. Our algorithm learns syntactic constraints from counterexamples to prune the candidate space and employs a prophylactic pruning technique to avoid enumerating invalid candidates altogether. We implement our technique in a tool called Cataclyst and evaluate it on a suite of 60 benchmarks. We demonstrate that both counterexample generalization and prophylactic pruning significantly impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04045","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.04045/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2601.04045","created_at":"2026-07-23T01:24:19.857447+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.04045v2","created_at":"2026-07-23T01:24:19.857447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04045","created_at":"2026-07-23T01:24:19.857447+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFPUHMVQDKEX","created_at":"2026-07-23T01:24:19.857447+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFPUHMVQDKEXJQT3","created_at":"2026-07-23T01:24:19.857447+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFPUHMVQ","created_at":"2026-07-23T01:24:19.857447+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/NFPUHMVQDKEXJQT3YM7E5BLF2Y","json":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y.json","graph_json":"https://pith.science/api/pith-number/NFPUHMVQDKEXJQT3YM7E5BLF2Y/graph.json","events_json":"https://pith.science/api/pith-number/NFPUHMVQDKEXJQT3YM7E5BLF2Y/events.json","paper":"https://pith.science/paper/NFPUHMVQ"},"agent_actions":{"view_html":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y","download_json":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y.json","view_paper":"https://pith.science/paper/NFPUHMVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.04045&json=true","fetch_graph":"https://pith.science/api/pith-number/NFPUHMVQDKEXJQT3YM7E5BLF2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/NFPUHMVQDKEXJQT3YM7E5BLF2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y/action/storage_attestation","attest_author":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y/action/author_attestation","sign_citation":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y/action/citation_signature","submit_replication":"https://pith.science/pith/NFPUHMVQDKEXJQT3YM7E5BLF2Y/action/replication_record"}},"created_at":"2026-07-23T01:24:19.857447+00:00","updated_at":"2026-07-23T01:24:19.857447+00:00"}