{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:C52JL377H5IEVGR6OMBS56C6G6","short_pith_number":"pith:C52JL377","schema_version":"1.0","canonical_sha256":"177495efff3f504a9a3e73032ef85e37b5f3056d96ae8e65ad79b59c63df39aa","source":{"kind":"arxiv","id":"2501.17750","version":1},"attestation_state":"computed","paper":{"title":"Privacy Audit as Bits Transmission: (Im)possibilities for Audit by One Run","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Di Wang, Tianhao Wang, Zihang Xiang","submitted_at":"2025-01-29T16:38:51Z","abstract_excerpt":"Auditing algorithms' privacy typically involves simulating a game-based protocol that guesses which of two adjacent datasets was the original input. Traditional approaches require thousands of such simulations, leading to significant computational overhead. Recent methods propose single-run auditing of the target algorithm to address this, substantially reducing computational cost. However, these methods' general applicability and tightness in producing empirical privacy guarantees remain uncertain.\n  This work studies such problems in detail. Our contributions are twofold: First, we introduce"},"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":"2501.17750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-01-29T16:38:51Z","cross_cats_sorted":[],"title_canon_sha256":"61d82b578f75c0158fe470c9c3c44a84012ced1676ac2e8fe9ad639740434dc3","abstract_canon_sha256":"64f883d41061f41e08e14858ab8cacc7c0022678780fb8613b08e7daf02be781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:57.345158Z","signature_b64":"Ne1Ho4Rfi/zXtjfskGM7kPGruQbMtcaU96XqeKa3FUUpLbkPInYZ1Bcwedhx0elOivhzVe3RZ/jcE/3LasB9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"177495efff3f504a9a3e73032ef85e37b5f3056d96ae8e65ad79b59c63df39aa","last_reissued_at":"2026-07-05T10:06:57.344550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:57.344550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy Audit as Bits Transmission: (Im)possibilities for Audit by One Run","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Di Wang, Tianhao Wang, Zihang Xiang","submitted_at":"2025-01-29T16:38:51Z","abstract_excerpt":"Auditing algorithms' privacy typically involves simulating a game-based protocol that guesses which of two adjacent datasets was the original input. Traditional approaches require thousands of such simulations, leading to significant computational overhead. Recent methods propose single-run auditing of the target algorithm to address this, substantially reducing computational cost. However, these methods' general applicability and tightness in producing empirical privacy guarantees remain uncertain.\n  This work studies such problems in detail. Our contributions are twofold: First, we introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17750","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/2501.17750/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":"2501.17750","created_at":"2026-07-05T10:06:57.344623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17750v1","created_at":"2026-07-05T10:06:57.344623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17750","created_at":"2026-07-05T10:06:57.344623+00:00"},{"alias_kind":"pith_short_12","alias_value":"C52JL377H5IE","created_at":"2026-07-05T10:06:57.344623+00:00"},{"alias_kind":"pith_short_16","alias_value":"C52JL377H5IEVGR6","created_at":"2026-07-05T10:06:57.344623+00:00"},{"alias_kind":"pith_short_8","alias_value":"C52JL377","created_at":"2026-07-05T10:06:57.344623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27292","citing_title":"Detectability in Diversity: Improved Canary Crafting for Privacy Auditing in One Run","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6","json":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6.json","graph_json":"https://pith.science/api/pith-number/C52JL377H5IEVGR6OMBS56C6G6/graph.json","events_json":"https://pith.science/api/pith-number/C52JL377H5IEVGR6OMBS56C6G6/events.json","paper":"https://pith.science/paper/C52JL377"},"agent_actions":{"view_html":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6","download_json":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6.json","view_paper":"https://pith.science/paper/C52JL377","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17750&json=true","fetch_graph":"https://pith.science/api/pith-number/C52JL377H5IEVGR6OMBS56C6G6/graph.json","fetch_events":"https://pith.science/api/pith-number/C52JL377H5IEVGR6OMBS56C6G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6/action/storage_attestation","attest_author":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6/action/author_attestation","sign_citation":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6/action/citation_signature","submit_replication":"https://pith.science/pith/C52JL377H5IEVGR6OMBS56C6G6/action/replication_record"}},"created_at":"2026-07-05T10:06:57.344623+00:00","updated_at":"2026-07-05T10:06:57.344623+00:00"}