{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AGAMTSC52RCQWSMCGF6KB3NNUH","short_pith_number":"pith:AGAMTSC5","schema_version":"1.0","canonical_sha256":"0180c9c85dd4450b4982317ca0edada1f48c900a0cc858e98eb6f0438d7b3e8f","source":{"kind":"arxiv","id":"1602.00412","version":2},"attestation_state":"computed","paper":{"title":"Efficient Frequent Directions Algorithm for Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edo Liberty, Jeff M. Phillips, Mina Ghashami","submitted_at":"2016-02-01T07:33:02Z","abstract_excerpt":"This paper describes Sparse Frequent Directions, a variant of Frequent Directions for sketching sparse matrices. It resembles the original algorithm in many ways: both receive the rows of an input matrix $A^{n \\times d}$ one by one in the streaming setting and compute a small sketch $B \\in R^{\\ell \\times d}$. Both share the same strong (provably optimal) asymptotic guarantees with respect to the space-accuracy tradeoff in the streaming setting. However, unlike Frequent Directions which runs in $O(nd\\ell)$ time regardless of the sparsity of the input matrix $A$, Sparse Frequent Directions runs "},"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":"1602.00412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-01T07:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"f07d51e834634ea506ba3067d9ea1ae36310250d6ba9a2df77c537750538790a","abstract_canon_sha256":"ccb8185c4b1f8ed23844d2b5a7d2c3349a3891c00850c9f8d3c48758801289ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:28.976734Z","signature_b64":"K6SBnBQNkI7wErTymGg1ynTZZSDZFEnk64JEn5L5f+U7qnkzfON0qWQPAyUPUKDqNZHTH9QWvn5s6AMHR96PDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0180c9c85dd4450b4982317ca0edada1f48c900a0cc858e98eb6f0438d7b3e8f","last_reissued_at":"2026-05-18T01:20:28.975933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:28.975933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Frequent Directions Algorithm for Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Edo Liberty, Jeff M. Phillips, Mina Ghashami","submitted_at":"2016-02-01T07:33:02Z","abstract_excerpt":"This paper describes Sparse Frequent Directions, a variant of Frequent Directions for sketching sparse matrices. It resembles the original algorithm in many ways: both receive the rows of an input matrix $A^{n \\times d}$ one by one in the streaming setting and compute a small sketch $B \\in R^{\\ell \\times d}$. Both share the same strong (provably optimal) asymptotic guarantees with respect to the space-accuracy tradeoff in the streaming setting. However, unlike Frequent Directions which runs in $O(nd\\ell)$ time regardless of the sparsity of the input matrix $A$, Sparse Frequent Directions runs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00412","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":"1602.00412","created_at":"2026-05-18T01:20:28.976067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00412v2","created_at":"2026-05-18T01:20:28.976067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00412","created_at":"2026-05-18T01:20:28.976067+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGAMTSC52RCQ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGAMTSC52RCQWSMC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGAMTSC5","created_at":"2026-05-18T12:30:07.202191+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/AGAMTSC52RCQWSMCGF6KB3NNUH","json":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH.json","graph_json":"https://pith.science/api/pith-number/AGAMTSC52RCQWSMCGF6KB3NNUH/graph.json","events_json":"https://pith.science/api/pith-number/AGAMTSC52RCQWSMCGF6KB3NNUH/events.json","paper":"https://pith.science/paper/AGAMTSC5"},"agent_actions":{"view_html":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH","download_json":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH.json","view_paper":"https://pith.science/paper/AGAMTSC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00412&json=true","fetch_graph":"https://pith.science/api/pith-number/AGAMTSC52RCQWSMCGF6KB3NNUH/graph.json","fetch_events":"https://pith.science/api/pith-number/AGAMTSC52RCQWSMCGF6KB3NNUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH/action/storage_attestation","attest_author":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH/action/author_attestation","sign_citation":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH/action/citation_signature","submit_replication":"https://pith.science/pith/AGAMTSC52RCQWSMCGF6KB3NNUH/action/replication_record"}},"created_at":"2026-05-18T01:20:28.976067+00:00","updated_at":"2026-05-18T01:20:28.976067+00:00"}