{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X7YUZEHD27HRZZXCUL5QM34TWZ","short_pith_number":"pith:X7YUZEHD","canonical_record":{"source":{"id":"1307.0032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-28T21:38:17Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"99300e5e7349c4f0c0a53374c483bb75b31641b08435328ac7d0e8e74b50b5ff","abstract_canon_sha256":"a4a8ade441dba4a9437f02607e130e783f67e56af42f2a5928a06125087b814e"},"schema_version":"1.0"},"canonical_sha256":"bff14c90e3d7cf1ce6e2a2fb066f93b65461eb4a0b3617c11e51048c7d35790f","source":{"kind":"arxiv","id":"1307.0032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0032","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0032v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0032","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"X7YUZEHD27HR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X7YUZEHD27HRZZXC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X7YUZEHD","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X7YUZEHD27HRZZXCUL5QM34TWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-28T21:38:17Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"99300e5e7349c4f0c0a53374c483bb75b31641b08435328ac7d0e8e74b50b5ff","abstract_canon_sha256":"a4a8ade441dba4a9437f02607e130e783f67e56af42f2a5928a06125087b814e"},"schema_version":"1.0"},"canonical_sha256":"bff14c90e3d7cf1ce6e2a2fb066f93b65461eb4a0b3617c11e51048c7d35790f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.393056Z","signature_b64":"lwtriyZ9V6EduRbKJ89qehxr/PVgcHaUojO9dCXMOySXxHGgpD20mKiVuVZIKVrkWBBCIdtMd/h3ypMNo5tCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff14c90e3d7cf1ce6e2a2fb066f93b65461eb4a0b3617c11e51048c7d35790f","last_reissued_at":"2026-05-18T03:19:34.392445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.392445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0032","source_version":1,"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-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CjFmxRk03PGERE9PMG33XUhFZg7E9yEQVNyLsi/pVJiKs6w3NHzX8e3GUjioxKTvw8ar1hqJ0Ajpe5JeEchjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:48:16.980442Z"},"content_sha256":"deec1a03a21269cf95d5bef4473d22c0d17248a94a45fc08325289f983a57cb1","schema_version":"1.0","event_id":"sha256:deec1a03a21269cf95d5bef4473d22c0d17248a94a45fc08325289f983a57cb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X7YUZEHD27HRZZXCUL5QM34TWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Limited, Streaming PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Constantine Caramanis, Ioannis Mitliagkas, Prateek Jain","submitted_at":"2013-06-28T21:38:17Z","abstract_excerpt":"We consider streaming, one-pass principal component analysis (PCA), in the high-dimensional regime, with limited memory. Here, $p$-dimensional samples are presented sequentially, and the goal is to produce the $k$-dimensional subspace that best approximates these points. Standard algorithms require $O(p^2)$ memory; meanwhile no algorithm can do better than $O(kp)$ memory, since this is what the output itself requires. Memory (or storage) complexity is most meaningful when understood in the context of computational and sample complexity. Sample complexity for high-dimensional PCA is typically s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0032","kind":"arxiv","version":1},"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-18T03:19:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaceXEorBeap5g/7zwmkzMZ+PKJme5bNcAQJCeL9r7qmiliBJG8E/7hv6SQnaUORT8gUkFTFOvkyZ7SrCmeVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:48:16.981078Z"},"content_sha256":"466dd492aa697c18372016ff649f967cb071b47d420d7468632f0133edd4e149","schema_version":"1.0","event_id":"sha256:466dd492aa697c18372016ff649f967cb071b47d420d7468632f0133edd4e149"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/bundle.json","state_url":"https://pith.science/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/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-05-30T14:48:16Z","links":{"resolver":"https://pith.science/pith/X7YUZEHD27HRZZXCUL5QM34TWZ","bundle":"https://pith.science/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/bundle.json","state":"https://pith.science/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7YUZEHD27HRZZXCUL5QM34TWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X7YUZEHD27HRZZXCUL5QM34TWZ","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":"a4a8ade441dba4a9437f02607e130e783f67e56af42f2a5928a06125087b814e","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-28T21:38:17Z","title_canon_sha256":"99300e5e7349c4f0c0a53374c483bb75b31641b08435328ac7d0e8e74b50b5ff"},"schema_version":"1.0","source":{"id":"1307.0032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0032","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0032v1","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0032","created_at":"2026-05-18T03:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"X7YUZEHD27HR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X7YUZEHD27HRZZXC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X7YUZEHD","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:466dd492aa697c18372016ff649f967cb071b47d420d7468632f0133edd4e149","target":"graph","created_at":"2026-05-18T03:19:34Z","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":"We consider streaming, one-pass principal component analysis (PCA), in the high-dimensional regime, with limited memory. Here, $p$-dimensional samples are presented sequentially, and the goal is to produce the $k$-dimensional subspace that best approximates these points. Standard algorithms require $O(p^2)$ memory; meanwhile no algorithm can do better than $O(kp)$ memory, since this is what the output itself requires. Memory (or storage) complexity is most meaningful when understood in the context of computational and sample complexity. Sample complexity for high-dimensional PCA is typically s","authors_text":"Constantine Caramanis, Ioannis Mitliagkas, Prateek Jain","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-28T21:38:17Z","title":"Memory Limited, Streaming PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0032","kind":"arxiv","version":1},"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:deec1a03a21269cf95d5bef4473d22c0d17248a94a45fc08325289f983a57cb1","target":"record","created_at":"2026-05-18T03:19:34Z","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":"a4a8ade441dba4a9437f02607e130e783f67e56af42f2a5928a06125087b814e","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-28T21:38:17Z","title_canon_sha256":"99300e5e7349c4f0c0a53374c483bb75b31641b08435328ac7d0e8e74b50b5ff"},"schema_version":"1.0","source":{"id":"1307.0032","kind":"arxiv","version":1}},"canonical_sha256":"bff14c90e3d7cf1ce6e2a2fb066f93b65461eb4a0b3617c11e51048c7d35790f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff14c90e3d7cf1ce6e2a2fb066f93b65461eb4a0b3617c11e51048c7d35790f","first_computed_at":"2026-05-18T03:19:34.392445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:34.392445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwtriyZ9V6EduRbKJ89qehxr/PVgcHaUojO9dCXMOySXxHGgpD20mKiVuVZIKVrkWBBCIdtMd/h3ypMNo5tCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:34.393056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:deec1a03a21269cf95d5bef4473d22c0d17248a94a45fc08325289f983a57cb1","sha256:466dd492aa697c18372016ff649f967cb071b47d420d7468632f0133edd4e149"],"state_sha256":"c3dd7967542c0fc4725e2dafbe7ae652710b7e65724679f538a1a7a77e749f15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJFtKbsaHwgMCWFqEgFxE75DJ0XVcdf33m8WQl91MRRCJxh5n2VhFQefA4AJvnjfqLyw7pdTDjvn8TBCAZ2aDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:48:16.983722Z","bundle_sha256":"ea7f135c04c069b941a001ec38f60716b3b0957d6e7d6b59628b15c7a33e5099"}}