{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y53CC6KYDOOJAOH2FZ3CO7P6NG","short_pith_number":"pith:Y53CC6KY","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"},"canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","source":{"kind":"arxiv","id":"1708.02710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02710","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02710v1","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02710","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y53CC6KYDOOJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y53CC6KYDOOJAOH2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y53CC6KY","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y53CC6KYDOOJAOH2FZ3CO7P6NG","target":"record","payload":{"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"},"canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","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"},"source_kind":"arxiv","source_id":"1708.02710","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMxkpmTOceOumCXBOFENnCBGxxkutKE6oxoGd5+w9vk0lSwLrmLIkb1R2WkUEFNm5Mk9ZAxmDstuqrgv0zZGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:53:52.257508Z"},"content_sha256":"282b453c8ad2d4df9e0fc84fc00b18897b3294488984e633a14de577a3a1fca6","schema_version":"1.0","event_id":"sha256:282b453c8ad2d4df9e0fc84fc00b18897b3294488984e633a14de577a3a1fca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y53CC6KYDOOJAOH2FZ3CO7P6NG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtUU9ecvJjnsrLLg628hH9RJu+Cj2TT+xLXP9BZEyqb0DhlCWw3WVLNoz/9pd5qOKBeFJ7cgRqu2buqLYvmtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:53:52.257850Z"},"content_sha256":"c356b32fceb3d3d078c2817fd9d616fdc0dd13adf598e72f95adf1dca0061d16","schema_version":"1.0","event_id":"sha256:c356b32fceb3d3d078c2817fd9d616fdc0dd13adf598e72f95adf1dca0061d16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/bundle.json","state_url":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T22:53:52Z","links":{"resolver":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG","bundle":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/bundle.json","state":"https://pith.science/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y53CC6KYDOOJAOH2FZ3CO7P6NG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y53CC6KYDOOJAOH2FZ3CO7P6NG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0cedd631546166fc71f7ada816ca37cca9ba24f12742174f206d3c928b73efc4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-09T04:03:13Z","title_canon_sha256":"976d00aa5fc73933449ee8bde8a4910c77d733afaf302eb94e3ce90c2bfbfb6d"},"schema_version":"1.0","source":{"id":"1708.02710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02710","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02710v1","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02710","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"Y53CC6KYDOOJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y53CC6KYDOOJAOH2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y53CC6KY","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:c356b32fceb3d3d078c2817fd9d616fdc0dd13adf598e72f95adf1dca0061d16","target":"graph","created_at":"2026-05-17T23:40:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Amr Sabry, Chao-Hong Chen, Jacques Carette, Vikraman Choudhury","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-09T04:03:13Z","title":"From Reversible Programs to Univalent Universes and Back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02710","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:282b453c8ad2d4df9e0fc84fc00b18897b3294488984e633a14de577a3a1fca6","target":"record","created_at":"2026-05-17T23:40:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0cedd631546166fc71f7ada816ca37cca9ba24f12742174f206d3c928b73efc4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-09T04:03:13Z","title_canon_sha256":"976d00aa5fc73933449ee8bde8a4910c77d733afaf302eb94e3ce90c2bfbfb6d"},"schema_version":"1.0","source":{"id":"1708.02710","kind":"arxiv","version":1}},"canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7762179581b9c9038fa2e76277dfe69a5716395201523a43e69b59772ce0e60","first_computed_at":"2026-05-17T23:40:43.907436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:43.907436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8sUEkfVMmigV85iU4XaolWYGiNZOfd8zM0cCIUFP8Rf2QHE24U+FAUGbfmwnMV3FvjwBc0neE6w+Xo4MD70LAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:43.908088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:282b453c8ad2d4df9e0fc84fc00b18897b3294488984e633a14de577a3a1fca6","sha256:c356b32fceb3d3d078c2817fd9d616fdc0dd13adf598e72f95adf1dca0061d16"],"state_sha256":"d15c3bd5a00699aa889cf657e3230872a3337989b8958ff6e5905082f664c93f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9L1+YSHEmQOcFwbiQcBXTiUooYMbPX1uRUP6mIzuSyCckNUfhj6DLGsVkC7Upy6dg5SIPtryWs/+vEBmkBSqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:53:52.259862Z","bundle_sha256":"bb7a0ff3fef6c4ce7fbcf0c16f9fef82a2d379818c2bde961211b54e6ec3cf96"}}