{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:KJJATGUX54KEPUTMWXV5APRCFB","short_pith_number":"pith:KJJATGUX","canonical_record":{"source":{"id":"2311.04204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-07T18:43:27Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"53d4e0ab6b80d5f884eaf83de4e47c2c38a3c0f545754e5fc06340e7cf56c54b","abstract_canon_sha256":"ff4642feedfda313c1f923e368429149c63b22c29951a2aa41d1469ba505aa6b"},"schema_version":"1.0"},"canonical_sha256":"5252099a97ef1447d26cb5ebd03e22284475ec9e975723ede830c25487f0c7ab","source":{"kind":"arxiv","id":"2311.04204","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04204","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04204v3","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04204","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"KJJATGUX54KE","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_16","alias_value":"KJJATGUX54KEPUTM","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_8","alias_value":"KJJATGUX","created_at":"2026-07-05T08:44:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:KJJATGUX54KEPUTMWXV5APRCFB","target":"record","payload":{"canonical_record":{"source":{"id":"2311.04204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-07T18:43:27Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"53d4e0ab6b80d5f884eaf83de4e47c2c38a3c0f545754e5fc06340e7cf56c54b","abstract_canon_sha256":"ff4642feedfda313c1f923e368429149c63b22c29951a2aa41d1469ba505aa6b"},"schema_version":"1.0"},"canonical_sha256":"5252099a97ef1447d26cb5ebd03e22284475ec9e975723ede830c25487f0c7ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:34.628870Z","signature_b64":"hBxiQRDRAJIhg7L70ezic6hRiHy2IivxmS2817bnUE3/DE9jJ7MtO8BaqPG0HU2zxLnm8PM/UYjGhKL98nb3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5252099a97ef1447d26cb5ebd03e22284475ec9e975723ede830c25487f0c7ab","last_reissued_at":"2026-07-05T08:44:34.628418Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:34.628418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.04204","source_version":3,"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-07-05T08:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpZhGvpOH6hjP4Q2n3BfAk7q4uCla6k+8O2QjSUgP2bSUX0e6xhG1MpxHCMMGIKefCSoLA5xyRn7qv2WL4YODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:29:18.504341Z"},"content_sha256":"c97072cee95b8d4eb8f94625dd69fe580ce2eb6b30764e08b4f32a1a4c3a5287","schema_version":"1.0","event_id":"sha256:c97072cee95b8d4eb8f94625dd69fe580ce2eb6b30764e08b4f32a1a4c3a5287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:KJJATGUX54KEPUTMWXV5APRCFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"David Gamarnik, Elchanan Mossel, Ilias Zadik","submitted_at":"2023-11-07T18:43:27Z","abstract_excerpt":"We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \\emph{arbitrary} critical density cannot be computed by Boolean circuits of bounded depth and polynomial size. We also prove a partial converse: if a monotone graph invariant Boolean function does not have a sharp threshold then it can be computed on average by a Boolean circuit of bounded depth and polynomial size.\n  Our general result also implies new average-case bounded depth circuit lower bounds in a va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04204","kind":"arxiv","version":3},"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/2311.04204/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-07-05T08:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJQquXYIOul2IG+zFKoEk8D22wbCzC4Cy81dakOHANcKS3g0Uly7wlcNfnxvi9bVhQjR1ffP31R+gSuB2dUVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:29:18.505113Z"},"content_sha256":"69d041e40510a36c137f23e702ab39557e559743a361b2e7cac6217e86dc7078","schema_version":"1.0","event_id":"sha256:69d041e40510a36c137f23e702ab39557e559743a361b2e7cac6217e86dc7078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJJATGUX54KEPUTMWXV5APRCFB/bundle.json","state_url":"https://pith.science/pith/KJJATGUX54KEPUTMWXV5APRCFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJJATGUX54KEPUTMWXV5APRCFB/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-08-08T21:29:18Z","links":{"resolver":"https://pith.science/pith/KJJATGUX54KEPUTMWXV5APRCFB","bundle":"https://pith.science/pith/KJJATGUX54KEPUTMWXV5APRCFB/bundle.json","state":"https://pith.science/pith/KJJATGUX54KEPUTMWXV5APRCFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJJATGUX54KEPUTMWXV5APRCFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KJJATGUX54KEPUTMWXV5APRCFB","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":"ff4642feedfda313c1f923e368429149c63b22c29951a2aa41d1469ba505aa6b","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-07T18:43:27Z","title_canon_sha256":"53d4e0ab6b80d5f884eaf83de4e47c2c38a3c0f545754e5fc06340e7cf56c54b"},"schema_version":"1.0","source":{"id":"2311.04204","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04204","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04204v3","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04204","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"KJJATGUX54KE","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_16","alias_value":"KJJATGUX54KEPUTM","created_at":"2026-07-05T08:44:34Z"},{"alias_kind":"pith_short_8","alias_value":"KJJATGUX","created_at":"2026-07-05T08:44:34Z"}],"graph_snapshots":[{"event_id":"sha256:69d041e40510a36c137f23e702ab39557e559743a361b2e7cac6217e86dc7078","target":"graph","created_at":"2026-07-05T08:44:34Z","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/2311.04204/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \\emph{arbitrary} critical density cannot be computed by Boolean circuits of bounded depth and polynomial size. We also prove a partial converse: if a monotone graph invariant Boolean function does not have a sharp threshold then it can be computed on average by a Boolean circuit of bounded depth and polynomial size.\n  Our general result also implies new average-case bounded depth circuit lower bounds in a va","authors_text":"David Gamarnik, Elchanan Mossel, Ilias Zadik","cross_cats":["math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-07T18:43:27Z","title":"Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04204","kind":"arxiv","version":3},"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:c97072cee95b8d4eb8f94625dd69fe580ce2eb6b30764e08b4f32a1a4c3a5287","target":"record","created_at":"2026-07-05T08:44:34Z","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":"ff4642feedfda313c1f923e368429149c63b22c29951a2aa41d1469ba505aa6b","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-11-07T18:43:27Z","title_canon_sha256":"53d4e0ab6b80d5f884eaf83de4e47c2c38a3c0f545754e5fc06340e7cf56c54b"},"schema_version":"1.0","source":{"id":"2311.04204","kind":"arxiv","version":3}},"canonical_sha256":"5252099a97ef1447d26cb5ebd03e22284475ec9e975723ede830c25487f0c7ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5252099a97ef1447d26cb5ebd03e22284475ec9e975723ede830c25487f0c7ab","first_computed_at":"2026-07-05T08:44:34.628418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:34.628418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hBxiQRDRAJIhg7L70ezic6hRiHy2IivxmS2817bnUE3/DE9jJ7MtO8BaqPG0HU2zxLnm8PM/UYjGhKL98nb3BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:34.628870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.04204","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c97072cee95b8d4eb8f94625dd69fe580ce2eb6b30764e08b4f32a1a4c3a5287","sha256:69d041e40510a36c137f23e702ab39557e559743a361b2e7cac6217e86dc7078"],"state_sha256":"a223f63a647892af933ec3ee15012466178d0b5b3f06482b4c0d27444f0bb87b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqZz3VbGTxM9FW5yHxwnQssKLoDZOIbkvnTgKix0++HN44K7HiMNPE9LqyAx1KN62AvuatU2D4q34xM0O5/8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:29:18.510280Z","bundle_sha256":"c40edd90490c53764f5fe21a2310f5f6611f8d56ba79ad7a06f002418c95c8ae"}}