{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y53CC6KYDOOJAOH2FZ3CO7P6NG","short_pith_number":"pith:Y53CC6KY","schema_version":"1.0","canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","source":{"kind":"arxiv","id":"1708.02710","version":1},"attestation_state":"computed","paper":{"title":"From Reversible Programs to Univalent Universes and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amr Sabry, Chao-Hong Chen, Jacques Carette, Vikraman Choudhury","submitted_at":"2017-08-09T04:03:13Z","abstract_excerpt":"We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming language to paths in the univalent universe; and combinator optimizations in the programming language to 2-paths in the univalent universe. The result suggests a simple computational interpretation of paths and of univalence in terms of familiar programming constructs whenever the universe in question is computable."},"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":"1708.02710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-09T04:03:13Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"976d00aa5fc73933449ee8bde8a4910c77d733afaf302eb94e3ce90c2bfbfb6d","abstract_canon_sha256":"0cedd631546166fc71f7ada816ca37cca9ba24f12742174f206d3c928b73efc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:43.908088Z","signature_b64":"8sUEkfVMmigV85iU4XaolWYGiNZOfd8zM0cCIUFP8Rf2QHE24U+FAUGbfmwnMV3FvjwBc0neE6w+Xo4MD70LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","last_reissued_at":"2026-05-17T23:40:43.907436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:43.907436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Reversible Programs to Univalent Universes and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amr Sabry, Chao-Hong Chen, Jacques Carette, Vikraman Choudhury","submitted_at":"2017-08-09T04:03:13Z","abstract_excerpt":"We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming language to paths in the univalent universe; and combinator optimizations in the programming language to 2-paths in the univalent universe. The result suggests a simple computational interpretation of paths and of univalence in terms of familiar programming constructs whenever the universe in question is computable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02710","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":"1708.02710","created_at":"2026-05-17T23:40:43.907527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.02710v1","created_at":"2026-05-17T23:40:43.907527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02710","created_at":"2026-05-17T23:40:43.907527+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y53CC6KYDOOJ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y53CC6KYDOOJAOH2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y53CC6KY","created_at":"2026-05-18T12:31:56.362134+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/Y53CC6KYDOOJAOH2FZ3CO7P6NG","json":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG.json","graph_json":"https://pith.science/api/pith-number/Y53CC6KYDOOJAOH2FZ3CO7P6NG/graph.json","events_json":"https://pith.science/api/pith-number/Y53CC6KYDOOJAOH2FZ3CO7P6NG/events.json","paper":"https://pith.science/paper/Y53CC6KY"},"agent_actions":{"view_html":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG","download_json":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG.json","view_paper":"https://pith.science/paper/Y53CC6KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.02710&json=true","fetch_graph":"https://pith.science/api/pith-number/Y53CC6KYDOOJAOH2FZ3CO7P6NG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y53CC6KYDOOJAOH2FZ3CO7P6NG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/action/storage_attestation","attest_author":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/action/author_attestation","sign_citation":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/action/citation_signature","submit_replication":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/action/replication_record"}},"created_at":"2026-05-17T23:40:43.907527+00:00","updated_at":"2026-05-17T23:40:43.907527+00:00"}