{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OPM4KE3TELTCZECMISVNRPRXS6","short_pith_number":"pith:OPM4KE3T","canonical_record":{"source":{"id":"1908.04468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-13T02:56:01Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"cedc306e1c7836f92ce550626fb8641770bfdfd767d86eb34bbcfd843031037b","abstract_canon_sha256":"fb3a17064cf5dc48ecc1a7443e6250fec2eb814701b1496eccc102abd6105c0d"},"schema_version":"1.0"},"canonical_sha256":"73d9c5137322e62c904c44aad8be3797bdd128db3829bb20a5fabf8b7da01472","source":{"kind":"arxiv","id":"1908.04468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04468","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04468v2","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04468","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"OPM4KE3TELTC","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_16","alias_value":"OPM4KE3TELTCZECM","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_8","alias_value":"OPM4KE3T","created_at":"2026-07-05T00:41:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OPM4KE3TELTCZECMISVNRPRXS6","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-13T02:56:01Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"cedc306e1c7836f92ce550626fb8641770bfdfd767d86eb34bbcfd843031037b","abstract_canon_sha256":"fb3a17064cf5dc48ecc1a7443e6250fec2eb814701b1496eccc102abd6105c0d"},"schema_version":"1.0"},"canonical_sha256":"73d9c5137322e62c904c44aad8be3797bdd128db3829bb20a5fabf8b7da01472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:12.782061Z","signature_b64":"IkkhXsH4Z99+Izeq7qpb0yw73gIhqRn0YuFdpxPSCDMd8QTY2IMwJb9HkIpesygvAk9dIr7i2AgVd1094oaVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73d9c5137322e62c904c44aad8be3797bdd128db3829bb20a5fabf8b7da01472","last_reissued_at":"2026-07-05T00:41:12.781714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:12.781714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04468","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-07-05T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50TClMvkGp0lBDP1BtZWCUe9PkwrqwhBP8lrATnqfU6w5E0nNYfRbpZghy3Sb2PslaQJWoDDNBJzSqaWfQETDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:16:33.283097Z"},"content_sha256":"b9f05c1c664a8b8878719ab636847f2fde09988c271d35d7ff02c8c7e640e6d2","schema_version":"1.0","event_id":"sha256:b9f05c1c664a8b8878719ab636847f2fde09988c271d35d7ff02c8c7e640e6d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OPM4KE3TELTCZECMISVNRPRXS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Fred Zhang, Kyle Luh, Prayaag Venkat, Zhixian Lei","submitted_at":"2019-08-13T02:56:01Z","abstract_excerpt":"We study the algorithmic problem of estimating the mean of heavy-tailed random vector in $\\mathbb{R}^d$, given $n$ i.i.d. samples. The goal is to design an efficient estimator that attains the optimal sub-gaussian error bound, only assuming that the random vector has bounded mean and covariance. Polynomial-time solutions to this problem are known but have high runtime due to their use of semi-definite programming (SDP). Conceptually, it remains open whether convex relaxation is truly necessary for this problem.\n  In this work, we show that it is possible to go beyond SDP and achieve better com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04468","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04468/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:41:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qd95hM/4mHM4S1Zr/SJa4yjnfLMf85mXSFuuE8tNHieCgCA4OXQK3NSZmU5DT+Awa7xpaUaIPhHyLDswO2sJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:16:33.283636Z"},"content_sha256":"2324d7322a579bd10192647adbb12a2e4a6e557b96d727f454c30ae6fd2b25e0","schema_version":"1.0","event_id":"sha256:2324d7322a579bd10192647adbb12a2e4a6e557b96d727f454c30ae6fd2b25e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPM4KE3TELTCZECMISVNRPRXS6/bundle.json","state_url":"https://pith.science/pith/OPM4KE3TELTCZECMISVNRPRXS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPM4KE3TELTCZECMISVNRPRXS6/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-08-16T11:16:33Z","links":{"resolver":"https://pith.science/pith/OPM4KE3TELTCZECMISVNRPRXS6","bundle":"https://pith.science/pith/OPM4KE3TELTCZECMISVNRPRXS6/bundle.json","state":"https://pith.science/pith/OPM4KE3TELTCZECMISVNRPRXS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPM4KE3TELTCZECMISVNRPRXS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OPM4KE3TELTCZECMISVNRPRXS6","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":"fb3a17064cf5dc48ecc1a7443e6250fec2eb814701b1496eccc102abd6105c0d","cross_cats_sorted":["cs.DS","cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-13T02:56:01Z","title_canon_sha256":"cedc306e1c7836f92ce550626fb8641770bfdfd767d86eb34bbcfd843031037b"},"schema_version":"1.0","source":{"id":"1908.04468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04468","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04468v2","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04468","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_12","alias_value":"OPM4KE3TELTC","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_16","alias_value":"OPM4KE3TELTCZECM","created_at":"2026-07-05T00:41:12Z"},{"alias_kind":"pith_short_8","alias_value":"OPM4KE3T","created_at":"2026-07-05T00:41:12Z"}],"graph_snapshots":[{"event_id":"sha256:2324d7322a579bd10192647adbb12a2e4a6e557b96d727f454c30ae6fd2b25e0","target":"graph","created_at":"2026-07-05T00:41:12Z","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/1908.04468/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the algorithmic problem of estimating the mean of heavy-tailed random vector in $\\mathbb{R}^d$, given $n$ i.i.d. samples. The goal is to design an efficient estimator that attains the optimal sub-gaussian error bound, only assuming that the random vector has bounded mean and covariance. Polynomial-time solutions to this problem are known but have high runtime due to their use of semi-definite programming (SDP). Conceptually, it remains open whether convex relaxation is truly necessary for this problem.\n  In this work, we show that it is possible to go beyond SDP and achieve better com","authors_text":"Fred Zhang, Kyle Luh, Prayaag Venkat, Zhixian Lei","cross_cats":["cs.DS","cs.LG","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-13T02:56:01Z","title":"A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04468","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:b9f05c1c664a8b8878719ab636847f2fde09988c271d35d7ff02c8c7e640e6d2","target":"record","created_at":"2026-07-05T00:41:12Z","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":"fb3a17064cf5dc48ecc1a7443e6250fec2eb814701b1496eccc102abd6105c0d","cross_cats_sorted":["cs.DS","cs.LG","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-13T02:56:01Z","title_canon_sha256":"cedc306e1c7836f92ce550626fb8641770bfdfd767d86eb34bbcfd843031037b"},"schema_version":"1.0","source":{"id":"1908.04468","kind":"arxiv","version":2}},"canonical_sha256":"73d9c5137322e62c904c44aad8be3797bdd128db3829bb20a5fabf8b7da01472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73d9c5137322e62c904c44aad8be3797bdd128db3829bb20a5fabf8b7da01472","first_computed_at":"2026-07-05T00:41:12.781714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:41:12.781714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IkkhXsH4Z99+Izeq7qpb0yw73gIhqRn0YuFdpxPSCDMd8QTY2IMwJb9HkIpesygvAk9dIr7i2AgVd1094oaVDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:41:12.782061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9f05c1c664a8b8878719ab636847f2fde09988c271d35d7ff02c8c7e640e6d2","sha256:2324d7322a579bd10192647adbb12a2e4a6e557b96d727f454c30ae6fd2b25e0"],"state_sha256":"afed26ac92cc49c79c54bc0d1321d5e0b82888bccb9762fce88d328a26a4e3f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1uPCjBJEzL5pQnMdwTLAT8IpNXcb/geJsb0Eg9kUWD52zzGr1m3Ez4sIAI5Mt/Ik9may3oU3bDwc+vY3t92Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:16:33.287794Z","bundle_sha256":"3afd6c279c876271e8fda1a35af15f74aba40bc72b4c55b7ba25cbc140996d1b"}}