{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GNL5MXCVDZWCJMFBND55LOCGYF","short_pith_number":"pith:GNL5MXCV","schema_version":"1.0","canonical_sha256":"3357d65c551e6c24b0a168fbd5b846c17d0a826c7ea7e3520c31e2949b9e90e0","source":{"kind":"arxiv","id":"1201.3907","version":1},"attestation_state":"computed","paper":{"title":"The Call-by-need Lambda Calculus, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Matthias Felleisen, Stephen Chang","submitted_at":"2012-01-18T20:44:35Z","abstract_excerpt":"The existing call-by-need lambda calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivalent to another or to determine the value of a lazy program. However, neither of the existing calculi models evaluation in a way that matches lazy implementations.\n  Both calculi suffer from the same two problems. First, the calculi never discard function calls, even after they are completely resolved. Second, the calculi include re-association axioms even though these axioms are merely administrative steps with no"},"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":"1201.3907","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-01-18T20:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"07b75c7b114e8364ffcb0c8acca02794da09a2bff789902b7d8f046bf7ad6d3d","abstract_canon_sha256":"380982991b9f38a4a825b1dbb9ec007b240458beeac4007449ab84c67c1763c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:17.582537Z","signature_b64":"UjK3Emm4HjmLx/FUgQ1aodwGs6CSgk5VpfPdPpYIJZuirrtrd1jSMSxbZREqy6hvp/Y4VEF2PkIMWbYae+hIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3357d65c551e6c24b0a168fbd5b846c17d0a826c7ea7e3520c31e2949b9e90e0","last_reissued_at":"2026-05-18T04:04:17.581842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:17.581842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Call-by-need Lambda Calculus, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Matthias Felleisen, Stephen Chang","submitted_at":"2012-01-18T20:44:35Z","abstract_excerpt":"The existing call-by-need lambda calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivalent to another or to determine the value of a lazy program. However, neither of the existing calculi models evaluation in a way that matches lazy implementations.\n  Both calculi suffer from the same two problems. First, the calculi never discard function calls, even after they are completely resolved. Second, the calculi include re-association axioms even though these axioms are merely administrative steps with no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3907","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":"1201.3907","created_at":"2026-05-18T04:04:17.581951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3907v1","created_at":"2026-05-18T04:04:17.581951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3907","created_at":"2026-05-18T04:04:17.581951+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNL5MXCVDZWC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNL5MXCVDZWCJMFB","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNL5MXCV","created_at":"2026-05-18T12:27:06.952714+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/GNL5MXCVDZWCJMFBND55LOCGYF","json":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF.json","graph_json":"https://pith.science/api/pith-number/GNL5MXCVDZWCJMFBND55LOCGYF/graph.json","events_json":"https://pith.science/api/pith-number/GNL5MXCVDZWCJMFBND55LOCGYF/events.json","paper":"https://pith.science/paper/GNL5MXCV"},"agent_actions":{"view_html":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF","download_json":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF.json","view_paper":"https://pith.science/paper/GNL5MXCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3907&json=true","fetch_graph":"https://pith.science/api/pith-number/GNL5MXCVDZWCJMFBND55LOCGYF/graph.json","fetch_events":"https://pith.science/api/pith-number/GNL5MXCVDZWCJMFBND55LOCGYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF/action/storage_attestation","attest_author":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF/action/author_attestation","sign_citation":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF/action/citation_signature","submit_replication":"https://pith.science/pith/GNL5MXCVDZWCJMFBND55LOCGYF/action/replication_record"}},"created_at":"2026-05-18T04:04:17.581951+00:00","updated_at":"2026-05-18T04:04:17.581951+00:00"}