{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U2LMSWDNGLOPHPXPUFWPF2AOOR","short_pith_number":"pith:U2LMSWDN","schema_version":"1.0","canonical_sha256":"a696c9586d32dcf3beefa16cf2e80e74490c4665184cbd8e5de327a25b062d63","source":{"kind":"arxiv","id":"1702.01284","version":2},"attestation_state":"computed","paper":{"title":"New cardinality estimation algorithms for HyperLogLog sketches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Otmar Ertl","submitted_at":"2017-02-04T13:25:05Z","abstract_excerpt":"This paper presents new methods to estimate the cardinalities of data sets recorded by HyperLogLog sketches. A theoretically motivated extension to the original estimator is presented that eliminates the bias for small and large cardinalities. Based on the maximum likelihood principle a second unbiased method is derived together with a robust and efficient numerical algorithm to calculate the estimate. The maximum likelihood approach can also be applied to more than a single HyperLogLog sketch. In particular, it is shown that it gives more precise cardinality estimates for union, intersection,"},"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":"1702.01284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T13:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"1ccfb2134a48bf2188c523eb4e867870de1a452059f4b4a5270780247edd5c9f","abstract_canon_sha256":"8cb0c9ebb540b81ff48432b1789efe300f4afe9fbe1f56e1da5bb4c3e1bfe480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.809249Z","signature_b64":"VK49zUTbexFAmae6ckyNtopbagXQ0S6PJJWPY6XoQ+caIT/EniG77hFwLlvUOGcdiSSh48QZgogb08aCCq8bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a696c9586d32dcf3beefa16cf2e80e74490c4665184cbd8e5de327a25b062d63","last_reissued_at":"2026-05-18T00:50:03.808697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.808697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New cardinality estimation algorithms for HyperLogLog sketches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Otmar Ertl","submitted_at":"2017-02-04T13:25:05Z","abstract_excerpt":"This paper presents new methods to estimate the cardinalities of data sets recorded by HyperLogLog sketches. A theoretically motivated extension to the original estimator is presented that eliminates the bias for small and large cardinalities. Based on the maximum likelihood principle a second unbiased method is derived together with a robust and efficient numerical algorithm to calculate the estimate. The maximum likelihood approach can also be applied to more than a single HyperLogLog sketch. In particular, it is shown that it gives more precise cardinality estimates for union, intersection,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01284","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":"1702.01284","created_at":"2026-05-18T00:50:03.808794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01284v2","created_at":"2026-05-18T00:50:03.808794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01284","created_at":"2026-05-18T00:50:03.808794+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2LMSWDNGLOP","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2LMSWDNGLOPHPXP","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2LMSWDN","created_at":"2026-05-18T12:31:46.661854+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/U2LMSWDNGLOPHPXPUFWPF2AOOR","json":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR.json","graph_json":"https://pith.science/api/pith-number/U2LMSWDNGLOPHPXPUFWPF2AOOR/graph.json","events_json":"https://pith.science/api/pith-number/U2LMSWDNGLOPHPXPUFWPF2AOOR/events.json","paper":"https://pith.science/paper/U2LMSWDN"},"agent_actions":{"view_html":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR","download_json":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR.json","view_paper":"https://pith.science/paper/U2LMSWDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01284&json=true","fetch_graph":"https://pith.science/api/pith-number/U2LMSWDNGLOPHPXPUFWPF2AOOR/graph.json","fetch_events":"https://pith.science/api/pith-number/U2LMSWDNGLOPHPXPUFWPF2AOOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR/action/storage_attestation","attest_author":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR/action/author_attestation","sign_citation":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR/action/citation_signature","submit_replication":"https://pith.science/pith/U2LMSWDNGLOPHPXPUFWPF2AOOR/action/replication_record"}},"created_at":"2026-05-18T00:50:03.808794+00:00","updated_at":"2026-05-18T00:50:03.808794+00:00"}