{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:H6Z74G3REVTOLIHIHQP7CP246T","short_pith_number":"pith:H6Z74G3R","canonical_record":{"source":{"id":"2202.05453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T05:18:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9a78ab612e5876d276bd69eed311da4b4fd94114dd37221089a31152ae8126e","abstract_canon_sha256":"d5f1d44dbf0e496aa8a08e5629623c594c070fc0cc041b53932a238f40f64258"},"schema_version":"1.0"},"canonical_sha256":"3fb3fe1b712566e5a0e83c1ff13f5cf4d93817f20fc4e262e098dae52229c851","source":{"kind":"arxiv","id":"2202.05453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05453","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05453v1","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05453","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"H6Z74G3REVTO","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_16","alias_value":"H6Z74G3REVTOLIHI","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_8","alias_value":"H6Z74G3R","created_at":"2026-07-05T03:56:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:H6Z74G3REVTOLIHIHQP7CP246T","target":"record","payload":{"canonical_record":{"source":{"id":"2202.05453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T05:18:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a9a78ab612e5876d276bd69eed311da4b4fd94114dd37221089a31152ae8126e","abstract_canon_sha256":"d5f1d44dbf0e496aa8a08e5629623c594c070fc0cc041b53932a238f40f64258"},"schema_version":"1.0"},"canonical_sha256":"3fb3fe1b712566e5a0e83c1ff13f5cf4d93817f20fc4e262e098dae52229c851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:08.353919Z","signature_b64":"pU3rNQKkkkQ/2q7PCUGQQalpwic4vm6L9kfQxxjeBVxITKeqXlCa9s7ymuCrNzYTsu+h3x0H1yUjK2bpQEADCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb3fe1b712566e5a0e83c1ff13f5cf4d93817f20fc4e262e098dae52229c851","last_reissued_at":"2026-07-05T03:56:08.353449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:08.353449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.05453","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-07-05T03:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U60+/KEcurBGWu6yzvyS23j5OqgAQwqvptV9fCPTK6d2o+aM6TP5OxE6UiGisDC5P4rV8BfNfl5utkiTcD9HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:01:44.684073Z"},"content_sha256":"f24c0dc6d091bef69a0a3d0546bdd5ddd0db6d027324c8d15a6fc31fb8f8197e","schema_version":"1.0","event_id":"sha256:f24c0dc6d091bef69a0a3d0546bdd5ddd0db6d027324c8d15a6fc31fb8f8197e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:H6Z74G3REVTOLIHIHQP7CP246T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust estimation algorithms don't need to know the corruption level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alon Orlitsky, Ayush Jain, Vaishakh Ravindrakumar","submitted_at":"2022-02-11T05:18:28Z","abstract_excerpt":"Real data are rarely pure. Hence the past half-century has seen great interest in robust estimation algorithms that perform well even when part of the data is corrupt. However, their vast majority approach optimal accuracy only when given a tight upper bound on the fraction of corrupt data. Such bounds are not available in practice, resulting in weak guarantees and often poor performance. This brief note abstracts the complex and pervasive robustness problem into a simple geometric puzzle. It then applies the puzzle's solution to derive a universal meta technique that converts any robust estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.05453/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-05T03:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4qmWtw+/I+wNo/eig1ZdPGU6YGuVLMcknhCbCBX6Ak5NP/atYlcrvBF5mLUMPS2NiuvNYXsuJRfQ+AyWMKzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:01:44.684576Z"},"content_sha256":"18b1f06afd2b7d98165e2f0df44b3c598faeef092e949e25f66356c0c53e398c","schema_version":"1.0","event_id":"sha256:18b1f06afd2b7d98165e2f0df44b3c598faeef092e949e25f66356c0c53e398c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6Z74G3REVTOLIHIHQP7CP246T/bundle.json","state_url":"https://pith.science/pith/H6Z74G3REVTOLIHIHQP7CP246T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6Z74G3REVTOLIHIHQP7CP246T/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-08T21:01:44Z","links":{"resolver":"https://pith.science/pith/H6Z74G3REVTOLIHIHQP7CP246T","bundle":"https://pith.science/pith/H6Z74G3REVTOLIHIHQP7CP246T/bundle.json","state":"https://pith.science/pith/H6Z74G3REVTOLIHIHQP7CP246T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6Z74G3REVTOLIHIHQP7CP246T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:H6Z74G3REVTOLIHIHQP7CP246T","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":"d5f1d44dbf0e496aa8a08e5629623c594c070fc0cc041b53932a238f40f64258","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T05:18:28Z","title_canon_sha256":"a9a78ab612e5876d276bd69eed311da4b4fd94114dd37221089a31152ae8126e"},"schema_version":"1.0","source":{"id":"2202.05453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.05453","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"2202.05453v1","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05453","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"H6Z74G3REVTO","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_16","alias_value":"H6Z74G3REVTOLIHI","created_at":"2026-07-05T03:56:08Z"},{"alias_kind":"pith_short_8","alias_value":"H6Z74G3R","created_at":"2026-07-05T03:56:08Z"}],"graph_snapshots":[{"event_id":"sha256:18b1f06afd2b7d98165e2f0df44b3c598faeef092e949e25f66356c0c53e398c","target":"graph","created_at":"2026-07-05T03:56:08Z","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/2202.05453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real data are rarely pure. Hence the past half-century has seen great interest in robust estimation algorithms that perform well even when part of the data is corrupt. However, their vast majority approach optimal accuracy only when given a tight upper bound on the fraction of corrupt data. Such bounds are not available in practice, resulting in weak guarantees and often poor performance. This brief note abstracts the complex and pervasive robustness problem into a simple geometric puzzle. It then applies the puzzle's solution to derive a universal meta technique that converts any robust estim","authors_text":"Alon Orlitsky, Ayush Jain, Vaishakh Ravindrakumar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T05:18:28Z","title":"Robust estimation algorithms don't need to know the corruption level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05453","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:f24c0dc6d091bef69a0a3d0546bdd5ddd0db6d027324c8d15a6fc31fb8f8197e","target":"record","created_at":"2026-07-05T03:56:08Z","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":"d5f1d44dbf0e496aa8a08e5629623c594c070fc0cc041b53932a238f40f64258","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-11T05:18:28Z","title_canon_sha256":"a9a78ab612e5876d276bd69eed311da4b4fd94114dd37221089a31152ae8126e"},"schema_version":"1.0","source":{"id":"2202.05453","kind":"arxiv","version":1}},"canonical_sha256":"3fb3fe1b712566e5a0e83c1ff13f5cf4d93817f20fc4e262e098dae52229c851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb3fe1b712566e5a0e83c1ff13f5cf4d93817f20fc4e262e098dae52229c851","first_computed_at":"2026-07-05T03:56:08.353449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:08.353449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pU3rNQKkkkQ/2q7PCUGQQalpwic4vm6L9kfQxxjeBVxITKeqXlCa9s7ymuCrNzYTsu+h3x0H1yUjK2bpQEADCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:08.353919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.05453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24c0dc6d091bef69a0a3d0546bdd5ddd0db6d027324c8d15a6fc31fb8f8197e","sha256:18b1f06afd2b7d98165e2f0df44b3c598faeef092e949e25f66356c0c53e398c"],"state_sha256":"9150765505ea2e945b4347230da73ffcb187917d2403a413c41e053363089923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4e1BQuZlkBZoqFjvPUjr9zYD3o28j/I10jCBuMacUMAZHxVWOH1FWh/ixy1IiK4+tnUSW7JYwinmDEgI3mXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:01:44.689358Z","bundle_sha256":"6da1cec3e8d8fe599ec1271b7983427c943cc98d041ff9f23c644bcce0f7ec42"}}