{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UBSIE52TZ2Q3CV4ROQS23PFN2Z","short_pith_number":"pith:UBSIE52T","canonical_record":{"source":{"id":"1609.02208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T22:11:39Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ba9cedfda6ea99fbbcb27f77a848068899e3381a5427f14c57f1761dcf35e16c","abstract_canon_sha256":"44eb5bb13eb989e628fe37db125dfadf261a0c6f687b3d4b35f792a84e616ff2"},"schema_version":"1.0"},"canonical_sha256":"a064827753cea1b157917425adbcadd648cde29372f28a55bf400d72f0abbeb1","source":{"kind":"arxiv","id":"1609.02208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02208","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02208v1","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02208","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"UBSIE52TZ2Q3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UBSIE52TZ2Q3CV4R","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UBSIE52T","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UBSIE52TZ2Q3CV4ROQS23PFN2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T22:11:39Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ba9cedfda6ea99fbbcb27f77a848068899e3381a5427f14c57f1761dcf35e16c","abstract_canon_sha256":"44eb5bb13eb989e628fe37db125dfadf261a0c6f687b3d4b35f792a84e616ff2"},"schema_version":"1.0"},"canonical_sha256":"a064827753cea1b157917425adbcadd648cde29372f28a55bf400d72f0abbeb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.171245Z","signature_b64":"np2jiUhk0Fgojodv7q5euXMVV0i+J5Uw8nX+CXEO8iuuN9i/apKUGOXE5nrght0xCe2ZIoxPsXMv8XN7WjM+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a064827753cea1b157917425adbcadd648cde29372f28a55bf400d72f0abbeb1","last_reissued_at":"2026-05-18T01:04:55.170787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.170787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02208","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTJd3kr95OnztDeHE+7UIt9+A1wT2a5t3GHZ2qK3jlN3LPzGpvyUqLW5EMdQc7BAArwIRVz0B6h0i34sAAkXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:32:16.851388Z"},"content_sha256":"c85727fc231a7703ba887ab758ee8b4a34a8f3cb2032af2a80ec88ca4995aaf9","schema_version":"1.0","event_id":"sha256:c85727fc231a7703ba887ab758ee8b4a34a8f3cb2032af2a80ec88ca4995aaf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UBSIE52TZ2Q3CV4ROQS23PFN2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Pramod Viswanath, Sewoong Oh, Weihao Gao","submitted_at":"2016-09-07T22:11:39Z","abstract_excerpt":"Estimators of information theoretic measures such as entropy and mutual information are a basic workhorse for many downstream applications in modern data science. State of the art approaches have been either geometric (nearest neighbor (NN) based) or kernel based (with a globally chosen bandwidth). In this paper, we combine both these approaches to design new estimators of entropy and mutual information that outperform state of the art methods. Our estimator uses local bandwidth choices of $k$-NN distances with a finite $k$, independent of the sample size. Such a local and data dependent choic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02208","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jptk/8rfFG35RXSMCZ+tgfA5lge0cIC5MPgrt5ZD9SmiAvlQ7Te3oGOoyuVsPKGO1hJhNikP+zTf0DLOx+7oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:32:16.852136Z"},"content_sha256":"16b6a32901c45158c49a6e787ff0c28a637276cc3cce0fb87f4e11f3fa24211b","schema_version":"1.0","event_id":"sha256:16b6a32901c45158c49a6e787ff0c28a637276cc3cce0fb87f4e11f3fa24211b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/bundle.json","state_url":"https://pith.science/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T22:32:16Z","links":{"resolver":"https://pith.science/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z","bundle":"https://pith.science/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/bundle.json","state":"https://pith.science/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBSIE52TZ2Q3CV4ROQS23PFN2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UBSIE52TZ2Q3CV4ROQS23PFN2Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44eb5bb13eb989e628fe37db125dfadf261a0c6f687b3d4b35f792a84e616ff2","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T22:11:39Z","title_canon_sha256":"ba9cedfda6ea99fbbcb27f77a848068899e3381a5427f14c57f1761dcf35e16c"},"schema_version":"1.0","source":{"id":"1609.02208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02208","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02208v1","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02208","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"UBSIE52TZ2Q3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UBSIE52TZ2Q3CV4R","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UBSIE52T","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:16b6a32901c45158c49a6e787ff0c28a637276cc3cce0fb87f4e11f3fa24211b","target":"graph","created_at":"2026-05-18T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Estimators of information theoretic measures such as entropy and mutual information are a basic workhorse for many downstream applications in modern data science. State of the art approaches have been either geometric (nearest neighbor (NN) based) or kernel based (with a globally chosen bandwidth). In this paper, we combine both these approaches to design new estimators of entropy and mutual information that outperform state of the art methods. Our estimator uses local bandwidth choices of $k$-NN distances with a finite $k$, independent of the sample size. Such a local and data dependent choic","authors_text":"Pramod Viswanath, Sewoong Oh, Weihao Gao","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T22:11:39Z","title":"Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02208","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c85727fc231a7703ba887ab758ee8b4a34a8f3cb2032af2a80ec88ca4995aaf9","target":"record","created_at":"2026-05-18T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44eb5bb13eb989e628fe37db125dfadf261a0c6f687b3d4b35f792a84e616ff2","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-07T22:11:39Z","title_canon_sha256":"ba9cedfda6ea99fbbcb27f77a848068899e3381a5427f14c57f1761dcf35e16c"},"schema_version":"1.0","source":{"id":"1609.02208","kind":"arxiv","version":1}},"canonical_sha256":"a064827753cea1b157917425adbcadd648cde29372f28a55bf400d72f0abbeb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a064827753cea1b157917425adbcadd648cde29372f28a55bf400d72f0abbeb1","first_computed_at":"2026-05-18T01:04:55.170787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:55.170787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"np2jiUhk0Fgojodv7q5euXMVV0i+J5Uw8nX+CXEO8iuuN9i/apKUGOXE5nrght0xCe2ZIoxPsXMv8XN7WjM+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:55.171245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c85727fc231a7703ba887ab758ee8b4a34a8f3cb2032af2a80ec88ca4995aaf9","sha256:16b6a32901c45158c49a6e787ff0c28a637276cc3cce0fb87f4e11f3fa24211b"],"state_sha256":"07fa496ff31fcc6855972a1a470a9cd4d7429aa24a257eb4effea01879b8cec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RS7qqyMStErzSYwTlYzLEnt4qZxEpE0nhk9fFJm6+1P/z0dx/c/6X2LO1iQgE7K2xVJzRh2aSo6z1FeKvYJ9DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:32:16.856237Z","bundle_sha256":"641eca3ba52ee4915443fa546677f6ba060e866ff5327cc625d08c34c8e40c3d"}}