{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X6BMAYX6Z32PCMHZELSUZ37ARX","short_pith_number":"pith:X6BMAYX6","canonical_record":{"source":{"id":"1408.5099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-21T18:32:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"98a3bf978b535b76e38258a951008a7e60c696cbb738a9794ff2269959f3236c","abstract_canon_sha256":"69b03c909152fb1f37766af040bf721b5d8da3b45929e02b5cf5edcd199f55c0"},"schema_version":"1.0"},"canonical_sha256":"bf82c062fecef4f130f922e54cefe08dc22e37769d0fa18bdb0642a28dc3b67c","source":{"kind":"arxiv","id":"1408.5099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5099","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5099v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5099","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"X6BMAYX6Z32P","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6BMAYX6Z32PCMHZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6BMAYX6","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X6BMAYX6Z32PCMHZELSUZ37ARX","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-21T18:32:00Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"98a3bf978b535b76e38258a951008a7e60c696cbb738a9794ff2269959f3236c","abstract_canon_sha256":"69b03c909152fb1f37766af040bf721b5d8da3b45929e02b5cf5edcd199f55c0"},"schema_version":"1.0"},"canonical_sha256":"bf82c062fecef4f130f922e54cefe08dc22e37769d0fa18bdb0642a28dc3b67c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.733670Z","signature_b64":"NkH2PBuQcAzURLEGN/qRWaZQ5qsh8OFs92WuHdcsoOk1fe6E0otuGFSzwunBvanaZmNE1371tpvP6PA57mUCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf82c062fecef4f130f922e54cefe08dc22e37769d0fa18bdb0642a28dc3b67c","last_reissued_at":"2026-05-18T02:44:40.733166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.733166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5099","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9jYV52JHVulIXU1BJ0oBo23SdDzzG8zVm+IOi6jmMheLKvvwluPa9/S5oyIvC7fIGHWkHPskL3w88tXfUo5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:03:14.634186Z"},"content_sha256":"1b2c79730c9b8bb6d779d71a42fa1a84bb0e72a4e705d90a3cf36ec8eb7d6cda","schema_version":"1.0","event_id":"sha256:1b2c79730c9b8bb6d779d71a42fa1a84bb0e72a4e705d90a3cf36ec8eb7d6cda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X6BMAYX6Z32PCMHZELSUZ37ARX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Sampling for Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael B. Cohen, Richard Peng, Yin Tat Lee","submitted_at":"2014-08-21T18:32:00Z","abstract_excerpt":"Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time significantly. For theoretical performance guarantees, each row must be sampled with probability proportional to its statistical leverage score. Unfortunately, leverage scores are difficult to compute.\n  A simple alternative is to sample rows uniformly at random. While this often works, uniform sampling will eliminate critical row information for many natural insta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5099","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Z4FxnCD+aVxeZboSsy2ghPhqsRc6cBvqDikCRH9ByUYcjc3UjB9Wwc2Z/vpgYdUCI8g9+c056n/LKdA8MAKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:03:14.634825Z"},"content_sha256":"402377554eca92d5fb61a7576bf3263fed1a642e0d203deef91ce4ef9488a652","schema_version":"1.0","event_id":"sha256:402377554eca92d5fb61a7576bf3263fed1a642e0d203deef91ce4ef9488a652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/bundle.json","state_url":"https://pith.science/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/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-09T16:03:14Z","links":{"resolver":"https://pith.science/pith/X6BMAYX6Z32PCMHZELSUZ37ARX","bundle":"https://pith.science/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/bundle.json","state":"https://pith.science/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6BMAYX6Z32PCMHZELSUZ37ARX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X6BMAYX6Z32PCMHZELSUZ37ARX","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":"69b03c909152fb1f37766af040bf721b5d8da3b45929e02b5cf5edcd199f55c0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-21T18:32:00Z","title_canon_sha256":"98a3bf978b535b76e38258a951008a7e60c696cbb738a9794ff2269959f3236c"},"schema_version":"1.0","source":{"id":"1408.5099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5099","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5099v1","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5099","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"X6BMAYX6Z32P","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"X6BMAYX6Z32PCMHZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"X6BMAYX6","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:402377554eca92d5fb61a7576bf3263fed1a642e0d203deef91ce4ef9488a652","target":"graph","created_at":"2026-05-18T02:44:40Z","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":"Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time significantly. For theoretical performance guarantees, each row must be sampled with probability proportional to its statistical leverage score. Unfortunately, leverage scores are difficult to compute.\n  A simple alternative is to sample rows uniformly at random. While this often works, uniform sampling will eliminate critical row information for many natural insta","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael B. Cohen, Richard Peng, Yin Tat Lee","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-21T18:32:00Z","title":"Uniform Sampling for Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5099","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:1b2c79730c9b8bb6d779d71a42fa1a84bb0e72a4e705d90a3cf36ec8eb7d6cda","target":"record","created_at":"2026-05-18T02:44:40Z","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":"69b03c909152fb1f37766af040bf721b5d8da3b45929e02b5cf5edcd199f55c0","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-21T18:32:00Z","title_canon_sha256":"98a3bf978b535b76e38258a951008a7e60c696cbb738a9794ff2269959f3236c"},"schema_version":"1.0","source":{"id":"1408.5099","kind":"arxiv","version":1}},"canonical_sha256":"bf82c062fecef4f130f922e54cefe08dc22e37769d0fa18bdb0642a28dc3b67c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf82c062fecef4f130f922e54cefe08dc22e37769d0fa18bdb0642a28dc3b67c","first_computed_at":"2026-05-18T02:44:40.733166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.733166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NkH2PBuQcAzURLEGN/qRWaZQ5qsh8OFs92WuHdcsoOk1fe6E0otuGFSzwunBvanaZmNE1371tpvP6PA57mUCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.733670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b2c79730c9b8bb6d779d71a42fa1a84bb0e72a4e705d90a3cf36ec8eb7d6cda","sha256:402377554eca92d5fb61a7576bf3263fed1a642e0d203deef91ce4ef9488a652"],"state_sha256":"8c1865479827b110fd3fd9689af13657e1a83dd08572b00e082aae13a7c0cce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I96+a4w6/m0LXKa+wBm+j98Q4TFdVqUOOnwbOM9cJnnO5KlZsyaI2lRqKk8rcpCKbVLwMzepUF7h+ol9T0F4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:03:14.638406Z","bundle_sha256":"f539fc060b7162f7533ed98d7b5cb534800421a5c353e8a1baefbb8ff199b56a"}}