{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:P2XVRSHCEMPOR3WCM5FQIIYLRV","short_pith_number":"pith:P2XVRSHC","canonical_record":{"source":{"id":"2102.01969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-03T09:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"bf9d8bd6befaef4f16cef0abb58d03e0b5d7e806eea0301dd71f0160ffc781fa","abstract_canon_sha256":"0c88f924bf6994c33cc56c1bdab041bdec22d963c2f6742d4eeec37e7c948d42"},"schema_version":"1.0"},"canonical_sha256":"7eaf58c8e2231ee8eec2674b04230b8d6903d5633fc0f1108818725bdd329b2a","source":{"kind":"arxiv","id":"2102.01969","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01969","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01969v3","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01969","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"P2XVRSHCEMPO","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_16","alias_value":"P2XVRSHCEMPOR3WC","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_8","alias_value":"P2XVRSHC","created_at":"2026-07-05T04:28:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:P2XVRSHCEMPOR3WCM5FQIIYLRV","target":"record","payload":{"canonical_record":{"source":{"id":"2102.01969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-03T09:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"bf9d8bd6befaef4f16cef0abb58d03e0b5d7e806eea0301dd71f0160ffc781fa","abstract_canon_sha256":"0c88f924bf6994c33cc56c1bdab041bdec22d963c2f6742d4eeec37e7c948d42"},"schema_version":"1.0"},"canonical_sha256":"7eaf58c8e2231ee8eec2674b04230b8d6903d5633fc0f1108818725bdd329b2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:39.956214Z","signature_b64":"Jb/6kTDhisxIARDXEYAE4XVP8WXD9VJA9uttUNJVj6V/62Qwtoe+gPLiOXLmCOAMVNCxtqA4e92qII8WvwctBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eaf58c8e2231ee8eec2674b04230b8d6903d5633fc0f1108818725bdd329b2a","last_reissued_at":"2026-07-05T04:28:39.955699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:39.955699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.01969","source_version":3,"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-07-05T04:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RIfI92gGlnxdc1AVw1AKZuerPtjWNZEGTwJS26fEAEMuikmYmNzFOzgp53rLwNB+rDuubA4lGFtjX6f3mYbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:56:38.971308Z"},"content_sha256":"0aa2a26aa8bc90f8ba2850f9b4fd68511bd6110e0c917b6f01fa9da01eb0910c","schema_version":"1.0","event_id":"sha256:0aa2a26aa8bc90f8ba2850f9b4fd68511bd6110e0c917b6f01fa9da01eb0910c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:P2XVRSHCEMPOR3WCM5FQIIYLRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrea Vezzosi, Magnus Baunsgaard Kristensen, Rasmus Ejlers M{\\o}gelberg","submitted_at":"2021-02-03T09:41:14Z","abstract_excerpt":"Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain equations also with negative occurrences. In its multi-clocked version, guarded recursion can also be used to program with and reason about coinductive types, encoding the productivity condition required for recursive definitions in types. This paper presents the first type theory combining multi-clocked guarded recursion with the features of Cubical Type Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01969","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01969/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AQv7rM8rsXtB8E4YTfK81dXLbHIe3bYG4iKjWIxmwedLqemUCRjmlkUtC3Yg2C+2WLuGucBnLYV4XhMzzm7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:56:38.971836Z"},"content_sha256":"d848759b17cf7404e90b548ca003ff014e36b2af846c91c4aef9ae1d1a770c20","schema_version":"1.0","event_id":"sha256:d848759b17cf7404e90b548ca003ff014e36b2af846c91c4aef9ae1d1a770c20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/bundle.json","state_url":"https://pith.science/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/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-08-05T10:56:38Z","links":{"resolver":"https://pith.science/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV","bundle":"https://pith.science/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/bundle.json","state":"https://pith.science/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P2XVRSHCEMPOR3WCM5FQIIYLRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:P2XVRSHCEMPOR3WCM5FQIIYLRV","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":"0c88f924bf6994c33cc56c1bdab041bdec22d963c2f6742d4eeec37e7c948d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-03T09:41:14Z","title_canon_sha256":"bf9d8bd6befaef4f16cef0abb58d03e0b5d7e806eea0301dd71f0160ffc781fa"},"schema_version":"1.0","source":{"id":"2102.01969","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01969","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01969v3","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01969","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"P2XVRSHCEMPO","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_16","alias_value":"P2XVRSHCEMPOR3WC","created_at":"2026-07-05T04:28:39Z"},{"alias_kind":"pith_short_8","alias_value":"P2XVRSHC","created_at":"2026-07-05T04:28:39Z"}],"graph_snapshots":[{"event_id":"sha256:d848759b17cf7404e90b548ca003ff014e36b2af846c91c4aef9ae1d1a770c20","target":"graph","created_at":"2026-07-05T04:28:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01969/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Guarded recursion is a powerful modal approach to recursion that can be seen as an abstract form of step-indexing. It is currently used extensively in separation logic to model programming languages with advanced features by solving domain equations also with negative occurrences. In its multi-clocked version, guarded recursion can also be used to program with and reason about coinductive types, encoding the productivity condition required for recursive definitions in types. This paper presents the first type theory combining multi-clocked guarded recursion with the features of Cubical Type Th","authors_text":"Andrea Vezzosi, Magnus Baunsgaard Kristensen, Rasmus Ejlers M{\\o}gelberg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-03T09:41:14Z","title":"Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01969","kind":"arxiv","version":3},"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:0aa2a26aa8bc90f8ba2850f9b4fd68511bd6110e0c917b6f01fa9da01eb0910c","target":"record","created_at":"2026-07-05T04:28:39Z","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":"0c88f924bf6994c33cc56c1bdab041bdec22d963c2f6742d4eeec37e7c948d42","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-03T09:41:14Z","title_canon_sha256":"bf9d8bd6befaef4f16cef0abb58d03e0b5d7e806eea0301dd71f0160ffc781fa"},"schema_version":"1.0","source":{"id":"2102.01969","kind":"arxiv","version":3}},"canonical_sha256":"7eaf58c8e2231ee8eec2674b04230b8d6903d5633fc0f1108818725bdd329b2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eaf58c8e2231ee8eec2674b04230b8d6903d5633fc0f1108818725bdd329b2a","first_computed_at":"2026-07-05T04:28:39.955699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:28:39.955699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jb/6kTDhisxIARDXEYAE4XVP8WXD9VJA9uttUNJVj6V/62Qwtoe+gPLiOXLmCOAMVNCxtqA4e92qII8WvwctBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:28:39.956214Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01969","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aa2a26aa8bc90f8ba2850f9b4fd68511bd6110e0c917b6f01fa9da01eb0910c","sha256:d848759b17cf7404e90b548ca003ff014e36b2af846c91c4aef9ae1d1a770c20"],"state_sha256":"db8b43206f68b084e6bf39dcf7f6db15ded42fb9407513d79c44509cdd40f02d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iT0XG6TEsEKYjqdJcayEgCuZyFbwZp5xAikIHqeQTQrBUBEWnhOhzatEMDUPN6KuFvVihz24JrXZsXhedfvTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:56:38.977337Z","bundle_sha256":"a9836fc8b03c00fdd93fb64510512e62dae472a0a3ec4efa9dde3526cbb3cd56"}}