{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HVJYFBCJLXFXT5V5KUHBO7OXJK","short_pith_number":"pith:HVJYFBCJ","schema_version":"1.0","canonical_sha256":"3d538284495dcb79f6bd550e177dd74a9bd0ce01dacd8291b6c101d17fc6a054","source":{"kind":"arxiv","id":"1212.0202","version":2},"attestation_state":"computed","paper":{"title":"Approximating Large Frequency Moments with Pick-and-Drop Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Vladimir Braverman","submitted_at":"2012-12-02T11:32:47Z","abstract_excerpt":"Given data stream $D = \\{p_1,p_2,...,p_m\\}$ of size $m$ of numbers from $\\{1,..., n\\}$, the 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$. We consider the problem of approximating frequency moments in insertion-only streams for $k\\ge 3$. For any constant $c$ we show an $O(n^{1-2/k}\\log(n)\\log^{(c)}(n))$ upper bound on the space complexity of the problem. Here $\\log^{(c)}(n)$ is the iterative $\\log$ function. To simplify the presentation, we make the following assumptions: $n$ and $m$ are polynomially "},"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":"1212.0202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-02T11:32:47Z","cross_cats_sorted":[],"title_canon_sha256":"74c833be1f74b864db259e7cccaf4c0a774dd7b29ba363dad1949f37c1b031df","abstract_canon_sha256":"f2feb2dd873f12b79a3ad930769718c2fe99bab5fbdb2d4b8b71cd16cc703d0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:15.841859Z","signature_b64":"xPPf5g3WWJ5Wq3GpVeTLd6afr0k161h70unL00XkeiprKf7FtAUinzd6vTDPKhY0WTy9KjOUnXh20jZtuaEFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d538284495dcb79f6bd550e177dd74a9bd0ce01dacd8291b6c101d17fc6a054","last_reissued_at":"2026-05-18T03:39:15.841220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:15.841220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Large Frequency Moments with Pick-and-Drop Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Rafail Ostrovsky, Vladimir Braverman","submitted_at":"2012-12-02T11:32:47Z","abstract_excerpt":"Given data stream $D = \\{p_1,p_2,...,p_m\\}$ of size $m$ of numbers from $\\{1,..., n\\}$, the 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$. We consider the problem of approximating frequency moments in insertion-only streams for $k\\ge 3$. For any constant $c$ we show an $O(n^{1-2/k}\\log(n)\\log^{(c)}(n))$ upper bound on the space complexity of the problem. Here $\\log^{(c)}(n)$ is the iterative $\\log$ function. To simplify the presentation, we make the following assumptions: $n$ and $m$ are polynomially "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0202","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":"1212.0202","created_at":"2026-05-18T03:39:15.841334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0202v2","created_at":"2026-05-18T03:39:15.841334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0202","created_at":"2026-05-18T03:39:15.841334+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVJYFBCJLXFX","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVJYFBCJLXFXT5V5","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVJYFBCJ","created_at":"2026-05-18T12:27:09.501522+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/HVJYFBCJLXFXT5V5KUHBO7OXJK","json":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK.json","graph_json":"https://pith.science/api/pith-number/HVJYFBCJLXFXT5V5KUHBO7OXJK/graph.json","events_json":"https://pith.science/api/pith-number/HVJYFBCJLXFXT5V5KUHBO7OXJK/events.json","paper":"https://pith.science/paper/HVJYFBCJ"},"agent_actions":{"view_html":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK","download_json":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK.json","view_paper":"https://pith.science/paper/HVJYFBCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0202&json=true","fetch_graph":"https://pith.science/api/pith-number/HVJYFBCJLXFXT5V5KUHBO7OXJK/graph.json","fetch_events":"https://pith.science/api/pith-number/HVJYFBCJLXFXT5V5KUHBO7OXJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK/action/storage_attestation","attest_author":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK/action/author_attestation","sign_citation":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK/action/citation_signature","submit_replication":"https://pith.science/pith/HVJYFBCJLXFXT5V5KUHBO7OXJK/action/replication_record"}},"created_at":"2026-05-18T03:39:15.841334+00:00","updated_at":"2026-05-18T03:39:15.841334+00:00"}