{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J2FNC5PXHU5I7QOWBVYW5OKGYC","short_pith_number":"pith:J2FNC5PX","schema_version":"1.0","canonical_sha256":"4e8ad175f73d3a8fc1d60d716eb946c0ac5d66cb490070f2a00cb3c796183f19","source":{"kind":"arxiv","id":"2208.14739","version":5},"attestation_state":"computed","paper":{"title":"Complete and tractable machine-independent characterizations of second-order polytime","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.PL"],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2022-08-31T09:39:46Z","abstract_excerpt":"The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of terms. These terms may perform calls to non-recursive imperative procedures. The type discipline has two layers: the terms follow a standard simply-typed discipline and the procedures follow a standard tier-based type discipline. BFF consists exactly of the second-order functionals that are computed by typable and terminating programs. The completeness of thi"},"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":"2208.14739","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-08-31T09:39:46Z","cross_cats_sorted":["cs.CC","cs.PL"],"title_canon_sha256":"83907b4261d2fd6dcd23e750f75960fceb8ee72ce692509effdd5cb3e8cfee57","abstract_canon_sha256":"fa514f3009c0aba2329e6e5256b499193c2d7f98d95b32d0e5fe2f0570f6fc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:26.709858Z","signature_b64":"Zx7229v4H8HXkJqPddONPUR/XyjnHR4f2jM6psa2n7lHXEdLW/9oAMFiAM0rEmWxMOHdruNLoZ0ypd/kAfBzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8ad175f73d3a8fc1d60d716eb946c0ac5d66cb490070f2a00cb3c796183f19","last_reissued_at":"2026-07-05T10:06:26.709390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:26.709390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete and tractable machine-independent characterizations of second-order polytime","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.PL"],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2022-08-31T09:39:46Z","abstract_excerpt":"The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of terms. These terms may perform calls to non-recursive imperative procedures. The type discipline has two layers: the terms follow a standard simply-typed discipline and the procedures follow a standard tier-based type discipline. BFF consists exactly of the second-order functionals that are computed by typable and terminating programs. The completeness of thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.14739","kind":"arxiv","version":5},"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/2208.14739/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":"2208.14739","created_at":"2026-07-05T10:06:26.709448+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.14739v5","created_at":"2026-07-05T10:06:26.709448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.14739","created_at":"2026-07-05T10:06:26.709448+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2FNC5PXHU5I","created_at":"2026-07-05T10:06:26.709448+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2FNC5PXHU5I7QOW","created_at":"2026-07-05T10:06:26.709448+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2FNC5PX","created_at":"2026-07-05T10:06:26.709448+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/J2FNC5PXHU5I7QOWBVYW5OKGYC","json":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC.json","graph_json":"https://pith.science/api/pith-number/J2FNC5PXHU5I7QOWBVYW5OKGYC/graph.json","events_json":"https://pith.science/api/pith-number/J2FNC5PXHU5I7QOWBVYW5OKGYC/events.json","paper":"https://pith.science/paper/J2FNC5PX"},"agent_actions":{"view_html":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC","download_json":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC.json","view_paper":"https://pith.science/paper/J2FNC5PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.14739&json=true","fetch_graph":"https://pith.science/api/pith-number/J2FNC5PXHU5I7QOWBVYW5OKGYC/graph.json","fetch_events":"https://pith.science/api/pith-number/J2FNC5PXHU5I7QOWBVYW5OKGYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC/action/storage_attestation","attest_author":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC/action/author_attestation","sign_citation":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC/action/citation_signature","submit_replication":"https://pith.science/pith/J2FNC5PXHU5I7QOWBVYW5OKGYC/action/replication_record"}},"created_at":"2026-07-05T10:06:26.709448+00:00","updated_at":"2026-07-05T10:06:26.709448+00:00"}