{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","short_pith_number":"pith:3OY76YUA","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"},"canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","source":{"kind":"arxiv","id":"2605.12893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12893","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12893v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12893","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"3OY76YUASQER","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3OY76YUASQER7MRU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3OY76YUA","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","target":"record","payload":{"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"},"canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","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"},"source_kind":"arxiv","source_id":"2605.12893","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2VxBN4aZOxh+Ow5p2nv2qOlp+w73W3y/Bgi3vYnN/gk7azPEFMYPYvFPimQKSShj7AElcHmqUsAN6k5ZzVNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:56:45.256541Z"},"content_sha256":"829e31110d6eb7b2eac77852ad722b770aebbc481461e798d96efa785218c608","schema_version":"1.0","event_id":"sha256:829e31110d6eb7b2eac77852ad722b770aebbc481461e798d96efa785218c608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOpjli3TsKvdf+c2PpFp9tpkjopK7BEYCM3HAunpO07IMPyduCE6NjuAjW0SDhYqN20E8HrnJwj+lu5DT6J3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:56:45.257028Z"},"content_sha256":"904e4e44402288ece2582f98122da4873f7894ff1fd577854562b8f2660c6b6c","schema_version":"1.0","event_id":"sha256:904e4e44402288ece2582f98122da4873f7894ff1fd577854562b8f2660c6b6c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/503272.503297.20) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"N. Glover and J. Hoffmann 29 19 Martin Hofmann. The strength of non-size increasing computation. InProceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’02, page 260–269. Association for Computin","arxiv_id":"2605.12893","detector":"doi_compliance","evidence":{"ref_index":8,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"N. Glover and J. Hoffmann 29 19 Martin Hofmann. The strength of non-size increasing computation. InProceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’02, page 260–269. Association for Computin","reconstructed_doi":"10.1145/503272.503297.20"},"severity":"advisory","ref_index":8,"audited_at":"2026-05-20T21:58:12.678457Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/503272.503297.20","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6ecf39830525caaf96621ddfcd3ab0dfa17b1a669bf1478264a28221c74ba945","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5474,"payload_sha256":"9e6bc426327a0df9f18567efb80732816658727a88fb8c50137b68105e32ae2e","signature_b64":"I7Cq2W5PG9I/7GZO9roHfs9t+V+c4u+fkB4dvcjAV9jVa+I2L++gK44iJr5KV3GkliDqG+MR4/al6gsE333bBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T21:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THLHP7jkD2Jjn6XtcF19gX8iqFcNERqWw2ff7f+wg+qzghx+0ru3U6OJQS2X8mfZTIl4gvsqIyq5/qWn0uvQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:56:45.258018Z"},"content_sha256":"ce8e5303cd3a2411fe1cda971dbc291f729e95d82db2c87bcad6f1ac0a317d6a","schema_version":"1.0","event_id":"sha256:ce8e5303cd3a2411fe1cda971dbc291f729e95d82db2c87bcad6f1ac0a317d6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/bundle.json","state_url":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OY76YUASQER7MRUDDGDJX3EKH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T17:56:45Z","links":{"resolver":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH","bundle":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/bundle.json","state":"https://pith.science/pith/3OY76YUASQER7MRUDDGDJX3EKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OY76YUASQER7MRUDDGDJX3EKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3OY76YUASQER7MRUDDGDJX3EKH","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"103c7e326333a6f6e410e4617a156637404dba6a235e55abd063c5b4379be214","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T02:15:26Z","title_canon_sha256":"2be6e8ea1795af81c09547361897d09d64a54cb95d548788083376b9a840bcfa"},"schema_version":"1.0","source":{"id":"2605.12893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12893","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12893v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12893","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"3OY76YUASQER","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3OY76YUASQER7MRU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3OY76YUA","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:904e4e44402288ece2582f98122da4873f7894ff1fd577854562b8f2660c6b6c","target":"graph","created_at":"2026-05-18T03:09:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jan Hoffmann, Nathaniel Glover","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T02:15:26Z","title":"LFPL: Revisited and Mechanized"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.12893","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:829e31110d6eb7b2eac77852ad722b770aebbc481461e798d96efa785218c608","target":"record","created_at":"2026-05-18T03:09:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"103c7e326333a6f6e410e4617a156637404dba6a235e55abd063c5b4379be214","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-05-13T02:15:26Z","title_canon_sha256":"2be6e8ea1795af81c09547361897d09d64a54cb95d548788083376b9a840bcfa"},"schema_version":"1.0","source":{"id":"2605.12893","kind":"arxiv","version":1}},"canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbb1ff628094091fb23418cc34df6451e8bd648c2213b0395a0dcd986a7121aa","first_computed_at":"2026-05-18T03:09:10.886282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:10.886282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygqZSK9uCAJDfHvnU48Rt95V43XG+OKOzHCY6j2Sq+vVkNW4dtZJj1FDPWMD39zcTdjfDtyHeHd9HwMVBCaAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:10.887054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:829e31110d6eb7b2eac77852ad722b770aebbc481461e798d96efa785218c608","sha256:904e4e44402288ece2582f98122da4873f7894ff1fd577854562b8f2660c6b6c","sha256:ce8e5303cd3a2411fe1cda971dbc291f729e95d82db2c87bcad6f1ac0a317d6a"],"state_sha256":"62adb53afe129f65afced476412015a49b1b4075aa9c66e0d3154e55bdfdb9a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qJ7n2CVTrcWh5Vbgxr7maZZVSLpoPHeLRGmhMNGgy5yiRrx915GCE88E7zOriayrAV2ZLLmoUDim56LvuJnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:56:45.260157Z","bundle_sha256":"359e94c79465a76ddfc5d7d0bb0eb0f377a5a31fd491f2529b7ee3790b47c2c2"}}