{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AZKSIWU5LNJU7FRFXK3D7D6P2Y","short_pith_number":"pith:AZKSIWU5","schema_version":"1.0","canonical_sha256":"0655245a9d5b534f9625bab63f8fcfd6131946fb150641f144028fe3f089efa8","source":{"kind":"arxiv","id":"2005.10630","version":1},"attestation_state":"computed","paper":{"title":"Near Instance-Optimality in Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CR","authors_text":"Hilal Asi, John C. Duchi","submitted_at":"2020-05-16T04:53:48Z","abstract_excerpt":"We develop two notions of instance optimality in differential privacy, inspired by classical statistical theory: one by defining a local minimax risk and the other by considering unbiased mechanisms and analogizing the Cramer-Rao bound, and we show that the local modulus of continuity of the estimand of interest completely determines these quantities. We also develop a complementary collection mechanisms, which we term the inverse sensitivity mechanisms, which are instance optimal (or nearly instance optimal) for a large class of estimands. Moreover, these mechanisms uniformly outperform the s"},"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":"2005.10630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-05-16T04:53:48Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9a0b54df2051c16147037c15140827afdb04e0af16dfb263876c49b18724a31f","abstract_canon_sha256":"f433a10f089d918074ca118b4cce528d35a5adc1f6c3820d5893e07cb45e7881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:55.875482Z","signature_b64":"vwP+hzhZxAQulwAZmL8IM90jKjNGL1ifJoeOjfpoeqeKKjtgmvvmqyvymuDsKKJjRmc03Xs4SQx65IyxRprmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0655245a9d5b534f9625bab63f8fcfd6131946fb150641f144028fe3f089efa8","last_reissued_at":"2026-07-05T01:04:55.875019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:55.875019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Instance-Optimality in Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CR","authors_text":"Hilal Asi, John C. Duchi","submitted_at":"2020-05-16T04:53:48Z","abstract_excerpt":"We develop two notions of instance optimality in differential privacy, inspired by classical statistical theory: one by defining a local minimax risk and the other by considering unbiased mechanisms and analogizing the Cramer-Rao bound, and we show that the local modulus of continuity of the estimand of interest completely determines these quantities. We also develop a complementary collection mechanisms, which we term the inverse sensitivity mechanisms, which are instance optimal (or nearly instance optimal) for a large class of estimands. Moreover, these mechanisms uniformly outperform the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10630","kind":"arxiv","version":1},"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/2005.10630/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":"2005.10630","created_at":"2026-07-05T01:04:55.875070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10630v1","created_at":"2026-07-05T01:04:55.875070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10630","created_at":"2026-07-05T01:04:55.875070+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZKSIWU5LNJU","created_at":"2026-07-05T01:04:55.875070+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZKSIWU5LNJU7FRF","created_at":"2026-07-05T01:04:55.875070+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZKSIWU5","created_at":"2026-07-05T01:04:55.875070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20427","citing_title":"Private Rate-Double-Robust Inference","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21860","citing_title":"Robust Statistical Estimators with Bounded Empirical Sensitivity","ref_index":94,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y","json":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y.json","graph_json":"https://pith.science/api/pith-number/AZKSIWU5LNJU7FRFXK3D7D6P2Y/graph.json","events_json":"https://pith.science/api/pith-number/AZKSIWU5LNJU7FRFXK3D7D6P2Y/events.json","paper":"https://pith.science/paper/AZKSIWU5"},"agent_actions":{"view_html":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y","download_json":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y.json","view_paper":"https://pith.science/paper/AZKSIWU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10630&json=true","fetch_graph":"https://pith.science/api/pith-number/AZKSIWU5LNJU7FRFXK3D7D6P2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/AZKSIWU5LNJU7FRFXK3D7D6P2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y/action/storage_attestation","attest_author":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y/action/author_attestation","sign_citation":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y/action/citation_signature","submit_replication":"https://pith.science/pith/AZKSIWU5LNJU7FRFXK3D7D6P2Y/action/replication_record"}},"created_at":"2026-07-05T01:04:55.875070+00:00","updated_at":"2026-07-05T01:04:55.875070+00:00"}