{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FOYMECHRTEZXIZ5USS3DL52VUN","short_pith_number":"pith:FOYMECHR","schema_version":"1.0","canonical_sha256":"2bb0c208f199337467b494b635f755a36f56f5f50f99131b2e45b61ccc2f7658","source":{"kind":"arxiv","id":"1811.04251","version":4},"attestation_state":"computed","paper":{"title":"Formal Limitations on the Measurement of Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"David McAllester, Karl Stratos","submitted_at":"2018-11-10T13:12:27Z","abstract_excerpt":"Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual information. More specifically, we show that any distribution-free high-confidence lower bound on mutual information estimated from N samples cannot be larger than O(ln N )."},"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":"1811.04251","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-10T13:12:27Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a5d17c7f2704e8863e4619b326439fd5637693e19c52755275379126ed0738d3","abstract_canon_sha256":"7df70666a4e5fbdfde3257ed5cf33922ebb2a4e4fc3c7e5a9ae4aa71495d97b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:26.958481Z","signature_b64":"DXtcGXkrTezPL5m2U/2J0uw9Xsdcgqb6jeJDs7kbrdyOL3L3ffspn96lGDBxr73HhM3HNf7/A13upqTRXH8DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bb0c208f199337467b494b635f755a36f56f5f50f99131b2e45b61ccc2f7658","last_reissued_at":"2026-07-05T01:04:26.957983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:26.957983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Limitations on the Measurement of Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"David McAllester, Karl Stratos","submitted_at":"2018-11-10T13:12:27Z","abstract_excerpt":"Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual information. More specifically, we show that any distribution-free high-confidence lower bound on mutual information estimated from N samples cannot be larger than O(ln N )."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04251","kind":"arxiv","version":4},"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/1811.04251/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":"1811.04251","created_at":"2026-07-05T01:04:26.958049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04251v4","created_at":"2026-07-05T01:04:26.958049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04251","created_at":"2026-07-05T01:04:26.958049+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOYMECHRTEZX","created_at":"2026-07-05T01:04:26.958049+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOYMECHRTEZXIZ5U","created_at":"2026-07-05T01:04:26.958049+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOYMECHR","created_at":"2026-07-05T01:04:26.958049+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1912.01603","citing_title":"Dream to Control: Learning Behaviors by Latent Imagination","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN","json":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN.json","graph_json":"https://pith.science/api/pith-number/FOYMECHRTEZXIZ5USS3DL52VUN/graph.json","events_json":"https://pith.science/api/pith-number/FOYMECHRTEZXIZ5USS3DL52VUN/events.json","paper":"https://pith.science/paper/FOYMECHR"},"agent_actions":{"view_html":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN","download_json":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN.json","view_paper":"https://pith.science/paper/FOYMECHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04251&json=true","fetch_graph":"https://pith.science/api/pith-number/FOYMECHRTEZXIZ5USS3DL52VUN/graph.json","fetch_events":"https://pith.science/api/pith-number/FOYMECHRTEZXIZ5USS3DL52VUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN/action/storage_attestation","attest_author":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN/action/author_attestation","sign_citation":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN/action/citation_signature","submit_replication":"https://pith.science/pith/FOYMECHRTEZXIZ5USS3DL52VUN/action/replication_record"}},"created_at":"2026-07-05T01:04:26.958049+00:00","updated_at":"2026-07-05T01:04:26.958049+00:00"}