{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:OHAGVSKJ5N52QLGTYBKAY7DY33","short_pith_number":"pith:OHAGVSKJ","canonical_record":{"source":{"id":"2007.11446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-22T14:01:58Z","cross_cats_sorted":["eess.IV","eess.SP","stat.ML"],"title_canon_sha256":"d82918ab63e7369f8a81bc68e82fe27f8f59b2a59785151562cd4bf929d2f5a4","abstract_canon_sha256":"6e4009aabdf8adbebeb7b840c4364e06e0f24898fe5fa2dc44e96c08697f6fcc"},"schema_version":"1.0"},"canonical_sha256":"71c06ac949eb7ba82cd3c0540c7c78defea2afa5459f162c9f16b1a98629392e","source":{"kind":"arxiv","id":"2007.11446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11446","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11446v1","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11446","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"OHAGVSKJ5N52","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_16","alias_value":"OHAGVSKJ5N52QLGT","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_8","alias_value":"OHAGVSKJ","created_at":"2026-07-05T02:39:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:OHAGVSKJ5N52QLGTYBKAY7DY33","target":"record","payload":{"canonical_record":{"source":{"id":"2007.11446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-22T14:01:58Z","cross_cats_sorted":["eess.IV","eess.SP","stat.ML"],"title_canon_sha256":"d82918ab63e7369f8a81bc68e82fe27f8f59b2a59785151562cd4bf929d2f5a4","abstract_canon_sha256":"6e4009aabdf8adbebeb7b840c4364e06e0f24898fe5fa2dc44e96c08697f6fcc"},"schema_version":"1.0"},"canonical_sha256":"71c06ac949eb7ba82cd3c0540c7c78defea2afa5459f162c9f16b1a98629392e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:03.489282Z","signature_b64":"v+kZNU4SAb4Wakgxo+QlOfKS79c+jDLG/1UdTApcq2w7vStslcMg8T1o/exUUqG2a0iBEJ8gWozCPU/K7duEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71c06ac949eb7ba82cd3c0540c7c78defea2afa5459f162c9f16b1a98629392e","last_reissued_at":"2026-07-05T02:39:03.488811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:03.488811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.11446","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-05T02:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcnmJlF2KolUdi6tUh7iNh02c82Npr9mdR/9fGS9c8BoFTtK47C6OwuvvRbDnX569Zn2HNVcLRQQ/Ig5O9eVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:42:28.047780Z"},"content_sha256":"1dccbdf2e9569f7caf4888a12c5300a503237bb23d4744fb4f4fa2dfa036e545","schema_version":"1.0","event_id":"sha256:1dccbdf2e9569f7caf4888a12c5300a503237bb23d4744fb4f4fa2dfa036e545"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:OHAGVSKJ5N52QLGTYBKAY7DY33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Maryam Abdolali, Nicolas Gillis","submitted_at":"2020-07-22T14:01:58Z","abstract_excerpt":"In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide identifiability results for SSMF rely on the sufficiently scattered condition (SSC) which requires the data points to be well spread within the convex hull of the basis vectors. The conditions under which our proposed algorithms recover the unique decomposition is in most cases much weaker than the SSC. We only require to have $d$ points on each facet of the convex hu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11446","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/2007.11446/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-05T02:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMXkJAKkdJHRkuM5OJhwqVrwBDASt3M9euVkRT8A2wcaUpUjCc2FGB06UN0VBRQMs0mChJoxjBV2QgHqRlzzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:42:28.050030Z"},"content_sha256":"b95ebb0ca999678e0b9dfaa25cef672ec419f58766859fb15c1f2e4d144cb6e2","schema_version":"1.0","event_id":"sha256:b95ebb0ca999678e0b9dfaa25cef672ec419f58766859fb15c1f2e4d144cb6e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/bundle.json","state_url":"https://pith.science/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/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-08-01T09:42:28Z","links":{"resolver":"https://pith.science/pith/OHAGVSKJ5N52QLGTYBKAY7DY33","bundle":"https://pith.science/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/bundle.json","state":"https://pith.science/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHAGVSKJ5N52QLGTYBKAY7DY33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OHAGVSKJ5N52QLGTYBKAY7DY33","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":"6e4009aabdf8adbebeb7b840c4364e06e0f24898fe5fa2dc44e96c08697f6fcc","cross_cats_sorted":["eess.IV","eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-22T14:01:58Z","title_canon_sha256":"d82918ab63e7369f8a81bc68e82fe27f8f59b2a59785151562cd4bf929d2f5a4"},"schema_version":"1.0","source":{"id":"2007.11446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11446","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11446v1","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11446","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"OHAGVSKJ5N52","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_16","alias_value":"OHAGVSKJ5N52QLGT","created_at":"2026-07-05T02:39:03Z"},{"alias_kind":"pith_short_8","alias_value":"OHAGVSKJ","created_at":"2026-07-05T02:39:03Z"}],"graph_snapshots":[{"event_id":"sha256:b95ebb0ca999678e0b9dfaa25cef672ec419f58766859fb15c1f2e4d144cb6e2","target":"graph","created_at":"2026-07-05T02:39:03Z","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/2007.11446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide identifiability results for SSMF rely on the sufficiently scattered condition (SSC) which requires the data points to be well spread within the convex hull of the basis vectors. The conditions under which our proposed algorithms recover the unique decomposition is in most cases much weaker than the SSC. We only require to have $d$ points on each facet of the convex hu","authors_text":"Maryam Abdolali, Nicolas Gillis","cross_cats":["eess.IV","eess.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-22T14:01:58Z","title":"Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11446","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:1dccbdf2e9569f7caf4888a12c5300a503237bb23d4744fb4f4fa2dfa036e545","target":"record","created_at":"2026-07-05T02:39:03Z","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":"6e4009aabdf8adbebeb7b840c4364e06e0f24898fe5fa2dc44e96c08697f6fcc","cross_cats_sorted":["eess.IV","eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-22T14:01:58Z","title_canon_sha256":"d82918ab63e7369f8a81bc68e82fe27f8f59b2a59785151562cd4bf929d2f5a4"},"schema_version":"1.0","source":{"id":"2007.11446","kind":"arxiv","version":1}},"canonical_sha256":"71c06ac949eb7ba82cd3c0540c7c78defea2afa5459f162c9f16b1a98629392e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71c06ac949eb7ba82cd3c0540c7c78defea2afa5459f162c9f16b1a98629392e","first_computed_at":"2026-07-05T02:39:03.488811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:39:03.488811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+kZNU4SAb4Wakgxo+QlOfKS79c+jDLG/1UdTApcq2w7vStslcMg8T1o/exUUqG2a0iBEJ8gWozCPU/K7duEBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:39:03.489282Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.11446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dccbdf2e9569f7caf4888a12c5300a503237bb23d4744fb4f4fa2dfa036e545","sha256:b95ebb0ca999678e0b9dfaa25cef672ec419f58766859fb15c1f2e4d144cb6e2"],"state_sha256":"8fede770b05e1177113679f55baa4d1f2e9f8d04993d7844da3c01643fd6cf65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKM+9BMl+EBmTx85AxRyVIfyyt5kP/+6eSOgZZfnKKtGCUyzvbiuvDL4ueibLrNJbgYuFbrdVRByRoFJVVUmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:42:28.066262Z","bundle_sha256":"c0b19ec259e09c6b1f51810c80864533ad37c2514dbbe38db3c822f8da18c41b"}}