{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:UHA6FX5KJX4QAIFKKOBKB2EQCW","short_pith_number":"pith:UHA6FX5K","canonical_record":{"source":{"id":"2006.07553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-13T03:52:29Z","cross_cats_sorted":["cs.CV","eess.SP","math.OC","stat.ML"],"title_canon_sha256":"f0ce8c6857ad6fdb8431d5731366826d0e9ac7ff0d3a8fa67c1ae9b3a028866c","abstract_canon_sha256":"e13359dbbc9030c228d33e55b25c840d97a7f0daf6c8271417a4d140cca12a93"},"schema_version":"1.0"},"canonical_sha256":"a1c1e2dfaa4df90020aa5382a0e89015974bf16105d2e2aa759e4b97c83b246d","source":{"kind":"arxiv","id":"2006.07553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.07553","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2006.07553v1","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07553","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"UHA6FX5KJX4Q","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_16","alias_value":"UHA6FX5KJX4QAIFK","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_8","alias_value":"UHA6FX5K","created_at":"2026-07-05T01:10:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:UHA6FX5KJX4QAIFKKOBKB2EQCW","target":"record","payload":{"canonical_record":{"source":{"id":"2006.07553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-13T03:52:29Z","cross_cats_sorted":["cs.CV","eess.SP","math.OC","stat.ML"],"title_canon_sha256":"f0ce8c6857ad6fdb8431d5731366826d0e9ac7ff0d3a8fa67c1ae9b3a028866c","abstract_canon_sha256":"e13359dbbc9030c228d33e55b25c840d97a7f0daf6c8271417a4d140cca12a93"},"schema_version":"1.0"},"canonical_sha256":"a1c1e2dfaa4df90020aa5382a0e89015974bf16105d2e2aa759e4b97c83b246d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:01.238113Z","signature_b64":"h3EOW7wWlo4JIwvxL7X9YwlVWstqQF7dFJGnVOZzl2f6nMIdRcCwydgdAF7AthKkEDt1KNoBRkeKNdGuDGf7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c1e2dfaa4df90020aa5382a0e89015974bf16105d2e2aa759e4b97c83b246d","last_reissued_at":"2026-07-05T01:10:01.237636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:01.237636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.07553","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-07-05T01:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikhscoPFuCMIP3/JamYArb7g904KikIZApVaiB32/hVFkd5h4U9FkKEfw4x8UeRfiv7iq+slcmQVgNr/VO/JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:15:44.563828Z"},"content_sha256":"9991aca013abc858fbc39b8c2519dfec06211c6ecb85921050e07abafd748651","schema_version":"1.0","event_id":"sha256:9991aca013abc858fbc39b8c2519dfec06211c6ecb85921050e07abafd748651"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:UHA6FX5KJX4QAIFKKOBKB2EQCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Separable Nonnegative Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","eess.SP","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnaud Vandaele, Jeremy E. Cohen, Nicolas Gillis, Nicolas Nadisic","submitted_at":"2020-06-13T03:52:29Z","abstract_excerpt":"We propose a new variant of nonnegative matrix factorization (NMF), combining separability and sparsity assumptions. Separability requires that the columns of the first NMF factor are equal to columns of the input matrix, while sparsity requires that the columns of the second NMF factor are sparse. We call this variant sparse separable NMF (SSNMF), which we prove to be NP-complete, as opposed to separable NMF which can be solved in polynomial time. The main motivation to consider this new model is to handle underdetermined blind source separation problems, such as multispectral image unmixing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07553","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.07553/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:10:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8Q9ShGHi6hZhXmGcG6eTLAItFlsnLYzgmycyvVlxImULb858oqtjWKchbpxJhtKrh4T4XkXfAAvjidUzQDbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:15:44.564555Z"},"content_sha256":"1bb858a26a9910425945863a6014be5e9622b7ecbec7603b12203710b8e44854","schema_version":"1.0","event_id":"sha256:1bb858a26a9910425945863a6014be5e9622b7ecbec7603b12203710b8e44854"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/bundle.json","state_url":"https://pith.science/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/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-07-05T14:15:44Z","links":{"resolver":"https://pith.science/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW","bundle":"https://pith.science/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/bundle.json","state":"https://pith.science/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHA6FX5KJX4QAIFKKOBKB2EQCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:UHA6FX5KJX4QAIFKKOBKB2EQCW","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":"e13359dbbc9030c228d33e55b25c840d97a7f0daf6c8271417a4d140cca12a93","cross_cats_sorted":["cs.CV","eess.SP","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-13T03:52:29Z","title_canon_sha256":"f0ce8c6857ad6fdb8431d5731366826d0e9ac7ff0d3a8fa67c1ae9b3a028866c"},"schema_version":"1.0","source":{"id":"2006.07553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.07553","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"arxiv_version","alias_value":"2006.07553v1","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07553","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_12","alias_value":"UHA6FX5KJX4Q","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_16","alias_value":"UHA6FX5KJX4QAIFK","created_at":"2026-07-05T01:10:01Z"},{"alias_kind":"pith_short_8","alias_value":"UHA6FX5K","created_at":"2026-07-05T01:10:01Z"}],"graph_snapshots":[{"event_id":"sha256:1bb858a26a9910425945863a6014be5e9622b7ecbec7603b12203710b8e44854","target":"graph","created_at":"2026-07-05T01:10:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.07553/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new variant of nonnegative matrix factorization (NMF), combining separability and sparsity assumptions. Separability requires that the columns of the first NMF factor are equal to columns of the input matrix, while sparsity requires that the columns of the second NMF factor are sparse. We call this variant sparse separable NMF (SSNMF), which we prove to be NP-complete, as opposed to separable NMF which can be solved in polynomial time. The main motivation to consider this new model is to handle underdetermined blind source separation problems, such as multispectral image unmixing.","authors_text":"Arnaud Vandaele, Jeremy E. Cohen, Nicolas Gillis, Nicolas Nadisic","cross_cats":["cs.CV","eess.SP","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-13T03:52:29Z","title":"Sparse Separable Nonnegative Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07553","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:9991aca013abc858fbc39b8c2519dfec06211c6ecb85921050e07abafd748651","target":"record","created_at":"2026-07-05T01:10:01Z","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":"e13359dbbc9030c228d33e55b25c840d97a7f0daf6c8271417a4d140cca12a93","cross_cats_sorted":["cs.CV","eess.SP","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-13T03:52:29Z","title_canon_sha256":"f0ce8c6857ad6fdb8431d5731366826d0e9ac7ff0d3a8fa67c1ae9b3a028866c"},"schema_version":"1.0","source":{"id":"2006.07553","kind":"arxiv","version":1}},"canonical_sha256":"a1c1e2dfaa4df90020aa5382a0e89015974bf16105d2e2aa759e4b97c83b246d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1c1e2dfaa4df90020aa5382a0e89015974bf16105d2e2aa759e4b97c83b246d","first_computed_at":"2026-07-05T01:10:01.237636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:10:01.237636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h3EOW7wWlo4JIwvxL7X9YwlVWstqQF7dFJGnVOZzl2f6nMIdRcCwydgdAF7AthKkEDt1KNoBRkeKNdGuDGf7Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:10:01.238113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.07553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9991aca013abc858fbc39b8c2519dfec06211c6ecb85921050e07abafd748651","sha256:1bb858a26a9910425945863a6014be5e9622b7ecbec7603b12203710b8e44854"],"state_sha256":"0a5d3cb51070a256565883fde8d8e0c010ae995c7f0ac5dad8eb21d63815d6d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFjt9DtXb87nQgoaIIr0ldbAtjG63fd6QcaQ4iDgZhUNIhna5GF+bWgJJDlCF1Tp/JP2bsONuJ16croxkgjxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:15:44.568617Z","bundle_sha256":"0338e8816a364fe477f6fc8adcf64190ef8c3132210142d8353af014404d80c1"}}