{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7H3VTQESOLYS3NJLJ5A7R2VSGE","short_pith_number":"pith:7H3VTQES","canonical_record":{"source":{"id":"1902.07280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T20:55:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d0dbb39513d75858a9d42043bef8a550cf0a4c983f6eb788b0eb19156a8ea32a","abstract_canon_sha256":"8a757178cf78e2b4fec38c337aa1c66d73e325b0fcef86794b72a878adfc4aa6"},"schema_version":"1.0"},"canonical_sha256":"f9f759c09272f12db52b4f41f8eab231275ed8a1bb3298a645ad77fc8bc1af93","source":{"kind":"arxiv","id":"1902.07280","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07280","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07280v2","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07280","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"7H3VTQESOLYS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7H3VTQESOLYS3NJL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7H3VTQES","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7H3VTQESOLYS3NJLJ5A7R2VSGE","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T20:55:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d0dbb39513d75858a9d42043bef8a550cf0a4c983f6eb788b0eb19156a8ea32a","abstract_canon_sha256":"8a757178cf78e2b4fec38c337aa1c66d73e325b0fcef86794b72a878adfc4aa6"},"schema_version":"1.0"},"canonical_sha256":"f9f759c09272f12db52b4f41f8eab231275ed8a1bb3298a645ad77fc8bc1af93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:24.820811Z","signature_b64":"kPRpbEw0mvxrEgSOodV8sspgD4CJwTfGvLokp8rfp9CH8+qyMVPiaw75kTaUYDJ/94Hahv2ySDO+ZjdDHRx8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f759c09272f12db52b4f41f8eab231275ed8a1bb3298a645ad77fc8bc1af93","last_reissued_at":"2026-05-17T23:39:24.820180Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:24.820180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07280","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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlFQH+uTTXJY/hVfbhlmkq/aCZ6OUrGDVyWVyi9x6kYwsDxn3l3QgxoNfkM1eXXdtFrRmIHZvq8u72CNySLzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:47:35.271969Z"},"content_sha256":"fa129e5c2007bd588ebf754068ff4d09a1a07263511d274a3cc60579db0e57fe","schema_version":"1.0","event_id":"sha256:fa129e5c2007bd588ebf754068ff4d09a1a07263511d274a3cc60579db0e57fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7H3VTQESOLYS3NJLJ5A7R2VSGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Methods That Are Resistant to a Limited Number of Features Corrupted by an Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chris Mesterharm, Rauf Izmailov, Scott Alexander, Simon Tsang","submitted_at":"2019-02-19T20:55:01Z","abstract_excerpt":"In this paper, we consider batch supervised learning where an adversary is allowed to corrupt instances with arbitrarily large noise. The adversary is allowed to corrupt any $l$ features in each instance and the adversary can change their values in any way. This noise is introduced on test instances and the algorithm receives no label feedback for these instances. We provide several subspace voting techniques that can be used to transform existing algorithms and prove data-dependent performance bounds in this setting. The key insight to our results is that we set our parameters so that a signi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07280","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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NMdA27ExuYJx++RNBNTt26EsuLGCwD0Dkk3atm3pcReczfZDBwNFGLI99HXwfFeJGOVVqS/H0e1lKbtKQS6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:47:35.272345Z"},"content_sha256":"9c80ca40552bc8e16788ddb23334c9d7450260a88c6fcb22fb331bcfabd0c6c3","schema_version":"1.0","event_id":"sha256:9c80ca40552bc8e16788ddb23334c9d7450260a88c6fcb22fb331bcfabd0c6c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/bundle.json","state_url":"https://pith.science/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/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-02T17:47:35Z","links":{"resolver":"https://pith.science/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE","bundle":"https://pith.science/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/bundle.json","state":"https://pith.science/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7H3VTQESOLYS3NJLJ5A7R2VSGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7H3VTQESOLYS3NJLJ5A7R2VSGE","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":"8a757178cf78e2b4fec38c337aa1c66d73e325b0fcef86794b72a878adfc4aa6","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T20:55:01Z","title_canon_sha256":"d0dbb39513d75858a9d42043bef8a550cf0a4c983f6eb788b0eb19156a8ea32a"},"schema_version":"1.0","source":{"id":"1902.07280","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07280","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07280v2","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07280","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"7H3VTQESOLYS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7H3VTQESOLYS3NJL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7H3VTQES","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:9c80ca40552bc8e16788ddb23334c9d7450260a88c6fcb22fb331bcfabd0c6c3","target":"graph","created_at":"2026-05-17T23:39:24Z","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 this paper, we consider batch supervised learning where an adversary is allowed to corrupt instances with arbitrarily large noise. The adversary is allowed to corrupt any $l$ features in each instance and the adversary can change their values in any way. This noise is introduced on test instances and the algorithm receives no label feedback for these instances. We provide several subspace voting techniques that can be used to transform existing algorithms and prove data-dependent performance bounds in this setting. The key insight to our results is that we set our parameters so that a signi","authors_text":"Chris Mesterharm, Rauf Izmailov, Scott Alexander, Simon Tsang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T20:55:01Z","title":"Subspace Methods That Are Resistant to a Limited Number of Features Corrupted by an Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07280","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:fa129e5c2007bd588ebf754068ff4d09a1a07263511d274a3cc60579db0e57fe","target":"record","created_at":"2026-05-17T23:39:24Z","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":"8a757178cf78e2b4fec38c337aa1c66d73e325b0fcef86794b72a878adfc4aa6","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-19T20:55:01Z","title_canon_sha256":"d0dbb39513d75858a9d42043bef8a550cf0a4c983f6eb788b0eb19156a8ea32a"},"schema_version":"1.0","source":{"id":"1902.07280","kind":"arxiv","version":2}},"canonical_sha256":"f9f759c09272f12db52b4f41f8eab231275ed8a1bb3298a645ad77fc8bc1af93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9f759c09272f12db52b4f41f8eab231275ed8a1bb3298a645ad77fc8bc1af93","first_computed_at":"2026-05-17T23:39:24.820180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:24.820180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kPRpbEw0mvxrEgSOodV8sspgD4CJwTfGvLokp8rfp9CH8+qyMVPiaw75kTaUYDJ/94Hahv2ySDO+ZjdDHRx8Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:24.820811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07280","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa129e5c2007bd588ebf754068ff4d09a1a07263511d274a3cc60579db0e57fe","sha256:9c80ca40552bc8e16788ddb23334c9d7450260a88c6fcb22fb331bcfabd0c6c3"],"state_sha256":"568364898bb64f485d5167b1c242733fb496bf0a4d5b364595683fcaf4a683b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiRR7P8qMUqGMuO53Gs3wbHxgCGbPyL4kxrZud4buclaBD0ZZXxNnAAA6tEfrQhfrOysKVHfbysjvE4dbRR/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:47:35.274481Z","bundle_sha256":"78f83c11cce625a1263517dd62a90762a001456f830199265a83eef908d1344d"}}