{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EQSYSBTW4KCZWEITKEEEFGQSXT","short_pith_number":"pith:EQSYSBTW","schema_version":"1.0","canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","source":{"kind":"arxiv","id":"2401.14957","version":1},"attestation_state":"computed","paper":{"title":"Declassification Policy for Program Complexity Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2024-01-26T15:46:34Z","abstract_excerpt":"In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial time. These characterizations are also extensionally complete -- they capture all functions -- but are not intensionally complete as some polytime algorithms are rejected. This impact on expressive power is an unavoidable cost of achieving a tractable characterization. To overcome this issue, an avenue arising from security applications is to find a "},"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":"2401.14957","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-26T15:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"87e2c15a640efcd164f19b3b79dcb54117624aba69fd0876a3ba5c24ed35d90d","abstract_canon_sha256":"12303515a9979fbbc36d9dddb8e38f90fa6b98304241a5a9a9a1f90bdfb38248"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:04.485819Z","signature_b64":"FLByrlO1Mtwfs6qI4ZCKS1oUETLXQWPO+Ox7fUNqcyu2Zr6JErvkS/uENUljYvzwZh4NACmxWsG1SmM3CNyVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","last_reissued_at":"2026-07-05T07:38:04.485404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:04.485404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Declassification Policy for Program Complexity Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","submitted_at":"2024-01-26T15:46:34Z","abstract_excerpt":"In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in polynomial time. These characterizations are also extensionally complete -- they capture all functions -- but are not intensionally complete as some polytime algorithms are rejected. This impact on expressive power is an unavoidable cost of achieving a tractable characterization. To overcome this issue, an avenue arising from security applications is to find a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14957","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.14957/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":"2401.14957","created_at":"2026-07-05T07:38:04.485461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14957v1","created_at":"2026-07-05T07:38:04.485461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14957","created_at":"2026-07-05T07:38:04.485461+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQSYSBTW4KCZ","created_at":"2026-07-05T07:38:04.485461+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQSYSBTW4KCZWEIT","created_at":"2026-07-05T07:38:04.485461+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQSYSBTW","created_at":"2026-07-05T07:38:04.485461+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/EQSYSBTW4KCZWEITKEEEFGQSXT","json":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT.json","graph_json":"https://pith.science/api/pith-number/EQSYSBTW4KCZWEITKEEEFGQSXT/graph.json","events_json":"https://pith.science/api/pith-number/EQSYSBTW4KCZWEITKEEEFGQSXT/events.json","paper":"https://pith.science/paper/EQSYSBTW"},"agent_actions":{"view_html":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT","download_json":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT.json","view_paper":"https://pith.science/paper/EQSYSBTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14957&json=true","fetch_graph":"https://pith.science/api/pith-number/EQSYSBTW4KCZWEITKEEEFGQSXT/graph.json","fetch_events":"https://pith.science/api/pith-number/EQSYSBTW4KCZWEITKEEEFGQSXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/action/storage_attestation","attest_author":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/action/author_attestation","sign_citation":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/action/citation_signature","submit_replication":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/action/replication_record"}},"created_at":"2026-07-05T07:38:04.485461+00:00","updated_at":"2026-07-05T07:38:04.485461+00:00"}