{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RXCA5CCDT3DIYCIYRWWOASSXD4","short_pith_number":"pith:RXCA5CCD","canonical_record":{"source":{"id":"1710.07205","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-19T15:55:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"99d3ba372781016c4467254081c2fc081566a280ced5d9e1cada684bf8e849d6","abstract_canon_sha256":"8a1f4c33d8c396721a8b6f23cc863dee67393fcb41c9be4afd88b1a076d1a616"},"schema_version":"1.0"},"canonical_sha256":"8dc40e88439ec68c09188dace04a571f345c1e0b97563379de90e826f3d37599","source":{"kind":"arxiv","id":"1710.07205","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07205","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07205v4","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07205","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"RXCA5CCDT3DI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXCA5CCDT3DIYCIY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXCA5CCD","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RXCA5CCDT3DIYCIYRWWOASSXD4","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07205","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-19T15:55:27Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"99d3ba372781016c4467254081c2fc081566a280ced5d9e1cada684bf8e849d6","abstract_canon_sha256":"8a1f4c33d8c396721a8b6f23cc863dee67393fcb41c9be4afd88b1a076d1a616"},"schema_version":"1.0"},"canonical_sha256":"8dc40e88439ec68c09188dace04a571f345c1e0b97563379de90e826f3d37599","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.479875Z","signature_b64":"g1m2zSmjkUc0uAlXDMW7UoacDPBFSfvHmZs2XYiHVZFbxJ1o+D0w1gvxtiNaAF0ZGaR6DTvTMh67e54eZ9npDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc40e88439ec68c09188dace04a571f345c1e0b97563379de90e826f3d37599","last_reissued_at":"2026-05-18T00:05:05.479467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.479467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07205","source_version":4,"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-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBj10iRJOkIgmHmOQqkTUTcJijzmW7piCNuR3KYQ6C8n0YoGzC+15jYD5b2QfSIA7xUWnnRgymCydLZ0pQKbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:37:12.909977Z"},"content_sha256":"9bb30e84e991f3d812c94b1a1dbbb2b21c3a2ad8f3538e6b91f5fa6c79b61913","schema_version":"1.0","event_id":"sha256:9bb30e84e991f3d812c94b1a1dbbb2b21c3a2ad8f3538e6b91f5fa6c79b61913"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RXCA5CCDT3DIYCIYRWWOASSXD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Robust Matrix Factorization with Nonconvex Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"James T. Kwok, Quanming Yao","submitted_at":"2017-10-19T15:55:27Z","abstract_excerpt":"Robust matrix factorization (RMF), which uses the $\\ell_1$-loss, often outperforms standard matrix factorization using the $\\ell_2$-loss, particularly when outliers are present. The state-of-the-art RMF solver is the RMF-MM algorithm, which, however, cannot utilize data sparsity. Moreover, sometimes even the (convex) $\\ell_1$-loss is not robust enough. In this paper, we propose the use of nonconvex loss to enhance robustness. To address the resultant difficult optimization problem, we use majorization-minimization (MM) optimization and propose a new MM surrogate. To improve scalability, we exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07205","kind":"arxiv","version":4},"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-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfy17l1lC5mgAGHNkaOY57U0ECWYtWTmvS67LF6ORHLK9hJBAaoFfR0qdHSMpBF8/AfIp5mDt5UtdZOFPZ9yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:37:12.910574Z"},"content_sha256":"55560a9e68fae057177d72ecd0da3651203b19fd5db073999dd0e1d1a73d407c","schema_version":"1.0","event_id":"sha256:55560a9e68fae057177d72ecd0da3651203b19fd5db073999dd0e1d1a73d407c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/bundle.json","state_url":"https://pith.science/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/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-05T05:37:12Z","links":{"resolver":"https://pith.science/pith/RXCA5CCDT3DIYCIYRWWOASSXD4","bundle":"https://pith.science/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/bundle.json","state":"https://pith.science/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXCA5CCDT3DIYCIYRWWOASSXD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RXCA5CCDT3DIYCIYRWWOASSXD4","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":"8a1f4c33d8c396721a8b6f23cc863dee67393fcb41c9be4afd88b1a076d1a616","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-19T15:55:27Z","title_canon_sha256":"99d3ba372781016c4467254081c2fc081566a280ced5d9e1cada684bf8e849d6"},"schema_version":"1.0","source":{"id":"1710.07205","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07205","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07205v4","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07205","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"RXCA5CCDT3DI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXCA5CCDT3DIYCIY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXCA5CCD","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:55560a9e68fae057177d72ecd0da3651203b19fd5db073999dd0e1d1a73d407c","target":"graph","created_at":"2026-05-18T00:05:05Z","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 matrix factorization (RMF), which uses the $\\ell_1$-loss, often outperforms standard matrix factorization using the $\\ell_2$-loss, particularly when outliers are present. The state-of-the-art RMF solver is the RMF-MM algorithm, which, however, cannot utilize data sparsity. Moreover, sometimes even the (convex) $\\ell_1$-loss is not robust enough. In this paper, we propose the use of nonconvex loss to enhance robustness. To address the resultant difficult optimization problem, we use majorization-minimization (MM) optimization and propose a new MM surrogate. To improve scalability, we exp","authors_text":"James T. Kwok, Quanming Yao","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-19T15:55:27Z","title":"Scalable Robust Matrix Factorization with Nonconvex Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07205","kind":"arxiv","version":4},"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:9bb30e84e991f3d812c94b1a1dbbb2b21c3a2ad8f3538e6b91f5fa6c79b61913","target":"record","created_at":"2026-05-18T00:05:05Z","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":"8a1f4c33d8c396721a8b6f23cc863dee67393fcb41c9be4afd88b1a076d1a616","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-10-19T15:55:27Z","title_canon_sha256":"99d3ba372781016c4467254081c2fc081566a280ced5d9e1cada684bf8e849d6"},"schema_version":"1.0","source":{"id":"1710.07205","kind":"arxiv","version":4}},"canonical_sha256":"8dc40e88439ec68c09188dace04a571f345c1e0b97563379de90e826f3d37599","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dc40e88439ec68c09188dace04a571f345c1e0b97563379de90e826f3d37599","first_computed_at":"2026-05-18T00:05:05.479467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:05.479467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1m2zSmjkUc0uAlXDMW7UoacDPBFSfvHmZs2XYiHVZFbxJ1o+D0w1gvxtiNaAF0ZGaR6DTvTMh67e54eZ9npDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:05.479875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07205","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bb30e84e991f3d812c94b1a1dbbb2b21c3a2ad8f3538e6b91f5fa6c79b61913","sha256:55560a9e68fae057177d72ecd0da3651203b19fd5db073999dd0e1d1a73d407c"],"state_sha256":"59190ef3bffc653a6ff1f68ea026a2c65b3674a860487108cc458e1733675233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MfG5EdsD7k15RdA3dHJZmERlvvPnQTvDBOPzhv5y47tU71/4WXS3sLEhFU5MCqFHpuA6IqDmApz136m9Y+rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:37:12.913876Z","bundle_sha256":"0724c2892080331133bf2feb76ebdcd841ccf6dd440897de6de69afac5d02ddd"}}