{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NBBXR477D3OJREN3G6JHQV3XBV","short_pith_number":"pith:NBBXR477","canonical_record":{"source":{"id":"1808.03537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-08-10T13:44:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"af2d9302e3564feba75ef400159aaf2af6585dd85e2e8ad77259d9fe83026b58","abstract_canon_sha256":"0a3d9dc00f0fe55c43fc6d2234adea1b24fae5f91c00346204d954e627517159"},"schema_version":"1.0"},"canonical_sha256":"684378f3ff1edc9891bb37927857770d46ce2c5947647a2245ee0a3e48f0a4c8","source":{"kind":"arxiv","id":"1808.03537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03537","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03537v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03537","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"NBBXR477D3OJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBBXR477D3OJREN3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBBXR477","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NBBXR477D3OJREN3G6JHQV3XBV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-08-10T13:44:26Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"af2d9302e3564feba75ef400159aaf2af6585dd85e2e8ad77259d9fe83026b58","abstract_canon_sha256":"0a3d9dc00f0fe55c43fc6d2234adea1b24fae5f91c00346204d954e627517159"},"schema_version":"1.0"},"canonical_sha256":"684378f3ff1edc9891bb37927857770d46ce2c5947647a2245ee0a3e48f0a4c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.732785Z","signature_b64":"GvDLz85Vc1EOg5P0ZuWX+O+yODnKm50tIftFUSP7ypQPtRod11xQbbYQaLBpvnkuuZzq1yHdZ/6RWUgQfR/WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684378f3ff1edc9891bb37927857770d46ce2c5947647a2245ee0a3e48f0a4c8","last_reissued_at":"2026-05-18T00:08:24.732224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.732224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03537","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+NC39bHu32duRRNpXconp5lp4BuEiZFXKkCdlkmYRLnXueeZh+GOp9LZscb6RpA/0Q8DlbfiD0ROI4PJ0NSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:49:27.662489Z"},"content_sha256":"1ae2e29305781a5878bc1617226e55a54bcf8a2dbce3af8cb81b831b673daf50","schema_version":"1.0","event_id":"sha256:1ae2e29305781a5878bc1617226e55a54bcf8a2dbce3af8cb81b831b673daf50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NBBXR477D3OJREN3G6JHQV3XBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing error of high-dimensional statistical queries under differential privacy","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Ashwin Machanavajjhala, Gerome Miklau, Michael Hay, Ryan McKenna","submitted_at":"2018-08-10T13:44:26Z","abstract_excerpt":"Differentially private algorithms for answering sets of predicate counting queries on a sensitive database have many applications. Organizations that collect individual-level data, such as statistical agencies and medical institutions, use them to safely release summary tabulations. However, existing techniques are accurate only on a narrow class of query workloads, or are extremely slow, especially when analyzing more than one or two dimensions of the data. In this work we propose HDMM, a new differentially private algorithm for answering a workload of predicate counting queries, that is espe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03537","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZIp72Ga2lD2Jr+8VqxpLYdAXudfroDYaPQsb/yJZEWtZLvKXJ4N6UeBS7Snp1gBm6iWHFxSMF/IiA78/WR3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:49:27.663096Z"},"content_sha256":"4ded700a403744d4494e851c48f3ce456ed841f3e65c58a58d6eb78c642e5c96","schema_version":"1.0","event_id":"sha256:4ded700a403744d4494e851c48f3ce456ed841f3e65c58a58d6eb78c642e5c96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBBXR477D3OJREN3G6JHQV3XBV/bundle.json","state_url":"https://pith.science/pith/NBBXR477D3OJREN3G6JHQV3XBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBBXR477D3OJREN3G6JHQV3XBV/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-29T17:49:27Z","links":{"resolver":"https://pith.science/pith/NBBXR477D3OJREN3G6JHQV3XBV","bundle":"https://pith.science/pith/NBBXR477D3OJREN3G6JHQV3XBV/bundle.json","state":"https://pith.science/pith/NBBXR477D3OJREN3G6JHQV3XBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBBXR477D3OJREN3G6JHQV3XBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NBBXR477D3OJREN3G6JHQV3XBV","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":"0a3d9dc00f0fe55c43fc6d2234adea1b24fae5f91c00346204d954e627517159","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-08-10T13:44:26Z","title_canon_sha256":"af2d9302e3564feba75ef400159aaf2af6585dd85e2e8ad77259d9fe83026b58"},"schema_version":"1.0","source":{"id":"1808.03537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03537","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03537v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03537","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"NBBXR477D3OJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NBBXR477D3OJREN3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NBBXR477","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:4ded700a403744d4494e851c48f3ce456ed841f3e65c58a58d6eb78c642e5c96","target":"graph","created_at":"2026-05-18T00:08:24Z","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":"Differentially private algorithms for answering sets of predicate counting queries on a sensitive database have many applications. Organizations that collect individual-level data, such as statistical agencies and medical institutions, use them to safely release summary tabulations. However, existing techniques are accurate only on a narrow class of query workloads, or are extremely slow, especially when analyzing more than one or two dimensions of the data. In this work we propose HDMM, a new differentially private algorithm for answering a workload of predicate counting queries, that is espe","authors_text":"Ashwin Machanavajjhala, Gerome Miklau, Michael Hay, Ryan McKenna","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-08-10T13:44:26Z","title":"Optimizing error of high-dimensional statistical queries under differential privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03537","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:1ae2e29305781a5878bc1617226e55a54bcf8a2dbce3af8cb81b831b673daf50","target":"record","created_at":"2026-05-18T00:08:24Z","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":"0a3d9dc00f0fe55c43fc6d2234adea1b24fae5f91c00346204d954e627517159","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-08-10T13:44:26Z","title_canon_sha256":"af2d9302e3564feba75ef400159aaf2af6585dd85e2e8ad77259d9fe83026b58"},"schema_version":"1.0","source":{"id":"1808.03537","kind":"arxiv","version":1}},"canonical_sha256":"684378f3ff1edc9891bb37927857770d46ce2c5947647a2245ee0a3e48f0a4c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"684378f3ff1edc9891bb37927857770d46ce2c5947647a2245ee0a3e48f0a4c8","first_computed_at":"2026-05-18T00:08:24.732224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.732224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GvDLz85Vc1EOg5P0ZuWX+O+yODnKm50tIftFUSP7ypQPtRod11xQbbYQaLBpvnkuuZzq1yHdZ/6RWUgQfR/WAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.732785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ae2e29305781a5878bc1617226e55a54bcf8a2dbce3af8cb81b831b673daf50","sha256:4ded700a403744d4494e851c48f3ce456ed841f3e65c58a58d6eb78c642e5c96"],"state_sha256":"0be415470ec2f505d16c0069cb0f1ea78a8b80582f6873d5d22c7f8782c0e68f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kipJveIW0VcPfXntGMXX/OjD8ls0S8A3uNUg7RE5pfslHvXYHcqpvkLwOhV1xjKCpo/GKYRaYiW64fS3tOKKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:49:27.666604Z","bundle_sha256":"32a045e7ad99c707be4b56cd503132346e5afd17b7ab55a5663f3f5c0961ab8a"}}