{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UGRDDC7HPBIJSZGOYEKZG6ZN27","short_pith_number":"pith:UGRDDC7H","schema_version":"1.0","canonical_sha256":"a1a2318be778509964cec115937b2dd7df837f6ee64bd5af6284d9e25567d7db","source":{"kind":"arxiv","id":"2005.14085","version":1},"attestation_state":"computed","paper":{"title":"Sound Regular Corecursion in coFJ","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Davide Ancona, Elena Zucca, Francesco Dagnino, Pietro Barbieri","submitted_at":"2020-05-28T15:27:44Z","abstract_excerpt":"The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite and methods are equipped with a codefinition (an alternative body). We provide an abstract semantics of the calculus based on the framework of inference systems with corules. In coFJ with this semantics, FJ recursive methods on finite objects can be extended to infinite objects as well, and behave as desired by the programmer, by specifying a codefinition. We"},"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":"2005.14085","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2020-05-28T15:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"6516aeecfe5fb0848113a287554b57c5044b7e5aefcedf0afd518febc277d1d1","abstract_canon_sha256":"7451c5b0dd0543e73c1b65da9cded782e26fc0051488e13d1d048c133ce0f145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:28.185542Z","signature_b64":"9IMQOBMh0Z6NprF3yDeEdcFdbE8d1tT/8PZztHBD1RUyb+6lVTSDDALH+MMooACzUavISktoYRrXPJzp9Rg3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1a2318be778509964cec115937b2dd7df837f6ee64bd5af6284d9e25567d7db","last_reissued_at":"2026-07-05T01:06:28.185091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:28.185091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sound Regular Corecursion in coFJ","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Davide Ancona, Elena Zucca, Francesco Dagnino, Pietro Barbieri","submitted_at":"2020-05-28T15:27:44Z","abstract_excerpt":"The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite and methods are equipped with a codefinition (an alternative body). We provide an abstract semantics of the calculus based on the framework of inference systems with corules. In coFJ with this semantics, FJ recursive methods on finite objects can be extended to infinite objects as well, and behave as desired by the programmer, by specifying a codefinition. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.14085","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.14085/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.14085","created_at":"2026-07-05T01:06:28.185155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.14085v1","created_at":"2026-07-05T01:06:28.185155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14085","created_at":"2026-07-05T01:06:28.185155+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGRDDC7HPBIJ","created_at":"2026-07-05T01:06:28.185155+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGRDDC7HPBIJSZGO","created_at":"2026-07-05T01:06:28.185155+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGRDDC7H","created_at":"2026-07-05T01:06:28.185155+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27285","citing_title":"Basis-Adaptive Sparse-State Simulation of Quantum Circuits","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27","json":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27.json","graph_json":"https://pith.science/api/pith-number/UGRDDC7HPBIJSZGOYEKZG6ZN27/graph.json","events_json":"https://pith.science/api/pith-number/UGRDDC7HPBIJSZGOYEKZG6ZN27/events.json","paper":"https://pith.science/paper/UGRDDC7H"},"agent_actions":{"view_html":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27","download_json":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27.json","view_paper":"https://pith.science/paper/UGRDDC7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.14085&json=true","fetch_graph":"https://pith.science/api/pith-number/UGRDDC7HPBIJSZGOYEKZG6ZN27/graph.json","fetch_events":"https://pith.science/api/pith-number/UGRDDC7HPBIJSZGOYEKZG6ZN27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27/action/storage_attestation","attest_author":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27/action/author_attestation","sign_citation":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27/action/citation_signature","submit_replication":"https://pith.science/pith/UGRDDC7HPBIJSZGOYEKZG6ZN27/action/replication_record"}},"created_at":"2026-07-05T01:06:28.185155+00:00","updated_at":"2026-07-05T01:06:28.185155+00:00"}