{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6ZBBYL5TXV3KZHED4UEPEFYPBM","short_pith_number":"pith:6ZBBYL5T","canonical_record":{"source":{"id":"1501.02925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"bff14a4b31a66637d4553b9613ff7d9a2f4df78795c75cb4ecef09550f8c0764","abstract_canon_sha256":"465c83bd25dcb4ea3e2ff5384c0eefab41e8e693a1012314025eda1a0d129216"},"schema_version":"1.0"},"canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","source":{"kind":"arxiv","id":"1501.02925","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02925","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02925v2","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02925","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"6ZBBYL5TXV3K","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6ZBBYL5TXV3KZHED","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6ZBBYL5T","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6ZBBYL5TXV3KZHED4UEPEFYPBM","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"bff14a4b31a66637d4553b9613ff7d9a2f4df78795c75cb4ecef09550f8c0764","abstract_canon_sha256":"465c83bd25dcb4ea3e2ff5384c0eefab41e8e693a1012314025eda1a0d129216"},"schema_version":"1.0"},"canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:22.926223Z","signature_b64":"haWvOjURk8eY2IXF+/bzKvi0FybbCFW4zbtu2TC/cFc0/2C3CmH3ht4un7kb2q0QfZ37dIcz2nKyWFod7wppDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","last_reissued_at":"2026-05-18T02:29:22.925718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:22.925718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02925","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-18T02:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TNNj3SAOpg9YQSpXuJRF7Ao5S+zwWNFKUVq9EG3kpOtT1EQDm9OnPLOBr5Yx/T0Wx6QmbsXXN5ttnW3QVOMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:24:15.323991Z"},"content_sha256":"5d3dcdfd3ac80bffdbae4603867d74dffdfd73568b04902244f7277b857abdb5","schema_version":"1.0","event_id":"sha256:5d3dcdfd3ac80bffdbae4603867d74dffdfd73568b04902244f7277b857abdb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6ZBBYL5TXV3KZHED4UEPEFYPBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Programming and Reasoning with Guarded Recursion for Coinductive Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ale\\v{s} Bizjak, Hans Bugge Grathwohl, Lars Birkedal, Ranald Clouston","submitted_at":"2015-01-13T09:24:28Z","abstract_excerpt":"We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions. We give a call-by-name operational semantics for the calculus, and define adequate denotational semantics in the topos of trees. The adequacy proof entails that the evaluation of a program alw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02925","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-18T02:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+04FUaoQpARnW+YjuBwLN3oN8gQQ43OKsiiz/H53VCLvJ58v90dSi9p2BxSgV6CmDSVtOfOEy7uu3RWn3LfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:24:15.324355Z"},"content_sha256":"5cbe9ee26eab048d33c0420a9bf10f67e0061a87f45cc7029a9f717b5ca8fbe4","schema_version":"1.0","event_id":"sha256:5cbe9ee26eab048d33c0420a9bf10f67e0061a87f45cc7029a9f717b5ca8fbe4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/bundle.json","state_url":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/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-28T01:24:15Z","links":{"resolver":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM","bundle":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/bundle.json","state":"https://pith.science/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZBBYL5TXV3KZHED4UEPEFYPBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6ZBBYL5TXV3KZHED4UEPEFYPBM","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":"465c83bd25dcb4ea3e2ff5384c0eefab41e8e693a1012314025eda1a0d129216","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","title_canon_sha256":"bff14a4b31a66637d4553b9613ff7d9a2f4df78795c75cb4ecef09550f8c0764"},"schema_version":"1.0","source":{"id":"1501.02925","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02925","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02925v2","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02925","created_at":"2026-05-18T02:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"6ZBBYL5TXV3K","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6ZBBYL5TXV3KZHED","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6ZBBYL5T","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:5cbe9ee26eab048d33c0420a9bf10f67e0061a87f45cc7029a9f717b5ca8fbe4","target":"graph","created_at":"2026-05-18T02:29:22Z","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 present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive types may be transformed into coinductive types by a type-former inspired by modal logic and Atkey-McBride clock quantification, allowing the typing of acausal functions. We give a call-by-name operational semantics for the calculus, and define adequate denotational semantics in the topos of trees. The adequacy proof entails that the evaluation of a program alw","authors_text":"Ale\\v{s} Bizjak, Hans Bugge Grathwohl, Lars Birkedal, Ranald Clouston","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","title":"Programming and Reasoning with Guarded Recursion for Coinductive Types"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02925","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:5d3dcdfd3ac80bffdbae4603867d74dffdfd73568b04902244f7277b857abdb5","target":"record","created_at":"2026-05-18T02:29:22Z","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":"465c83bd25dcb4ea3e2ff5384c0eefab41e8e693a1012314025eda1a0d129216","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-13T09:24:28Z","title_canon_sha256":"bff14a4b31a66637d4553b9613ff7d9a2f4df78795c75cb4ecef09550f8c0764"},"schema_version":"1.0","source":{"id":"1501.02925","kind":"arxiv","version":2}},"canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6421c2fb3bd76ac9c83e508f2170f0b33e3cd26f8ecc75d3976d4900901533b","first_computed_at":"2026-05-18T02:29:22.925718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:22.925718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"haWvOjURk8eY2IXF+/bzKvi0FybbCFW4zbtu2TC/cFc0/2C3CmH3ht4un7kb2q0QfZ37dIcz2nKyWFod7wppDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:22.926223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02925","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d3dcdfd3ac80bffdbae4603867d74dffdfd73568b04902244f7277b857abdb5","sha256:5cbe9ee26eab048d33c0420a9bf10f67e0061a87f45cc7029a9f717b5ca8fbe4"],"state_sha256":"8a3d5a3766fa2a7c51ccebb947998f9f19762b6365e1054f3707191e9ee45c87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLqy5h1b2AS9fk3zIeTW5tGrBXfK4gEcwQrpRAcOWLSNKp0gk2dB61iLKUTZsNSPHYa7OHz7vf8tam7NevnMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:24:15.326269Z","bundle_sha256":"f49c81b32d62412797ad6d8fa7070c78126570d164a06581557b1bae409c98d2"}}