{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GIBRLAPP4BOJBYVXQIOUSO6YYZ","short_pith_number":"pith:GIBRLAPP","schema_version":"1.0","canonical_sha256":"32031581efe05c90e2b7821d493bd8c6472e3a5c1811009e0089400eb433aa4d","source":{"kind":"arxiv","id":"1903.06055","version":1},"attestation_state":"computed","paper":{"title":"Robust Matrix Completion via Maximum Correntropy Criterion and Half Quadratic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Fei Wang, Jing Qin, Yicong He, Yingsong Li","submitted_at":"2019-03-14T14:50:34Z","abstract_excerpt":"Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises, where traditional methods for matrix completion may perform poorly due to utilizing $l_2$ error norm in optimization. In this paper, we propose a novel and fast robust matrix completion method based on maximum correntropy criterion (MCC). The correntropy based error measure is utilized instead of using $l_2$-based error norm to improve the robustness to noises. Using the half-quadratic optimization technique, the correntropy based optimization can be transformed to a weighted "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.06055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T14:50:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37bc392f979afef22b61fe45362d5e90361adf48b67c3a0100f2e3f1dd622cab","abstract_canon_sha256":"08bb74dc04dd75c73c9aae46838f6bf855d0d040f916c0a8232f3f07f2350f1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:25.284149Z","signature_b64":"tAETwuWOzFJSDEo7cAfDTUiottgcNKOKWI4Y54u3UepL26Vmhh827q2o3PvQ4ZojoUmwBJLXnMqvzxd9GkS8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32031581efe05c90e2b7821d493bd8c6472e3a5c1811009e0089400eb433aa4d","last_reissued_at":"2026-07-05T00:41:25.283617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:25.283617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Matrix Completion via Maximum Correntropy Criterion and Half Quadratic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Badong Chen, Fei Wang, Jing Qin, Yicong He, Yingsong Li","submitted_at":"2019-03-14T14:50:34Z","abstract_excerpt":"Robust matrix completion aims to recover a low-rank matrix from a subset of noisy entries perturbed by complex noises, where traditional methods for matrix completion may perform poorly due to utilizing $l_2$ error norm in optimization. In this paper, we propose a novel and fast robust matrix completion method based on maximum correntropy criterion (MCC). The correntropy based error measure is utilized instead of using $l_2$-based error norm to improve the robustness to noises. Using the half-quadratic optimization technique, the correntropy based optimization can be transformed to a weighted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.06055/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.06055","created_at":"2026-07-05T00:41:25.283696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06055v1","created_at":"2026-07-05T00:41:25.283696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06055","created_at":"2026-07-05T00:41:25.283696+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIBRLAPP4BOJ","created_at":"2026-07-05T00:41:25.283696+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIBRLAPP4BOJBYVX","created_at":"2026-07-05T00:41:25.283696+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIBRLAPP","created_at":"2026-07-05T00:41:25.283696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ","json":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ.json","graph_json":"https://pith.science/api/pith-number/GIBRLAPP4BOJBYVXQIOUSO6YYZ/graph.json","events_json":"https://pith.science/api/pith-number/GIBRLAPP4BOJBYVXQIOUSO6YYZ/events.json","paper":"https://pith.science/paper/GIBRLAPP"},"agent_actions":{"view_html":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ","download_json":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ.json","view_paper":"https://pith.science/paper/GIBRLAPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06055&json=true","fetch_graph":"https://pith.science/api/pith-number/GIBRLAPP4BOJBYVXQIOUSO6YYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GIBRLAPP4BOJBYVXQIOUSO6YYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ/action/storage_attestation","attest_author":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ/action/author_attestation","sign_citation":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ/action/citation_signature","submit_replication":"https://pith.science/pith/GIBRLAPP4BOJBYVXQIOUSO6YYZ/action/replication_record"}},"created_at":"2026-07-05T00:41:25.283696+00:00","updated_at":"2026-07-05T00:41:25.283696+00:00"}