{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ECSWFAZCKDEGCJFL342RPSHGWL","short_pith_number":"pith:ECSWFAZC","canonical_record":{"source":{"id":"1802.04705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T16:20:56Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"2e47758412067882b335e7eb6056e554e26c4c31153bc4ad2dd3b0ef2e7aafa3","abstract_canon_sha256":"f8200b936b17072ffb7d476dcdadcaf7b8d0626c5da8be94bff56914772c86de"},"schema_version":"1.0"},"canonical_sha256":"20a562832250c86124abdf3517c8e6b2fc9194f518848abfad30852644fde775","source":{"kind":"arxiv","id":"1802.04705","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04705","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04705v2","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04705","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"ECSWFAZCKDEG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECSWFAZCKDEGCJFL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECSWFAZC","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ECSWFAZCKDEGCJFL342RPSHGWL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T16:20:56Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"2e47758412067882b335e7eb6056e554e26c4c31153bc4ad2dd3b0ef2e7aafa3","abstract_canon_sha256":"f8200b936b17072ffb7d476dcdadcaf7b8d0626c5da8be94bff56914772c86de"},"schema_version":"1.0"},"canonical_sha256":"20a562832250c86124abdf3517c8e6b2fc9194f518848abfad30852644fde775","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.925441Z","signature_b64":"sVyHpU6kCwiupNRYePrjnCOjva6rIJSdBbOzwTP07OdaqdTY26DH+FIHkCHjWxP2+VQVyoyyWisGQrMwnDQUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a562832250c86124abdf3517c8e6b2fc9194f518848abfad30852644fde775","last_reissued_at":"2026-05-18T00:12:08.924763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:08.924763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04705","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:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c54NpRbORQjI0gp5LY9Q7daDaNjGnfXGe9Jijb4DPGp7nM7f7SNahL9hlH7hl+fsl7Qk+qk+1Mh97WCSK39kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:15:14.221590Z"},"content_sha256":"3820aa1d6e91186cbda9c5a9d652c0ca7f926ccf60644a89ffef89fbc85cf1c5","schema_version":"1.0","event_id":"sha256:3820aa1d6e91186cbda9c5a9d652c0ca7f926ccf60644a89ffef89fbc85cf1c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ECSWFAZCKDEGCJFL342RPSHGWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Huanyu Zhang, Jayadev Acharya, Ziteng Sun","submitted_at":"2018-02-13T16:20:56Z","abstract_excerpt":"We study the problem of estimating $k$-ary distributions under $\\varepsilon$-local differential privacy. $n$ samples are distributed across users who send privatized versions of their sample to a central server. All previously known sample optimal algorithms require linear (in $k$) communication from each user in the high privacy regime $(\\varepsilon=O(1))$, and run in time that grows as $n\\cdot k$, which can be prohibitive for large domain size $k$.\n  We propose Hadamard Response (HR}, a local privatization scheme that requires no shared randomness and is symmetric with respect to the users. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04705","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:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQ0nM/aCKvufklNu/rbDegOIcSEn0vFrNXraHbVghKWtvTz1id1YHs9XaRwgC8HG+/ptA2xWa21WIa6d3BEgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:15:14.221939Z"},"content_sha256":"0344f9a66f92f2f7c91a6e16c6b3a52f6caf759b5dab8231da8126bd91bb27ba","schema_version":"1.0","event_id":"sha256:0344f9a66f92f2f7c91a6e16c6b3a52f6caf759b5dab8231da8126bd91bb27ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECSWFAZCKDEGCJFL342RPSHGWL/bundle.json","state_url":"https://pith.science/pith/ECSWFAZCKDEGCJFL342RPSHGWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECSWFAZCKDEGCJFL342RPSHGWL/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-06-03T17:15:14Z","links":{"resolver":"https://pith.science/pith/ECSWFAZCKDEGCJFL342RPSHGWL","bundle":"https://pith.science/pith/ECSWFAZCKDEGCJFL342RPSHGWL/bundle.json","state":"https://pith.science/pith/ECSWFAZCKDEGCJFL342RPSHGWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECSWFAZCKDEGCJFL342RPSHGWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ECSWFAZCKDEGCJFL342RPSHGWL","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":"f8200b936b17072ffb7d476dcdadcaf7b8d0626c5da8be94bff56914772c86de","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T16:20:56Z","title_canon_sha256":"2e47758412067882b335e7eb6056e554e26c4c31153bc4ad2dd3b0ef2e7aafa3"},"schema_version":"1.0","source":{"id":"1802.04705","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04705","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04705v2","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04705","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"ECSWFAZCKDEG","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECSWFAZCKDEGCJFL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECSWFAZC","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0344f9a66f92f2f7c91a6e16c6b3a52f6caf759b5dab8231da8126bd91bb27ba","target":"graph","created_at":"2026-05-18T00:12:08Z","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 study the problem of estimating $k$-ary distributions under $\\varepsilon$-local differential privacy. $n$ samples are distributed across users who send privatized versions of their sample to a central server. All previously known sample optimal algorithms require linear (in $k$) communication from each user in the high privacy regime $(\\varepsilon=O(1))$, and run in time that grows as $n\\cdot k$, which can be prohibitive for large domain size $k$.\n  We propose Hadamard Response (HR}, a local privatization scheme that requires no shared randomness and is symmetric with respect to the users. ","authors_text":"Huanyu Zhang, Jayadev Acharya, Ziteng Sun","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T16:20:56Z","title":"Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04705","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:3820aa1d6e91186cbda9c5a9d652c0ca7f926ccf60644a89ffef89fbc85cf1c5","target":"record","created_at":"2026-05-18T00:12:08Z","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":"f8200b936b17072ffb7d476dcdadcaf7b8d0626c5da8be94bff56914772c86de","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T16:20:56Z","title_canon_sha256":"2e47758412067882b335e7eb6056e554e26c4c31153bc4ad2dd3b0ef2e7aafa3"},"schema_version":"1.0","source":{"id":"1802.04705","kind":"arxiv","version":2}},"canonical_sha256":"20a562832250c86124abdf3517c8e6b2fc9194f518848abfad30852644fde775","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20a562832250c86124abdf3517c8e6b2fc9194f518848abfad30852644fde775","first_computed_at":"2026-05-18T00:12:08.924763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:08.924763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVyHpU6kCwiupNRYePrjnCOjva6rIJSdBbOzwTP07OdaqdTY26DH+FIHkCHjWxP2+VQVyoyyWisGQrMwnDQUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:08.925441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04705","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3820aa1d6e91186cbda9c5a9d652c0ca7f926ccf60644a89ffef89fbc85cf1c5","sha256:0344f9a66f92f2f7c91a6e16c6b3a52f6caf759b5dab8231da8126bd91bb27ba"],"state_sha256":"9bc71e357cb8ee1c2418a43ad6115a86878ab671e0eafa0745b4f680754afc65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wd7weDwLH7EEscri5xq05Jh8IJ5KI2zmvREdsNbScSXR2weyx7et34nOCxbMda/nFjiEygrLORfy2RvaqmRqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:15:14.223971Z","bundle_sha256":"5660259938dcb0074f07c7449b71dcd77de843f0b2dfed575371a223f3ac0ce9"}}