{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GDDKMDJBLTNRTS3UJRFB4MAHDL","short_pith_number":"pith:GDDKMDJB","canonical_record":{"source":{"id":"1906.11366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T22:23:14Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"39ccb65865a7734a55f4eb788fac38f0aa02158afdbb192c25ab86e93f398e9e","abstract_canon_sha256":"20e37f761c9eee519c61fd66762bcc1fe2e057ee0ff00b100528d60f05de08a7"},"schema_version":"1.0"},"canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","source":{"kind":"arxiv","id":"1906.11366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11366","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11366v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11366","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"GDDKMDJBLTNR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GDDKMDJBLTNRTS3U","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GDDKMDJB","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GDDKMDJBLTNRTS3UJRFB4MAHDL","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T22:23:14Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"39ccb65865a7734a55f4eb788fac38f0aa02158afdbb192c25ab86e93f398e9e","abstract_canon_sha256":"20e37f761c9eee519c61fd66762bcc1fe2e057ee0ff00b100528d60f05de08a7"},"schema_version":"1.0"},"canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.360310Z","signature_b64":"nBrzPO8JDSEu+7cZA8qjeBLh3sy2kY4rkPBB3EVKAlEYy+2Y3/a0UW2OBDLMmgIq1QifnU8Lo/EndEYaTrJNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","last_reissued_at":"2026-05-17T23:42:07.359601Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.359601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11366","source_version":1,"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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"havPKcPh77GZkaBw1B1vR+BMOj9ujEtByi6GO6XaXPNcFdhBxt/sLuKXsKAeDU3ml4Su8ypwSapGK7DqKbJwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:56.977755Z"},"content_sha256":"f044e3cf62771f4e7fb3ba0cf99a4b3572fbead879a993dbaa489b0546d76e56","schema_version":"1.0","event_id":"sha256:f044e3cf62771f4e7fb3ba0cf99a4b3572fbead879a993dbaa489b0546d76e56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GDDKMDJBLTNRTS3UJRFB4MAHDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Jerry Li, Samuel B. Hopkins, Yihe Dong","submitted_at":"2019-06-26T22:23:14Z","abstract_excerpt":"We study two problems in high-dimensional robust statistics: \\emph{robust mean estimation} and \\emph{outlier detection}. In robust mean estimation the goal is to estimate the mean $\\mu$ of a distribution on $\\mathbb{R}^d$ given $n$ independent samples, an $\\varepsilon$-fraction of which have been corrupted by a malicious adversary. In outlier detection the goal is to assign an \\emph{outlier score} to each element of a data set such that elements more likely to be outliers are assigned higher scores. Our algorithms for both problems are based on a new outlier scoring method we call QUE-scoring "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11366","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"},"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:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mJHyYXO51WxdEi7UcsxBe0ZnXiWuo0WdbRplIGy/SBq8TYwen6R1Lkt2AC/hFnjT64IQK607Qc5N1EI+QzGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:56.978344Z"},"content_sha256":"040f857a9fdfdb63bffafab5b4bfc41d4f3a05cccf6434b7a5c8205dbb79df74","schema_version":"1.0","event_id":"sha256:040f857a9fdfdb63bffafab5b4bfc41d4f3a05cccf6434b7a5c8205dbb79df74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/bundle.json","state_url":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/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-26T09:48:56Z","links":{"resolver":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL","bundle":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/bundle.json","state":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GDDKMDJBLTNRTS3UJRFB4MAHDL","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":"20e37f761c9eee519c61fd66762bcc1fe2e057ee0ff00b100528d60f05de08a7","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T22:23:14Z","title_canon_sha256":"39ccb65865a7734a55f4eb788fac38f0aa02158afdbb192c25ab86e93f398e9e"},"schema_version":"1.0","source":{"id":"1906.11366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11366","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11366v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11366","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"GDDKMDJBLTNR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GDDKMDJBLTNRTS3U","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GDDKMDJB","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:040f857a9fdfdb63bffafab5b4bfc41d4f3a05cccf6434b7a5c8205dbb79df74","target":"graph","created_at":"2026-05-17T23:42:07Z","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":"We study two problems in high-dimensional robust statistics: \\emph{robust mean estimation} and \\emph{outlier detection}. In robust mean estimation the goal is to estimate the mean $\\mu$ of a distribution on $\\mathbb{R}^d$ given $n$ independent samples, an $\\varepsilon$-fraction of which have been corrupted by a malicious adversary. In outlier detection the goal is to assign an \\emph{outlier score} to each element of a data set such that elements more likely to be outliers are assigned higher scores. Our algorithms for both problems are based on a new outlier scoring method we call QUE-scoring ","authors_text":"Jerry Li, Samuel B. Hopkins, Yihe Dong","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T22:23:14Z","title":"Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11366","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:f044e3cf62771f4e7fb3ba0cf99a4b3572fbead879a993dbaa489b0546d76e56","target":"record","created_at":"2026-05-17T23:42:07Z","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":"20e37f761c9eee519c61fd66762bcc1fe2e057ee0ff00b100528d60f05de08a7","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T22:23:14Z","title_canon_sha256":"39ccb65865a7734a55f4eb788fac38f0aa02158afdbb192c25ab86e93f398e9e"},"schema_version":"1.0","source":{"id":"1906.11366","kind":"arxiv","version":1}},"canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","first_computed_at":"2026-05-17T23:42:07.359601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:07.359601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nBrzPO8JDSEu+7cZA8qjeBLh3sy2kY4rkPBB3EVKAlEYy+2Y3/a0UW2OBDLMmgIq1QifnU8Lo/EndEYaTrJNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:07.360310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f044e3cf62771f4e7fb3ba0cf99a4b3572fbead879a993dbaa489b0546d76e56","sha256:040f857a9fdfdb63bffafab5b4bfc41d4f3a05cccf6434b7a5c8205dbb79df74"],"state_sha256":"0e9557df1195c89fdc9b48f3e734d895e84f315ade3aca3f24fc0e64e43dbfea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZF3ri9kFVfTk3N3WUU4B7gqk6CF4lxe1mY8P/Qj9X2jNDhtwWSaW1z2q2vFaDUT/JEeQH9D6y1zgo74MbZF7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:48:56.981903Z","bundle_sha256":"1a82dfd8520cb6c171708e04ea466b0996bdba852582d77a3782e38a5b5468fb"}}