{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KPSPZCQSVBSY2WPNB7BLXBZ3GI","short_pith_number":"pith:KPSPZCQS","schema_version":"1.0","canonical_sha256":"53e4fc8a12a8658d59ed0fc2bb873b32046e3fc7fb906d6404fe9cd14a726952","source":{"kind":"arxiv","id":"2504.21175","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Shiyuan Feng, William Swartworth","submitted_at":"2025-04-29T20:52:00Z","abstract_excerpt":"We consider the heavy-hitters and $F_p$ moment estimation problems in the sliding window model. For $F_p$ moment estimation with $1<p\\leq 2$, we show that it is possible to give a $(1\\pm \\epsilon)$ multiplicative approximation to the $F_p$ moment with $2/3$ probability on any given window of size $n$ using $\\tilde{O}(\\frac{1}{\\epsilon^p}\\log^2 n + \\frac{1}{\\epsilon^2}\\log n)$ bits of space. We complement this result with a lower bound showing that our algorithm gives tight bounds up to factors of $\\log\\log n$ and $\\log\\frac{1}{\\epsilon}.$ As a consequence of our $F_2$ moment estimation algorit"},"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":"2504.21175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T20:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"cf27dabd6ee911b2e98f14a833d5044811f39220328be457a3b5cfc2362e3515","abstract_canon_sha256":"f3723cb7f73df6c8394aebc2aae148200e102b424b9dd4aaf3c940aea70cec5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:58.454813Z","signature_b64":"43Kze9fVatTE6Jua3JRNFJrk4ouEFjzaeruum3vAACmyPQYni/DG44B/ACbogtyGPtKji2c6iUaT+3BzcQAsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e4fc8a12a8658d59ed0fc2bb873b32046e3fc7fb906d6404fe9cd14a726952","last_reissued_at":"2026-07-05T10:55:58.454267Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:58.454267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Shiyuan Feng, William Swartworth","submitted_at":"2025-04-29T20:52:00Z","abstract_excerpt":"We consider the heavy-hitters and $F_p$ moment estimation problems in the sliding window model. For $F_p$ moment estimation with $1<p\\leq 2$, we show that it is possible to give a $(1\\pm \\epsilon)$ multiplicative approximation to the $F_p$ moment with $2/3$ probability on any given window of size $n$ using $\\tilde{O}(\\frac{1}{\\epsilon^p}\\log^2 n + \\frac{1}{\\epsilon^2}\\log n)$ bits of space. We complement this result with a lower bound showing that our algorithm gives tight bounds up to factors of $\\log\\log n$ and $\\log\\frac{1}{\\epsilon}.$ As a consequence of our $F_2$ moment estimation algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21175","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/2504.21175/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":"2504.21175","created_at":"2026-07-05T10:55:58.454327+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.21175v1","created_at":"2026-07-05T10:55:58.454327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21175","created_at":"2026-07-05T10:55:58.454327+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPSPZCQSVBSY","created_at":"2026-07-05T10:55:58.454327+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPSPZCQSVBSY2WPN","created_at":"2026-07-05T10:55:58.454327+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPSPZCQS","created_at":"2026-07-05T10:55:58.454327+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/KPSPZCQSVBSY2WPNB7BLXBZ3GI","json":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI.json","graph_json":"https://pith.science/api/pith-number/KPSPZCQSVBSY2WPNB7BLXBZ3GI/graph.json","events_json":"https://pith.science/api/pith-number/KPSPZCQSVBSY2WPNB7BLXBZ3GI/events.json","paper":"https://pith.science/paper/KPSPZCQS"},"agent_actions":{"view_html":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI","download_json":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI.json","view_paper":"https://pith.science/paper/KPSPZCQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.21175&json=true","fetch_graph":"https://pith.science/api/pith-number/KPSPZCQSVBSY2WPNB7BLXBZ3GI/graph.json","fetch_events":"https://pith.science/api/pith-number/KPSPZCQSVBSY2WPNB7BLXBZ3GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI/action/storage_attestation","attest_author":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI/action/author_attestation","sign_citation":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI/action/citation_signature","submit_replication":"https://pith.science/pith/KPSPZCQSVBSY2WPNB7BLXBZ3GI/action/replication_record"}},"created_at":"2026-07-05T10:55:58.454327+00:00","updated_at":"2026-07-05T10:55:58.454327+00:00"}