{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JQG4NOC6WPZJ5IMFK47SHIGWZU","short_pith_number":"pith:JQG4NOC6","schema_version":"1.0","canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","source":{"kind":"arxiv","id":"1503.01444","version":2},"attestation_state":"computed","paper":{"title":"Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Hyeongwoo Kim, In So Kweon, Jean-Charles Bazin, Tae-Hyun Oh, Yu-Wing Tai","submitted_at":"2015-03-04T20:14:35Z","abstract_excerpt":"Robust Principal Component Analysis (RPCA) via rank minimization is a powerful tool for recovering underlying low-rank structure of clean data corrupted with sparse noise/outliers. In many low-level vision problems, not only it is known that the underlying structure of clean data is low-rank, but the exact rank of clean data is also known. Yet, when applying conventional rank minimization for those problems, the objective function is formulated in a way that does not fully utilize a priori target rank information about the problems. This observation motivates us to investigate whether there is"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.01444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-04T20:14:35Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"6e88a35ac712e61dc29defdf3c4b72c73f8fc4b45307f2b42179e360cc2f1a7c","abstract_canon_sha256":"337f4d038297b2692eaececec5adafe02900996fbbf2acb46a5c833da8997816"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.265343Z","signature_b64":"/YlniFATPiflqHwLO8c3IO30BDU8nO6zJLfsKQZDZ5gGpFRlBso+T/HdRdH3cBNVrUBiXpmO93umWFF900aSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","last_reissued_at":"2026-05-17T23:53:58.264517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.264517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Hyeongwoo Kim, In So Kweon, Jean-Charles Bazin, Tae-Hyun Oh, Yu-Wing Tai","submitted_at":"2015-03-04T20:14:35Z","abstract_excerpt":"Robust Principal Component Analysis (RPCA) via rank minimization is a powerful tool for recovering underlying low-rank structure of clean data corrupted with sparse noise/outliers. In many low-level vision problems, not only it is known that the underlying structure of clean data is low-rank, but the exact rank of clean data is also known. Yet, when applying conventional rank minimization for those problems, the objective function is formulated in a way that does not fully utilize a priori target rank information about the problems. This observation motivates us to investigate whether there is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01444","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.01444","created_at":"2026-05-17T23:53:58.264645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01444v2","created_at":"2026-05-17T23:53:58.264645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01444","created_at":"2026-05-17T23:53:58.264645+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQG4NOC6WPZJ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQG4NOC6WPZJ5IMF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQG4NOC6","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU","json":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU.json","graph_json":"https://pith.science/api/pith-number/JQG4NOC6WPZJ5IMFK47SHIGWZU/graph.json","events_json":"https://pith.science/api/pith-number/JQG4NOC6WPZJ5IMFK47SHIGWZU/events.json","paper":"https://pith.science/paper/JQG4NOC6"},"agent_actions":{"view_html":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU","download_json":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU.json","view_paper":"https://pith.science/paper/JQG4NOC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01444&json=true","fetch_graph":"https://pith.science/api/pith-number/JQG4NOC6WPZJ5IMFK47SHIGWZU/graph.json","fetch_events":"https://pith.science/api/pith-number/JQG4NOC6WPZJ5IMFK47SHIGWZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/action/storage_attestation","attest_author":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/action/author_attestation","sign_citation":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/action/citation_signature","submit_replication":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/action/replication_record"}},"created_at":"2026-05-17T23:53:58.264645+00:00","updated_at":"2026-05-17T23:53:58.264645+00:00"}