{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:737YZOJWMAZUVI4YVGDUXWURUT","short_pith_number":"pith:737YZOJW","canonical_record":{"source":{"id":"1505.05901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-21T21:04:33Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"efd5f1a519ff3f3d756ae88fde14ea5740b0d52bdeec61fb621cb5ac6a65211d","abstract_canon_sha256":"e99070558a3beeabac08b7e84e3221598b0430fc14212f20de069eb2378165af"},"schema_version":"1.0"},"canonical_sha256":"feff8cb93660334aa398a9874bda91a4e783ddbeebdf497f2d888ca7b9a7da52","source":{"kind":"arxiv","id":"1505.05901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05901","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05901v2","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05901","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"737YZOJWMAZU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"737YZOJWMAZUVI4Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"737YZOJW","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:737YZOJWMAZUVI4YVGDUXWURUT","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-21T21:04:33Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"efd5f1a519ff3f3d756ae88fde14ea5740b0d52bdeec61fb621cb5ac6a65211d","abstract_canon_sha256":"e99070558a3beeabac08b7e84e3221598b0430fc14212f20de069eb2378165af"},"schema_version":"1.0"},"canonical_sha256":"feff8cb93660334aa398a9874bda91a4e783ddbeebdf497f2d888ca7b9a7da52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:28.726607Z","signature_b64":"+AJPRjuF57Hldgrl04SKg3Ue3bJoa8Qm8NzcAAdVBclM8YBx3SLx7THtRoMJs4dg7ZEo36qwfPqIbEYHDvCLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feff8cb93660334aa398a9874bda91a4e783ddbeebdf497f2d888ca7b9a7da52","last_reissued_at":"2026-05-18T00:48:28.726030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:28.726030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05901","source_version":2,"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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8xic1Xv5+yWyvJ0MFwWi9HzMfTQm+vPzwKwMW/wzDHFklm1XXMRnqZCXyquyRpf4x9/rIVXlCyiL4Ck12jZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:09.209906Z"},"content_sha256":"557ee164b582054e4f5e526211ef1533ea39c927483f80932bc2922e15e46786","schema_version":"1.0","event_id":"sha256:557ee164b582054e4f5e526211ef1533ea39c927483f80932bc2922e15e46786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:737YZOJWMAZUVI4YVGDUXWURUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Robust Subspace Recovery for High Dimensional Data Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"stat.ML","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2015-05-21T21:04:33Z","abstract_excerpt":"This paper explores and analyzes two randomized designs for robust Principal Component Analysis (PCA) employing low-dimensional data sketching. In one design, a data sketch is constructed using random column sampling followed by low dimensional embedding, while in the other, sketching is based on random column and row sampling. Both designs are shown to bring about substantial savings in complexity and memory requirements for robust subspace learning over conventional approaches that use the full scale data. A characterization of the sample and computational complexity of both designs is deriv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05901","kind":"arxiv","version":2},"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:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7qGT01bz1ddbmTsk/KEC8g2XuNZRUH0kXVT0545OZUkGAiJBVnApzZCpVFFS1wsyHXMhAc56dWZ28BItaRDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:09.210245Z"},"content_sha256":"196d87cceb20cf54cd86782eeec0542819474429f74d215e8409f6d64b145c23","schema_version":"1.0","event_id":"sha256:196d87cceb20cf54cd86782eeec0542819474429f74d215e8409f6d64b145c23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/737YZOJWMAZUVI4YVGDUXWURUT/bundle.json","state_url":"https://pith.science/pith/737YZOJWMAZUVI4YVGDUXWURUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/737YZOJWMAZUVI4YVGDUXWURUT/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-01T22:22:09Z","links":{"resolver":"https://pith.science/pith/737YZOJWMAZUVI4YVGDUXWURUT","bundle":"https://pith.science/pith/737YZOJWMAZUVI4YVGDUXWURUT/bundle.json","state":"https://pith.science/pith/737YZOJWMAZUVI4YVGDUXWURUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/737YZOJWMAZUVI4YVGDUXWURUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:737YZOJWMAZUVI4YVGDUXWURUT","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":"e99070558a3beeabac08b7e84e3221598b0430fc14212f20de069eb2378165af","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-21T21:04:33Z","title_canon_sha256":"efd5f1a519ff3f3d756ae88fde14ea5740b0d52bdeec61fb621cb5ac6a65211d"},"schema_version":"1.0","source":{"id":"1505.05901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05901","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05901v2","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05901","created_at":"2026-05-18T00:48:28Z"},{"alias_kind":"pith_short_12","alias_value":"737YZOJWMAZU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"737YZOJWMAZUVI4Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"737YZOJW","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:196d87cceb20cf54cd86782eeec0542819474429f74d215e8409f6d64b145c23","target":"graph","created_at":"2026-05-18T00:48:28Z","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 explores and analyzes two randomized designs for robust Principal Component Analysis (PCA) employing low-dimensional data sketching. In one design, a data sketch is constructed using random column sampling followed by low dimensional embedding, while in the other, sketching is based on random column and row sampling. Both designs are shown to bring about substantial savings in complexity and memory requirements for robust subspace learning over conventional approaches that use the full scale data. A characterization of the sample and computational complexity of both designs is deriv","authors_text":"George Atia, Mostafa Rahmani","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-21T21:04:33Z","title":"Randomized Robust Subspace Recovery for High Dimensional Data Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05901","kind":"arxiv","version":2},"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:557ee164b582054e4f5e526211ef1533ea39c927483f80932bc2922e15e46786","target":"record","created_at":"2026-05-18T00:48:28Z","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":"e99070558a3beeabac08b7e84e3221598b0430fc14212f20de069eb2378165af","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-21T21:04:33Z","title_canon_sha256":"efd5f1a519ff3f3d756ae88fde14ea5740b0d52bdeec61fb621cb5ac6a65211d"},"schema_version":"1.0","source":{"id":"1505.05901","kind":"arxiv","version":2}},"canonical_sha256":"feff8cb93660334aa398a9874bda91a4e783ddbeebdf497f2d888ca7b9a7da52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feff8cb93660334aa398a9874bda91a4e783ddbeebdf497f2d888ca7b9a7da52","first_computed_at":"2026-05-18T00:48:28.726030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:28.726030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+AJPRjuF57Hldgrl04SKg3Ue3bJoa8Qm8NzcAAdVBclM8YBx3SLx7THtRoMJs4dg7ZEo36qwfPqIbEYHDvCLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:28.726607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:557ee164b582054e4f5e526211ef1533ea39c927483f80932bc2922e15e46786","sha256:196d87cceb20cf54cd86782eeec0542819474429f74d215e8409f6d64b145c23"],"state_sha256":"af8eb2ada34ffaacdf0622a2048cd3b51922970d4c7b667ba3b7a311a0d911e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QBfnE/tWIlO9dxhLSri4VHRdFBkjUeDYWMS/Rc5ebrldc6h8rDn0+Lzc+pHmHlEAViWIKw6zXgVn932H18uBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:09.212104Z","bundle_sha256":"82a14730afd473f0b409802020c74df643da6cdedc013aca0667543945f7b884"}}