{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PXYD5GB3YOF35GEMNZWX665Z5V","short_pith_number":"pith:PXYD5GB3","canonical_record":{"source":{"id":"1502.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T00:57:57Z","cross_cats_sorted":["cs.DS","cs.LG","math.NA","stat.ML"],"title_canon_sha256":"bf929ca6241b7adc3dd5e22c8a12cb503fd843b98a0cfa7ba8c515a82691ef94","abstract_canon_sha256":"fa506ed74e4955ea6f76adfe436b1751ad5648c5d310db13c19b63de7288ad9d"},"schema_version":"1.0"},"canonical_sha256":"7df03e983bc38bbe988c6e6d7f7bb9ed735fe6c4b471f6ce1d01ffdb311ac0d6","source":{"kind":"arxiv","id":"1502.00182","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00182","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00182v3","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00182","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"PXYD5GB3YOF3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXYD5GB3YOF35GEM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXYD5GB3","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PXYD5GB3YOF35GEMNZWX665Z5V","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T00:57:57Z","cross_cats_sorted":["cs.DS","cs.LG","math.NA","stat.ML"],"title_canon_sha256":"bf929ca6241b7adc3dd5e22c8a12cb503fd843b98a0cfa7ba8c515a82691ef94","abstract_canon_sha256":"fa506ed74e4955ea6f76adfe436b1751ad5648c5d310db13c19b63de7288ad9d"},"schema_version":"1.0"},"canonical_sha256":"7df03e983bc38bbe988c6e6d7f7bb9ed735fe6c4b471f6ce1d01ffdb311ac0d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:37.672215Z","signature_b64":"uZVOKgp2cUNKqJBd2a/OMWiT27LB3knNKMjGILd5JhLapJKOGnDxat7jlsMx9ly5QaIC+3RCpTCyDxjsyblvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df03e983bc38bbe988c6e6d7f7bb9ed735fe6c4b471f6ce1d01ffdb311ac0d6","last_reissued_at":"2026-05-18T00:48:37.671540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:37.671540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00182","source_version":3,"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-05-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMCqzMmso9SLN+daO7Ehk6uEtHlO0MB/0g7P5O4IqVB4LWqdaU3b0f1RN4M8vpWAOqawpShmUq7raqBF3D0jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:43:57.308281Z"},"content_sha256":"5c3a7f57a2b3f69a554862dbc6cffbdce3bc4dd0acfe7db248d3c56157ca8f8d","schema_version":"1.0","event_id":"sha256:5c3a7f57a2b3f69a554862dbc6cffbdce3bc4dd0acfe7db248d3c56157ca8f8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PXYD5GB3YOF35GEMNZWX665Z5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High Dimensional Low Rank plus Sparse Matrix Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.NA","stat.ML"],"primary_cat":"cs.NA","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2015-02-01T00:57:57Z","abstract_excerpt":"This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and are based on optimization problems with complexity that scales with the dimension of the data, which limits their scalability. Furthermore, existing randomized approaches mostly rely on uniform random sampling, which is quite inefficient for many real world data matrices that exhibit additional structures (e.g. clustering). In this paper, a scalable subspace-pursuit approach th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00182","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"},"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-05-18T00:48:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HAuAeCsJTL+A9qj2R8mUvRtJOv5DFjf6ffwpSEjIWTTKOwqLrKOtE9Z1DH1uAjhKgd62urRjs907MkFKNqC9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:43:57.309067Z"},"content_sha256":"00c1fb121c2841877b362b1e6609eaf0e8856ef1c2847d2d3516f0b33098d82b","schema_version":"1.0","event_id":"sha256:00c1fb121c2841877b362b1e6609eaf0e8856ef1c2847d2d3516f0b33098d82b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXYD5GB3YOF35GEMNZWX665Z5V/bundle.json","state_url":"https://pith.science/pith/PXYD5GB3YOF35GEMNZWX665Z5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXYD5GB3YOF35GEMNZWX665Z5V/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-06-08T17:43:57Z","links":{"resolver":"https://pith.science/pith/PXYD5GB3YOF35GEMNZWX665Z5V","bundle":"https://pith.science/pith/PXYD5GB3YOF35GEMNZWX665Z5V/bundle.json","state":"https://pith.science/pith/PXYD5GB3YOF35GEMNZWX665Z5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXYD5GB3YOF35GEMNZWX665Z5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PXYD5GB3YOF35GEMNZWX665Z5V","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":"fa506ed74e4955ea6f76adfe436b1751ad5648c5d310db13c19b63de7288ad9d","cross_cats_sorted":["cs.DS","cs.LG","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T00:57:57Z","title_canon_sha256":"bf929ca6241b7adc3dd5e22c8a12cb503fd843b98a0cfa7ba8c515a82691ef94"},"schema_version":"1.0","source":{"id":"1502.00182","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00182","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00182v3","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00182","created_at":"2026-05-18T00:48:37Z"},{"alias_kind":"pith_short_12","alias_value":"PXYD5GB3YOF3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXYD5GB3YOF35GEM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXYD5GB3","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:00c1fb121c2841877b362b1e6609eaf0e8856ef1c2847d2d3516f0b33098d82b","target":"graph","created_at":"2026-05-18T00:48:37Z","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"},"paper":{"abstract_excerpt":"This paper is concerned with the problem of low rank plus sparse matrix decomposition for big data. Conventional algorithms for matrix decomposition use the entire data to extract the low-rank and sparse components, and are based on optimization problems with complexity that scales with the dimension of the data, which limits their scalability. Furthermore, existing randomized approaches mostly rely on uniform random sampling, which is quite inefficient for many real world data matrices that exhibit additional structures (e.g. clustering). In this paper, a scalable subspace-pursuit approach th","authors_text":"George Atia, Mostafa Rahmani","cross_cats":["cs.DS","cs.LG","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T00:57:57Z","title":"High Dimensional Low Rank plus Sparse Matrix Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00182","kind":"arxiv","version":3},"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:5c3a7f57a2b3f69a554862dbc6cffbdce3bc4dd0acfe7db248d3c56157ca8f8d","target":"record","created_at":"2026-05-18T00:48:37Z","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":"fa506ed74e4955ea6f76adfe436b1751ad5648c5d310db13c19b63de7288ad9d","cross_cats_sorted":["cs.DS","cs.LG","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-02-01T00:57:57Z","title_canon_sha256":"bf929ca6241b7adc3dd5e22c8a12cb503fd843b98a0cfa7ba8c515a82691ef94"},"schema_version":"1.0","source":{"id":"1502.00182","kind":"arxiv","version":3}},"canonical_sha256":"7df03e983bc38bbe988c6e6d7f7bb9ed735fe6c4b471f6ce1d01ffdb311ac0d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7df03e983bc38bbe988c6e6d7f7bb9ed735fe6c4b471f6ce1d01ffdb311ac0d6","first_computed_at":"2026-05-18T00:48:37.671540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:37.671540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZVOKgp2cUNKqJBd2a/OMWiT27LB3knNKMjGILd5JhLapJKOGnDxat7jlsMx9ly5QaIC+3RCpTCyDxjsyblvAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:37.672215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00182","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3a7f57a2b3f69a554862dbc6cffbdce3bc4dd0acfe7db248d3c56157ca8f8d","sha256:00c1fb121c2841877b362b1e6609eaf0e8856ef1c2847d2d3516f0b33098d82b"],"state_sha256":"e0c343bd5662d8bf7ee8569a7be2e29ec550c56d2e868bd1c37cb224aa77435a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2+WRvtx293uS1TyDsCHg576ONHaykJo4expTTXormI24PMdC+GxkTxza4P2D3Hq81BXv6AxeiF20ACAHhIpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:43:57.312945Z","bundle_sha256":"f042991955189618b242c38c14ce14d081384125255745dae3aea0ddbd333ba1"}}