{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GXLPRYMQOUJS3BAD52E6TUQCNT","short_pith_number":"pith:GXLPRYMQ","schema_version":"1.0","canonical_sha256":"35d6f8e19075132d8403ee89e9d2026ccd49f52572fe2f60970f23b6917d0721","source":{"kind":"arxiv","id":"1401.5226","version":2},"attestation_state":"computed","paper":{"title":"The Why and How of Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Gillis","submitted_at":"2014-01-21T09:03:12Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a widely used tool for the analysis of high-dimensional data as it automatically extracts sparse and meaningful features from a set of nonnegative data vectors. We first illustrate this property of NMF on three applications, in image processing, text mining and hyperspectral imaging --this is the why. Then we address the problem of solving NMF, which is NP-hard in general. We review some standard NMF algorithms, and also present a recent subclass of NMF problems, referred to as near-separable NMF, that can be solved efficiently (that is, in pol"},"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":"1401.5226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-21T09:03:12Z","cross_cats_sorted":["cs.IR","cs.LG","math.OC"],"title_canon_sha256":"6ea68a1dc86e9ee6c745088387f9235e39630888fdb998d72beba1cdba51ea04","abstract_canon_sha256":"096d41d1e8c0f2b436393ba4024ecb8129dffa205797e2c0e6ffb7be45fec63a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:47.891158Z","signature_b64":"RsbKCTIMV1KRc4qdvgXjcuOixAyt3uDGCXeh4LiSM2iB0+2mmTo4B57O16IUV0xJoxqs5dqYHd9rz8C6TsQ4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d6f8e19075132d8403ee89e9d2026ccd49f52572fe2f60970f23b6917d0721","last_reissued_at":"2026-05-18T02:31:47.890311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:47.890311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Why and How of Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Gillis","submitted_at":"2014-01-21T09:03:12Z","abstract_excerpt":"Nonnegative matrix factorization (NMF) has become a widely used tool for the analysis of high-dimensional data as it automatically extracts sparse and meaningful features from a set of nonnegative data vectors. We first illustrate this property of NMF on three applications, in image processing, text mining and hyperspectral imaging --this is the why. Then we address the problem of solving NMF, which is NP-hard in general. We review some standard NMF algorithms, and also present a recent subclass of NMF problems, referred to as near-separable NMF, that can be solved efficiently (that is, in pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5226","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":""},"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":"1401.5226","created_at":"2026-05-18T02:31:47.890466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5226v2","created_at":"2026-05-18T02:31:47.890466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5226","created_at":"2026-05-18T02:31:47.890466+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXLPRYMQOUJS","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXLPRYMQOUJS3BAD","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXLPRYMQ","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16724","citing_title":"Discovering interpretable low-dimensional dynamics using maximum entropy","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT","json":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT.json","graph_json":"https://pith.science/api/pith-number/GXLPRYMQOUJS3BAD52E6TUQCNT/graph.json","events_json":"https://pith.science/api/pith-number/GXLPRYMQOUJS3BAD52E6TUQCNT/events.json","paper":"https://pith.science/paper/GXLPRYMQ"},"agent_actions":{"view_html":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT","download_json":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT.json","view_paper":"https://pith.science/paper/GXLPRYMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5226&json=true","fetch_graph":"https://pith.science/api/pith-number/GXLPRYMQOUJS3BAD52E6TUQCNT/graph.json","fetch_events":"https://pith.science/api/pith-number/GXLPRYMQOUJS3BAD52E6TUQCNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT/action/storage_attestation","attest_author":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT/action/author_attestation","sign_citation":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT/action/citation_signature","submit_replication":"https://pith.science/pith/GXLPRYMQOUJS3BAD52E6TUQCNT/action/replication_record"}},"created_at":"2026-05-18T02:31:47.890466+00:00","updated_at":"2026-05-18T02:31:47.890466+00:00"}