{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AGES4OYLTBFQ22ZJF4Q42TXU3M","short_pith_number":"pith:AGES4OYL","schema_version":"1.0","canonical_sha256":"01892e3b0b984b0d6b292f21cd4ef4db29b30cf850a9889d379c1b1469c68c7c","source":{"kind":"arxiv","id":"2606.27931","version":1},"attestation_state":"computed","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 "},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.27931","created_at":"2026-06-29T01:14:53.003099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27931v1","created_at":"2026-06-29T01:14:53.003099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27931","created_at":"2026-06-29T01:14:53.003099+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGES4OYLTBFQ","created_at":"2026-06-29T01:14:53.003099+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGES4OYLTBFQ22ZJ","created_at":"2026-06-29T01:14:53.003099+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGES4OYL","created_at":"2026-06-29T01:14:53.003099+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/AGES4OYLTBFQ22ZJF4Q42TXU3M","json":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M.json","graph_json":"https://pith.science/api/pith-number/AGES4OYLTBFQ22ZJF4Q42TXU3M/graph.json","events_json":"https://pith.science/api/pith-number/AGES4OYLTBFQ22ZJF4Q42TXU3M/events.json","paper":"https://pith.science/paper/AGES4OYL"},"agent_actions":{"view_html":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M","download_json":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M.json","view_paper":"https://pith.science/paper/AGES4OYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27931&json=true","fetch_graph":"https://pith.science/api/pith-number/AGES4OYLTBFQ22ZJF4Q42TXU3M/graph.json","fetch_events":"https://pith.science/api/pith-number/AGES4OYLTBFQ22ZJF4Q42TXU3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/action/storage_attestation","attest_author":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/action/author_attestation","sign_citation":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/action/citation_signature","submit_replication":"https://pith.science/pith/AGES4OYLTBFQ22ZJF4Q42TXU3M/action/replication_record"}},"created_at":"2026-06-29T01:14:53.003099+00:00","updated_at":"2026-06-29T01:14:53.003099+00:00"}