{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SMMU52RWYZWOXC6NUR6ASRAB5B","short_pith_number":"pith:SMMU52RW","schema_version":"1.0","canonical_sha256":"93194eea36c66ceb8bcda47c094401e86a39a4aaf6d935631e146223658cef95","source":{"kind":"arxiv","id":"1805.08043","version":3},"attestation_state":"computed","paper":{"title":"The Adaptive Sampling Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Louchard, Matthew Drescher, Yvik Swan","submitted_at":"2018-05-21T13:36:30Z","abstract_excerpt":"The problem of estimating the number $n$ of distinct keys of a large collection of $N$ data is well known in computer science. A classical algorithm is the adaptive sampling (AS). $n$ can be estimated by $R.2^D$, where $R$ is the final bucket (cache) size and $D$ is the final depth at the end of the process. Several new interesting questions can be asked about AS (some of them were suggested by P.Flajolet and popularized by J.Lumbroso). The distribution of $W=\\log (R2^D/n)$ is known, we rederive this distribution in a simpler way. We provide new results on the moments of $D$ and $W$. We also 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":"1805.08043","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-21T13:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"987ed7f159bc6f7ec9b7b768622e9b7e2418e1890ee0a338e98a10ce826d9d22","abstract_canon_sha256":"43da905278e555ee5c45db60272e2ec6024f620863fcdff95490e1a5d325e063"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:04.152172Z","signature_b64":"zOeuCwV6FzYHkvvGWIADv9D6HKi6i8+E+VTbIvIaM69vWkPOJpj7mFHwfX0GJdzGSnbAEygPjgiOzlIjdAPvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93194eea36c66ceb8bcda47c094401e86a39a4aaf6d935631e146223658cef95","last_reissued_at":"2026-05-17T23:46:04.151464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:04.151464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Adaptive Sampling Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Louchard, Matthew Drescher, Yvik Swan","submitted_at":"2018-05-21T13:36:30Z","abstract_excerpt":"The problem of estimating the number $n$ of distinct keys of a large collection of $N$ data is well known in computer science. A classical algorithm is the adaptive sampling (AS). $n$ can be estimated by $R.2^D$, where $R$ is the final bucket (cache) size and $D$ is the final depth at the end of the process. Several new interesting questions can be asked about AS (some of them were suggested by P.Flajolet and popularized by J.Lumbroso). The distribution of $W=\\log (R2^D/n)$ is known, we rederive this distribution in a simpler way. We provide new results on the moments of $D$ and $W$. We also a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08043","kind":"arxiv","version":3},"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":"1805.08043","created_at":"2026-05-17T23:46:04.151597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08043v3","created_at":"2026-05-17T23:46:04.151597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08043","created_at":"2026-05-17T23:46:04.151597+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMMU52RWYZWO","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMMU52RWYZWOXC6N","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMMU52RW","created_at":"2026-05-18T12:32:53.628368+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/SMMU52RWYZWOXC6NUR6ASRAB5B","json":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B.json","graph_json":"https://pith.science/api/pith-number/SMMU52RWYZWOXC6NUR6ASRAB5B/graph.json","events_json":"https://pith.science/api/pith-number/SMMU52RWYZWOXC6NUR6ASRAB5B/events.json","paper":"https://pith.science/paper/SMMU52RW"},"agent_actions":{"view_html":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B","download_json":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B.json","view_paper":"https://pith.science/paper/SMMU52RW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08043&json=true","fetch_graph":"https://pith.science/api/pith-number/SMMU52RWYZWOXC6NUR6ASRAB5B/graph.json","fetch_events":"https://pith.science/api/pith-number/SMMU52RWYZWOXC6NUR6ASRAB5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B/action/storage_attestation","attest_author":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B/action/author_attestation","sign_citation":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B/action/citation_signature","submit_replication":"https://pith.science/pith/SMMU52RWYZWOXC6NUR6ASRAB5B/action/replication_record"}},"created_at":"2026-05-17T23:46:04.151597+00:00","updated_at":"2026-05-17T23:46:04.151597+00:00"}