{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LK2FVO6M2WZVJBSXIII6WOXM5W","short_pith_number":"pith:LK2FVO6M","canonical_record":{"source":{"id":"1008.0587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T16:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"91e9b3fb4e99948051acec82346209e8ed624436d1d5b4da4861ba7cfcfa1744","abstract_canon_sha256":"399b164ab496c5ed793790025dfa0fc2aa5d5e1d3fb08eaf4967699369c44d36"},"schema_version":"1.0"},"canonical_sha256":"5ab45abbccd5b35486574211eb3aeceda9e026b6f7741bdd771cc51fb16d40c9","source":{"kind":"arxiv","id":"1008.0587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0587","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0587v1","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0587","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"LK2FVO6M2WZV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LK2FVO6M2WZVJBSX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LK2FVO6M","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LK2FVO6M2WZVJBSXIII6WOXM5W","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T16:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"91e9b3fb4e99948051acec82346209e8ed624436d1d5b4da4861ba7cfcfa1744","abstract_canon_sha256":"399b164ab496c5ed793790025dfa0fc2aa5d5e1d3fb08eaf4967699369c44d36"},"schema_version":"1.0"},"canonical_sha256":"5ab45abbccd5b35486574211eb3aeceda9e026b6f7741bdd771cc51fb16d40c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:42.683627Z","signature_b64":"zDCUiGfkG4KuNU5F9hvNhwH1qaTGsF1Fodj+SO+D8qVURVvIph17ZtvvmeuQFec+o8FH/yXsYGCPJbQMNwe9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ab45abbccd5b35486574211eb3aeceda9e026b6f7741bdd771cc51fb16d40c9","last_reissued_at":"2026-05-18T04:42:42.683179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:42.683179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0587","source_version":1,"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:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N95ACzbxQq5qLfydA8glCMZj3fZpgMpS1/23OlaLJQBm0M9mvjeK1AfLffTYxMOea2MP0ZVFmqjkT6MKnJWxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:10.164359Z"},"content_sha256":"04d4d718a45182706d4c8f71ca6569255d0b326e35b823a2da2cef101142d8e0","schema_version":"1.0","event_id":"sha256:04d4d718a45182706d4c8f71ca6569255d0b326e35b823a2da2cef101142d8e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LK2FVO6M2WZVJBSXIII6WOXM5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Malik Magdon-Ismail","submitted_at":"2010-08-03T16:28:10Z","abstract_excerpt":"We focus the use of \\emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \\math{\\ell_2} regression. For a matrix \\math{\\matA\\in\\R^{m\\times d}} which represents \\math{m} points in \\math{d\\ll m} dimensions, all of these tasks can be achieved in \\math{O(md^2)} via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the \\math{m\\times d} left singular matrix of \\math{\\matA} (the \\emph{leverage scores}), we give row-sampling algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0587","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":""},"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:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvZDKLza1Akyq/kdheUFOvmHbteB5r4QaCDESyzlMT8KG5HObzaKoTri9yepS60wCMLXwd3+JfTQF+zzNN8fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:20:10.165123Z"},"content_sha256":"fcd1b33a3394b347331a79f36d668727086278aa54fe5be4f2230bf4bfee2924","schema_version":"1.0","event_id":"sha256:fcd1b33a3394b347331a79f36d668727086278aa54fe5be4f2230bf4bfee2924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/bundle.json","state_url":"https://pith.science/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/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-05-26T00:20:10Z","links":{"resolver":"https://pith.science/pith/LK2FVO6M2WZVJBSXIII6WOXM5W","bundle":"https://pith.science/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/bundle.json","state":"https://pith.science/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LK2FVO6M2WZVJBSXIII6WOXM5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LK2FVO6M2WZVJBSXIII6WOXM5W","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":"399b164ab496c5ed793790025dfa0fc2aa5d5e1d3fb08eaf4967699369c44d36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T16:28:10Z","title_canon_sha256":"91e9b3fb4e99948051acec82346209e8ed624436d1d5b4da4861ba7cfcfa1744"},"schema_version":"1.0","source":{"id":"1008.0587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0587","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0587v1","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0587","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"LK2FVO6M2WZV","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LK2FVO6M2WZVJBSX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LK2FVO6M","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:fcd1b33a3394b347331a79f36d668727086278aa54fe5be4f2230bf4bfee2924","target":"graph","created_at":"2026-05-18T04:42:42Z","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":"We focus the use of \\emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \\math{\\ell_2} regression. For a matrix \\math{\\matA\\in\\R^{m\\times d}} which represents \\math{m} points in \\math{d\\ll m} dimensions, all of these tasks can be achieved in \\math{O(md^2)} via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the \\math{m\\times d} left singular matrix of \\math{\\matA} (the \\emph{leverage scores}), we give row-sampling algorithms","authors_text":"Malik Magdon-Ismail","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0587","kind":"arxiv","version":1},"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:04d4d718a45182706d4c8f71ca6569255d0b326e35b823a2da2cef101142d8e0","target":"record","created_at":"2026-05-18T04:42:42Z","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":"399b164ab496c5ed793790025dfa0fc2aa5d5e1d3fb08eaf4967699369c44d36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-03T16:28:10Z","title_canon_sha256":"91e9b3fb4e99948051acec82346209e8ed624436d1d5b4da4861ba7cfcfa1744"},"schema_version":"1.0","source":{"id":"1008.0587","kind":"arxiv","version":1}},"canonical_sha256":"5ab45abbccd5b35486574211eb3aeceda9e026b6f7741bdd771cc51fb16d40c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ab45abbccd5b35486574211eb3aeceda9e026b6f7741bdd771cc51fb16d40c9","first_computed_at":"2026-05-18T04:42:42.683179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:42.683179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zDCUiGfkG4KuNU5F9hvNhwH1qaTGsF1Fodj+SO+D8qVURVvIph17ZtvvmeuQFec+o8FH/yXsYGCPJbQMNwe9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:42.683627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04d4d718a45182706d4c8f71ca6569255d0b326e35b823a2da2cef101142d8e0","sha256:fcd1b33a3394b347331a79f36d668727086278aa54fe5be4f2230bf4bfee2924"],"state_sha256":"4e9e66d18edb7da84b5435bf3994748f95daa8adc806c26f4addc22a3156745d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erabEVBvCEtt32FmmJdII90xwJPinzj6aUWDkoIMuBihv6HrANzCcY3PRqvAl5q9jfNfNsBs56xudnVtIk8mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:20:10.168612Z","bundle_sha256":"d2b13f6299071c40982e9fb0adea0523a006ea9b2af318543cf3c09df2532101"}}