{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TEFLOFOMAGQIQJX6XDSMXIDCGL","short_pith_number":"pith:TEFLOFOM","schema_version":"1.0","canonical_sha256":"990ab715cc01a08826feb8e4cba06232cc97337e9479f772da234c00e4da726a","source":{"kind":"arxiv","id":"2311.09017","version":1},"attestation_state":"computed","paper":{"title":"Semidefinite programs simulate approximate message passing robustly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Misha Ivkov, Tselil Schramm","submitted_at":"2023-11-15T15:00:48Z","abstract_excerpt":"Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of AMP algorithms can be simulated in polynomial time by \\emph{local statistics hierarchy} semidefinite programs (SDPs), even when an unknown principal minor of measure $1/\\mathrm{polylog}(\\mathrm{dimension})$ is adversarially corrupted. Ours are the first robust guarantees for many of these problems. Further, our results offer an interesting counterpoint to st"},"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":"2311.09017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-15T15:00:48Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"9946c13e028e3bd7f462cac286971856bcc1d11e67fc748a1e3e6cadfad17383","abstract_canon_sha256":"a3f0732c1dce9edfa2032a41b2ae4285140ecb4e77a2550fad86ffa20af7f799"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:07.739932Z","signature_b64":"UXw7xEZTvmfnMIP3y4lqKYCrzjLYqYb6i67M8S3VT+HJqNethJI0iOhSbjx7vxq1F6kih/1MYx2SuIkA+bwzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"990ab715cc01a08826feb8e4cba06232cc97337e9479f772da234c00e4da726a","last_reissued_at":"2026-07-05T07:13:07.739405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:07.739405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semidefinite programs simulate approximate message passing robustly","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Misha Ivkov, Tselil Schramm","submitted_at":"2023-11-15T15:00:48Z","abstract_excerpt":"Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of AMP algorithms can be simulated in polynomial time by \\emph{local statistics hierarchy} semidefinite programs (SDPs), even when an unknown principal minor of measure $1/\\mathrm{polylog}(\\mathrm{dimension})$ is adversarially corrupted. Ours are the first robust guarantees for many of these problems. Further, our results offer an interesting counterpoint to st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09017","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/2311.09017/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":"2311.09017","created_at":"2026-07-05T07:13:07.739465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09017v1","created_at":"2026-07-05T07:13:07.739465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09017","created_at":"2026-07-05T07:13:07.739465+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEFLOFOMAGQI","created_at":"2026-07-05T07:13:07.739465+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEFLOFOMAGQIQJX6","created_at":"2026-07-05T07:13:07.739465+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEFLOFOM","created_at":"2026-07-05T07:13:07.739465+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.07929","citing_title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL","json":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL.json","graph_json":"https://pith.science/api/pith-number/TEFLOFOMAGQIQJX6XDSMXIDCGL/graph.json","events_json":"https://pith.science/api/pith-number/TEFLOFOMAGQIQJX6XDSMXIDCGL/events.json","paper":"https://pith.science/paper/TEFLOFOM"},"agent_actions":{"view_html":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL","download_json":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL.json","view_paper":"https://pith.science/paper/TEFLOFOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09017&json=true","fetch_graph":"https://pith.science/api/pith-number/TEFLOFOMAGQIQJX6XDSMXIDCGL/graph.json","fetch_events":"https://pith.science/api/pith-number/TEFLOFOMAGQIQJX6XDSMXIDCGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL/action/storage_attestation","attest_author":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL/action/author_attestation","sign_citation":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL/action/citation_signature","submit_replication":"https://pith.science/pith/TEFLOFOMAGQIQJX6XDSMXIDCGL/action/replication_record"}},"created_at":"2026-07-05T07:13:07.739465+00:00","updated_at":"2026-07-05T07:13:07.739465+00:00"}