{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5OQ6XPU2N7EKSTWZEINJAGHRYL","short_pith_number":"pith:5OQ6XPU2","canonical_record":{"source":{"id":"1409.1062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-03T12:36:25Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"e274e60ea3814b72b56eebff3023b505b9aede7c76f1861b4305a1c401ac13d7","abstract_canon_sha256":"3b5b3edd6714d0ee19bd8b739f224bd6679851f82ab9305ec3a9b987fc800b3a"},"schema_version":"1.0"},"canonical_sha256":"eba1ebbe9a6fc8a94ed9221a9018f1c2dc0ad2f58edb1b9ed5de86af1a77fe3f","source":{"kind":"arxiv","id":"1409.1062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1062","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1062v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1062","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"5OQ6XPU2N7EK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5OQ6XPU2N7EKSTWZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5OQ6XPU2","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5OQ6XPU2N7EKSTWZEINJAGHRYL","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-03T12:36:25Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"e274e60ea3814b72b56eebff3023b505b9aede7c76f1861b4305a1c401ac13d7","abstract_canon_sha256":"3b5b3edd6714d0ee19bd8b739f224bd6679851f82ab9305ec3a9b987fc800b3a"},"schema_version":"1.0"},"canonical_sha256":"eba1ebbe9a6fc8a94ed9221a9018f1c2dc0ad2f58edb1b9ed5de86af1a77fe3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:44.432446Z","signature_b64":"Cd+usAKZg1mhpROg3CVSr7D+Y6pZpl3v26hEsRbypHtui06ztAW/jujbxw3DDJRHlpbRhsnqdmoGaFK4Q9KbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eba1ebbe9a6fc8a94ed9221a9018f1c2dc0ad2f58edb1b9ed5de86af1a77fe3f","last_reissued_at":"2026-05-18T02:43:44.432056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:44.432056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1062","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-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8wZQZ+gICJKPY3EA79CP2xB78vABxw5H4Cd2ENDf+sv64Ll4PJ+Gu48xKaHpujqBv8pcyP9jmJFM2Zr8UKWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:42:35.221648Z"},"content_sha256":"e43757776c420969ba87e2a905cc4aa84f64d91e5fe58e7e309518da12535bbf","schema_version":"1.0","event_id":"sha256:e43757776c420969ba87e2a905cc4aa84f64d91e5fe58e7e309518da12535bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5OQ6XPU2N7EKSTWZEINJAGHRYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fanhua Shang, Hanghang Tong, Hong Cheng, James Cheng, Yuanyuan Liu","submitted_at":"2014-09-03T12:36:25Z","abstract_excerpt":"Recovering low-rank and sparse matrices from incomplete or corrupted observations is an important problem in machine learning, statistics, bioinformatics, computer vision, as well as signal and image processing. In theory, this problem can be solved by the natural convex joint/mixed relaxations (i.e., l_{1}-norm and trace norm) under certain conditions. However, all current provable algorithms suffer from superlinear per-iteration cost, which severely limits their applicability to large-scale problems. In this paper, we propose a scalable, provable structured low-rank matrix factorization meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1062","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-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tq3dTGzT9AmvDrYS0cejuLOFPI2sSnQ5pwXZDVEenkoSWO3ebmsx6qSfjC4gLTI9isu7S4WR7TiR8Rje8A+HBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:42:35.222270Z"},"content_sha256":"a0ce5f7de5a132c01dd4f3456cfb9f2cac0e7fb55a466de8f195339afbc4f084","schema_version":"1.0","event_id":"sha256:a0ce5f7de5a132c01dd4f3456cfb9f2cac0e7fb55a466de8f195339afbc4f084"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/bundle.json","state_url":"https://pith.science/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/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-06T18:42:35Z","links":{"resolver":"https://pith.science/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL","bundle":"https://pith.science/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/bundle.json","state":"https://pith.science/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OQ6XPU2N7EKSTWZEINJAGHRYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5OQ6XPU2N7EKSTWZEINJAGHRYL","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":"3b5b3edd6714d0ee19bd8b739f224bd6679851f82ab9305ec3a9b987fc800b3a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-03T12:36:25Z","title_canon_sha256":"e274e60ea3814b72b56eebff3023b505b9aede7c76f1861b4305a1c401ac13d7"},"schema_version":"1.0","source":{"id":"1409.1062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1062","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1062v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1062","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"5OQ6XPU2N7EK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5OQ6XPU2N7EKSTWZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5OQ6XPU2","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:a0ce5f7de5a132c01dd4f3456cfb9f2cac0e7fb55a466de8f195339afbc4f084","target":"graph","created_at":"2026-05-18T02:43:44Z","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":"Recovering low-rank and sparse matrices from incomplete or corrupted observations is an important problem in machine learning, statistics, bioinformatics, computer vision, as well as signal and image processing. In theory, this problem can be solved by the natural convex joint/mixed relaxations (i.e., l_{1}-norm and trace norm) under certain conditions. However, all current provable algorithms suffer from superlinear per-iteration cost, which severely limits their applicability to large-scale problems. In this paper, we propose a scalable, provable structured low-rank matrix factorization meth","authors_text":"Fanhua Shang, Hanghang Tong, Hong Cheng, James Cheng, Yuanyuan Liu","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-03T12:36:25Z","title":"Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1062","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:e43757776c420969ba87e2a905cc4aa84f64d91e5fe58e7e309518da12535bbf","target":"record","created_at":"2026-05-18T02:43:44Z","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":"3b5b3edd6714d0ee19bd8b739f224bd6679851f82ab9305ec3a9b987fc800b3a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-03T12:36:25Z","title_canon_sha256":"e274e60ea3814b72b56eebff3023b505b9aede7c76f1861b4305a1c401ac13d7"},"schema_version":"1.0","source":{"id":"1409.1062","kind":"arxiv","version":1}},"canonical_sha256":"eba1ebbe9a6fc8a94ed9221a9018f1c2dc0ad2f58edb1b9ed5de86af1a77fe3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eba1ebbe9a6fc8a94ed9221a9018f1c2dc0ad2f58edb1b9ed5de86af1a77fe3f","first_computed_at":"2026-05-18T02:43:44.432056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:44.432056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cd+usAKZg1mhpROg3CVSr7D+Y6pZpl3v26hEsRbypHtui06ztAW/jujbxw3DDJRHlpbRhsnqdmoGaFK4Q9KbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:44.432446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e43757776c420969ba87e2a905cc4aa84f64d91e5fe58e7e309518da12535bbf","sha256:a0ce5f7de5a132c01dd4f3456cfb9f2cac0e7fb55a466de8f195339afbc4f084"],"state_sha256":"78190e3bcaa973aa0d01921d42587b96f731d4991c665f64f25254d3c34d08b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItZY1IPXJ1pmOBaNCscGHt2u8uYyFsuK74oKNiF6e6DviyPKqaH4NwyxbuIqF7Z0zIXZY0EdUkc3+b70BNu/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:42:35.225770Z","bundle_sha256":"64616a48e94b75ebe686f51f9e2b08c9cf6351f5df293a02b95fc38a5a1b5d7f"}}