{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7Y2ZKT2JU44P7TH2GONUUVSJFS","short_pith_number":"pith:7Y2ZKT2J","canonical_record":{"source":{"id":"1709.00614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-02T18:40:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"94d92cecb1699db094f0f5843776ba72fdc7916fbeb56e0a0158ff9831768a50","abstract_canon_sha256":"e51b9cd85c592cf4a4a0ef5921b7d0deebc7a9bfa9eb3ad2819cf4db25c1a677"},"schema_version":"1.0"},"canonical_sha256":"fe35954f49a738ffccfa339b4a56492c8f6e5f87ec1f86f2242161c19fc5d7b6","source":{"kind":"arxiv","id":"1709.00614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00614","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00614v1","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00614","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"7Y2ZKT2JU44P","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7Y2ZKT2JU44P7TH2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7Y2ZKT2J","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7Y2ZKT2JU44P7TH2GONUUVSJFS","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-02T18:40:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"94d92cecb1699db094f0f5843776ba72fdc7916fbeb56e0a0158ff9831768a50","abstract_canon_sha256":"e51b9cd85c592cf4a4a0ef5921b7d0deebc7a9bfa9eb3ad2819cf4db25c1a677"},"schema_version":"1.0"},"canonical_sha256":"fe35954f49a738ffccfa339b4a56492c8f6e5f87ec1f86f2242161c19fc5d7b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:25.493257Z","signature_b64":"rHY7kOWHJayFN/u4WsL02vrES4SVGNtFO2JR01ReelyvW7jvGqPpTwEbWGkrX+RL725fnZaB7TAMyy/nHq6lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe35954f49a738ffccfa339b4a56492c8f6e5f87ec1f86f2242161c19fc5d7b6","last_reissued_at":"2026-05-18T00:21:25.492557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:25.492557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00614","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-18T00:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMFmfzpYT3qk5Sjaz+rvm0ljGbAZu4Wz9jkCm34h+s/ct9gJ9sazh6tzzam59jwFtUpm49nW3BY+lnpaTnqoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:58:11.416333Z"},"content_sha256":"2433f443622e433e552fde805eacce4119aabe974f617df1025deb251929e462","schema_version":"1.0","event_id":"sha256:2433f443622e433e552fde805eacce4119aabe974f617df1025deb251929e462"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7Y2ZKT2JU44P7TH2GONUUVSJFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Identifiability of Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Xiao Fu","submitted_at":"2017-09-02T18:40:37Z","abstract_excerpt":"In this letter, we propose a new identification criterion that guarantees the recovery of the low-rank latent factors in the nonnegative matrix factorization (NMF) model, under mild conditions. Specifically, using the proposed criterion, it suffices to identify the latent factors if the rows of one factor are \\emph{sufficiently scattered} over the nonnegative orthant, while no structural assumption is imposed on the other factor except being full-rank. This is by far the mildest condition under which the latent factors are provably identifiable from the NMF model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00614","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-18T00:21:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9KIMgwZW5da+JA81YldhXR7eoRuY+oalbASB+44Py7f/hhBn1mxx8fnltlm4nHzhn7ji50TvewhaXC8NM0w0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:58:11.417040Z"},"content_sha256":"a170fb881f7e852006bbd3d87a67f7199b10486ea8a789232c0b8fc6e57e9db2","schema_version":"1.0","event_id":"sha256:a170fb881f7e852006bbd3d87a67f7199b10486ea8a789232c0b8fc6e57e9db2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/bundle.json","state_url":"https://pith.science/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/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-08T20:58:11Z","links":{"resolver":"https://pith.science/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS","bundle":"https://pith.science/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/bundle.json","state":"https://pith.science/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Y2ZKT2JU44P7TH2GONUUVSJFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7Y2ZKT2JU44P7TH2GONUUVSJFS","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":"e51b9cd85c592cf4a4a0ef5921b7d0deebc7a9bfa9eb3ad2819cf4db25c1a677","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-02T18:40:37Z","title_canon_sha256":"94d92cecb1699db094f0f5843776ba72fdc7916fbeb56e0a0158ff9831768a50"},"schema_version":"1.0","source":{"id":"1709.00614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00614","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00614v1","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00614","created_at":"2026-05-18T00:21:25Z"},{"alias_kind":"pith_short_12","alias_value":"7Y2ZKT2JU44P","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7Y2ZKT2JU44P7TH2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7Y2ZKT2J","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:a170fb881f7e852006bbd3d87a67f7199b10486ea8a789232c0b8fc6e57e9db2","target":"graph","created_at":"2026-05-18T00:21:25Z","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":"In this letter, we propose a new identification criterion that guarantees the recovery of the low-rank latent factors in the nonnegative matrix factorization (NMF) model, under mild conditions. Specifically, using the proposed criterion, it suffices to identify the latent factors if the rows of one factor are \\emph{sufficiently scattered} over the nonnegative orthant, while no structural assumption is imposed on the other factor except being full-rank. This is by far the mildest condition under which the latent factors are provably identifiable from the NMF model.","authors_text":"Kejun Huang, Nicholas D. Sidiropoulos, Xiao Fu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-02T18:40:37Z","title":"On Identifiability of Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00614","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:2433f443622e433e552fde805eacce4119aabe974f617df1025deb251929e462","target":"record","created_at":"2026-05-18T00:21:25Z","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":"e51b9cd85c592cf4a4a0ef5921b7d0deebc7a9bfa9eb3ad2819cf4db25c1a677","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-02T18:40:37Z","title_canon_sha256":"94d92cecb1699db094f0f5843776ba72fdc7916fbeb56e0a0158ff9831768a50"},"schema_version":"1.0","source":{"id":"1709.00614","kind":"arxiv","version":1}},"canonical_sha256":"fe35954f49a738ffccfa339b4a56492c8f6e5f87ec1f86f2242161c19fc5d7b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe35954f49a738ffccfa339b4a56492c8f6e5f87ec1f86f2242161c19fc5d7b6","first_computed_at":"2026-05-18T00:21:25.492557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:25.492557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rHY7kOWHJayFN/u4WsL02vrES4SVGNtFO2JR01ReelyvW7jvGqPpTwEbWGkrX+RL725fnZaB7TAMyy/nHq6lDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:25.493257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2433f443622e433e552fde805eacce4119aabe974f617df1025deb251929e462","sha256:a170fb881f7e852006bbd3d87a67f7199b10486ea8a789232c0b8fc6e57e9db2"],"state_sha256":"21738f2c306ef15e5c51925c2742500d1d81f27b8c1702b394cedcd8f0ab37e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WAhqTZZFadWSppyHUn2uhlvOg4o4NWGJMliOvKzGSFUN4i8v9kl4YBO+6HtydtQGXCRRwngNkijmEeqhxTqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:58:11.420962Z","bundle_sha256":"aa0279c8d424cdb3d713344df30146761f5dee2b35bd6089f06e5bb2c9faacf3"}}