{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PGAP4NLASS6VHRYVBGIZJ3G7NY","short_pith_number":"pith:PGAP4NLA","canonical_record":{"source":{"id":"1011.0413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T19:07:15Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"0e8048ac9edcc6551e2715eed321db6f56156294d356c28e35779984b7eebf10","abstract_canon_sha256":"b35ba98ba43ad8237980138e02e052901b149d776e481405290810cb483d64f3"},"schema_version":"1.0"},"canonical_sha256":"7980fe356094bd53c715099194ecdf6e333e96bf851c497cf3845519f559f270","source":{"kind":"arxiv","id":"1011.0413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0413","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0413v1","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0413","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"PGAP4NLASS6V","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PGAP4NLASS6VHRYV","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PGAP4NLA","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PGAP4NLASS6VHRYVBGIZJ3G7NY","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T19:07:15Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"0e8048ac9edcc6551e2715eed321db6f56156294d356c28e35779984b7eebf10","abstract_canon_sha256":"b35ba98ba43ad8237980138e02e052901b149d776e481405290810cb483d64f3"},"schema_version":"1.0"},"canonical_sha256":"7980fe356094bd53c715099194ecdf6e333e96bf851c497cf3845519f559f270","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:23.291283Z","signature_b64":"DAMzYK5XnmTTaLRmJ/JnwlxvzCboUhGzEypwuWHltQZZebYaO98jlRpFjYcCE5U5an7oor/yKDe0dkijl5wrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7980fe356094bd53c715099194ecdf6e333e96bf851c497cf3845519f559f270","last_reissued_at":"2026-05-18T04:37:23.290765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:23.290765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0413","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:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8nJ6RYfnhI4mVNjJ7GiHT0CjiWtYRLvwnCEhFd2Rnb+6yOwR/Uiw3OhGGk6BuLOncqMaWPwfb224xCQBsAtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:04.554184Z"},"content_sha256":"32fb4063ec8db3b94dddce3269d6c44b7388002dfcb210be56a8d8d72686a223","schema_version":"1.0","event_id":"sha256:32fb4063ec8db3b94dddce3269d6c44b7388002dfcb210be56a8d8d72686a223"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PGAP4NLASS6VHRYVBGIZJ3G7NY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CUR from a Sparse Optimization Viewpoint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.DS","authors_text":"Jacob Bien, Michael W. Mahoney, Ya Xu","submitted_at":"2010-11-01T19:07:15Z","abstract_excerpt":"The CUR decomposition provides an approximation of a matrix $X$ that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span of only a few columns of $X$. In this regard, it appears to be similar to many sparse PCA methods. However, CUR takes a randomized algorithmic approach, whereas most sparse PCA methods are framed as convex optimization problems. In this paper, we try to understand CUR from a sparse optimization viewpoint. We show that CUR is implicitly optimizing a sparse regression objective and, furthermore, cannot be directly cast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0413","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:37:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcB/IX6gxKkcILqf1NPyR7Kjxb/XZW53b3ckSBZU9X8OMqqkZMA6DLfwA8DjShLMyb4LjdOKng+MtWvRQLfwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:04.554779Z"},"content_sha256":"e9eb6e96f0fd690f20bf1fd66d76112d8ddc5d24b6515a199d5b44077959050b","schema_version":"1.0","event_id":"sha256:e9eb6e96f0fd690f20bf1fd66d76112d8ddc5d24b6515a199d5b44077959050b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/bundle.json","state_url":"https://pith.science/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/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-05T01:24:04Z","links":{"resolver":"https://pith.science/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY","bundle":"https://pith.science/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/bundle.json","state":"https://pith.science/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGAP4NLASS6VHRYVBGIZJ3G7NY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PGAP4NLASS6VHRYVBGIZJ3G7NY","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":"b35ba98ba43ad8237980138e02e052901b149d776e481405290810cb483d64f3","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T19:07:15Z","title_canon_sha256":"0e8048ac9edcc6551e2715eed321db6f56156294d356c28e35779984b7eebf10"},"schema_version":"1.0","source":{"id":"1011.0413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0413","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0413v1","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0413","created_at":"2026-05-18T04:37:23Z"},{"alias_kind":"pith_short_12","alias_value":"PGAP4NLASS6V","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PGAP4NLASS6VHRYV","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PGAP4NLA","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e9eb6e96f0fd690f20bf1fd66d76112d8ddc5d24b6515a199d5b44077959050b","target":"graph","created_at":"2026-05-18T04:37:23Z","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":"The CUR decomposition provides an approximation of a matrix $X$ that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span of only a few columns of $X$. In this regard, it appears to be similar to many sparse PCA methods. However, CUR takes a randomized algorithmic approach, whereas most sparse PCA methods are framed as convex optimization problems. In this paper, we try to understand CUR from a sparse optimization viewpoint. We show that CUR is implicitly optimizing a sparse regression objective and, furthermore, cannot be directly cast","authors_text":"Jacob Bien, Michael W. Mahoney, Ya Xu","cross_cats":["stat.AP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T19:07:15Z","title":"CUR from a Sparse Optimization Viewpoint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0413","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:32fb4063ec8db3b94dddce3269d6c44b7388002dfcb210be56a8d8d72686a223","target":"record","created_at":"2026-05-18T04:37:23Z","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":"b35ba98ba43ad8237980138e02e052901b149d776e481405290810cb483d64f3","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T19:07:15Z","title_canon_sha256":"0e8048ac9edcc6551e2715eed321db6f56156294d356c28e35779984b7eebf10"},"schema_version":"1.0","source":{"id":"1011.0413","kind":"arxiv","version":1}},"canonical_sha256":"7980fe356094bd53c715099194ecdf6e333e96bf851c497cf3845519f559f270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7980fe356094bd53c715099194ecdf6e333e96bf851c497cf3845519f559f270","first_computed_at":"2026-05-18T04:37:23.290765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:23.290765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAMzYK5XnmTTaLRmJ/JnwlxvzCboUhGzEypwuWHltQZZebYaO98jlRpFjYcCE5U5an7oor/yKDe0dkijl5wrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:23.291283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32fb4063ec8db3b94dddce3269d6c44b7388002dfcb210be56a8d8d72686a223","sha256:e9eb6e96f0fd690f20bf1fd66d76112d8ddc5d24b6515a199d5b44077959050b"],"state_sha256":"d705396bf3544a69822e6e4a53ed01b75310639c31e521818ece72b0f1e2f702"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AGj/ifeR3aYbyBsjbvbo2qDfq732S+iEh99NMBeywq9+ecedWg99n9RmB8U6p65CyFYjajxNIeu9PMOledi8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:24:04.557588Z","bundle_sha256":"ca11c3da28fd22abf5f074fd568a73697c2ec38d1638fa3008625ce9996c35fe"}}