{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LI5FCC7YV53DHO32OJOJ7NXR7Q","short_pith_number":"pith:LI5FCC7Y","schema_version":"1.0","canonical_sha256":"5a3a510bf8af7633bb7a725c9fb6f1fc322f0939e51eab79973ec02bc4be4884","source":{"kind":"arxiv","id":"2302.03098","version":5},"attestation_state":"computed","paper":{"title":"One-shot Empirical Privacy Estimation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Alina Oprea, Galen Andrew, H. Brendan McMahan, Peter Kairouz, Sewoong Oh, Vinith M. Suriyakumar","submitted_at":"2023-02-06T19:58:28Z","abstract_excerpt":"Privacy estimation techniques for differentially private (DP) algorithms are useful for comparing against analytical bounds, or to empirically measure privacy loss in settings where known analytical bounds are not tight. However, existing privacy auditing techniques usually make strong assumptions on the adversary (e.g., knowledge of intermediate model iterates or the training data distribution), are tailored to specific tasks, model architectures, or DP algorithm, and/or require retraining the model many times (typically on the order of thousands). These shortcomings make deploying such techn"},"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":"2302.03098","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T19:58:28Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"13d056b84c99cb4b8c716911a9b00c2e80925108bde50d40124e69bc1ee39e4d","abstract_canon_sha256":"e1d60a00d1cb66bfcd17513eddbaf124a1de237a78a95dc6bf7b7a093fd76cc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:23.117693Z","signature_b64":"2RIdFJ5BusFasjCbZ9dmF7AGfpmB+WOZ1szGHUb5LcDli3SFytHitSaliZIUHLkvE4bvR4yNbjHlqARaxghlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3a510bf8af7633bb7a725c9fb6f1fc322f0939e51eab79973ec02bc4be4884","last_reissued_at":"2026-07-05T08:09:23.117225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:23.117225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-shot Empirical Privacy Estimation for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Alina Oprea, Galen Andrew, H. Brendan McMahan, Peter Kairouz, Sewoong Oh, Vinith M. Suriyakumar","submitted_at":"2023-02-06T19:58:28Z","abstract_excerpt":"Privacy estimation techniques for differentially private (DP) algorithms are useful for comparing against analytical bounds, or to empirically measure privacy loss in settings where known analytical bounds are not tight. However, existing privacy auditing techniques usually make strong assumptions on the adversary (e.g., knowledge of intermediate model iterates or the training data distribution), are tailored to specific tasks, model architectures, or DP algorithm, and/or require retraining the model many times (typically on the order of thousands). These shortcomings make deploying such techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03098","kind":"arxiv","version":5},"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/2302.03098/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":"2302.03098","created_at":"2026-07-05T08:09:23.117283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03098v5","created_at":"2026-07-05T08:09:23.117283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03098","created_at":"2026-07-05T08:09:23.117283+00:00"},{"alias_kind":"pith_short_12","alias_value":"LI5FCC7YV53D","created_at":"2026-07-05T08:09:23.117283+00:00"},{"alias_kind":"pith_short_16","alias_value":"LI5FCC7YV53DHO32","created_at":"2026-07-05T08:09:23.117283+00:00"},{"alias_kind":"pith_short_8","alias_value":"LI5FCC7Y","created_at":"2026-07-05T08:09:23.117283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10481","citing_title":"Advancing the State-of-the-Art in Empirical Privacy Auditing","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30203","citing_title":"A Bayesian Approach to Membership Inference for Statistical Release","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q","json":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q.json","graph_json":"https://pith.science/api/pith-number/LI5FCC7YV53DHO32OJOJ7NXR7Q/graph.json","events_json":"https://pith.science/api/pith-number/LI5FCC7YV53DHO32OJOJ7NXR7Q/events.json","paper":"https://pith.science/paper/LI5FCC7Y"},"agent_actions":{"view_html":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q","download_json":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q.json","view_paper":"https://pith.science/paper/LI5FCC7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03098&json=true","fetch_graph":"https://pith.science/api/pith-number/LI5FCC7YV53DHO32OJOJ7NXR7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/LI5FCC7YV53DHO32OJOJ7NXR7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q/action/storage_attestation","attest_author":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q/action/author_attestation","sign_citation":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q/action/citation_signature","submit_replication":"https://pith.science/pith/LI5FCC7YV53DHO32OJOJ7NXR7Q/action/replication_record"}},"created_at":"2026-07-05T08:09:23.117283+00:00","updated_at":"2026-07-05T08:09:23.117283+00:00"}