{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AOYVUJNQG5KJCANKN4EF4OFNCH","short_pith_number":"pith:AOYVUJNQ","schema_version":"1.0","canonical_sha256":"03b15a25b037549101aa6f085e38ad11c8f5e594ec46cf7984a683d3291686bb","source":{"kind":"arxiv","id":"2004.12063","version":2},"attestation_state":"computed","paper":{"title":"Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"primary_cat":"cs.CC","authors_text":"Alexander S. Wein, Aukosh Jagannath, David Gamarnik","submitted_at":"2020-04-25T05:45:59Z","abstract_excerpt":"We consider the problem of finding nearly optimal solutions of optimization problems with random objective functions. Two concrete problems we consider are (a) optimizing the Hamiltonian of a spherical or Ising $p$-spin glass model, and (b) finding a large independent set in a sparse Erd\\H{o}s-R\\'{e}nyi graph. The following families of algorithms are considered: (a) low-degree polynomials of the input; (b) low-depth Boolean circuits; (c) the Langevin dynamics algorithm. We show that these families of algorithms fail to produce nearly optimal solutions with high probability. For the case of Boo"},"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":"2004.12063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-04-25T05:45:59Z","cross_cats_sorted":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"title_canon_sha256":"db25e7f4d6223095f17cfc1e97396fc8fd00bc65e2ddeedc7bd6118f0f0e2a0c","abstract_canon_sha256":"a90572de27cfa6761626016a0b56015b60cbc9b508122d26e0ff6639b8672e95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:40.496360Z","signature_b64":"PNgF/cLLIE+xVqtD18fLZwyKfwjZ4LB/CBJrGKTilI76BH6CzNjRJA3MT+srDe8OylD664kl0cSMd5SKZsehAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b15a25b037549101aa6f085e38ad11c8f5e594ec46cf7984a683d3291686bb","last_reissued_at":"2026-07-05T03:51:40.495913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:40.495913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math-ph","math.MP","math.PR","stat.ML"],"primary_cat":"cs.CC","authors_text":"Alexander S. Wein, Aukosh Jagannath, David Gamarnik","submitted_at":"2020-04-25T05:45:59Z","abstract_excerpt":"We consider the problem of finding nearly optimal solutions of optimization problems with random objective functions. Two concrete problems we consider are (a) optimizing the Hamiltonian of a spherical or Ising $p$-spin glass model, and (b) finding a large independent set in a sparse Erd\\H{o}s-R\\'{e}nyi graph. The following families of algorithms are considered: (a) low-degree polynomials of the input; (b) low-depth Boolean circuits; (c) the Langevin dynamics algorithm. We show that these families of algorithms fail to produce nearly optimal solutions with high probability. For the case of Boo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12063","kind":"arxiv","version":2},"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/2004.12063/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":"2004.12063","created_at":"2026-07-05T03:51:40.495975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.12063v2","created_at":"2026-07-05T03:51:40.495975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12063","created_at":"2026-07-05T03:51:40.495975+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOYVUJNQG5KJ","created_at":"2026-07-05T03:51:40.495975+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOYVUJNQG5KJCANK","created_at":"2026-07-05T03:51:40.495975+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOYVUJNQ","created_at":"2026-07-05T03:51:40.495975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08160","citing_title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"2408.02360","citing_title":"Potential Hessian Ascent: The Sherrington-Kirkpatrick Model","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH","json":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH.json","graph_json":"https://pith.science/api/pith-number/AOYVUJNQG5KJCANKN4EF4OFNCH/graph.json","events_json":"https://pith.science/api/pith-number/AOYVUJNQG5KJCANKN4EF4OFNCH/events.json","paper":"https://pith.science/paper/AOYVUJNQ"},"agent_actions":{"view_html":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH","download_json":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH.json","view_paper":"https://pith.science/paper/AOYVUJNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.12063&json=true","fetch_graph":"https://pith.science/api/pith-number/AOYVUJNQG5KJCANKN4EF4OFNCH/graph.json","fetch_events":"https://pith.science/api/pith-number/AOYVUJNQG5KJCANKN4EF4OFNCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH/action/storage_attestation","attest_author":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH/action/author_attestation","sign_citation":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH/action/citation_signature","submit_replication":"https://pith.science/pith/AOYVUJNQG5KJCANKN4EF4OFNCH/action/replication_record"}},"created_at":"2026-07-05T03:51:40.495975+00:00","updated_at":"2026-07-05T03:51:40.495975+00:00"}