{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LVJN7N2QJAFLZUZEO6ICC7GDQN","short_pith_number":"pith:LVJN7N2Q","schema_version":"1.0","canonical_sha256":"5d52dfb750480abcd3247790217cc3837e3159634f415c576fbfc9a87b527a2b","source":{"kind":"arxiv","id":"2211.15410","version":1},"attestation_state":"computed","paper":{"title":"Private Multi-Winner Voting for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Adam Dziedzic, Ali Shahin Shamsabadi, Christopher A Choquette-Choo, Muhammad Ahmad Kaleem, Natalie Dullerud, Nicolas Papernot, Somesh Jha, Vinith Menon Suriyakumar, Xiao Wang","submitted_at":"2022-11-23T20:06:46Z","abstract_excerpt":"Private multi-winner voting is the task of revealing $k$-hot binary vectors satisfying a bounded differential privacy (DP) guarantee. This task has been understudied in machine learning literature despite its prevalence in many domains such as healthcare. We propose three new DP multi-winner mechanisms: Binary, $\\tau$, and Powerset voting. Binary voting operates independently per label through composition. $\\tau$ voting bounds votes optimally in their $\\ell_2$ norm for tight data-independent guarantees. Powerset voting operates over the entire binary vector by viewing the possible outcomes as "},"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":"2211.15410","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-23T20:06:46Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"aba2b2ea4475412f7463c92e2a2a4690784a1dbbde0b9878385042520d6819c7","abstract_canon_sha256":"6d9ec63579eb372d3a5d90b86dfc17254e8c796447dc26a5e8e0ceb84f49d1ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:03.410143Z","signature_b64":"v+R2L2NuELDlk+zuvqzgYPEn5yRm1CQ7f9nKPptPANjDMmbIuUpl5SMKdy6YvTjJ2ubMCa20n25016vZaPoQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d52dfb750480abcd3247790217cc3837e3159634f415c576fbfc9a87b527a2b","last_reissued_at":"2026-07-05T05:20:03.409739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:03.409739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Multi-Winner Voting for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Adam Dziedzic, Ali Shahin Shamsabadi, Christopher A Choquette-Choo, Muhammad Ahmad Kaleem, Natalie Dullerud, Nicolas Papernot, Somesh Jha, Vinith Menon Suriyakumar, Xiao Wang","submitted_at":"2022-11-23T20:06:46Z","abstract_excerpt":"Private multi-winner voting is the task of revealing $k$-hot binary vectors satisfying a bounded differential privacy (DP) guarantee. This task has been understudied in machine learning literature despite its prevalence in many domains such as healthcare. We propose three new DP multi-winner mechanisms: Binary, $\\tau$, and Powerset voting. Binary voting operates independently per label through composition. $\\tau$ voting bounds votes optimally in their $\\ell_2$ norm for tight data-independent guarantees. Powerset voting operates over the entire binary vector by viewing the possible outcomes as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15410","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/2211.15410/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":"2211.15410","created_at":"2026-07-05T05:20:03.409798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.15410v1","created_at":"2026-07-05T05:20:03.409798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15410","created_at":"2026-07-05T05:20:03.409798+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVJN7N2QJAFL","created_at":"2026-07-05T05:20:03.409798+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVJN7N2QJAFLZUZE","created_at":"2026-07-05T05:20:03.409798+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVJN7N2Q","created_at":"2026-07-05T05:20:03.409798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN","json":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN.json","graph_json":"https://pith.science/api/pith-number/LVJN7N2QJAFLZUZEO6ICC7GDQN/graph.json","events_json":"https://pith.science/api/pith-number/LVJN7N2QJAFLZUZEO6ICC7GDQN/events.json","paper":"https://pith.science/paper/LVJN7N2Q"},"agent_actions":{"view_html":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN","download_json":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN.json","view_paper":"https://pith.science/paper/LVJN7N2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.15410&json=true","fetch_graph":"https://pith.science/api/pith-number/LVJN7N2QJAFLZUZEO6ICC7GDQN/graph.json","fetch_events":"https://pith.science/api/pith-number/LVJN7N2QJAFLZUZEO6ICC7GDQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN/action/storage_attestation","attest_author":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN/action/author_attestation","sign_citation":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN/action/citation_signature","submit_replication":"https://pith.science/pith/LVJN7N2QJAFLZUZEO6ICC7GDQN/action/replication_record"}},"created_at":"2026-07-05T05:20:03.409798+00:00","updated_at":"2026-07-05T05:20:03.409798+00:00"}