{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SYPLMRZKAVKY54H4SVBWHVXDP7","short_pith_number":"pith:SYPLMRZK","canonical_record":{"source":{"id":"1802.04085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"0778466b4daca07249b55d3b2561f3ab9578c3c6695820af4fa524ad38a23706","abstract_canon_sha256":"e6f50b077b73ebcf26344d551c1014eb8fccfa582d913b35a2a911e84ed7ecb8"},"schema_version":"1.0"},"canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","source":{"kind":"arxiv","id":"1802.04085","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04085","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04085v3","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04085","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"SYPLMRZKAVKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SYPLMRZKAVKY54H4","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SYPLMRZK","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SYPLMRZKAVKY54H4SVBWHVXDP7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.04085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"0778466b4daca07249b55d3b2561f3ab9578c3c6695820af4fa524ad38a23706","abstract_canon_sha256":"e6f50b077b73ebcf26344d551c1014eb8fccfa582d913b35a2a911e84ed7ecb8"},"schema_version":"1.0"},"canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.593055Z","signature_b64":"dayZF+Z788/ugIWHxVne6DKNfrzq6HjeUrrN/BNE9lN0ZCIZUOgbgD3n/kPYHhnNnSa0rNruHgZIdjXbgITKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","last_reissued_at":"2026-05-18T00:15:46.592528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.592528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.04085","source_version":3,"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:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTvucTeWzxXD9PNLaJuFMC+aCgh3dzsN4zo/RTzIW30/Duw424/0lyd/Rd7eKWTu/Nc1picQsyCcx/rminr5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:43:07.098052Z"},"content_sha256":"6b5e1f0d857e88ad380565073c8dd93d402296bdd4e95b1f1d6df9bbf5b59220","schema_version":"1.0","event_id":"sha256:6b5e1f0d857e88ad380565073c8dd93d402296bdd4e95b1f1d6df9bbf5b59220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SYPLMRZKAVKY54H4SVBWHVXDP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical Risk Minimization in Non-interactive Local Differential Privacy: Efficiency and High Dimensional Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Di Wang, Jinhui Xu, Marco Gaboardi","submitted_at":"2018-02-12T14:52:24Z","abstract_excerpt":"In this paper, we study the Empirical Risk Minimization problem in the non-interactive local model of differential privacy. In the case of constant or low dimensionality ($p\\ll n$), we first show that if the ERM loss function is $(\\infty, T)$-smooth, then we can avoid a dependence of the sample complexity, to achieve error $\\alpha$, on the exponential of the dimensionality $p$ with base $1/\\alpha$ (i.e., $\\alpha^{-p}$), which answers a question in [smith 2017 interaction]. Our approach is based on polynomial approximation. Then, we propose player-efficient algorithms with $1$-bit communication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04085","kind":"arxiv","version":3},"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:15:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjEdwHK7bMdOc2JZpwBBZNmEgmI3U8nALWJiDyjgRNLifwB8M843Y/+QRnE2doKUKPufkXAdziXGNtnC7WKlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:43:07.098421Z"},"content_sha256":"2024e35c38dae62389052ffcda6107af8a7228dc4d7ac3dc1b7ae4860165731e","schema_version":"1.0","event_id":"sha256:2024e35c38dae62389052ffcda6107af8a7228dc4d7ac3dc1b7ae4860165731e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/bundle.json","state_url":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/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-28T14:43:07Z","links":{"resolver":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7","bundle":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/bundle.json","state":"https://pith.science/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYPLMRZKAVKY54H4SVBWHVXDP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SYPLMRZKAVKY54H4SVBWHVXDP7","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":"e6f50b077b73ebcf26344d551c1014eb8fccfa582d913b35a2a911e84ed7ecb8","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","title_canon_sha256":"0778466b4daca07249b55d3b2561f3ab9578c3c6695820af4fa524ad38a23706"},"schema_version":"1.0","source":{"id":"1802.04085","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04085","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04085v3","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04085","created_at":"2026-05-18T00:15:46Z"},{"alias_kind":"pith_short_12","alias_value":"SYPLMRZKAVKY","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SYPLMRZKAVKY54H4","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SYPLMRZK","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:2024e35c38dae62389052ffcda6107af8a7228dc4d7ac3dc1b7ae4860165731e","target":"graph","created_at":"2026-05-18T00:15:46Z","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":"In this paper, we study the Empirical Risk Minimization problem in the non-interactive local model of differential privacy. In the case of constant or low dimensionality ($p\\ll n$), we first show that if the ERM loss function is $(\\infty, T)$-smooth, then we can avoid a dependence of the sample complexity, to achieve error $\\alpha$, on the exponential of the dimensionality $p$ with base $1/\\alpha$ (i.e., $\\alpha^{-p}$), which answers a question in [smith 2017 interaction]. Our approach is based on polynomial approximation. Then, we propose player-efficient algorithms with $1$-bit communication","authors_text":"Di Wang, Jinhui Xu, Marco Gaboardi","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","title":"Empirical Risk Minimization in Non-interactive Local Differential Privacy: Efficiency and High Dimensional Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04085","kind":"arxiv","version":3},"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:6b5e1f0d857e88ad380565073c8dd93d402296bdd4e95b1f1d6df9bbf5b59220","target":"record","created_at":"2026-05-18T00:15:46Z","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":"e6f50b077b73ebcf26344d551c1014eb8fccfa582d913b35a2a911e84ed7ecb8","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-12T14:52:24Z","title_canon_sha256":"0778466b4daca07249b55d3b2561f3ab9578c3c6695820af4fa524ad38a23706"},"schema_version":"1.0","source":{"id":"1802.04085","kind":"arxiv","version":3}},"canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"961eb6472a05558ef0fc954363d6e37fe9d9ad61f42954a945ae68fd9c852fc9","first_computed_at":"2026-05-18T00:15:46.592528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:46.592528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dayZF+Z788/ugIWHxVne6DKNfrzq6HjeUrrN/BNE9lN0ZCIZUOgbgD3n/kPYHhnNnSa0rNruHgZIdjXbgITKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:46.593055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04085","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b5e1f0d857e88ad380565073c8dd93d402296bdd4e95b1f1d6df9bbf5b59220","sha256:2024e35c38dae62389052ffcda6107af8a7228dc4d7ac3dc1b7ae4860165731e"],"state_sha256":"1149aa851d34a76be05a6774c9e1b3ab4df87881ab75b0f85004db761cbac4de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLSD2cOdMoV1eTB+5PtYbcz0a9JGmV/uJu4VpUAd0D7vRGfniGqOxhwz3c8YQHg2bcZvapg6uQgbeVOsNw8+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:43:07.100425Z","bundle_sha256":"554e67c0bc59ea83650426f11689717b1ec461703eaae3dd362985ef2b2db862"}}