{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J44LYO6SPQMCUQAN6CDBYWA76K","short_pith_number":"pith:J44LYO6S","schema_version":"1.0","canonical_sha256":"4f38bc3bd27c182a400df0861c581ff2812414a166655013695aa9bb26940052","source":{"kind":"arxiv","id":"1810.09367","version":1},"attestation_state":"computed","paper":{"title":"Canonicity and normalisation for Dependent Type Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Thierry Coquand","submitted_at":"2018-10-22T15:36:39Z","abstract_excerpt":"We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the work of Tait. A key feature of our approach is the use of a proof relevant notion of reducibility."},"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":"1810.09367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-22T15:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"d6498e276abb3c731c9ae2db1cd2233a4a08a11e1431ffaac5a53216a2337644","abstract_canon_sha256":"62237144121a3cc346c14c6d5a66dc43468aef3809e830b1400d66ef5fe04c15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.335501Z","signature_b64":"8Jwopa/tDOx6XhMsO2E6W3Xkd4dvFZurqrdDfILBfY9LDNnyqrximASAaqcuYkFDj6jxvDezGM9xlo4T+y9lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f38bc3bd27c182a400df0861c581ff2812414a166655013695aa9bb26940052","last_reissued_at":"2026-05-18T00:02:40.334996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.334996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonicity and normalisation for Dependent Type Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Thierry Coquand","submitted_at":"2018-10-22T15:36:39Z","abstract_excerpt":"We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the work of Tait. A key feature of our approach is the use of a proof relevant notion of reducibility."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09367","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":"1810.09367","created_at":"2026-05-18T00:02:40.335061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09367v1","created_at":"2026-05-18T00:02:40.335061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09367","created_at":"2026-05-18T00:02:40.335061+00:00"},{"alias_kind":"pith_short_12","alias_value":"J44LYO6SPQMC","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J44LYO6SPQMCUQAN","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J44LYO6S","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07562","citing_title":"Shallow Embedding of Type Theory is Morally Correct","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K","json":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K.json","graph_json":"https://pith.science/api/pith-number/J44LYO6SPQMCUQAN6CDBYWA76K/graph.json","events_json":"https://pith.science/api/pith-number/J44LYO6SPQMCUQAN6CDBYWA76K/events.json","paper":"https://pith.science/paper/J44LYO6S"},"agent_actions":{"view_html":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K","download_json":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K.json","view_paper":"https://pith.science/paper/J44LYO6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09367&json=true","fetch_graph":"https://pith.science/api/pith-number/J44LYO6SPQMCUQAN6CDBYWA76K/graph.json","fetch_events":"https://pith.science/api/pith-number/J44LYO6SPQMCUQAN6CDBYWA76K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K/action/storage_attestation","attest_author":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K/action/author_attestation","sign_citation":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K/action/citation_signature","submit_replication":"https://pith.science/pith/J44LYO6SPQMCUQAN6CDBYWA76K/action/replication_record"}},"created_at":"2026-05-18T00:02:40.335061+00:00","updated_at":"2026-05-18T00:02:40.335061+00:00"}