{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","short_pith_number":"pith:3OY76YUA","schema_version":"1.0","canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","source":{"kind":"arxiv","id":"2605.12893","version":1},"attestation_state":"computed","paper":{"title":"LFPL: Revisited and Mechanized","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Jan Hoffmann, Nathaniel Glover","submitted_at":"2026-05-13T02:15:26Z","abstract_excerpt":"Hofmann (1999) introduced the functional programming language LFPL to characterize the functions computable in polynomial time using an affine type system. LFPL enables a natural programming style, including nested recursion, and has inspired the development of type systems for automatic cost analysis, linear dependent type theories, and efficient memory management in functional programming languages. Despite its prominence, there does not exist a self-contained presentation, let alone a full mechanization, of LFPL and its core metatheory. This article presents a modern account and mechanizati"},"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":"2605.12893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T02:15:26Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"2be6e8ea1795af81c09547361897d09d64a54cb95d548788083376b9a840bcfa","abstract_canon_sha256":"103c7e326333a6f6e410e4617a156637404dba6a235e55abd063c5b4379be214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:10.887054Z","signature_b64":"ygqZSK9uCAJDfHvnU48Rt95V43XG+OKOzHCY6j2Sq+vVkNW4dtZJj1FDPWMD39zcTdjfDtyHeHd9HwMVBCaAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","last_reissued_at":"2026-05-18T03:09:10.886282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:10.886282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LFPL: Revisited and Mechanized","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Jan Hoffmann, Nathaniel Glover","submitted_at":"2026-05-13T02:15:26Z","abstract_excerpt":"Hofmann (1999) introduced the functional programming language LFPL to characterize the functions computable in polynomial time using an affine type system. LFPL enables a natural programming style, including nested recursion, and has inspired the development of type systems for automatic cost analysis, linear dependent type theories, and efficient memory management in functional programming languages. Despite its prominence, there does not exist a self-contained presentation, let alone a full mechanization, of LFPL and its core metatheory. This article presents a modern account and mechanizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.12893","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":"2605.12893","created_at":"2026-05-18T03:09:10.886452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12893v1","created_at":"2026-05-18T03:09:10.886452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12893","created_at":"2026-05-18T03:09:10.886452+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OY76YUASQER","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OY76YUASQER7MRU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OY76YUA","created_at":"2026-05-18T12:33:37.589309+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/3OY76YUASQER7MRUDDGDJX3EKH","json":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH.json","graph_json":"https://pith.science/api/pith-number/3OY76YUASQER7MRUDDGDJX3EKH/graph.json","events_json":"https://pith.science/api/pith-number/3OY76YUASQER7MRUDDGDJX3EKH/events.json","paper":"https://pith.science/paper/3OY76YUA"},"agent_actions":{"view_html":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH","download_json":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH.json","view_paper":"https://pith.science/paper/3OY76YUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12893&json=true","fetch_graph":"https://pith.science/api/pith-number/3OY76YUASQER7MRUDDGDJX3EKH/graph.json","fetch_events":"https://pith.science/api/pith-number/3OY76YUASQER7MRUDDGDJX3EKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/action/storage_attestation","attest_author":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/action/author_attestation","sign_citation":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/action/citation_signature","submit_replication":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/action/replication_record"}},"created_at":"2026-05-18T03:09:10.886452+00:00","updated_at":"2026-05-18T03:09:10.886452+00:00"}