{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4RVXJ7OFX24AXDHEYVC3BDAYNT","short_pith_number":"pith:4RVXJ7OF","schema_version":"1.0","canonical_sha256":"e46b74fdc5beb80b8ce4c545b08c186cf7b2b30dcc63c141204d520abcf4ade7","source":{"kind":"arxiv","id":"1304.0680","version":3},"attestation_state":"computed","paper":{"title":"Homotopy limits in type theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CT"],"primary_cat":"math.LO","authors_text":"Chris Kapulkin, Jeremy Avigad, Peter LeFanu Lumsdaine","submitted_at":"2013-04-02T16:33:50Z","abstract_excerpt":"Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to formalizing homotopy-theoretic material. We also compare our constructions with the more classical approach to homotopy limits via fibration categories."},"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":"1304.0680","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-04-02T16:33:50Z","cross_cats_sorted":["cs.LO","math.CT"],"title_canon_sha256":"69a5343169836a0de39e3a481641adc8e218a79950ea75ba21e39a424a95470a","abstract_canon_sha256":"dfd4a58ed0025149b83852d5f2671cae3bdb3c4341e58157987cd967422650e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:17.729365Z","signature_b64":"eTU6eO87ns8LPhajueXksuQX8JCe0C6rXCTHlDE0KHD17hvOR5rctwKgKh/ThWyJx2gFbSZDvKIyzXBv8g4/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e46b74fdc5beb80b8ce4c545b08c186cf7b2b30dcc63c141204d520abcf4ade7","last_reissued_at":"2026-05-17T23:53:17.728671Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:17.728671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homotopy limits in type theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CT"],"primary_cat":"math.LO","authors_text":"Chris Kapulkin, Jeremy Avigad, Peter LeFanu Lumsdaine","submitted_at":"2013-04-02T16:33:50Z","abstract_excerpt":"Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to formalizing homotopy-theoretic material. We also compare our constructions with the more classical approach to homotopy limits via fibration categories."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0680","kind":"arxiv","version":3},"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":"1304.0680","created_at":"2026-05-17T23:53:17.728772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0680v3","created_at":"2026-05-17T23:53:17.728772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0680","created_at":"2026-05-17T23:53:17.728772+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RVXJ7OFX24A","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RVXJ7OFX24AXDHE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RVXJ7OF","created_at":"2026-05-18T12:27:34.582898+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/4RVXJ7OFX24AXDHEYVC3BDAYNT","json":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT.json","graph_json":"https://pith.science/api/pith-number/4RVXJ7OFX24AXDHEYVC3BDAYNT/graph.json","events_json":"https://pith.science/api/pith-number/4RVXJ7OFX24AXDHEYVC3BDAYNT/events.json","paper":"https://pith.science/paper/4RVXJ7OF"},"agent_actions":{"view_html":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT","download_json":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT.json","view_paper":"https://pith.science/paper/4RVXJ7OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0680&json=true","fetch_graph":"https://pith.science/api/pith-number/4RVXJ7OFX24AXDHEYVC3BDAYNT/graph.json","fetch_events":"https://pith.science/api/pith-number/4RVXJ7OFX24AXDHEYVC3BDAYNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT/action/storage_attestation","attest_author":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT/action/author_attestation","sign_citation":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT/action/citation_signature","submit_replication":"https://pith.science/pith/4RVXJ7OFX24AXDHEYVC3BDAYNT/action/replication_record"}},"created_at":"2026-05-17T23:53:17.728772+00:00","updated_at":"2026-05-17T23:53:17.728772+00:00"}