{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZZ4YEOLRYRYG7S32FISH3UMK2W","short_pith_number":"pith:ZZ4YEOLR","canonical_record":{"source":{"id":"1906.04661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T15:41:44Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"08444e49b72d8bff38b4025168189e4878842362dbbcdbb67621daa7844e68f4","abstract_canon_sha256":"2e97ccf89e94066ea19c8a9ea5c773eec02dc8681e1d5ac465b623d2e8401ee8"},"schema_version":"1.0"},"canonical_sha256":"ce79823971c4706fcb7a2a247dd18ad591c9c25eca2d1bea9738b7fd7050b614","source":{"kind":"arxiv","id":"1906.04661","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04661","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04661v1","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04661","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ4YEOLRYRYG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ4YEOLRYRYG7S32","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ4YEOLR","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZZ4YEOLRYRYG7S32FISH3UMK2W","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T15:41:44Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"08444e49b72d8bff38b4025168189e4878842362dbbcdbb67621daa7844e68f4","abstract_canon_sha256":"2e97ccf89e94066ea19c8a9ea5c773eec02dc8681e1d5ac465b623d2e8401ee8"},"schema_version":"1.0"},"canonical_sha256":"ce79823971c4706fcb7a2a247dd18ad591c9c25eca2d1bea9738b7fd7050b614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.827219Z","signature_b64":"jnUuRnM/PPV6dX1XedTn7OzolwQzMbbzbXgcBzFPQCZYP4G0PaK4JFkyB3N/AWJVrbwZmqY5oDthtgY+g23eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce79823971c4706fcb7a2a247dd18ad591c9c25eca2d1bea9738b7fd7050b614","last_reissued_at":"2026-05-17T23:43:33.826710Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.826710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04661","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFFnGjZg6K0CjjjsFCMnXPhzgrnMLjF7zrWwx0vzdapEKG+xHWQWPZd3UU924l3dmYhMGU9OnKfyYMh8FfogBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:15.761540Z"},"content_sha256":"fc8832b354321729beb5b867e7d730978456c0b4087fa579794fe40890bdac44","schema_version":"1.0","event_id":"sha256:fc8832b354321729beb5b867e7d730978456c0b4087fa579794fe40890bdac44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZZ4YEOLRYRYG7S32FISH3UMK2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Algorithms for High-Dimensional Robust Covariance Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"David Woodruff, Ilias Diakonikolas, Rong Ge, Yu Cheng","submitted_at":"2019-06-11T15:41:44Z","abstract_excerpt":"We study the problem of estimating the covariance matrix of a high-dimensional distribution when a small constant fraction of the samples can be arbitrarily corrupted. Recent work gave the first polynomial time algorithms for this problem with near-optimal error guarantees for several natural structured distributions. Our main contribution is to develop faster algorithms for this problem whose running time nearly matches that of computing the empirical covariance.\n  Given $N = \\tilde{\\Omega}(d^2/\\epsilon^2)$ samples from a $d$-dimensional Gaussian distribution, an $\\epsilon$-fraction of which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04661","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:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aoagBZ2U6bQsyt8Mgo9T5w6cXMxq0MOJsuQnHqz67NVgHtKORHXcjXrAcxkyrayZcjyiVPES8LdgR2d7JU/kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:15.761913Z"},"content_sha256":"d528e761a2a0a78c4e7762a9415d44180c4e71d3ca7ee4543e49ce8e3ff589ca","schema_version":"1.0","event_id":"sha256:d528e761a2a0a78c4e7762a9415d44180c4e71d3ca7ee4543e49ce8e3ff589ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/bundle.json","state_url":"https://pith.science/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/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-06-05T13:39:15Z","links":{"resolver":"https://pith.science/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W","bundle":"https://pith.science/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/bundle.json","state":"https://pith.science/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZ4YEOLRYRYG7S32FISH3UMK2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZZ4YEOLRYRYG7S32FISH3UMK2W","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":"2e97ccf89e94066ea19c8a9ea5c773eec02dc8681e1d5ac465b623d2e8401ee8","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T15:41:44Z","title_canon_sha256":"08444e49b72d8bff38b4025168189e4878842362dbbcdbb67621daa7844e68f4"},"schema_version":"1.0","source":{"id":"1906.04661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04661","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04661v1","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04661","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZZ4YEOLRYRYG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZZ4YEOLRYRYG7S32","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZZ4YEOLR","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d528e761a2a0a78c4e7762a9415d44180c4e71d3ca7ee4543e49ce8e3ff589ca","target":"graph","created_at":"2026-05-17T23:43:33Z","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 the problem of estimating the covariance matrix of a high-dimensional distribution when a small constant fraction of the samples can be arbitrarily corrupted. Recent work gave the first polynomial time algorithms for this problem with near-optimal error guarantees for several natural structured distributions. Our main contribution is to develop faster algorithms for this problem whose running time nearly matches that of computing the empirical covariance.\n  Given $N = \\tilde{\\Omega}(d^2/\\epsilon^2)$ samples from a $d$-dimensional Gaussian distribution, an $\\epsilon$-fraction of which ","authors_text":"David Woodruff, Ilias Diakonikolas, Rong Ge, Yu Cheng","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T15:41:44Z","title":"Faster Algorithms for High-Dimensional Robust Covariance Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04661","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:fc8832b354321729beb5b867e7d730978456c0b4087fa579794fe40890bdac44","target":"record","created_at":"2026-05-17T23:43:33Z","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":"2e97ccf89e94066ea19c8a9ea5c773eec02dc8681e1d5ac465b623d2e8401ee8","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T15:41:44Z","title_canon_sha256":"08444e49b72d8bff38b4025168189e4878842362dbbcdbb67621daa7844e68f4"},"schema_version":"1.0","source":{"id":"1906.04661","kind":"arxiv","version":1}},"canonical_sha256":"ce79823971c4706fcb7a2a247dd18ad591c9c25eca2d1bea9738b7fd7050b614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce79823971c4706fcb7a2a247dd18ad591c9c25eca2d1bea9738b7fd7050b614","first_computed_at":"2026-05-17T23:43:33.826710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.826710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jnUuRnM/PPV6dX1XedTn7OzolwQzMbbzbXgcBzFPQCZYP4G0PaK4JFkyB3N/AWJVrbwZmqY5oDthtgY+g23eCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.827219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8832b354321729beb5b867e7d730978456c0b4087fa579794fe40890bdac44","sha256:d528e761a2a0a78c4e7762a9415d44180c4e71d3ca7ee4543e49ce8e3ff589ca"],"state_sha256":"41dda8ff328b0c253a0c0d5db5271a47654d3a7bccf343b35581d3126c115dd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzg3zOXsBeUP9pfgNo2OAqLNzOoPTKiKVyRwyTz0qgV0+2Fobnx2yojMDnEfqtNrAKBw1PZdFWxdcTzylumYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:39:15.763978Z","bundle_sha256":"d76da8029976fb486425dd65fc8e3da509d4375e6fd85305a8cba7faeae73323"}}