{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EB5P7QFZE6IYLSAII4DT665XZ4","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":"097a93352fa8eb737718b6adee86ddf74d8361dbbbe016a5bf0ca990a69d0564","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-02T21:30:35Z","title_canon_sha256":"cc1b1156d352b9a010e395f985f5d89add187da625e864c824fe136a12396d44"},"schema_version":"1.0","source":{"id":"1603.00897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.00897","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.00897v2","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00897","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"EB5P7QFZE6IY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EB5P7QFZE6IYLSAI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EB5P7QFZ","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:253cfbb884d6b072d55a424de7bf3cd966085edf4ee51c21cd4291c3aa117161","target":"graph","created_at":"2026-05-18T01:12:48Z","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"},"paper":{"abstract_excerpt":"Let $A$ be an isotropic, sub-gaussian $m \\times n$ matrix. We prove that the process $Z_x := \\|Ax\\|_2 - \\sqrt m \\|x\\|_2$ has sub-gaussian increments. Using this, we show that for any bounded set $T \\subseteq \\mathbb{R}^n$, the deviation of $\\|Ax\\|_2$ around its mean is uniformly bounded by the Gaussian complexity of $T$. We also prove a local version of this theorem, which allows for unbounded sets. These theorems have various applications, some of which are reviewed in this paper. In particular, we give a new result regarding model selection in the constrained linear model.","authors_text":"Abbas Mehrabian, Christopher Liaw, Roman Vershynin, Yaniv Plan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-02T21:30:35Z","title":"A simple tool for bounding the deviation of random matrices on geometric sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00897","kind":"arxiv","version":2},"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:29b1b53ce0d737f6638221b9e35d8d9b7d472911a6a0272fb31651eb657a77c0","target":"record","created_at":"2026-05-18T01:12:48Z","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":"097a93352fa8eb737718b6adee86ddf74d8361dbbbe016a5bf0ca990a69d0564","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-03-02T21:30:35Z","title_canon_sha256":"cc1b1156d352b9a010e395f985f5d89add187da625e864c824fe136a12396d44"},"schema_version":"1.0","source":{"id":"1603.00897","kind":"arxiv","version":2}},"canonical_sha256":"207affc0b9279185c80847073f7bb7cf00c7c7f7a5e8e00c4138f526cf7b2a97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"207affc0b9279185c80847073f7bb7cf00c7c7f7a5e8e00c4138f526cf7b2a97","first_computed_at":"2026-05-18T01:12:48.812259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:48.812259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bGzcgxlwTnfqN9N13ATYy9pynm62NruPaVoYtcv9jFB4q31Cg3bXQKII7H3abnx9k0YiebaB1n7pK+48uauRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:48.812697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.00897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29b1b53ce0d737f6638221b9e35d8d9b7d472911a6a0272fb31651eb657a77c0","sha256:253cfbb884d6b072d55a424de7bf3cd966085edf4ee51c21cd4291c3aa117161"],"state_sha256":"be49755e6ded4a47370693086d407d53e629bce9d8a00fb5e44e7174d049647f"}