{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5P6D6MVEFB54XGBA3YGSC6HQRB","short_pith_number":"pith:5P6D6MVE","schema_version":"1.0","canonical_sha256":"ebfc3f32a4287bcb9820de0d2178f0884e8a14d00603980e30371f1e0e984b1d","source":{"kind":"arxiv","id":"2506.22608","version":1},"attestation_state":"computed","paper":{"title":"On Fine-Grained Distinct Element Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, David P. Woodruff, Ilias Diakonikolas, Jasper C.H. Lee, Samson Zhou, Thanasis Pittas","submitted_at":"2025-06-27T20:13:44Z","abstract_excerpt":"We study the problem of distributed distinct element estimation, where $\\alpha$ servers each receive a subset of a universe $[n]$ and aim to compute a $(1+\\varepsilon)$-approximation to the number of distinct elements using minimal communication. While prior work establishes a worst-case bound of $\\Theta\\left(\\alpha\\log n+\\frac{\\alpha}{\\varepsilon^2}\\right)$ bits, these results rely on assumptions that may not hold in practice. We introduce a new parameterization based on the number $C = \\frac{\\beta}{\\varepsilon^2}$ of pairwise collisions, i.e., instances where the same element appears on mult"},"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":"2506.22608","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-27T20:13:44Z","cross_cats_sorted":[],"title_canon_sha256":"179fe763c163d9138594df5fabbae10de6fba46e6db5c8144f3db9ef5f49b55c","abstract_canon_sha256":"75cbbfa8170b4df849082813abc3a4098c9fd2984bc0b30ad029ec7f23ed9b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:41.730829Z","signature_b64":"v1CbTqZPI4rjUmYw6XMeQM9q5AZ7CBOwbNz3UD8Y+dkNnpsBGsTW0c19uvHXrr6i/VqACgrcanUvUc7V+RXtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebfc3f32a4287bcb9820de0d2178f0884e8a14d00603980e30371f1e0e984b1d","last_reissued_at":"2026-07-05T11:28:41.730332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:41.730332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fine-Grained Distinct Element Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, David P. Woodruff, Ilias Diakonikolas, Jasper C.H. Lee, Samson Zhou, Thanasis Pittas","submitted_at":"2025-06-27T20:13:44Z","abstract_excerpt":"We study the problem of distributed distinct element estimation, where $\\alpha$ servers each receive a subset of a universe $[n]$ and aim to compute a $(1+\\varepsilon)$-approximation to the number of distinct elements using minimal communication. While prior work establishes a worst-case bound of $\\Theta\\left(\\alpha\\log n+\\frac{\\alpha}{\\varepsilon^2}\\right)$ bits, these results rely on assumptions that may not hold in practice. We introduce a new parameterization based on the number $C = \\frac{\\beta}{\\varepsilon^2}$ of pairwise collisions, i.e., instances where the same element appears on mult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22608","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/2506.22608/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":"2506.22608","created_at":"2026-07-05T11:28:41.730395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22608v1","created_at":"2026-07-05T11:28:41.730395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22608","created_at":"2026-07-05T11:28:41.730395+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P6D6MVEFB54","created_at":"2026-07-05T11:28:41.730395+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P6D6MVEFB54XGBA","created_at":"2026-07-05T11:28:41.730395+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P6D6MVE","created_at":"2026-07-05T11:28:41.730395+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/5P6D6MVEFB54XGBA3YGSC6HQRB","json":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB.json","graph_json":"https://pith.science/api/pith-number/5P6D6MVEFB54XGBA3YGSC6HQRB/graph.json","events_json":"https://pith.science/api/pith-number/5P6D6MVEFB54XGBA3YGSC6HQRB/events.json","paper":"https://pith.science/paper/5P6D6MVE"},"agent_actions":{"view_html":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB","download_json":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB.json","view_paper":"https://pith.science/paper/5P6D6MVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22608&json=true","fetch_graph":"https://pith.science/api/pith-number/5P6D6MVEFB54XGBA3YGSC6HQRB/graph.json","fetch_events":"https://pith.science/api/pith-number/5P6D6MVEFB54XGBA3YGSC6HQRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB/action/storage_attestation","attest_author":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB/action/author_attestation","sign_citation":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB/action/citation_signature","submit_replication":"https://pith.science/pith/5P6D6MVEFB54XGBA3YGSC6HQRB/action/replication_record"}},"created_at":"2026-07-05T11:28:41.730395+00:00","updated_at":"2026-07-05T11:28:41.730395+00:00"}