{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RLBCCJDD3TW3CAREEQKFN73YCB","short_pith_number":"pith:RLBCCJDD","schema_version":"1.0","canonical_sha256":"8ac2212463dcedb10224241456ff7810558d3bcdd9c49341a34cdc0dbd79bbf9","source":{"kind":"arxiv","id":"1607.08025","version":1},"attestation_state":"computed","paper":{"title":"Mutual Information Optimally Local Private Discrete Distribution Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Qiao, Hongli Xu, Liusheng Huang, Pengzhan Wang, Shaowei Wang, Wei Yang, Xiang-Yang Li, Yiwen Nie","submitted_at":"2016-07-27T10:34:44Z","abstract_excerpt":"Consider statistical learning (e.g. discrete distribution estimation) with local $\\epsilon$-differential privacy, which preserves each data provider's privacy locally, we aim to optimize statistical data utility under the privacy constraints. Specifically, we study maximizing mutual information between a provider's data and its private view, and give the exact mutual information bound along with an attainable mechanism: $k$-subset mechanism as results. The mutual information optimal mechanism randomly outputs a size $k$ subset of the original data domain with delicate probability assignment, w"},"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":"1607.08025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-27T10:34:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5f5213c82dd5d7873320dcba09de7a6113925834ea331b759e6bfb1b8c8ec88","abstract_canon_sha256":"2c432d986d65091179c06c55ef4567d2fdadc92fbf74298b0d7e42f991cbb17b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:22.679417Z","signature_b64":"3zkh/vJNQQ51HreF4wkoVYb2vB1m02Wsnqfg2xA6SZMp6IMuD4YwfK13sUPfkAhXgdzvPFAnlB5UdEfueBXACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac2212463dcedb10224241456ff7810558d3bcdd9c49341a34cdc0dbd79bbf9","last_reissued_at":"2026-05-18T01:10:22.678607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:22.678607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mutual Information Optimally Local Private Discrete Distribution Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunming Qiao, Hongli Xu, Liusheng Huang, Pengzhan Wang, Shaowei Wang, Wei Yang, Xiang-Yang Li, Yiwen Nie","submitted_at":"2016-07-27T10:34:44Z","abstract_excerpt":"Consider statistical learning (e.g. discrete distribution estimation) with local $\\epsilon$-differential privacy, which preserves each data provider's privacy locally, we aim to optimize statistical data utility under the privacy constraints. Specifically, we study maximizing mutual information between a provider's data and its private view, and give the exact mutual information bound along with an attainable mechanism: $k$-subset mechanism as results. The mutual information optimal mechanism randomly outputs a size $k$ subset of the original data domain with delicate probability assignment, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08025","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.08025","created_at":"2026-05-18T01:10:22.678730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08025v1","created_at":"2026-05-18T01:10:22.678730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08025","created_at":"2026-05-18T01:10:22.678730+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLBCCJDD3TW3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLBCCJDD3TW3CARE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLBCCJDD","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB","json":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB.json","graph_json":"https://pith.science/api/pith-number/RLBCCJDD3TW3CAREEQKFN73YCB/graph.json","events_json":"https://pith.science/api/pith-number/RLBCCJDD3TW3CAREEQKFN73YCB/events.json","paper":"https://pith.science/paper/RLBCCJDD"},"agent_actions":{"view_html":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB","download_json":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB.json","view_paper":"https://pith.science/paper/RLBCCJDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08025&json=true","fetch_graph":"https://pith.science/api/pith-number/RLBCCJDD3TW3CAREEQKFN73YCB/graph.json","fetch_events":"https://pith.science/api/pith-number/RLBCCJDD3TW3CAREEQKFN73YCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB/action/storage_attestation","attest_author":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB/action/author_attestation","sign_citation":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB/action/citation_signature","submit_replication":"https://pith.science/pith/RLBCCJDD3TW3CAREEQKFN73YCB/action/replication_record"}},"created_at":"2026-05-18T01:10:22.678730+00:00","updated_at":"2026-05-18T01:10:22.678730+00:00"}