{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3P6C5L2WWYKYQPMANOVAJ7JZAX","short_pith_number":"pith:3P6C5L2W","schema_version":"1.0","canonical_sha256":"dbfc2eaf56b615883d806baa04fd3905cd7ec4708b079f4bcc34c19f5a47930e","source":{"kind":"arxiv","id":"1403.3336","version":1},"attestation_state":"computed","paper":{"title":"Executable Refinement Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kenneth Knowles","submitted_at":"2014-03-13T17:31:39Z","abstract_excerpt":"This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type systems in general.\n  Particular contributions include: (1) Type soundness and a logical relation for extensional equivalence for executable refinement types (though type checking is undecidable); (2) hybrid type checking for executable refinement types, which blends static and dynamic checks in a novel way, in some sense performing better statically than a"},"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":"1403.3336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-03-13T17:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"bc160c7d5bdc1db48ddf0ef9cf5a435f161cc40c1fc94292499f14c250d7a608","abstract_canon_sha256":"e2a24b15e3bdcbf1f2710a5f3ada39b527370eabd1aeb95af22bed07e57693a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:21.742592Z","signature_b64":"A+feVit5iXP7c5ruomMmeQbdsnE4H2tH7lvD7NT04yi+8K2buh5FM4mI8931KVmzIePlJqhSOdrHcPkyTKwzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbfc2eaf56b615883d806baa04fd3905cd7ec4708b079f4bcc34c19f5a47930e","last_reissued_at":"2026-05-18T02:56:21.741815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:21.741815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Executable Refinement Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kenneth Knowles","submitted_at":"2014-03-13T17:31:39Z","abstract_excerpt":"This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type systems in general.\n  Particular contributions include: (1) Type soundness and a logical relation for extensional equivalence for executable refinement types (though type checking is undecidable); (2) hybrid type checking for executable refinement types, which blends static and dynamic checks in a novel way, in some sense performing better statically than a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3336","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":"1403.3336","created_at":"2026-05-18T02:56:21.741939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3336v1","created_at":"2026-05-18T02:56:21.741939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3336","created_at":"2026-05-18T02:56:21.741939+00:00"},{"alias_kind":"pith_short_12","alias_value":"3P6C5L2WWYKY","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3P6C5L2WWYKYQPMA","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3P6C5L2W","created_at":"2026-05-18T12:28:11.866339+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/3P6C5L2WWYKYQPMANOVAJ7JZAX","json":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX.json","graph_json":"https://pith.science/api/pith-number/3P6C5L2WWYKYQPMANOVAJ7JZAX/graph.json","events_json":"https://pith.science/api/pith-number/3P6C5L2WWYKYQPMANOVAJ7JZAX/events.json","paper":"https://pith.science/paper/3P6C5L2W"},"agent_actions":{"view_html":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX","download_json":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX.json","view_paper":"https://pith.science/paper/3P6C5L2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3336&json=true","fetch_graph":"https://pith.science/api/pith-number/3P6C5L2WWYKYQPMANOVAJ7JZAX/graph.json","fetch_events":"https://pith.science/api/pith-number/3P6C5L2WWYKYQPMANOVAJ7JZAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX/action/storage_attestation","attest_author":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX/action/author_attestation","sign_citation":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX/action/citation_signature","submit_replication":"https://pith.science/pith/3P6C5L2WWYKYQPMANOVAJ7JZAX/action/replication_record"}},"created_at":"2026-05-18T02:56:21.741939+00:00","updated_at":"2026-05-18T02:56:21.741939+00:00"}