{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GDDKMDJBLTNRTS3UJRFB4MAHDL","short_pith_number":"pith:GDDKMDJB","schema_version":"1.0","canonical_sha256":"30c6a60d215cdb19cb744c4a1e30071ac557245cebbbcc36c277b0d995e732f0","source":{"kind":"arxiv","id":"1906.11366","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.11366","created_at":"2026-05-17T23:42:07.359726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11366v1","created_at":"2026-05-17T23:42:07.359726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11366","created_at":"2026-05-17T23:42:07.359726+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDDKMDJBLTNR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDDKMDJBLTNRTS3U","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDDKMDJB","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00927","citing_title":"A Unified Approach to Robust Mean Estimation","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL","json":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL.json","graph_json":"https://pith.science/api/pith-number/GDDKMDJBLTNRTS3UJRFB4MAHDL/graph.json","events_json":"https://pith.science/api/pith-number/GDDKMDJBLTNRTS3UJRFB4MAHDL/events.json","paper":"https://pith.science/paper/GDDKMDJB"},"agent_actions":{"view_html":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL","download_json":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL.json","view_paper":"https://pith.science/paper/GDDKMDJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11366&json=true","fetch_graph":"https://pith.science/api/pith-number/GDDKMDJBLTNRTS3UJRFB4MAHDL/graph.json","fetch_events":"https://pith.science/api/pith-number/GDDKMDJBLTNRTS3UJRFB4MAHDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/action/storage_attestation","attest_author":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/action/author_attestation","sign_citation":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/action/citation_signature","submit_replication":"https://pith.science/pith/GDDKMDJBLTNRTS3UJRFB4MAHDL/action/replication_record"}},"created_at":"2026-05-17T23:42:07.359726+00:00","updated_at":"2026-05-17T23:42:07.359726+00:00"}