{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WHBH7ABB4UHLKCHC3G6GDABEX7","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":"35ceb76d60a7d9d672d29125a07897565ecbbbaea86157194674d31b7df15c88","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-30T18:59:46Z","title_canon_sha256":"7c2473d7482e65b9734a92f13779ddc709fd2d9a09d59dffa43f1e34b6df263f"},"schema_version":"1.0","source":{"id":"2412.21203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.21203","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"2412.21203v1","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.21203","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"WHBH7ABB4UHL","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_16","alias_value":"WHBH7ABB4UHLKCHC","created_at":"2026-07-05T09:55:28Z"},{"alias_kind":"pith_short_8","alias_value":"WHBH7ABB","created_at":"2026-07-05T09:55:28Z"}],"graph_snapshots":[{"event_id":"sha256:ecf5bd1ca97a71a638fd8ec48a389e61798d54b7d3bd350675ae142cba803f29","target":"graph","created_at":"2026-07-05T09:55:28Z","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/2412.21203/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study $\\textit{sparse singular value certificates}$ for random rectangular matrices. If $M$ is an $n \\times d$ matrix with independent Gaussian entries, we give a new family of polynomial-time algorithms which can certify upper bounds on the maximum of $\\|M u\\|$, where $u$ is a unit vector with at most $\\eta n$ nonzero entries for a given $\\eta \\in (0,1)$. This basic algorithmic primitive lies at the heart of a wide range of problems across algorithmic statistics and theoretical computer science.\n  Our algorithms certify a bound which is asymptotically smaller than the naive one, given by t","authors_text":"Ankit Pensia, Ilias Diakonikolas, Samuel B. Hopkins, Stefan Tiegel","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-30T18:59:46Z","title":"SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.21203","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:1cd637f0e3a6cc12af889be624c5789761a5e938c41275d493e69f1b39ffee76","target":"record","created_at":"2026-07-05T09:55:28Z","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":"35ceb76d60a7d9d672d29125a07897565ecbbbaea86157194674d31b7df15c88","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-30T18:59:46Z","title_canon_sha256":"7c2473d7482e65b9734a92f13779ddc709fd2d9a09d59dffa43f1e34b6df263f"},"schema_version":"1.0","source":{"id":"2412.21203","kind":"arxiv","version":1}},"canonical_sha256":"b1c27f8021e50eb508e2d9bc618024bfea181a95b42558920d2707b9e1278fe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1c27f8021e50eb508e2d9bc618024bfea181a95b42558920d2707b9e1278fe3","first_computed_at":"2026-07-05T09:55:28.781512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:28.781512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8hByYIRynBaBXVm+uZ6ikDrLNr2pCI1lVekQ1g6/dFZh+7yYPHRc9eDRfU0xKAOXx35EvtQovDMe91oSyAD0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:28.781998Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.21203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cd637f0e3a6cc12af889be624c5789761a5e938c41275d493e69f1b39ffee76","sha256:ecf5bd1ca97a71a638fd8ec48a389e61798d54b7d3bd350675ae142cba803f29"],"state_sha256":"5e85f531e7454ff9faecdda059d1db319613e41d973a803b5e612811f9287d5c"}