{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:C5KGNOKKSCK4AD565NCV7CDUVA","short_pith_number":"pith:C5KGNOKK","schema_version":"1.0","canonical_sha256":"175466b94a9095c00fbeeb455f8874a822daaf87c76038dd73ef348c7d00abbf","source":{"kind":"arxiv","id":"physics/0004057","version":1},"attestation_state":"computed","paper":{"title":"The information bottleneck method","license":"","headline":"Compressing a signal X through limited codewords can preserve all the information it provides about another signal Y.","cross_cats":["cond-mat.dis-nn","cs.LG","nlin.AO"],"primary_cat":"physics.data-an","authors_text":"Fernando C. Pereira (ATT Shannon Laboratory), Naftali Tishby (Hebrew University, NEC Research Institute), William Bialek (NEC Research Institute)","submitted_at":"2000-04-24T15:22:30Z","abstract_excerpt":"We define the relevant information in a signal $x\\in X$ as being the information that this signal provides about another signal $y\\in \\Y$. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. Understanding the signal $x$ requires more than just predicting $y$, it also requires specifying which features of $\\X$ play a role in the prediction. We formalize this problem as that of finding a short code for $\\X$ that preserves the maximum information about $\\Y$. That is, we squeeze the"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"physics/0004057","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"physics.data-an","submitted_at":"2000-04-24T15:22:30Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","nlin.AO"],"title_canon_sha256":"b6b86581531d14c4a709055a43bdb23e259450d072b82c00da696a9f456ea64a","abstract_canon_sha256":"21faebfb4a2797cd3e9e920b1c58a9a676764a44e288113469512f98541a83af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:43:14.754874Z","signature_b64":"D4yJ9Hgra8H2ej5B0OsZOe4OB6HoakA3kwj9mRR/mErzP6Cl/kh716nQjBQLgaqTLslMYtsFa2PgjbagAi/gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"175466b94a9095c00fbeeb455f8874a822daaf87c76038dd73ef348c7d00abbf","last_reissued_at":"2026-07-04T14:43:14.754516Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:43:14.754516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The information bottleneck method","license":"","headline":"Compressing a signal X through limited codewords can preserve all the information it provides about another signal Y.","cross_cats":["cond-mat.dis-nn","cs.LG","nlin.AO"],"primary_cat":"physics.data-an","authors_text":"Fernando C. Pereira (ATT Shannon Laboratory), Naftali Tishby (Hebrew University, NEC Research Institute), William Bialek (NEC Research Institute)","submitted_at":"2000-04-24T15:22:30Z","abstract_excerpt":"We define the relevant information in a signal $x\\in X$ as being the information that this signal provides about another signal $y\\in \\Y$. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. Understanding the signal $x$ requires more than just predicting $y$, it also requires specifying which features of $\\X$ play a role in the prediction. We formalize this problem as that of finding a short code for $\\X$ that preserves the maximum information about $\\Y$. That is, we squeeze the"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This constrained optimization problem can be seen as a generalization of rate distortion theory in which the distortion measure d(x, x̃) emerges from the joint statistics of X and Y. This approach yields an exact set of self consistent equations for the coding rules X → X̃ and X̃ → Y.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The joint distribution p(x,y) is known or can be reliably estimated from data, allowing the mutual information terms and the iterative re-estimation procedure to be computed exactly.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The information bottleneck method finds a compressed representation T of X that preserves maximal mutual information with Y by solving a variational optimization problem that generalizes rate-distortion theory.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Compressing a signal X through limited codewords can preserve all the information it provides about another signal Y.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e7ea08004a2c4d3053f5dc81684fdbc9005bc3c843b7a6365190f9ab27257874"},"source":{"id":"physics/0004057","kind":"arxiv","version":1},"verdict":{"id":"7a42c162-0a51-4ca6-b540-e8601ef108af","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T11:12:37.629353Z","strongest_claim":"This constrained optimization problem can be seen as a generalization of rate distortion theory in which the distortion measure d(x, x̃) emerges from the joint statistics of X and Y. This approach yields an exact set of self consistent equations for the coding rules X → X̃ and X̃ → Y.","one_line_summary":"The information bottleneck method finds a compressed representation T of X that preserves maximal mutual information with Y by solving a variational optimization problem that generalizes rate-distortion theory.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The joint distribution p(x,y) is known or can be reliably estimated from data, allowing the mutual information terms and the iterative re-estimation procedure to be computed exactly.","pith_extraction_headline":"Compressing a signal X through limited codewords can preserve all the information it provides about another signal Y."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/physics/0004057/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":6,"sample":[{"doi":"","year":null,"title":"Extracting relevant informati on","work_id":"7285a58a-980d-4da6-9442-6706522b64a7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1991,"title":"T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley, New York, 1991)","work_id":"29ddde8e-a28b-443a-9300-4d74b6d5d28f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"Information geometry and alternating mini- mization procedures","work_id":"3a0fb375-7d2d-4bc7-9ac2-057a1c88ed83","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1972,"title":"Computation of channel capacity and rate d istortion func- tion","work_id":"736c0776-4b9f-4eee-be63-c7a408238c1e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"Agglomerative information bot tleneck","work_id":"76079e41-5ad2-4500-9386-d554063b811c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"81ed3b039e82349e0606d851616e164d9b43d33f6f1cef13a99a158b6a8727ea","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"d0d0f0d8242d395b77c52375aa203c456a780722daa8646dd59590f02cacd4ed"},"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":"physics/0004057","created_at":"2026-07-04T14:43:14.754565+00:00"},{"alias_kind":"arxiv_version","alias_value":"physics/0004057v1","created_at":"2026-07-04T14:43:14.754565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.physics/0004057","created_at":"2026-07-04T14:43:14.754565+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5KGNOKKSCK4","created_at":"2026-07-04T14:43:14.754565+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5KGNOKKSCK4AD56","created_at":"2026-07-04T14:43:14.754565+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5KGNOKK","created_at":"2026-07-04T14:43:14.754565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":153,"internal_anchor_count":131,"sample":[{"citing_arxiv_id":"2607.08032","citing_title":"What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents","ref_index":114,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06305","citing_title":"Exploring Image-Text Alignment for Radio Galaxy Morphologies","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06392","citing_title":"InsideSSL: Understanding Self-Supervised Speech Representations using a Model-Centric Perspective","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05319","citing_title":"Steering Optimisation Trajectories in Diffusion Representation Learning","ref_index":79,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25601","citing_title":"Statistically Valid Hyperparameter Selection: From Tuning to Guarantees","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24861","citing_title":"First-Order Recoverability Collapse in Self-Referential Information Decoders","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26379","citing_title":"Layer-Specific Prompt Fusion Discovery via Differentiable Search in Vision Foundation Models","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2606.27201","citing_title":"Explaining Temporal Graph Neural Networks via Feature-induced Information Flow","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22873","citing_title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"2606.21895","citing_title":"Olfactory-Inspired Sparse Combinatorial Coding for Low-Resource Named Entity Recognition","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2606.21493","citing_title":"Semi-Supervised Vision-Language-Action Model","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19998","citing_title":"Tri-Info: Generalizable, Interpretable Failure Prediction for VLA Models via Information Theory","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19398","citing_title":"S-JEPA : Soft Clustering Anchors for Self-Supervised Speech Representation Learning","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19632","citing_title":"Formal Verification of Learned Multi-Agent Communication Policies via Decision Tree Distillation","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2607.00499","citing_title":"Prior-Anchored Debiasing for Long-Tailed Multi-Organ Pathology Report Generation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13061","citing_title":"LaME: Learning to Think in Latent Space for Multimodal Embedding via Information Bottleneck","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2607.02157","citing_title":"Thermodynamics of Quantum Reservoir Computing","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12718","citing_title":"Out-of-Distribution (OOD) Detectors for Open-Set RF Fingerprinting","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11616","citing_title":"DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10669","citing_title":"In Defense of Information Leakage in Concept-based Models","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09572","citing_title":"CT-VAM: A Cerebello-Thalamic-Inspired Vision-Action Model for Efficient Visuomotor Control","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08067","citing_title":"Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2607.00499","citing_title":"Prior-Anchored Debiasing for Long-Tailed Multi-Organ Pathology Report Generation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05756","citing_title":"Beyond Soft Masks: Hard-Perturbation Mixup Explainer for Robust GNN Explainability","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05478","citing_title":"Can We Predict The Human Preference For Text-to-Image Content Prior To Generation And Is It Even Useful To Do So?","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":3,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA","json":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA.json","graph_json":"https://pith.science/api/pith-number/C5KGNOKKSCK4AD565NCV7CDUVA/graph.json","events_json":"https://pith.science/api/pith-number/C5KGNOKKSCK4AD565NCV7CDUVA/events.json","paper":"https://pith.science/paper/C5KGNOKK"},"agent_actions":{"view_html":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA","download_json":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA.json","view_paper":"https://pith.science/paper/C5KGNOKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=physics/0004057&json=true","fetch_graph":"https://pith.science/api/pith-number/C5KGNOKKSCK4AD565NCV7CDUVA/graph.json","fetch_events":"https://pith.science/api/pith-number/C5KGNOKKSCK4AD565NCV7CDUVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA/action/storage_attestation","attest_author":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA/action/author_attestation","sign_citation":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA/action/citation_signature","submit_replication":"https://pith.science/pith/C5KGNOKKSCK4AD565NCV7CDUVA/action/replication_record"}},"created_at":"2026-07-04T14:43:14.754565+00:00","updated_at":"2026-07-04T14:43:14.754565+00:00"}