{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:72ADNURCNFQ4KDFTP53LECKV2R","short_pith_number":"pith:72ADNURC","schema_version":"1.0","canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","source":{"kind":"arxiv","id":"1610.04641","version":1},"attestation_state":"computed","paper":{"title":"Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Niki Vazou, Ranjit Jhala","submitted_at":"2016-10-14T21:04:26Z","abstract_excerpt":"Refinement Reflection turns your favorite programming language into a proof assistant by reflecting the code implementing a user-defined function into the function's (output) refinement type. As a consequence, at uses of the function, the function definition is unfolded into the refinement logic in a precise, predictable and most importantly, programmer controllable way. In the logic, we encode functions and lambdas using uninterpreted symbols preserving SMT-based decidable verification. In the language, we provide a library of combinators that lets programmers compose proofs from basic refine"},"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":"1610.04641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-14T21:04:26Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"dbaac325339274cb2cf0527c535bb7009ee0d3aa2240360b7b2c2ee79b7fd282","abstract_canon_sha256":"64eb57bd5583f2f8a7b37cf5f4c1f8e86e619b364fd0119f9662de64ed115af8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:11.942087Z","signature_b64":"ry5sVyBEqXq1BegUAkAhwa5LTQ4eXTquZ26G/1ve+G80+G4av60jeLaGPbyaYCrEilXon2FkOfytC4XwpZYmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","last_reissued_at":"2026-05-18T01:02:11.941430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:11.941430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Niki Vazou, Ranjit Jhala","submitted_at":"2016-10-14T21:04:26Z","abstract_excerpt":"Refinement Reflection turns your favorite programming language into a proof assistant by reflecting the code implementing a user-defined function into the function's (output) refinement type. As a consequence, at uses of the function, the function definition is unfolded into the refinement logic in a precise, predictable and most importantly, programmer controllable way. In the logic, we encode functions and lambdas using uninterpreted symbols preserving SMT-based decidable verification. In the language, we provide a library of combinators that lets programmers compose proofs from basic refine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04641","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":"1610.04641","created_at":"2026-05-18T01:02:11.941525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04641v1","created_at":"2026-05-18T01:02:11.941525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04641","created_at":"2026-05-18T01:02:11.941525+00:00"},{"alias_kind":"pith_short_12","alias_value":"72ADNURCNFQ4","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"72ADNURCNFQ4KDFT","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"72ADNURC","created_at":"2026-05-18T12:30:04.600751+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/72ADNURCNFQ4KDFTP53LECKV2R","json":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R.json","graph_json":"https://pith.science/api/pith-number/72ADNURCNFQ4KDFTP53LECKV2R/graph.json","events_json":"https://pith.science/api/pith-number/72ADNURCNFQ4KDFTP53LECKV2R/events.json","paper":"https://pith.science/paper/72ADNURC"},"agent_actions":{"view_html":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R","download_json":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R.json","view_paper":"https://pith.science/paper/72ADNURC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04641&json=true","fetch_graph":"https://pith.science/api/pith-number/72ADNURCNFQ4KDFTP53LECKV2R/graph.json","fetch_events":"https://pith.science/api/pith-number/72ADNURCNFQ4KDFTP53LECKV2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/action/storage_attestation","attest_author":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/action/author_attestation","sign_citation":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/action/citation_signature","submit_replication":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/action/replication_record"}},"created_at":"2026-05-18T01:02:11.941525+00:00","updated_at":"2026-05-18T01:02:11.941525+00:00"}