{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EU7ASP2DPE4JVS4EFCZRMDILOY","short_pith_number":"pith:EU7ASP2D","canonical_record":{"source":{"id":"1903.07870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"54a23dde3a10856138fa1f4de773c6e5064fccc85868e2b978718171388c9851","abstract_canon_sha256":"a2586726b7d6389ee5bc36de341461e4e379296e9765a2adb753cc962cb53404"},"schema_version":"1.0"},"canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","source":{"kind":"arxiv","id":"1903.07870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07870","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07870v2","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07870","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"pith_short_12","alias_value":"EU7ASP2DPE4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EU7ASP2DPE4JVS4E","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EU7ASP2D","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EU7ASP2DPE4JVS4EFCZRMDILOY","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"title_canon_sha256":"54a23dde3a10856138fa1f4de773c6e5064fccc85868e2b978718171388c9851","abstract_canon_sha256":"a2586726b7d6389ee5bc36de341461e4e379296e9765a2adb753cc962cb53404"},"schema_version":"1.0"},"canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.460133Z","signature_b64":"/nEM21Rfe8tSRjqW1W0dTC6DMYHK+KusnLK0Tgoa7HlBLbjtg0m+0XlXXPHWinQhTwLk5VX8ynD1AK5/aYRdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","last_reissued_at":"2026-05-17T23:44:21.459591Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.459591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07870","source_version":2,"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-17T23:44:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxJ6/b5kGigRzsx3hLbqvERFTW9m0G81/uWftZNJMLboIFan3gZp7pZuz4OuGNHkAcYMNjeNKwDon/HIIbLGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:03:25.349057Z"},"content_sha256":"8f79ea3f5e00bc9880676ff89829974cc93ca9a3d8d81dca800c4e7540d36b8d","schema_version":"1.0","event_id":"sha256:8f79ea3f5e00bc9880676ff89829974cc93ca9a3d8d81dca800c4e7540d36b8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EU7ASP2DPE4JVS4EFCZRMDILOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Hard Is Robust Mean Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Jerry Li, Samuel B. Hopkins","submitted_at":"2019-03-19T07:48:33Z","abstract_excerpt":"Robust mean estimation is the problem of estimating the mean $\\mu \\in \\mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\\epsilon$-fraction of which have been arbitrarily corrupted by a malicious adversary. Recent algorithmic progress has resulted in the first polynomial-time algorithms which achieve \\emph{dimension-independent} rates of error: for instance, if $D$ has covariance $I$, in polynomial-time one may find $\\hat{\\mu}$ with $\\|\\mu - \\hat{\\mu}\\| \\leq O(\\sqrt{\\epsilon})$. However, error rates achieved by current polynomial-time algorithms, while "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07870","kind":"arxiv","version":2},"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-17T23:44:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"057438SBvG+6TnoxYc8X9qBW6X+S58Ox6UeLYCHr5l6hNun9qFG7v+xI4KGlHIFfFkzKOzEJH2Soio1Ltpl5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:03:25.349724Z"},"content_sha256":"97290da3537a56a617e7bd221d3414086093225a24b86ab5e946d929dab03b15","schema_version":"1.0","event_id":"sha256:97290da3537a56a617e7bd221d3414086093225a24b86ab5e946d929dab03b15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/bundle.json","state_url":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/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-26T07:03:25Z","links":{"resolver":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY","bundle":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/bundle.json","state":"https://pith.science/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EU7ASP2DPE4JVS4EFCZRMDILOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EU7ASP2DPE4JVS4EFCZRMDILOY","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":"a2586726b7d6389ee5bc36de341461e4e379296e9765a2adb753cc962cb53404","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","title_canon_sha256":"54a23dde3a10856138fa1f4de773c6e5064fccc85868e2b978718171388c9851"},"schema_version":"1.0","source":{"id":"1903.07870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07870","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07870v2","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07870","created_at":"2026-05-17T23:44:21Z"},{"alias_kind":"pith_short_12","alias_value":"EU7ASP2DPE4J","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EU7ASP2DPE4JVS4E","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EU7ASP2D","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:97290da3537a56a617e7bd221d3414086093225a24b86ab5e946d929dab03b15","target":"graph","created_at":"2026-05-17T23:44:21Z","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":"Robust mean estimation is the problem of estimating the mean $\\mu \\in \\mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\\epsilon$-fraction of which have been arbitrarily corrupted by a malicious adversary. Recent algorithmic progress has resulted in the first polynomial-time algorithms which achieve \\emph{dimension-independent} rates of error: for instance, if $D$ has covariance $I$, in polynomial-time one may find $\\hat{\\mu}$ with $\\|\\mu - \\hat{\\mu}\\| \\leq O(\\sqrt{\\epsilon})$. However, error rates achieved by current polynomial-time algorithms, while ","authors_text":"Jerry Li, Samuel B. Hopkins","cross_cats":["cs.DS","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","title":"How Hard Is Robust Mean Estimation?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07870","kind":"arxiv","version":2},"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:8f79ea3f5e00bc9880676ff89829974cc93ca9a3d8d81dca800c4e7540d36b8d","target":"record","created_at":"2026-05-17T23:44:21Z","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":"a2586726b7d6389ee5bc36de341461e4e379296e9765a2adb753cc962cb53404","cross_cats_sorted":["cs.DS","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-19T07:48:33Z","title_canon_sha256":"54a23dde3a10856138fa1f4de773c6e5064fccc85868e2b978718171388c9851"},"schema_version":"1.0","source":{"id":"1903.07870","kind":"arxiv","version":2}},"canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"253e093f4379389acb8428b3160d0b763f08ba70c4f940e8ca00b22b0e76ba26","first_computed_at":"2026-05-17T23:44:21.459591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:21.459591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/nEM21Rfe8tSRjqW1W0dTC6DMYHK+KusnLK0Tgoa7HlBLbjtg0m+0XlXXPHWinQhTwLk5VX8ynD1AK5/aYRdAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:21.460133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f79ea3f5e00bc9880676ff89829974cc93ca9a3d8d81dca800c4e7540d36b8d","sha256:97290da3537a56a617e7bd221d3414086093225a24b86ab5e946d929dab03b15"],"state_sha256":"8afa345bb80b6d94f0554a1a71115a2515230b04cdc824a0974e6dfa6dc5feec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FP8r2Gt2G8Rg79bb5TRwc3JIUNMYHiCQN98NBfz/FOV8U6uSAujKDXA9FOVtaX5l0bG7tKQinZgFyUH/bw1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:03:25.353333Z","bundle_sha256":"e9d1f938284fe40f5014fe8dd3966028aa8ddab8a58a117db3d15109822cc713"}}