{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PA623DBXPUBK3SAGCBLXO5J65W","short_pith_number":"pith:PA623DBX","schema_version":"1.0","canonical_sha256":"783dad8c377d02adc806105777753eedae9a78f1496fbf97c84bb086b68f288d","source":{"kind":"arxiv","id":"2402.13179","version":1},"attestation_state":"computed","paper":{"title":"homotopy.io: a proof assistant for finitely-presented globular $n$-categories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Calin Tataru, Chiara Sarti, Jamie Vicary, Lukas Heidemann, Nathan Corbyn, Nick Hu","submitted_at":"2024-02-20T17:46:49Z","abstract_excerpt":"We present the proof assistant homotopy.io for working with finitely-presented semistrict higher categories. The tool runs in the browser with a point-and-click interface, allowing direct manipulation of proof objects via a graphical representation. We describe the user interface and explain how the tool can be used in practice. We also describe the essential subsystems of the tool, including collapse, contraction, expansion, typechecking, and layout, as well as key implementation details including data structure encoding, memoisation, and rendering. These technical innovations have been essen"},"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":"2402.13179","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-02-20T17:46:49Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"32f182db07b377f076851584ec83c82a3c49c7d567c283a118b4e520d1ecc01a","abstract_canon_sha256":"2868dba7272acb9acc8d7ae549e5f1ee42ed6365b7844a9a19cf6be88f3b2b64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:21.823147Z","signature_b64":"YbAqWLzX1tTqSVjtm3KjA6jwD9CnQpgC3Azd6YG1cUOfs1lcLLuuXZynSvMHNuTt7emd0SbLOIok/FbxLFnWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"783dad8c377d02adc806105777753eedae9a78f1496fbf97c84bb086b68f288d","last_reissued_at":"2026-07-05T07:47:21.822720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:21.822720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"homotopy.io: a proof assistant for finitely-presented globular $n$-categories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Calin Tataru, Chiara Sarti, Jamie Vicary, Lukas Heidemann, Nathan Corbyn, Nick Hu","submitted_at":"2024-02-20T17:46:49Z","abstract_excerpt":"We present the proof assistant homotopy.io for working with finitely-presented semistrict higher categories. The tool runs in the browser with a point-and-click interface, allowing direct manipulation of proof objects via a graphical representation. We describe the user interface and explain how the tool can be used in practice. We also describe the essential subsystems of the tool, including collapse, contraction, expansion, typechecking, and layout, as well as key implementation details including data structure encoding, memoisation, and rendering. These technical innovations have been essen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13179","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.13179/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.13179","created_at":"2026-07-05T07:47:21.822776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13179v1","created_at":"2026-07-05T07:47:21.822776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13179","created_at":"2026-07-05T07:47:21.822776+00:00"},{"alias_kind":"pith_short_12","alias_value":"PA623DBXPUBK","created_at":"2026-07-05T07:47:21.822776+00:00"},{"alias_kind":"pith_short_16","alias_value":"PA623DBXPUBK3SAG","created_at":"2026-07-05T07:47:21.822776+00:00"},{"alias_kind":"pith_short_8","alias_value":"PA623DBX","created_at":"2026-07-05T07:47:21.822776+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.00013","citing_title":"From Provable Correctness to Probabilistic Generation: A Comparative Review of Program Synthesis Paradigms","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W","json":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W.json","graph_json":"https://pith.science/api/pith-number/PA623DBXPUBK3SAGCBLXO5J65W/graph.json","events_json":"https://pith.science/api/pith-number/PA623DBXPUBK3SAGCBLXO5J65W/events.json","paper":"https://pith.science/paper/PA623DBX"},"agent_actions":{"view_html":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W","download_json":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W.json","view_paper":"https://pith.science/paper/PA623DBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13179&json=true","fetch_graph":"https://pith.science/api/pith-number/PA623DBXPUBK3SAGCBLXO5J65W/graph.json","fetch_events":"https://pith.science/api/pith-number/PA623DBXPUBK3SAGCBLXO5J65W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W/action/storage_attestation","attest_author":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W/action/author_attestation","sign_citation":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W/action/citation_signature","submit_replication":"https://pith.science/pith/PA623DBXPUBK3SAGCBLXO5J65W/action/replication_record"}},"created_at":"2026-07-05T07:47:21.822776+00:00","updated_at":"2026-07-05T07:47:21.822776+00:00"}