{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:66AII4Z22HWQR7HMMLDQYFJDWL","short_pith_number":"pith:66AII4Z2","schema_version":"1.0","canonical_sha256":"f78084733ad1ed08fcec62c70c1523b2c2511cf578f04896d846ca76c7a08dc8","source":{"kind":"arxiv","id":"2602.04562","version":3},"attestation_state":"computed","paper":{"title":"Optimal conversion from R\\'enyi Differential Privacy to $f$-Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anneliese Riess, Flavio du Pin Calmon, Georgios Kaissis, Juan Felipe Gomez, Julia Anne Schnabel","submitted_at":"2026-02-04T13:49:51Z","abstract_excerpt":"We prove the conjecture stated in Appendix F.3 of \\citet{zhu2022optimalaccountingdifferentialprivacy}: among all conversion rules that map a R\\'enyi Differential Privacy (RDP) profile $\\tau \\mapsto \\rho(\\tau)$ to a valid hypothesis-testing trade-off $f$, the rule based on the intersection of single-order RDP privacy regions is optimal.\n  This optimality holds simultaneously for all valid RDP profiles and for all Type I error levels $\\alpha$.\n  Concretely, we show that in the space of trade-off functions, the tightest possible bound is $f_{\\rho(\\cdot)}(\\alpha) = \\sup_{\\tau \\geq 0.5} f_{\\tau,\\rh"},"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":"2602.04562","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-02-04T13:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"d9286226554bb89fd752cbb3400eeaacc7985e997eb11ded4d5f7f9cc9b17109","abstract_canon_sha256":"df67135e9511804a8dfeec2f1ce1a41bb2156d5705cc4b521dfe4e799933fc53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:49.987542Z","signature_b64":"oVdkvoxR6XWaSl4v3zuf9iU9xdgQ6oHQdT3g9fX0/bya2zh4gikX4n2s3hQU3y1Bh/21iwweYCTJhQHcl2jBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78084733ad1ed08fcec62c70c1523b2c2511cf578f04896d846ca76c7a08dc8","last_reissued_at":"2026-06-01T01:03:49.986551Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:49.986551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal conversion from R\\'enyi Differential Privacy to $f$-Differential Privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Anneliese Riess, Flavio du Pin Calmon, Georgios Kaissis, Juan Felipe Gomez, Julia Anne Schnabel","submitted_at":"2026-02-04T13:49:51Z","abstract_excerpt":"We prove the conjecture stated in Appendix F.3 of \\citet{zhu2022optimalaccountingdifferentialprivacy}: among all conversion rules that map a R\\'enyi Differential Privacy (RDP) profile $\\tau \\mapsto \\rho(\\tau)$ to a valid hypothesis-testing trade-off $f$, the rule based on the intersection of single-order RDP privacy regions is optimal.\n  This optimality holds simultaneously for all valid RDP profiles and for all Type I error levels $\\alpha$.\n  Concretely, we show that in the space of trade-off functions, the tightest possible bound is $f_{\\rho(\\cdot)}(\\alpha) = \\sup_{\\tau \\geq 0.5} f_{\\tau,\\rh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04562","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.04562/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2602.04562","created_at":"2026-06-01T01:03:49.986681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.04562v3","created_at":"2026-06-01T01:03:49.986681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04562","created_at":"2026-06-01T01:03:49.986681+00:00"},{"alias_kind":"pith_short_12","alias_value":"66AII4Z22HWQ","created_at":"2026-06-01T01:03:49.986681+00:00"},{"alias_kind":"pith_short_16","alias_value":"66AII4Z22HWQR7HM","created_at":"2026-06-01T01:03:49.986681+00:00"},{"alias_kind":"pith_short_8","alias_value":"66AII4Z2","created_at":"2026-06-01T01:03:49.986681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.18352","citing_title":"Tight Auditing of Differential Privacy in MST and AIM","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL","json":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL.json","graph_json":"https://pith.science/api/pith-number/66AII4Z22HWQR7HMMLDQYFJDWL/graph.json","events_json":"https://pith.science/api/pith-number/66AII4Z22HWQR7HMMLDQYFJDWL/events.json","paper":"https://pith.science/paper/66AII4Z2"},"agent_actions":{"view_html":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL","download_json":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL.json","view_paper":"https://pith.science/paper/66AII4Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.04562&json=true","fetch_graph":"https://pith.science/api/pith-number/66AII4Z22HWQR7HMMLDQYFJDWL/graph.json","fetch_events":"https://pith.science/api/pith-number/66AII4Z22HWQR7HMMLDQYFJDWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL/action/storage_attestation","attest_author":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL/action/author_attestation","sign_citation":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL/action/citation_signature","submit_replication":"https://pith.science/pith/66AII4Z22HWQR7HMMLDQYFJDWL/action/replication_record"}},"created_at":"2026-06-01T01:03:49.986681+00:00","updated_at":"2026-06-01T01:03:49.986681+00:00"}