{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KLLC5U2VT3IBCZFWMXTZRQLOTM","short_pith_number":"pith:KLLC5U2V","canonical_record":{"source":{"id":"1503.02828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"13db1d40970028635614ef4f6323fdddf0d6f2f88a10d286cb11563b9eef9365","abstract_canon_sha256":"875465eaf7eebe2614dc498ceaeadf5701112fc215d92c4043bf38eb3ffc1868"},"schema_version":"1.0"},"canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","source":{"kind":"arxiv","id":"1503.02828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02828","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02828v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02828","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"KLLC5U2VT3IB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLLC5U2VT3IBCZFW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLLC5U2V","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KLLC5U2VT3IBCZFWMXTZRQLOTM","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"13db1d40970028635614ef4f6323fdddf0d6f2f88a10d286cb11563b9eef9365","abstract_canon_sha256":"875465eaf7eebe2614dc498ceaeadf5701112fc215d92c4043bf38eb3ffc1868"},"schema_version":"1.0"},"canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.190795Z","signature_b64":"fmhgfC5cjkXJ9CDICsFT301y2Dc3x3rymOffrqwJq6bb+UUmFfpq29LXCtFmlRRAar+x/nLqNoTFvqmmG5A8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","last_reissued_at":"2026-05-18T02:21:51.190130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.190130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02828","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-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVHRyduEwMKLF/Ywa7US8BDzk2NSbcVViZWiHktZUhUw5qaQUSoJ6HbmQRPPpkMFniFbVAJjfsgcpU8XDE9JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:09:26.864448Z"},"content_sha256":"126ae7f3233b4ec19a636d9b93cd0d6817b4c39dff9ef07ec200a29db1dbe6d9","schema_version":"1.0","event_id":"sha256:126ae7f3233b4ec19a636d9b93cd0d6817b4c39dff9ef07ec200a29db1dbe6d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KLLC5U2VT3IBCZFWMXTZRQLOTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Dong Xu, Junbin Gao, Mingkui Tan, Qinfeng Shi, Shijie Xiao","submitted_at":"2015-03-10T09:42:17Z","abstract_excerpt":"Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve trace-norm regularized problems defined on real-algebraic variety $\\mMLr$ of real matrices of rank at most $r$. Based on PRG, we further present a simple and novel subspace pursuit (SP) paradigm for gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02828","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-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blcC/PDvYhUjngMNRe+i/37oGlx+KTqM8PXdUe1x3OGZu41EIEatehh2k8pnIR3myHBECDoSUCqbJXmRo1t7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:09:26.864794Z"},"content_sha256":"622fbb9696e3cfd8ed5881084049669943d014aabcd205dc787188df17829342","schema_version":"1.0","event_id":"sha256:622fbb9696e3cfd8ed5881084049669943d014aabcd205dc787188df17829342"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/bundle.json","state_url":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/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-07-06T14:09:26Z","links":{"resolver":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM","bundle":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/bundle.json","state":"https://pith.science/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLLC5U2VT3IBCZFWMXTZRQLOTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KLLC5U2VT3IBCZFWMXTZRQLOTM","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":"875465eaf7eebe2614dc498ceaeadf5701112fc215d92c4043bf38eb3ffc1868","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","title_canon_sha256":"13db1d40970028635614ef4f6323fdddf0d6f2f88a10d286cb11563b9eef9365"},"schema_version":"1.0","source":{"id":"1503.02828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02828","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02828v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02828","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"KLLC5U2VT3IB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KLLC5U2VT3IBCZFW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KLLC5U2V","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:622fbb9696e3cfd8ed5881084049669943d014aabcd205dc787188df17829342","target":"graph","created_at":"2026-05-18T02:21:51Z","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":"Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve trace-norm regularized problems defined on real-algebraic variety $\\mMLr$ of real matrices of rank at most $r$. Based on PRG, we further present a simple and novel subspace pursuit (SP) paradigm for gene","authors_text":"Anton van den Hengel, Dong Xu, Junbin Gao, Mingkui Tan, Qinfeng Shi, Shijie Xiao","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","title":"Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02828","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:126ae7f3233b4ec19a636d9b93cd0d6817b4c39dff9ef07ec200a29db1dbe6d9","target":"record","created_at":"2026-05-18T02:21:51Z","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":"875465eaf7eebe2614dc498ceaeadf5701112fc215d92c4043bf38eb3ffc1868","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-10T09:42:17Z","title_canon_sha256":"13db1d40970028635614ef4f6323fdddf0d6f2f88a10d286cb11563b9eef9365"},"schema_version":"1.0","source":{"id":"1503.02828","kind":"arxiv","version":2}},"canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d62ed3559ed01164b665e798c16e9b182f110b74c88a9dcfdd209b6e1e413f","first_computed_at":"2026-05-18T02:21:51.190130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:51.190130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmhgfC5cjkXJ9CDICsFT301y2Dc3x3rymOffrqwJq6bb+UUmFfpq29LXCtFmlRRAar+x/nLqNoTFvqmmG5A8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:51.190795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:126ae7f3233b4ec19a636d9b93cd0d6817b4c39dff9ef07ec200a29db1dbe6d9","sha256:622fbb9696e3cfd8ed5881084049669943d014aabcd205dc787188df17829342"],"state_sha256":"cbc1e2bc0a35abe17f1261e765aeb201f9bde24b2ed7e49de05a49f450bd74d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okri3XKZ44RLMBVJypvU1Lnhfm5siaJuaTAcCpu4qkmPMHENn+5+K9/LDZCu50RoZ+ZD04yvb8vY4Pm6FJd/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:09:26.866720Z","bundle_sha256":"7c3f0ce4cb26e9878c74448461af06fb72db13b5c9a2e962199b70f26729586a"}}