{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NS23CKRJQFHDTHSMXQFGRKAFE3","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":"d9c3f6c25f4d8fc1cf0c324f4f8b914d4a99d3c657f6c70361036b7e50244aae","cross_cats_sorted":["cs.LG","cs.NA","eess.SP","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T20:05:59Z","title_canon_sha256":"b0461f9f09cab85382bef0cf05ffdcdccf453d39b5f30693bc4864dd472b2160"},"schema_version":"1.0","source":{"id":"2106.07736","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.07736","created_at":"2026-07-05T07:00:54Z"},{"alias_kind":"arxiv_version","alias_value":"2106.07736v5","created_at":"2026-07-05T07:00:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07736","created_at":"2026-07-05T07:00:54Z"},{"alias_kind":"pith_short_12","alias_value":"NS23CKRJQFHD","created_at":"2026-07-05T07:00:54Z"},{"alias_kind":"pith_short_16","alias_value":"NS23CKRJQFHDTHSM","created_at":"2026-07-05T07:00:54Z"},{"alias_kind":"pith_short_8","alias_value":"NS23CKRJ","created_at":"2026-07-05T07:00:54Z"}],"graph_snapshots":[{"event_id":"sha256:9409ca17914811673ef50dcae10095c6cbbe13b9e61c1f38cca1f5339e981a2a","target":"graph","created_at":"2026-07-05T07:00:54Z","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/2106.07736/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of finding the unique low dimensional decomposition of a given matrix has been a fundamental and recurrent problem in many areas. In this paper, we study the problem of seeking a unique decomposition of a low rank matrix $Y\\in \\mathbb{R}^{p\\times n}$ that admits a sparse representation. Specifically, we consider $Y = A X\\in \\mathbb{R}^{p\\times n}$ where the matrix $A\\in \\mathbb{R}^{p\\times r}$ has full column rank, with $r < \\min\\{n,p\\}$, and the matrix $X\\in \\mathbb{R}^{r\\times n}$ is element-wise sparse. We prove that this sparse decomposition of $Y$ can be uniquely identified, u","authors_text":"Dian Jin, Xin Bing, Yuqian Zhang","cross_cats":["cs.LG","cs.NA","eess.SP","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T20:05:59Z","title":"Unique sparse decomposition of low rank matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07736","kind":"arxiv","version":5},"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:90dd11b0ba8f89fa968c9229203cfab88a264173b448608764d8e1debdba7298","target":"record","created_at":"2026-07-05T07:00:54Z","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":"d9c3f6c25f4d8fc1cf0c324f4f8b914d4a99d3c657f6c70361036b7e50244aae","cross_cats_sorted":["cs.LG","cs.NA","eess.SP","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T20:05:59Z","title_canon_sha256":"b0461f9f09cab85382bef0cf05ffdcdccf453d39b5f30693bc4864dd472b2160"},"schema_version":"1.0","source":{"id":"2106.07736","kind":"arxiv","version":5}},"canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","first_computed_at":"2026-07-05T07:00:54.498461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:00:54.498461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0u0lo7ItwYMFUezD9PwJthzxbiGGXS2wjWwQYJAvcCf6yT5Te9fzn1Tug7QLSDmjxuygU+aq6hjj1QJanRYvCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:00:54.499137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.07736","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90dd11b0ba8f89fa968c9229203cfab88a264173b448608764d8e1debdba7298","sha256:9409ca17914811673ef50dcae10095c6cbbe13b9e61c1f38cca1f5339e981a2a"],"state_sha256":"4dd1a2c5831d0f5b085017aaba6890ffcba79bfd8f299ba55be4e1ad84814af1"}