{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4MBA4NOE6PJD4MPRIS2LVY4IMO","short_pith_number":"pith:4MBA4NOE","canonical_record":{"source":{"id":"2412.11963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-16T16:45:16Z","cross_cats_sorted":[],"title_canon_sha256":"6fa7aaed3040c44e28dcf6c78584ae2b44e688a13b0944361503bb2007f18582","abstract_canon_sha256":"73218e9f1b65adee791c9fc1b2e2a5f71fee062c75ebea892e749b79d4a36dd3"},"schema_version":"1.0"},"canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","source":{"kind":"arxiv","id":"2412.11963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.11963","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"2412.11963v1","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11963","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"4MBA4NOE6PJD","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_16","alias_value":"4MBA4NOE6PJD4MPR","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_8","alias_value":"4MBA4NOE","created_at":"2026-07-05T09:49:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4MBA4NOE6PJD4MPRIS2LVY4IMO","target":"record","payload":{"canonical_record":{"source":{"id":"2412.11963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-16T16:45:16Z","cross_cats_sorted":[],"title_canon_sha256":"6fa7aaed3040c44e28dcf6c78584ae2b44e688a13b0944361503bb2007f18582","abstract_canon_sha256":"73218e9f1b65adee791c9fc1b2e2a5f71fee062c75ebea892e749b79d4a36dd3"},"schema_version":"1.0"},"canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:54.552076Z","signature_b64":"+S0jDz1O28MhKqpvRT19SWAbppsk5Pk4zT5AdiQuOgiEKwILM6XxpSAsSgOWiTj7FarclJ4sc/KCynQLEa1ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","last_reissued_at":"2026-07-05T09:49:54.551536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:54.551536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.11963","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-07-05T09:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2N4jKqWQFI5brRL9TN27cjcmqPrKvJ6UBKnEsPxd7dQ3+Qa/wl1G3jHNDql8C92TNWThltunaVTZ3i1heISDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:26:43.330299Z"},"content_sha256":"563c9c1c00dd3b697b8e40c7b98849386de5d918f33a382cb4a2ef4a654a2dee","schema_version":"1.0","event_id":"sha256:563c9c1c00dd3b697b8e40c7b98849386de5d918f33a382cb4a2ef4a654a2dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4MBA4NOE6PJD4MPRIS2LVY4IMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Top Eigenvector in Random Order Streams","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Praneeth Kacham","submitted_at":"2024-12-16T16:45:16Z","abstract_excerpt":"When rows of an $n \\times d$ matrix $A$ are given in a stream, we study algorithms for approximating the top eigenvector of the matrix ${A}^TA$ (equivalently, the top right singular vector of $A$). We consider worst case inputs $A$ but assume that the rows are presented to the streaming algorithm in a uniformly random order. We show that when the gap parameter $R = \\sigma_1(A)^2/\\sigma_2(A)^2 = \\Omega(1)$, then there is a randomized algorithm that uses $O(h \\cdot d \\cdot \\operatorname{polylog}(d))$ bits of space and outputs a unit vector $v$ that has a correlation $1 - O(1/\\sqrt{R})$ with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11963","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.11963/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-05T09:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JkxbdKy835zli84OllXrpCBQgwfmpt1G408HHQR7iNHzFvMV3wmlTs65TxxawXMkRyjPyY+U3O7rfMEcqN1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:26:43.330827Z"},"content_sha256":"dd7e91602ac5567f6e4f8335a7136a64a036467ff54ae9c64eeba8115965dfcc","schema_version":"1.0","event_id":"sha256:dd7e91602ac5567f6e4f8335a7136a64a036467ff54ae9c64eeba8115965dfcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/bundle.json","state_url":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/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-18T14:26:43Z","links":{"resolver":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO","bundle":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/bundle.json","state":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4MBA4NOE6PJD4MPRIS2LVY4IMO","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":"73218e9f1b65adee791c9fc1b2e2a5f71fee062c75ebea892e749b79d4a36dd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-16T16:45:16Z","title_canon_sha256":"6fa7aaed3040c44e28dcf6c78584ae2b44e688a13b0944361503bb2007f18582"},"schema_version":"1.0","source":{"id":"2412.11963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.11963","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"2412.11963v1","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11963","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"4MBA4NOE6PJD","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_16","alias_value":"4MBA4NOE6PJD4MPR","created_at":"2026-07-05T09:49:54Z"},{"alias_kind":"pith_short_8","alias_value":"4MBA4NOE","created_at":"2026-07-05T09:49:54Z"}],"graph_snapshots":[{"event_id":"sha256:dd7e91602ac5567f6e4f8335a7136a64a036467ff54ae9c64eeba8115965dfcc","target":"graph","created_at":"2026-07-05T09:49: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/2412.11963/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When rows of an $n \\times d$ matrix $A$ are given in a stream, we study algorithms for approximating the top eigenvector of the matrix ${A}^TA$ (equivalently, the top right singular vector of $A$). We consider worst case inputs $A$ but assume that the rows are presented to the streaming algorithm in a uniformly random order. We show that when the gap parameter $R = \\sigma_1(A)^2/\\sigma_2(A)^2 = \\Omega(1)$, then there is a randomized algorithm that uses $O(h \\cdot d \\cdot \\operatorname{polylog}(d))$ bits of space and outputs a unit vector $v$ that has a correlation $1 - O(1/\\sqrt{R})$ with the ","authors_text":"David P. Woodruff, Praneeth Kacham","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11963","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:563c9c1c00dd3b697b8e40c7b98849386de5d918f33a382cb4a2ef4a654a2dee","target":"record","created_at":"2026-07-05T09:49: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":"73218e9f1b65adee791c9fc1b2e2a5f71fee062c75ebea892e749b79d4a36dd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-16T16:45:16Z","title_canon_sha256":"6fa7aaed3040c44e28dcf6c78584ae2b44e688a13b0944361503bb2007f18582"},"schema_version":"1.0","source":{"id":"2412.11963","kind":"arxiv","version":1}},"canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","first_computed_at":"2026-07-05T09:49:54.551536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:49:54.551536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+S0jDz1O28MhKqpvRT19SWAbppsk5Pk4zT5AdiQuOgiEKwILM6XxpSAsSgOWiTj7FarclJ4sc/KCynQLEa1ABw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:49:54.552076Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.11963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:563c9c1c00dd3b697b8e40c7b98849386de5d918f33a382cb4a2ef4a654a2dee","sha256:dd7e91602ac5567f6e4f8335a7136a64a036467ff54ae9c64eeba8115965dfcc"],"state_sha256":"3df86e4beaf5d608b2b78273c54660943e1142bf8db2cb5bc038aa699a9a96fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2De853S59/SL0o/9I2p+ag4P8WNSTAptO14xWJJN7lWdO74b3V2PQyOFM1hZRrlclYNU9n33MCvYOkkm6YYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:26:43.336671Z","bundle_sha256":"446cc843dcdeb9f6c52b2f2efcb43002ed17036fe872a0368af3d088a39ae3aa"}}