{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:23ARCWYQTK4WBRDJPAXT3GGO7Y","short_pith_number":"pith:23ARCWYQ","schema_version":"1.0","canonical_sha256":"d6c1115b109ab960c469782f3d98cefe366e42199f30286d8669e70fb3198b76","source":{"kind":"arxiv","id":"2003.06319","version":1},"attestation_state":"computed","paper":{"title":"On Concentration Inequalities for Random Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nikhil Srivastava, Satyaki Mukherjee, Tarun Kathuria","submitted_at":"2020-03-13T14:28:35Z","abstract_excerpt":"Consider $n$ complex random matrices $X_1,\\ldots,X_n$ of size $d\\times d$ sampled i.i.d. from a distribution with mean $E[X]=\\mu$. While the concentration of averages of these matrices is well-studied, the concentration of other functions of such matrices is less clear. One function which arises in the context of stochastic iterative algorithms, like Oja's algorithm for Principal Component Analysis, is the normalized matrix product defined as $\\prod\\limits_{i=1}^{n}\\left(I + \\frac{X_i}{n}\\right).$ Concentration properties of this normalized matrix product were recently studied by \\cite{HW19}. "},"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":"2003.06319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-03-13T14:28:35Z","cross_cats_sorted":[],"title_canon_sha256":"5b44aa18fc6cf54de5c3329a8e637a4d5130c401f5bd8e8ee62a71421d7b9fa1","abstract_canon_sha256":"a4c9fdc5d98af4c51c7cd2e1698dc9f0f8a4a0ee821b2debed6a62651abc713c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:45.863371Z","signature_b64":"OG4FjBPYntQfX22AQpRvJcm+QIz+55lYQ0jcDHkuzqw8/EVEZgAumjCRkQl55msRUGmfKdDgdwklTl6eKSlTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6c1115b109ab960c469782f3d98cefe366e42199f30286d8669e70fb3198b76","last_reissued_at":"2026-07-05T00:47:45.862953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:45.862953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Concentration Inequalities for Random Matrix Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nikhil Srivastava, Satyaki Mukherjee, Tarun Kathuria","submitted_at":"2020-03-13T14:28:35Z","abstract_excerpt":"Consider $n$ complex random matrices $X_1,\\ldots,X_n$ of size $d\\times d$ sampled i.i.d. from a distribution with mean $E[X]=\\mu$. While the concentration of averages of these matrices is well-studied, the concentration of other functions of such matrices is less clear. One function which arises in the context of stochastic iterative algorithms, like Oja's algorithm for Principal Component Analysis, is the normalized matrix product defined as $\\prod\\limits_{i=1}^{n}\\left(I + \\frac{X_i}{n}\\right).$ Concentration properties of this normalized matrix product were recently studied by \\cite{HW19}. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.06319","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/2003.06319/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":"2003.06319","created_at":"2026-07-05T00:47:45.863015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.06319v1","created_at":"2026-07-05T00:47:45.863015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06319","created_at":"2026-07-05T00:47:45.863015+00:00"},{"alias_kind":"pith_short_12","alias_value":"23ARCWYQTK4W","created_at":"2026-07-05T00:47:45.863015+00:00"},{"alias_kind":"pith_short_16","alias_value":"23ARCWYQTK4WBRDJ","created_at":"2026-07-05T00:47:45.863015+00:00"},{"alias_kind":"pith_short_8","alias_value":"23ARCWYQ","created_at":"2026-07-05T00:47:45.863015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20999","citing_title":"Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise","ref_index":204,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y","json":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y.json","graph_json":"https://pith.science/api/pith-number/23ARCWYQTK4WBRDJPAXT3GGO7Y/graph.json","events_json":"https://pith.science/api/pith-number/23ARCWYQTK4WBRDJPAXT3GGO7Y/events.json","paper":"https://pith.science/paper/23ARCWYQ"},"agent_actions":{"view_html":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y","download_json":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y.json","view_paper":"https://pith.science/paper/23ARCWYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.06319&json=true","fetch_graph":"https://pith.science/api/pith-number/23ARCWYQTK4WBRDJPAXT3GGO7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/23ARCWYQTK4WBRDJPAXT3GGO7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y/action/storage_attestation","attest_author":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y/action/author_attestation","sign_citation":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y/action/citation_signature","submit_replication":"https://pith.science/pith/23ARCWYQTK4WBRDJPAXT3GGO7Y/action/replication_record"}},"created_at":"2026-07-05T00:47:45.863015+00:00","updated_at":"2026-07-05T00:47:45.863015+00:00"}