{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RWWIXXOXOJGEM3EQX75NEKXMPJ","short_pith_number":"pith:RWWIXXOX","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"},"canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","source":{"kind":"arxiv","id":"2606.12631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12631","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12631v1","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12631","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_12","alias_value":"RWWIXXOXOJGE","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWWIXXOXOJGEM3EQ","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWWIXXOX","created_at":"2026-06-12T01:08:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RWWIXXOXOJGEM3EQX75NEKXMPJ","target":"record","payload":{"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"},"canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","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"},"source_kind":"arxiv","source_id":"2606.12631","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-12T01:08:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lyb+jT7qg6Dme6WftrvGukhrlHyTSMLbU2bzclJFgiLq6cZGxQCD+FbL7GqsbG2FsrGBqZArcZN1r1ay1CuaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:34:32.835913Z"},"content_sha256":"5298804b3522206a4ab5cefde452d4567f023e39e99af0787c83a663d3a5fbc5","schema_version":"1.0","event_id":"sha256:5298804b3522206a4ab5cefde452d4567f023e39e99af0787c83a663d3a5fbc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RWWIXXOXOJGEM3EQX75NEKXMPJ","target":"graph","payload":{"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"},"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-12T01:08:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21wliiH9lXSzqVg6lKdlHvBMeS99YXhlalM4uwzYZHFsCadD8dMKfFJztnz2KcaffiXOGk4Ep9hczQw+pkEbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:34:32.836292Z"},"content_sha256":"a607e3339eb919f8fee8363f47026a32f002defd540314ad9ca10b54610e2c1c","schema_version":"1.0","event_id":"sha256:a607e3339eb919f8fee8363f47026a32f002defd540314ad9ca10b54610e2c1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/bundle.json","state_url":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/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-23T10:34:32Z","links":{"resolver":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ","bundle":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/bundle.json","state":"https://pith.science/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWWIXXOXOJGEM3EQX75NEKXMPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RWWIXXOXOJGEM3EQX75NEKXMPJ","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":"b770d7b071baa5bd278af649c5aeb8f85a8b63c980205efaa5446c86f9eb5d7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-10T19:38:26Z","title_canon_sha256":"b5c0c8a6564d8a4ce06d42682d9ceef650ced8fa343e35ed2b579ad1bd943f61"},"schema_version":"1.0","source":{"id":"2606.12631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12631","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12631v1","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12631","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_12","alias_value":"RWWIXXOXOJGE","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWWIXXOXOJGEM3EQ","created_at":"2026-06-12T01:08:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWWIXXOX","created_at":"2026-06-12T01:08:41Z"}],"graph_snapshots":[{"event_id":"sha256:a607e3339eb919f8fee8363f47026a32f002defd540314ad9ca10b54610e2c1c","target":"graph","created_at":"2026-06-12T01:08:41Z","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.12631/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bruno Loff, Francesca Ugazio, Navid Talebanfard, Suhail Sherif","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-10T19:38:26Z","title":"The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12631","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:5298804b3522206a4ab5cefde452d4567f023e39e99af0787c83a663d3a5fbc5","target":"record","created_at":"2026-06-12T01:08:41Z","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":"b770d7b071baa5bd278af649c5aeb8f85a8b63c980205efaa5446c86f9eb5d7d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-10T19:38:26Z","title_canon_sha256":"b5c0c8a6564d8a4ce06d42682d9ceef650ced8fa343e35ed2b579ad1bd943f61"},"schema_version":"1.0","source":{"id":"2606.12631","kind":"arxiv","version":1}},"canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dac8bddd7724c466c90bffad22aec7a6d502df2b02183ccbe725519a2d37819","first_computed_at":"2026-06-12T01:08:41.590751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:08:41.590751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VLTZLdUazmTB4aoKrAeWajtbKJTXOwzPZs9YNQJIlOZjtoxKH/T7m5VrjCkDIo14vVIc1tFmqhs9qTDqW8srBw==","signature_status":"signed_v1","signed_at":"2026-06-12T01:08:41.591812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5298804b3522206a4ab5cefde452d4567f023e39e99af0787c83a663d3a5fbc5","sha256:a607e3339eb919f8fee8363f47026a32f002defd540314ad9ca10b54610e2c1c"],"state_sha256":"1f977f431dd9db84fa8886fa81050503bb1ce7573b5b474b13130db18b07ee54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DP/do7W/OSBy29MOTj+N8Pid+yzzi/JdWGoCaK9pmzoboKAf1Og1Yyl+imrbo2zoJZ57xqA84ZDhjfrD2aKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:34:32.838348Z","bundle_sha256":"8a47aba8a43e9f1f1644ad2f41671a39538dba336f38f1799e7a0cbec5d9375d"}}