{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2U2E2RUPYONJFGLH57W2VOFU2U","short_pith_number":"pith:2U2E2RUP","schema_version":"1.0","canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","source":{"kind":"arxiv","id":"2606.01242","version":1},"attestation_state":"computed","paper":{"title":"Recursive Jump Operators and Optimal Proof Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fabian Egidy","submitted_at":"2026-05-31T13:49:41Z","abstract_excerpt":"We study the relationship between the existence of optimal proof systems and recursive jump operators, two central open problems in proof complexity. For a set L, an optimal proof system is a strongest proof system in terms of proof length, whereas a recursive jump operator uniformly transforms any proof system for L into a stronger one with respect to proof length, thereby witnessing non-optimality. It is clear that the existence of a recursive jump operator for L rules out optimal proof systems for L. Khaniki (FOCS 2024) is interested in the converse of this implication and explicitly poses "},"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":"2606.01242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T13:49:41Z","cross_cats_sorted":[],"title_canon_sha256":"c05f57974b3451d37ca722a359b4445fcfddc3eb713e47096f0619586ef690e9","abstract_canon_sha256":"4d28852d5bf0670032c00b0ea88293a9452003ce73e9509e6f774c42326801c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:27.717496Z","signature_b64":"795kLPSfKIzlxgnVsn0BsrLEa+7qyqPHmPbgOrBHg6rBEGINdw7mMGPZ2sdOZfB2/xZ8JFDK+PX+z6czSjQPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","last_reissued_at":"2026-06-02T02:04:27.717063Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:27.717063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Jump Operators and Optimal Proof Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fabian Egidy","submitted_at":"2026-05-31T13:49:41Z","abstract_excerpt":"We study the relationship between the existence of optimal proof systems and recursive jump operators, two central open problems in proof complexity. For a set L, an optimal proof system is a strongest proof system in terms of proof length, whereas a recursive jump operator uniformly transforms any proof system for L into a stronger one with respect to proof length, thereby witnessing non-optimality. It is clear that the existence of a recursive jump operator for L rules out optimal proof systems for L. Khaniki (FOCS 2024) is interested in the converse of this implication and explicitly poses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01242","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/2606.01242/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":"2606.01242","created_at":"2026-06-02T02:04:27.717120+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01242v1","created_at":"2026-06-02T02:04:27.717120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01242","created_at":"2026-06-02T02:04:27.717120+00:00"},{"alias_kind":"pith_short_12","alias_value":"2U2E2RUPYONJ","created_at":"2026-06-02T02:04:27.717120+00:00"},{"alias_kind":"pith_short_16","alias_value":"2U2E2RUPYONJFGLH","created_at":"2026-06-02T02:04:27.717120+00:00"},{"alias_kind":"pith_short_8","alias_value":"2U2E2RUP","created_at":"2026-06-02T02:04:27.717120+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/2U2E2RUPYONJFGLH57W2VOFU2U","json":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U.json","graph_json":"https://pith.science/api/pith-number/2U2E2RUPYONJFGLH57W2VOFU2U/graph.json","events_json":"https://pith.science/api/pith-number/2U2E2RUPYONJFGLH57W2VOFU2U/events.json","paper":"https://pith.science/paper/2U2E2RUP"},"agent_actions":{"view_html":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U","download_json":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U.json","view_paper":"https://pith.science/paper/2U2E2RUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/2U2E2RUPYONJFGLH57W2VOFU2U/graph.json","fetch_events":"https://pith.science/api/pith-number/2U2E2RUPYONJFGLH57W2VOFU2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/action/storage_attestation","attest_author":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/action/author_attestation","sign_citation":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/action/citation_signature","submit_replication":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/action/replication_record"}},"created_at":"2026-06-02T02:04:27.717120+00:00","updated_at":"2026-06-02T02:04:27.717120+00:00"}