{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:54SKFULZ3KJZJZTYL36LOM5P52","short_pith_number":"pith:54SKFULZ","schema_version":"1.0","canonical_sha256":"ef24a2d179da9394e6785efcb733afee88f71293738e69b29df79fc559ebd8f3","source":{"kind":"arxiv","id":"2102.11605","version":5},"attestation_state":"computed","paper":{"title":"A tier-based typed programming language characterizing Feasible Functionals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2021-02-23T10:35:31Z","abstract_excerpt":"The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF$_2$ based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the siz"},"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":"2102.11605","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-02-23T10:35:31Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"782f25c8e0e437189e220ca293a035c8f8a11f7d9eed03481c57dafae81ab114","abstract_canon_sha256":"46a03f037ac4212719e2ed9f75a853b8216f94554da5c42dfb3433e5e96151c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:32.461664Z","signature_b64":"I2JfhOKVPvmP67nrs3emfT7UVaW2bLpv/ZKrgCKwMUw2Ab9qxx+dTSWVUiTeXufoBXELyik8Z4CYnZEyMGfDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef24a2d179da9394e6785efcb733afee88f71293738e69b29df79fc559ebd8f3","last_reissued_at":"2026-07-05T06:23:32.461331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:32.461331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tier-based typed programming language characterizing Feasible Functionals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2021-02-23T10:35:31Z","abstract_excerpt":"The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a programming language with a type system guaranteeing this complexity bound. We give a characterization of BFF$_2$ based on an imperative language with oracle calls using a tier-based type system whose inference is decidable. Such a characterization should make it possible to link higher-order complexity with programming theory. The low complexity (cubic in the siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11605","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/2102.11605/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":"2102.11605","created_at":"2026-07-05T06:23:32.461384+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.11605v5","created_at":"2026-07-05T06:23:32.461384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11605","created_at":"2026-07-05T06:23:32.461384+00:00"},{"alias_kind":"pith_short_12","alias_value":"54SKFULZ3KJZ","created_at":"2026-07-05T06:23:32.461384+00:00"},{"alias_kind":"pith_short_16","alias_value":"54SKFULZ3KJZJZTY","created_at":"2026-07-05T06:23:32.461384+00:00"},{"alias_kind":"pith_short_8","alias_value":"54SKFULZ","created_at":"2026-07-05T06:23:32.461384+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/54SKFULZ3KJZJZTYL36LOM5P52","json":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52.json","graph_json":"https://pith.science/api/pith-number/54SKFULZ3KJZJZTYL36LOM5P52/graph.json","events_json":"https://pith.science/api/pith-number/54SKFULZ3KJZJZTYL36LOM5P52/events.json","paper":"https://pith.science/paper/54SKFULZ"},"agent_actions":{"view_html":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52","download_json":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52.json","view_paper":"https://pith.science/paper/54SKFULZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.11605&json=true","fetch_graph":"https://pith.science/api/pith-number/54SKFULZ3KJZJZTYL36LOM5P52/graph.json","fetch_events":"https://pith.science/api/pith-number/54SKFULZ3KJZJZTYL36LOM5P52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52/action/storage_attestation","attest_author":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52/action/author_attestation","sign_citation":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52/action/citation_signature","submit_replication":"https://pith.science/pith/54SKFULZ3KJZJZTYL36LOM5P52/action/replication_record"}},"created_at":"2026-07-05T06:23:32.461384+00:00","updated_at":"2026-07-05T06:23:32.461384+00:00"}