{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FKODJ3NMUP35YBXJKMNF74EVHZ","short_pith_number":"pith:FKODJ3NM","schema_version":"1.0","canonical_sha256":"2a9c34edaca3f7dc06e9531a5ff0953e5a6ba03c78fa9f9cce5048a987c8664f","source":{"kind":"arxiv","id":"1501.01711","version":2},"attestation_state":"computed","paper":{"title":"Frequent Directions : Simple and Deterministic Matrix Sketching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Edo Liberty, Jeff M. Phillips, Mina Ghashami","submitted_at":"2015-01-08T02:32:32Z","abstract_excerpt":"We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix $A \\in R^{n \\times d}$ one row at a time. It performed $O(d \\times \\ell)$ operations per row and maintains a sketch matrix $B \\in R^{\\ell \\times d}$ such that for any $k < \\ell$\n  $\\|A^TA - B^TB \\|_2 \\leq \\|A - A_k\\|_F^2 / (\\ell-k)$ and $\\|A - \\pi_{B_k}(A)\\|_F^2 \\leq \\big(1 + \\frac{k}{\\ell-k}\\big) \\|A-A_k\\|_F^2 $ .\n  Here, $A_k$ stands for the minimizer of $\\|A - A_k\\|_F$ over all rank $k$ matrices (similarly $B_k$) and $\\pi_{B"},"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":"1501.01711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-08T02:32:32Z","cross_cats_sorted":[],"title_canon_sha256":"ca730cf89a77499de4cea108568673e942068e7caeee9a1b32937a890b2892e2","abstract_canon_sha256":"74a89d0531f77fad56f27924744055118b647d7d7093775833b3f624c7ec2164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:21.402191Z","signature_b64":"laoTSOX0/nBO0CbzfB5QkbW3J1a2drLc0ByGOm/m7XTCD6wE3y5+GqANvmC99VmMVYr9aNxtKFKkAFum+69BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a9c34edaca3f7dc06e9531a5ff0953e5a6ba03c78fa9f9cce5048a987c8664f","last_reissued_at":"2026-05-18T02:18:21.401439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:21.401439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frequent Directions : Simple and Deterministic Matrix Sketching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Edo Liberty, Jeff M. Phillips, Mina Ghashami","submitted_at":"2015-01-08T02:32:32Z","abstract_excerpt":"We describe a new algorithm called Frequent Directions for deterministic matrix sketching in the row-updates model. The algorithm is presented an arbitrary input matrix $A \\in R^{n \\times d}$ one row at a time. It performed $O(d \\times \\ell)$ operations per row and maintains a sketch matrix $B \\in R^{\\ell \\times d}$ such that for any $k < \\ell$\n  $\\|A^TA - B^TB \\|_2 \\leq \\|A - A_k\\|_F^2 / (\\ell-k)$ and $\\|A - \\pi_{B_k}(A)\\|_F^2 \\leq \\big(1 + \\frac{k}{\\ell-k}\\big) \\|A-A_k\\|_F^2 $ .\n  Here, $A_k$ stands for the minimizer of $\\|A - A_k\\|_F$ over all rank $k$ matrices (similarly $B_k$) and $\\pi_{B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01711","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.01711","created_at":"2026-05-18T02:18:21.401568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01711v2","created_at":"2026-05-18T02:18:21.401568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01711","created_at":"2026-05-18T02:18:21.401568+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKODJ3NMUP35","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKODJ3NMUP35YBXJ","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKODJ3NM","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20078","citing_title":"Improved large-scale graph learning through ridge spectral sparsification","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ","json":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ.json","graph_json":"https://pith.science/api/pith-number/FKODJ3NMUP35YBXJKMNF74EVHZ/graph.json","events_json":"https://pith.science/api/pith-number/FKODJ3NMUP35YBXJKMNF74EVHZ/events.json","paper":"https://pith.science/paper/FKODJ3NM"},"agent_actions":{"view_html":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ","download_json":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ.json","view_paper":"https://pith.science/paper/FKODJ3NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01711&json=true","fetch_graph":"https://pith.science/api/pith-number/FKODJ3NMUP35YBXJKMNF74EVHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FKODJ3NMUP35YBXJKMNF74EVHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ/action/storage_attestation","attest_author":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ/action/author_attestation","sign_citation":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ/action/citation_signature","submit_replication":"https://pith.science/pith/FKODJ3NMUP35YBXJKMNF74EVHZ/action/replication_record"}},"created_at":"2026-05-18T02:18:21.401568+00:00","updated_at":"2026-05-18T02:18:21.401568+00:00"}