{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OZCB6H2CWEPEZN5BUNKC4DHGWN","short_pith_number":"pith:OZCB6H2C","schema_version":"1.0","canonical_sha256":"76441f1f42b11e4cb7a1a3542e0ce6b36087f99a45e1e6d5027a12ec236658ad","source":{"kind":"arxiv","id":"1507.08751","version":3},"attestation_state":"computed","paper":{"title":"Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"Frank Ong, Michael Lustig","submitted_at":"2015-07-31T04:46:25Z","abstract_excerpt":"We present a natural generalization of the recent low rank + sparse matrix decomposition and consider the decomposition of matrices into components of multiple scales. Such decomposition is well motivated in practice as data matrices often exhibit local correlations in multiple scales. Concretely, we propose a multi-scale low rank modeling that represents a data matrix as a sum of block-wise low rank matrices with increasing scales of block sizes. We then consider the inverse problem of decomposing the data matrix into its multi-scale low rank components and approach the problem via a convex f"},"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":"1507.08751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-07-31T04:46:25Z","cross_cats_sorted":["cs.IT","cs.NA","math.IT","math.OC"],"title_canon_sha256":"370df9572228b54cef914a51c39b80329b89e56eec225d5e9b7113dcb17e73ca","abstract_canon_sha256":"b647ef91393e97de83bd5980b4b6af09dcfa107e9734f01fca027f34e374a9b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:57.929725Z","signature_b64":"wWEnHy47LSvtLo2RjpVDDWPD1SVdGlhL9ESzC5rmg2YiGILFRNYA8QAiddv2iJSfvzeVJKzSfIioa0zS3p5CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76441f1f42b11e4cb7a1a3542e0ce6b36087f99a45e1e6d5027a12ec236658ad","last_reissued_at":"2026-05-18T01:09:57.929044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:57.929044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Low Rank + Sparse: Multi-scale Low Rank Matrix Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NA","math.IT","math.OC"],"primary_cat":"cs.SY","authors_text":"Frank Ong, Michael Lustig","submitted_at":"2015-07-31T04:46:25Z","abstract_excerpt":"We present a natural generalization of the recent low rank + sparse matrix decomposition and consider the decomposition of matrices into components of multiple scales. Such decomposition is well motivated in practice as data matrices often exhibit local correlations in multiple scales. Concretely, we propose a multi-scale low rank modeling that represents a data matrix as a sum of block-wise low rank matrices with increasing scales of block sizes. We then consider the inverse problem of decomposing the data matrix into its multi-scale low rank components and approach the problem via a convex f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08751","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1507.08751","created_at":"2026-05-18T01:09:57.929140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08751v3","created_at":"2026-05-18T01:09:57.929140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08751","created_at":"2026-05-18T01:09:57.929140+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZCB6H2CWEPE","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZCB6H2CWEPEZN5B","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZCB6H2C","created_at":"2026-05-18T12:29:34.919912+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/OZCB6H2CWEPEZN5BUNKC4DHGWN","json":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN.json","graph_json":"https://pith.science/api/pith-number/OZCB6H2CWEPEZN5BUNKC4DHGWN/graph.json","events_json":"https://pith.science/api/pith-number/OZCB6H2CWEPEZN5BUNKC4DHGWN/events.json","paper":"https://pith.science/paper/OZCB6H2C"},"agent_actions":{"view_html":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN","download_json":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN.json","view_paper":"https://pith.science/paper/OZCB6H2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08751&json=true","fetch_graph":"https://pith.science/api/pith-number/OZCB6H2CWEPEZN5BUNKC4DHGWN/graph.json","fetch_events":"https://pith.science/api/pith-number/OZCB6H2CWEPEZN5BUNKC4DHGWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN/action/storage_attestation","attest_author":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN/action/author_attestation","sign_citation":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN/action/citation_signature","submit_replication":"https://pith.science/pith/OZCB6H2CWEPEZN5BUNKC4DHGWN/action/replication_record"}},"created_at":"2026-05-18T01:09:57.929140+00:00","updated_at":"2026-05-18T01:09:57.929140+00:00"}