{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N6TPOBYNGJKWRZI2KZSCNTH2EL","short_pith_number":"pith:N6TPOBYN","schema_version":"1.0","canonical_sha256":"6fa6f7070d325568e51a566426ccfa22ca816343c6fb7a1977941a5127619f0e","source":{"kind":"arxiv","id":"1711.05102","version":1},"attestation_state":"computed","paper":{"title":"The Multi-layer Information Bottleneck Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Deniz G\\\"und\\\"uz, Pablo Piantanida, Qianqian Yang","submitted_at":"2017-11-14T14:24:37Z","abstract_excerpt":"The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variable, quantified by the mutual information. The hidden variables and the source can be arbitrarily correlated. The optimal trade-off between rates of relevance and compression (or complexity) is obtained through a single-letter characterization, referred to as the rate-relevance re"},"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":"1711.05102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-14T14:24:37Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"064deda680581c140b95644f2f8440f1bd211fa6df481d652f859268b2a911dd","abstract_canon_sha256":"67ef53855860590e26dae60978862584964f661ac6249b013db1ee0c0143a267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.725600Z","signature_b64":"FG7gtmOjBZXz+8FhdBEoyZy71rzecqwSocKYWp1Gz1FOvC4M6PXD0ObLkJmMweENQIlwND/lUsZOGJbT2lMZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa6f7070d325568e51a566426ccfa22ca816343c6fb7a1977941a5127619f0e","last_reissued_at":"2026-05-18T00:30:34.725024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.725024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Multi-layer Information Bottleneck Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Deniz G\\\"und\\\"uz, Pablo Piantanida, Qianqian Yang","submitted_at":"2017-11-14T14:24:37Z","abstract_excerpt":"The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variable, quantified by the mutual information. The hidden variables and the source can be arbitrarily correlated. The optimal trade-off between rates of relevance and compression (or complexity) is obtained through a single-letter characterization, referred to as the rate-relevance re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05102","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.05102","created_at":"2026-05-18T00:30:34.725121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05102v1","created_at":"2026-05-18T00:30:34.725121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05102","created_at":"2026-05-18T00:30:34.725121+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6TPOBYNGJKW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6TPOBYNGJKWRZI2","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6TPOBYN","created_at":"2026-05-18T12:31:31.346846+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/N6TPOBYNGJKWRZI2KZSCNTH2EL","json":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL.json","graph_json":"https://pith.science/api/pith-number/N6TPOBYNGJKWRZI2KZSCNTH2EL/graph.json","events_json":"https://pith.science/api/pith-number/N6TPOBYNGJKWRZI2KZSCNTH2EL/events.json","paper":"https://pith.science/paper/N6TPOBYN"},"agent_actions":{"view_html":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL","download_json":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL.json","view_paper":"https://pith.science/paper/N6TPOBYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05102&json=true","fetch_graph":"https://pith.science/api/pith-number/N6TPOBYNGJKWRZI2KZSCNTH2EL/graph.json","fetch_events":"https://pith.science/api/pith-number/N6TPOBYNGJKWRZI2KZSCNTH2EL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL/action/storage_attestation","attest_author":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL/action/author_attestation","sign_citation":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL/action/citation_signature","submit_replication":"https://pith.science/pith/N6TPOBYNGJKWRZI2KZSCNTH2EL/action/replication_record"}},"created_at":"2026-05-18T00:30:34.725121+00:00","updated_at":"2026-05-18T00:30:34.725121+00:00"}