{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HSAVMKUNRLRZBZK7W5TXSB4RHM","short_pith_number":"pith:HSAVMKUN","schema_version":"1.0","canonical_sha256":"3c81562a8d8ae390e55fb7677907913b07e772aef6ae749a8db87184d7b970fb","source":{"kind":"arxiv","id":"1512.02274","version":1},"attestation_state":"computed","paper":{"title":"Constructing the Propositional Truncation using Non-recursive HITs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Floris van Doorn","submitted_at":"2015-12-07T22:42:40Z","abstract_excerpt":"In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs). This is a first step towards reducing recursive HITs to non-recursive HITs. This construction gives a characterization of functions from the propositional truncation to an arbitrary type, extending the universal property of the propositional truncation. We have fully formalized all the results in a new proof assistant, Lean."},"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":"1512.02274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-07T22:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"db70f85508a829b79fb3f10a488a7a76879d5781866204246d1df98936a9a3ea","abstract_canon_sha256":"c1757db105d782900491734265106e6b1ede43b37d89ca88d9c4be83b7ce2b8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:45.107083Z","signature_b64":"1mIqvpMzPkrNUrHufbf79WTScke/MhRS0OhgAy5XMA9jFz/4Rr7eIzcLw+sZ1TAmrENloBuIfY0ZbDR+Oy8qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c81562a8d8ae390e55fb7677907913b07e772aef6ae749a8db87184d7b970fb","last_reissued_at":"2026-05-18T01:24:45.106403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:45.106403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing the Propositional Truncation using Non-recursive HITs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Floris van Doorn","submitted_at":"2015-12-07T22:42:40Z","abstract_excerpt":"In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs). This is a first step towards reducing recursive HITs to non-recursive HITs. This construction gives a characterization of functions from the propositional truncation to an arbitrary type, extending the universal property of the propositional truncation. We have fully formalized all the results in a new proof assistant, Lean."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02274","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":"1512.02274","created_at":"2026-05-18T01:24:45.106503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02274v1","created_at":"2026-05-18T01:24:45.106503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02274","created_at":"2026-05-18T01:24:45.106503+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSAVMKUNRLRZ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSAVMKUNRLRZBZK7","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSAVMKUN","created_at":"2026-05-18T12:29:25.134429+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":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM","json":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM.json","graph_json":"https://pith.science/api/pith-number/HSAVMKUNRLRZBZK7W5TXSB4RHM/graph.json","events_json":"https://pith.science/api/pith-number/HSAVMKUNRLRZBZK7W5TXSB4RHM/events.json","paper":"https://pith.science/paper/HSAVMKUN"},"agent_actions":{"view_html":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM","download_json":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM.json","view_paper":"https://pith.science/paper/HSAVMKUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02274&json=true","fetch_graph":"https://pith.science/api/pith-number/HSAVMKUNRLRZBZK7W5TXSB4RHM/graph.json","fetch_events":"https://pith.science/api/pith-number/HSAVMKUNRLRZBZK7W5TXSB4RHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM/action/storage_attestation","attest_author":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM/action/author_attestation","sign_citation":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM/action/citation_signature","submit_replication":"https://pith.science/pith/HSAVMKUNRLRZBZK7W5TXSB4RHM/action/replication_record"}},"created_at":"2026-05-18T01:24:45.106503+00:00","updated_at":"2026-05-18T01:24:45.106503+00:00"}