{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IS3LC4STJUTSDOZD677ZTYN7XP","short_pith_number":"pith:IS3LC4ST","canonical_record":{"source":{"id":"1309.1539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-06T05:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"d726109a13b30dc33c59f7f94ee738e4a90210e57af4dc395512a70e05611495","abstract_canon_sha256":"6d348de37ea2a5189dff9046100eb13cf8507aa5010eb111c76d0884421a0e59"},"schema_version":"1.0"},"canonical_sha256":"44b6b172534d2721bb23f7ff99e1bfbbeec9b2cfb2c54d6b8073def30fdadbfe","source":{"kind":"arxiv","id":"1309.1539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1539","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1539v2","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1539","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"IS3LC4STJUTS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IS3LC4STJUTSDOZD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IS3LC4ST","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IS3LC4STJUTSDOZD677ZTYN7XP","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-06T05:38:32Z","cross_cats_sorted":[],"title_canon_sha256":"d726109a13b30dc33c59f7f94ee738e4a90210e57af4dc395512a70e05611495","abstract_canon_sha256":"6d348de37ea2a5189dff9046100eb13cf8507aa5010eb111c76d0884421a0e59"},"schema_version":"1.0"},"canonical_sha256":"44b6b172534d2721bb23f7ff99e1bfbbeec9b2cfb2c54d6b8073def30fdadbfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.338930Z","signature_b64":"BO9knH7vvNBtrHZfhhWM/N8+ThQud8VXkxv4+QnBpj+yz9Q80oZwMnFrQSuQw5OdKBntPVIT+JToE+L40I36DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b6b172534d2721bb23f7ff99e1bfbbeec9b2cfb2c54d6b8073def30fdadbfe","last_reissued_at":"2026-05-18T02:39:17.338480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.338480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1539","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-18T02:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97zCjom1735CZww6m53a4f8BcTMAastG7Mez+4a6P1qFSL7/eSB19nnMDrq1hoyRoHXiClMKFTJSNlZCD0MpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:42:05.698179Z"},"content_sha256":"ca032058bcefbbe6385610e864b5aa9540151e01f740791a3e741dfaaeebd678","schema_version":"1.0","event_id":"sha256:ca032058bcefbbe6385610e864b5aa9540151e01f740791a3e741dfaaeebd678"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IS3LC4STJUTSDOZD677ZTYN7XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Choon Meng Lee, Kim-Chuan Toh, Loong-Fah Cheong, Yu-Xiang Wang","submitted_at":"2013-09-06T05:38:32Z","abstract_excerpt":"Low-rank matrix completion is a problem of immense practical importance. Recent works on the subject often use nuclear norm as a convex surrogate of the rank function. Despite its solid theoretical foundation, the convex version of the problem often fails to work satisfactorily in real-life applications. Real data often suffer from very few observations, with support not meeting the random requirements, ubiquitous presence of noise and potentially gross corruptions, sometimes with these simultaneously occurring.\n  This paper proposes a Proximal Alternating Robust Subspace Minimization (PARSuMi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1539","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-18T02:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rjy6WRz+lcyJPFbOD1xv0o6hgO7oOoMFbuZb7TA9q0sDeEKXmPfSO8HF4AEbSR+eFDVG4HqyxDvNueWpD02ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:42:05.698875Z"},"content_sha256":"23ee22effad6de7e303bd31b7cdbbe89e83cf2bf704f9064f962b570bdb6ddb5","schema_version":"1.0","event_id":"sha256:23ee22effad6de7e303bd31b7cdbbe89e83cf2bf704f9064f962b570bdb6ddb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS3LC4STJUTSDOZD677ZTYN7XP/bundle.json","state_url":"https://pith.science/pith/IS3LC4STJUTSDOZD677ZTYN7XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS3LC4STJUTSDOZD677ZTYN7XP/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-05-25T14:42:05Z","links":{"resolver":"https://pith.science/pith/IS3LC4STJUTSDOZD677ZTYN7XP","bundle":"https://pith.science/pith/IS3LC4STJUTSDOZD677ZTYN7XP/bundle.json","state":"https://pith.science/pith/IS3LC4STJUTSDOZD677ZTYN7XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS3LC4STJUTSDOZD677ZTYN7XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IS3LC4STJUTSDOZD677ZTYN7XP","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":"6d348de37ea2a5189dff9046100eb13cf8507aa5010eb111c76d0884421a0e59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-06T05:38:32Z","title_canon_sha256":"d726109a13b30dc33c59f7f94ee738e4a90210e57af4dc395512a70e05611495"},"schema_version":"1.0","source":{"id":"1309.1539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1539","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1539v2","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1539","created_at":"2026-05-18T02:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"IS3LC4STJUTS","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IS3LC4STJUTSDOZD","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IS3LC4ST","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:23ee22effad6de7e303bd31b7cdbbe89e83cf2bf704f9064f962b570bdb6ddb5","target":"graph","created_at":"2026-05-18T02:39:17Z","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 matrix completion is a problem of immense practical importance. Recent works on the subject often use nuclear norm as a convex surrogate of the rank function. Despite its solid theoretical foundation, the convex version of the problem often fails to work satisfactorily in real-life applications. Real data often suffer from very few observations, with support not meeting the random requirements, ubiquitous presence of noise and potentially gross corruptions, sometimes with these simultaneously occurring.\n  This paper proposes a Proximal Alternating Robust Subspace Minimization (PARSuMi","authors_text":"Choon Meng Lee, Kim-Chuan Toh, Loong-Fah Cheong, Yu-Xiang Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-06T05:38:32Z","title":"Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1539","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:ca032058bcefbbe6385610e864b5aa9540151e01f740791a3e741dfaaeebd678","target":"record","created_at":"2026-05-18T02:39:17Z","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":"6d348de37ea2a5189dff9046100eb13cf8507aa5010eb111c76d0884421a0e59","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-06T05:38:32Z","title_canon_sha256":"d726109a13b30dc33c59f7f94ee738e4a90210e57af4dc395512a70e05611495"},"schema_version":"1.0","source":{"id":"1309.1539","kind":"arxiv","version":2}},"canonical_sha256":"44b6b172534d2721bb23f7ff99e1bfbbeec9b2cfb2c54d6b8073def30fdadbfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b6b172534d2721bb23f7ff99e1bfbbeec9b2cfb2c54d6b8073def30fdadbfe","first_computed_at":"2026-05-18T02:39:17.338480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:17.338480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BO9knH7vvNBtrHZfhhWM/N8+ThQud8VXkxv4+QnBpj+yz9Q80oZwMnFrQSuQw5OdKBntPVIT+JToE+L40I36DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:17.338930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca032058bcefbbe6385610e864b5aa9540151e01f740791a3e741dfaaeebd678","sha256:23ee22effad6de7e303bd31b7cdbbe89e83cf2bf704f9064f962b570bdb6ddb5"],"state_sha256":"07c45241ee6ad57c0764aad13cff46c945bf69f19fecd97ee0a5922903c8efe8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lom2YMN5l3dMy6/w+j78fOznyd/G5+vVIc/tyRzie4UMeXoKA8wyhhdJ4Q3VtgX8rt1umx44tqmO/yaMM6ySDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:42:05.702852Z","bundle_sha256":"4e0deebae0ec4a7d89cff2ac4d9b19583f191c92f7158403c8c08c32d9357b36"}}