{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:22QYMZMTU7N7MKA5T2HDUAQW4F","short_pith_number":"pith:22QYMZMT","schema_version":"1.0","canonical_sha256":"d6a1866593a7dbf6281d9e8e3a0216e15d6d0890c4f37a761b05b7198950a091","source":{"kind":"arxiv","id":"2607.16966","version":1},"attestation_state":"computed","paper":{"title":"Tight Sample Bounds for Renyi and Min-Entropy Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Arman Adibi, Piotr Krysta","submitted_at":"2026-07-18T21:01:38Z","abstract_excerpt":"Estimating entropy from samples is fundamental in information theory and property testing. Shannon entropy measures average uncertainty and can be estimated to constant additive accuracy over a $k$-symbol alphabet using $\\Theta(k/\\log k)$ samples. Min-entropy depends only on the most likely symbol. Both are special cases of order-$\\alpha$ R'{e}nyi entropy, $H_\\alpha$.\n  We characterize the sample complexity of estimating min-entropy and R'{e}nyi entropy for $k$ and integer $\\alpha>1$; our lower bounds also hold for noninteger $\\alpha\\ge1.001$. We prove that min-entropy estimation to constant 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":"2607.16966","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-18T21:01:38Z","cross_cats_sorted":["cs.CC","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"04eede1a10f5feb6f6aea3741bdf21de34c1aa79186a6f1cd30d69b6fd504104","abstract_canon_sha256":"f03bacc4d9402ea029bcba57a8b91c3fca05cf9429b9839a682ae927d1696dce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:08.520359Z","signature_b64":"jqy5VboSzR/UKxVfbcNa/gNqr6VH6/NPKmTGEJVr7x1ua3Flv56uJ5IZJ4hcWRYgYAP28z+Oh/5QdIQgvpxeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a1866593a7dbf6281d9e8e3a0216e15d6d0890c4f37a761b05b7198950a091","last_reissued_at":"2026-07-21T01:21:08.519511Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:08.519511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Sample Bounds for Renyi and Min-Entropy Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Arman Adibi, Piotr Krysta","submitted_at":"2026-07-18T21:01:38Z","abstract_excerpt":"Estimating entropy from samples is fundamental in information theory and property testing. Shannon entropy measures average uncertainty and can be estimated to constant additive accuracy over a $k$-symbol alphabet using $\\Theta(k/\\log k)$ samples. Min-entropy depends only on the most likely symbol. Both are special cases of order-$\\alpha$ R'{e}nyi entropy, $H_\\alpha$.\n  We characterize the sample complexity of estimating min-entropy and R'{e}nyi entropy for $k$ and integer $\\alpha>1$; our lower bounds also hold for noninteger $\\alpha\\ge1.001$. We prove that min-entropy estimation to constant a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16966","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/2607.16966/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":"2607.16966","created_at":"2026-07-21T01:21:08.519937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16966v1","created_at":"2026-07-21T01:21:08.519937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16966","created_at":"2026-07-21T01:21:08.519937+00:00"},{"alias_kind":"pith_short_12","alias_value":"22QYMZMTU7N7","created_at":"2026-07-21T01:21:08.519937+00:00"},{"alias_kind":"pith_short_16","alias_value":"22QYMZMTU7N7MKA5","created_at":"2026-07-21T01:21:08.519937+00:00"},{"alias_kind":"pith_short_8","alias_value":"22QYMZMT","created_at":"2026-07-21T01:21:08.519937+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/22QYMZMTU7N7MKA5T2HDUAQW4F","json":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F.json","graph_json":"https://pith.science/api/pith-number/22QYMZMTU7N7MKA5T2HDUAQW4F/graph.json","events_json":"https://pith.science/api/pith-number/22QYMZMTU7N7MKA5T2HDUAQW4F/events.json","paper":"https://pith.science/paper/22QYMZMT"},"agent_actions":{"view_html":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F","download_json":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F.json","view_paper":"https://pith.science/paper/22QYMZMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16966&json=true","fetch_graph":"https://pith.science/api/pith-number/22QYMZMTU7N7MKA5T2HDUAQW4F/graph.json","fetch_events":"https://pith.science/api/pith-number/22QYMZMTU7N7MKA5T2HDUAQW4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F/action/storage_attestation","attest_author":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F/action/author_attestation","sign_citation":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F/action/citation_signature","submit_replication":"https://pith.science/pith/22QYMZMTU7N7MKA5T2HDUAQW4F/action/replication_record"}},"created_at":"2026-07-21T01:21:08.519937+00:00","updated_at":"2026-07-21T01:21:08.519937+00:00"}