{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:L5HCRUJ3M4LI33JLWVJSX7Z2IL","short_pith_number":"pith:L5HCRUJ3","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"},"canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","source":{"kind":"arxiv","id":"1005.2724","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2724","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2724v3","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2724","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"L5HCRUJ3M4LI","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L5HCRUJ3M4LI33JL","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L5HCRUJ3","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:L5HCRUJ3M4LI33JLWVJSX7Z2IL","target":"record","payload":{"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"},"canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","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"},"source_kind":"arxiv","source_id":"1005.2724","source_version":3,"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-05-18T04:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0C+xcyD8XLmOydb39R2P8aVHqVIjJ8+qrn0mWQ4Wjk9b0/LlyHVHdSwEJNekXP3cKm5f2KFd02ulNuHW81mCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:53.028197Z"},"content_sha256":"33ada759513b8ff3281c3d626ca09b0942479981b97f85fc4c9fa7d9222837b9","schema_version":"1.0","event_id":"sha256:33ada759513b8ff3281c3d626ca09b0942479981b97f85fc4c9fa7d9222837b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:L5HCRUJ3M4LI33JLWVJSX7Z2IL","target":"graph","payload":{"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"},"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-05-18T04:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBw7G0tZ4v8nrM6iVcL2cd5e1G+5QNJY5XGNbg9OggOW8RMQa6HsFwZaTFSWLSNhQG2j8mZ4N395X5M0muvWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:24:53.028563Z"},"content_sha256":"70791e7c978c8ac6cde86fa1a7b6c4ea067fad923f9703e964281a1723cc5008","schema_version":"1.0","event_id":"sha256:70791e7c978c8ac6cde86fa1a7b6c4ea067fad923f9703e964281a1723cc5008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/bundle.json","state_url":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/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-06-02T19:24:53Z","links":{"resolver":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL","bundle":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/bundle.json","state":"https://pith.science/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5HCRUJ3M4LI33JLWVJSX7Z2IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:L5HCRUJ3M4LI33JLWVJSX7Z2IL","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":"76736270fb52b408e1bb7603678ba6858840b1871d3f0bfb6cb6c88c42595823","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-16T06:08:16Z","title_canon_sha256":"f2121d1585a021adc524cb0e41aebf06081a2f3834a5afaaa04c3245a05b1890"},"schema_version":"1.0","source":{"id":"1005.2724","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2724","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2724v3","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2724","created_at":"2026-05-18T04:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"L5HCRUJ3M4LI","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"L5HCRUJ3M4LI33JL","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"L5HCRUJ3","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:70791e7c978c8ac6cde86fa1a7b6c4ea067fad923f9703e964281a1723cc5008","target":"graph","created_at":"2026-05-18T04:38:17Z","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":"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","authors_text":"Anastasios Zouzias, Avner Magen","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-16T06:08:16Z","title":"Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2724","kind":"arxiv","version":3},"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:33ada759513b8ff3281c3d626ca09b0942479981b97f85fc4c9fa7d9222837b9","target":"record","created_at":"2026-05-18T04:38:17Z","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":"76736270fb52b408e1bb7603678ba6858840b1871d3f0bfb6cb6c88c42595823","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-16T06:08:16Z","title_canon_sha256":"f2121d1585a021adc524cb0e41aebf06081a2f3834a5afaaa04c3245a05b1890"},"schema_version":"1.0","source":{"id":"1005.2724","kind":"arxiv","version":3}},"canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f4e28d13b67168ded2bb5532bff3a42f730db419ba5d94d796465a0ee7989eb","first_computed_at":"2026-05-18T04:38:17.044078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:17.044078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ZZ4uoEPO/wq49yO5H6Uo8KpgELtzbBg6aURaK48YhOJVlhfJZeMAtQniuZ1Wck7Xhz1vSV3QjOvaXphUfYRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:17.044636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2724","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33ada759513b8ff3281c3d626ca09b0942479981b97f85fc4c9fa7d9222837b9","sha256:70791e7c978c8ac6cde86fa1a7b6c4ea067fad923f9703e964281a1723cc5008"],"state_sha256":"33e9c74467c71ba613979331973547823e2f366ee5e951403954c69b3e166b1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHfzhH7Fpsofs2Lzm3hHjvvirz/qDAexpZx5e9sDATx0Y8E1lD/hg8LodHK3iDpzlPuveoSGra0cQAMA2ixQCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:24:53.030633Z","bundle_sha256":"b892864236f28e0f7d9980d19c71bf0542e8d13516e88fcb06fca45befd55d4c"}}