{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5LHHUE2BOXCFYQDMIJ7N3TSRPY","short_pith_number":"pith:5LHHUE2B","schema_version":"1.0","canonical_sha256":"eace7a134175c45c406c427eddce517e27c541ad31fabf72addabe720946ea92","source":{"kind":"arxiv","id":"1510.08419","version":3},"attestation_state":"computed","paper":{"title":"Program Synthesis from Polymorphic Refinement Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Armando Solar-Lezama, Ivan Kuraj, Nadia Polikarpova","submitted_at":"2015-10-28T19:05:11Z","abstract_excerpt":"We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification---and hence synthesis---of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component c"},"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":"1510.08419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-28T19:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"86d5d4c807d3d045a73d2fa53062d4bd87a09c3c806a071988fa2f0ac6353a9f","abstract_canon_sha256":"24e940d5e15bfa2f3a90f9962f67e996d2d97a8541bb1ea2fd790f50ecd4af4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:33.123008Z","signature_b64":"xLlrXtEXje0mvxhGtN7K4Bn4lVxrZYlp2A67XwB/xsVep869KZjr2C2i6w4PSt7sWiMbMSWoWr1xSruXT9BGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eace7a134175c45c406c427eddce517e27c541ad31fabf72addabe720946ea92","last_reissued_at":"2026-05-18T01:16:33.122368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:33.122368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Synthesis from Polymorphic Refinement Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Armando Solar-Lezama, Ivan Kuraj, Nadia Polikarpova","submitted_at":"2015-10-28T19:05:11Z","abstract_excerpt":"We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification---and hence synthesis---of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08419","kind":"arxiv","version":3},"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":"1510.08419","created_at":"2026-05-18T01:16:33.122439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08419v3","created_at":"2026-05-18T01:16:33.122439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08419","created_at":"2026-05-18T01:16:33.122439+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LHHUE2BOXCF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LHHUE2BOXCFYQDM","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LHHUE2B","created_at":"2026-05-18T12:29:05.191682+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/5LHHUE2BOXCFYQDMIJ7N3TSRPY","json":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY.json","graph_json":"https://pith.science/api/pith-number/5LHHUE2BOXCFYQDMIJ7N3TSRPY/graph.json","events_json":"https://pith.science/api/pith-number/5LHHUE2BOXCFYQDMIJ7N3TSRPY/events.json","paper":"https://pith.science/paper/5LHHUE2B"},"agent_actions":{"view_html":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY","download_json":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY.json","view_paper":"https://pith.science/paper/5LHHUE2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08419&json=true","fetch_graph":"https://pith.science/api/pith-number/5LHHUE2BOXCFYQDMIJ7N3TSRPY/graph.json","fetch_events":"https://pith.science/api/pith-number/5LHHUE2BOXCFYQDMIJ7N3TSRPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY/action/storage_attestation","attest_author":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY/action/author_attestation","sign_citation":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY/action/citation_signature","submit_replication":"https://pith.science/pith/5LHHUE2BOXCFYQDMIJ7N3TSRPY/action/replication_record"}},"created_at":"2026-05-18T01:16:33.122439+00:00","updated_at":"2026-05-18T01:16:33.122439+00:00"}