{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VPYIQ2CVGIMD5NQ3Q3LDPANUJB","short_pith_number":"pith:VPYIQ2CV","canonical_record":{"source":{"id":"1704.03024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T19:16:12Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3a6244f7c3bd367caaa66e72df9975aa4551c36de72a44aeea5aef5ba92c286b","abstract_canon_sha256":"4be85aa3ed473e30dc9e43c883eeeec5453b2df6af558c035ea644f9e5051a24"},"schema_version":"1.0"},"canonical_sha256":"abf088685532183eb61b86d63781b4486cd7dfcfcd12e2a6173dbdd7fbc842f1","source":{"kind":"arxiv","id":"1704.03024","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03024","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03024v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03024","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"VPYIQ2CVGIMD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPYIQ2CVGIMD5NQ3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPYIQ2CV","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VPYIQ2CVGIMD5NQ3Q3LDPANUJB","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T19:16:12Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3a6244f7c3bd367caaa66e72df9975aa4551c36de72a44aeea5aef5ba92c286b","abstract_canon_sha256":"4be85aa3ed473e30dc9e43c883eeeec5453b2df6af558c035ea644f9e5051a24"},"schema_version":"1.0"},"canonical_sha256":"abf088685532183eb61b86d63781b4486cd7dfcfcd12e2a6173dbdd7fbc842f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:33.967464Z","signature_b64":"kCV1JbG+Pvo4yAf/3mJkFpVFXMRcDsSSoianVlBulXwhRj9YX1EDT/u410W9VuSQdx9B8xY0r3KSVDP5ov5uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abf088685532183eb61b86d63781b4486cd7dfcfcd12e2a6173dbdd7fbc842f1","last_reissued_at":"2026-05-18T00:46:33.966714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:33.966714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03024","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9SXuFNOEtcfTAwDGpraQCPQGgEd1mZHW8Zsw9W49RLaLpcpIytF422uM7EsL20nMkPwnc3GhVgrES1NS9C1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:12:20.479498Z"},"content_sha256":"fad1fc1bc1556c49be7e04833156d547137d21f3a17fb57b8e5c68b1b296517a","schema_version":"1.0","event_id":"sha256:fad1fc1bc1556c49be7e04833156d547137d21f3a17fb57b8e5c68b1b296517a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VPYIQ2CVGIMD5NQ3Q3LDPANUJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Differentially Private Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jonathan Ullman, Thomas Steinke","submitted_at":"2017-04-10T19:16:12Z","abstract_excerpt":"A pervasive task in the differential privacy literature is to select the $k$ items of \"highest quality\" out of a set of $d$ items, where the quality of each item depends on a sensitive dataset that must be protected. Variants of this task arise naturally in fundamental problems like feature selection and hypothesis testing, and also as subroutines for many sophisticated differentially private algorithms.\n  The standard approaches to these tasks---repeated use of the exponential mechanism or the sparse vector technique---approximately solve this problem given a dataset of $n = O(\\sqrt{k}\\log d)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03024","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPVdP2tKpB5eSIPwg/MtmaQndJNR+wdysXPlHfMBG1b5ohhTtANRE3TjgBYlwk3k2dZHBYk0CNCttVSteMuLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T14:12:20.480133Z"},"content_sha256":"8200ba9d884c3bd312c64fed0e065f751f594b50ded864ed66ca474ff9e110fa","schema_version":"1.0","event_id":"sha256:8200ba9d884c3bd312c64fed0e065f751f594b50ded864ed66ca474ff9e110fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/bundle.json","state_url":"https://pith.science/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T14:12:20Z","links":{"resolver":"https://pith.science/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB","bundle":"https://pith.science/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/bundle.json","state":"https://pith.science/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPYIQ2CVGIMD5NQ3Q3LDPANUJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VPYIQ2CVGIMD5NQ3Q3LDPANUJB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4be85aa3ed473e30dc9e43c883eeeec5453b2df6af558c035ea644f9e5051a24","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T19:16:12Z","title_canon_sha256":"3a6244f7c3bd367caaa66e72df9975aa4551c36de72a44aeea5aef5ba92c286b"},"schema_version":"1.0","source":{"id":"1704.03024","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03024","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03024v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03024","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"VPYIQ2CVGIMD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VPYIQ2CVGIMD5NQ3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VPYIQ2CV","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:8200ba9d884c3bd312c64fed0e065f751f594b50ded864ed66ca474ff9e110fa","target":"graph","created_at":"2026-05-18T00:46:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A pervasive task in the differential privacy literature is to select the $k$ items of \"highest quality\" out of a set of $d$ items, where the quality of each item depends on a sensitive dataset that must be protected. Variants of this task arise naturally in fundamental problems like feature selection and hypothesis testing, and also as subroutines for many sophisticated differentially private algorithms.\n  The standard approaches to these tasks---repeated use of the exponential mechanism or the sparse vector technique---approximately solve this problem given a dataset of $n = O(\\sqrt{k}\\log d)","authors_text":"Jonathan Ullman, Thomas Steinke","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T19:16:12Z","title":"Tight Lower Bounds for Differentially Private Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03024","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fad1fc1bc1556c49be7e04833156d547137d21f3a17fb57b8e5c68b1b296517a","target":"record","created_at":"2026-05-18T00:46:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4be85aa3ed473e30dc9e43c883eeeec5453b2df6af558c035ea644f9e5051a24","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T19:16:12Z","title_canon_sha256":"3a6244f7c3bd367caaa66e72df9975aa4551c36de72a44aeea5aef5ba92c286b"},"schema_version":"1.0","source":{"id":"1704.03024","kind":"arxiv","version":1}},"canonical_sha256":"abf088685532183eb61b86d63781b4486cd7dfcfcd12e2a6173dbdd7fbc842f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abf088685532183eb61b86d63781b4486cd7dfcfcd12e2a6173dbdd7fbc842f1","first_computed_at":"2026-05-18T00:46:33.966714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:33.966714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kCV1JbG+Pvo4yAf/3mJkFpVFXMRcDsSSoianVlBulXwhRj9YX1EDT/u410W9VuSQdx9B8xY0r3KSVDP5ov5uCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:33.967464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03024","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad1fc1bc1556c49be7e04833156d547137d21f3a17fb57b8e5c68b1b296517a","sha256:8200ba9d884c3bd312c64fed0e065f751f594b50ded864ed66ca474ff9e110fa"],"state_sha256":"d963553efdd97f99e85e00c1a76fc283f15c1555c83ca543388004652d44237d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1//+DR8/Myxui0S+MT1yH5FplzxbQAfrBhXA6p5i5rPM0XY1CBFbfdVIWomaIXc74a6/Gevkfv7NvBgqpIbzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T14:12:20.482412Z","bundle_sha256":"1dcf342ad34c50363a51e9dee35a2fdf388c4ffbffe0b79851e252a1fe46934d"}}