{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5GTAQQRKABXZ2K2HCEUZGWYHB4","short_pith_number":"pith:5GTAQQRK","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"},"canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","source":{"kind":"arxiv","id":"2606.00500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00500","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00500v1","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00500","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"5GTAQQRKABXZ","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"5GTAQQRKABXZ2K2H","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"5GTAQQRK","created_at":"2026-06-02T01:03:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5GTAQQRKABXZ2K2HCEUZGWYHB4","target":"record","payload":{"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"},"canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","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"},"source_kind":"arxiv","source_id":"2606.00500","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T01:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BbvnCu/YiLQwDIynilQHas7KTOJw6clRI4Y0ZvF/r6wXLPauy4+yUbZBYsJx7/UPVkJbQYf2aEZhxSFk4z+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:25:13.983014Z"},"content_sha256":"f305370d69e98c8631b5d8b4c913136ba3432eedb9945c2523156b1052b342d2","schema_version":"1.0","event_id":"sha256:f305370d69e98c8631b5d8b4c913136ba3432eedb9945c2523156b1052b342d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5GTAQQRKABXZ2K2HCEUZGWYHB4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T01:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebTGR/70iVRaq+xuU3Th2Qlgt+Fx/zZnWWgplswAkk3GGjFF+7EaMv2yOtvgtPzQOqR94RDJDs0YxrdSGvo8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:25:13.983808Z"},"content_sha256":"361207a72b4a012d7370a1df05f6734a58e6efe1a7f682db3a260243ffe9d996","schema_version":"1.0","event_id":"sha256:361207a72b4a012d7370a1df05f6734a58e6efe1a7f682db3a260243ffe9d996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/bundle.json","state_url":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T15:25:13Z","links":{"resolver":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4","bundle":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/bundle.json","state":"https://pith.science/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GTAQQRKABXZ2K2HCEUZGWYHB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5GTAQQRKABXZ2K2HCEUZGWYHB4","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":"406239a3c7a5a272a9ba9566ca61118756aa836baa1de168df6c72afa32e9ab4","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":"2026-05-30T03:18:52Z","title_canon_sha256":"e17d4b3fa709ec7f1352ff2bd94d201c3175c633fccfd7790d32bb935ce91c08"},"schema_version":"1.0","source":{"id":"2606.00500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00500","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00500v1","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00500","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"5GTAQQRKABXZ","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_16","alias_value":"5GTAQQRKABXZ2K2H","created_at":"2026-06-02T01:03:56Z"},{"alias_kind":"pith_short_8","alias_value":"5GTAQQRK","created_at":"2026-06-02T01:03:56Z"}],"graph_snapshots":[{"event_id":"sha256:361207a72b4a012d7370a1df05f6734a58e6efe1a7f682db3a260243ffe9d996","target":"graph","created_at":"2026-06-02T01:03:56Z","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/2606.00500/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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":"2026-05-30T03:18:52Z","title":"Easy, robust approximate message passing for planted spike models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00500","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:f305370d69e98c8631b5d8b4c913136ba3432eedb9945c2523156b1052b342d2","target":"record","created_at":"2026-06-02T01:03:56Z","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":"406239a3c7a5a272a9ba9566ca61118756aa836baa1de168df6c72afa32e9ab4","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":"2026-05-30T03:18:52Z","title_canon_sha256":"e17d4b3fa709ec7f1352ff2bd94d201c3175c633fccfd7790d32bb935ce91c08"},"schema_version":"1.0","source":{"id":"2606.00500","kind":"arxiv","version":1}},"canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9a608422a006f9d2b471129935b070f2cf8814f375ab2ccf4bce89dcf9f1a3b","first_computed_at":"2026-06-02T01:03:56.552107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:56.552107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3CwrBCtGhZx22fAgFoCdz7z3FxZj0WcAB3jqOfd9QGcskzDA5wFcLq85oTZk7cTVgLWgUXCwiFUlBiY/d5kBg==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:56.552515Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f305370d69e98c8631b5d8b4c913136ba3432eedb9945c2523156b1052b342d2","sha256:361207a72b4a012d7370a1df05f6734a58e6efe1a7f682db3a260243ffe9d996"],"state_sha256":"fff9236dd19384af0655e71c344c2d9e78e9f6a151af93865e526a18a9a70118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt68BbHSzfgQCpMFZK3aNMxzettNrY6nmymrkPgQqaWvMD6+ZAUtqLecMm5u+t9Gfmqd4BgcIYSaR7nQa+SVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:25:13.987244Z","bundle_sha256":"bb729356da88962b837d1f8e718c0f237914bb44f310ec4ef830d2a18f1f7b1c"}}