{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JWL5HOEGAVYMV2EWYNC567JYX6","short_pith_number":"pith:JWL5HOEG","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"},"canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","source":{"kind":"arxiv","id":"1410.7220","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7220","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7220v3","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7220","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWL5HOEGAVYM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWL5HOEGAVYMV2EW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWL5HOEG","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JWL5HOEGAVYMV2EWYNC567JYX6","target":"record","payload":{"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"},"canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","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"},"source_kind":"arxiv","source_id":"1410.7220","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LBZHUKuMnMsvK4AuXsAZSYUeaJtsTf8jYhlif0LjVNpj7iE5Gc8LV/6J9i6esKqzIkHFsDp95VL/pM5VId6pCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:14:20.741487Z"},"content_sha256":"49d3e8989754c692ee189c4f745156bed4d9de26e5488ec46bbb2d612247b9bb","schema_version":"1.0","event_id":"sha256:49d3e8989754c692ee189c4f745156bed4d9de26e5488ec46bbb2d612247b9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JWL5HOEGAVYMV2EWYNC567JYX6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fo3SpK+uA9eslkyi9XDF9iMAEgXWihdcZr5dKipda/+HuamDJMUO+6T0wVLvvMTKaTbY96ZDW2kbzUM2UpHkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:14:20.741845Z"},"content_sha256":"07c258a9d6c76e5885e2bfd15815c16a6d3fa26ba002e6ccbd740441374aa528","schema_version":"1.0","event_id":"sha256:07c258a9d6c76e5885e2bfd15815c16a6d3fa26ba002e6ccbd740441374aa528"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/bundle.json","state_url":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWL5HOEGAVYMV2EWYNC567JYX6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:14:20Z","links":{"resolver":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6","bundle":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/bundle.json","state":"https://pith.science/pith/JWL5HOEGAVYMV2EWYNC567JYX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWL5HOEGAVYMV2EWYNC567JYX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JWL5HOEGAVYMV2EWYNC567JYX6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"39e7528b17074eb8c8aff382f0441f8b39897cd6cc56d062c3e4163474ae7702","cross_cats_sorted":["cs.LG","cs.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-10-27T13:09:29Z","title_canon_sha256":"99cede2e8a54bc4820134844737b81a893fd76f71bf86134c903f8b997379122"},"schema_version":"1.0","source":{"id":"1410.7220","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7220","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7220v3","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7220","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"JWL5HOEGAVYM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JWL5HOEGAVYMV2EW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JWL5HOEG","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:07c258a9d6c76e5885e2bfd15815c16a6d3fa26ba002e6ccbd740441374aa528","target":"graph","created_at":"2026-05-18T01:29:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Abhishek Kumar, Nicolas Gillis","cross_cats":["cs.LG","cs.NA","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-10-27T13:09:29Z","title":"Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7220","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49d3e8989754c692ee189c4f745156bed4d9de26e5488ec46bbb2d612247b9bb","target":"record","created_at":"2026-05-18T01:29:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"39e7528b17074eb8c8aff382f0441f8b39897cd6cc56d062c3e4163474ae7702","cross_cats_sorted":["cs.LG","cs.NA","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-10-27T13:09:29Z","title_canon_sha256":"99cede2e8a54bc4820134844737b81a893fd76f71bf86134c903f8b997379122"},"schema_version":"1.0","source":{"id":"1410.7220","kind":"arxiv","version":3}},"canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d97d3b8860570cae896c345df7d38bfb345cc2be4c63e100f23d90aa6ebc2c1","first_computed_at":"2026-05-18T01:29:13.430518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:13.430518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YkEArAnhNXDYwrJaETobn7u23pG9XAKiHbpJcu9LFHWQmduzE6pVQemNHszoS7xEsau8VgBwqdJ9brveOENhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:13.431055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7220","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49d3e8989754c692ee189c4f745156bed4d9de26e5488ec46bbb2d612247b9bb","sha256:07c258a9d6c76e5885e2bfd15815c16a6d3fa26ba002e6ccbd740441374aa528"],"state_sha256":"19604ea48519cab270d2a91c50d00e1d1e12b8f3d6b285fd962e56f1de682398"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoXu+5rnrfMNjFMJDKJxsan8qWY5xn5R0N/e3biL/xHWkpZ/SllJIXP9oD5jwA6YN4GxhpuKZ3iH2yAgmAGaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:14:20.743848Z","bundle_sha256":"b51084b94e266f1d7ac5b18d4ec989615a468a123d5f36cea1e90f56b31227b4"}}