{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WS525JTPNOZEIJ4AW4QPP2YJ6R","short_pith_number":"pith:WS525JTP","canonical_record":{"source":{"id":"1402.1526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T23:20:43Z","cross_cats_sorted":["cs.CR","cs.DB","cs.LG"],"title_canon_sha256":"2b3da2d2f860145a83e4c26ae766250d208959294383ab885405e8ffe54f0392","abstract_canon_sha256":"66c9840f45c307ef352bd45fd6b5689074b8cfa6a5be065b33e8076c9e75895d"},"schema_version":"1.0"},"canonical_sha256":"b4bbaea66f6bb2442780b720f7eb09f465cc9dfe16339a515944360371ce74b7","source":{"kind":"arxiv","id":"1402.1526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1526","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1526v2","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1526","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"WS525JTPNOZE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WS525JTPNOZEIJ4A","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WS525JTP","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WS525JTPNOZEIJ4AW4QPP2YJ6R","target":"record","payload":{"canonical_record":{"source":{"id":"1402.1526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T23:20:43Z","cross_cats_sorted":["cs.CR","cs.DB","cs.LG"],"title_canon_sha256":"2b3da2d2f860145a83e4c26ae766250d208959294383ab885405e8ffe54f0392","abstract_canon_sha256":"66c9840f45c307ef352bd45fd6b5689074b8cfa6a5be065b33e8076c9e75895d"},"schema_version":"1.0"},"canonical_sha256":"b4bbaea66f6bb2442780b720f7eb09f465cc9dfe16339a515944360371ce74b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:00.955649Z","signature_b64":"AU7hZbhRlLe5kArj54jKexzrK6Re0O1hZCK+TNKbNoaxvl9fJQ866hf02ikgbhVp9Nep4e6R8XWS8VA4dbAHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4bbaea66f6bb2442780b720f7eb09f465cc9dfe16339a515944360371ce74b7","last_reissued_at":"2026-05-18T00:21:00.955123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:00.955123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.1526","source_version":2,"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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guRyX/VfBj+dTbLqe5Hi39qS+uUGB2VLT21AhyZZlFqN3lzNjR3HkTjrY3T4fk7FX/9qFhyJ7TTPNN7niFNqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:57.352666Z"},"content_sha256":"1b635581c9ec201e7beae903db3c2a6d1f4f4bf1f554d9d36b09ea194c9eda37","schema_version":"1.0","event_id":"sha256:1b635581c9ec201e7beae903db3c2a6d1f4f4bf1f554d9d36b09ea194c9eda37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WS525JTPNOZEIJ4AW4QPP2YJ6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Query: Practical Private Query Release for High Dimensional Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Emilio Jes\\'us Gallego Arias, Justin Hsu, Marco Gaboardi, Zhiwei Steven Wu","submitted_at":"2014-02-06T23:20:43Z","abstract_excerpt":"We present a practical, differentially private algorithm for answering a large number of queries on high dimensional datasets. Like all algorithms for this task, ours necessarily has worst-case complexity exponential in the dimension of the data. However, our algorithm packages the computationally hard step into a concisely defined integer program, which can be solved non-privately using standard solvers. We prove accuracy and privacy theorems for our algorithm, and then demonstrate experimentally that our algorithm performs well in practice. For example, our algorithm can efficiently and accu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1526","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":""},"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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpQcBPvmUM0yzfUA8KLUekMMkCAcJAzwKGvwjPTYe9VNoYdtDun9363rbjnq2JDh/VKuB2HlPpqaHS/q7SbSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:51:57.353349Z"},"content_sha256":"9717f7e9e5f4e1cf61ac385030e2ed161202f95c5ebf097eff483b4b4331086f","schema_version":"1.0","event_id":"sha256:9717f7e9e5f4e1cf61ac385030e2ed161202f95c5ebf097eff483b4b4331086f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/bundle.json","state_url":"https://pith.science/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/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-25T05:51:57Z","links":{"resolver":"https://pith.science/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R","bundle":"https://pith.science/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/bundle.json","state":"https://pith.science/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WS525JTPNOZEIJ4AW4QPP2YJ6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WS525JTPNOZEIJ4AW4QPP2YJ6R","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":"66c9840f45c307ef352bd45fd6b5689074b8cfa6a5be065b33e8076c9e75895d","cross_cats_sorted":["cs.CR","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T23:20:43Z","title_canon_sha256":"2b3da2d2f860145a83e4c26ae766250d208959294383ab885405e8ffe54f0392"},"schema_version":"1.0","source":{"id":"1402.1526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.1526","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1402.1526v2","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1526","created_at":"2026-05-18T00:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"WS525JTPNOZE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WS525JTPNOZEIJ4A","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WS525JTP","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:9717f7e9e5f4e1cf61ac385030e2ed161202f95c5ebf097eff483b4b4331086f","target":"graph","created_at":"2026-05-18T00:21:00Z","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":"We present a practical, differentially private algorithm for answering a large number of queries on high dimensional datasets. Like all algorithms for this task, ours necessarily has worst-case complexity exponential in the dimension of the data. However, our algorithm packages the computationally hard step into a concisely defined integer program, which can be solved non-privately using standard solvers. We prove accuracy and privacy theorems for our algorithm, and then demonstrate experimentally that our algorithm performs well in practice. For example, our algorithm can efficiently and accu","authors_text":"Aaron Roth, Emilio Jes\\'us Gallego Arias, Justin Hsu, Marco Gaboardi, Zhiwei Steven Wu","cross_cats":["cs.CR","cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T23:20:43Z","title":"Dual Query: Practical Private Query Release for High Dimensional Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1526","kind":"arxiv","version":2},"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:1b635581c9ec201e7beae903db3c2a6d1f4f4bf1f554d9d36b09ea194c9eda37","target":"record","created_at":"2026-05-18T00:21:00Z","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":"66c9840f45c307ef352bd45fd6b5689074b8cfa6a5be065b33e8076c9e75895d","cross_cats_sorted":["cs.CR","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-06T23:20:43Z","title_canon_sha256":"2b3da2d2f860145a83e4c26ae766250d208959294383ab885405e8ffe54f0392"},"schema_version":"1.0","source":{"id":"1402.1526","kind":"arxiv","version":2}},"canonical_sha256":"b4bbaea66f6bb2442780b720f7eb09f465cc9dfe16339a515944360371ce74b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4bbaea66f6bb2442780b720f7eb09f465cc9dfe16339a515944360371ce74b7","first_computed_at":"2026-05-18T00:21:00.955123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:00.955123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AU7hZbhRlLe5kArj54jKexzrK6Re0O1hZCK+TNKbNoaxvl9fJQ866hf02ikgbhVp9Nep4e6R8XWS8VA4dbAHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:00.955649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.1526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b635581c9ec201e7beae903db3c2a6d1f4f4bf1f554d9d36b09ea194c9eda37","sha256:9717f7e9e5f4e1cf61ac385030e2ed161202f95c5ebf097eff483b4b4331086f"],"state_sha256":"b0a88a0cf6f1c2f9ac1122dd9dec6497e5b3e96838c51f706c6e8ed9e70c5cff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COdp7fekKPj5+kBW2jPkhqp6rkkzg5fYGPhdiEw2HSUB7rM5VF6zFc0kMmFwec3mIu1g+dTbkOrxTtVP3/b5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:51:57.356504Z","bundle_sha256":"07177ae872157c4e7b4a430e0674fcd01dceaea874f0f9ce7d8e58c6419e05e9"}}