{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NXWPE7KALANYGKICAB65T6AVST","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":"4224d41ff74a1fda108a5f2fcb8df6881cc9f4b06a6e0699260643a85d2fd3ee","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-16T08:22:29Z","title_canon_sha256":"d645a341035a5c20c115237c56a4a683ddd511f703d1a3122c56fec25f839345"},"schema_version":"1.0","source":{"id":"1802.05861","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05861","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05861v3","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05861","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"NXWPE7KALANY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NXWPE7KALANYGKIC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NXWPE7KA","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:efb3a361dd3a3ecc6fc288a0a3cbe5a6aa6c6992ac6423cd1c7ee72cc4c700fb","target":"graph","created_at":"2026-05-18T00:00:39Z","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":"Given a pair of random variables $(X,Y)\\sim P_{XY}$ and two convex functions $f_1$ and $f_2$, we introduce two bottleneck functionals as the lower and upper boundaries of the two-dimensional convex set that consists of the pairs $\\left(I_{f_1}(W; X), I_{f_2}(W; Y)\\right)$, where $I_f$ denotes $f$-information and $W$ varies over the set of all discrete random variables satisfying the Markov condition $W \\to X \\to Y$. Applying Witsenhausen and Wyner's approach, we provide an algorithm for computing boundaries of this set for $f_1$, $f_2$, and discrete $P_{XY}$. In the binary symmetric case, we f","authors_text":"Flavio P. Calmon, Hsiang Hsu, Salman Salamatian, Shahab Asoodeh","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-16T08:22:29Z","title":"Generalizing Bottleneck Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05861","kind":"arxiv","version":3},"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:8f7704ce0567c9c120f2d3d2e93f59cdd08271f786d4c86803105d70be5cc98d","target":"record","created_at":"2026-05-18T00:00:39Z","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":"4224d41ff74a1fda108a5f2fcb8df6881cc9f4b06a6e0699260643a85d2fd3ee","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-16T08:22:29Z","title_canon_sha256":"d645a341035a5c20c115237c56a4a683ddd511f703d1a3122c56fec25f839345"},"schema_version":"1.0","source":{"id":"1802.05861","kind":"arxiv","version":3}},"canonical_sha256":"6decf27d40581b832902007dd9f81594ec4c63465a3759bb6cb4e8592a86695b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6decf27d40581b832902007dd9f81594ec4c63465a3759bb6cb4e8592a86695b","first_computed_at":"2026-05-18T00:00:39.775339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.775339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0wY0aAT1SNPfmOQhLMiiPi587WiX44DHoOknJ6ZSJNiY8RBObHDrtRjBsHYIXdFUJ0jHDpEzA4fX0+MwrPkAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.775859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05861","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f7704ce0567c9c120f2d3d2e93f59cdd08271f786d4c86803105d70be5cc98d","sha256:efb3a361dd3a3ecc6fc288a0a3cbe5a6aa6c6992ac6423cd1c7ee72cc4c700fb"],"state_sha256":"e280d00d1ec0a9713bce22f12182ce85b52a6a78adf4e4da14e3ed468a5ece6e"}