{"as_of":"2026-08-21T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1f7214ff13860cd45fc95701eb738230cf5cc711de620c18b0d37f2d00bc583","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:34:27.350237Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2602.23128/citation-record","integrity":"/paper/2602.23128/integrity","json":"/paper/2602.23128/citation-record.json","paper":"/paper/2602.23128"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T20:34:26.591581Z","title":"We now extend this result and upperbound the disagreement","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.591581Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:9d9e26f5e0091926e49e89793895098c065a67d2b92a4f92719d3c32303610ab","observation_id":"d8821f5e-65d5-4a95-802a-64f49aff63cd","resolution":{"observed_at":"2026-08-02T20:34:26.591581Z","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-02T20:34:26.402162Z","title":", Xn bei.i.d.random variables Xi ∈ {0,1}and p=E[X i]","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.402162Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:761a55561cd7551111e2a998c810e7e34c3cef205398bcc6be847e2f573c59b7","observation_id":"2a91d978-ce93-4a92-89b8-b28212f61083","resolution":{"observed_at":"2026-08-02T20:34:26.402162Z","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-02T20:34:24.858160Z","title":"Com- parative generalization bounds for deep neural networks","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.858160Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:0153d573cf0f292217ccb12433a68750e37ea866efbeb137283744d45c239e37","observation_id":"9f76ecbf-354a-4237-80a0-2c93bc148378","resolution":{"observed_at":"2026-08-02T20:34:24.858160Z","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-02T20:34:26.915806Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.915806Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:0f82db0f2605029da5ef03fd204b5c296626feac5985625a79500f3a5faa76b0","observation_id":"ba11d553-f511-4f81-bd85-730ad260ec79","resolution":{"observed_at":"2026-08-02T20:34:26.915806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01487","last_updated":"2019-10-03T14:08:57Z","snapshot_observed_at":"2026-08-04T09:21:05.533090Z","submitted_at":"2019-10-03T14:08:57Z","title":"Generalization Bounds for Convolutional Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01487","snapshot_observed_at":"2026-08-02T20:34:25.030019Z","title":"Generalization bounds for convolutional neural networks.arXiv preprint arXiv:1910.01487,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.030019Z"},"links":{"cited_paper":"/paper/1910.01487","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:2ec1ff27081c79c398938601b987e0eed6b5cb7c48c391285f819d79529325d6","observation_id":"29c42ad9-e686-48de-a600-888e2af5ddee","resolution":{"observed_at":"2026-08-02T20:34:25.030019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0411099","last_updated":"2004-11-30T08:36:59Z","snapshot_observed_at":"2026-07-07T03:06:10.700436Z","submitted_at":"2004-11-30T08:36:59Z","title":"A Note on the PAC Bayesian Theorem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0411099","snapshot_observed_at":"2026-08-02T20:34:25.168918Z","title":"A note on the pac bayesian theorem.arXiv preprint cs/0411099,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.168918Z"},"links":{"cited_paper":"/paper/cs/0411099","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:78e049e2e64fbb77a1ad934652e46fac054d5bb1e32abb1a81464b8b85223059","observation_id":"a38a89e7-0495-412a-8ffa-22a987036e7b","resolution":{"observed_at":"2026-08-02T20:34:25.168918Z","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-02T20:34:25.385933Z","title":"Pick-to-learn for systems and con- trol: Data-driven synthesis with state-of-the-art safety guarantees.arXiv preprint arXiv:2512.04781,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.385933Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:df642f849690a4cc116170c2ec400b07e7f96e75936cd464f6d8a0fe32f555d0","observation_id":"a39a4d26-690c-47df-886b-0e1d4c51c560","resolution":{"observed_at":"2026-08-02T20:34:25.385933Z","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-02T20:34:25.693620Z","title":"Sample compression bounds for decision trees","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.693620Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:368f1547f51eb24182f1c38587128e197c6b42ba55d0d13900f33ec4efa844f6","observation_id":"6c26582f-3e24-4608-8943-6567cf069ff9","resolution":{"observed_at":"2026-08-02T20:34:25.693620Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07325","last_updated":"2026-06-01T04:30:44Z","snapshot_observed_at":"2026-08-16T12:51:30.913275Z","submitted_at":"2025-03-10T13:40:10Z","title":"Non-vacuous Generalization Bounds for Deep Neural Networks without any modification to the trained models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07325","snapshot_observed_at":"2026-08-02T20:34:25.848295Z","title":"Non-vacuous generalization bounds for deep neural networks without any modification to the trained models.arXiv preprint arXiv:2503.07325,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.848295Z"},"links":{"cited_paper":"/paper/2503.07325","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:19a6e30a32d504f5d2d2843d8a10d74d2f5bc0cebe3579bb8d189c3979300ed0","observation_id":"882be317-92fc-4c44-ab3d-1a21423c89d3","resolution":{"observed_at":"2026-08-02T20:34:25.848295Z","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-02T20:34:26.026868Z","title":"Transformers: State-of-the-art natural language processing","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.026868Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:92d4491bf0a6dc4db282e5f407a0ce72ffcdadfc12dd6ce73539227996024ed5","observation_id":"58222b20-fe68-40d3-8d23-2aef13c7bc0b","resolution":{"observed_at":"2026-08-02T20:34:26.026868Z","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-02T20:34:26.138057Z","title":"Character- level convolutional networks for text classification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.138057Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:7b4458ac12ea8cd6e219f19742e09e23b064f7761ffe3f492249d854a78ef7d8","observation_id":"ea70f8fc-3bb3-4763-9053-9f224cf539fb","resolution":{"observed_at":"2026-08-02T20:34:26.138057Z","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-02T20:34:26.519829Z","title":"By definition,Z≤1 , which means that 1 Z 2−lC(ˆh)2−2 log2 lC(ˆh) ≥2 −lC(ˆh)2−2 log2 lC(ˆh) =⇒ Bin κ, n,1 Z 2−lC(ˆh)2−2 log2 lC(ˆh)δ ≤ Bin κ, n,2−lC(ˆh)2−2 log2 lC(ˆh)δ","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.519829Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:7322ae98fbb1ce8a61b0aa30a6f7bfeac04da67ad23983f62694d7226bdcf8ad","observation_id":"be2b2e06-4d43-487a-a595-547242ba0389","resolution":{"observed_at":"2026-08-02T20:34:26.519829Z","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-02T20:34:26.662498Z","title":"The second inequality comes from theKℓ-Lipschitz continuity ofℓ","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.662498Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:5c3a264c2f6bed9487d0ada1e7fe41e32edb6df05a19786abed2fc5b36feae1a","observation_id":"772ad3a2-c853-4934-91ac-0d2d60ce5669","resolution":{"observed_at":"2026-08-02T20:34:26.662498Z","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-02T20:34:26.747693Z","title":"To use Chernoff’s bound, we need a loss in the unit interval, so we normalize it","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.747693Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:9be678cbb56c1f80ffefdc8eb635f661fb3df43c53eb36cb4dae879eb1ce7df6","observation_id":"77348fab-7ad1-4ed4-b113-90f7005b1964","resolution":{"observed_at":"2026-08-02T20:34:26.747693Z","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-02T20:34:27.192018Z","title":"We consider 5 different seeds for the random clusters","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:27.192018Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:c8081a82477719aef97cfd5ea04960950a4846df7def33944047408d329ad83a","observation_id":"0831d0bb-41e1-4bb6-ac82-3579dac552e9","resolution":{"observed_at":"2026-08-02T20:34:27.192018Z","resolver_source":null,"status":"malformed_identifier"},"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-02T20:34:27.350237Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:27.350237Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:5e87d8f978556a1ed94885c45d928e8cfe3397aaabd121700ed513eca64f7182","observation_id":"4f2d2801-0f1b-4959-9600-22b58b284d57","resolution":{"observed_at":"2026-08-02T20:34:27.350237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-02T20:34:25.572781Z","title":"Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter.ArXiv preprint, abs/1910.01108,","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":1958,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.572781Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:3d49dfbeef207422682e21e6d4bb46f60f0a9125ed30144a186b3b53282b8a03","observation_id":"14be06f7-20b3-40ec-9b5e-45d3418a2f79","resolution":{"observed_at":"2026-08-02T20:34:25.572781Z","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-02T20:34:24.968749Z","title":"Margin-Sparsity Trade-Off for the Set Covering Machine","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.968749Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:4790d3e1bd905375c419dacf87d7bf9bc34955d82b8f4bdb6638bd375b0d1ea9","observation_id":"5a166a19-2ce8-4ea3-ba7d-a175b78691d6","resolution":{"observed_at":"2026-08-02T20:34:24.968749Z","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-02T20:34:25.229910Z","title":"On the perceptron’s compression","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.229910Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:a8b71ff0ad484f3285b792417c2a454468410d7dfe1496ede158e28b42eb4353","observation_id":"d55a4528-b520-4ac3-9219-d62ea2dc236f","resolution":{"observed_at":"2026-08-02T20:34:25.229910Z","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-02T20:34:25.113432Z","title":"The set covering machine with data-dependent half-spaces","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.113432Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:af95c1776c55729d82281057ea8699029e80abcfb2bd90bce0c4d088505b8763","observation_id":"6f91f2b7-e077-4596-bc76-b66699b8aebb","resolution":{"observed_at":"2026-08-02T20:34:25.113432Z","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-02T20:34:24.646915Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.646915Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:ff3ab71dc7c8f2ac5fca5d0ccd9c5a33242688091dbbf78f9a6b785925e3018a","observation_id":"59d25e3b-d6d5-4000-a545-debb3e69ddcc","resolution":{"observed_at":"2026-08-02T20:34:24.646915Z","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-02T20:34:24.502107Z","title":"Sample compression for self certified continual learning.arXiv preprint arXiv:2503.10503,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.502107Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:7cc143b8b75b1e15f7224e88020c8785485eea13ef4d2c6582dbc646b07d2b93","observation_id":"5978bff4-68bc-4bbf-b8d3-ff6255660030","resolution":{"observed_at":"2026-08-02T20:34:24.502107Z","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-02T20:34:26.250279Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:26.250279Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:91975468f8bb82fe775e10f672b17207e361168105667317065a525c9e118730","observation_id":"e1b63874-9ab4-4a77-8ad1-b625f2affd51","resolution":{"observed_at":"2026-08-02T20:34:26.250279Z","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-02T20:34:25.285512Z","title":"A coreset selection of coreset selection literature: Introduction and recent advances.arXiv preprint arXiv:2505.17799,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:25.285512Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:c2e89982d5e110e4cdb3f2e921ae2e16f798ed804876ae8221d1b660718e9c7e","observation_id":"e0df863a-df2d-448e-a910-d8b413324c95","resolution":{"observed_at":"2026-08-02T20:34:25.285512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.07880","last_updated":"2022-05-15T14:06:24Z","snapshot_observed_at":"2026-08-21T03:19:50.194843Z","submitted_at":"2022-05-15T14:06:24Z","title":"A Note on the Chernoff Bound for Random Variables in the Unit Interval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.07880","snapshot_observed_at":"2026-08-02T20:34:24.725049Z","title":"A note on the chernoff bound for random variables in the unit interval.ArXiv preprint, abs/2205.07880,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.725049Z"},"links":{"cited_paper":"/paper/2205.07880","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:050571d12fb1bc83f0ef05e9704d0918ad2d836e3d55ba6f47331f3c2439afe7","observation_id":"c4d0ad6a-21ff-4173-b9d1-d5df36843e60","resolution":{"observed_at":"2026-08-02T20:34:24.725049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01090","last_updated":"2019-06-28T14:03:29Z","snapshot_observed_at":"2026-08-19T06:21:00.579084Z","submitted_at":"2018-10-02T06:55:51Z","title":"Statistical learning with Lipschitz and convex loss functions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.01090","snapshot_observed_at":"2026-08-02T20:34:24.402476Z","title":"Statistical learning with lipschitz and convex loss functions.arXiv preprint arXiv:1810.01090,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.402476Z"},"links":{"cited_paper":"/paper/1810.01090","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:e49e539675e0bd99bdb629206a29b17bd9d4386896c119340190a237d5b5d5c2","observation_id":"536e5461-fd17-42bc-a258-f0759877f52f","resolution":{"observed_at":"2026-08-02T20:34:24.402476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.09841","last_updated":"2018-02-27T12:02:33Z","snapshot_observed_at":"2026-08-20T21:51:49.851010Z","submitted_at":"2018-02-27T12:02:33Z","title":"Adversarial Active Learning for Deep Networks: a Margin Based Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.09841","snapshot_observed_at":"2026-08-02T20:34:24.585107Z","title":"Adversarial active learning for deep networks: a margin based approach","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.585107Z"},"links":{"cited_paper":"/paper/1802.09841","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:9fffe9e879c7921468510c3ed66e7e87ae2e2f3d58b645350287fad35be70c0c","observation_id":"8ad7588d-d43b-4326-9c2a-1272480bb0d3","resolution":{"observed_at":"2026-08-02T20:34:24.585107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-08-16T18:00:58.008096Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-02T20:34:24.911845Z","title":"Distilling the knowledge in a neural network.arXiv preprint arXiv:1503.02531,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:24.911845Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:3bc0f231e3d45176262fceddf1726b703f8c4eb8d14541d012ef97ccff79d9fb","observation_id":"d417fca2-7629-4e41-84cf-df8711f1c318","resolution":{"observed_at":"2026-08-02T20:34:24.911845Z","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-02T20:34:27.077944Z","title":"Finally, the PAC-Bayesian experiments and the model distillation experiments were computed with Python 3.12.4 and a NVidia A100 SXM4","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates","version":2},"reference_index":4090,"source":"pdf_text","source_observed_at":"2026-08-02T20:34:27.077944Z"},"links":{"citing_paper":"/paper/2602.23128"},"observation_digest":"sha256:2b16932d84a42f6b81f94605a5510efa3ce14821f8de5760ac5e6948e0e8d96e","observation_id":"c63b3c50-8334-4249-8dac-beebb21f99cc","resolution":{"observed_at":"2026-08-02T20:34:27.077944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.23128","last_updated":"2026-07-07T21:35:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T21:37:38.870807Z","submitted_at":"2026-02-26T15:42:13Z","title":"Bound to Disagree: Generalization Bounds via Certifiable Surrogates"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":28,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2602.23128."}