{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NS23CKRJQFHDTHSMXQFGRKAFE3","short_pith_number":"pith:NS23CKRJ","schema_version":"1.0","canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","source":{"kind":"arxiv","id":"2106.07736","version":5},"attestation_state":"computed","paper":{"title":"Unique sparse decomposition of low rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","eess.SP","math.NA"],"primary_cat":"math.OC","authors_text":"Dian Jin, Xin Bing, Yuqian Zhang","submitted_at":"2021-06-14T20:05:59Z","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"},"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":"2106.07736","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T20:05:59Z","cross_cats_sorted":["cs.LG","cs.NA","eess.SP","math.NA"],"title_canon_sha256":"b0461f9f09cab85382bef0cf05ffdcdccf453d39b5f30693bc4864dd472b2160","abstract_canon_sha256":"d9c3f6c25f4d8fc1cf0c324f4f8b914d4a99d3c657f6c70361036b7e50244aae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:54.499137Z","signature_b64":"0u0lo7ItwYMFUezD9PwJthzxbiGGXS2wjWwQYJAvcCf6yT5Te9fzn1Tug7QLSDmjxuygU+aq6hjj1QJanRYvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","last_reissued_at":"2026-07-05T07:00:54.498461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:54.498461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unique sparse decomposition of low rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","eess.SP","math.NA"],"primary_cat":"math.OC","authors_text":"Dian Jin, Xin Bing, Yuqian Zhang","submitted_at":"2021-06-14T20:05:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07736","kind":"arxiv","version":5},"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/2106.07736/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":"2106.07736","created_at":"2026-07-05T07:00:54.498556+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.07736v5","created_at":"2026-07-05T07:00:54.498556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07736","created_at":"2026-07-05T07:00:54.498556+00:00"},{"alias_kind":"pith_short_12","alias_value":"NS23CKRJQFHD","created_at":"2026-07-05T07:00:54.498556+00:00"},{"alias_kind":"pith_short_16","alias_value":"NS23CKRJQFHDTHSM","created_at":"2026-07-05T07:00:54.498556+00:00"},{"alias_kind":"pith_short_8","alias_value":"NS23CKRJ","created_at":"2026-07-05T07:00:54.498556+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/NS23CKRJQFHDTHSMXQFGRKAFE3","json":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3.json","graph_json":"https://pith.science/api/pith-number/NS23CKRJQFHDTHSMXQFGRKAFE3/graph.json","events_json":"https://pith.science/api/pith-number/NS23CKRJQFHDTHSMXQFGRKAFE3/events.json","paper":"https://pith.science/paper/NS23CKRJ"},"agent_actions":{"view_html":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3","download_json":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3.json","view_paper":"https://pith.science/paper/NS23CKRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.07736&json=true","fetch_graph":"https://pith.science/api/pith-number/NS23CKRJQFHDTHSMXQFGRKAFE3/graph.json","fetch_events":"https://pith.science/api/pith-number/NS23CKRJQFHDTHSMXQFGRKAFE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/action/storage_attestation","attest_author":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/action/author_attestation","sign_citation":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/action/citation_signature","submit_replication":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/action/replication_record"}},"created_at":"2026-07-05T07:00:54.498556+00:00","updated_at":"2026-07-05T07:00:54.498556+00:00"}