{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SZWLJDAXFRYP3TXDCLKHJ7V2VK","short_pith_number":"pith:SZWLJDAX","schema_version":"1.0","canonical_sha256":"966cb48c172c70fdcee312d474febaaa899723a266d33defebe0e15b5bd95a7f","source":{"kind":"arxiv","id":"1901.00555","version":3},"attestation_state":"computed","paper":{"title":"An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Volkan Cevher","submitted_at":"2019-01-02T23:56:10Z","abstract_excerpt":"Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specific problems. We present a variet"},"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":"1901.00555","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-02T23:56:10Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1a19032faed8e23a70aae388ca57d9ba7e40d532eff8bd01d692c6ae98339973","abstract_canon_sha256":"084a8867facdbb81afd5fa46fb442912f9908793dfc5dfe66ef55338b026d58e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:32.282672Z","signature_b64":"WR2nEnU+doTf51WFFB6oxI/pPaF3fnd4v7TKyZhmGSxWvUJadKUMjYLVY24RpxedEaU7gZIIkW9rFT0iN7qlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966cb48c172c70fdcee312d474febaaa899723a266d33defebe0e15b5bd95a7f","last_reissued_at":"2026-07-05T00:21:32.282173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:32.282173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Introductory Guide to Fano's Inequality with Applications in Statistical Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jonathan Scarlett, Volkan Cevher","submitted_at":"2019-01-02T23:56:10Z","abstract_excerpt":"Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specific problems. We present a variet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00555","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.00555/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":"1901.00555","created_at":"2026-07-05T00:21:32.282232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00555v3","created_at":"2026-07-05T00:21:32.282232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00555","created_at":"2026-07-05T00:21:32.282232+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZWLJDAXFRYP","created_at":"2026-07-05T00:21:32.282232+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZWLJDAXFRYP3TXD","created_at":"2026-07-05T00:21:32.282232+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZWLJDAX","created_at":"2026-07-05T00:21:32.282232+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17567","citing_title":"Reducing Learner Redundancy in Boosting via Residual Orthogonalization","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29354","citing_title":"When LLMs Develop Languages: Symbolic Communication for Efficient Multi-Agent Reasoning","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30425","citing_title":"Lossy Compression for Sparse Aggregation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2603.15842","citing_title":"Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08551","citing_title":"Nonparametric Empirical Bayes Confidence Intervals","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07546","citing_title":"On the Invariance and Generality of Neural Scaling Laws","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK","json":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK.json","graph_json":"https://pith.science/api/pith-number/SZWLJDAXFRYP3TXDCLKHJ7V2VK/graph.json","events_json":"https://pith.science/api/pith-number/SZWLJDAXFRYP3TXDCLKHJ7V2VK/events.json","paper":"https://pith.science/paper/SZWLJDAX"},"agent_actions":{"view_html":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK","download_json":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK.json","view_paper":"https://pith.science/paper/SZWLJDAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00555&json=true","fetch_graph":"https://pith.science/api/pith-number/SZWLJDAXFRYP3TXDCLKHJ7V2VK/graph.json","fetch_events":"https://pith.science/api/pith-number/SZWLJDAXFRYP3TXDCLKHJ7V2VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK/action/storage_attestation","attest_author":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK/action/author_attestation","sign_citation":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK/action/citation_signature","submit_replication":"https://pith.science/pith/SZWLJDAXFRYP3TXDCLKHJ7V2VK/action/replication_record"}},"created_at":"2026-07-05T00:21:32.282232+00:00","updated_at":"2026-07-05T00:21:32.282232+00:00"}