{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:46SOXJMQ4H7PDNNGMWNSFMIFXC","short_pith_number":"pith:46SOXJMQ","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"},"canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","source":{"kind":"arxiv","id":"2209.12638","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:46SOXJMQ4H7PDNNGMWNSFMIFXC","target":"record","payload":{"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"},"canonical_sha256":"e7a4eba590e1fef1b5a6659b22b105b8943fd5c12bc1055b5f044208b69e7b72","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"},"source_kind":"arxiv","source_id":"2209.12638","source_version":2,"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-05T06:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WErT+pSDQMQEDWFXbai/6zrAep25/nKZ2Bhw0iRh9rBVO2twR4jlYiiw9S75rqEFI4CfC1qQvBixcipD06RFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:02:35.490951Z"},"content_sha256":"50d2b4f53216326fae1002dd2a4d8f92958e675a3e1734061e773fcedd9e4c33","schema_version":"1.0","event_id":"sha256:50d2b4f53216326fae1002dd2a4d8f92958e675a3e1734061e773fcedd9e4c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:46SOXJMQ4H7PDNNGMWNSFMIFXC","target":"graph","payload":{"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"},"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-05T06:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzjZaO6bRi07BwqdaUc2McOfs7p0ZnutSp8Fii5ll3MCwSnbgfDgprCPduGNIpw1G6/DuvA9iVja004+BxTtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:02:35.491509Z"},"content_sha256":"4905f773e70f0839305e1f1140784c230012f7492fe140321899e68274eb580b","schema_version":"1.0","event_id":"sha256:4905f773e70f0839305e1f1140784c230012f7492fe140321899e68274eb580b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/bundle.json","state_url":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/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-06T08:02:35Z","links":{"resolver":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC","bundle":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/bundle.json","state":"https://pith.science/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46SOXJMQ4H7PDNNGMWNSFMIFXC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmSsqu6hYIVxwpUESNzc+Rirh+29p/Ye+QDtULhZATiELWejv+ExYnhSlq0ZzaUb+AmhnPZyZ7fP8VJ701ICBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:02:35.496197Z","bundle_sha256":"cc2e588b5813922a5707679c085070f02578c3543572eff8a1451a4ec43e9af5"}}