{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4WL5RG7MS7KYQMABPAZZR76HIW","short_pith_number":"pith:4WL5RG7M","schema_version":"1.0","canonical_sha256":"e597d89bec97d5883001783398ffc7459dd5c9c0f476a59bedca7c8ce637fb0e","source":{"kind":"arxiv","id":"1302.0336","version":2},"attestation_state":"computed","paper":{"title":"Sharp Inequalities for $f$-divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Adityanand Guntuboyina, Geoffrey Schiebinger, Sujayam Saha","submitted_at":"2013-02-02T03:15:48Z","abstract_excerpt":"$f$-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler divergence, chi-squared divergence, squared Hellinger distance, total variation distance etc. In this paper, we study the problem of maximizing or minimizing an $f$-divergence between two probability measures subject to a finite number of constraints on other $f$-divergences. We show that these infinite-dimensional optimization problems can all be reduced to optimizat"},"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":"1302.0336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-02-02T03:15:48Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR","stat.ML","stat.TH"],"title_canon_sha256":"38b614700e9e4e129288a410e0ce70f3fec91b6baa12cd9abe9766f71584248c","abstract_canon_sha256":"2a1f7e6763ab94d00ab0dbea0dd0f1fb0f0e4c21690bf437cd8da1475e2af444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:26.759683Z","signature_b64":"y1vz+4dcAZkXHCtyfRtaO4ez6zLCrKkPRtLqbQsXtYZwEvukaG2I7je9OrXa9YWfk2JmWVMC9RchDaEFGMwYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e597d89bec97d5883001783398ffc7459dd5c9c0f476a59bedca7c8ce637fb0e","last_reissued_at":"2026-05-18T03:10:26.758946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:26.758946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Inequalities for $f$-divergences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Adityanand Guntuboyina, Geoffrey Schiebinger, Sujayam Saha","submitted_at":"2013-02-02T03:15:48Z","abstract_excerpt":"$f$-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler divergence, chi-squared divergence, squared Hellinger distance, total variation distance etc. In this paper, we study the problem of maximizing or minimizing an $f$-divergence between two probability measures subject to a finite number of constraints on other $f$-divergences. We show that these infinite-dimensional optimization problems can all be reduced to optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0336","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":"1302.0336","created_at":"2026-05-18T03:10:26.759044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0336v2","created_at":"2026-05-18T03:10:26.759044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0336","created_at":"2026-05-18T03:10:26.759044+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WL5RG7MS7KY","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WL5RG7MS7KYQMAB","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WL5RG7M","created_at":"2026-05-18T12:27:34.582898+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/4WL5RG7MS7KYQMABPAZZR76HIW","json":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW.json","graph_json":"https://pith.science/api/pith-number/4WL5RG7MS7KYQMABPAZZR76HIW/graph.json","events_json":"https://pith.science/api/pith-number/4WL5RG7MS7KYQMABPAZZR76HIW/events.json","paper":"https://pith.science/paper/4WL5RG7M"},"agent_actions":{"view_html":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW","download_json":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW.json","view_paper":"https://pith.science/paper/4WL5RG7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0336&json=true","fetch_graph":"https://pith.science/api/pith-number/4WL5RG7MS7KYQMABPAZZR76HIW/graph.json","fetch_events":"https://pith.science/api/pith-number/4WL5RG7MS7KYQMABPAZZR76HIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW/action/storage_attestation","attest_author":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW/action/author_attestation","sign_citation":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW/action/citation_signature","submit_replication":"https://pith.science/pith/4WL5RG7MS7KYQMABPAZZR76HIW/action/replication_record"}},"created_at":"2026-05-18T03:10:26.759044+00:00","updated_at":"2026-05-18T03:10:26.759044+00:00"}