{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TEFLOFOMAGQIQJX6XDSMXIDCGL","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":"a3f0732c1dce9edfa2032a41b2ae4285140ecb4e77a2550fad86ffa20af7f799","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-15T15:00:48Z","title_canon_sha256":"9946c13e028e3bd7f462cac286971856bcc1d11e67fc748a1e3e6cadfad17383"},"schema_version":"1.0","source":{"id":"2311.09017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.09017","created_at":"2026-07-05T07:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"2311.09017v1","created_at":"2026-07-05T07:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09017","created_at":"2026-07-05T07:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"TEFLOFOMAGQI","created_at":"2026-07-05T07:13:07Z"},{"alias_kind":"pith_short_16","alias_value":"TEFLOFOMAGQIQJX6","created_at":"2026-07-05T07:13:07Z"},{"alias_kind":"pith_short_8","alias_value":"TEFLOFOM","created_at":"2026-07-05T07:13:07Z"}],"graph_snapshots":[{"event_id":"sha256:90b706e1a8a3e9df414768ee9870834e0d61a79acb9e890f0e162719aafdd89b","target":"graph","created_at":"2026-07-05T07:13:07Z","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.09017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Misha Ivkov, Tselil Schramm","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-15T15:00:48Z","title":"Semidefinite programs simulate approximate message passing robustly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09017","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:925bc0a84c6c97c072281cc75561bb04769f0abb918c5b025bb08cddd24d8129","target":"record","created_at":"2026-07-05T07:13:07Z","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":"a3f0732c1dce9edfa2032a41b2ae4285140ecb4e77a2550fad86ffa20af7f799","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-15T15:00:48Z","title_canon_sha256":"9946c13e028e3bd7f462cac286971856bcc1d11e67fc748a1e3e6cadfad17383"},"schema_version":"1.0","source":{"id":"2311.09017","kind":"arxiv","version":1}},"canonical_sha256":"990ab715cc01a08826feb8e4cba06232cc97337e9479f772da234c00e4da726a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"990ab715cc01a08826feb8e4cba06232cc97337e9479f772da234c00e4da726a","first_computed_at":"2026-07-05T07:13:07.739405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:13:07.739405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UXw7xEZTvmfnMIP3y4lqKYCrzjLYqYb6i67M8S3VT+HJqNethJI0iOhSbjx7vxq1F6kih/1MYx2SuIkA+bwzBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:13:07.739932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.09017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:925bc0a84c6c97c072281cc75561bb04769f0abb918c5b025bb08cddd24d8129","sha256:90b706e1a8a3e9df414768ee9870834e0d61a79acb9e890f0e162719aafdd89b"],"state_sha256":"49880e4f9837d2ec20b50d81baa8660e5d197eb6af77b0e79697ed10f1051f99"}