{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:L5HCRUJ3M4LI33JLWVJSX7Z2IL","short_pith_number":"pith:L5HCRUJ3","schema_version":"1.0","canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","source":{"kind":"arxiv","id":"1005.2724","version":3},"attestation_state":"computed","paper":{"title":"Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Anastasios Zouzias, Avner Magen","submitted_at":"2010-05-16T06:08:16Z","abstract_excerpt":"In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\\in{\\RR^{n\\times m}} and B\\in\\RR^{n \\times p} be two matrices and \\eps>0. We approximate the product A^\\top B using two down-sampled sketches, \\tilde{A}\\in\\RR^{t\\times m} and \\tilde{B}\\in\\RR^{t\\times p}, where t\\ll n such that \\norm{\\tilde{A}^\\top \\tilde{B} - A^\\top B} \\leq \\eps \\norm{A}\\norm{B} with high probability. We use two different sampling procedures for constructing \\tilde{A} and \\tilde{B}; one of them is done by i.i.d. non-uniform sampling rows from A and B and the othe"},"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":"1005.2724","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-16T06:08:16Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"f2121d1585a021adc524cb0e41aebf06081a2f3834a5afaaa04c3245a05b1890","abstract_canon_sha256":"76736270fb52b408e1bb7603678ba6858840b1871d3f0bfb6cb6c88c42595823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:17.044636Z","signature_b64":"+ZZ4uoEPO/wq49yO5H6Uo8KpgELtzbBg6aURaK48YhOJVlhfJZeMAtQniuZ1Wck7Xhz1vSV3QjOvaXphUfYRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","last_reissued_at":"2026-05-18T04:38:17.044078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:17.044078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Anastasios Zouzias, Avner Magen","submitted_at":"2010-05-16T06:08:16Z","abstract_excerpt":"In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\\in{\\RR^{n\\times m}} and B\\in\\RR^{n \\times p} be two matrices and \\eps>0. We approximate the product A^\\top B using two down-sampled sketches, \\tilde{A}\\in\\RR^{t\\times m} and \\tilde{B}\\in\\RR^{t\\times p}, where t\\ll n such that \\norm{\\tilde{A}^\\top \\tilde{B} - A^\\top B} \\leq \\eps \\norm{A}\\norm{B} with high probability. We use two different sampling procedures for constructing \\tilde{A} and \\tilde{B}; one of them is done by i.i.d. non-uniform sampling rows from A and B and the othe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2724","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1005.2724","created_at":"2026-05-18T04:38:17.044166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2724v3","created_at":"2026-05-18T04:38:17.044166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2724","created_at":"2026-05-18T04:38:17.044166+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5HCRUJ3M4LI","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5HCRUJ3M4LI33JL","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5HCRUJ3","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL","json":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL.json","graph_json":"https://pith.science/api/pith-number/L5HCRUJ3M4LI33JLWVJSX7Z2IL/graph.json","events_json":"https://pith.science/api/pith-number/L5HCRUJ3M4LI33JLWVJSX7Z2IL/events.json","paper":"https://pith.science/paper/L5HCRUJ3"},"agent_actions":{"view_html":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL","download_json":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL.json","view_paper":"https://pith.science/paper/L5HCRUJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2724&json=true","fetch_graph":"https://pith.science/api/pith-number/L5HCRUJ3M4LI33JLWVJSX7Z2IL/graph.json","fetch_events":"https://pith.science/api/pith-number/L5HCRUJ3M4LI33JLWVJSX7Z2IL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/action/storage_attestation","attest_author":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/action/author_attestation","sign_citation":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/action/citation_signature","submit_replication":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/action/replication_record"}},"created_at":"2026-05-18T04:38:17.044166+00:00","updated_at":"2026-05-18T04:38:17.044166+00:00"}