{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NE4HNRM3PGOQBHWV7EVCEBX5HU","short_pith_number":"pith:NE4HNRM3","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"},"canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","source":{"kind":"arxiv","id":"1304.5661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5661","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5661v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5661","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"NE4HNRM3PGOQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NE4HNRM3PGOQBHWV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NE4HNRM3","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NE4HNRM3PGOQBHWV7EVCEBX5HU","target":"record","payload":{"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"},"canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","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"},"source_kind":"arxiv","source_id":"1304.5661","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWBq0wExVQp60Zd/As2DQu4FqIrtNMioi75zwZRXPTvp7GqGeUBctZ7TXG7694Eq4lATvsSKzrt5tN+FwdbEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:15:43.749890Z"},"content_sha256":"7b486d906ca2242f004f792f102760ac09ea488ac0f285d91ea852343ea980a9","schema_version":"1.0","event_id":"sha256:7b486d906ca2242f004f792f102760ac09ea488ac0f285d91ea852343ea980a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NE4HNRM3PGOQBHWV7EVCEBX5HU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LyCvBcNFzk/wRUb65+c/8FA6SyKORfVc9KBCYQoeROwxwRNziFWBHlvxpSEtPUT47WkHG9ZwK/kwkeBchVrwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:15:43.750237Z"},"content_sha256":"ac3f05dcb2affb02e610ef061f9cedb2a9ce921efb2eb2fb060b007c0380df6e","schema_version":"1.0","event_id":"sha256:ac3f05dcb2affb02e610ef061f9cedb2a9ce921efb2eb2fb060b007c0380df6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/bundle.json","state_url":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T04:15:43Z","links":{"resolver":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU","bundle":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/bundle.json","state":"https://pith.science/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NE4HNRM3PGOQBHWV7EVCEBX5HU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NE4HNRM3PGOQBHWV7EVCEBX5HU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c2b07dbb674e6c414dca14f22824e27d598a7f7155262c5dc6c5847d9844ef0","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-04-20T18:58:36Z","title_canon_sha256":"a128c97290d023ed7605f7753501e75eef50bd35fdafda564be688c88e15feb5"},"schema_version":"1.0","source":{"id":"1304.5661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5661","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5661v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5661","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"NE4HNRM3PGOQ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NE4HNRM3PGOQBHWV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NE4HNRM3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:ac3f05dcb2affb02e610ef061f9cedb2a9ce921efb2eb2fb060b007c0380df6e","target":"graph","created_at":"2026-05-18T03:27:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Etienne Kneuss, Ivan Kuraj, Philippe Suter, Viktor Kuncak","cross_cats":["cs.LO","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-04-20T18:58:36Z","title":"On Integrating Deductive Synthesis and Verification Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5661","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b486d906ca2242f004f792f102760ac09ea488ac0f285d91ea852343ea980a9","target":"record","created_at":"2026-05-18T03:27:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5c2b07dbb674e6c414dca14f22824e27d598a7f7155262c5dc6c5847d9844ef0","cross_cats_sorted":["cs.LO","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-04-20T18:58:36Z","title_canon_sha256":"a128c97290d023ed7605f7753501e75eef50bd35fdafda564be688c88e15feb5"},"schema_version":"1.0","source":{"id":"1304.5661","kind":"arxiv","version":1}},"canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"693876c59b799d009ed5f92a2206fd3d1836a27d0f8070c844b891065f9ad503","first_computed_at":"2026-05-18T03:27:24.473608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:24.473608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aGm3DGVQXf8orFo5PKfsMyTqVvFFe4hOHcEhKUmuC2xjfSWkDz0CJzBZVwUMcq2/9qDRO/kqKpO1D+Iib70EDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:24.474227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b486d906ca2242f004f792f102760ac09ea488ac0f285d91ea852343ea980a9","sha256:ac3f05dcb2affb02e610ef061f9cedb2a9ce921efb2eb2fb060b007c0380df6e"],"state_sha256":"df069dc7a65355af73e57704e0a279b09f811dbce448dc28fa9e74ddf1e00a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+F27m4ChlHrIhbkEZZ0cFKtM06uZcd3fMlWDfYKgHZ7JD1u4jUuOvps3bXj0aa2kO2SZFN9pt1mUBvyYkTLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:15:43.752234Z","bundle_sha256":"0384e346f8c540c5f9f056585588bf02088ed6c302fd69113ec043af67834b0e"}}