{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5S3VZ6EILBOM4YTPEPPBR6Q6KR","short_pith_number":"pith:5S3VZ6EI","schema_version":"1.0","canonical_sha256":"ecb75cf888585cce626f23de18fa1e545f0f619e0683cf99dbc13c12c849162b","source":{"kind":"arxiv","id":"2507.08158","version":2},"attestation_state":"computed","paper":{"title":"A Unified Framework for Adversary-Aware Differential Privacy Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adam Smith, Borja Balle, Jamie Hayes, Marika Swanberg, Meenatchi Sundaram Muthu Selva Annamalai","submitted_at":"2025-07-10T20:36:31Z","abstract_excerpt":"Differential Privacy (DP) bounds the privacy leakage of a mechanism against worst-case membership inference, but the precise tradeoff between complex adversarial models and DP protections remains poorly understood. In this paper, we present a unified framework that generalizes the patchwork of existing bounds across membership inference, attribute inference, and data reconstruction attacks. Crucially, our framework is the first to evaluate attacks that target multiple individuals simultaneously and measure success beyond exact matches under a single cohesive bound. Our bounds capture this broa"},"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":"2507.08158","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-07-10T20:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"14a3d6147a2067eb45117d23e220debbe2c1f9fea04c6d6e123aaa6b696faf0a","abstract_canon_sha256":"ff1cb4c21915edf76a5b7890ffea70c603ea81703b6ef48db875d5d690311447"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:07.193099Z","signature_b64":"Y0YkvfuuwNxs2X681QNluXk8asz0TMBYc7aV6LC3Gn8RUGh1anw3uIPqeH6bA+HYBA6IdNHWrZjfxhbsrZbYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb75cf888585cce626f23de18fa1e545f0f619e0683cf99dbc13c12c849162b","last_reissued_at":"2026-06-02T02:04:07.192453Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:07.192453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Adversary-Aware Differential Privacy Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adam Smith, Borja Balle, Jamie Hayes, Marika Swanberg, Meenatchi Sundaram Muthu Selva Annamalai","submitted_at":"2025-07-10T20:36:31Z","abstract_excerpt":"Differential Privacy (DP) bounds the privacy leakage of a mechanism against worst-case membership inference, but the precise tradeoff between complex adversarial models and DP protections remains poorly understood. In this paper, we present a unified framework that generalizes the patchwork of existing bounds across membership inference, attribute inference, and data reconstruction attacks. Crucially, our framework is the first to evaluate attacks that target multiple individuals simultaneously and measure success beyond exact matches under a single cohesive bound. Our bounds capture this broa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08158","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.08158/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":"2507.08158","created_at":"2026-06-02T02:04:07.192531+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08158v2","created_at":"2026-06-02T02:04:07.192531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08158","created_at":"2026-06-02T02:04:07.192531+00:00"},{"alias_kind":"pith_short_12","alias_value":"5S3VZ6EILBOM","created_at":"2026-06-02T02:04:07.192531+00:00"},{"alias_kind":"pith_short_16","alias_value":"5S3VZ6EILBOM4YTP","created_at":"2026-06-02T02:04:07.192531+00:00"},{"alias_kind":"pith_short_8","alias_value":"5S3VZ6EI","created_at":"2026-06-02T02:04:07.192531+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.18697","citing_title":"Beyond Indistinguishability: Measuring Extraction Risk in LLM APIs","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR","json":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR.json","graph_json":"https://pith.science/api/pith-number/5S3VZ6EILBOM4YTPEPPBR6Q6KR/graph.json","events_json":"https://pith.science/api/pith-number/5S3VZ6EILBOM4YTPEPPBR6Q6KR/events.json","paper":"https://pith.science/paper/5S3VZ6EI"},"agent_actions":{"view_html":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR","download_json":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR.json","view_paper":"https://pith.science/paper/5S3VZ6EI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08158&json=true","fetch_graph":"https://pith.science/api/pith-number/5S3VZ6EILBOM4YTPEPPBR6Q6KR/graph.json","fetch_events":"https://pith.science/api/pith-number/5S3VZ6EILBOM4YTPEPPBR6Q6KR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR/action/storage_attestation","attest_author":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR/action/author_attestation","sign_citation":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR/action/citation_signature","submit_replication":"https://pith.science/pith/5S3VZ6EILBOM4YTPEPPBR6Q6KR/action/replication_record"}},"created_at":"2026-06-02T02:04:07.192531+00:00","updated_at":"2026-06-02T02:04:07.192531+00:00"}