{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RQGGXO22LHJ3VIYY3JT67HO62W","short_pith_number":"pith:RQGGXO22","canonical_record":{"source":{"id":"2501.00677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T23:22:12Z","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"title_canon_sha256":"b3453c699759e99197454b3aee148aac88dcb3201983727cfa7fff181b7f8e66","abstract_canon_sha256":"4d8eceda6e374676016c4436d85afac0ff82dcb320b8860e626ab914771c37bd"},"schema_version":"1.0"},"canonical_sha256":"8c0c6bbb5a59d3baa318da67ef9dded586952ac4f4d4bd215525ee3e39791c6b","source":{"kind":"arxiv","id":"2501.00677","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00677","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00677v2","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00677","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"RQGGXO22LHJ3","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_16","alias_value":"RQGGXO22LHJ3VIYY","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_8","alias_value":"RQGGXO22","created_at":"2026-05-22T01:03:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RQGGXO22LHJ3VIYY3JT67HO62W","target":"record","payload":{"canonical_record":{"source":{"id":"2501.00677","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T23:22:12Z","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"title_canon_sha256":"b3453c699759e99197454b3aee148aac88dcb3201983727cfa7fff181b7f8e66","abstract_canon_sha256":"4d8eceda6e374676016c4436d85afac0ff82dcb320b8860e626ab914771c37bd"},"schema_version":"1.0"},"canonical_sha256":"8c0c6bbb5a59d3baa318da67ef9dded586952ac4f4d4bd215525ee3e39791c6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:14.213334Z","signature_b64":"SrMqDw26QlY7ymZ8nG0PlJsjT27F9vE1+8TjjEMKyP2LNF1cP99ufuP6NFBP3od+87EL82XBdgIXNgPB+2neDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0c6bbb5a59d3baa318da67ef9dded586952ac4f4d4bd215525ee3e39791c6b","last_reissued_at":"2026-05-22T01:03:14.212533Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:14.212533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.00677","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-22T01:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRRgKChCQOnhQ88xCmPVq5YSETUfV7V87oJgy1qvDWrwtcATdIx+036Di04Wyx3MVDR6WFK8zE3+piuu8jSvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:22:42.250738Z"},"content_sha256":"355b068d7fbb560d314cdd0b996db340e683c2904fb1d4d237d48410ad1ca984","schema_version":"1.0","event_id":"sha256:355b068d7fbb560d314cdd0b996db340e683c2904fb1d4d237d48410ad1ca984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RQGGXO22LHJ3VIYY3JT67HO62W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chandra Kundu, HanQin Cai, Jialin Liu, Wotao Yin","submitted_at":"2024-12-31T23:22:12Z","abstract_excerpt":"Robust matrix completion (RMC) is a widely used machine learning tool that simultaneously tackles two critical issues in low-rank data analysis: missing data entries and extreme outliers. This paper proposes a novel scalable and learnable non-convex approach, coined Learned Robust Matrix Completion (LRMC), for large-scale RMC problems. LRMC enjoys low computational complexity with linear convergence. Motivated by the proposed theorem, the free parameters of LRMC can be effectively learned via deep unfolding to achieve optimum performance. Furthermore, this paper proposes a flexible feedforward"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00677","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.00677/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-22T01:03:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hm761Jwnp2l9U2llKFdHSqvphi3iJvBLiH+8nnD9+M8Ri5Mxi5j9U13juMifC7fhmjTFnqV+6WYtLrI8ZKtVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:22:42.251455Z"},"content_sha256":"ce3a3686f9f1ddb19c52822b45dc2b63777864d3c9e9a11577df0609d7bf85ba","schema_version":"1.0","event_id":"sha256:ce3a3686f9f1ddb19c52822b45dc2b63777864d3c9e9a11577df0609d7bf85ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQGGXO22LHJ3VIYY3JT67HO62W/bundle.json","state_url":"https://pith.science/pith/RQGGXO22LHJ3VIYY3JT67HO62W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQGGXO22LHJ3VIYY3JT67HO62W/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-30T07:22:42Z","links":{"resolver":"https://pith.science/pith/RQGGXO22LHJ3VIYY3JT67HO62W","bundle":"https://pith.science/pith/RQGGXO22LHJ3VIYY3JT67HO62W/bundle.json","state":"https://pith.science/pith/RQGGXO22LHJ3VIYY3JT67HO62W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQGGXO22LHJ3VIYY3JT67HO62W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RQGGXO22LHJ3VIYY3JT67HO62W","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":"4d8eceda6e374676016c4436d85afac0ff82dcb320b8860e626ab914771c37bd","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T23:22:12Z","title_canon_sha256":"b3453c699759e99197454b3aee148aac88dcb3201983727cfa7fff181b7f8e66"},"schema_version":"1.0","source":{"id":"2501.00677","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00677","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00677v2","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00677","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_12","alias_value":"RQGGXO22LHJ3","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_16","alias_value":"RQGGXO22LHJ3VIYY","created_at":"2026-05-22T01:03:14Z"},{"alias_kind":"pith_short_8","alias_value":"RQGGXO22","created_at":"2026-05-22T01:03:14Z"}],"graph_snapshots":[{"event_id":"sha256:ce3a3686f9f1ddb19c52822b45dc2b63777864d3c9e9a11577df0609d7bf85ba","target":"graph","created_at":"2026-05-22T01:03:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.00677/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust matrix completion (RMC) is a widely used machine learning tool that simultaneously tackles two critical issues in low-rank data analysis: missing data entries and extreme outliers. This paper proposes a novel scalable and learnable non-convex approach, coined Learned Robust Matrix Completion (LRMC), for large-scale RMC problems. LRMC enjoys low computational complexity with linear convergence. Motivated by the proposed theorem, the free parameters of LRMC can be effectively learned via deep unfolding to achieve optimum performance. Furthermore, this paper proposes a flexible feedforward","authors_text":"Chandra Kundu, HanQin Cai, Jialin Liu, Wotao Yin","cross_cats":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T23:22:12Z","title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00677","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:355b068d7fbb560d314cdd0b996db340e683c2904fb1d4d237d48410ad1ca984","target":"record","created_at":"2026-05-22T01:03:14Z","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":"4d8eceda6e374676016c4436d85afac0ff82dcb320b8860e626ab914771c37bd","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-31T23:22:12Z","title_canon_sha256":"b3453c699759e99197454b3aee148aac88dcb3201983727cfa7fff181b7f8e66"},"schema_version":"1.0","source":{"id":"2501.00677","kind":"arxiv","version":2}},"canonical_sha256":"8c0c6bbb5a59d3baa318da67ef9dded586952ac4f4d4bd215525ee3e39791c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c0c6bbb5a59d3baa318da67ef9dded586952ac4f4d4bd215525ee3e39791c6b","first_computed_at":"2026-05-22T01:03:14.212533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:14.212533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrMqDw26QlY7ymZ8nG0PlJsjT27F9vE1+8TjjEMKyP2LNF1cP99ufuP6NFBP3od+87EL82XBdgIXNgPB+2neDg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:14.213334Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00677","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:355b068d7fbb560d314cdd0b996db340e683c2904fb1d4d237d48410ad1ca984","sha256:ce3a3686f9f1ddb19c52822b45dc2b63777864d3c9e9a11577df0609d7bf85ba"],"state_sha256":"b0bef3856941fc61f06ae325a85e8b598d5d191113b3349ae46498848c1ba362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxxFm8SqWPk3lpA72xazfS/7rNHdDsYtI/PKC9fVpwe1NZ1HPGMI3OE3LBeOG8RM69pzCGVrFLZbm+9w7VRaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:22:42.257051Z","bundle_sha256":"b8cdb5ff551f1434df4650c8a3696142017b813ed14978d8acf59532b44c3f19"}}