{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:56HIB27KDXZNP7DS5PS7RPMIQW","short_pith_number":"pith:56HIB27K","canonical_record":{"source":{"id":"1703.00893","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T18:50:33Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"6d6de889182b3be2b69ad5e93f9e1f8864b7acfedad1328543f004fa3b334f43","abstract_canon_sha256":"7be46a81f20d91f9e4ab0edb65eb0caa906804586149e6058f6ace74ffac0ba5"},"schema_version":"1.0"},"canonical_sha256":"ef8e80ebea1df2d7fc72ebe5f8bd8885acfbf66ebd9713622280616ba4eaa456","source":{"kind":"arxiv","id":"1703.00893","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00893","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00893v4","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00893","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"56HIB27KDXZN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"56HIB27KDXZNP7DS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"56HIB27K","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:56HIB27KDXZNP7DS5PS7RPMIQW","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00893","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T18:50:33Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"6d6de889182b3be2b69ad5e93f9e1f8864b7acfedad1328543f004fa3b334f43","abstract_canon_sha256":"7be46a81f20d91f9e4ab0edb65eb0caa906804586149e6058f6ace74ffac0ba5"},"schema_version":"1.0"},"canonical_sha256":"ef8e80ebea1df2d7fc72ebe5f8bd8885acfbf66ebd9713622280616ba4eaa456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:28.735142Z","signature_b64":"MMAkDYfOAq2F4Dy3CAMJsV3TCwwIcyw0jUWlEZw60u6i7lXcnK15UXE/B8Xp4wioRVhEMqarW8DrK5VQjgP0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef8e80ebea1df2d7fc72ebe5f8bd8885acfbf66ebd9713622280616ba4eaa456","last_reissued_at":"2026-05-18T00:21:28.734457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:28.734457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00893","source_version":4,"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-18T00:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K70F7Yip7wQRFDmxYeYYEhWD4wwcy4BCZyWrcN3OWp3/LDEx7lZ1oysBN6EoaNOGMR7wxzLzfdgQmyW7ud1uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:45:38.480790Z"},"content_sha256":"68cf9910d2ec1b453096d8b98af08cd5780668d3dd478423d691bd300f31fe22","schema_version":"1.0","event_id":"sha256:68cf9910d2ec1b453096d8b98af08cd5780668d3dd478423d691bd300f31fe22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:56HIB27KDXZNP7DS5PS7RPMIQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Being Robust (in High Dimensions) Can Be Practical","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Ankur Moitra, Daniel M. Kane, Gautam Kamath, Ilias Diakonikolas, Jerry Li","submitted_at":"2017-03-02T18:50:33Z","abstract_excerpt":"Robust estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in theoretical computer science has shown that, in appropriate distributional models, it is possible to robustly estimate the mean and covariance with polynomial time algorithms that can tolerate a constant fraction of corruptions, independent of the dimension. However, the sample and time complexity of these algorithms is prohibitively large for high-dimensional ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00893","kind":"arxiv","version":4},"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-18T00:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuEfIKpUQNernGKrTfdfOgVD5ivfHUXwwTNltcoO29HqU23d/Qb9BSmf0uTr5pudJqrCrMvxAa6aBkv8Ss+IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:45:38.481551Z"},"content_sha256":"6145baf958990442b49f5b1a484510f1d12f2676846fc47d8a92884f682898e8","schema_version":"1.0","event_id":"sha256:6145baf958990442b49f5b1a484510f1d12f2676846fc47d8a92884f682898e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56HIB27KDXZNP7DS5PS7RPMIQW/bundle.json","state_url":"https://pith.science/pith/56HIB27KDXZNP7DS5PS7RPMIQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56HIB27KDXZNP7DS5PS7RPMIQW/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:45:38Z","links":{"resolver":"https://pith.science/pith/56HIB27KDXZNP7DS5PS7RPMIQW","bundle":"https://pith.science/pith/56HIB27KDXZNP7DS5PS7RPMIQW/bundle.json","state":"https://pith.science/pith/56HIB27KDXZNP7DS5PS7RPMIQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56HIB27KDXZNP7DS5PS7RPMIQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:56HIB27KDXZNP7DS5PS7RPMIQW","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":"7be46a81f20d91f9e4ab0edb65eb0caa906804586149e6058f6ace74ffac0ba5","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T18:50:33Z","title_canon_sha256":"6d6de889182b3be2b69ad5e93f9e1f8864b7acfedad1328543f004fa3b334f43"},"schema_version":"1.0","source":{"id":"1703.00893","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00893","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00893v4","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00893","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"56HIB27KDXZN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"56HIB27KDXZNP7DS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"56HIB27K","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:6145baf958990442b49f5b1a484510f1d12f2676846fc47d8a92884f682898e8","target":"graph","created_at":"2026-05-18T00:21:28Z","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 estimation is much more challenging in high dimensions than it is in one dimension: Most techniques either lead to intractable optimization problems or estimators that can tolerate only a tiny fraction of errors. Recent work in theoretical computer science has shown that, in appropriate distributional models, it is possible to robustly estimate the mean and covariance with polynomial time algorithms that can tolerate a constant fraction of corruptions, independent of the dimension. However, the sample and time complexity of these algorithms is prohibitively large for high-dimensional ap","authors_text":"Alistair Stewart, Ankur Moitra, Daniel M. Kane, Gautam Kamath, Ilias Diakonikolas, Jerry Li","cross_cats":["cs.DS","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T18:50:33Z","title":"Being Robust (in High Dimensions) Can Be Practical"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00893","kind":"arxiv","version":4},"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:68cf9910d2ec1b453096d8b98af08cd5780668d3dd478423d691bd300f31fe22","target":"record","created_at":"2026-05-18T00:21:28Z","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":"7be46a81f20d91f9e4ab0edb65eb0caa906804586149e6058f6ace74ffac0ba5","cross_cats_sorted":["cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-02T18:50:33Z","title_canon_sha256":"6d6de889182b3be2b69ad5e93f9e1f8864b7acfedad1328543f004fa3b334f43"},"schema_version":"1.0","source":{"id":"1703.00893","kind":"arxiv","version":4}},"canonical_sha256":"ef8e80ebea1df2d7fc72ebe5f8bd8885acfbf66ebd9713622280616ba4eaa456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef8e80ebea1df2d7fc72ebe5f8bd8885acfbf66ebd9713622280616ba4eaa456","first_computed_at":"2026-05-18T00:21:28.734457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:28.734457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMAkDYfOAq2F4Dy3CAMJsV3TCwwIcyw0jUWlEZw60u6i7lXcnK15UXE/B8Xp4wioRVhEMqarW8DrK5VQjgP0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:28.735142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00893","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68cf9910d2ec1b453096d8b98af08cd5780668d3dd478423d691bd300f31fe22","sha256:6145baf958990442b49f5b1a484510f1d12f2676846fc47d8a92884f682898e8"],"state_sha256":"00d3351bc582f0f66bf34c0f4f8b9d4c069ef2fa6df16dcea8ed9fae773542b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJoQulashJTnt4MojetE8KTBs6Nygejfc2+3rj18BvCSDoGH7t53tBvBbiOhZ56W9gEcxdmw3rWvnJSQPnI+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:45:38.485272Z","bundle_sha256":"23bb8cfdca2200b9605eba2985c98d155f45f6f699ce7bbc8ed45c52cdcd3ae5"}}