{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NIK3QDXINCYQLOMAKOFN54YI5I","short_pith_number":"pith:NIK3QDXI","schema_version":"1.0","canonical_sha256":"6a15b80ee868b105b980538adef308ea1973f7e287d031eb71d11d2434a31f76","source":{"kind":"arxiv","id":"1405.2246","version":1},"attestation_state":"computed","paper":{"title":"Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Honggang Zhang, Jianjun Yang, Kaili Zhao, Le Li, Yang Xu, Zhuoyi Fan","submitted_at":"2014-05-09T14:44:03Z","abstract_excerpt":"Non-negative matrix factorization (NMF) has proved effective in many clustering and classification tasks. The classic ways to measure the errors between the original and the reconstructed matrix are $l_2$ distance or Kullback-Leibler (KL) divergence. However, nonlinear cases are not properly handled when we use these error measures. As a consequence, alternative measures based on nonlinear kernels, such as correntropy, are proposed. However, the current correntropy-based NMF only targets on the low-level features without considering the intrinsic geometrical distribution of data. In this paper"},"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":"1405.2246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-09T14:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"efc9d32245b7b305bb1c9591239ca9f18ef2b025b0bb56c64004543c47774b9d","abstract_canon_sha256":"23d4619c324fe9af9eabbbd62d50821588b2da2618a3b9005823c877de7156be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:13.293350Z","signature_b64":"jc/qoK/vlpjQWQrqspel7oKV0RqetICC5rP/s0nQ2q0IjGSCwo+96Sk1IP4LgGqnZaLJlusJVdMlfXLezKESCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a15b80ee868b105b980538adef308ea1973f7e287d031eb71d11d2434a31f76","last_reissued_at":"2026-05-18T02:52:13.292822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:13.292822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Honggang Zhang, Jianjun Yang, Kaili Zhao, Le Li, Yang Xu, Zhuoyi Fan","submitted_at":"2014-05-09T14:44:03Z","abstract_excerpt":"Non-negative matrix factorization (NMF) has proved effective in many clustering and classification tasks. The classic ways to measure the errors between the original and the reconstructed matrix are $l_2$ distance or Kullback-Leibler (KL) divergence. However, nonlinear cases are not properly handled when we use these error measures. As a consequence, alternative measures based on nonlinear kernels, such as correntropy, are proposed. However, the current correntropy-based NMF only targets on the low-level features without considering the intrinsic geometrical distribution of data. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2246","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":"1405.2246","created_at":"2026-05-18T02:52:13.292900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2246v1","created_at":"2026-05-18T02:52:13.292900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2246","created_at":"2026-05-18T02:52:13.292900+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIK3QDXINCYQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIK3QDXINCYQLOMA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIK3QDXI","created_at":"2026-05-18T12:28:41.024544+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/NIK3QDXINCYQLOMAKOFN54YI5I","json":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I.json","graph_json":"https://pith.science/api/pith-number/NIK3QDXINCYQLOMAKOFN54YI5I/graph.json","events_json":"https://pith.science/api/pith-number/NIK3QDXINCYQLOMAKOFN54YI5I/events.json","paper":"https://pith.science/paper/NIK3QDXI"},"agent_actions":{"view_html":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I","download_json":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I.json","view_paper":"https://pith.science/paper/NIK3QDXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2246&json=true","fetch_graph":"https://pith.science/api/pith-number/NIK3QDXINCYQLOMAKOFN54YI5I/graph.json","fetch_events":"https://pith.science/api/pith-number/NIK3QDXINCYQLOMAKOFN54YI5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I/action/storage_attestation","attest_author":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I/action/author_attestation","sign_citation":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I/action/citation_signature","submit_replication":"https://pith.science/pith/NIK3QDXINCYQLOMAKOFN54YI5I/action/replication_record"}},"created_at":"2026-05-18T02:52:13.292900+00:00","updated_at":"2026-05-18T02:52:13.292900+00:00"}