{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6WD7I6CVJYA3MRKPVY7D6BRBZI","short_pith_number":"pith:6WD7I6CV","schema_version":"1.0","canonical_sha256":"f587f478554e01b6454fae3e3f0621ca24de1cf21de2761ca6b3df1096510496","source":{"kind":"arxiv","id":"1906.00495","version":1},"attestation_state":"computed","paper":{"title":"Truncated Cauchy Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Larry S. Davis, Naiyang Guan, Tongliang Liu, Yangmuzi Zhang","submitted_at":"2019-06-02T22:21:30Z","abstract_excerpt":"Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large errors, and develop a Truncated CauchyNMF to robustly learn the subspace on noisy datasets contaminated by outliers. We theoretically analyze the robustness of Truncated CauchyNMF comparing with the competing models and theoretically prove that Truncated CauchyNMF has a generaliza"},"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":"1906.00495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-02T22:21:30Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"732a0e0fd97e29563d4d811080bf94ad3166896a809d12254f13f185a44d6e1c","abstract_canon_sha256":"55cfc3675479a1a9faf9fa3a3980db5962ff49094714dac45ae11abf6f72f6aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:26.945044Z","signature_b64":"XdhPeETQkvEmYEsNIX+sTiR4fgYTI1lUmt9DNhwOND9GobYcWbaXlL3EatzxSG5yjbo4KnPj8nFY4xIacojiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f587f478554e01b6454fae3e3f0621ca24de1cf21de2761ca6b3df1096510496","last_reissued_at":"2026-05-17T23:44:26.944531Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:26.944531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truncated Cauchy Non-negative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Larry S. Davis, Naiyang Guan, Tongliang Liu, Yangmuzi Zhang","submitted_at":"2019-06-02T22:21:30Z","abstract_excerpt":"Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large errors, and develop a Truncated CauchyNMF to robustly learn the subspace on noisy datasets contaminated by outliers. We theoretically analyze the robustness of Truncated CauchyNMF comparing with the competing models and theoretically prove that Truncated CauchyNMF has a generaliza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00495","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.00495","created_at":"2026-05-17T23:44:26.944616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00495v1","created_at":"2026-05-17T23:44:26.944616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00495","created_at":"2026-05-17T23:44:26.944616+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WD7I6CVJYA3","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WD7I6CVJYA3MRKP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WD7I6CV","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19325","citing_title":"An Exterior Method for Nonnegative Matrix Factorization","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI","json":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI.json","graph_json":"https://pith.science/api/pith-number/6WD7I6CVJYA3MRKPVY7D6BRBZI/graph.json","events_json":"https://pith.science/api/pith-number/6WD7I6CVJYA3MRKPVY7D6BRBZI/events.json","paper":"https://pith.science/paper/6WD7I6CV"},"agent_actions":{"view_html":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI","download_json":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI.json","view_paper":"https://pith.science/paper/6WD7I6CV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00495&json=true","fetch_graph":"https://pith.science/api/pith-number/6WD7I6CVJYA3MRKPVY7D6BRBZI/graph.json","fetch_events":"https://pith.science/api/pith-number/6WD7I6CVJYA3MRKPVY7D6BRBZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI/action/storage_attestation","attest_author":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI/action/author_attestation","sign_citation":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI/action/citation_signature","submit_replication":"https://pith.science/pith/6WD7I6CVJYA3MRKPVY7D6BRBZI/action/replication_record"}},"created_at":"2026-05-17T23:44:26.944616+00:00","updated_at":"2026-05-17T23:44:26.944616+00:00"}