{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V36ZKACRGJ3IO6AYDTHZW3576A","short_pith_number":"pith:V36ZKACR","schema_version":"1.0","canonical_sha256":"aefd95005132768778181ccf9b6fbff02325cdfa3f29c6e754e2c3aeb6f48eea","source":{"kind":"arxiv","id":"1510.01844","version":4},"attestation_state":"computed","paper":{"title":"Linear Bounds between Contraction Coefficients for $f$-Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anuran Makur, Lizhong Zheng","submitted_at":"2015-10-07T07:06:02Z","abstract_excerpt":"Data processing inequalities for $f$-divergences can be sharpened using constants called \"contraction coefficients\" to produce strong data processing inequalities. For any discrete source-channel pair, the contraction coefficients for $f$-divergences are lower bounded by the contraction coefficient for $\\chi^2$-divergence. In this paper, we elucidate that this lower bound can be achieved by driving the input $f$-divergences of the contraction coefficients to zero. Then, we establish a linear upper bound on the contraction coefficients for a certain class of $f$-divergences using the contractio"},"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":"1510.01844","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-07T07:06:02Z","cross_cats_sorted":["math.IT","math.PR","math.ST","stat.TH"],"title_canon_sha256":"1c4a079f269887d6eea6c35df3758e16e14e1ffd2dbe0c6d53b44ae57f05c209","abstract_canon_sha256":"e69ca4977f46c6710f170e2f19a3e17b1cc24e2146894348d6ea08875f0b6f04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:48.298370Z","signature_b64":"SZvCtMPsaMrUvAI2rVVg3+1LXe9jWBh+0yjYVwBp3dEebdlKJyOXMD2FnAA7fNijk+OK7EHueKqZwD71bWpMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aefd95005132768778181ccf9b6fbff02325cdfa3f29c6e754e2c3aeb6f48eea","last_reissued_at":"2026-05-18T00:10:48.297887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:48.297887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Bounds between Contraction Coefficients for $f$-Divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Anuran Makur, Lizhong Zheng","submitted_at":"2015-10-07T07:06:02Z","abstract_excerpt":"Data processing inequalities for $f$-divergences can be sharpened using constants called \"contraction coefficients\" to produce strong data processing inequalities. For any discrete source-channel pair, the contraction coefficients for $f$-divergences are lower bounded by the contraction coefficient for $\\chi^2$-divergence. In this paper, we elucidate that this lower bound can be achieved by driving the input $f$-divergences of the contraction coefficients to zero. Then, we establish a linear upper bound on the contraction coefficients for a certain class of $f$-divergences using the contractio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01844","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":"1510.01844","created_at":"2026-05-18T00:10:48.297962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01844v4","created_at":"2026-05-18T00:10:48.297962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01844","created_at":"2026-05-18T00:10:48.297962+00:00"},{"alias_kind":"pith_short_12","alias_value":"V36ZKACRGJ3I","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V36ZKACRGJ3IO6AY","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V36ZKACR","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.13661","citing_title":"Local Information-Theoretic Security via Euclidean Geometry","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A","json":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A.json","graph_json":"https://pith.science/api/pith-number/V36ZKACRGJ3IO6AYDTHZW3576A/graph.json","events_json":"https://pith.science/api/pith-number/V36ZKACRGJ3IO6AYDTHZW3576A/events.json","paper":"https://pith.science/paper/V36ZKACR"},"agent_actions":{"view_html":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A","download_json":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A.json","view_paper":"https://pith.science/paper/V36ZKACR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01844&json=true","fetch_graph":"https://pith.science/api/pith-number/V36ZKACRGJ3IO6AYDTHZW3576A/graph.json","fetch_events":"https://pith.science/api/pith-number/V36ZKACRGJ3IO6AYDTHZW3576A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A/action/storage_attestation","attest_author":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A/action/author_attestation","sign_citation":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A/action/citation_signature","submit_replication":"https://pith.science/pith/V36ZKACRGJ3IO6AYDTHZW3576A/action/replication_record"}},"created_at":"2026-05-18T00:10:48.297962+00:00","updated_at":"2026-05-18T00:10:48.297962+00:00"}