{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WUMLGLCYJRV4SCO4C3VPAHGYRB","short_pith_number":"pith:WUMLGLCY","schema_version":"1.0","canonical_sha256":"b518b32c584c6bc909dc16eaf01cd88853e10d5b5371a74a62affa4716989d76","source":{"kind":"arxiv","id":"2606.22908","version":1},"attestation_state":"computed","paper":{"title":"Cyclic Graphs and Memoization in Pure $\\lambda$-Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Bo Yang","submitted_at":"2026-06-22T06:46:37Z","abstract_excerpt":"$\\lambda$-calculus normally requires an added recursion construct, a \\texttt{letrec}, a $\\mu$-binder, or a built-in $Y$ for graph reduction, and sharing the repeated work of a memoized or dynamic-programming function normally requires an impure cache. We show that no extension is needed. We apply tabling, the standard method for solving a least-fixpoint equation, to weak-head reduction; this defines a new operational semantics for the pure $\\lambda$-calculus that keeps each term's standard lazy meaning. A term that reaches finitely many distinct states comes out as a finite graph, possibly cyc"},"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":"2606.22908","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-22T06:46:37Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"50293008ffa55ed844ed6db4c9dfa2e17288bbb0f29f2a7acdafe3703f7aa181","abstract_canon_sha256":"2f5e56f77a9850368024ac691dd689c68296255144502517c2083f9e6b4baea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:03.897102Z","signature_b64":"GNlmRRypl3OvMsd6Xlbw8YdECPE2iwIcVedqAhQVNLhlJrFn2xnCrDkXmt6JrLA+eJpDM5eKmVO7UZRhXUcaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b518b32c584c6bc909dc16eaf01cd88853e10d5b5371a74a62affa4716989d76","last_reissued_at":"2026-06-23T03:14:03.896733Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:03.896733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Graphs and Memoization in Pure $\\lambda$-Calculus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Bo Yang","submitted_at":"2026-06-22T06:46:37Z","abstract_excerpt":"$\\lambda$-calculus normally requires an added recursion construct, a \\texttt{letrec}, a $\\mu$-binder, or a built-in $Y$ for graph reduction, and sharing the repeated work of a memoized or dynamic-programming function normally requires an impure cache. We show that no extension is needed. We apply tabling, the standard method for solving a least-fixpoint equation, to weak-head reduction; this defines a new operational semantics for the pure $\\lambda$-calculus that keeps each term's standard lazy meaning. A term that reaches finitely many distinct states comes out as a finite graph, possibly cyc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22908","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/2606.22908/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":"2606.22908","created_at":"2026-06-23T03:14:03.896788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22908v1","created_at":"2026-06-23T03:14:03.896788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22908","created_at":"2026-06-23T03:14:03.896788+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUMLGLCYJRV4","created_at":"2026-06-23T03:14:03.896788+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUMLGLCYJRV4SCO4","created_at":"2026-06-23T03:14:03.896788+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUMLGLCY","created_at":"2026-06-23T03:14:03.896788+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/WUMLGLCYJRV4SCO4C3VPAHGYRB","json":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB.json","graph_json":"https://pith.science/api/pith-number/WUMLGLCYJRV4SCO4C3VPAHGYRB/graph.json","events_json":"https://pith.science/api/pith-number/WUMLGLCYJRV4SCO4C3VPAHGYRB/events.json","paper":"https://pith.science/paper/WUMLGLCY"},"agent_actions":{"view_html":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB","download_json":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB.json","view_paper":"https://pith.science/paper/WUMLGLCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22908&json=true","fetch_graph":"https://pith.science/api/pith-number/WUMLGLCYJRV4SCO4C3VPAHGYRB/graph.json","fetch_events":"https://pith.science/api/pith-number/WUMLGLCYJRV4SCO4C3VPAHGYRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB/action/storage_attestation","attest_author":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB/action/author_attestation","sign_citation":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB/action/citation_signature","submit_replication":"https://pith.science/pith/WUMLGLCYJRV4SCO4C3VPAHGYRB/action/replication_record"}},"created_at":"2026-06-23T03:14:03.896788+00:00","updated_at":"2026-06-23T03:14:03.896788+00:00"}