{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WVOT7N7JEFMWUZ2R4WA3PG55JG","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":"37f93a85019c414f91f76430374570b49352b4208ecf9b5da7eedd797fd0da3f","cross_cats_sorted":["cs.CV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-22T14:52:22Z","title_canon_sha256":"c7d301e8d85b2e0193132c4c0e126d1fbd581b5ee98075236c2cda11af107d5d"},"schema_version":"1.0","source":{"id":"1011.4829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.4829","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.4829v2","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4829","created_at":"2026-05-18T04:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"WVOT7N7JEFMW","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WVOT7N7JEFMWUZ2R","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WVOT7N7J","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:6078bd74a91ca230ee923fda94fb28138b2ab99fae6c04917e4b013a63f82a4c","target":"graph","created_at":"2026-05-18T04:34:54Z","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":"It is an efficient and effective strategy to utilize the nuclear norm approximation to learn low-rank matrices, which arise frequently in machine learning and computer vision. So the exploration of nuclear norm minimization problems is gaining much attention recently. In this paper we shall prove that the following Low-Rank Representation (LRR) \\cite{icml_2010_lrr,lrr_extention} problem: {eqnarray*} \\min_{Z} \\norm{Z}_*, & {s.t.,} & X=AZ, {eqnarray*} has a unique and closed-form solution, where $X$ and $A$ are given matrices. The proof is based on proving a lemma that allows us to get closed-fo","authors_text":"Guangcan Liu, Ju Sun, Shuicheng Yan","cross_cats":["cs.CV","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-22T14:52:22Z","title":"Closed-Form Solutions to A Category of Nuclear Norm Minimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4829","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:08d0aeeddbf4e962c50e94dc89aebc826f6e1292cbed11080bd88ec7a07b7ae1","target":"record","created_at":"2026-05-18T04:34:54Z","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":"37f93a85019c414f91f76430374570b49352b4208ecf9b5da7eedd797fd0da3f","cross_cats_sorted":["cs.CV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-22T14:52:22Z","title_canon_sha256":"c7d301e8d85b2e0193132c4c0e126d1fbd581b5ee98075236c2cda11af107d5d"},"schema_version":"1.0","source":{"id":"1011.4829","kind":"arxiv","version":2}},"canonical_sha256":"b55d3fb7e921596a6751e581b79bbd4992b955c7fc1556ff5a2b816caf766ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b55d3fb7e921596a6751e581b79bbd4992b955c7fc1556ff5a2b816caf766ffa","first_computed_at":"2026-05-18T04:34:54.981129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:54.981129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LBhVTigF5fmtytHh9eaFUKGL51s2Tb7GFlO6J0mUV2xEQlKYqK77VD+G4xeSS2c4YBnuGJHclo5q5M5U1XWhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:54.981483Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.4829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08d0aeeddbf4e962c50e94dc89aebc826f6e1292cbed11080bd88ec7a07b7ae1","sha256:6078bd74a91ca230ee923fda94fb28138b2ab99fae6c04917e4b013a63f82a4c"],"state_sha256":"bcc9b5b2bd190edd13753e7e12e2e8c49a3aef3ee38d157e816510e62f9ab94d"}