{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CHGXGBF3Y3BPWHFIGBGCIX3ALJ","short_pith_number":"pith:CHGXGBF3","schema_version":"1.0","canonical_sha256":"11cd7304bbc6c2fb1ca8304c245f605a7606decbd7a3adb57150a08e409f4151","source":{"kind":"arxiv","id":"1401.1763","version":2},"attestation_state":"computed","paper":{"title":"Approximating Large Frequency Moments with $O(n^{1-2/k})$ Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Charles Seidell, Gregory Vorsanger, Jonathan Katzman, Vladimir Braverman","submitted_at":"2014-01-08T18:05:26Z","abstract_excerpt":"In this paper we consider the problem of approximating frequency moments in the streaming model. Given a stream $D = \\{p_1,p_2,\\dots,p_m\\}$ of numbers from $\\{1,\\dots, n\\}$, a frequency of $i$ is defined as $f_i = |\\{j: p_j = i\\}|$. The $k$-th \\emph{frequency moment} of $D$ is defined as $F_k = \\sum_{i=1}^n f_i^k$.\n  In this paper we give an upper bound on the space required to find a $k$-th frequency moment of $O(n^{1-2/k})$ bits that matches, up to a constant factor, the lower bound of Woodruff and Zhang (STOC 12) for constant $\\epsilon$ and constant $k$. Our algorithm makes a single pass ov"},"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":"1401.1763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-08T18:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"36a7e11ba79627b461e3878ed6496823577992f47cf3a9472a90b57166f9ed87","abstract_canon_sha256":"2c99c7711cf10092ef970e67b9d8423a89a671778e093c9a1e625cadf0c066e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.943745Z","signature_b64":"no20SzhQekSBQg2sZOaMiZFNgPyFtkR33JLxzCk1UqUjZvbx9oZjgVIZHSJHAo9ZdERZ7TbjNo/ZurEe716eDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11cd7304bbc6c2fb1ca8304c245f605a7606decbd7a3adb57150a08e409f4151","last_reissued_at":"2026-05-18T03:01:01.943229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.943229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Large Frequency Moments with $O(n^{1-2/k})$ Bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Charles Seidell, Gregory Vorsanger, Jonathan Katzman, Vladimir Braverman","submitted_at":"2014-01-08T18:05:26Z","abstract_excerpt":"In this paper we consider the problem of approximating frequency moments in the streaming model. Given a stream $D = \\{p_1,p_2,\\dots,p_m\\}$ of numbers from $\\{1,\\dots, n\\}$, a frequency of $i$ is defined as $f_i = |\\{j: p_j = i\\}|$. The $k$-th \\emph{frequency moment} of $D$ is defined as $F_k = \\sum_{i=1}^n f_i^k$.\n  In this paper we give an upper bound on the space required to find a $k$-th frequency moment of $O(n^{1-2/k})$ bits that matches, up to a constant factor, the lower bound of Woodruff and Zhang (STOC 12) for constant $\\epsilon$ and constant $k$. Our algorithm makes a single pass ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1763","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":"1401.1763","created_at":"2026-05-18T03:01:01.943326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1763v2","created_at":"2026-05-18T03:01:01.943326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1763","created_at":"2026-05-18T03:01:01.943326+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHGXGBF3Y3BP","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHGXGBF3Y3BPWHFI","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHGXGBF3","created_at":"2026-05-18T12:28:22.404517+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/CHGXGBF3Y3BPWHFIGBGCIX3ALJ","json":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ.json","graph_json":"https://pith.science/api/pith-number/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/graph.json","events_json":"https://pith.science/api/pith-number/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/events.json","paper":"https://pith.science/paper/CHGXGBF3"},"agent_actions":{"view_html":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ","download_json":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ.json","view_paper":"https://pith.science/paper/CHGXGBF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1763&json=true","fetch_graph":"https://pith.science/api/pith-number/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/action/storage_attestation","attest_author":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/action/author_attestation","sign_citation":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/action/citation_signature","submit_replication":"https://pith.science/pith/CHGXGBF3Y3BPWHFIGBGCIX3ALJ/action/replication_record"}},"created_at":"2026-05-18T03:01:01.943326+00:00","updated_at":"2026-05-18T03:01:01.943326+00:00"}