{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B6CD4BY736HAHXRDYRM45A6OT5","short_pith_number":"pith:B6CD4BY7","schema_version":"1.0","canonical_sha256":"0f843e071fdf8e03de23c459ce83ce9f53f4fd4fb1692d86866f62f069eb4da4","source":{"kind":"arxiv","id":"2411.02148","version":2},"attestation_state":"computed","paper":{"title":"Optimality of Frequency Moment Estimation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Mark Braverman, Or Zamir","submitted_at":"2024-11-04T15:06:16Z","abstract_excerpt":"Estimating the second frequency moment of a stream up to $(1\\pm\\varepsilon)$ multiplicative error requires at most $O(\\log n / \\varepsilon^2)$ bits of space, due to a seminal result of Alon, Matias, and Szegedy. It is also known that at least $\\Omega(\\log n + 1/\\varepsilon^{2})$ space is needed. We prove an optimal lower bound of $\\Omega\\left(\\log \\left(n \\varepsilon^2 \\right) / \\varepsilon^2\\right)$ for all $\\varepsilon = \\Omega(1/\\sqrt{n})$. Note that when $\\varepsilon>n^{-1/2 + c}$, where $c>0$, our lower bound matches the classic upper bound of AMS. For smaller values of $\\varepsilon$ we a"},"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":"2411.02148","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-04T15:06:16Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"47c1c645f06c5876da996aee57f01efc1bb8acc1f74d51ebf0d33cbf6bcd99bf","abstract_canon_sha256":"b34d7e5caf2378ff4b184fcc9c7f505613034b17569b3e8ff60ff9fad35f2c50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:21.329444Z","signature_b64":"hktpgi5O7uMFoEd7tbcPThVzJCxJmR7Pl6EK4i3DlT8q7hAY689LWaD6QEiEBuPelqWFRVzImngNKIQMP5GrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f843e071fdf8e03de23c459ce83ce9f53f4fd4fb1692d86866f62f069eb4da4","last_reissued_at":"2026-07-05T11:48:21.328929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:21.328929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of Frequency Moment Estimation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Mark Braverman, Or Zamir","submitted_at":"2024-11-04T15:06:16Z","abstract_excerpt":"Estimating the second frequency moment of a stream up to $(1\\pm\\varepsilon)$ multiplicative error requires at most $O(\\log n / \\varepsilon^2)$ bits of space, due to a seminal result of Alon, Matias, and Szegedy. It is also known that at least $\\Omega(\\log n + 1/\\varepsilon^{2})$ space is needed. We prove an optimal lower bound of $\\Omega\\left(\\log \\left(n \\varepsilon^2 \\right) / \\varepsilon^2\\right)$ for all $\\varepsilon = \\Omega(1/\\sqrt{n})$. Note that when $\\varepsilon>n^{-1/2 + c}$, where $c>0$, our lower bound matches the classic upper bound of AMS. For smaller values of $\\varepsilon$ we a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02148","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.02148/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":"2411.02148","created_at":"2026-07-05T11:48:21.328988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02148v2","created_at":"2026-07-05T11:48:21.328988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02148","created_at":"2026-07-05T11:48:21.328988+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6CD4BY736HA","created_at":"2026-07-05T11:48:21.328988+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6CD4BY736HAHXRD","created_at":"2026-07-05T11:48:21.328988+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6CD4BY7","created_at":"2026-07-05T11:48:21.328988+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07342","citing_title":"On Sketching Trimmed Statistics","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5","json":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5.json","graph_json":"https://pith.science/api/pith-number/B6CD4BY736HAHXRDYRM45A6OT5/graph.json","events_json":"https://pith.science/api/pith-number/B6CD4BY736HAHXRDYRM45A6OT5/events.json","paper":"https://pith.science/paper/B6CD4BY7"},"agent_actions":{"view_html":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5","download_json":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5.json","view_paper":"https://pith.science/paper/B6CD4BY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02148&json=true","fetch_graph":"https://pith.science/api/pith-number/B6CD4BY736HAHXRDYRM45A6OT5/graph.json","fetch_events":"https://pith.science/api/pith-number/B6CD4BY736HAHXRDYRM45A6OT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5/action/storage_attestation","attest_author":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5/action/author_attestation","sign_citation":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5/action/citation_signature","submit_replication":"https://pith.science/pith/B6CD4BY736HAHXRDYRM45A6OT5/action/replication_record"}},"created_at":"2026-07-05T11:48:21.328988+00:00","updated_at":"2026-07-05T11:48:21.328988+00:00"}