{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NS23CKRJQFHDTHSMXQFGRKAFE3","short_pith_number":"pith:NS23CKRJ","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"},"canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","source":{"kind":"arxiv","id":"2106.07736","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NS23CKRJQFHDTHSMXQFGRKAFE3","target":"record","payload":{"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"},"canonical_sha256":"6cb5b12a29814e399e4cbc0a68a80526ffea4a71c8d135cd93ae47ceeec05010","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"},"source_kind":"arxiv","source_id":"2106.07736","source_version":5,"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-05T07:00:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdNbkzvXoN3nvhUqphus+6UlLhx8vDDC+GztIY8wroKSV+dtHYAkJ4zJMTqOEW23tzLTD+a2k9wYlFyZ4xTQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:48:18.422436Z"},"content_sha256":"90dd11b0ba8f89fa968c9229203cfab88a264173b448608764d8e1debdba7298","schema_version":"1.0","event_id":"sha256:90dd11b0ba8f89fa968c9229203cfab88a264173b448608764d8e1debdba7298"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NS23CKRJQFHDTHSMXQFGRKAFE3","target":"graph","payload":{"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"},"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-05T07:00:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJ/GNU6di0ClL6kT9jXs4emALq/8ZaBize0VWHZKIslYakh/PgHWJY7pUE4a4P69zWHyafl5/waXuy41KIrQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:48:18.422834Z"},"content_sha256":"9409ca17914811673ef50dcae10095c6cbbe13b9e61c1f38cca1f5339e981a2a","schema_version":"1.0","event_id":"sha256:9409ca17914811673ef50dcae10095c6cbbe13b9e61c1f38cca1f5339e981a2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/bundle.json","state_url":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/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-06T11:48:18Z","links":{"resolver":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3","bundle":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/bundle.json","state":"https://pith.science/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NS23CKRJQFHDTHSMXQFGRKAFE3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B9LNv+Qh+wkkfAm/zbJF1pTeeXFdb7+eVqFMMcZxwW/bSztY2HeXeZmeipxs8sITXgK2Loq0qfPcbdXMR0THCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:48:18.426792Z","bundle_sha256":"068a161f7bf722c61da03437f122915db60e3bcca772080773f3ead5df2f3bc7"}}