{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KWOCRWQDO5KZANHGFFAW6ZFXQ5","short_pith_number":"pith:KWOCRWQD","schema_version":"1.0","canonical_sha256":"559c28da0377559034e629416f64b787475bbd09f5b93b8356650000c508850a","source":{"kind":"arxiv","id":"2106.12118","version":1},"attestation_state":"computed","paper":{"title":"HDMM: Optimizing error of high-dimensional statistical queries under differential privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Ashwin Machanavajjhala, Gerome Miklau, Michael Hay, Ryan McKenna","submitted_at":"2021-06-23T01:19:18Z","abstract_excerpt":"In this work we describe the High-Dimensional Matrix Mechanism (HDMM), a differentially private algorithm for answering a workload of predicate counting queries. HDMM represents query workloads using a compact implicit matrix representation and exploits this representation to efficiently optimize over (a subset of) the space of differentially private algorithms for one that is unbiased and answers the input query workload with low expected error. HDMM can be deployed for both $\\epsilon$-differential privacy (with Laplace noise) and $(\\epsilon, \\delta)$-differential privacy (with Gaussian noise"},"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":"2106.12118","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2021-06-23T01:19:18Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d50f2c758caf8e5f6e81592569efbcc61577faf3d6ac73833fbb51ca1cfe4abb","abstract_canon_sha256":"4ce824278e168c59fdc38a8ddea9458e8c53109ae64675af14b8959306d96817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:42.726741Z","signature_b64":"twC/LLCL3xHxBAUYVfrvF9KsfQiy1KA2sVRbzKS71kQt3xQ2pC5gJf0BCxNDeCsJBmwfL/xD74Z+t04FVhWgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"559c28da0377559034e629416f64b787475bbd09f5b93b8356650000c508850a","last_reissued_at":"2026-07-05T02:51:42.726270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:42.726270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HDMM: Optimizing error of high-dimensional statistical queries under differential privacy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Ashwin Machanavajjhala, Gerome Miklau, Michael Hay, Ryan McKenna","submitted_at":"2021-06-23T01:19:18Z","abstract_excerpt":"In this work we describe the High-Dimensional Matrix Mechanism (HDMM), a differentially private algorithm for answering a workload of predicate counting queries. HDMM represents query workloads using a compact implicit matrix representation and exploits this representation to efficiently optimize over (a subset of) the space of differentially private algorithms for one that is unbiased and answers the input query workload with low expected error. HDMM can be deployed for both $\\epsilon$-differential privacy (with Laplace noise) and $(\\epsilon, \\delta)$-differential privacy (with Gaussian noise"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.12118","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/2106.12118/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":"2106.12118","created_at":"2026-07-05T02:51:42.726324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.12118v1","created_at":"2026-07-05T02:51:42.726324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.12118","created_at":"2026-07-05T02:51:42.726324+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWOCRWQDO5KZ","created_at":"2026-07-05T02:51:42.726324+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWOCRWQDO5KZANHG","created_at":"2026-07-05T02:51:42.726324+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWOCRWQD","created_at":"2026-07-05T02:51:42.726324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24295","citing_title":"Private Adaptive Covariance Estimation via Gaussian Graphical Models","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2305.08175","citing_title":"ResidualPlanner+: a scalable matrix mechanism for marginals and beyond","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2507.02971","citing_title":"Aim High, Stay Private: Differentially Private Synthetic Data Enables Public Release of Behavioral Health Information with High Utility","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10881","citing_title":"Answering Counting Queries with Differential Privacy on a Quantum Computer","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5","json":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5.json","graph_json":"https://pith.science/api/pith-number/KWOCRWQDO5KZANHGFFAW6ZFXQ5/graph.json","events_json":"https://pith.science/api/pith-number/KWOCRWQDO5KZANHGFFAW6ZFXQ5/events.json","paper":"https://pith.science/paper/KWOCRWQD"},"agent_actions":{"view_html":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5","download_json":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5.json","view_paper":"https://pith.science/paper/KWOCRWQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.12118&json=true","fetch_graph":"https://pith.science/api/pith-number/KWOCRWQDO5KZANHGFFAW6ZFXQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/KWOCRWQDO5KZANHGFFAW6ZFXQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5/action/storage_attestation","attest_author":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5/action/author_attestation","sign_citation":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5/action/citation_signature","submit_replication":"https://pith.science/pith/KWOCRWQDO5KZANHGFFAW6ZFXQ5/action/replication_record"}},"created_at":"2026-07-05T02:51:42.726324+00:00","updated_at":"2026-07-05T02:51:42.726324+00:00"}