{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZEZCMDAAWCZNLR636QAKYYPDW3","short_pith_number":"pith:ZEZCMDAA","canonical_record":{"source":{"id":"2012.00175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-11-30T23:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"77ec68c49edb0ca92d10d5a7e15998c0622e12ccdfa390ed680d742d9538559d","abstract_canon_sha256":"32b68cb9952edf47b3f329624aeac49004ef78bdebdb3fece6346ac84746b9ae"},"schema_version":"1.0"},"canonical_sha256":"c932260c00b0b2d5c7dbf400ac61e3b6e2535e77c1b5f08fba7be603425f5150","source":{"kind":"arxiv","id":"2012.00175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00175","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00175v1","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00175","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZEZCMDAAWCZN","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZEZCMDAAWCZNLR63","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZEZCMDAA","created_at":"2026-07-05T01:55:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZEZCMDAAWCZNLR636QAKYYPDW3","target":"record","payload":{"canonical_record":{"source":{"id":"2012.00175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-11-30T23:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"77ec68c49edb0ca92d10d5a7e15998c0622e12ccdfa390ed680d742d9538559d","abstract_canon_sha256":"32b68cb9952edf47b3f329624aeac49004ef78bdebdb3fece6346ac84746b9ae"},"schema_version":"1.0"},"canonical_sha256":"c932260c00b0b2d5c7dbf400ac61e3b6e2535e77c1b5f08fba7be603425f5150","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:33.266222Z","signature_b64":"/+h0tfMRHcUFyNBoPoMp8eE6WBP4U+UEjrtRsc9/aF88J9DidHTF6XCyeCgaudgjNplqxCzswcvTC9rCfnVwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c932260c00b0b2d5c7dbf400ac61e3b6e2535e77c1b5f08fba7be603425f5150","last_reissued_at":"2026-07-05T01:55:33.265831Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:33.265831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.00175","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-07-05T01:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sU4lSIYHKLPg3fFN+EykmBOxFTKybHYkGssRShhLrqDRUrHo1CEaA+VYlxv6X/2nKOH/prZLFc9H1stAvTjjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:10:50.683631Z"},"content_sha256":"bfb5afe4fce881cc968dd799caa1f352559c413d4d07d5579b176b0d27ecaa62","schema_version":"1.0","event_id":"sha256:bfb5afe4fce881cc968dd799caa1f352559c413d4d07d5579b176b0d27ecaa62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZEZCMDAAWCZNLR636QAKYYPDW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal and algorithmic norm regularization of random matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ashwin Sah, Mehtaab Sawhney, Vishesh Jain","submitted_at":"2020-11-30T23:55:30Z","abstract_excerpt":"Let $A$ be an $n\\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\\exp(-\\Omega(\\epsilon n))$ in the choice of $A$, finds an $\\epsilon n \\times \\epsilon n$ sub-matrix such that zeroing it out results in $\\widetilde{A}$ with \\[\\|\\widetilde{A}\\| = O\\left(\\sqrt{n/\\epsilon}\\right).\\] Our result is optimal up to a constant factor and improves previous results of Rebrova and Vershynin, and Rebrova. We also prove an analogous result for $A$ a symmetric $n\\times n$ random matrix whos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00175","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/2012.00175/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-07-05T01:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iY2bvaLY0j2uoE+6SiwJC+bW21gAJ8Iohiq/DXFZezrF/alMrikkVzXQTOca6owqz5lzrj/N+G/WMS+JvYsYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:10:50.684135Z"},"content_sha256":"17376067b4d791824a5567fcfa02fb373a20ac43dc5d2ef4861d29fbc2d68f78","schema_version":"1.0","event_id":"sha256:17376067b4d791824a5567fcfa02fb373a20ac43dc5d2ef4861d29fbc2d68f78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/bundle.json","state_url":"https://pith.science/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/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-08-19T10:10:50Z","links":{"resolver":"https://pith.science/pith/ZEZCMDAAWCZNLR636QAKYYPDW3","bundle":"https://pith.science/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/bundle.json","state":"https://pith.science/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEZCMDAAWCZNLR636QAKYYPDW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZEZCMDAAWCZNLR636QAKYYPDW3","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":"32b68cb9952edf47b3f329624aeac49004ef78bdebdb3fece6346ac84746b9ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-11-30T23:55:30Z","title_canon_sha256":"77ec68c49edb0ca92d10d5a7e15998c0622e12ccdfa390ed680d742d9538559d"},"schema_version":"1.0","source":{"id":"2012.00175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.00175","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"2012.00175v1","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00175","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZEZCMDAAWCZN","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZEZCMDAAWCZNLR63","created_at":"2026-07-05T01:55:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZEZCMDAA","created_at":"2026-07-05T01:55:33Z"}],"graph_snapshots":[{"event_id":"sha256:17376067b4d791824a5567fcfa02fb373a20ac43dc5d2ef4861d29fbc2d68f78","target":"graph","created_at":"2026-07-05T01:55:33Z","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/2012.00175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $A$ be an $n\\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\\exp(-\\Omega(\\epsilon n))$ in the choice of $A$, finds an $\\epsilon n \\times \\epsilon n$ sub-matrix such that zeroing it out results in $\\widetilde{A}$ with \\[\\|\\widetilde{A}\\| = O\\left(\\sqrt{n/\\epsilon}\\right).\\] Our result is optimal up to a constant factor and improves previous results of Rebrova and Vershynin, and Rebrova. We also prove an analogous result for $A$ a symmetric $n\\times n$ random matrix whos","authors_text":"Ashwin Sah, Mehtaab Sawhney, Vishesh Jain","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-11-30T23:55:30Z","title":"Optimal and algorithmic norm regularization of random matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00175","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:bfb5afe4fce881cc968dd799caa1f352559c413d4d07d5579b176b0d27ecaa62","target":"record","created_at":"2026-07-05T01:55:33Z","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":"32b68cb9952edf47b3f329624aeac49004ef78bdebdb3fece6346ac84746b9ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2020-11-30T23:55:30Z","title_canon_sha256":"77ec68c49edb0ca92d10d5a7e15998c0622e12ccdfa390ed680d742d9538559d"},"schema_version":"1.0","source":{"id":"2012.00175","kind":"arxiv","version":1}},"canonical_sha256":"c932260c00b0b2d5c7dbf400ac61e3b6e2535e77c1b5f08fba7be603425f5150","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c932260c00b0b2d5c7dbf400ac61e3b6e2535e77c1b5f08fba7be603425f5150","first_computed_at":"2026-07-05T01:55:33.265831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:55:33.265831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/+h0tfMRHcUFyNBoPoMp8eE6WBP4U+UEjrtRsc9/aF88J9DidHTF6XCyeCgaudgjNplqxCzswcvTC9rCfnVwDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:55:33.266222Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.00175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfb5afe4fce881cc968dd799caa1f352559c413d4d07d5579b176b0d27ecaa62","sha256:17376067b4d791824a5567fcfa02fb373a20ac43dc5d2ef4861d29fbc2d68f78"],"state_sha256":"76e82ee084ce432b7fe437cd053ad10ad0416ba962ee73e15cbc7cc1e77afe05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sio5jWhgjCX4n5ytb5KHMJmxET/2Oj2j893GHV5D7Oeww8kFWukQLwJEv6hw52KUW8b28udqH8uzyEzRu5gpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T10:10:50.688339Z","bundle_sha256":"a41daa4247a7ad4ee8ff3bdad2420f6fee10cccb04a070847b1cb128147dc49c"}}