{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MDOL54SPIC7M2MXPFD5WYGY5L4","short_pith_number":"pith:MDOL54SP","schema_version":"1.0","canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","source":{"kind":"arxiv","id":"1512.06429","version":2},"attestation_state":"computed","paper":{"title":"Strong Data Processing Inequalities for Input Constrained Additive Noise Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Flavio P. Calmon, Yihong Wu, Yury Polyanskiy","submitted_at":"2015-12-20T20:43:36Z","abstract_excerpt":"This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random variables $W\\to X\\to Y$ forming a Markov chain, where $Y=X+Z$ with $X$ and $Z$ real-valued, independent and $X$ bounded in $L_p$-norm. It is shown that $I(W;Y) \\le F_I(I(W;X))$ with $F_I(t)<t$ whenever $t>0$, if and only if $Z$ has a density whose support is not disjoint from any translate of itself. A related question is to characterize for what couplings $(W,X)$ the mutual information $I(W;Y)$ is close to maximum possi"},"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":"1512.06429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-20T20:43:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48407e72de277595ad8e923e26520bf38d104aa4de22822b62db8c614efacd9e","abstract_canon_sha256":"415a47476ca75703cba2748a69f0f4677c16dd4d8b719270dd322662f354a4c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.846753Z","signature_b64":"piqvqyfKA0l8p+xS5vKcucZadGkxaPaC6m96ZQJ8beW5OBeU87FEIg4ZteXHJcL2i3dPhiPAyG9v3iTKCe81BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","last_reissued_at":"2026-05-18T00:30:17.845954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.845954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Data Processing Inequalities for Input Constrained Additive Noise Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Flavio P. Calmon, Yihong Wu, Yury Polyanskiy","submitted_at":"2015-12-20T20:43:36Z","abstract_excerpt":"This paper quantifies the intuitive observation that adding noise reduces available information by means of non-linear strong data processing inequalities. Consider the random variables $W\\to X\\to Y$ forming a Markov chain, where $Y=X+Z$ with $X$ and $Z$ real-valued, independent and $X$ bounded in $L_p$-norm. It is shown that $I(W;Y) \\le F_I(I(W;X))$ with $F_I(t)<t$ whenever $t>0$, if and only if $Z$ has a density whose support is not disjoint from any translate of itself. A related question is to characterize for what couplings $(W,X)$ the mutual information $I(W;Y)$ is close to maximum possi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06429","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.06429","created_at":"2026-05-18T00:30:17.846078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06429v2","created_at":"2026-05-18T00:30:17.846078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06429","created_at":"2026-05-18T00:30:17.846078+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDOL54SPIC7M","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDOL54SPIC7M2MXP","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDOL54SP","created_at":"2026-05-18T12:29:32.376354+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/MDOL54SPIC7M2MXPFD5WYGY5L4","json":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4.json","graph_json":"https://pith.science/api/pith-number/MDOL54SPIC7M2MXPFD5WYGY5L4/graph.json","events_json":"https://pith.science/api/pith-number/MDOL54SPIC7M2MXPFD5WYGY5L4/events.json","paper":"https://pith.science/paper/MDOL54SP"},"agent_actions":{"view_html":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4","download_json":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4.json","view_paper":"https://pith.science/paper/MDOL54SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06429&json=true","fetch_graph":"https://pith.science/api/pith-number/MDOL54SPIC7M2MXPFD5WYGY5L4/graph.json","fetch_events":"https://pith.science/api/pith-number/MDOL54SPIC7M2MXPFD5WYGY5L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/action/storage_attestation","attest_author":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/action/author_attestation","sign_citation":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/action/citation_signature","submit_replication":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/action/replication_record"}},"created_at":"2026-05-18T00:30:17.846078+00:00","updated_at":"2026-05-18T00:30:17.846078+00:00"}