{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:46SOXJMQ4H7PDNNGMWNSFMIFXC","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":"dde91f5b2d07093be2a94a8211a6a38f636db9637e798ef6b1e84458d6209dda","cross_cats_sorted":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-26T12:37:37Z","title_canon_sha256":"91f6daf0da5b189019d7496c30fe24b900eb22c8119035e61dcfaa83ffb2d21f"},"schema_version":"1.0","source":{"id":"2209.12638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.12638","created_at":"2026-07-05T06:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"2209.12638v2","created_at":"2026-07-05T06:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12638","created_at":"2026-07-05T06:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"46SOXJMQ4H7P","created_at":"2026-07-05T06:34:19Z"},{"alias_kind":"pith_short_16","alias_value":"46SOXJMQ4H7PDNNG","created_at":"2026-07-05T06:34:19Z"},{"alias_kind":"pith_short_8","alias_value":"46SOXJMQ","created_at":"2026-07-05T06:34:19Z"}],"graph_snapshots":[{"event_id":"sha256:4905f773e70f0839305e1f1140784c230012f7492fe140321899e68274eb580b","target":"graph","created_at":"2026-07-05T06:34:19Z","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/2209.12638/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a new low-rank matrix factorization model dubbed bounded simplex-structured matrix factorization (BSSMF). Given an input matrix $X$ and a factorization rank $r$, BSSMF looks for a matrix $W$ with $r$ columns and a matrix $H$ with $r$ rows such that $X \\approx WH$ where the entries in each column of $W$ are bounded, that is, they belong to given intervals, and the columns of $H$ belong to the probability simplex, that is, $H$ is column stochastic. BSSMF generalizes nonnegative matrix factorization (NMF), and simplex-structured matrix factorization (SSMF). BSSMF is part","authors_text":"Fabian Lecron, Nicolas Gillis, Olivier Vu Thanh","cross_cats":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-26T12:37:37Z","title":"Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12638","kind":"arxiv","version":2},"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:50d2b4f53216326fae1002dd2a4d8f92958e675a3e1734061e773fcedd9e4c33","target":"record","created_at":"2026-07-05T06:34:19Z","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":"dde91f5b2d07093be2a94a8211a6a38f636db9637e798ef6b1e84458d6209dda","cross_cats_sorted":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-26T12:37:37Z","title_canon_sha256":"91f6daf0da5b189019d7496c30fe24b900eb22c8119035e61dcfaa83ffb2d21f"},"schema_version":"1.0","source":{"id":"2209.12638","kind":"arxiv","version":2}},"canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","first_computed_at":"2026-07-05T06:34:19.592689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:34:19.592689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hmxH0z9XmdQC1c4/xN5AwOa1o0E79l6sMm390mMVOImPYMWZ0kCCpW22aLXoR+QsMWxqqr+R0f/EAhdWXS53Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:34:19.593143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.12638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50d2b4f53216326fae1002dd2a4d8f92958e675a3e1734061e773fcedd9e4c33","sha256:4905f773e70f0839305e1f1140784c230012f7492fe140321899e68274eb580b"],"state_sha256":"5eebc7589eca145976965d408c1083ccc19154bacb210ec8541eae279e4c2619"}