{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BMPYDQPYCV6BDDPMU25IGDG6QY","short_pith_number":"pith:BMPYDQPY","schema_version":"1.0","canonical_sha256":"0b1f81c1f8157c118deca6ba830cde86092fd3f6821e9518b3a5fcf8d142e460","source":{"kind":"arxiv","id":"2201.13376","version":1},"attestation_state":"computed","paper":{"title":"Differentially Private Top-k Selection via Canonical Lipschitz Mechanism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Grigorios Loukides, Michael Shekelyan","submitted_at":"2022-01-31T17:39:04Z","abstract_excerpt":"Selecting the top-$k$ highest scoring items under differential privacy (DP) is a fundamental task with many applications. This work presents three new results. First, the exponential mechanism, permute-and-flip and report-noisy-max, as well as their oneshot variants, are unified into the Lipschitz mechanism, an additive noise mechanism with a single DP-proof via a mandated Lipschitz property for the noise distribution. Second, this new generalized mechanism is paired with a canonical loss function to obtain the canonical Lipschitz mechanism, which can directly select k-subsets out of $d$ items"},"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":"2201.13376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T17:39:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b6db109ca4d249d6ea39ef77d1dd35f5aad28425dd9cd0717f62b4ff48a7eaa7","abstract_canon_sha256":"242e9e7385d4b772dbaa3184b7d5724c040056b69a61959056a4385a08566111"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:51.398359Z","signature_b64":"1yzFdlfr1tKUUNCJekRpUn+h7Jg9UJ3aT8NddKdgPzFV0THZbuWuauDHo7TXT2lFjOS0rBmqAcI1R340P0ioAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1f81c1f8157c118deca6ba830cde86092fd3f6821e9518b3a5fcf8d142e460","last_reissued_at":"2026-07-05T03:52:51.397888Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:51.397888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentially Private Top-k Selection via Canonical Lipschitz Mechanism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Grigorios Loukides, Michael Shekelyan","submitted_at":"2022-01-31T17:39:04Z","abstract_excerpt":"Selecting the top-$k$ highest scoring items under differential privacy (DP) is a fundamental task with many applications. This work presents three new results. First, the exponential mechanism, permute-and-flip and report-noisy-max, as well as their oneshot variants, are unified into the Lipschitz mechanism, an additive noise mechanism with a single DP-proof via a mandated Lipschitz property for the noise distribution. Second, this new generalized mechanism is paired with a canonical loss function to obtain the canonical Lipschitz mechanism, which can directly select k-subsets out of $d$ items"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13376","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/2201.13376/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":"2201.13376","created_at":"2026-07-05T03:52:51.397943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.13376v1","created_at":"2026-07-05T03:52:51.397943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13376","created_at":"2026-07-05T03:52:51.397943+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMPYDQPYCV6B","created_at":"2026-07-05T03:52:51.397943+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMPYDQPYCV6BDDPM","created_at":"2026-07-05T03:52:51.397943+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMPYDQPY","created_at":"2026-07-05T03:52:51.397943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2407.20068","citing_title":"Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY","json":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY.json","graph_json":"https://pith.science/api/pith-number/BMPYDQPYCV6BDDPMU25IGDG6QY/graph.json","events_json":"https://pith.science/api/pith-number/BMPYDQPYCV6BDDPMU25IGDG6QY/events.json","paper":"https://pith.science/paper/BMPYDQPY"},"agent_actions":{"view_html":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY","download_json":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY.json","view_paper":"https://pith.science/paper/BMPYDQPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.13376&json=true","fetch_graph":"https://pith.science/api/pith-number/BMPYDQPYCV6BDDPMU25IGDG6QY/graph.json","fetch_events":"https://pith.science/api/pith-number/BMPYDQPYCV6BDDPMU25IGDG6QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY/action/storage_attestation","attest_author":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY/action/author_attestation","sign_citation":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY/action/citation_signature","submit_replication":"https://pith.science/pith/BMPYDQPYCV6BDDPMU25IGDG6QY/action/replication_record"}},"created_at":"2026-07-05T03:52:51.397943+00:00","updated_at":"2026-07-05T03:52:51.397943+00:00"}