{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WS73C2KH2NX572ZH5DQ22Y4FE3","short_pith_number":"pith:WS73C2KH","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"},"canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","source":{"kind":"arxiv","id":"1411.7245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7245","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7245v1","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7245","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"WS73C2KH2NX5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WS73C2KH2NX572ZH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WS73C2KH","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WS73C2KH2NX572ZH5DQ22Y4FE3","target":"record","payload":{"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"},"canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","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"},"source_kind":"arxiv","source_id":"1411.7245","source_version":1,"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:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MseEjBZ5QYpvOW//8X/C2fGZ7Efy1YUkiHxqvxkzHebawx5jbXBTo01GqmDxCCRfkpkvVKMMGQLz/uOvM44kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:36.499104Z"},"content_sha256":"dbfc369fcf7442f1590f62676056ebeda115cbab45a87d692c6cb3c9ca4165d1","schema_version":"1.0","event_id":"sha256:dbfc369fcf7442f1590f62676056ebeda115cbab45a87d692c6cb3c9ca4165d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WS73C2KH2NX572ZH5DQ22Y4FE3","target":"graph","payload":{"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"},"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:03:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvFYZLHqjVDK2JdDZGOOYuvlSidY0/1iebgQR2LBMnjLYbKbmOuBH+zBAatlCJMTijG+TqmnXXuhPUhInPN/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:27:36.499626Z"},"content_sha256":"e1718c7c5df23e0b8efe9a54112e79948e664d067e9611db07e590167007cbfc","schema_version":"1.0","event_id":"sha256:e1718c7c5df23e0b8efe9a54112e79948e664d067e9611db07e590167007cbfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/bundle.json","state_url":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/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-05-27T10:27:36Z","links":{"resolver":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3","bundle":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/bundle.json","state":"https://pith.science/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WS73C2KH2NX572ZH5DQ22Y4FE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WS73C2KH2NX572ZH5DQ22Y4FE3","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":"5caadf0e163dc7f65d9d431e95c10131b3a5ca32a1f171378ea44220873c25fa","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T14:33:59Z","title_canon_sha256":"735f091ef67e300bd646a0c658c0ce5b09d6da6ec2c753ab2ef2ffc2c5a11310"},"schema_version":"1.0","source":{"id":"1411.7245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7245","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7245v1","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7245","created_at":"2026-05-18T01:03:06Z"},{"alias_kind":"pith_short_12","alias_value":"WS73C2KH2NX5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WS73C2KH2NX572ZH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WS73C2KH","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e1718c7c5df23e0b8efe9a54112e79948e664d067e9611db07e590167007cbfc","target":"graph","created_at":"2026-05-18T01:03:06Z","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":"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","authors_text":"Arnaud Vandaele, Daniel Tuyttens, Fran\\c{c}ois Glineur, Nicolas Gillis","cross_cats":["cs.LG","cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T14:33:59Z","title":"Heuristics for Exact Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7245","kind":"arxiv","version":1},"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:dbfc369fcf7442f1590f62676056ebeda115cbab45a87d692c6cb3c9ca4165d1","target":"record","created_at":"2026-05-18T01:03:06Z","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":"5caadf0e163dc7f65d9d431e95c10131b3a5ca32a1f171378ea44220873c25fa","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-26T14:33:59Z","title_canon_sha256":"735f091ef67e300bd646a0c658c0ce5b09d6da6ec2c753ab2ef2ffc2c5a11310"},"schema_version":"1.0","source":{"id":"1411.7245","kind":"arxiv","version":1}},"canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4bfb16947d36fdfeb27e8e1ad638526f0df837b6be7bd8c3b64d123083e9b79","first_computed_at":"2026-05-18T01:03:06.638457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:06.638457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uyX5ePF0fb0OVzlb+u99j8AaI5kOQSi6j6xjyGGYwP6eA1mT9bV/mMpz+8jwzQQ8U4UsAGpxXYJvtq0cHFQzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:06.638948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbfc369fcf7442f1590f62676056ebeda115cbab45a87d692c6cb3c9ca4165d1","sha256:e1718c7c5df23e0b8efe9a54112e79948e664d067e9611db07e590167007cbfc"],"state_sha256":"f14b55f6418d58c72b6d7a8e8651f6e707d3fe21fe5301128913a3251cab885f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XT7KlX3AsNKssO5Hi5PyC983DyILdfDSo+9jgErSvYBvqaAcvG8MSMy2Qiy3f9+2o7EepyrdIo6lzbNfEhHhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:27:36.503132Z","bundle_sha256":"5a7d105d29a4eba4d3fd71064a47f5672ddd39d534ce3316c5fed62e939cd60f"}}