{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:72ADNURCNFQ4KDFTP53LECKV2R","short_pith_number":"pith:72ADNURC","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"},"canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","source":{"kind":"arxiv","id":"1610.04641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04641","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04641v1","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04641","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"pith_short_12","alias_value":"72ADNURCNFQ4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"72ADNURCNFQ4KDFT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"72ADNURC","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:72ADNURCNFQ4KDFTP53LECKV2R","target":"record","payload":{"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"},"canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","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"},"source_kind":"arxiv","source_id":"1610.04641","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-18T01:02:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2Z4aJb7tPTSQzLhh6p18IUbt7Fllj6GlnPvCuIimPFfHq3Odfcaf2d3VJRalPZL/lKwEDDrrgBDwmRyN9BMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:04:49.807813Z"},"content_sha256":"2b72e19415d940fb96715871fe24e185143c7310bd2b8a0e04f949d3c3a108c6","schema_version":"1.0","event_id":"sha256:2b72e19415d940fb96715871fe24e185143c7310bd2b8a0e04f949d3c3a108c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:72ADNURCNFQ4KDFTP53LECKV2R","target":"graph","payload":{"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"},"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-18T01:02:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Sq+Zy4epU5hLxd4FRCY95Jw/a6G5u/GPrvyBPGPER+MNWaANo3h4/rF9RUD7fXXVXjQ3UdxWJefYm8gVAxZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:04:49.808168Z"},"content_sha256":"0a8702d2426042dafdb31bad763ec56cba0752ecb3cdd6cf84a6522e709373d7","schema_version":"1.0","event_id":"sha256:0a8702d2426042dafdb31bad763ec56cba0752ecb3cdd6cf84a6522e709373d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/bundle.json","state_url":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72ADNURCNFQ4KDFTP53LECKV2R/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-02T08:04:49Z","links":{"resolver":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R","bundle":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/bundle.json","state":"https://pith.science/pith/72ADNURCNFQ4KDFTP53LECKV2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72ADNURCNFQ4KDFTP53LECKV2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:72ADNURCNFQ4KDFTP53LECKV2R","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":"64eb57bd5583f2f8a7b37cf5f4c1f8e86e619b364fd0119f9662de64ed115af8","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-14T21:04:26Z","title_canon_sha256":"dbaac325339274cb2cf0527c535bb7009ee0d3aa2240360b7b2c2ee79b7fd282"},"schema_version":"1.0","source":{"id":"1610.04641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04641","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04641v1","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04641","created_at":"2026-05-18T01:02:11Z"},{"alias_kind":"pith_short_12","alias_value":"72ADNURCNFQ4","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"72ADNURCNFQ4KDFT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"72ADNURC","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:0a8702d2426042dafdb31bad763ec56cba0752ecb3cdd6cf84a6522e709373d7","target":"graph","created_at":"2026-05-18T01:02:11Z","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":"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","authors_text":"Niki Vazou, Ranjit Jhala","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-14T21:04:26Z","title":"Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04641","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:2b72e19415d940fb96715871fe24e185143c7310bd2b8a0e04f949d3c3a108c6","target":"record","created_at":"2026-05-18T01:02:11Z","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":"64eb57bd5583f2f8a7b37cf5f4c1f8e86e619b364fd0119f9662de64ed115af8","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-14T21:04:26Z","title_canon_sha256":"dbaac325339274cb2cf0527c535bb7009ee0d3aa2240360b7b2c2ee79b7fd282"},"schema_version":"1.0","source":{"id":"1610.04641","kind":"arxiv","version":1}},"canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe8036d2226961c50cb37f76b20955d47a5673123768d55ee42615729f21c075","first_computed_at":"2026-05-18T01:02:11.941430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:11.941430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ry5sVyBEqXq1BegUAkAhwa5LTQ4eXTquZ26G/1ve+G80+G4av60jeLaGPbyaYCrEilXon2FkOfytC4XwpZYmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:11.942087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b72e19415d940fb96715871fe24e185143c7310bd2b8a0e04f949d3c3a108c6","sha256:0a8702d2426042dafdb31bad763ec56cba0752ecb3cdd6cf84a6522e709373d7"],"state_sha256":"60062ddd3b9335f83aa8ac28e73b90ed5c64c79d7f30a3df30b1ce3f014f191b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LG4uwaDk7tQQEovluK11fF93Hgh5w4FMCMNzf1eZ8JcZooTt6fLwUcmzoEalMR41pby6JW43/UBKNxyw3gxQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:04:49.810102Z","bundle_sha256":"29140b1cf6984008fdc537fe11833997d38cda011f94db0e26049bd09b4cff67"}}