{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JQG4NOC6WPZJ5IMFK47SHIGWZU","short_pith_number":"pith:JQG4NOC6","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"},"canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","source":{"kind":"arxiv","id":"1503.01444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01444","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01444v2","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01444","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"JQG4NOC6WPZJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JQG4NOC6WPZJ5IMF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JQG4NOC6","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JQG4NOC6WPZJ5IMFK47SHIGWZU","target":"record","payload":{"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"},"canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","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"},"source_kind":"arxiv","source_id":"1503.01444","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-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tR5MzeJCjUPSNPoUCUViRmSq8X8p3zAvxGZZlCCmTe4Xy7TC7HJEw0UFKfbnV19Nnsv2e0h7QktIET5h3PmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:38:21.610683Z"},"content_sha256":"dc5947ffe3fb4e8e843f1fc85feae75164659a5492c8039a83addff1ede0ce75","schema_version":"1.0","event_id":"sha256:dc5947ffe3fb4e8e843f1fc85feae75164659a5492c8039a83addff1ede0ce75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JQG4NOC6WPZJ5IMFK47SHIGWZU","target":"graph","payload":{"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"},"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-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tADY3yt1xYhMzuTjXtpkU6OSvBdIMnzIhCeDBsB+BiaRcIRWR+fGuA4EhMzWnSXDVpLepXLtX7j6jPTWdu0UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:38:21.611377Z"},"content_sha256":"fc00615d98b7557119337b5bd55cb1befe21855221ac9ce31b36ba23ce0ff372","schema_version":"1.0","event_id":"sha256:fc00615d98b7557119337b5bd55cb1befe21855221ac9ce31b36ba23ce0ff372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/bundle.json","state_url":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/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-10T23:38:21Z","links":{"resolver":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU","bundle":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/bundle.json","state":"https://pith.science/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQG4NOC6WPZJ5IMFK47SHIGWZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JQG4NOC6WPZJ5IMFK47SHIGWZU","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":"337f4d038297b2692eaececec5adafe02900996fbbf2acb46a5c833da8997816","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-04T20:14:35Z","title_canon_sha256":"6e88a35ac712e61dc29defdf3c4b72c73f8fc4b45307f2b42179e360cc2f1a7c"},"schema_version":"1.0","source":{"id":"1503.01444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01444","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01444v2","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01444","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"JQG4NOC6WPZJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JQG4NOC6WPZJ5IMF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JQG4NOC6","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:fc00615d98b7557119337b5bd55cb1befe21855221ac9ce31b36ba23ce0ff372","target":"graph","created_at":"2026-05-17T23:53:58Z","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":"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","authors_text":"Hyeongwoo Kim, In So Kweon, Jean-Charles Bazin, Tae-Hyun Oh, Yu-Wing Tai","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-04T20:14:35Z","title":"Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01444","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:dc5947ffe3fb4e8e843f1fc85feae75164659a5492c8039a83addff1ede0ce75","target":"record","created_at":"2026-05-17T23:53:58Z","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":"337f4d038297b2692eaececec5adafe02900996fbbf2acb46a5c833da8997816","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-04T20:14:35Z","title_canon_sha256":"6e88a35ac712e61dc29defdf3c4b72c73f8fc4b45307f2b42179e360cc2f1a7c"},"schema_version":"1.0","source":{"id":"1503.01444","kind":"arxiv","version":2}},"canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c0dc6b85eb3f29ea185573f23a0d6cd3eed6f81447a1fa2a8056746906887aa","first_computed_at":"2026-05-17T23:53:58.264517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:58.264517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/YlniFATPiflqHwLO8c3IO30BDU8nO6zJLfsKQZDZ5gGpFRlBso+T/HdRdH3cBNVrUBiXpmO93umWFF900aSDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:58.265343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5947ffe3fb4e8e843f1fc85feae75164659a5492c8039a83addff1ede0ce75","sha256:fc00615d98b7557119337b5bd55cb1befe21855221ac9ce31b36ba23ce0ff372"],"state_sha256":"c8e79bc868cee4f84a1e1e978b465a277cadc7be214ce401b16fd6da1b77711d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ztc97LsDn4szP9NDT2lrwSD/r/x6QW+MCWQR031kMJ2j+xF6SMoNjX7uxbpo0KmxtzY4qo9iYJCzbnZ57ikCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:38:21.615102Z","bundle_sha256":"2bf437cc3a43a6ebb6c830aeddfb82b90b568f9fcc25baa67f64527be23eb598"}}