{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2UX3CTP5ZOOUJQ2OMLDFW54X3O","short_pith_number":"pith:2UX3CTP5","schema_version":"1.0","canonical_sha256":"d52fb14dfdcb9d44c34e62c65b7797dba3147da134b1a1d4f092405f4b520a12","source":{"kind":"arxiv","id":"2009.11481","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Thresholds in Mean Field Spin Glasses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cond-mat.stat-mech","authors_text":"Ahmed El Alaoui, Andrea Montanari","submitted_at":"2020-09-24T04:22:42Z","abstract_excerpt":"Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in polynomial time in the worst case. On the other hand, when the objective function is random, worst case approximation ratios are overly pessimistic. Mean field spin glasses are canonical families of random energy functions over the discrete hypercube $\\{-1,+1\\}^N$. The near-optima of these energy landscapes are organized according to an ultrametric tree-like stru"},"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":"2009.11481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2020-09-24T04:22:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"156f9c285729e936ae607d2ffeafbe75ea64ef0ade8db7f3a18907b71bb86304","abstract_canon_sha256":"b020350a87e3dbbdbf06f28689c8e41ccbc319c1630d44202aab7a895aaf824f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:46.217808Z","signature_b64":"4I7vHfd59amsHZEw3oTlytkQ8lflCXrRN3FR+J7RvHMLb+mtmcJHV/DifZAs1pbNwhqtUhKzXfrY2edIDrWbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d52fb14dfdcb9d44c34e62c65b7797dba3147da134b1a1d4f092405f4b520a12","last_reissued_at":"2026-07-05T01:37:46.217332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:46.217332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Thresholds in Mean Field Spin Glasses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cond-mat.stat-mech","authors_text":"Ahmed El Alaoui, Andrea Montanari","submitted_at":"2020-09-24T04:22:42Z","abstract_excerpt":"Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in polynomial time in the worst case. On the other hand, when the objective function is random, worst case approximation ratios are overly pessimistic. Mean field spin glasses are canonical families of random energy functions over the discrete hypercube $\\{-1,+1\\}^N$. The near-optima of these energy landscapes are organized according to an ultrametric tree-like stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11481","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/2009.11481/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":"2009.11481","created_at":"2026-07-05T01:37:46.217395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.11481v1","created_at":"2026-07-05T01:37:46.217395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11481","created_at":"2026-07-05T01:37:46.217395+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UX3CTP5ZOOU","created_at":"2026-07-05T01:37:46.217395+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UX3CTP5ZOOUJQ2O","created_at":"2026-07-05T01:37:46.217395+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UX3CTP5","created_at":"2026-07-05T01:37:46.217395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08708","citing_title":"Absence of quantum advantage for approximate spin glass optimization","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25501","citing_title":"An RDT based approach to large deviations of Wishart and Wigner matrices spectral edges","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2505.07929","citing_title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06309","citing_title":"DYNAMITE: A high-performance framework for solving Dynamical Mean-Field Equations","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O","json":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O.json","graph_json":"https://pith.science/api/pith-number/2UX3CTP5ZOOUJQ2OMLDFW54X3O/graph.json","events_json":"https://pith.science/api/pith-number/2UX3CTP5ZOOUJQ2OMLDFW54X3O/events.json","paper":"https://pith.science/paper/2UX3CTP5"},"agent_actions":{"view_html":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O","download_json":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O.json","view_paper":"https://pith.science/paper/2UX3CTP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.11481&json=true","fetch_graph":"https://pith.science/api/pith-number/2UX3CTP5ZOOUJQ2OMLDFW54X3O/graph.json","fetch_events":"https://pith.science/api/pith-number/2UX3CTP5ZOOUJQ2OMLDFW54X3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O/action/storage_attestation","attest_author":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O/action/author_attestation","sign_citation":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O/action/citation_signature","submit_replication":"https://pith.science/pith/2UX3CTP5ZOOUJQ2OMLDFW54X3O/action/replication_record"}},"created_at":"2026-07-05T01:37:46.217395+00:00","updated_at":"2026-07-05T01:37:46.217395+00:00"}