{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HCAHPXICWBWOVTBPMORTJXBOPW","short_pith_number":"pith:HCAHPXIC","schema_version":"1.0","canonical_sha256":"388077dd02b06ceacc2f63a334dc2e7db7bbf697719748083a8d133dd7d31576","source":{"kind":"arxiv","id":"1810.13261","version":1},"attestation_state":"computed","paper":{"title":"Bisimulation as path type for guarded recursive types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Niccol\\`o Veltri, Rasmus Ejlers M{\\o}gelberg","submitted_at":"2018-10-31T12:59:02Z","abstract_excerpt":"In type theory, coinductive types are used to represent processes, and are thus crucial for the formal verification of non-terminating reactive programs in proof assistants based on type theory, such as Coq and Agda. Currently, programming and reasoning about coinductive types is difficult for two reasons: The need for recursive definitions to be productive, and the lack of coincidence of the built-in identity types and the important notion of bisimilarity.\n  Guarded recursion in the sense of Nakano has recently been suggested as a possible approach to dealing with the problem of productivity,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.13261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-10-31T12:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"7bebf2ae3cbf3e46bd791180ef48f16cc7f5bbe5a4ddeb7ea322ebf652f18fcb","abstract_canon_sha256":"1e17da9afc51403ddcf627e3c28159007e923f476a3c4300e31c397d5a5ca5cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:49.859730Z","signature_b64":"2/Uwz6oS+yxVk/12Yo6qj0l2HO2qqk9bo2gcCJnR2fOuvovrQUXeRGbMuSfDaddnDGqYH4fn41hMqZEx5Bz5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"388077dd02b06ceacc2f63a334dc2e7db7bbf697719748083a8d133dd7d31576","last_reissued_at":"2026-05-18T00:01:49.859172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:49.859172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bisimulation as path type for guarded recursive types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Niccol\\`o Veltri, Rasmus Ejlers M{\\o}gelberg","submitted_at":"2018-10-31T12:59:02Z","abstract_excerpt":"In type theory, coinductive types are used to represent processes, and are thus crucial for the formal verification of non-terminating reactive programs in proof assistants based on type theory, such as Coq and Agda. Currently, programming and reasoning about coinductive types is difficult for two reasons: The need for recursive definitions to be productive, and the lack of coincidence of the built-in identity types and the important notion of bisimilarity.\n  Guarded recursion in the sense of Nakano has recently been suggested as a possible approach to dealing with the problem of productivity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13261","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.13261","created_at":"2026-05-18T00:01:49.859267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13261v1","created_at":"2026-05-18T00:01:49.859267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13261","created_at":"2026-05-18T00:01:49.859267+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCAHPXICWBWO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCAHPXICWBWOVTBP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCAHPXIC","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW","json":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW.json","graph_json":"https://pith.science/api/pith-number/HCAHPXICWBWOVTBPMORTJXBOPW/graph.json","events_json":"https://pith.science/api/pith-number/HCAHPXICWBWOVTBPMORTJXBOPW/events.json","paper":"https://pith.science/paper/HCAHPXIC"},"agent_actions":{"view_html":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW","download_json":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW.json","view_paper":"https://pith.science/paper/HCAHPXIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13261&json=true","fetch_graph":"https://pith.science/api/pith-number/HCAHPXICWBWOVTBPMORTJXBOPW/graph.json","fetch_events":"https://pith.science/api/pith-number/HCAHPXICWBWOVTBPMORTJXBOPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW/action/storage_attestation","attest_author":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW/action/author_attestation","sign_citation":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW/action/citation_signature","submit_replication":"https://pith.science/pith/HCAHPXICWBWOVTBPMORTJXBOPW/action/replication_record"}},"created_at":"2026-05-18T00:01:49.859267+00:00","updated_at":"2026-05-18T00:01:49.859267+00:00"}