{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EQSYSBTW4KCZWEITKEEEFGQSXT","short_pith_number":"pith:EQSYSBTW","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"},"canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","source":{"kind":"arxiv","id":"2401.14957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14957","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14957v1","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14957","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQSYSBTW4KCZ","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQSYSBTW4KCZWEIT","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQSYSBTW","created_at":"2026-07-05T07:38:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EQSYSBTW4KCZWEITKEEEFGQSXT","target":"record","payload":{"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"},"canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","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"},"source_kind":"arxiv","source_id":"2401.14957","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-07-05T07:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEL5PqiQ3Ah0YvK1P+Y3eeA8WMW/o+gfq9KP8MltfRhTMmS2jpxhLJciFOYCjp/eNBGorEk2s9tmpL+ASIXMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:39:50.657389Z"},"content_sha256":"dc73982e51934082f4608bc4d0ff829e8a3d74964f8bb91285abe83dda1c7382","schema_version":"1.0","event_id":"sha256:dc73982e51934082f4608bc4d0ff829e8a3d74964f8bb91285abe83dda1c7382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EQSYSBTW4KCZWEITKEEEFGQSXT","target":"graph","payload":{"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"},"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-07-05T07:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BRaQ7tLVq2+Y0x2JYfpmqa8jJARPl3ygb13iEC7pqkyfDCYlNBOMfER3yXqbwisUw4cspMtAG08aPM4NN+6PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:39:50.657933Z"},"content_sha256":"e71e0f8d6f4b76b447169135ea15d1af80404f3c2ab913bd8c64aa070c3ffa3a","schema_version":"1.0","event_id":"sha256:e71e0f8d6f4b76b447169135ea15d1af80404f3c2ab913bd8c64aa070c3ffa3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/bundle.json","state_url":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/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-08-05T10:39:50Z","links":{"resolver":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT","bundle":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/bundle.json","state":"https://pith.science/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQSYSBTW4KCZWEITKEEEFGQSXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EQSYSBTW4KCZWEITKEEEFGQSXT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"12303515a9979fbbc36d9dddb8e38f90fa6b98304241a5a9a9a1f90bdfb38248","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-26T15:46:34Z","title_canon_sha256":"87e2c15a640efcd164f19b3b79dcb54117624aba69fd0876a3ba5c24ed35d90d"},"schema_version":"1.0","source":{"id":"2401.14957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14957","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14957v1","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14957","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"EQSYSBTW4KCZ","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQSYSBTW4KCZWEIT","created_at":"2026-07-05T07:38:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQSYSBTW","created_at":"2026-07-05T07:38:04Z"}],"graph_snapshots":[{"event_id":"sha256:e71e0f8d6f4b76b447169135ea15d1af80404f3c2ab913bd8c64aa070c3ffa3a","target":"graph","created_at":"2026-07-05T07:38:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.14957/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Bruce M. Kapron, Emmanuel Hainry, Jean-Yves Marion, Romain P\\'echoux","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-26T15:46:34Z","title":"Declassification Policy for Program Complexity Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14957","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:dc73982e51934082f4608bc4d0ff829e8a3d74964f8bb91285abe83dda1c7382","target":"record","created_at":"2026-07-05T07:38:04Z","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":"12303515a9979fbbc36d9dddb8e38f90fa6b98304241a5a9a9a1f90bdfb38248","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-01-26T15:46:34Z","title_canon_sha256":"87e2c15a640efcd164f19b3b79dcb54117624aba69fd0876a3ba5c24ed35d90d"},"schema_version":"1.0","source":{"id":"2401.14957","kind":"arxiv","version":1}},"canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2425890676e2859b11135108429a12bcf21cce48d76981b940e288618932063f","first_computed_at":"2026-07-05T07:38:04.485404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:04.485404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FLByrlO1Mtwfs6qI4ZCKS1oUETLXQWPO+Ox7fUNqcyu2Zr6JErvkS/uENUljYvzwZh4NACmxWsG1SmM3CNyVDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:04.485819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.14957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc73982e51934082f4608bc4d0ff829e8a3d74964f8bb91285abe83dda1c7382","sha256:e71e0f8d6f4b76b447169135ea15d1af80404f3c2ab913bd8c64aa070c3ffa3a"],"state_sha256":"3c0da3fc3dedb2cfe20b0d8247ce5cac1c30b0960dc0eb6f4e863b181df3b11e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HOfK/MWLC+9BFJIymGSbH7A7C6TKtMB5rrbq1lHqnDLsANCefsEDQT63NUyh5hUdeGIZCR3RqMZlvBkj92brAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:39:50.662655Z","bundle_sha256":"8cde4502c6c3e0a811bb11b3a1b6114bee9dcbd297b9292a0f618806755acead"}}