{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VKMUCYQWSA4IS3ML6AOT3TKVCY","short_pith_number":"pith:VKMUCYQW","schema_version":"1.0","canonical_sha256":"aa994162169038896d8bf01d3dcd551616b7121eb05c1a05c6248289be99a8b8","source":{"kind":"arxiv","id":"1902.10731","version":1},"attestation_state":"computed","paper":{"title":"Private Center Points and Learning of Halfspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Beimel, Kobbi Nissim, Shay Moran, Uri Stemmer","submitted_at":"2019-02-27T19:06:12Z","abstract_excerpt":"We present a private learner for halfspaces over an arbitrary finite domain $X\\subset \\mathbb{R}^d$ with sample complexity $mathrm{poly}(d,2^{\\log^*|X|})$. The building block for this learner is a differentially private algorithm for locating an approximate center point of $m>\\mathrm{poly}(d,2^{\\log^*|X|})$ points -- a high dimensional generalization of the median function. Our construction establishes a relationship between these two problems that is reminiscent of the relation between the median and learning one-dimensional thresholds [Bun et al.\\ FOCS '15]. This relationship suggests that t"},"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":"1902.10731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T19:06:12Z","cross_cats_sorted":["cs.AI","cs.CG","cs.CR","stat.ML"],"title_canon_sha256":"680b7abd98e77976f0c001d5d0a1488fe055a62bfc0e034d670922e7376dcfcd","abstract_canon_sha256":"e4d1cede82ed90687e70088a391a76d8cd0efac5fcd126dc2a0570d7944b4e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.867267Z","signature_b64":"yvbEbc4zahabJDLhaS3kc1hz9HxQSc434fwjUEPEOKj32Vhlm2xXMP7J0WUHcxjrJT/r8wCexZouRpIZ9LgXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa994162169038896d8bf01d3dcd551616b7121eb05c1a05c6248289be99a8b8","last_reissued_at":"2026-05-17T23:52:29.866680Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.866680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Center Points and Learning of Halfspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CG","cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amos Beimel, Kobbi Nissim, Shay Moran, Uri Stemmer","submitted_at":"2019-02-27T19:06:12Z","abstract_excerpt":"We present a private learner for halfspaces over an arbitrary finite domain $X\\subset \\mathbb{R}^d$ with sample complexity $mathrm{poly}(d,2^{\\log^*|X|})$. The building block for this learner is a differentially private algorithm for locating an approximate center point of $m>\\mathrm{poly}(d,2^{\\log^*|X|})$ points -- a high dimensional generalization of the median function. Our construction establishes a relationship between these two problems that is reminiscent of the relation between the median and learning one-dimensional thresholds [Bun et al.\\ FOCS '15]. This relationship suggests that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10731","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":"1902.10731","created_at":"2026-05-17T23:52:29.866761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10731v1","created_at":"2026-05-17T23:52:29.866761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10731","created_at":"2026-05-17T23:52:29.866761+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKMUCYQWSA4I","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKMUCYQWSA4IS3ML","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKMUCYQW","created_at":"2026-05-18T12:33:30.264802+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/VKMUCYQWSA4IS3ML6AOT3TKVCY","json":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY.json","graph_json":"https://pith.science/api/pith-number/VKMUCYQWSA4IS3ML6AOT3TKVCY/graph.json","events_json":"https://pith.science/api/pith-number/VKMUCYQWSA4IS3ML6AOT3TKVCY/events.json","paper":"https://pith.science/paper/VKMUCYQW"},"agent_actions":{"view_html":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY","download_json":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY.json","view_paper":"https://pith.science/paper/VKMUCYQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10731&json=true","fetch_graph":"https://pith.science/api/pith-number/VKMUCYQWSA4IS3ML6AOT3TKVCY/graph.json","fetch_events":"https://pith.science/api/pith-number/VKMUCYQWSA4IS3ML6AOT3TKVCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY/action/storage_attestation","attest_author":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY/action/author_attestation","sign_citation":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY/action/citation_signature","submit_replication":"https://pith.science/pith/VKMUCYQWSA4IS3ML6AOT3TKVCY/action/replication_record"}},"created_at":"2026-05-17T23:52:29.866761+00:00","updated_at":"2026-05-17T23:52:29.866761+00:00"}