{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RWWIXXOXOJGEM3EQX75NEKXMPJ","short_pith_number":"pith:RWWIXXOX","schema_version":"1.0","canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","source":{"kind":"arxiv","id":"2606.12631","version":1},"attestation_state":"computed","paper":{"title":"The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bruno Loff, Francesca Ugazio, Navid Talebanfard, Suhail Sherif","submitted_at":"2026-06-10T19:38:26Z","abstract_excerpt":"Razborov and Rudich (JCSS'97) observed that all known lower-bound proofs follow a certain pattern: when showing that a function $F$ is hard, along the way the proof provides us with a distinguisher, namely, an efficient algorithm which can distinguish easy functions from random functions. They called such lower-bound proofs natural proofs. They then showed a natural-proofs barrier: under standard cryptographic assumptions, natural proofs cannot show superpolynomial lower-bounds against Boolean circuits.\n  Along similar lines it can be shown that under a suitable cryptographic assumption, natur"},"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.12631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-10T19:38:26Z","cross_cats_sorted":[],"title_canon_sha256":"b5c0c8a6564d8a4ce06d42682d9ceef650ced8fa343e35ed2b579ad1bd943f61","abstract_canon_sha256":"b770d7b071baa5bd278af649c5aeb8f85a8b63c980205efaa5446c86f9eb5d7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:41.591812Z","signature_b64":"VLTZLdUazmTB4aoKrAeWajtbKJTXOwzPZs9YNQJIlOZjtoxKH/T7m5VrjCkDIo14vVIc1tFmqhs9qTDqW8srBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","last_reissued_at":"2026-06-12T01:08:41.590751Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:41.590751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bruno Loff, Francesca Ugazio, Navid Talebanfard, Suhail Sherif","submitted_at":"2026-06-10T19:38:26Z","abstract_excerpt":"Razborov and Rudich (JCSS'97) observed that all known lower-bound proofs follow a certain pattern: when showing that a function $F$ is hard, along the way the proof provides us with a distinguisher, namely, an efficient algorithm which can distinguish easy functions from random functions. They called such lower-bound proofs natural proofs. They then showed a natural-proofs barrier: under standard cryptographic assumptions, natural proofs cannot show superpolynomial lower-bounds against Boolean circuits.\n  Along similar lines it can be shown that under a suitable cryptographic assumption, natur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12631","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.12631/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.12631","created_at":"2026-06-12T01:08:41.590872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12631v1","created_at":"2026-06-12T01:08:41.590872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12631","created_at":"2026-06-12T01:08:41.590872+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWWIXXOXOJGE","created_at":"2026-06-12T01:08:41.590872+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWWIXXOXOJGEM3EQ","created_at":"2026-06-12T01:08:41.590872+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWWIXXOX","created_at":"2026-06-12T01:08:41.590872+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/RWWIXXOXOJGEM3EQX75NEKXMPJ","json":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ.json","graph_json":"https://pith.science/api/pith-number/RWWIXXOXOJGEM3EQX75NEKXMPJ/graph.json","events_json":"https://pith.science/api/pith-number/RWWIXXOXOJGEM3EQX75NEKXMPJ/events.json","paper":"https://pith.science/paper/RWWIXXOX"},"agent_actions":{"view_html":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ","download_json":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ.json","view_paper":"https://pith.science/paper/RWWIXXOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12631&json=true","fetch_graph":"https://pith.science/api/pith-number/RWWIXXOXOJGEM3EQX75NEKXMPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RWWIXXOXOJGEM3EQX75NEKXMPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/action/storage_attestation","attest_author":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/action/author_attestation","sign_citation":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/action/citation_signature","submit_replication":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/action/replication_record"}},"created_at":"2026-06-12T01:08:41.590872+00:00","updated_at":"2026-06-12T01:08:41.590872+00:00"}