{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:G2KBSQA3UWVXY6FFMUWXLF6OAD","short_pith_number":"pith:G2KBSQA3","schema_version":"1.0","canonical_sha256":"369419401ba5ab7c78a5652d7597ce00dbd56d4bf941fe4931ae2c377a5edc08","source":{"kind":"arxiv","id":"2108.06312","version":2},"attestation_state":"computed","paper":{"title":"Matrix Concentration Inequalities and Free Probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OA"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira, March T. Boedihardjo, Ramon van Handel","submitted_at":"2021-08-13T16:38:45Z","abstract_excerpt":"A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\\sum_i g_i A_i$ where $g_i$ are independent standard Gaussian variables and $A_i$ are matrix coefficients. This bound exhibits a logarithmic dependence on dimension that is sharp when the matrices $A_i$ commute, but often proves to be suboptimal in the presence of noncommutativity. In this paper, we develop nonasymptotic bounds on the spectrum of arbitrary Gaussian random matrices that can capture nonco"},"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":"2108.06312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-08-13T16:38:45Z","cross_cats_sorted":["math.FA","math.OA"],"title_canon_sha256":"f7d110384f8dca52c22eb9702bd68d9f11b6ee41cca3b3c105f69156ceae6891","abstract_canon_sha256":"34a6ae6a94e238f4def132555282f1226b36868a905f80ceefba37be0d83d379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:50.735248Z","signature_b64":"JRWID9gWm+a+677AgXsxOmWUtRqb3NdBNazjH7vjSmvg1x3qlsI8Zb0qU7lrqqCMQuulS6DNU5k2ofwjxFznBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"369419401ba5ab7c78a5652d7597ce00dbd56d4bf941fe4931ae2c377a5edc08","last_reissued_at":"2026-07-05T06:50:50.734820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:50.734820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Concentration Inequalities and Free Probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.OA"],"primary_cat":"math.PR","authors_text":"Afonso S. Bandeira, March T. Boedihardjo, Ramon van Handel","submitted_at":"2021-08-13T16:38:45Z","abstract_excerpt":"A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\\sum_i g_i A_i$ where $g_i$ are independent standard Gaussian variables and $A_i$ are matrix coefficients. This bound exhibits a logarithmic dependence on dimension that is sharp when the matrices $A_i$ commute, but often proves to be suboptimal in the presence of noncommutativity. In this paper, we develop nonasymptotic bounds on the spectrum of arbitrary Gaussian random matrices that can capture nonco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06312","kind":"arxiv","version":2},"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/2108.06312/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":"2108.06312","created_at":"2026-07-05T06:50:50.734878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06312v2","created_at":"2026-07-05T06:50:50.734878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06312","created_at":"2026-07-05T06:50:50.734878+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2KBSQA3UWVX","created_at":"2026-07-05T06:50:50.734878+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2KBSQA3UWVXY6FF","created_at":"2026-07-05T06:50:50.734878+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2KBSQA3","created_at":"2026-07-05T06:50:50.734878+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12181","citing_title":"Matrix Discrepancy for Representations of Finite Groups","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12181","citing_title":"Matrix Discrepancy for Representations of Finite Groups","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD","json":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD.json","graph_json":"https://pith.science/api/pith-number/G2KBSQA3UWVXY6FFMUWXLF6OAD/graph.json","events_json":"https://pith.science/api/pith-number/G2KBSQA3UWVXY6FFMUWXLF6OAD/events.json","paper":"https://pith.science/paper/G2KBSQA3"},"agent_actions":{"view_html":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD","download_json":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD.json","view_paper":"https://pith.science/paper/G2KBSQA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06312&json=true","fetch_graph":"https://pith.science/api/pith-number/G2KBSQA3UWVXY6FFMUWXLF6OAD/graph.json","fetch_events":"https://pith.science/api/pith-number/G2KBSQA3UWVXY6FFMUWXLF6OAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD/action/storage_attestation","attest_author":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD/action/author_attestation","sign_citation":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD/action/citation_signature","submit_replication":"https://pith.science/pith/G2KBSQA3UWVXY6FFMUWXLF6OAD/action/replication_record"}},"created_at":"2026-07-05T06:50:50.734878+00:00","updated_at":"2026-07-05T06:50:50.734878+00:00"}