{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:46SOXJMQ4H7PDNNGMWNSFMIFXC","short_pith_number":"pith:46SOXJMQ","schema_version":"1.0","canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","source":{"kind":"arxiv","id":"2209.12638","version":2},"attestation_state":"computed","paper":{"title":"Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fabian Lecron, Nicolas Gillis, Olivier Vu Thanh","submitted_at":"2022-09-26T12:37:37Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2209.12638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-26T12:37:37Z","cross_cats_sorted":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"title_canon_sha256":"91f6daf0da5b189019d7496c30fe24b900eb22c8119035e61dcfaa83ffb2d21f","abstract_canon_sha256":"dde91f5b2d07093be2a94a8211a6a38f636db9637e798ef6b1e84458d6209dda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:19.593143Z","signature_b64":"hmxH0z9XmdQC1c4/xN5AwOa1o0E79l6sMm390mMVOImPYMWZ0kCCpW22aLXoR+QsMWxqqr+R0f/EAhdWXS53Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","last_reissued_at":"2026-07-05T06:34:19.592689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:19.592689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.NA","eess.SP","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fabian Lecron, Nicolas Gillis, Olivier Vu Thanh","submitted_at":"2022-09-26T12:37:37Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12638","kind":"arxiv","version":2},"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/2209.12638/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.12638","created_at":"2026-07-05T06:34:19.592746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.12638v2","created_at":"2026-07-05T06:34:19.592746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12638","created_at":"2026-07-05T06:34:19.592746+00:00"},{"alias_kind":"pith_short_12","alias_value":"46SOXJMQ4H7P","created_at":"2026-07-05T06:34:19.592746+00:00"},{"alias_kind":"pith_short_16","alias_value":"46SOXJMQ4H7PDNNG","created_at":"2026-07-05T06:34:19.592746+00:00"},{"alias_kind":"pith_short_8","alias_value":"46SOXJMQ","created_at":"2026-07-05T06:34:19.592746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC","json":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC.json","graph_json":"https://pith.science/api/pith-number/46SOXJMQ4H7PDNNGMWNSFMIFXC/graph.json","events_json":"https://pith.science/api/pith-number/46SOXJMQ4H7PDNNGMWNSFMIFXC/events.json","paper":"https://pith.science/paper/46SOXJMQ"},"agent_actions":{"view_html":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC","download_json":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC.json","view_paper":"https://pith.science/paper/46SOXJMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.12638&json=true","fetch_graph":"https://pith.science/api/pith-number/46SOXJMQ4H7PDNNGMWNSFMIFXC/graph.json","fetch_events":"https://pith.science/api/pith-number/46SOXJMQ4H7PDNNGMWNSFMIFXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/action/storage_attestation","attest_author":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/action/author_attestation","sign_citation":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/action/citation_signature","submit_replication":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/action/replication_record"}},"created_at":"2026-07-05T06:34:19.592746+00:00","updated_at":"2026-07-05T06:34:19.592746+00:00"}