{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OZFZCNM3IASFFSIIZKSNZPKE3I","short_pith_number":"pith:OZFZCNM3","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"},"canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","source":{"kind":"arxiv","id":"1103.5453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5453","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5453v1","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5453","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"OZFZCNM3IASF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZFZCNM3IASFFSII","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZFZCNM3","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OZFZCNM3IASFFSIIZKSNZPKE3I","target":"record","payload":{"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"},"canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","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"},"source_kind":"arxiv","source_id":"1103.5453","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:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEHnJNG0fyHGaIHdB/oslR+nlCGYOQqNliP2kzEUOKSwk8T5S87RRBUELfB65R0rZi256yKE1cb9bv9YPNvHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:10.753600Z"},"content_sha256":"d4e81cfacf39c8caf81d1492ba56d445f60a1702ec2aabb51bc12e4031ce348b","schema_version":"1.0","event_id":"sha256:d4e81cfacf39c8caf81d1492ba56d445f60a1702ec2aabb51bc12e4031ce348b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OZFZCNM3IASFFSIIZKSNZPKE3I","target":"graph","payload":{"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"},"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:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQWBWaCKQqhrzFr+3CqEEtrOKhsrLV6mQHYQVRuXcd/nS8Bc8Y5ogeA99kYv+vkFpzJvubqvUMSfrpyJ2MZyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:10.754076Z"},"content_sha256":"6ac5f96aefe4b09d1c7ea9702046788ec630141ff91b5c859387c5b5876e1489","schema_version":"1.0","event_id":"sha256:6ac5f96aefe4b09d1c7ea9702046788ec630141ff91b5c859387c5b5876e1489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/bundle.json","state_url":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/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-25T20:59:10Z","links":{"resolver":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I","bundle":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/bundle.json","state":"https://pith.science/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZFZCNM3IASFFSIIZKSNZPKE3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OZFZCNM3IASFFSIIZKSNZPKE3I","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":"070b45b362fd3292fb1e24a863d0c1c7594da6a23a2e266919882766ddf4d451","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-28T19:37:20Z","title_canon_sha256":"fed6f55a3572b275c66227f8c93fc1d137fc8b5ae4a765a957c23a2f86c58457"},"schema_version":"1.0","source":{"id":"1103.5453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5453","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5453v1","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5453","created_at":"2026-05-18T04:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"OZFZCNM3IASF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZFZCNM3IASFFSII","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZFZCNM3","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:6ac5f96aefe4b09d1c7ea9702046788ec630141ff91b5c859387c5b5876e1489","target":"graph","created_at":"2026-05-18T04:25:38Z","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 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","authors_text":"Malik Magdon-Ismail","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-28T19:37:20Z","title":"Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5453","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:d4e81cfacf39c8caf81d1492ba56d445f60a1702ec2aabb51bc12e4031ce348b","target":"record","created_at":"2026-05-18T04:25:38Z","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":"070b45b362fd3292fb1e24a863d0c1c7594da6a23a2e266919882766ddf4d451","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-28T19:37:20Z","title_canon_sha256":"fed6f55a3572b275c66227f8c93fc1d137fc8b5ae4a765a957c23a2f86c58457"},"schema_version":"1.0","source":{"id":"1103.5453","kind":"arxiv","version":1}},"canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"764b91359b402452c908caa4dcbd44da15b45ee5852b16aafdb035dd190d3e71","first_computed_at":"2026-05-18T04:25:38.029043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:38.029043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZXuT9z207OkSHiAAIHnnP9x6v/HdKMYNg4ZyjGpFo8VLtPzRNl9rV9b/9fkEs3PD2tdoDgmyNLQkL2mFuKOlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:38.029518Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4e81cfacf39c8caf81d1492ba56d445f60a1702ec2aabb51bc12e4031ce348b","sha256:6ac5f96aefe4b09d1c7ea9702046788ec630141ff91b5c859387c5b5876e1489"],"state_sha256":"f5010faceefc5ece9b76cc19c8413bfc660b4158da33cf1ce4e98deb898988a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pqPxlnbZo7bsjxTzIKHYbOEiUo76ARXCvYn282RoVHJILADdP5PiLkVU8Bj+d6wQc1+JdBowYP7UyCoMp5uAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:59:10.757816Z","bundle_sha256":"9beec205868fabda982faa9848dfe7aecd9ad8f2cf9ea167fc8e5824191135d6"}}