{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CISHJ4E5HBVPPHCOYRSKCKKPWG","short_pith_number":"pith:CISHJ4E5","canonical_record":{"source":{"id":"1604.00268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-01T14:48:31Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"title_canon_sha256":"5589f2a8c8a9c25681348670790416d95fcbc72fc538185bdb667b493c37fe43","abstract_canon_sha256":"509f92d0670eb49f9f073e6f95e12a1f9d3103b3315c020589aa52fded6ee589"},"schema_version":"1.0"},"canonical_sha256":"122474f09d386af79c4ec464a1294fb1bbafb67dacd55712ca21e7b907cf203e","source":{"kind":"arxiv","id":"1604.00268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00268","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00268v2","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00268","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"CISHJ4E5HBVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CISHJ4E5HBVPPHCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CISHJ4E5","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CISHJ4E5HBVPPHCOYRSKCKKPWG","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-01T14:48:31Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"title_canon_sha256":"5589f2a8c8a9c25681348670790416d95fcbc72fc538185bdb667b493c37fe43","abstract_canon_sha256":"509f92d0670eb49f9f073e6f95e12a1f9d3103b3315c020589aa52fded6ee589"},"schema_version":"1.0"},"canonical_sha256":"122474f09d386af79c4ec464a1294fb1bbafb67dacd55712ca21e7b907cf203e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:13.687767Z","signature_b64":"5xu4IiH3MgR3IOqtEKFhfTFjWNTtnPgdolZ4ytYjP5+psLTWAVcKoNZem+uiLp60RzZmgKGEt+Vj3BhkgBkWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122474f09d386af79c4ec464a1294fb1bbafb67dacd55712ca21e7b907cf203e","last_reissued_at":"2026-05-18T00:50:13.687135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:13.687135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00268","source_version":2,"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-18T00:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lfWB7s+GSMbOCqKTFjC6gznoqp52WyL4321dqNhLay3h2QdS9qVtNghw2EL24eCd6yrwJNOT2iQcMEldE0hWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:12.585462Z"},"content_sha256":"25a90b530d20508f39ad255b5fd6ffe60436754046d56b783ebea741bd8d50aa","schema_version":"1.0","event_id":"sha256:25a90b530d20508f39ad255b5fd6ffe60436754046d56b783ebea741bd8d50aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CISHJ4E5HBVPPHCOYRSKCKKPWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The deterministic information bottleneck","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"primary_cat":"q-bio.NC","authors_text":"David J Schwab, DJ Strouse","submitted_at":"2016-04-01T14:48:31Z","abstract_excerpt":"Lossy compression and clustering fundamentally involve a decision about what features are relevant and which are not. The information bottleneck method (IB) by Tishby, Pereira, and Bialek formalized this notion as an information-theoretic optimization problem and proposed an optimal tradeoff between throwing away as many bits as possible, and selectively keeping those that are most important. In the IB, compression is measure my mutual information. Here, we introduce an alternative formulation that replaces mutual information with entropy, which we call the deterministic information bottleneck"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00268","kind":"arxiv","version":2},"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-18T00:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqtI1+vVtHnV8zulFoQRL7X6ZVxJZZvdYEcIKB1aBoh4rWRaCVb909nSOCUb7MaHGSufzkjcH2Fhn8DxWqLRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:12.586095Z"},"content_sha256":"4e1b3e68c889da09370ec5c197d9f1edba2d1270532a46a5883df15e86b68dff","schema_version":"1.0","event_id":"sha256:4e1b3e68c889da09370ec5c197d9f1edba2d1270532a46a5883df15e86b68dff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/bundle.json","state_url":"https://pith.science/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/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-05-30T04:17:12Z","links":{"resolver":"https://pith.science/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG","bundle":"https://pith.science/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/bundle.json","state":"https://pith.science/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CISHJ4E5HBVPPHCOYRSKCKKPWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CISHJ4E5HBVPPHCOYRSKCKKPWG","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":"509f92d0670eb49f9f073e6f95e12a1f9d3103b3315c020589aa52fded6ee589","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-01T14:48:31Z","title_canon_sha256":"5589f2a8c8a9c25681348670790416d95fcbc72fc538185bdb667b493c37fe43"},"schema_version":"1.0","source":{"id":"1604.00268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00268","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00268v2","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00268","created_at":"2026-05-18T00:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"CISHJ4E5HBVP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CISHJ4E5HBVPPHCO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CISHJ4E5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:4e1b3e68c889da09370ec5c197d9f1edba2d1270532a46a5883df15e86b68dff","target":"graph","created_at":"2026-05-18T00:50:13Z","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":"Lossy compression and clustering fundamentally involve a decision about what features are relevant and which are not. The information bottleneck method (IB) by Tishby, Pereira, and Bialek formalized this notion as an information-theoretic optimization problem and proposed an optimal tradeoff between throwing away as many bits as possible, and selectively keeping those that are most important. In the IB, compression is measure my mutual information. Here, we introduce an alternative formulation that replaces mutual information with entropy, which we call the deterministic information bottleneck","authors_text":"David J Schwab, DJ Strouse","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-01T14:48:31Z","title":"The deterministic information bottleneck"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00268","kind":"arxiv","version":2},"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:25a90b530d20508f39ad255b5fd6ffe60436754046d56b783ebea741bd8d50aa","target":"record","created_at":"2026-05-18T00:50:13Z","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":"509f92d0670eb49f9f073e6f95e12a1f9d3103b3315c020589aa52fded6ee589","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","q-bio.QM","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2016-04-01T14:48:31Z","title_canon_sha256":"5589f2a8c8a9c25681348670790416d95fcbc72fc538185bdb667b493c37fe43"},"schema_version":"1.0","source":{"id":"1604.00268","kind":"arxiv","version":2}},"canonical_sha256":"122474f09d386af79c4ec464a1294fb1bbafb67dacd55712ca21e7b907cf203e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"122474f09d386af79c4ec464a1294fb1bbafb67dacd55712ca21e7b907cf203e","first_computed_at":"2026-05-18T00:50:13.687135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:13.687135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xu4IiH3MgR3IOqtEKFhfTFjWNTtnPgdolZ4ytYjP5+psLTWAVcKoNZem+uiLp60RzZmgKGEt+Vj3BhkgBkWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:13.687767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25a90b530d20508f39ad255b5fd6ffe60436754046d56b783ebea741bd8d50aa","sha256:4e1b3e68c889da09370ec5c197d9f1edba2d1270532a46a5883df15e86b68dff"],"state_sha256":"9f17f0411b1b5f4a710ebbd9fb136e5b6a6862ed6775cdc42d6f2cc1da17f076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmEtHNETyIwUDJv1F/RmjsHW3hFPOT8rBIFjj1eSorrGXprWSPezvO7oQExoAff2DUGLdjrG/gsyjdXvCL8iDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:17:12.589643Z","bundle_sha256":"189b377d04595fd22280d81bfdcc85b557091324228d0b3e5c6f4a41f855bf8b"}}