{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KVEKCBJXGB3HJHMHRRBS6INHQD","short_pith_number":"pith:KVEKCBJX","canonical_record":{"source":{"id":"1805.00289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-01T12:26:33Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"67e20e96414636acb2b026ab9f7eeb10662c8c51dbb19a4537d2a0a241e9f867","abstract_canon_sha256":"42a1164620f62c342fc8d50f5c28452f7310ff38407431263c3d5fcf763f0976"},"schema_version":"1.0"},"canonical_sha256":"5548a105373076749d878c432f21a780eb067cf3cfdfee480229b977dccf2d51","source":{"kind":"arxiv","id":"1805.00289","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00289","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00289v2","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00289","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"KVEKCBJXGB3H","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KVEKCBJXGB3HJHMH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KVEKCBJX","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KVEKCBJXGB3HJHMHRRBS6INHQD","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-01T12:26:33Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"67e20e96414636acb2b026ab9f7eeb10662c8c51dbb19a4537d2a0a241e9f867","abstract_canon_sha256":"42a1164620f62c342fc8d50f5c28452f7310ff38407431263c3d5fcf763f0976"},"schema_version":"1.0"},"canonical_sha256":"5548a105373076749d878c432f21a780eb067cf3cfdfee480229b977dccf2d51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:49.850127Z","signature_b64":"q/QN9Wvk0MBjL8xlO/B6gnzp3SSdcpQzce4KRUyrfnhey9K/xXlpLNw4RqnA149lkhaOnd9qV5OT3GCgZhfQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5548a105373076749d878c432f21a780eb067cf3cfdfee480229b977dccf2d51","last_reissued_at":"2026-05-18T00:16:49.849542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:49.849542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00289","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-18T00:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5md0up8fuHFqSIe+v2frJUamn6GFsaXQRS7q4GfE/eZYXmxXDafQ1bGUKzoTaCsr/RlVCN8idOIvCjpBh3ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T01:50:47.433948Z"},"content_sha256":"d79f423270334b3dc50b6972b520d5c09965e75e82e9c38ec2e3f69926170085","schema_version":"1.0","event_id":"sha256:d79f423270334b3dc50b6972b520d5c09965e75e82e9c38ec2e3f69926170085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KVEKCBJXGB3HJHMHRRBS6INHQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Denotational semantics of recursive types in synthetic guarded domain theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Marco Paviotti, Rasmus E. M{\\o}gelberg","submitted_at":"2018-05-01T12:26:33Z","abstract_excerpt":"Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging. This paper is part of a project on formulating denotational semantics in type theories with guarded recursion. This should have the benefit of not only giving simpler semantics and proofs of properties such as adequacy, but also hopefully in the future to scale to languages with advanced features, such as general references, outs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00289","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-18T00:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgYK8snpDcFu9NdR++e8/WYrMIFsZejClvgofLonFR5hyoAEhvdIksN+53LfroN1H+2Ktq+RHi/UD95Qdzd8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T01:50:47.434302Z"},"content_sha256":"22677c1546628b70a11e4fb79cb0aebd756eb2fdca1dab664972234f6c0527af","schema_version":"1.0","event_id":"sha256:22677c1546628b70a11e4fb79cb0aebd756eb2fdca1dab664972234f6c0527af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/bundle.json","state_url":"https://pith.science/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/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-07-01T01:50:47Z","links":{"resolver":"https://pith.science/pith/KVEKCBJXGB3HJHMHRRBS6INHQD","bundle":"https://pith.science/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/bundle.json","state":"https://pith.science/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVEKCBJXGB3HJHMHRRBS6INHQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KVEKCBJXGB3HJHMHRRBS6INHQD","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":"42a1164620f62c342fc8d50f5c28452f7310ff38407431263c3d5fcf763f0976","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-01T12:26:33Z","title_canon_sha256":"67e20e96414636acb2b026ab9f7eeb10662c8c51dbb19a4537d2a0a241e9f867"},"schema_version":"1.0","source":{"id":"1805.00289","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00289","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00289v2","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00289","created_at":"2026-05-18T00:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"KVEKCBJXGB3H","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KVEKCBJXGB3HJHMH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KVEKCBJX","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:22677c1546628b70a11e4fb79cb0aebd756eb2fdca1dab664972234f6c0527af","target":"graph","created_at":"2026-05-18T00:16:49Z","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":"Just like any other branch of mathematics, denotational semantics of programming languages should be formalised in type theory, but adapting traditional domain theoretic semantics, as originally formulated in classical set theory to type theory has proven challenging. This paper is part of a project on formulating denotational semantics in type theories with guarded recursion. This should have the benefit of not only giving simpler semantics and proofs of properties such as adequacy, but also hopefully in the future to scale to languages with advanced features, such as general references, outs","authors_text":"Marco Paviotti, Rasmus E. M{\\o}gelberg","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-01T12:26:33Z","title":"Denotational semantics of recursive types in synthetic guarded domain theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00289","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:d79f423270334b3dc50b6972b520d5c09965e75e82e9c38ec2e3f69926170085","target":"record","created_at":"2026-05-18T00:16:49Z","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":"42a1164620f62c342fc8d50f5c28452f7310ff38407431263c3d5fcf763f0976","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-01T12:26:33Z","title_canon_sha256":"67e20e96414636acb2b026ab9f7eeb10662c8c51dbb19a4537d2a0a241e9f867"},"schema_version":"1.0","source":{"id":"1805.00289","kind":"arxiv","version":2}},"canonical_sha256":"5548a105373076749d878c432f21a780eb067cf3cfdfee480229b977dccf2d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5548a105373076749d878c432f21a780eb067cf3cfdfee480229b977dccf2d51","first_computed_at":"2026-05-18T00:16:49.849542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:49.849542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/QN9Wvk0MBjL8xlO/B6gnzp3SSdcpQzce4KRUyrfnhey9K/xXlpLNw4RqnA149lkhaOnd9qV5OT3GCgZhfQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:49.850127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00289","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d79f423270334b3dc50b6972b520d5c09965e75e82e9c38ec2e3f69926170085","sha256:22677c1546628b70a11e4fb79cb0aebd756eb2fdca1dab664972234f6c0527af"],"state_sha256":"2fdce02051d508754594a052a6859b79c2162bd6a199c62cb9bd23bcb2f65055"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STcNRkCv7ra6RkOOudzg7fAtR3MuZHYMp02SRHpx1/oPwAVpotzrSCfRYgW0U50sW1QTmRA8ulIcGJx8wcyTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T01:50:47.436560Z","bundle_sha256":"e0e224645a77050a13df15715b9af6ca556b3a4bb696312898ac74aaa0fea1b4"}}