{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GPD5X5MJOQQLYGZGDFMRE4NX2T","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":"b0731e5cf68a8046f3beb66a840f22189c1ba847ba6cd79d1dfcbcd009000ee9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-31T17:08:12Z","title_canon_sha256":"88e2dd3c9a33812ae70add421ccf42842a33fbf7cc89f6361b271ecab91ebace"},"schema_version":"1.0","source":{"id":"2503.24321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.24321","created_at":"2026-07-05T10:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"2503.24321v1","created_at":"2026-07-05T10:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.24321","created_at":"2026-07-05T10:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"GPD5X5MJOQQL","created_at":"2026-07-05T10:42:08Z"},{"alias_kind":"pith_short_16","alias_value":"GPD5X5MJOQQLYGZG","created_at":"2026-07-05T10:42:08Z"},{"alias_kind":"pith_short_8","alias_value":"GPD5X5MJ","created_at":"2026-07-05T10:42:08Z"}],"graph_snapshots":[{"event_id":"sha256:17eac5f699407c43b1183d0e94aa65597a85da1d8b59b52c972cdee01ab43418","target":"graph","created_at":"2026-07-05T10:42: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.24321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the task of privately obtaining prediction error guarantees in ordinary least-squares regression problems with Gaussian covariates (with unknown covariance structure). We provide the first sample-optimal polynomial time algorithm for this task under both pure and approximate differential privacy. We show that any improvement to the sample complexity of our algorithm would violate either statistical-query or information-theoretic lower bounds. Additionally, our algorithm is robust to a small fraction of arbitrary outliers and achieves optimal error rates as a function of the fractio","authors_text":"Ainesh Bakshi, Mahbod Majid, Prashanti Anderson, Stefan Tiegel","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-31T17:08:12Z","title":"Sample-Optimal Private Regression in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.24321","kind":"arxiv","version":1},"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:7985ff33d9c3bc7dae684a5af50e7ac9e67762038cc119d51ec75b855820854a","target":"record","created_at":"2026-07-05T10:42: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":"b0731e5cf68a8046f3beb66a840f22189c1ba847ba6cd79d1dfcbcd009000ee9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-03-31T17:08:12Z","title_canon_sha256":"88e2dd3c9a33812ae70add421ccf42842a33fbf7cc89f6361b271ecab91ebace"},"schema_version":"1.0","source":{"id":"2503.24321","kind":"arxiv","version":1}},"canonical_sha256":"33c7dbf5897420bc1b2619591271b7d4f17e707f11a82a8f407b6b24ee01301a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33c7dbf5897420bc1b2619591271b7d4f17e707f11a82a8f407b6b24ee01301a","first_computed_at":"2026-07-05T10:42:08.325374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:42:08.325374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZXUSZ7dc6LhOiYQsguOOlaHoQwDve30HZLiMcsR/X5tiOTLKUI/U/6may9RKDkaHEmesNwbU6ehxim4mZ2D3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:42:08.325869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.24321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7985ff33d9c3bc7dae684a5af50e7ac9e67762038cc119d51ec75b855820854a","sha256:17eac5f699407c43b1183d0e94aa65597a85da1d8b59b52c972cdee01ab43418"],"state_sha256":"ee3458024849b1ecac08106081e7cb220829e278c2435b7adf6486f8408358b8"}