{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JWL5HOEGAVYMV2EWYNC567JYX6","short_pith_number":"pith:JWL5HOEG","schema_version":"1.0","canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","source":{"kind":"arxiv","id":"1410.7220","version":3},"attestation_state":"computed","paper":{"title":"Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Abhishek Kumar, Nicolas Gillis","submitted_at":"2014-10-27T13:09:29Z","abstract_excerpt":"Given a matrix $M$ (not necessarily nonnegative) and a factorization rank $r$, semi-nonnegative matrix factorization (semi-NMF) looks for a matrix $U$ with $r$ columns and a nonnegative matrix $V$ with $r$ rows such that $UV$ is the best possible approximation of $M$ according to some metric. In this paper, we study the properties of semi-NMF from which we develop exact and heuristic algorithms. Our contribution is threefold. First, we prove that the error of a semi-NMF of rank $r$ has to be smaller than the best unconstrained approximation of rank $r-1$. This leads us to a new initialization "},"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":"1410.7220","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-10-27T13:09:29Z","cross_cats_sorted":["cs.LG","cs.NA","math.OC","stat.ML"],"title_canon_sha256":"99cede2e8a54bc4820134844737b81a893fd76f71bf86134c903f8b997379122","abstract_canon_sha256":"39e7528b17074eb8c8aff382f0441f8b39897cd6cc56d062c3e4163474ae7702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:13.431055Z","signature_b64":"YkEArAnhNXDYwrJaETobn7u23pG9XAKiHbpJcu9LFHWQmduzE6pVQemNHszoS7xEsau8VgBwqdJ9brveOENhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","last_reissued_at":"2026-05-18T01:29:13.430518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:13.430518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Abhishek Kumar, Nicolas Gillis","submitted_at":"2014-10-27T13:09:29Z","abstract_excerpt":"Given a matrix $M$ (not necessarily nonnegative) and a factorization rank $r$, semi-nonnegative matrix factorization (semi-NMF) looks for a matrix $U$ with $r$ columns and a nonnegative matrix $V$ with $r$ rows such that $UV$ is the best possible approximation of $M$ according to some metric. In this paper, we study the properties of semi-NMF from which we develop exact and heuristic algorithms. Our contribution is threefold. First, we prove that the error of a semi-NMF of rank $r$ has to be smaller than the best unconstrained approximation of rank $r-1$. This leads us to a new initialization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7220","kind":"arxiv","version":3},"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":"1410.7220","created_at":"2026-05-18T01:29:13.430622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7220v3","created_at":"2026-05-18T01:29:13.430622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7220","created_at":"2026-05-18T01:29:13.430622+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWL5HOEGAVYM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWL5HOEGAVYMV2EW","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWL5HOEG","created_at":"2026-05-18T12:28:35.611951+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/JWL5HOEGAVYMV2EWYNC567JYX6","json":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6.json","graph_json":"https://pith.science/api/pith-number/JWL5HOEGAVYMV2EWYNC567JYX6/graph.json","events_json":"https://pith.science/api/pith-number/JWL5HOEGAVYMV2EWYNC567JYX6/events.json","paper":"https://pith.science/paper/JWL5HOEG"},"agent_actions":{"view_html":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6","download_json":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6.json","view_paper":"https://pith.science/paper/JWL5HOEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7220&json=true","fetch_graph":"https://pith.science/api/pith-number/JWL5HOEGAVYMV2EWYNC567JYX6/graph.json","fetch_events":"https://pith.science/api/pith-number/JWL5HOEGAVYMV2EWYNC567JYX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/action/storage_attestation","attest_author":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/action/author_attestation","sign_citation":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/action/citation_signature","submit_replication":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/action/replication_record"}},"created_at":"2026-05-18T01:29:13.430622+00:00","updated_at":"2026-05-18T01:29:13.430622+00:00"}