{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MDOL54SPIC7M2MXPFD5WYGY5L4","short_pith_number":"pith:MDOL54SP","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"},"canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","source":{"kind":"arxiv","id":"1512.06429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06429","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06429v2","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06429","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"MDOL54SPIC7M","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MDOL54SPIC7M2MXP","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MDOL54SP","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MDOL54SPIC7M2MXPFD5WYGY5L4","target":"record","payload":{"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"},"canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","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"},"source_kind":"arxiv","source_id":"1512.06429","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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3AgLLoZqqxUqUW576arBZnTR0L3mFOfVdWUpOUs0WiKSAXlRKx1B2VgPqxpzBz13M6+4U9s1qcn91Xm30ZHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:20:11.751278Z"},"content_sha256":"cd4f30c331fe677428a310539f70b341fd8ea9465993975f46071838e8485fff","schema_version":"1.0","event_id":"sha256:cd4f30c331fe677428a310539f70b341fd8ea9465993975f46071838e8485fff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MDOL54SPIC7M2MXPFD5WYGY5L4","target":"graph","payload":{"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"},"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:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6iMTqRJJfgMhlbXbWd2pTD6NoTZRmXBu02NoF3ig7y1+dtUEwibTZkddaj/foMUBNoEXqrB3TKuoc4OU5YgQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:20:11.751648Z"},"content_sha256":"bc073b669fd59b4f6153b6ad9191d9449f3b2ade03e689147ad02a81bd45bf8d","schema_version":"1.0","event_id":"sha256:bc073b669fd59b4f6153b6ad9191d9449f3b2ade03e689147ad02a81bd45bf8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/bundle.json","state_url":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/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-03T19:20:11Z","links":{"resolver":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4","bundle":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/bundle.json","state":"https://pith.science/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDOL54SPIC7M2MXPFD5WYGY5L4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MDOL54SPIC7M2MXPFD5WYGY5L4","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":"415a47476ca75703cba2748a69f0f4677c16dd4d8b719270dd322662f354a4c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-20T20:43:36Z","title_canon_sha256":"48407e72de277595ad8e923e26520bf38d104aa4de22822b62db8c614efacd9e"},"schema_version":"1.0","source":{"id":"1512.06429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.06429","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1512.06429v2","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06429","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"MDOL54SPIC7M","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MDOL54SPIC7M2MXP","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MDOL54SP","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:bc073b669fd59b4f6153b6ad9191d9449f3b2ade03e689147ad02a81bd45bf8d","target":"graph","created_at":"2026-05-18T00:30:17Z","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":"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","authors_text":"Flavio P. Calmon, Yihong Wu, Yury Polyanskiy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-20T20:43:36Z","title":"Strong Data Processing Inequalities for Input Constrained Additive Noise Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06429","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:cd4f30c331fe677428a310539f70b341fd8ea9465993975f46071838e8485fff","target":"record","created_at":"2026-05-18T00:30:17Z","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":"415a47476ca75703cba2748a69f0f4677c16dd4d8b719270dd322662f354a4c6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-20T20:43:36Z","title_canon_sha256":"48407e72de277595ad8e923e26520bf38d104aa4de22822b62db8c614efacd9e"},"schema_version":"1.0","source":{"id":"1512.06429","kind":"arxiv","version":2}},"canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60dcbef24f40becd32ef28fb6c1b1d5f220521f0e4a13b711497c3000803df6f","first_computed_at":"2026-05-18T00:30:17.845954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:17.845954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"piqvqyfKA0l8p+xS5vKcucZadGkxaPaC6m96ZQJ8beW5OBeU87FEIg4ZteXHJcL2i3dPhiPAyG9v3iTKCe81BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:17.846753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.06429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd4f30c331fe677428a310539f70b341fd8ea9465993975f46071838e8485fff","sha256:bc073b669fd59b4f6153b6ad9191d9449f3b2ade03e689147ad02a81bd45bf8d"],"state_sha256":"43891eceb84d71253a027a70d52e6a3d13addeb29e9f3c0c695dcb08aaceb92a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5nJXhutvcDIBkwEzRT8b1GBxDhfeSh4EfdrWPyvNvRHU/fHyFsSTYkrlyE+i9IBpnsWB0hYR3m9d8qt505bCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:20:11.753603Z","bundle_sha256":"69e4bf11f5d1757f3185da66e1e87675b34fd7d6c90772bc956adf889b808f6e"}}