{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N6ABW2HU6NGUBCK3IK2XDFYI4B","short_pith_number":"pith:N6ABW2HU","canonical_record":{"source":{"id":"2608.13514","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-08-13T17:36:49Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"0f7543713d14a60fbe80af91b7ffb9361e1e728d08d2381d0f0ca60d955a4cde","abstract_canon_sha256":"e0cdfb3abecbdbc5c8f1145b41ed9e69b94885ba772d836dbad8e3dbd610fa32"},"schema_version":"1.0"},"canonical_sha256":"6f801b68f4f34d40895b42b5719708e04ec96690d726e176d74f435a00d95fa5","source":{"kind":"arxiv","id":"2608.13514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13514","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13514v1","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13514","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"N6ABW2HU6NGU","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"N6ABW2HU6NGUBCK3","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"N6ABW2HU","created_at":"2026-08-14T01:24:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N6ABW2HU6NGUBCK3IK2XDFYI4B","target":"record","payload":{"canonical_record":{"source":{"id":"2608.13514","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-08-13T17:36:49Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"0f7543713d14a60fbe80af91b7ffb9361e1e728d08d2381d0f0ca60d955a4cde","abstract_canon_sha256":"e0cdfb3abecbdbc5c8f1145b41ed9e69b94885ba772d836dbad8e3dbd610fa32"},"schema_version":"1.0"},"canonical_sha256":"6f801b68f4f34d40895b42b5719708e04ec96690d726e176d74f435a00d95fa5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T01:24:55.572259Z","signature_b64":"voU0vnEmZo4hj4UbRd0M6i6FxNhn3nnXE7XYv6JqwJyh8LkXlPpoaRVsWOkXE4bpY/vgUoDviXlIRMUMM4XsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f801b68f4f34d40895b42b5719708e04ec96690d726e176d74f435a00d95fa5","last_reissued_at":"2026-08-14T01:24:55.569822Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T01:24:55.569822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.13514","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-08-14T01:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFroNzLITfSBhQnWjtk8ahK8UcyHahxo8CkziB2Elrgwgn4nTxCKuarjNpyxAqmO/ufETcNSQodIcMFTvFHsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:57:54.700896Z"},"content_sha256":"db3ced67174d8be51faa6a42c5be430088499fc9c0132d5c3e9f7662d7eaa2b3","schema_version":"1.0","event_id":"sha256:db3ced67174d8be51faa6a42c5be430088499fc9c0132d5c3e9f7662d7eaa2b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N6ABW2HU6NGUBCK3IK2XDFYI4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Omar Montasser","submitted_at":"2026-08-13T17:36:49Z","abstract_excerpt":"We revisit the problem of learning predictors robust to adversarial examples at test-time. We prove that VC classes are adversarially robustly learnable with sample complexity linear in the VC dimension $d$, providing an exponential improvement over the previous upper bound of Montasser, Hanneke, and Srebro (2019). Remarkably, this result is achieved with a simple improper algorithm that combines the classic heuristic bagging (bootstrap aggregation) of Breiman (1996) with robust empirical risk minimization (RERM). Our algorithm computes RERMs on $O(d^\\star)$ independent bootstrap samples and o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13514","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/2608.13514/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-08-14T01:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+Suel5LjwDYkR1/ZSqXDo/84MCu3wUpQ50txhm5+hw37PNBrcUbXDGoCohRT55yv3Ixne4xdIYTfTwhbpLrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:57:54.701450Z"},"content_sha256":"1e125cabc3bfeb3d394e60b71ce0aa4ad42eae31fed9646f5d6b0cdbd16f149c","schema_version":"1.0","event_id":"sha256:1e125cabc3bfeb3d394e60b71ce0aa4ad42eae31fed9646f5d6b0cdbd16f149c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/bundle.json","state_url":"https://pith.science/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/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-15T02:57:54Z","links":{"resolver":"https://pith.science/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B","bundle":"https://pith.science/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/bundle.json","state":"https://pith.science/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6ABW2HU6NGUBCK3IK2XDFYI4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N6ABW2HU6NGUBCK3IK2XDFYI4B","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":"e0cdfb3abecbdbc5c8f1145b41ed9e69b94885ba772d836dbad8e3dbd610fa32","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-08-13T17:36:49Z","title_canon_sha256":"0f7543713d14a60fbe80af91b7ffb9361e1e728d08d2381d0f0ca60d955a4cde"},"schema_version":"1.0","source":{"id":"2608.13514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13514","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13514v1","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13514","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"N6ABW2HU6NGU","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_16","alias_value":"N6ABW2HU6NGUBCK3","created_at":"2026-08-14T01:24:55Z"},{"alias_kind":"pith_short_8","alias_value":"N6ABW2HU","created_at":"2026-08-14T01:24:55Z"}],"graph_snapshots":[{"event_id":"sha256:1e125cabc3bfeb3d394e60b71ce0aa4ad42eae31fed9646f5d6b0cdbd16f149c","target":"graph","created_at":"2026-08-14T01:24:55Z","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/2608.13514/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit the problem of learning predictors robust to adversarial examples at test-time. We prove that VC classes are adversarially robustly learnable with sample complexity linear in the VC dimension $d$, providing an exponential improvement over the previous upper bound of Montasser, Hanneke, and Srebro (2019). Remarkably, this result is achieved with a simple improper algorithm that combines the classic heuristic bagging (bootstrap aggregation) of Breiman (1996) with robust empirical risk minimization (RERM). Our algorithm computes RERMs on $O(d^\\star)$ independent bootstrap samples and o","authors_text":"Omar Montasser","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13514","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:db3ced67174d8be51faa6a42c5be430088499fc9c0132d5c3e9f7662d7eaa2b3","target":"record","created_at":"2026-08-14T01:24:55Z","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":"e0cdfb3abecbdbc5c8f1145b41ed9e69b94885ba772d836dbad8e3dbd610fa32","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-08-13T17:36:49Z","title_canon_sha256":"0f7543713d14a60fbe80af91b7ffb9361e1e728d08d2381d0f0ca60d955a4cde"},"schema_version":"1.0","source":{"id":"2608.13514","kind":"arxiv","version":1}},"canonical_sha256":"6f801b68f4f34d40895b42b5719708e04ec96690d726e176d74f435a00d95fa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f801b68f4f34d40895b42b5719708e04ec96690d726e176d74f435a00d95fa5","first_computed_at":"2026-08-14T01:24:55.569822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T01:24:55.569822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voU0vnEmZo4hj4UbRd0M6i6FxNhn3nnXE7XYv6JqwJyh8LkXlPpoaRVsWOkXE4bpY/vgUoDviXlIRMUMM4XsAA==","signature_status":"signed_v1","signed_at":"2026-08-14T01:24:55.572259Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.13514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db3ced67174d8be51faa6a42c5be430088499fc9c0132d5c3e9f7662d7eaa2b3","sha256:1e125cabc3bfeb3d394e60b71ce0aa4ad42eae31fed9646f5d6b0cdbd16f149c"],"state_sha256":"5d2729828b53354afa1fd4cbe349e59c57bd593fb13349e1a7edf356ea77267e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/hnYTAwUlurxwzZUnc2JCjwmV5zJW6/tqnGb3WBSrUYqByhbRNtq55A98xECb2PY1t8Am3l1ToZScoRRgkPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T02:57:54.707164Z","bundle_sha256":"ae065393326c8fb3b7c50a4730cafbd388affa023bcfd8de67d204939795d319"}}