{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WSB7XP7QGCPQCVLQKOFPWF3DJ7","short_pith_number":"pith:WSB7XP7Q","schema_version":"1.0","canonical_sha256":"b483fbbff0309f015570538afb17634fd0b9fb04b4435571585a2f5d81c90229","source":{"kind":"arxiv","id":"2503.07328","version":3},"attestation_state":"computed","paper":{"title":"Complete the Cycle: Reachability Types with Expressive Cyclic References (Extended Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Haotian Deng, Siyuan He, Songlin Jia, Tiark Rompf, Yuyan Bao","submitted_at":"2025-03-10T13:42:02Z","abstract_excerpt":"Local reasoning about programs that combine aliasing and mutable state is a longstanding challenge. Existing approaches -- ownership systems, linear and affine types, uniqueness types, and lexical effect tracking -- impose global restrictions such as uniqueness or linearity, or rely on shallow syntactic analyses. These designs fall short with higher-order functions and shared mutable state. Reachability Types (RT) track aliasing and separation in higher-order programs, ensuring runtime safety and non-interference. However, RT systems face three key limitations: (1) they prohibit cyclic referen"},"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":"2503.07328","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.PL","submitted_at":"2025-03-10T13:42:02Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"153433a501c6b9e5661198ebd76e767f39752afd5318ce591f8b5a37a8dbd95b","abstract_canon_sha256":"a2ceff9c43d8b82164e1a2f520e17d60216544b7d502c568fb7498d17d025e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:44.576618Z","signature_b64":"9EHMi0M7xw6LLjb/LfbtzuTCbrU5JmGg/n41qT9s5dcwAd8QC9jur/Lt4xA2yCqWCR8tXYSZLUGIny833ElwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b483fbbff0309f015570538afb17634fd0b9fb04b4435571585a2f5d81c90229","last_reissued_at":"2026-07-05T12:01:44.576073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:44.576073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete the Cycle: Reachability Types with Expressive Cyclic References (Extended Version)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Haotian Deng, Siyuan He, Songlin Jia, Tiark Rompf, Yuyan Bao","submitted_at":"2025-03-10T13:42:02Z","abstract_excerpt":"Local reasoning about programs that combine aliasing and mutable state is a longstanding challenge. Existing approaches -- ownership systems, linear and affine types, uniqueness types, and lexical effect tracking -- impose global restrictions such as uniqueness or linearity, or rely on shallow syntactic analyses. These designs fall short with higher-order functions and shared mutable state. Reachability Types (RT) track aliasing and separation in higher-order programs, ensuring runtime safety and non-interference. However, RT systems face three key limitations: (1) they prohibit cyclic referen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07328","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/2503.07328/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":"2503.07328","created_at":"2026-07-05T12:01:44.576142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.07328v3","created_at":"2026-07-05T12:01:44.576142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07328","created_at":"2026-07-05T12:01:44.576142+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSB7XP7QGCPQ","created_at":"2026-07-05T12:01:44.576142+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSB7XP7QGCPQCVLQ","created_at":"2026-07-05T12:01:44.576142+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSB7XP7Q","created_at":"2026-07-05T12:01:44.576142+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/WSB7XP7QGCPQCVLQKOFPWF3DJ7","json":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7.json","graph_json":"https://pith.science/api/pith-number/WSB7XP7QGCPQCVLQKOFPWF3DJ7/graph.json","events_json":"https://pith.science/api/pith-number/WSB7XP7QGCPQCVLQKOFPWF3DJ7/events.json","paper":"https://pith.science/paper/WSB7XP7Q"},"agent_actions":{"view_html":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7","download_json":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7.json","view_paper":"https://pith.science/paper/WSB7XP7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.07328&json=true","fetch_graph":"https://pith.science/api/pith-number/WSB7XP7QGCPQCVLQKOFPWF3DJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/WSB7XP7QGCPQCVLQKOFPWF3DJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7/action/storage_attestation","attest_author":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7/action/author_attestation","sign_citation":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7/action/citation_signature","submit_replication":"https://pith.science/pith/WSB7XP7QGCPQCVLQKOFPWF3DJ7/action/replication_record"}},"created_at":"2026-07-05T12:01:44.576142+00:00","updated_at":"2026-07-05T12:01:44.576142+00:00"}