{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OZFZCNM3IASFFSIIZKSNZPKE3I","short_pith_number":"pith:OZFZCNM3","schema_version":"1.0","canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","source":{"kind":"arxiv","id":"1103.5453","version":1},"attestation_state":"computed","paper":{"title":"Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Malik Magdon-Ismail","submitted_at":"2011-03-28T19:37:20Z","abstract_excerpt":"We focus on \\emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \\math{\\ell_2} regression. For \\math{\\matA\\in\\R^{m\\times d}} (\\math{m} points in \\math{d\\ll m} dimensions), and 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 with linear (up to polylog factors) dependence on the stable rank of \\math{\\matA}. This result is achieved through the application o"},"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":"1103.5453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-28T19:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"fed6f55a3572b275c66227f8c93fc1d137fc8b5ae4a765a957c23a2f86c58457","abstract_canon_sha256":"070b45b362fd3292fb1e24a863d0c1c7594da6a23a2e266919882766ddf4d451"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:38.029518Z","signature_b64":"ZXuT9z207OkSHiAAIHnnP9x6v/HdKMYNg4ZyjGpFo8VLtPzRNl9rV9b/9fkEs3PD2tdoDgmyNLQkL2mFuKOlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","last_reissued_at":"2026-05-18T04:25:38.029043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:38.029043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Malik Magdon-Ismail","submitted_at":"2011-03-28T19:37:20Z","abstract_excerpt":"We focus on \\emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \\math{\\ell_2} regression. For \\math{\\matA\\in\\R^{m\\times d}} (\\math{m} points in \\math{d\\ll m} dimensions), and 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 with linear (up to polylog factors) dependence on the stable rank of \\math{\\matA}. This result is achieved through the application o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5453","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5453","created_at":"2026-05-18T04:25:38.029110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5453v1","created_at":"2026-05-18T04:25:38.029110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5453","created_at":"2026-05-18T04:25:38.029110+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZFZCNM3IASF","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZFZCNM3IASFFSII","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZFZCNM3","created_at":"2026-05-18T12:26:37.096874+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/OZFZCNM3IASFFSIIZKSNZPKE3I","json":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I.json","graph_json":"https://pith.science/api/pith-number/OZFZCNM3IASFFSIIZKSNZPKE3I/graph.json","events_json":"https://pith.science/api/pith-number/OZFZCNM3IASFFSIIZKSNZPKE3I/events.json","paper":"https://pith.science/paper/OZFZCNM3"},"agent_actions":{"view_html":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I","download_json":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I.json","view_paper":"https://pith.science/paper/OZFZCNM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5453&json=true","fetch_graph":"https://pith.science/api/pith-number/OZFZCNM3IASFFSIIZKSNZPKE3I/graph.json","fetch_events":"https://pith.science/api/pith-number/OZFZCNM3IASFFSIIZKSNZPKE3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/action/storage_attestation","attest_author":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/action/author_attestation","sign_citation":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/action/citation_signature","submit_replication":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/action/replication_record"}},"created_at":"2026-05-18T04:25:38.029110+00:00","updated_at":"2026-05-18T04:25:38.029110+00:00"}