{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T4TVPKENTRJ636GBNIMLVGAFWA","short_pith_number":"pith:T4TVPKEN","canonical_record":{"source":{"id":"1510.06895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-23T11:28:06Z","cross_cats_sorted":["cs.CV","cs.NA"],"title_canon_sha256":"edd531099207316af4c2277ea765d18033fae257c5d1df461f222ef5add265dc","abstract_canon_sha256":"4e08eeca5a4adc3a077dff871b8bfc298cb3ae3594833b8471d6a924e87fbe91"},"schema_version":"1.0"},"canonical_sha256":"9f2757a88d9c53edf8c16a18ba9805b012da13b19d526020e9c811bb1b4bed8d","source":{"kind":"arxiv","id":"1510.06895","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06895","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06895v1","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06895","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"T4TVPKENTRJ6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4TVPKENTRJ636GB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4TVPKEN","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T4TVPKENTRJ636GBNIMLVGAFWA","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-23T11:28:06Z","cross_cats_sorted":["cs.CV","cs.NA"],"title_canon_sha256":"edd531099207316af4c2277ea765d18033fae257c5d1df461f222ef5add265dc","abstract_canon_sha256":"4e08eeca5a4adc3a077dff871b8bfc298cb3ae3594833b8471d6a924e87fbe91"},"schema_version":"1.0"},"canonical_sha256":"9f2757a88d9c53edf8c16a18ba9805b012da13b19d526020e9c811bb1b4bed8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:35.138519Z","signature_b64":"ljKm1LV9/vnDzxjqVJVMt+KivlHbF/7VI9a900qfLB0T/4fVk4ZajhvzXfHuAttBUz1wuPt7fjPj3zGsYgaYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2757a88d9c53edf8c16a18ba9805b012da13b19d526020e9c811bb1b4bed8d","last_reissued_at":"2026-05-18T01:22:35.138023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:35.138023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06895","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:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRizk6Wnq3GOFyeQ7ZfsyWlI5q6mWH7xAoMeINRFDXvitgqNJSwpc++nhDpBYaVwI9DKSO/ar9X+xxCoteYPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:44:54.927268Z"},"content_sha256":"8612f643ecd2f2304793c3906a6a6357a634d6f93b8017a54f2c54e1ae8bc899","schema_version":"1.0","event_id":"sha256:8612f643ecd2f2304793c3906a6a6357a634d6f93b8017a54f2c54e1ae8bc899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T4TVPKENTRJ636GBNIMLVGAFWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA"],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Jinhui Tang, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-10-23T11:28:06Z","abstract_excerpt":"The nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing. However, solving the nuclear norm based relaxed convex problem usually leads to a suboptimal solution of the original rank minimization problem. In this paper, we propose to perform a family of nonconvex surrogates of $L_0$-norm on the singular values of a matrix to approximate the rank function. This leads to a nonconvex nonsmooth minimization problem. Then we propose to solve the problem by Iteratively Re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06895","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:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDIrpTROs3wxsHNVkzFmvjLhuBUY5mzPV3rhvQF/gSIWr+BGHboPU0dZikQ6/YZK2H1ErvfCdn8OrFKP+9xNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:44:54.927639Z"},"content_sha256":"d402e9e7d131a30984aed4a7383acc25a857195875bc69431c2c6f5cddd76a47","schema_version":"1.0","event_id":"sha256:d402e9e7d131a30984aed4a7383acc25a857195875bc69431c2c6f5cddd76a47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4TVPKENTRJ636GBNIMLVGAFWA/bundle.json","state_url":"https://pith.science/pith/T4TVPKENTRJ636GBNIMLVGAFWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4TVPKENTRJ636GBNIMLVGAFWA/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-09T09:44:54Z","links":{"resolver":"https://pith.science/pith/T4TVPKENTRJ636GBNIMLVGAFWA","bundle":"https://pith.science/pith/T4TVPKENTRJ636GBNIMLVGAFWA/bundle.json","state":"https://pith.science/pith/T4TVPKENTRJ636GBNIMLVGAFWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4TVPKENTRJ636GBNIMLVGAFWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4TVPKENTRJ636GBNIMLVGAFWA","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":"4e08eeca5a4adc3a077dff871b8bfc298cb3ae3594833b8471d6a924e87fbe91","cross_cats_sorted":["cs.CV","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-23T11:28:06Z","title_canon_sha256":"edd531099207316af4c2277ea765d18033fae257c5d1df461f222ef5add265dc"},"schema_version":"1.0","source":{"id":"1510.06895","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06895","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06895v1","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06895","created_at":"2026-05-18T01:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"T4TVPKENTRJ6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4TVPKENTRJ636GB","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4TVPKEN","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:d402e9e7d131a30984aed4a7383acc25a857195875bc69431c2c6f5cddd76a47","target":"graph","created_at":"2026-05-18T01:22:35Z","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 nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing. However, solving the nuclear norm based relaxed convex problem usually leads to a suboptimal solution of the original rank minimization problem. In this paper, we propose to perform a family of nonconvex surrogates of $L_0$-norm on the singular values of a matrix to approximate the rank function. This leads to a nonconvex nonsmooth minimization problem. Then we propose to solve the problem by Iteratively Re","authors_text":"Canyi Lu, Jinhui Tang, Shuicheng Yan, Zhouchen Lin","cross_cats":["cs.CV","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-23T11:28:06Z","title":"Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06895","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:8612f643ecd2f2304793c3906a6a6357a634d6f93b8017a54f2c54e1ae8bc899","target":"record","created_at":"2026-05-18T01:22:35Z","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":"4e08eeca5a4adc3a077dff871b8bfc298cb3ae3594833b8471d6a924e87fbe91","cross_cats_sorted":["cs.CV","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-10-23T11:28:06Z","title_canon_sha256":"edd531099207316af4c2277ea765d18033fae257c5d1df461f222ef5add265dc"},"schema_version":"1.0","source":{"id":"1510.06895","kind":"arxiv","version":1}},"canonical_sha256":"9f2757a88d9c53edf8c16a18ba9805b012da13b19d526020e9c811bb1b4bed8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2757a88d9c53edf8c16a18ba9805b012da13b19d526020e9c811bb1b4bed8d","first_computed_at":"2026-05-18T01:22:35.138023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:35.138023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ljKm1LV9/vnDzxjqVJVMt+KivlHbF/7VI9a900qfLB0T/4fVk4ZajhvzXfHuAttBUz1wuPt7fjPj3zGsYgaYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:35.138519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06895","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8612f643ecd2f2304793c3906a6a6357a634d6f93b8017a54f2c54e1ae8bc899","sha256:d402e9e7d131a30984aed4a7383acc25a857195875bc69431c2c6f5cddd76a47"],"state_sha256":"7adc69d788d933f4dbd7750f313ce1bb6fc0f52a903a97d5bbae3540ee85f08f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xfO5/zB0n3Ep6CCHcXBmASxqdd27/WRKEWIz/gM2dk4ckzKouQF4GlRiBAk0CAulfjEmgYdM0aKR5Zg0uVgvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:44:54.929526Z","bundle_sha256":"84406ec6061bb126a93120e8831f62789b4454ed47b5bb36b19a2ebfda0f1594"}}