{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NE4HNRM3PGOQBHWV7EVCEBX5HU","short_pith_number":"pith:NE4HNRM3","schema_version":"1.0","canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","source":{"kind":"arxiv","id":"1304.5661","version":1},"attestation_state":"computed","paper":{"title":"On Integrating Deductive Synthesis and Verification Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Etienne Kneuss, Ivan Kuraj, Philippe Suter, Viktor Kuncak","submitted_at":"2013-04-20T18:58:36Z","abstract_excerpt":"We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. We present new counterexample-guided algorithms for constructing verified programs. We have implemented these algorithms in an integrated environment for interactive verification and synthesis from relational specifications. Our system was able to synthesize a number of useful recursive functions tha"},"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":"1304.5661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-04-20T18:58:36Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"a128c97290d023ed7605f7753501e75eef50bd35fdafda564be688c88e15feb5","abstract_canon_sha256":"5c2b07dbb674e6c414dca14f22824e27d598a7f7155262c5dc6c5847d9844ef0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:24.474227Z","signature_b64":"aGm3DGVQXf8orFo5PKfsMyTqVvFFe4hOHcEhKUmuC2xjfSWkDz0CJzBZVwUMcq2/9qDRO/kqKpO1D+Iib70EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","last_reissued_at":"2026-05-18T03:27:24.473608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:24.473608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Integrating Deductive Synthesis and Verification Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Etienne Kneuss, Ivan Kuraj, Philippe Suter, Viktor Kuncak","submitted_at":"2013-04-20T18:58:36Z","abstract_excerpt":"We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. We present new counterexample-guided algorithms for constructing verified programs. We have implemented these algorithms in an integrated environment for interactive verification and synthesis from relational specifications. Our system was able to synthesize a number of useful recursive functions tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5661","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":"1304.5661","created_at":"2026-05-18T03:27:24.473700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5661v1","created_at":"2026-05-18T03:27:24.473700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5661","created_at":"2026-05-18T03:27:24.473700+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE4HNRM3PGOQ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE4HNRM3PGOQBHWV","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE4HNRM3","created_at":"2026-05-18T12:27:52.871228+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/NE4HNRM3PGOQBHWV7EVCEBX5HU","json":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU.json","graph_json":"https://pith.science/api/pith-number/NE4HNRM3PGOQBHWV7EVCEBX5HU/graph.json","events_json":"https://pith.science/api/pith-number/NE4HNRM3PGOQBHWV7EVCEBX5HU/events.json","paper":"https://pith.science/paper/NE4HNRM3"},"agent_actions":{"view_html":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU","download_json":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU.json","view_paper":"https://pith.science/paper/NE4HNRM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5661&json=true","fetch_graph":"https://pith.science/api/pith-number/NE4HNRM3PGOQBHWV7EVCEBX5HU/graph.json","fetch_events":"https://pith.science/api/pith-number/NE4HNRM3PGOQBHWV7EVCEBX5HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/action/storage_attestation","attest_author":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/action/author_attestation","sign_citation":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/action/citation_signature","submit_replication":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/action/replication_record"}},"created_at":"2026-05-18T03:27:24.473700+00:00","updated_at":"2026-05-18T03:27:24.473700+00:00"}