{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5GTAQQRKABXZ2K2HCEUZGWYHB4","short_pith_number":"pith:5GTAQQRK","schema_version":"1.0","canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","source":{"kind":"arxiv","id":"2606.00500","version":1},"attestation_state":"computed","paper":{"title":"Easy, robust approximate message passing for planted spike models","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":"2026-05-30T03:18:52Z","abstract_excerpt":"We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting. In particular, let $\\varepsilon$ be a sufficiently small constant, and suppose that $X \\in \\mathbb R^{n \\times n}$ is a Gaussian matrix with a planted rank-$1$ spike, and $E \\in \\mathbb R^{n \\times n}$ is an adversarially chosen matrix supported on an $\\varepsilon n \\times \\varepsilon n$ principal minor. Let $v_{\\mathrm{AMP}}(X)$ be the output of an AMP iteration on the uncorrupted matrix $X$. We give a procedure that, given access only to the corrupted matrix $Y = X + E$, com"},"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":"2606.00500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-30T03:18:52Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"e17d4b3fa709ec7f1352ff2bd94d201c3175c633fccfd7790d32bb935ce91c08","abstract_canon_sha256":"406239a3c7a5a272a9ba9566ca61118756aa836baa1de168df6c72afa32e9ab4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:56.552515Z","signature_b64":"U3CwrBCtGhZx22fAgFoCdz7z3FxZj0WcAB3jqOfd9QGcskzDA5wFcLq85oTZk7cTVgLWgUXCwiFUlBiY/d5kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","last_reissued_at":"2026-06-02T01:03:56.552107Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:56.552107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Easy, robust approximate message passing for planted spike models","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":"2026-05-30T03:18:52Z","abstract_excerpt":"We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting. In particular, let $\\varepsilon$ be a sufficiently small constant, and suppose that $X \\in \\mathbb R^{n \\times n}$ is a Gaussian matrix with a planted rank-$1$ spike, and $E \\in \\mathbb R^{n \\times n}$ is an adversarially chosen matrix supported on an $\\varepsilon n \\times \\varepsilon n$ principal minor. Let $v_{\\mathrm{AMP}}(X)$ be the output of an AMP iteration on the uncorrupted matrix $X$. We give a procedure that, given access only to the corrupted matrix $Y = X + E$, com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00500","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/2606.00500/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":"2606.00500","created_at":"2026-06-02T01:03:56.552165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00500v1","created_at":"2026-06-02T01:03:56.552165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00500","created_at":"2026-06-02T01:03:56.552165+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GTAQQRKABXZ","created_at":"2026-06-02T01:03:56.552165+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GTAQQRKABXZ2K2H","created_at":"2026-06-02T01:03:56.552165+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GTAQQRK","created_at":"2026-06-02T01:03:56.552165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4","json":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4.json","graph_json":"https://pith.science/api/pith-number/5GTAQQRKABXZ2K2HCEUZGWYHB4/graph.json","events_json":"https://pith.science/api/pith-number/5GTAQQRKABXZ2K2HCEUZGWYHB4/events.json","paper":"https://pith.science/paper/5GTAQQRK"},"agent_actions":{"view_html":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4","download_json":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4.json","view_paper":"https://pith.science/paper/5GTAQQRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00500&json=true","fetch_graph":"https://pith.science/api/pith-number/5GTAQQRKABXZ2K2HCEUZGWYHB4/graph.json","fetch_events":"https://pith.science/api/pith-number/5GTAQQRKABXZ2K2HCEUZGWYHB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/action/storage_attestation","attest_author":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/action/author_attestation","sign_citation":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/action/citation_signature","submit_replication":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/action/replication_record"}},"created_at":"2026-06-02T01:03:56.552165+00:00","updated_at":"2026-06-02T01:03:56.552165+00:00"}