{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NET5SU5INFKCLJXV34W7TIAQSQ","short_pith_number":"pith:NET5SU5I","canonical_record":{"source":{"id":"1512.00984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8307243da24bdc5aacd6960afb17cbaf77a0483bdaff8dfa6d25f174c5752d0b","abstract_canon_sha256":"3e80cdb4603aca6fc2183f937cf2515db435178fcef7a2db29ef2fa9a2774214"},"schema_version":"1.0"},"canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","source":{"kind":"arxiv","id":"1512.00984","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00984","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00984v1","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00984","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"NET5SU5INFKC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NET5SU5INFKCLJXV","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NET5SU5I","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NET5SU5INFKCLJXV34W7TIAQSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8307243da24bdc5aacd6960afb17cbaf77a0483bdaff8dfa6d25f174c5752d0b","abstract_canon_sha256":"3e80cdb4603aca6fc2183f937cf2515db435178fcef7a2db29ef2fa9a2774214"},"schema_version":"1.0"},"canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.574089Z","signature_b64":"EheWrxxlmwAnSN3KnWLIxILR4OZGwM8coSbKteWO2VRwDyjZwzunoYRC3paYxkBVCcKz61yF1oOd0PyQBH5SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","last_reissued_at":"2026-05-18T01:16:02.573415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.573415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00984","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-18T01:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcV9XP5rE5AFfLTy8XLaQ6ogYSXRHU3tMNqu+8JHjCH2Nj4+/Qd4+5lJVqApVBQksACU/YgoKXgc63d+xwklBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:23:20.296540Z"},"content_sha256":"8caa110dec648aff89a74f896294ac7404a7a4d2f0d88c298f34504bdedd6546","schema_version":"1.0","event_id":"sha256:8caa110dec648aff89a74f896294ac7404a7a4d2f0d88c298f34504bdedd6546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NET5SU5INFKCLJXV34W7TIAQSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao, Wenliang Zhong","submitted_at":"2015-12-03T08:32:17Z","abstract_excerpt":"Low-rank modeling has a lot of important applications in machine learning, computer vision and social network analysis. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better recovery performance. However, the resultant optimization problem is much more challenging. A very recent state-of-the-art is based on the proximal gradient algorithm. However, it requires an expensive full SVD in each proximal step. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00984","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-18T01:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sboviqHPuUEe8z4ATIMSbzCUjAOtI9Ns8x34whYB0ryZvi1WJNtXcEoQpA2BadZbjr4OxDJQJw+ygGz6O+9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:23:20.297206Z"},"content_sha256":"a7b3bd86eae39324ed07bab46ee3dcd4d598113fc9bc15136a23678699bb145d","schema_version":"1.0","event_id":"sha256:a7b3bd86eae39324ed07bab46ee3dcd4d598113fc9bc15136a23678699bb145d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/bundle.json","state_url":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NET5SU5INFKCLJXV34W7TIAQSQ/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-05T02:23:20Z","links":{"resolver":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ","bundle":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/bundle.json","state":"https://pith.science/pith/NET5SU5INFKCLJXV34W7TIAQSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NET5SU5INFKCLJXV34W7TIAQSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NET5SU5INFKCLJXV34W7TIAQSQ","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":"3e80cdb4603aca6fc2183f937cf2515db435178fcef7a2db29ef2fa9a2774214","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","title_canon_sha256":"8307243da24bdc5aacd6960afb17cbaf77a0483bdaff8dfa6d25f174c5752d0b"},"schema_version":"1.0","source":{"id":"1512.00984","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00984","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00984v1","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00984","created_at":"2026-05-18T01:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"NET5SU5INFKC","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NET5SU5INFKCLJXV","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NET5SU5I","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:a7b3bd86eae39324ed07bab46ee3dcd4d598113fc9bc15136a23678699bb145d","target":"graph","created_at":"2026-05-18T01:16:02Z","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":"Low-rank modeling has a lot of important applications in machine learning, computer vision and social network analysis. While the matrix rank is often approximated by the convex nuclear norm, the use of nonconvex low-rank regularizers has demonstrated better recovery performance. However, the resultant optimization problem is much more challenging. A very recent state-of-the-art is based on the proximal gradient algorithm. However, it requires an expensive full SVD in each proximal step. In this paper, we show that for many commonly-used nonconvex low-rank regularizers, a cutoff can be derived","authors_text":"James T. Kwok, Quanming Yao, Wenliang Zhong","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00984","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:8caa110dec648aff89a74f896294ac7404a7a4d2f0d88c298f34504bdedd6546","target":"record","created_at":"2026-05-18T01:16:02Z","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":"3e80cdb4603aca6fc2183f937cf2515db435178fcef7a2db29ef2fa9a2774214","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-12-03T08:32:17Z","title_canon_sha256":"8307243da24bdc5aacd6960afb17cbaf77a0483bdaff8dfa6d25f174c5752d0b"},"schema_version":"1.0","source":{"id":"1512.00984","kind":"arxiv","version":1}},"canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6927d953a8695425a6f5df2df9a0109403114d70bff4c5e5a99b2678d008cf5f","first_computed_at":"2026-05-18T01:16:02.573415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:02.573415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EheWrxxlmwAnSN3KnWLIxILR4OZGwM8coSbKteWO2VRwDyjZwzunoYRC3paYxkBVCcKz61yF1oOd0PyQBH5SDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:02.574089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00984","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8caa110dec648aff89a74f896294ac7404a7a4d2f0d88c298f34504bdedd6546","sha256:a7b3bd86eae39324ed07bab46ee3dcd4d598113fc9bc15136a23678699bb145d"],"state_sha256":"85d61b981574d5b32bb1bf756d0ebb857ee77b44e56337a1cb2ae192ceb3932a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKj53rygjPNdnQ9W2ESjmJZMB/uzL0LpScMiwo6vQMRiryQqJMahIjSmQWHGaNOQNPQTkj/J7ZoPzzZ0UvlRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:23:20.300277Z","bundle_sha256":"85458c2d7519b43b69d0cfc3c6aa7707a540685996bbeb7e629aad81bd5eaf28"}}