{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6LNX2FOMZZWUGFOQ3ZL446SC32","short_pith_number":"pith:6LNX2FOM","canonical_record":{"source":{"id":"1803.02815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-07T18:47:48Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"18a5da6d4ce1caa044344a88c12d1b6ea190abfb314c2cc6f9ed591d545463d7","abstract_canon_sha256":"81fea53414042fc7c7cfe90bf3bbc4ae93126064499419a10c031fb750d52d02"},"schema_version":"1.0"},"canonical_sha256":"f2db7d15ccce6d4315d0de57ce7a42debcaa71a4f7b6e588ba57496c140af50a","source":{"kind":"arxiv","id":"1803.02815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02815","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02815v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02815","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"6LNX2FOMZZWU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6LNX2FOMZZWUGFOQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6LNX2FOM","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6LNX2FOMZZWUGFOQ3ZL446SC32","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-07T18:47:48Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"18a5da6d4ce1caa044344a88c12d1b6ea190abfb314c2cc6f9ed591d545463d7","abstract_canon_sha256":"81fea53414042fc7c7cfe90bf3bbc4ae93126064499419a10c031fb750d52d02"},"schema_version":"1.0"},"canonical_sha256":"f2db7d15ccce6d4315d0de57ce7a42debcaa71a4f7b6e588ba57496c140af50a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.403307Z","signature_b64":"l6dvHtqSUhw7ccF63IQ/IocsoQA9ykkbqTzqBa4eNkD/6bNOVolEIOXGa0PZNmdsLRmAPlL4o9T5A+ShMripAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2db7d15ccce6d4315d0de57ce7a42debcaa71a4f7b6e588ba57496c140af50a","last_reissued_at":"2026-05-17T23:44:43.402832Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.402832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02815","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-05-17T23:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56nkFnC7XNY4jSxaUcCVChrv02UOs48flVXSqMPDKS0MTYjxeQjYKBP0+2KQA9h5hkzUW6o4WaLeE3QzjvJuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:04.062955Z"},"content_sha256":"ddd9cafe281e761582e1fa975dc7f21d1d6bc40107a3536e5eaabefdaa747ae7","schema_version":"1.0","event_id":"sha256:ddd9cafe281e761582e1fa975dc7f21d1d6bc40107a3536e5eaabefdaa747ae7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6LNX2FOMZZWUGFOQ3ZL446SC32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sever: A Robust Meta-Algorithm for Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alistair Stewart, Daniel M. Kane, Gautam Kamath, Ilias Diakonikolas, Jacob Steinhardt, Jerry Li","submitted_at":"2018-03-07T18:47:48Z","abstract_excerpt":"In high dimensions, most machine learning methods are brittle to even a small fraction of structured outliers. To address this, we introduce a new meta-algorithm that can take in a base learner such as least squares or stochastic gradient descent, and harden the learner to be resistant to outliers. Our method, Sever, possesses strong theoretical guarantees yet is also highly scalable -- beyond running the base learner itself, it only requires computing the top singular vector of a certain $n \\times d$ matrix. We apply Sever on a drug design dataset and a spam classification dataset, and find t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02815","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":""},"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:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HnnFFk2Jz6b+LkWunmrdj8zOSKzBa1geHQx4u9XaX5xGUqVsBz5j/7Ckpn8qUUrV9RI7uweu2SugQD3IG5zXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:04.063658Z"},"content_sha256":"24f8561404c691101335d9b10f5f2568457831958e8991f3dcc49a6e76c0d86c","schema_version":"1.0","event_id":"sha256:24f8561404c691101335d9b10f5f2568457831958e8991f3dcc49a6e76c0d86c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/bundle.json","state_url":"https://pith.science/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/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-26T16:42:04Z","links":{"resolver":"https://pith.science/pith/6LNX2FOMZZWUGFOQ3ZL446SC32","bundle":"https://pith.science/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/bundle.json","state":"https://pith.science/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LNX2FOMZZWUGFOQ3ZL446SC32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6LNX2FOMZZWUGFOQ3ZL446SC32","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":"81fea53414042fc7c7cfe90bf3bbc4ae93126064499419a10c031fb750d52d02","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-07T18:47:48Z","title_canon_sha256":"18a5da6d4ce1caa044344a88c12d1b6ea190abfb314c2cc6f9ed591d545463d7"},"schema_version":"1.0","source":{"id":"1803.02815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02815","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02815v2","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02815","created_at":"2026-05-17T23:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"6LNX2FOMZZWU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6LNX2FOMZZWUGFOQ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6LNX2FOM","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:24f8561404c691101335d9b10f5f2568457831958e8991f3dcc49a6e76c0d86c","target":"graph","created_at":"2026-05-17T23:44:43Z","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":"In high dimensions, most machine learning methods are brittle to even a small fraction of structured outliers. To address this, we introduce a new meta-algorithm that can take in a base learner such as least squares or stochastic gradient descent, and harden the learner to be resistant to outliers. Our method, Sever, possesses strong theoretical guarantees yet is also highly scalable -- beyond running the base learner itself, it only requires computing the top singular vector of a certain $n \\times d$ matrix. We apply Sever on a drug design dataset and a spam classification dataset, and find t","authors_text":"Alistair Stewart, Daniel M. Kane, Gautam Kamath, Ilias Diakonikolas, Jacob Steinhardt, Jerry Li","cross_cats":["cs.AI","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-07T18:47:48Z","title":"Sever: A Robust Meta-Algorithm for Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02815","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:ddd9cafe281e761582e1fa975dc7f21d1d6bc40107a3536e5eaabefdaa747ae7","target":"record","created_at":"2026-05-17T23:44:43Z","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":"81fea53414042fc7c7cfe90bf3bbc4ae93126064499419a10c031fb750d52d02","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-07T18:47:48Z","title_canon_sha256":"18a5da6d4ce1caa044344a88c12d1b6ea190abfb314c2cc6f9ed591d545463d7"},"schema_version":"1.0","source":{"id":"1803.02815","kind":"arxiv","version":2}},"canonical_sha256":"f2db7d15ccce6d4315d0de57ce7a42debcaa71a4f7b6e588ba57496c140af50a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2db7d15ccce6d4315d0de57ce7a42debcaa71a4f7b6e588ba57496c140af50a","first_computed_at":"2026-05-17T23:44:43.402832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:43.402832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l6dvHtqSUhw7ccF63IQ/IocsoQA9ykkbqTzqBa4eNkD/6bNOVolEIOXGa0PZNmdsLRmAPlL4o9T5A+ShMripAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:43.403307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddd9cafe281e761582e1fa975dc7f21d1d6bc40107a3536e5eaabefdaa747ae7","sha256:24f8561404c691101335d9b10f5f2568457831958e8991f3dcc49a6e76c0d86c"],"state_sha256":"89ebf29b6f6e1ae75833783eade6b9a76678f2a39c1afef2c37d9de578ad184b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0H35JaHIP/1U3bH4gswtVFRDIqADgFBjO2BDptCpMQo82Z0qQbykIBUerdn5L6v4/FtTt0kTGUxZDckk4+AdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:42:04.067390Z","bundle_sha256":"3342ecc66e812df0705565ecace57aa8db90a9e5be84f0bf3144702804828c6d"}}