{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2OPRL7HLS32DC3YX73FKCOXLMO","short_pith_number":"pith:2OPRL7HL","canonical_record":{"source":{"id":"1604.08873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"a9b4dbad95475869d1343943689bb18398d014d0f780db7041aeb23d23830a9d","abstract_canon_sha256":"9d047cfdc067f80512bebfb22e8064f77ebcb7c750b2578f4e81859af73f10aa"},"schema_version":"1.0"},"canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","source":{"kind":"arxiv","id":"1604.08873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08873","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08873v2","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08873","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"pith_short_12","alias_value":"2OPRL7HLS32D","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OPRL7HLS32DC3YX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OPRL7HL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2OPRL7HLS32DC3YX73FKCOXLMO","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","cross_cats_sorted":[],"title_canon_sha256":"a9b4dbad95475869d1343943689bb18398d014d0f780db7041aeb23d23830a9d","abstract_canon_sha256":"9d047cfdc067f80512bebfb22e8064f77ebcb7c750b2578f4e81859af73f10aa"},"schema_version":"1.0"},"canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:29.371832Z","signature_b64":"qFaB9cMo3T1Wfym3fs9FDEZrFmw5MqSPx6YlEf+3G83tCosnvv4OuEN6fesmK+NbcYSbSBExBavYlP2x3QF2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","last_reissued_at":"2026-05-18T01:12:29.371508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:29.371508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08873","source_version":2,"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-18T01:12:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftvmI8KUaxmHMruB2KhozJgPfImpNBB85SBeNMkB/7kfe0CscTYJW7/rXl/RbELOJ7RLXEjn3Y1Zs2Omx4oNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:14.717901Z"},"content_sha256":"cd969db57c4a6e418fd523b1961cdb395c695a37807b05a283d3dfd4e02a1ff5","schema_version":"1.0","event_id":"sha256:cd969db57c4a6e418fd523b1961cdb395c695a37807b05a283d3dfd4e02a1ff5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2OPRL7HLS32DC3YX73FKCOXLMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Higher Type Theory I: Abstract Cubical Realizability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Carlo Angiuli, Robert Harper, Todd Wilson","submitted_at":"2016-04-29T15:26:22Z","abstract_excerpt":"Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\\\"of's meaning explanations for constructive type theory define the concept of a type in terms of computation. Briefly, a type is a complete (closed) program that evaluates to a canonical type whose members are complete programs that evaluate to canonical elements of that type. The explanation is extended to incomplete (open) programs by functionality: types and elements must respect equality in their free variables. Equality is evidence-free---t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08873","kind":"arxiv","version":2},"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-18T01:12:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDfgH8CTehNaG3w3sEDzMzOLI8eqHVb/tI4dem7dFEly2t/U6cIZ74cVCFHH61OmjipPlvHIBaL93QTrL6qyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:14.718261Z"},"content_sha256":"794427034161a9b2b75b0fe1ce26ce7ac6ca39c20edc2afe69b186b52b3fc7bd","schema_version":"1.0","event_id":"sha256:794427034161a9b2b75b0fe1ce26ce7ac6ca39c20edc2afe69b186b52b3fc7bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/bundle.json","state_url":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OPRL7HLS32DC3YX73FKCOXLMO/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-05-27T16:10:14Z","links":{"resolver":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO","bundle":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/bundle.json","state":"https://pith.science/pith/2OPRL7HLS32DC3YX73FKCOXLMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OPRL7HLS32DC3YX73FKCOXLMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2OPRL7HLS32DC3YX73FKCOXLMO","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":"9d047cfdc067f80512bebfb22e8064f77ebcb7c750b2578f4e81859af73f10aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","title_canon_sha256":"a9b4dbad95475869d1343943689bb18398d014d0f780db7041aeb23d23830a9d"},"schema_version":"1.0","source":{"id":"1604.08873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08873","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08873v2","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08873","created_at":"2026-05-18T01:12:29Z"},{"alias_kind":"pith_short_12","alias_value":"2OPRL7HLS32D","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OPRL7HLS32DC3YX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OPRL7HL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:794427034161a9b2b75b0fe1ce26ce7ac6ca39c20edc2afe69b186b52b3fc7bd","target":"graph","created_at":"2026-05-18T01:12:29Z","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":"Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\\\"of's meaning explanations for constructive type theory define the concept of a type in terms of computation. Briefly, a type is a complete (closed) program that evaluates to a canonical type whose members are complete programs that evaluate to canonical elements of that type. The explanation is extended to incomplete (open) programs by functionality: types and elements must respect equality in their free variables. Equality is evidence-free---t","authors_text":"Carlo Angiuli, Robert Harper, Todd Wilson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","title":"Computational Higher Type Theory I: Abstract Cubical Realizability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08873","kind":"arxiv","version":2},"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:cd969db57c4a6e418fd523b1961cdb395c695a37807b05a283d3dfd4e02a1ff5","target":"record","created_at":"2026-05-18T01:12:29Z","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":"9d047cfdc067f80512bebfb22e8064f77ebcb7c750b2578f4e81859af73f10aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-29T15:26:22Z","title_canon_sha256":"a9b4dbad95475869d1343943689bb18398d014d0f780db7041aeb23d23830a9d"},"schema_version":"1.0","source":{"id":"1604.08873","kind":"arxiv","version":2}},"canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d39f15fceb96f4316f17fecaa13aeb63968e3edd4d170726158cb7129b5a6d2b","first_computed_at":"2026-05-18T01:12:29.371508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:29.371508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qFaB9cMo3T1Wfym3fs9FDEZrFmw5MqSPx6YlEf+3G83tCosnvv4OuEN6fesmK+NbcYSbSBExBavYlP2x3QF2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:29.371832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd969db57c4a6e418fd523b1961cdb395c695a37807b05a283d3dfd4e02a1ff5","sha256:794427034161a9b2b75b0fe1ce26ce7ac6ca39c20edc2afe69b186b52b3fc7bd"],"state_sha256":"9346b9e38aa01b00b63bda9bdbf65cb0bfcd17501c30a2a3c58e6ac71a787c36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFJWR/+sboM97a7qAUyU0Zn7myvVevw6E0suvA8uFcLtMgThXvIMJJ6E8DksYzgGb8gl3zo1OOkFKlWuEtymDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:14.721219Z","bundle_sha256":"9ef9f64b49b72c18b0304469a2103a41dc019fde9bcdca28010908a6073d8c39"}}