{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MKQZOAJHBKY7CDKNIDAN2ZVUJF","short_pith_number":"pith:MKQZOAJH","schema_version":"1.0","canonical_sha256":"62a19701270ab1f10d4d40c0dd66b44973ccbdc91498e4b8f5c3fb7f96c1ffbe","source":{"kind":"arxiv","id":"2505.14250","version":1},"attestation_state":"computed","paper":{"title":"Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Xiaoyi Zhu, Zengfeng Huang, Zhewei Wei, Zhongzheng Xiong","submitted_at":"2025-05-20T12:04:20Z","abstract_excerpt":"We consider the problems of distributed heavy hitters and frequency moments in both the coordinator model and the distributed tracking model (also known as the distributed functional monitoring model). We present simple and optimal (up to logarithmic factors) algorithms for $\\ell_p$ heavy hitters and $F_p$ estimation ($p \\geq 2$) in these distributed models.\n  For $\\ell_p$ heavy hitters in the coordinator model, our algorithm requires only one round and uses $\\tilde{O}(k^{p-1}/\\eps^p)$ bits of communication. For $p > 2$, this is the first near-optimal result. By combining our algorithm with th"},"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":"2505.14250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T12:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"f1f5b9dee8f5e974aea33d49c91205df6f1627f9e731089e2994c1b46277a788","abstract_canon_sha256":"07850e279394d1b96c00fec96709ad790edac5dbcb9a9e3d68dbbdcc4bd623b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:58.451466Z","signature_b64":"jBh6or6ffe+WYuH7jeIovrcq62xR8cqVn8l4AB6avix/9iDo9uwplADx7tDhIaBfKiHNyeFIb4pa7qnnhuySAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a19701270ab1f10d4d40c0dd66b44973ccbdc91498e4b8f5c3fb7f96c1ffbe","last_reissued_at":"2026-07-05T11:05:58.451046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:58.451046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Xiaoyi Zhu, Zengfeng Huang, Zhewei Wei, Zhongzheng Xiong","submitted_at":"2025-05-20T12:04:20Z","abstract_excerpt":"We consider the problems of distributed heavy hitters and frequency moments in both the coordinator model and the distributed tracking model (also known as the distributed functional monitoring model). We present simple and optimal (up to logarithmic factors) algorithms for $\\ell_p$ heavy hitters and $F_p$ estimation ($p \\geq 2$) in these distributed models.\n  For $\\ell_p$ heavy hitters in the coordinator model, our algorithm requires only one round and uses $\\tilde{O}(k^{p-1}/\\eps^p)$ bits of communication. For $p > 2$, this is the first near-optimal result. By combining our algorithm with th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14250","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/2505.14250/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":"2505.14250","created_at":"2026-07-05T11:05:58.451102+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14250v1","created_at":"2026-07-05T11:05:58.451102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14250","created_at":"2026-07-05T11:05:58.451102+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKQZOAJHBKY7","created_at":"2026-07-05T11:05:58.451102+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKQZOAJHBKY7CDKN","created_at":"2026-07-05T11:05:58.451102+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKQZOAJH","created_at":"2026-07-05T11:05:58.451102+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/MKQZOAJHBKY7CDKNIDAN2ZVUJF","json":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF.json","graph_json":"https://pith.science/api/pith-number/MKQZOAJHBKY7CDKNIDAN2ZVUJF/graph.json","events_json":"https://pith.science/api/pith-number/MKQZOAJHBKY7CDKNIDAN2ZVUJF/events.json","paper":"https://pith.science/paper/MKQZOAJH"},"agent_actions":{"view_html":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF","download_json":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF.json","view_paper":"https://pith.science/paper/MKQZOAJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14250&json=true","fetch_graph":"https://pith.science/api/pith-number/MKQZOAJHBKY7CDKNIDAN2ZVUJF/graph.json","fetch_events":"https://pith.science/api/pith-number/MKQZOAJHBKY7CDKNIDAN2ZVUJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF/action/storage_attestation","attest_author":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF/action/author_attestation","sign_citation":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF/action/citation_signature","submit_replication":"https://pith.science/pith/MKQZOAJHBKY7CDKNIDAN2ZVUJF/action/replication_record"}},"created_at":"2026-07-05T11:05:58.451102+00:00","updated_at":"2026-07-05T11:05:58.451102+00:00"}