{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FIU7OEFAHAHX543CQOKQJCXGJZ","short_pith_number":"pith:FIU7OEFA","canonical_record":{"source":{"id":"1503.02406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-09T09:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"1b4eff5e34d396f2f19db12cd049ef0c1cdb8bede493ded9a86a6f16b92d75c5","abstract_canon_sha256":"1530f184c19b55e13aaf88196d07f6d49947e8d33ef1650985363a293f96fa32"},"schema_version":"1.0"},"canonical_sha256":"2a29f710a0380f7ef3628395048ae64e6ad773cc9ffc02b2b222d66e6c4fbd1d","source":{"kind":"arxiv","id":"1503.02406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02406","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02406v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02406","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"FIU7OEFAHAHX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FIU7OEFAHAHX543C","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FIU7OEFA","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FIU7OEFAHAHX543CQOKQJCXGJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-09T09:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"1b4eff5e34d396f2f19db12cd049ef0c1cdb8bede493ded9a86a6f16b92d75c5","abstract_canon_sha256":"1530f184c19b55e13aaf88196d07f6d49947e8d33ef1650985363a293f96fa32"},"schema_version":"1.0"},"canonical_sha256":"2a29f710a0380f7ef3628395048ae64e6ad773cc9ffc02b2b222d66e6c4fbd1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.203480Z","signature_b64":"2Ftw1IKydveNxr2IvgmetssKRRxxQ1va88XS9vViAxSdiojf3va3/J05EKG4u/+dFOnWWPC4X4CsCj3JliH6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a29f710a0380f7ef3628395048ae64e6ad773cc9ffc02b2b222d66e6c4fbd1d","last_reissued_at":"2026-05-18T02:25:25.203123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.203123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02406","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-18T02:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ka3AHnvmUx48LqusrsGIm9ekApiCuyOYPVG3AmNmK0+8uvuf0G09quqEC14BLZ4wLzqZMMzSKb5qblW+cSAUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:43:02.264181Z"},"content_sha256":"4b33af115f164ebe46fbb7dabbd98457f2318936283bb0d145f6fe937be3ea6b","schema_version":"1.0","event_id":"sha256:4b33af115f164ebe46fbb7dabbd98457f2318936283bb0d145f6fe937be3ea6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FIU7OEFAHAHX543CQOKQJCXGJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning and the Information Bottleneck Principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Naftali Tishby, Noga Zaslavsky","submitted_at":"2015-03-09T09:39:41Z","abstract_excerpt":"Deep Neural Networks (DNNs) are analyzed via the theoretical framework of the information bottleneck (IB) principle. We first show that any DNN can be quantified by the mutual information between the layers and the input and output variables. Using this representation we can calculate the optimal information theoretic limits of the DNN and obtain finite sample generalization bounds. The advantage of getting closer to the theoretical limit is quantifiable both by the generalization bound and by the network's simplicity. We argue that both the optimal architecture, number of layers and features/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02406","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-18T02:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kB4u7LG4vfZHwszK+8j8TIUPflyhfPqnW9K8OuO9dcMzFmF9UYvyuNSekNEF1xgN5ia8fTRNothXhWbIEASGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:43:02.264768Z"},"content_sha256":"bb142fabfae69f8a1735a0a207bd8f2333ac47351aa3d871834ad6b500e85c0e","schema_version":"1.0","event_id":"sha256:bb142fabfae69f8a1735a0a207bd8f2333ac47351aa3d871834ad6b500e85c0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/bundle.json","state_url":"https://pith.science/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/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-10T08:43:02Z","links":{"resolver":"https://pith.science/pith/FIU7OEFAHAHX543CQOKQJCXGJZ","bundle":"https://pith.science/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/bundle.json","state":"https://pith.science/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIU7OEFAHAHX543CQOKQJCXGJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FIU7OEFAHAHX543CQOKQJCXGJZ","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":"1530f184c19b55e13aaf88196d07f6d49947e8d33ef1650985363a293f96fa32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-09T09:39:41Z","title_canon_sha256":"1b4eff5e34d396f2f19db12cd049ef0c1cdb8bede493ded9a86a6f16b92d75c5"},"schema_version":"1.0","source":{"id":"1503.02406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02406","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02406v1","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02406","created_at":"2026-05-18T02:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"FIU7OEFAHAHX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FIU7OEFAHAHX543C","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FIU7OEFA","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:bb142fabfae69f8a1735a0a207bd8f2333ac47351aa3d871834ad6b500e85c0e","target":"graph","created_at":"2026-05-18T02:25:25Z","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":"Deep Neural Networks (DNNs) are analyzed via the theoretical framework of the information bottleneck (IB) principle. We first show that any DNN can be quantified by the mutual information between the layers and the input and output variables. Using this representation we can calculate the optimal information theoretic limits of the DNN and obtain finite sample generalization bounds. The advantage of getting closer to the theoretical limit is quantifiable both by the generalization bound and by the network's simplicity. We argue that both the optimal architecture, number of layers and features/","authors_text":"Naftali Tishby, Noga Zaslavsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-09T09:39:41Z","title":"Deep Learning and the Information Bottleneck Principle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02406","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:4b33af115f164ebe46fbb7dabbd98457f2318936283bb0d145f6fe937be3ea6b","target":"record","created_at":"2026-05-18T02:25:25Z","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":"1530f184c19b55e13aaf88196d07f6d49947e8d33ef1650985363a293f96fa32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-09T09:39:41Z","title_canon_sha256":"1b4eff5e34d396f2f19db12cd049ef0c1cdb8bede493ded9a86a6f16b92d75c5"},"schema_version":"1.0","source":{"id":"1503.02406","kind":"arxiv","version":1}},"canonical_sha256":"2a29f710a0380f7ef3628395048ae64e6ad773cc9ffc02b2b222d66e6c4fbd1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a29f710a0380f7ef3628395048ae64e6ad773cc9ffc02b2b222d66e6c4fbd1d","first_computed_at":"2026-05-18T02:25:25.203123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:25.203123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Ftw1IKydveNxr2IvgmetssKRRxxQ1va88XS9vViAxSdiojf3va3/J05EKG4u/+dFOnWWPC4X4CsCj3JliH6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:25.203480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b33af115f164ebe46fbb7dabbd98457f2318936283bb0d145f6fe937be3ea6b","sha256:bb142fabfae69f8a1735a0a207bd8f2333ac47351aa3d871834ad6b500e85c0e"],"state_sha256":"f04ca8d05f8d192389274a9aeb8bc6eea07ea26124c7cb139c3a135480bcf874"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qiruZxElW15qmMDdFj56f9uokRLpgmo2eenA3bogjJEw2xOTh2jvMGod1yEHUvq0KWBwz0+axOur+TR/tiNgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:43:02.268084Z","bundle_sha256":"e4b5843c5b2f1a85a1530cac77bbb0920ff5ee815e2bc5b50de5adac45b2295f"}}