{"as_of":"2026-08-15T22:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:583c1757edbc496eca3cfae8968bdd245047a05fae0577eb479c2fdbae580403","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:35:04.304339Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.13514/citation-record","integrity":"/paper/2608.13514/integrity","json":"/paper/2608.13514/citation-record.json","paper":"/paper/2608.13514"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.121491Z","title":"Optimal PAC bounds without uniform convergence","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.121491Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:79f418a44f0a83e30c56c6c1513d76bb905eaa8fbb95f5062b697e94fa5b608b","observation_id":"77f76c05-2643-474a-9ee0-752c9907d9f7","resolution":{"observed_at":"2026-08-14T05:35:04.121491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.202584Z","title":"Majority-of-three: The simplest optimal learner? In The Thirty Seventh Annual Conference on Learning Theory, volume 247 of Proceedings of Machine Learning Research, pages 22--45","venue":null,"work_id":"39bd1e90-9c0a-43ed-85d9-958617b711b1","year":2024},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.126707Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:8383183f3623ba645740e547569d80ab4b27e6ba8ecfd51a8d278fd5b08900f7","observation_id":"141f6dbe-714e-4f64-84d4-743191a30be5","resolution":{"observed_at":"2026-08-14T05:35:05.206837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.193396Z","title":null,"venue":null,"work_id":"74747127-b95b-49c5-ae6d-80c944b15994","year":2024},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.130168Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:d1197182928fc50066483e4457213d74370a9f6c29cb301a7addaa11a4dbf628","observation_id":"dfba2e3b-40ee-478f-aef3-bc92c650567f","resolution":{"observed_at":"2026-08-14T05:35:05.196656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.184208Z","title":null,"venue":null,"work_id":"05be60a3-a0e7-4753-9fa5-aa7ae30f5ea4","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.133615Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:00d61d9b2d5ec762eaf4e9d016f38965994c592b954394a49044fea66d9c85de","observation_id":"815c60db-e6d3-4f84-8f9e-bb68bf98e6e6","resolution":{"observed_at":"2026-08-14T05:35:05.187381Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.174965Z","title":"Adversarially robust learning with tolerance","venue":null,"work_id":"5e574323-34ee-465b-8ae4-f35c4f9e963b","year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.136891Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:bf728341da5e22fe88bdec3a31df63441a58345f0f5e90162bd2e1b2982a6015","observation_id":"7ebe25ac-32a3-443c-869d-d212984451dd","resolution":{"observed_at":"2026-08-14T05:35:05.178241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.165100Z","title":"Simplifying adversarially robust PAC learning with tolerance","venue":null,"work_id":"a0e10596-7648-4b75-ac2e-7b3363df7030","year":2025},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.140390Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:4bb9032d1090915bef4b61b4faae9ceb77ce503dcaa77de64de0a2caf9c5ad2d","observation_id":"39f325ba-6d67-430a-b5ec-1ada5708f46c","resolution":{"observed_at":"2026-08-14T05:35:05.168839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5802/aif.938","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.461624Z","title":"Densit \\'e et dimension","venue":null,"work_id":"3263bcd4-94a3-4f09-912d-aad97777dfa8","year":1983},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.143932Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:5f10455c8cbfb187be2123af758063150be61846cef5c850a027014e77bdbdb4","observation_id":"f3d1254b-ea36-4c2a-8aee-f283f253b8ee","resolution":{"observed_at":"2026-08-14T05:35:04.464904Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.155269Z","title":"Adversarially robust PAC learnability of real-valued functions","venue":null,"work_id":"ba57d9b7-8b96-46d6-99e1-413fca788280","year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.147369Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:0f858d790a5cd3564a621b5f7fa39ed235216383d2737a12a2de56dcdc8bc6d2","observation_id":"a663e969-5024-4296-84c8-82c6261fbf1d","resolution":{"observed_at":"2026-08-14T05:35:05.158622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.145872Z","title":"A characterization of semi-supervised adversarially robust PAC learnability","venue":null,"work_id":"e6b98ac5-1a75-41bc-be6a-2c68f6da3450","year":2022},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.151357Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:80f45f31b5b2bd53e7e7a67fbd7753ca1fcfd000713e4ca7e2b6cfa6010a1ca2","observation_id":"eb6baeb8-625b-467a-acb0-edf0994a2744","resolution":{"observed_at":"2026-08-14T05:35:05.149235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.136013Z","title":"Improved generalization bounds for adversarially robust learning","venue":null,"work_id":"2c9b133b-e44f-4971-9a0f-8b95d9864c2e","year":2022},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.154442Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:814091e34bdac004d5ea28caeac1dec77581d224031aaa4ac39b725868428c95","observation_id":"130a9ebe-f55c-49a6-b5fa-792c7dbbad9b","resolution":{"observed_at":"2026-08-14T05:35:05.139544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.126826Z","title":"Robustly-reliable learners under poisoning attacks","venue":null,"work_id":"5bfb40ef-9748-4e8f-b9e8-8a0576f0dab9","year":2022},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.157483Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:bc95e68a9295d47d5fbde3b1169266278b55da67662e45474d21206a47b68c7c","observation_id":"fab73e35-8590-44a1-8de7-83fe710ed48d","resolution":{"observed_at":"2026-08-14T05:35:05.130101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.117589Z","title":"Robust empirical risk minimization with tolerance","venue":null,"work_id":"0e58bed3-670c-47c8-98bc-db208bb2dd78","year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.160365Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:b493a2264f97922ab9fb187c9479303cbd55f31ad595457d7a693e0753885601","observation_id":"cbf9478c-5a3e-45e9-a87c-acc9b1d32507","resolution":{"observed_at":"2026-08-14T05:35:05.121026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.163224Z","title":"Evasion attacks against machine learning at test time","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.163224Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:2e89697469d7c41209c953c043615927162ab4c361f2fb85c2765cfef8b2339f","observation_id":"1403fe42-2f17-4d8c-933d-a8fb2d17e4d9","resolution":{"observed_at":"2026-08-14T05:35:04.163224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978971.243","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.451256Z","title":"Servedio","venue":null,"work_id":"7da709e1-708c-4993-8623-a9b43bea6748","year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.166254Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:4609136afc5c1e4a726f67ab70661cb3edd5aaaeb4015d04e0e5df8b60609095","observation_id":"4c936d86-1bc9-490c-8160-a2af0bd0585f","resolution":{"observed_at":"2026-08-14T05:35:04.454603Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.102924Z","title":"Robust learning under clean-label attack","venue":null,"work_id":"7a796222-6e41-40e7-b466-5ad7d8c9762e","year":2021},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.169216Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:77029ed3c52ae6bed8dee908479918a67fd02b8f1834b662d471ce9e48471cd5","observation_id":"69e1468d-0c68-447c-8cf1-7a8ef7cd7b44","resolution":{"observed_at":"2026-08-14T05:35:05.106220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.171931Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.171931Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:7a16bf6659ba2e6ca0d515360072e19213b67988f905354fbd73b9004bc0e1cb","observation_id":"f97aac2a-014b-4e73-bb38-7046fe68d43c","resolution":{"observed_at":"2026-08-14T05:35:04.171931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.174878Z","title":"Bagging predictors","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.174878Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:9b1007024e3585e643f30e50caa3b3bba0f15588c0e2e3f64cb88a95ff35ed8e","observation_id":"640d50e8-3a1d-4fa8-b197-a4353daaf075","resolution":{"observed_at":"2026-08-14T05:35:04.174878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.177931Z","title":"Bshouty, Nadav Eiron, and Eyal Kushilevitz","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.177931Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:22e84589fc647550a17462fc6ee6b29349d25696aef7d816b4345be4a5bae2c9","observation_id":"95e48cfd-da34-4dd9-8cd5-9d756fd48dfd","resolution":{"observed_at":"2026-08-14T05:35:04.177931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.180999Z","title":"Veeravalli","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.180999Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:19de92c832150232f180a10b03cb5e53554f6fc51dee34741e57082aee0377f9","observation_id":"7e48c4dc-9a36-445d-85f5-8972cebfb938","resolution":{"observed_at":"2026-08-14T05:35:04.180999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.093738Z","title":"Adversarial examples from computational constraints","venue":null,"work_id":"02ad066c-184e-4fd2-8024-c47dae50f786","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.187765Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:0b7c3c652117b9d29d9b99e2c5a24dd1300addf7cc9195fd16be4334a0a370a0","observation_id":"0ca8c530-92b0-49bd-99d8-7ac84a24bd68","resolution":{"observed_at":"2026-08-14T05:35:05.097138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.085291Z","title":"Duchi, and Percy Liang","venue":null,"work_id":"d816d364-3c17-44ea-bf97-006c96728967","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.192755Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:6ec63ad91a8a1ef8d4b9b8633e5bbf438611f5f8155b67810bb2ed097acc5a72","observation_id":"0f18ee73-a252-44f5-960d-01016c50fb92","resolution":{"observed_at":"2026-08-14T05:35:05.088521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.076698Z","title":"Zico Kolter","venue":null,"work_id":"12255632-1d96-42fc-9387-982688307074","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.195559Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:dfb27e998ffddc1ad691742c2053c85c8068e71395dba6b6959af8bbcf4b031b","observation_id":"b8f902d1-aeec-4466-9857-d617cbacea81","resolution":{"observed_at":"2026-08-14T05:35:05.079725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.067526Z","title":"Pac-learning in the presence of adversaries","venue":null,"work_id":"4ea2a37b-691c-4f2a-b083-8675e2709b54","year":2018},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.198154Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:4d869cdaaff9e005237c8626d079ed937a1d078879f30901eacd3e90ae7facfe","observation_id":"6103f661-d379-4489-8d13-cf1954ab2512","resolution":{"observed_at":"2026-08-14T05:35:05.070600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.200900Z","title":"Reliable abstention under adversarial injections: Tight lower bounds and new upper bounds","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.200900Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:9f14e27fdf44d97d24e5a34bd2aea5e3e08a2148a7106f492324ba5840055c53","observation_id":"2ac7d5e6-6e1c-4dd6-887c-3be3cffcfc07","resolution":{"observed_at":"2026-08-14T05:35:04.200900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.203704Z","title":"Kearns, and Leslie G","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.203704Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:506898151dec988eef19e20636ecd14d0abd2d130da0ea4c66501e7ac2dcd0f7","observation_id":"04f81dda-6d94-4a15-9156-00a7a3c2ba00","resolution":{"observed_at":"2026-08-14T05:35:04.203704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.057847Z","title":"Adversarial resilience in sequential prediction via abstention","venue":null,"work_id":"9f9d5977-095e-4182-aee9-4e5ebf894079","year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.206554Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:7b9d75217eca854ab46c7cb3add6d6f30356e5509916c3446f91ef7e1be0af63","observation_id":"951f4e56-fab2-4204-b7a3-4962ebb4536e","resolution":{"observed_at":"2026-08-14T05:35:05.060851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.048655Z","title":"Beyond perturbations: Learning guarantees with arbitrary adversarial test examples","venue":null,"work_id":"b9402bac-4dfc-4e28-b1ef-6a28c69c7dc3","year":2020},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.209288Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:9ede403e6638f0ac36e4f2cbdbcbb7fa26780d85f08027fe2d154053273228c3","observation_id":"6e60dda5-dc99-4718-bd60-aabec11268f0","resolution":{"observed_at":"2026-08-14T05:35:05.052079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-08-12T17:13:46.394331Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-14T05:35:04.212044Z","title":"Goodfellow, Jonathon Shlens, and Christian Szegedy","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.212044Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:d681e5687e7879341ba26aa86eb80c4df53fe3b445302da8b80978d54a1df000","observation_id":"d2b37fc2-68b1-40fe-8b5e-e1156e894b13","resolution":{"observed_at":"2026-08-14T05:35:04.212044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.039111Z","title":"On optimal learning under targeted data poisoning","venue":null,"work_id":"ea3f9e93-c871-49e8-826e-1d37cc7f20e0","year":2022},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.215672Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:e06878d94c7667161c1b13bd96f756ec2471a2244619522e36a24f8dba03fabc","observation_id":"69bcb749-3ae6-41de-82f7-20d842034d8a","resolution":{"observed_at":"2026-08-14T05:35:05.042658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.218611Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.218611Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:0d464c417d61abfe4b7dd1d6c2743b59df3c16e53bb2e92f9f788c4b7f836f0c","observation_id":"4ddfa066-aba7-43c8-90e0-ec07d595e1d3","resolution":{"observed_at":"2026-08-14T05:35:04.218611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.029832Z","title":"Efficient learning with arbitrary covariate shift","venue":null,"work_id":"c22aa7d6-c9d7-4222-97c2-effbf87ff741","year":2021},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.221796Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:f5637a3fa4c61f71e657f16099674b1a359bdedfe5d8a9bef9908c6099010253","observation_id":"e802bd55-29e2-42c9-bc38-c2f89f02df3a","resolution":{"observed_at":"2026-08-14T05:35:05.033025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2011.12.026","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.365005Z","title":"Reliable agnostic learning","venue":null,"work_id":"baba3c18-a86b-4c8a-97a3-394bbfc8f7f5","year":2012},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.224574Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:4ae15f00cd3b3e975fa7c59b27de6a7eeab9a0f7e53f87bc416248422f79376b","observation_id":"0e491870-0499-4618-8ef3-877ea88c4aa7","resolution":{"observed_at":"2026-08-14T05:35:04.369425Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.020616Z","title":"The impossibility of parallelizing boosting","venue":null,"work_id":"6739eb35-9ec9-4526-9498-5e55a0a6d3f4","year":2024},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.227613Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:5cef02c37d287e6274ea8de57331ef1971ff8087ccb9407289d18c1f57060c2d","observation_id":"73388ab2-36d2-453d-9fd3-80c0cf8d42fa","resolution":{"observed_at":"2026-08-14T05:35:05.023907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.230814Z","title":"Kearns and Ming Li","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.230814Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:1560e3709974c8eb3a34fa076b80998914770ca625fe11d5602c6028d047c25b","observation_id":"6b8ac873-3bb8-4875-9e44-5b4da14b6d07","resolution":{"observed_at":"2026-08-14T05:35:04.230814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.011411Z","title":"Klivans, Konstantinos Stavropoulos, and Arsen Vasilyan","venue":null,"work_id":"019f1ac1-81c9-4e85-8508-8fc51290dc8a","year":2024},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.233865Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:cfa688099365a176a0c7989b2418169a2fc56b239b390fc3fe5b338d5e558dbb","observation_id":"3b681f07-9e33-471a-88ed-99c5ac0806f6","resolution":{"observed_at":"2026-08-14T05:35:05.014666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:05.002317Z","title":"Bagging is an optimal PAC learner","venue":null,"work_id":"58a3d567-edbc-486e-bd5d-8eafd5a6aacb","year":2023},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.236784Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:f29e8d1a3d4d269e4b70c5fdc00e818ae6b84ee6bedd110a5cfadd37d89f86e0","observation_id":"c339b1dd-e2ce-4266-8956-e907bf57afbb","resolution":{"observed_at":"2026-08-14T05:35:05.005639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.992755Z","title":"Learning with monotone adversarial corruptions","venue":null,"work_id":"f7c31dde-098d-49ca-b39a-4b0e41109e15","year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.239687Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:c8d0f331c285cbcb37fa38f0ec7501155c44710ba8273078510e8b34d7fb2114","observation_id":"c03c2e17-c0f2-4574-9607-2cf4123dd93b","resolution":{"observed_at":"2026-08-14T05:35:04.996134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.242773Z","title":"Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.242773Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:6c2745502a62ea0f9bb7aebc2262449ecf702f97aac6fd9cbd30c60298bf6809","observation_id":"1efc4ecf-3e5a-4215-b87f-d8a883fa893a","resolution":{"observed_at":"2026-08-14T05:35:04.242773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.245992Z","title":"Madiman and Prasad Tetali","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.245992Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:1c4eec0d88ac9c1ac5f5e013b324f991fd1fea8b7a770c6b0e5ae5b35c220e94","observation_id":"b722a074-c067-4179-84f1-ee32e2e60941","resolution":{"observed_at":"2026-08-14T05:35:04.245992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.248843Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.248843Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:f0a90f5ef9033e9df5f3c6c79be50df6568956fcdc5199bb7fac64fb2c709563","observation_id":"a8516cdd-0e6a-4d32-8d3b-6be60cb53d9b","resolution":{"observed_at":"2026-08-14T05:35:04.248843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2608.06337","last_updated":"2026-08-06T17:45:32Z","snapshot_observed_at":"2026-08-15T22:39:14.607011Z","submitted_at":"2026-08-06T17:45:32Z","title":"Optimal Rates for Learning with Monotone Adversaries","version":1},"cited_work":{"arxiv_id":"2608.06337","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.06337","snapshot_observed_at":"2026-08-14T05:35:04.585293Z","title":"Optimal Rates for Learning with Monotone Adversaries","venue":"stat.ML","work_id":"dc5a2417-f1b2-427b-bf8a-3d569118e10b","year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.251947Z"},"links":{"cited_paper":"/paper/2608.06337","citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:c2e7012008f66e4fe1ab071877e4c6bf15eeb93be086e05b29e7b14e841607c3","observation_id":"0e0fcc7d-6ac6-44cc-beed-a60ad7cfa42d","resolution":{"observed_at":"2026-08-14T05:35:04.589905Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.978234Z","title":"VC classes are adversarially robustly learnable, but only improperly","venue":null,"work_id":"e12f4802-05d0-4d07-92ad-f72bf1440033","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.255398Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:ab96f5156ee175f078d875338b3ca1479304fc64086c8003bc11acae529b8e39","observation_id":"6f4ac2c6-080f-4e0d-a757-b7d96e46d4a9","resolution":{"observed_at":"2026-08-14T05:35:04.981531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.968618Z","title":"Efficiently learning adversarially robust halfspaces with noise","venue":null,"work_id":"d0078569-ee5e-42d3-a216-0ed76242a4a1","year":2020},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.258494Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:c453471f1d3800895b0ba45217309995e5f03e75e73f3476c395342c4c512d6d","observation_id":"69176b2c-38ad-4b3c-a152-5e565d4fd116","resolution":{"observed_at":"2026-08-14T05:35:04.971864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.959484Z","title":"Reducing adversarially robust learning to non-robust PAC learning","venue":null,"work_id":"6a12c877-d5ff-4c1b-85a9-c2282fc6ca9f","year":2020},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.261427Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:e604758d05c9126199489fa181129f74a90e02f74de9ff1b4dc9eac32c2a9846","observation_id":"c34f6027-d285-414c-a0d0-e3a3da6fef2f","resolution":{"observed_at":"2026-08-14T05:35:04.962761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.950211Z","title":"Adversarially robust learning with unknown perturbation sets","venue":null,"work_id":"c9c2f7da-a86a-4331-8c73-24321331a6fc","year":2021},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.264426Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:01e7ad50a19f390030c1ef59625440574779f4f38aa1e5a5dba09c056a4805be","observation_id":"d419afcd-e4d0-48bf-9be1-c6090e0f03dd","resolution":{"observed_at":"2026-08-14T05:35:04.953728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.940573Z","title":"Adversarially robust learning: A generic minimax optimal learner and characterization","venue":null,"work_id":"7b8859ac-7478-47cf-b892-1547a1e27df5","year":2022},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.267426Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:4c0694ce688bdcdd846717047f07e15e97c9a6c712eb5ffb7c0a7c1284d59566","observation_id":"dd585263-0da9-4e91-9a1c-5fb4e2f3e12d","resolution":{"observed_at":"2026-08-14T05:35:04.944239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.270495Z","title":"Sample compression schemes for VC classes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.270495Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:e6c925bc26a9e502a1bd0b47b2220478b625f0e389db697dfd27c40bb4d44875","observation_id":"09fbb631-0fbe-44bd-adab-aece55a8c865","resolution":{"observed_at":"2026-08-14T05:35:04.270495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.931178Z","title":"Klivans, Konstantinos Stavropoulos, and Arsen Vasilyan","venue":null,"work_id":"7a6bd299-4f09-43ed-9c51-0efb308de800","year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.273546Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:bacea4c8de8978b0f1441233eb8249121cca47b90a6a8d3bb68abd032dffa9b3","observation_id":"2fb726ff-dada-462e-8fe7-ba4093020e19","resolution":{"observed_at":"2026-08-14T05:35:04.934419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13614","last_updated":"2026-06-11T17:26:13Z","snapshot_observed_at":"2026-08-15T09:03:17.335312Z","submitted_at":"2026-06-11T17:26:13Z","title":"Majority-of-Three is Optimal","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.13614","snapshot_observed_at":"2026-08-14T05:35:04.276630Z","title":"Majority-of-three is optimal","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.276630Z"},"links":{"cited_paper":"/paper/2606.13614","citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:a1843b5b3e74c6ecd6b80e2bd617561e81bb81eddcadb8053625d98c58a800b1","observation_id":"10e8659c-6705-403c-8b8f-8d16eadc224d","resolution":{"observed_at":"2026-08-14T05:35:04.276630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.280445Z","title":"How much does your data exploration overfit? controlling bias via information usage","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.280445Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:6be708e7a7d14ba2f944e3a55e2f91fd0d14baa297193385cc7ff8c8249a5a30","observation_id":"2c9d2101-52cb-47ee-9953-101ae4f7dae3","resolution":{"observed_at":"2026-08-14T05:35:04.280445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.283591Z","title":"Schapire and Yoav Freund","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.283591Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:46020235d6a0845a3e5a2efac21283c20c2c57b92fe50880cbd994599cbc4f96","observation_id":"c7647782-309f-4107-9eb2-ab0b4bc6f6b6","resolution":{"observed_at":"2026-08-14T05:35:04.283591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.921744Z","title":"Adversarially robust generalization requires more data","venue":null,"work_id":"78954ee8-672a-4b5b-af03-0b4f9747a92e","year":2018},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.286681Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:7851f7a473c273a73f34c918781a655dbecf16535dd3b80a2d3ba0173e09b6f3","observation_id":"e7e0ca09-7be2-4c5b-a6a7-f682cbe7ccb0","resolution":{"observed_at":"2026-08-14T05:35:04.924912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6199","last_updated":"2014-02-19T16:33:14Z","snapshot_observed_at":"2026-08-15T16:41:15.505782Z","submitted_at":"2013-12-21T03:36:08Z","title":"Intriguing properties of neural networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6199","snapshot_observed_at":"2026-08-14T05:35:04.289699Z","title":"Intriguing properties of neural networks","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.289699Z"},"links":{"cited_paper":"/paper/1312.6199","citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:6e541dace71e60c1cba7a1c68b7264abf5b1ada3470106617341c007d70dbed6","observation_id":"8c492632-482d-4fca-9451-4bc304b42bfc","resolution":{"observed_at":"2026-08-14T05:35:04.289699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.292842Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.292842Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:22a7196bf014763f61d15994da4e5337fff4c6944072c428189a7e654771410e","observation_id":"dfdbe42a-495b-4086-bf41-fd4566032455","resolution":{"observed_at":"2026-08-14T05:35:04.292842Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.295728Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.295728Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:ec8f89fc1c3a1ba8de0cc525226ce194ef4f3e07ecb60661f7fd976eb481e6bf","observation_id":"7e224468-9540-4e0d-9f54-af9b22eb7ea5","resolution":{"observed_at":"2026-08-14T05:35:04.295728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.912871Z","title":"Bartlett","venue":null,"work_id":"8048dfa8-cc04-484c-9d1e-b9dfbeb5b173","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.298580Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:dbe05c96ecd87d1f175969e143726a1a21177190460908ec94ad2cb4717e2888","observation_id":"77eab221-5077-45ef-9dd5-b1b7db285ad0","resolution":{"observed_at":"2026-08-14T05:35:04.915933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.902992Z","title":"Distribution-free sequential prediction with abstentions","venue":null,"work_id":"fa21e1ed-12b2-40cd-937d-d572623af30a","year":2026},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.301448Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:c17ca42103e76f9e92d42104a2a489ca9ee9f6fdbf8229ec2c49d448f6e5f3dd","observation_id":"f7c115d8-d34d-431c-8aa3-d3eaabc038d0","resolution":{"observed_at":"2026-08-14T05:35:04.906566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:35:04.893803Z","title":"Xing, Laurent El Ghaoui, and Michael I","venue":null,"work_id":"af27d520-8328-41ef-8bcd-05dcce43105f","year":2019},"citing_paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-14T05:35:04.304339Z"},"links":{"citing_paper":"/paper/2608.13514"},"observation_digest":"sha256:9e94000f83e1c56cec39457f4bbfad233d5a2bd135832312857266552039f2b5","observation_id":"4a57c43c-60ac-4348-983e-f67b53f25d1a","resolution":{"observed_at":"2026-08-14T05:35:04.897168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.13514","last_updated":"2026-08-13T17:36:49Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-15T22:18:00.873610Z","submitted_at":"2026-08-13T17:36:49Z","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":4,"verified_fuzzy":31},"total_outbound_references":58},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2608.13514."}