{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WS73C2KH2NX572ZH5DQ22Y4FE3","short_pith_number":"pith:WS73C2KH","schema_version":"1.0","canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","source":{"kind":"arxiv","id":"1411.7245","version":1},"attestation_state":"computed","paper":{"title":"Heuristics for Exact Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Arnaud Vandaele, Daniel Tuyttens, Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2014-11-26T14:33:59Z","abstract_excerpt":"The exact nonnegative matrix factorization (exact NMF) problem is the following: given an $m$-by-$n$ nonnegative matrix $X$ and a factorization rank $r$, find, if possible, an $m$-by-$r$ nonnegative matrix $W$ and an $r$-by-$n$ nonnegative matrix $H$ such that $X = WH$. In this paper, we propose two heuristics for exact NMF, one inspired from simulated annealing and the other from the greedy randomized adaptive search procedure. We show that these two heuristics are able to compute exact nonnegative factorizations for several classes of nonnegative matrices (namely, linear Euclidean distance m"},"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":"1411.7245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T14:33:59Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"735f091ef67e300bd646a0c658c0ce5b09d6da6ec2c753ab2ef2ffc2c5a11310","abstract_canon_sha256":"5caadf0e163dc7f65d9d431e95c10131b3a5ca32a1f171378ea44220873c25fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:06.638948Z","signature_b64":"uyX5ePF0fb0OVzlb+u99j8AaI5kOQSi6j6xjyGGYwP6eA1mT9bV/mMpz+8jwzQQ8U4UsAGpxXYJvtq0cHFQzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","last_reissued_at":"2026-05-18T01:03:06.638457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:06.638457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristics for Exact Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Arnaud Vandaele, Daniel Tuyttens, Fran\\c{c}ois Glineur, Nicolas Gillis","submitted_at":"2014-11-26T14:33:59Z","abstract_excerpt":"The exact nonnegative matrix factorization (exact NMF) problem is the following: given an $m$-by-$n$ nonnegative matrix $X$ and a factorization rank $r$, find, if possible, an $m$-by-$r$ nonnegative matrix $W$ and an $r$-by-$n$ nonnegative matrix $H$ such that $X = WH$. In this paper, we propose two heuristics for exact NMF, one inspired from simulated annealing and the other from the greedy randomized adaptive search procedure. We show that these two heuristics are able to compute exact nonnegative factorizations for several classes of nonnegative matrices (namely, linear Euclidean distance m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7245","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":"1411.7245","created_at":"2026-05-18T01:03:06.638533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7245v1","created_at":"2026-05-18T01:03:06.638533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7245","created_at":"2026-05-18T01:03:06.638533+00:00"},{"alias_kind":"pith_short_12","alias_value":"WS73C2KH2NX5","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WS73C2KH2NX572ZH","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WS73C2KH","created_at":"2026-05-18T12:28:54.890064+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/WS73C2KH2NX572ZH5DQ22Y4FE3","json":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3.json","graph_json":"https://pith.science/api/pith-number/WS73C2KH2NX572ZH5DQ22Y4FE3/graph.json","events_json":"https://pith.science/api/pith-number/WS73C2KH2NX572ZH5DQ22Y4FE3/events.json","paper":"https://pith.science/paper/WS73C2KH"},"agent_actions":{"view_html":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3","download_json":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3.json","view_paper":"https://pith.science/paper/WS73C2KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7245&json=true","fetch_graph":"https://pith.science/api/pith-number/WS73C2KH2NX572ZH5DQ22Y4FE3/graph.json","fetch_events":"https://pith.science/api/pith-number/WS73C2KH2NX572ZH5DQ22Y4FE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/action/storage_attestation","attest_author":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/action/author_attestation","sign_citation":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/action/citation_signature","submit_replication":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/action/replication_record"}},"created_at":"2026-05-18T01:03:06.638533+00:00","updated_at":"2026-05-18T01:03:06.638533+00:00"}