{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVCCAKOFPUO75ZVW7SM54EUOT6","short_pith_number":"pith:YVCCAKOF","schema_version":"1.0","canonical_sha256":"c5442029c57d1dfee6b6fc99de128e9fa347ff1ab6b36ab4ccfe9fce7e4e722d","source":{"kind":"arxiv","id":"1508.06025","version":4},"attestation_state":"computed","paper":{"title":"Strong data-processing inequalities for channels and Bayesian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Yihong Wu, Yury Polyanskiy","submitted_at":"2015-08-25T04:29:28Z","abstract_excerpt":"The data-processing inequality, that is, $I(U;Y) \\le I(U;X)$ for a Markov chain $U \\to X \\to Y$, has been the method of choice for proving impossibility (converse) results in information theory and many other disciplines. Various channel-dependent improvements (called strong data-processing inequalities, or SDPIs) of this inequality have been proposed both classically and more recently. In this note we first survey known results relating various notions of contraction for a single channel. Then we consider the basic extension: given SDPI for each constituent channel in a Bayesian network, how "},"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":"1508.06025","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-25T04:29:28Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"bf781f04c3f3764d691a98f484bd87f214628528783ed3dbd767f258c5e5edc3","abstract_canon_sha256":"8fc6ead4d3d87a111221997024569efc1d9fe5043b8ceef0d220a376317470c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:18.334920Z","signature_b64":"mjfIQVupDTE77ahL71QnxfbtAaYh4gW7G5WspPicJLph4TsmbX0zq8xXliwUpUmCOMqr1JlcrVplcXE929V/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5442029c57d1dfee6b6fc99de128e9fa347ff1ab6b36ab4ccfe9fce7e4e722d","last_reissued_at":"2026-05-18T01:10:18.334119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:18.334119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong data-processing inequalities for channels and Bayesian networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Yihong Wu, Yury Polyanskiy","submitted_at":"2015-08-25T04:29:28Z","abstract_excerpt":"The data-processing inequality, that is, $I(U;Y) \\le I(U;X)$ for a Markov chain $U \\to X \\to Y$, has been the method of choice for proving impossibility (converse) results in information theory and many other disciplines. Various channel-dependent improvements (called strong data-processing inequalities, or SDPIs) of this inequality have been proposed both classically and more recently. In this note we first survey known results relating various notions of contraction for a single channel. Then we consider the basic extension: given SDPI for each constituent channel in a Bayesian network, how "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06025","kind":"arxiv","version":4},"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":"1508.06025","created_at":"2026-05-18T01:10:18.334265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06025v4","created_at":"2026-05-18T01:10:18.334265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06025","created_at":"2026-05-18T01:10:18.334265+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVCCAKOFPUO7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVCCAKOFPUO75ZVW","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVCCAKOF","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.26582","citing_title":"On the Error-Correcting Effects of Stochasticity in Discrete Diffusion","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6","json":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6.json","graph_json":"https://pith.science/api/pith-number/YVCCAKOFPUO75ZVW7SM54EUOT6/graph.json","events_json":"https://pith.science/api/pith-number/YVCCAKOFPUO75ZVW7SM54EUOT6/events.json","paper":"https://pith.science/paper/YVCCAKOF"},"agent_actions":{"view_html":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6","download_json":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6.json","view_paper":"https://pith.science/paper/YVCCAKOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06025&json=true","fetch_graph":"https://pith.science/api/pith-number/YVCCAKOFPUO75ZVW7SM54EUOT6/graph.json","fetch_events":"https://pith.science/api/pith-number/YVCCAKOFPUO75ZVW7SM54EUOT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6/action/storage_attestation","attest_author":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6/action/author_attestation","sign_citation":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6/action/citation_signature","submit_replication":"https://pith.science/pith/YVCCAKOFPUO75ZVW7SM54EUOT6/action/replication_record"}},"created_at":"2026-05-18T01:10:18.334265+00:00","updated_at":"2026-05-18T01:10:18.334265+00:00"}