{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2OPRL7HLS32DC3YX73FKCOXLMO","short_pith_number":"pith:2OPRL7HL","schema_version":"1.0","canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","source":{"kind":"arxiv","id":"1604.08873","version":2},"attestation_state":"computed","paper":{"title":"Computational Higher Type Theory I: Abstract Cubical Realizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlo Angiuli, Robert Harper, Todd Wilson","submitted_at":"2016-04-29T15:26:22Z","abstract_excerpt":"Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\\\"of's meaning explanations for constructive type theory define the concept of a type in terms of computation. Briefly, a type is a complete (closed) program that evaluates to a canonical type whose members are complete programs that evaluate to canonical elements of that type. The explanation is extended to incomplete (open) programs by functionality: types and elements must respect equality in their free variables. Equality is evidence-free---t"},"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":"1604.08873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"a9b4dbad95475869d1343943689bb18398d014d0f780db7041aeb23d23830a9d","abstract_canon_sha256":"9d047cfdc067f80512bebfb22e8064f77ebcb7c750b2578f4e81859af73f10aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:29.371832Z","signature_b64":"qFaB9cMo3T1Wfym3fs9FDEZrFmw5MqSPx6YlEf+3G83tCosnvv4OuEN6fesmK+NbcYSbSBExBavYlP2x3QF2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","last_reissued_at":"2026-05-18T01:12:29.371508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:29.371508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Higher Type Theory I: Abstract Cubical Realizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlo Angiuli, Robert Harper, Todd Wilson","submitted_at":"2016-04-29T15:26:22Z","abstract_excerpt":"Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\\\"of's meaning explanations for constructive type theory define the concept of a type in terms of computation. Briefly, a type is a complete (closed) program that evaluates to a canonical type whose members are complete programs that evaluate to canonical elements of that type. The explanation is extended to incomplete (open) programs by functionality: types and elements must respect equality in their free variables. Equality is evidence-free---t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08873","kind":"arxiv","version":2},"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":"1604.08873","created_at":"2026-05-18T01:12:29.371556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08873v2","created_at":"2026-05-18T01:12:29.371556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08873","created_at":"2026-05-18T01:12:29.371556+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OPRL7HLS32D","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OPRL7HLS32DC3YX","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OPRL7HL","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09435","citing_title":"Classifying Types","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO","json":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO.json","graph_json":"https://pith.science/api/pith-number/2OPRL7HLS32DC3YX73FKCOXLMO/graph.json","events_json":"https://pith.science/api/pith-number/2OPRL7HLS32DC3YX73FKCOXLMO/events.json","paper":"https://pith.science/paper/2OPRL7HL"},"agent_actions":{"view_html":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO","download_json":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO.json","view_paper":"https://pith.science/paper/2OPRL7HL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08873&json=true","fetch_graph":"https://pith.science/api/pith-number/2OPRL7HLS32DC3YX73FKCOXLMO/graph.json","fetch_events":"https://pith.science/api/pith-number/2OPRL7HLS32DC3YX73FKCOXLMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/action/storage_attestation","attest_author":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/action/author_attestation","sign_citation":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/action/citation_signature","submit_replication":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/action/replication_record"}},"created_at":"2026-05-18T01:12:29.371556+00:00","updated_at":"2026-05-18T01:12:29.371556+00:00"}