{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SS22NEKA3TLAAR7BZMRQX5YDOS","short_pith_number":"pith:SS22NEKA","schema_version":"1.0","canonical_sha256":"94b5a69140dcd60047e1cb230bf70374a89d1791e9e3fb35d37c67540bc18636","source":{"kind":"arxiv","id":"2309.08118","version":1},"attestation_state":"computed","paper":{"title":"Graph IRs for Impure Higher-Order Languages (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Guannan Wei, Oliver Bra\\v{c}evac, Songlin Jia, Supun Abeysinghe, Tiark Rompf, Yuxuan Jiang, Yuyan Bao","submitted_at":"2023-09-15T02:51:31Z","abstract_excerpt":"This is a companion report for the OOPSLA 2023 paper of the same title, presenting a detailed end-to-end account of the $\\lambda^*_{\\mathsf{G}}$ graph IR, at a level of detail beyond a regular conference paper. Our first concern is adequacy and soundness of $\\lambda^*_{\\mathsf{G}}$, which we derive from a direct-style imperative functional language (a variant of Bao et al.'s $\\lambda^*$-calculus with reachability types and a simple effect system) by a series of type-preserving translations into a calculus in monadic normalform (MNF). Static reachability types and effects entirely inform $\\lamb"},"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":"2309.08118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2023-09-15T02:51:31Z","cross_cats_sorted":[],"title_canon_sha256":"dcde627116900ffb342846eb99babfcedf1d008ccca4cd036a5301d51d16bb79","abstract_canon_sha256":"00a4208749cee9f033cb154e6658a01d5d8c66338bc10db49240fe74da4d9d72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:02.161851Z","signature_b64":"ASMK2L6W7wJJeKzLjWJA3Sx4gIOk/puVycoDOhOxdDmsiP9/7HbJlCqHNp9CMeClUurgTOw8CMXjjTFHQhhoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94b5a69140dcd60047e1cb230bf70374a89d1791e9e3fb35d37c67540bc18636","last_reissued_at":"2026-07-05T06:51:02.161357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:02.161357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph IRs for Impure Higher-Order Languages (Technical Report)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Guannan Wei, Oliver Bra\\v{c}evac, Songlin Jia, Supun Abeysinghe, Tiark Rompf, Yuxuan Jiang, Yuyan Bao","submitted_at":"2023-09-15T02:51:31Z","abstract_excerpt":"This is a companion report for the OOPSLA 2023 paper of the same title, presenting a detailed end-to-end account of the $\\lambda^*_{\\mathsf{G}}$ graph IR, at a level of detail beyond a regular conference paper. Our first concern is adequacy and soundness of $\\lambda^*_{\\mathsf{G}}$, which we derive from a direct-style imperative functional language (a variant of Bao et al.'s $\\lambda^*$-calculus with reachability types and a simple effect system) by a series of type-preserving translations into a calculus in monadic normalform (MNF). Static reachability types and effects entirely inform $\\lamb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08118","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/2309.08118/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":"2309.08118","created_at":"2026-07-05T06:51:02.161416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.08118v1","created_at":"2026-07-05T06:51:02.161416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08118","created_at":"2026-07-05T06:51:02.161416+00:00"},{"alias_kind":"pith_short_12","alias_value":"SS22NEKA3TLA","created_at":"2026-07-05T06:51:02.161416+00:00"},{"alias_kind":"pith_short_16","alias_value":"SS22NEKA3TLAAR7B","created_at":"2026-07-05T06:51:02.161416+00:00"},{"alias_kind":"pith_short_8","alias_value":"SS22NEKA","created_at":"2026-07-05T06:51:02.161416+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07609","citing_title":"What's in the Box: Ergonomic and Expressive Capture Tracking over Generic Data Structures (Extended Version)","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS","json":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS.json","graph_json":"https://pith.science/api/pith-number/SS22NEKA3TLAAR7BZMRQX5YDOS/graph.json","events_json":"https://pith.science/api/pith-number/SS22NEKA3TLAAR7BZMRQX5YDOS/events.json","paper":"https://pith.science/paper/SS22NEKA"},"agent_actions":{"view_html":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS","download_json":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS.json","view_paper":"https://pith.science/paper/SS22NEKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.08118&json=true","fetch_graph":"https://pith.science/api/pith-number/SS22NEKA3TLAAR7BZMRQX5YDOS/graph.json","fetch_events":"https://pith.science/api/pith-number/SS22NEKA3TLAAR7BZMRQX5YDOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS/action/storage_attestation","attest_author":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS/action/author_attestation","sign_citation":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS/action/citation_signature","submit_replication":"https://pith.science/pith/SS22NEKA3TLAAR7BZMRQX5YDOS/action/replication_record"}},"created_at":"2026-07-05T06:51:02.161416+00:00","updated_at":"2026-07-05T06:51:02.161416+00:00"}