{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IKYWNSA4OM6DZCAEFZZ7PKAYNI","short_pith_number":"pith:IKYWNSA4","canonical_record":{"source":{"id":"1511.07263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T15:10:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"71e927d6871b7eb80436af7df5988e8a9c23dd78ca9253d0cd772cc7b1d83639","abstract_canon_sha256":"1ab24e05ccc6096cf6eb4c9d757074a592673bb380206b9181070a5a6cd7f1c6"},"schema_version":"1.0"},"canonical_sha256":"42b166c81c733c3c88042e73f7a8186a1d5734ed198967f4d1595609d0b442d3","source":{"kind":"arxiv","id":"1511.07263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07263","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07263v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07263","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"IKYWNSA4OM6D","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IKYWNSA4OM6DZCAE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IKYWNSA4","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IKYWNSA4OM6DZCAEFZZ7PKAYNI","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T15:10:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"71e927d6871b7eb80436af7df5988e8a9c23dd78ca9253d0cd772cc7b1d83639","abstract_canon_sha256":"1ab24e05ccc6096cf6eb4c9d757074a592673bb380206b9181070a5a6cd7f1c6"},"schema_version":"1.0"},"canonical_sha256":"42b166c81c733c3c88042e73f7a8186a1d5734ed198967f4d1595609d0b442d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.296261Z","signature_b64":"hidqCaMrQ+7oHmL3Y+QQr1IxAyq62UMxpFpnfqZ2dknODfEhOp/DK7hep0oHrxE/Oa82GzmigdHiuYV4mUGLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b166c81c733c3c88042e73f7a8186a1d5734ed198967f4d1595609d0b442d3","last_reissued_at":"2026-05-18T01:02:59.295652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.295652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07263","source_version":2,"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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jom2xPkPmK6QJuQtX9OznF4t+BG1cWvpxfjEVKBtzrzBcIlkgAce9dIftLxpynRfFhXD3qgmzytVONjpXZ8MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:56:42.055130Z"},"content_sha256":"89005b156fb4c70e5b5174601dff5da2f0a77d1b0da8f1617ae9c39d4f8dfd70","schema_version":"1.0","event_id":"sha256:89005b156fb4c70e5b5174601dff5da2f0a77d1b0da8f1617ae9c39d4f8dfd70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IKYWNSA4OM6DZCAEFZZ7PKAYNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Christopher Musco, Michael B. Cohen","submitted_at":"2015-11-23T15:10:05Z","abstract_excerpt":"We present a new algorithm for finding a near optimal low-rank approximation of a matrix $A$ in $O(nnz(A))$ time. Our method is based on a recursive sampling scheme for computing a representative subset of $A$'s columns, which is then used to find a low-rank approximation.\n  This approach differs substantially from prior $O(nnz(A))$ time algorithms, which are all based on fast Johnson-Lindenstrauss random projections. It matches the guarantees of these methods while offering a number of advantages.\n  Not only are sampling algorithms faster for sparse and structured data, but they can also be a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07263","kind":"arxiv","version":2},"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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZ1FHw853oVSuXtpIujVi/EzTrH7CYFiIdBOnL0iJECuqHomCN2M6JyttwdCOtCRa4zfh0CAjvat59ZUFYjHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:56:42.055493Z"},"content_sha256":"663a4c27c3e0d6fd94c9cf671d8935b942e2efdf42634e2d05ec3aadce8fb768","schema_version":"1.0","event_id":"sha256:663a4c27c3e0d6fd94c9cf671d8935b942e2efdf42634e2d05ec3aadce8fb768"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/bundle.json","state_url":"https://pith.science/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/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-09T14:56:42Z","links":{"resolver":"https://pith.science/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI","bundle":"https://pith.science/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/bundle.json","state":"https://pith.science/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKYWNSA4OM6DZCAEFZZ7PKAYNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IKYWNSA4OM6DZCAEFZZ7PKAYNI","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":"1ab24e05ccc6096cf6eb4c9d757074a592673bb380206b9181070a5a6cd7f1c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T15:10:05Z","title_canon_sha256":"71e927d6871b7eb80436af7df5988e8a9c23dd78ca9253d0cd772cc7b1d83639"},"schema_version":"1.0","source":{"id":"1511.07263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07263","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07263v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07263","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"IKYWNSA4OM6D","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IKYWNSA4OM6DZCAE","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IKYWNSA4","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:663a4c27c3e0d6fd94c9cf671d8935b942e2efdf42634e2d05ec3aadce8fb768","target":"graph","created_at":"2026-05-18T01:02:59Z","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 present a new algorithm for finding a near optimal low-rank approximation of a matrix $A$ in $O(nnz(A))$ time. Our method is based on a recursive sampling scheme for computing a representative subset of $A$'s columns, which is then used to find a low-rank approximation.\n  This approach differs substantially from prior $O(nnz(A))$ time algorithms, which are all based on fast Johnson-Lindenstrauss random projections. It matches the guarantees of these methods while offering a number of advantages.\n  Not only are sampling algorithms faster for sparse and structured data, but they can also be a","authors_text":"Cameron Musco, Christopher Musco, Michael B. Cohen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T15:10:05Z","title":"Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07263","kind":"arxiv","version":2},"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:89005b156fb4c70e5b5174601dff5da2f0a77d1b0da8f1617ae9c39d4f8dfd70","target":"record","created_at":"2026-05-18T01:02:59Z","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":"1ab24e05ccc6096cf6eb4c9d757074a592673bb380206b9181070a5a6cd7f1c6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T15:10:05Z","title_canon_sha256":"71e927d6871b7eb80436af7df5988e8a9c23dd78ca9253d0cd772cc7b1d83639"},"schema_version":"1.0","source":{"id":"1511.07263","kind":"arxiv","version":2}},"canonical_sha256":"42b166c81c733c3c88042e73f7a8186a1d5734ed198967f4d1595609d0b442d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b166c81c733c3c88042e73f7a8186a1d5734ed198967f4d1595609d0b442d3","first_computed_at":"2026-05-18T01:02:59.295652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.295652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hidqCaMrQ+7oHmL3Y+QQr1IxAyq62UMxpFpnfqZ2dknODfEhOp/DK7hep0oHrxE/Oa82GzmigdHiuYV4mUGLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.296261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89005b156fb4c70e5b5174601dff5da2f0a77d1b0da8f1617ae9c39d4f8dfd70","sha256:663a4c27c3e0d6fd94c9cf671d8935b942e2efdf42634e2d05ec3aadce8fb768"],"state_sha256":"1106a792a86d2bf8b71e74638abf449c569bc3fd2bea902fa932db65fb509ad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45ruxPjAABzbyenJuX2OePO+QA11Od7UiOnV3bc02yseL7+pWxcCee9TVWmR0jwM4Mtq7bm4NBueGf/GmuVtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:56:42.057453Z","bundle_sha256":"806d8e22bdf6a2f682af9a619887af66e86ae86171a1d5ff24c26638a904b2e8"}}