{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4MBA4NOE6PJD4MPRIS2LVY4IMO","short_pith_number":"pith:4MBA4NOE","schema_version":"1.0","canonical_sha256":"e3020e35c4f3d23e31f144b4bae3886394bf89ed8f578533c4808eca14512583","source":{"kind":"arxiv","id":"2412.11963","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.11963","created_at":"2026-07-05T09:49:54.551594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11963v1","created_at":"2026-07-05T09:49:54.551594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11963","created_at":"2026-07-05T09:49:54.551594+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MBA4NOE6PJD","created_at":"2026-07-05T09:49:54.551594+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MBA4NOE6PJD4MPR","created_at":"2026-07-05T09:49:54.551594+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MBA4NOE","created_at":"2026-07-05T09:49:54.551594+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/4MBA4NOE6PJD4MPRIS2LVY4IMO","json":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO.json","graph_json":"https://pith.science/api/pith-number/4MBA4NOE6PJD4MPRIS2LVY4IMO/graph.json","events_json":"https://pith.science/api/pith-number/4MBA4NOE6PJD4MPRIS2LVY4IMO/events.json","paper":"https://pith.science/paper/4MBA4NOE"},"agent_actions":{"view_html":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO","download_json":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO.json","view_paper":"https://pith.science/paper/4MBA4NOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11963&json=true","fetch_graph":"https://pith.science/api/pith-number/4MBA4NOE6PJD4MPRIS2LVY4IMO/graph.json","fetch_events":"https://pith.science/api/pith-number/4MBA4NOE6PJD4MPRIS2LVY4IMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/action/storage_attestation","attest_author":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/action/author_attestation","sign_citation":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/action/citation_signature","submit_replication":"https://pith.science/pith/4MBA4NOE6PJD4MPRIS2LVY4IMO/action/replication_record"}},"created_at":"2026-07-05T09:49:54.551594+00:00","updated_at":"2026-07-05T09:49:54.551594+00:00"}