{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AKQGAIXMNA5NJVJEYNY25GUBV6","short_pith_number":"pith:AKQGAIXM","schema_version":"1.0","canonical_sha256":"02a06022ec683ad4d524c371ae9a81af8c670f3fe249dd15a69429717ce504e7","source":{"kind":"arxiv","id":"1810.02810","version":1},"attestation_state":"computed","paper":{"title":"Linear Queries Estimation with Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Raef Bassily","submitted_at":"2018-10-05T17:59:25Z","abstract_excerpt":"We study the problem of estimating a set of $d$ linear queries with respect to some unknown distribution $\\mathbf{p}$ over a domain $\\mathcal{J}=[J]$ based on a sensitive data set of $n$ individuals under the constraint of local differential privacy. This problem subsumes a wide range of estimation tasks, e.g., distribution estimation and $d$-dimensional mean estimation. We provide new algorithms for both the offline (non-adaptive) and adaptive versions of this problem.\n  In the offline setting, the set of queries are fixed before the algorithm starts. In the regime where $n\\lesssim d^2/\\log(J"},"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":"1810.02810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-05T17:59:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"274ab741272372f486423509ae64baddd92fbdf46357a3e56bd73a4f8805bcc1","abstract_canon_sha256":"fc3ec6525c71346aaf7da65b7b23c463854a3502691b75fb8ed5e3575906f98a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:00.579509Z","signature_b64":"PZfTty3ygHlV24D0dUPtlwhj4lAcxxHXZ38ZgCcR9Bc5nMSrInMSi3vZPrQ1HncwTKsRxfNin2V5cVVeeIhrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a06022ec683ad4d524c371ae9a81af8c670f3fe249dd15a69429717ce504e7","last_reissued_at":"2026-05-18T00:04:00.578872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:00.578872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Queries Estimation with Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Raef Bassily","submitted_at":"2018-10-05T17:59:25Z","abstract_excerpt":"We study the problem of estimating a set of $d$ linear queries with respect to some unknown distribution $\\mathbf{p}$ over a domain $\\mathcal{J}=[J]$ based on a sensitive data set of $n$ individuals under the constraint of local differential privacy. This problem subsumes a wide range of estimation tasks, e.g., distribution estimation and $d$-dimensional mean estimation. We provide new algorithms for both the offline (non-adaptive) and adaptive versions of this problem.\n  In the offline setting, the set of queries are fixed before the algorithm starts. In the regime where $n\\lesssim d^2/\\log(J"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02810","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":"1810.02810","created_at":"2026-05-18T00:04:00.578978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02810v1","created_at":"2026-05-18T00:04:00.578978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02810","created_at":"2026-05-18T00:04:00.578978+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKQGAIXMNA5N","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKQGAIXMNA5NJVJE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKQGAIXM","created_at":"2026-05-18T12:32:13.499390+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/AKQGAIXMNA5NJVJEYNY25GUBV6","json":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6.json","graph_json":"https://pith.science/api/pith-number/AKQGAIXMNA5NJVJEYNY25GUBV6/graph.json","events_json":"https://pith.science/api/pith-number/AKQGAIXMNA5NJVJEYNY25GUBV6/events.json","paper":"https://pith.science/paper/AKQGAIXM"},"agent_actions":{"view_html":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6","download_json":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6.json","view_paper":"https://pith.science/paper/AKQGAIXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02810&json=true","fetch_graph":"https://pith.science/api/pith-number/AKQGAIXMNA5NJVJEYNY25GUBV6/graph.json","fetch_events":"https://pith.science/api/pith-number/AKQGAIXMNA5NJVJEYNY25GUBV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6/action/storage_attestation","attest_author":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6/action/author_attestation","sign_citation":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6/action/citation_signature","submit_replication":"https://pith.science/pith/AKQGAIXMNA5NJVJEYNY25GUBV6/action/replication_record"}},"created_at":"2026-05-18T00:04:00.578978+00:00","updated_at":"2026-05-18T00:04:00.578978+00:00"}