{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2U2E2RUPYONJFGLH57W2VOFU2U","short_pith_number":"pith:2U2E2RUP","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"},"canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","source":{"kind":"arxiv","id":"2606.01242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01242","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01242v1","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01242","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"2U2E2RUPYONJ","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"2U2E2RUPYONJFGLH","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"2U2E2RUP","created_at":"2026-06-02T02:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2U2E2RUPYONJFGLH57W2VOFU2U","target":"record","payload":{"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"},"canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","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"},"source_kind":"arxiv","source_id":"2606.01242","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-06-02T02:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAFa6hP068y2O5EnEkDHilpuTxaLHdE0EybshwOT9XF+Io6rnHEfYFE61jqVxP1b8KvvGC4zxp8+zj2bRbFEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:21:26.084107Z"},"content_sha256":"81084fddf6ae9614a9cf2f188f7ea5b84a8a12d9d9a8a324f9fa04791406d463","schema_version":"1.0","event_id":"sha256:81084fddf6ae9614a9cf2f188f7ea5b84a8a12d9d9a8a324f9fa04791406d463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2U2E2RUPYONJFGLH57W2VOFU2U","target":"graph","payload":{"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"},"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-06-02T02:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bq2J00VHLcFTfbumSnUw1ZJlvucdLEX2y1k9RrikQtYDfGYpPypwHWGYihiUakb22T59UC1TirZlVhwLv+pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T18:21:26.084537Z"},"content_sha256":"7fcf506bb33e1847f7cc2a967b2a86f38bd8f4ffa40a3e8f04b64984fde9eb9d","schema_version":"1.0","event_id":"sha256:7fcf506bb33e1847f7cc2a967b2a86f38bd8f4ffa40a3e8f04b64984fde9eb9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/bundle.json","state_url":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2U2E2RUPYONJFGLH57W2VOFU2U/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-06-30T18:21:26Z","links":{"resolver":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U","bundle":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/bundle.json","state":"https://pith.science/pith/2U2E2RUPYONJFGLH57W2VOFU2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2U2E2RUPYONJFGLH57W2VOFU2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2U2E2RUPYONJFGLH57W2VOFU2U","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":"4d28852d5bf0670032c00b0ea88293a9452003ce73e9509e6f774c42326801c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T13:49:41Z","title_canon_sha256":"c05f57974b3451d37ca722a359b4445fcfddc3eb713e47096f0619586ef690e9"},"schema_version":"1.0","source":{"id":"2606.01242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01242","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01242v1","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01242","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"2U2E2RUPYONJ","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"2U2E2RUPYONJFGLH","created_at":"2026-06-02T02:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"2U2E2RUP","created_at":"2026-06-02T02:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:7fcf506bb33e1847f7cc2a967b2a86f38bd8f4ffa40a3e8f04b64984fde9eb9d","target":"graph","created_at":"2026-06-02T02:04:27Z","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/2606.01242/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Fabian Egidy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T13:49:41Z","title":"Recursive Jump Operators and Optimal Proof Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01242","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:81084fddf6ae9614a9cf2f188f7ea5b84a8a12d9d9a8a324f9fa04791406d463","target":"record","created_at":"2026-06-02T02:04:27Z","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":"4d28852d5bf0670032c00b0ea88293a9452003ce73e9509e6f774c42326801c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-05-31T13:49:41Z","title_canon_sha256":"c05f57974b3451d37ca722a359b4445fcfddc3eb713e47096f0619586ef690e9"},"schema_version":"1.0","source":{"id":"2606.01242","kind":"arxiv","version":1}},"canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5344d468fc39a929967efedaab8b4d52e97b8971a84790b51f5343383f20889","first_computed_at":"2026-06-02T02:04:27.717063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:27.717063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"795kLPSfKIzlxgnVsn0BsrLEa+7qyqPHmPbgOrBHg6rBEGINdw7mMGPZ2sdOZfB2/xZ8JFDK+PX+z6czSjQPBg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:27.717496Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81084fddf6ae9614a9cf2f188f7ea5b84a8a12d9d9a8a324f9fa04791406d463","sha256:7fcf506bb33e1847f7cc2a967b2a86f38bd8f4ffa40a3e8f04b64984fde9eb9d"],"state_sha256":"f0361f522787a758533ed30e029ee9e5009a9b39845685211e27d31dc124e24c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mn4KWWAVmCNx4q8vhA3a6HrzBtEV83zF/SYp6xQ8LjhOBfGztxV4WoahysSy0ZCu1Mn16o6puVdyvCUEMEVnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T18:21:26.086630Z","bundle_sha256":"6bee56888118cc935ec8ac7b295bbdb1179b5a33ede9b7bc92d222dfc557dcd3"}}