{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AGES4OYLTBFQ22ZJF4Q42TXU3M","short_pith_number":"pith:AGES4OYL","canonical_record":{"source":{"id":"2606.27931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-26T10:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"59320f25f093c8e3551345d063d45dd6d0337da1ba6534f19fd92a1c87bdfed3","abstract_canon_sha256":"72305cdd19339d684d5a47978c648aed28eafe7c417621e4e0ee24f218015484"},"schema_version":"1.0"},"canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","source":{"kind":"arxiv","id":"2606.27931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27931","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27931v1","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27931","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"AGES4OYLTBFQ","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_16","alias_value":"AGES4OYLTBFQ22ZJ","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_8","alias_value":"AGES4OYL","created_at":"2026-06-29T01:14:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AGES4OYLTBFQ22ZJF4Q42TXU3M","target":"record","payload":{"canonical_record":{"source":{"id":"2606.27931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-26T10:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"59320f25f093c8e3551345d063d45dd6d0337da1ba6534f19fd92a1c87bdfed3","abstract_canon_sha256":"72305cdd19339d684d5a47978c648aed28eafe7c417621e4e0ee24f218015484"},"schema_version":"1.0"},"canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:53.003426Z","signature_b64":"rW9j8w+KmbdwE3zp9jy1GpwFY4XpYEfFBvw+qCfTB/oXGUuhji94DbMdgXi7QBvNT1m9dx+tCrF8FRfjeEEvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","last_reissued_at":"2026-06-29T01:14:53.003038Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:53.003038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.27931","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-29T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OczBuWz0C1I4R5ijEY9A4NPD/REFvnwyd62qJrZFktkcAQVaAkg6OQ7QSb3JJMEzT7CAk4cECm/fEeQUrdxjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:57:27.789137Z"},"content_sha256":"cda2905e1bd9dd492e12b35137acb46f9ceebaf017c5eb4d18ca86db188b434b","schema_version":"1.0","event_id":"sha256:cda2905e1bd9dd492e12b35137acb46f9ceebaf017c5eb4d18ca86db188b434b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AGES4OYLTBFQ22ZJF4Q42TXU3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Reductions in TFNP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Noah Fleming, Robert Robere, Stefan Grosser, Toniann Pitassi","submitted_at":"2026-06-26T10:22:44Z","abstract_excerpt":"We introduce a new family of propositional proof systems, denoted <EF, R>, for an arbitrary TFNP search problem $R$. Informally, a refutation of a CNF formula $F$ in <EF, R> is given by a polynomial-time reduction from the false-clause search problem $Search_F$ to $R$, combined with an Extended Frege proof that the reduction is correct. These are motivated in two ways:\n  1. They are the propositional translations of witnessing theorems in bounded arithmetic, by which proofs of $\\forall \\Sigma^b_1$ formulas $\\phi$ in a theory $T$ imply algorithms solving the search problem for $\\phi$ in a TFNP "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27931","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.27931/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-29T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wyDabbcxUoZ5tvk1JvNMLsONEKdlc0QwhQyhxXonjuMdxXEbVW2AEtEPHhTAUHRkBaTxG94Fh+D6NiAotCJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:57:27.789519Z"},"content_sha256":"a692817f9584419134158ae71872142b1f5424f18d4591beae0dbd53758aa567","schema_version":"1.0","event_id":"sha256:a692817f9584419134158ae71872142b1f5424f18d4591beae0dbd53758aa567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/bundle.json","state_url":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/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-29T11:57:27Z","links":{"resolver":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M","bundle":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/bundle.json","state":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AGES4OYLTBFQ22ZJF4Q42TXU3M","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":"72305cdd19339d684d5a47978c648aed28eafe7c417621e4e0ee24f218015484","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-26T10:22:44Z","title_canon_sha256":"59320f25f093c8e3551345d063d45dd6d0337da1ba6534f19fd92a1c87bdfed3"},"schema_version":"1.0","source":{"id":"2606.27931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27931","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27931v1","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27931","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"AGES4OYLTBFQ","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_16","alias_value":"AGES4OYLTBFQ22ZJ","created_at":"2026-06-29T01:14:53Z"},{"alias_kind":"pith_short_8","alias_value":"AGES4OYL","created_at":"2026-06-29T01:14:53Z"}],"graph_snapshots":[{"event_id":"sha256:a692817f9584419134158ae71872142b1f5424f18d4591beae0dbd53758aa567","target":"graph","created_at":"2026-06-29T01:14:53Z","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.27931/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new family of propositional proof systems, denoted <EF, R>, for an arbitrary TFNP search problem $R$. Informally, a refutation of a CNF formula $F$ in <EF, R> is given by a polynomial-time reduction from the false-clause search problem $Search_F$ to $R$, combined with an Extended Frege proof that the reduction is correct. These are motivated in two ways:\n  1. They are the propositional translations of witnessing theorems in bounded arithmetic, by which proofs of $\\forall \\Sigma^b_1$ formulas $\\phi$ in a theory $T$ imply algorithms solving the search problem for $\\phi$ in a TFNP ","authors_text":"Noah Fleming, Robert Robere, Stefan Grosser, Toniann Pitassi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-26T10:22:44Z","title":"Provable Reductions in TFNP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27931","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:cda2905e1bd9dd492e12b35137acb46f9ceebaf017c5eb4d18ca86db188b434b","target":"record","created_at":"2026-06-29T01:14:53Z","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":"72305cdd19339d684d5a47978c648aed28eafe7c417621e4e0ee24f218015484","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-26T10:22:44Z","title_canon_sha256":"59320f25f093c8e3551345d063d45dd6d0337da1ba6534f19fd92a1c87bdfed3"},"schema_version":"1.0","source":{"id":"2606.27931","kind":"arxiv","version":1}},"canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","first_computed_at":"2026-06-29T01:14:53.003038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:14:53.003038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rW9j8w+KmbdwE3zp9jy1GpwFY4XpYEfFBvw+qCfTB/oXGUuhji94DbMdgXi7QBvNT1m9dx+tCrF8FRfjeEEvDw==","signature_status":"signed_v1","signed_at":"2026-06-29T01:14:53.003426Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.27931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda2905e1bd9dd492e12b35137acb46f9ceebaf017c5eb4d18ca86db188b434b","sha256:a692817f9584419134158ae71872142b1f5424f18d4591beae0dbd53758aa567"],"state_sha256":"498f6c9fbfcb1f279572482579de510398b5fb51e7accada578239e180f145f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwp4b9LpGf2wIMyiiSkSO39kdu1eiwW3HYTPa/Ah8OCB4kAnjUg+G1ZMVK2/YOkSUZ+zADhZRNGFDF80VdfHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:57:27.791444Z","bundle_sha256":"9250722e71924293f82e9162de5ca6a01029bee24dc01e50c00d8e05416ffd5b"}}