{"as_of":"2026-08-17T04:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9063bb781adf33993c436f354fb465fc53d3817acb070ba28920f935a41d3fe","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T19:35:40.341295Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2607.26838/citation-record","integrity":"/paper/2607.26838/integrity","json":"/paper/2607.26838/citation-record.json","paper":"/paper/2607.26838"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T19:35:40.179689Z","title":"The Uniform Hardcore Lemma via Approximate Bregman Projections","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.179689Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:efb606be9eaa519cee8b8e9ffff7ab6f0d8a10dc1a6ea0bde6a97c53f7f3050f","observation_id":"77af5445-ebe7-4999-90c8-136ba32fa6ec","resolution":{"observed_at":"2026-07-30T19:35:40.179689Z","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-07-30T19:35:40.184131Z","title":"Boosting the margin: a new explanation for the effectiveness of voting methods","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.184131Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:c5744468ebc60a85b4c10a8bd0dcaf2dd4211bfcd6ce1c180aa286b91f996097","observation_id":"42bd7a06-abe1-4772-a20e-b3238d411337","resolution":{"observed_at":"2026-07-30T19:35:40.184131Z","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-07-30T19:35:40.187775Z","title":"Agnostic Boosting","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.187775Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:8a90cf77cd7dce63722494d1d769173477e883b896779eaf00a2a2d8e6c87961","observation_id":"224c682c-67cc-497a-b813-fd43c28e86c0","resolution":{"observed_at":"2026-07-30T19:35:40.187775Z","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-07-30T19:35:40.191443Z","title":"Learnability and the Vapnik-Chervonenkis dimension","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.191443Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:ff6adcab72dd44bee66fe0293d46fa62824d0cbea05f0258e7f24b1a19e2a55d","observation_id":"be7ac5b6-e74e-47ce-94fe-5acf267e2d3e","resolution":{"observed_at":"2026-07-30T19:35:40.191443Z","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-07-30T19:35:40.194929Z","title":"Prediction Games and Arcing Algorithms","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.194929Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:6b3675f0c2e7b284108e5556f02f3157a602924c0edc5b03770f45bad24e07a4","observation_id":"5e1c8029-c98e-433f-b743-088e12ebd83f","resolution":{"observed_at":"2026-07-30T19:35:40.194929Z","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-07-30T19:35:40.198486Z","title":"Of Dice and Games: A Theory of Generalized Boosting","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.198486Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:1042b23bcbaa53ac114b15c5dadd2a104ed334c0ab0fb38209e8a48b0b7064aa","observation_id":"7b609cba-fc4c-43de-b64f-69df69bf8ac1","resolution":{"observed_at":"2026-07-30T19:35:40.198486Z","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-07-30T19:35:40.202160Z","title":"Online Agnostic Boosting via Regret Minimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.202160Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:525466dc13829995a589cf5e69cf4dadaa050df23aeb344fbb7145dfb4705ae5","observation_id":"3fc8d322-21cf-4109-8556-a3055a2cb0ee","resolution":{"observed_at":"2026-07-30T19:35:40.202160Z","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-07-30T19:35:40.205341Z","title":"Multiclass Boosting: Simple and Intuitive Weak Learning Criteria","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.205341Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:88935b0456649f1bb64ad4d1df320f26c8038643694fa9dbe66e5657e8e991fb","observation_id":"33f711c3-c2ec-4f44-a1cc-d83b6ee5a8e6","resolution":{"observed_at":"2026-07-30T19:35:40.205341Z","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-07-30T19:35:40.208513Z","title":"Boosting With the L2 Loss","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.208513Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:2683aaae9bf32259f80e49b97dafc01f2b5612b2ebf12f4ff0a1d68ba882b8a2","observation_id":"00a03b2c-e182-4097-86c4-3845dea4aa67","resolution":{"observed_at":"2026-07-30T19:35:40.208513Z","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-07-30T19:35:40.211696Z","title":"Efficient, Noise-Tolerant, and Private Learning via Boosting","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.211696Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:d0db63d73a7217adba1be7b3c118a47f0af272838c1b89229c360e33079bc0af","observation_id":"fd4b836d-9b21-4b7f-bb47-b626382ece56","resolution":{"observed_at":"2026-07-30T19:35:40.211696Z","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-07-30T19:35:40.214824Z","title":"XGBoost: A Scalable Tree Boosting System","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.214824Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:5d12033145206ee22c70c0fda8ee64df82f9d7d9e1fcbcf8f9b781589352178f","observation_id":"ad9ffb72-19c3-47da-895c-f5ef166e925f","resolution":{"observed_at":"2026-07-30T19:35:40.214824Z","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-07-30T19:35:40.218097Z","title":"2026 (cit","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.218097Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:6b17c64292473170576d311067e80d56322ed980bd735c4679044e3a8ee66ed9","observation_id":"2e818575-3a42-428c-b383-7be47ba78e51","resolution":{"observed_at":"2026-07-30T19:35:40.218097Z","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-07-30T19:35:40.221869Z","title":"Boosting, Voting Classifiers and Randomized Sample Compression Schemes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.221869Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:ff42b535475a4bbb7d1973fcf23bc622a4bc7c0a73d4701807335c9afc336256","observation_id":"16847b63-9e14-4970-8f54-a07d388bfb06","resolution":{"observed_at":"2026-07-30T19:35:40.221869Z","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-07-30T19:35:40.225003Z","title":"Optimal Parallelization of Boosting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.225003Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:eccf70c7b250af9028c9e404795a77ac3750a960e16d4ed5557452b269937b1e","observation_id":"0f324627-a0e7-4e79-8ebc-505fae6b6be6","resolution":{"observed_at":"2026-07-30T19:35:40.225003Z","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-07-30T19:35:40.228323Z","title":"Revisiting Agnostic Boosting","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.228323Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:63ed8c86d0e70c32b056460e79bb693f3c43d1fafa214cdda865d2d3706f8c32","observation_id":"6aaab1d8-a3da-404d-a0c5-00d8015a6f9f","resolution":{"observed_at":"2026-07-30T19:35:40.228323Z","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-07-30T19:35:40.231525Z","title":"Improving Regressors Using Boosting Techniques","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.231525Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:282b9820c5eeb2ff2e79648a690e79bb2047f153577eefe1bca0192abf652d6e","observation_id":"c1800052-c227-4d91-a27d-8d1d9320cc00","resolution":{"observed_at":"2026-07-30T19:35:40.231525Z","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-07-30T19:35:40.234891Z","title":"Boosting Methods for Regression","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.234891Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:78c0b575810774205087de4506768025cad9a012a444752689547bea5f10d8ad","observation_id":"1683b7ab-b45c-4482-b133-e07bfa506ba8","resolution":{"observed_at":"2026-07-30T19:35:40.234891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16791","last_updated":"2025-11-03T18:47:03Z","snapshot_observed_at":"2026-08-15T22:17:49.239798Z","submitted_at":"2025-06-20T07:14:48Z","title":"TabArena: A Living Benchmark for Machine Learning on Tabular Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.16791","snapshot_observed_at":"2026-07-30T19:35:40.238295Z","title":"TabArena: A Living Benchmark for Machine Learning on Tabular Data","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.238295Z"},"links":{"cited_paper":"/paper/2506.16791","citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:a337de9a227d6bfed0170f7f1b9747265df99af6f6cd8cf8b66624eba55e093b","observation_id":"0e9fe7ef-0bea-4580-9b62-2d309f76aa66","resolution":{"observed_at":"2026-07-30T19:35:40.238295Z","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-07-30T19:35:40.242121Z","title":"Distribution-Specific Agnostic Boosting","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.242121Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:c2602923cb297391c6b7d6f1e90221e5c3652bdd42a54e4ab69c978e3ed10c32","observation_id":"4bb0fb17-480d-477b-9897-880a1db7184e","resolution":{"observed_at":"2026-07-30T19:35:40.242121Z","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-07-30T19:35:40.245529Z","title":"A decision-theoretic generalization of on-line learning and an application to boosting","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.245529Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:a4d9dc7f915f6ae2b72f43b60ab5d9e87ea29b552d96e7acace57619ec411a0f","observation_id":"77b63590-83a5-4982-9001-cb881ceaefb8","resolution":{"observed_at":"2026-07-30T19:35:40.245529Z","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-07-30T19:35:40.248939Z","title":"Greedy function approximation: A gradient boosting machine","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.248939Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:800740c259fe70d1cff40fd0e6ec094a485b484d64dc110cfb874d5edb276989","observation_id":"e0ce2a9a-ce01-4fc8-908b-9df03f1cc576","resolution":{"observed_at":"2026-07-30T19:35:40.248939Z","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-07-30T19:35:40.252008Z","title":"On the doubt about margin explanation of boosting","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.252008Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:e579b8dde77a44cb77a503a3cca6772f04679561751d6baa5c9bc6c80ef14606","observation_id":"3e213f97-286f-4f91-afd7-61ba1f4fff47","resolution":{"observed_at":"2026-07-30T19:35:40.252008Z","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-07-30T19:35:40.255354Z","title":"Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.255354Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:8df35d47a5c91bf90f3b99ee4a25655fa9002e5c79eac526bc3eccc3ff11b9de","observation_id":"6741dbee-1bf4-41ec-8a4e-88660fe6acb7","resolution":{"observed_at":"2026-07-30T19:35:40.255354Z","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-07-30T19:35:40.258440Z","title":"Sample-Efficient Agnostic Boosting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.258440Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:aa79368ad862c5bf993a5268652d7646a359103053849ffc2e33c94166e08b3d","observation_id":"7bd98715-24c4-4c68-8682-c3536667db19","resolution":{"observed_at":"2026-07-30T19:35:40.258440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.04706","last_updated":"2025-03-06T18:54:42Z","snapshot_observed_at":"2026-08-16T12:52:23.617950Z","submitted_at":"2025-03-06T18:54:42Z","title":"Sample-Optimal Agnostic Boosting with Unlabeled Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.04706","snapshot_observed_at":"2026-07-30T19:35:40.261455Z","title":"Sample-Optimal Agnostic Boosting with Unlabeled Data","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.261455Z"},"links":{"cited_paper":"/paper/2503.04706","citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:cc497929e8ea915150cd7d97b1155ce3c7f9b5910b06fdb5106dfd01aff08eae","observation_id":"854674e9-545e-425c-a9d1-d0a7b73d7d18","resolution":{"observed_at":"2026-07-30T19:35:40.261455Z","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-07-30T19:35:40.265089Z","title":"Margins are insufficient for explaining gradient boosting","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.265089Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:40e17cb60b5cfdfb2aa712b1784f120db018549f2c7882b5bc7a74bae73217e8","observation_id":"cf0de315-a5c2-4554-be08-1c3090657d5a","resolution":{"observed_at":"2026-07-30T19:35:40.265089Z","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-07-30T19:35:40.268268Z","title":"Margin- based generalization lower bounds for boosted classifiers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.268268Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:99457a9681bb3c0f94fcd950e2b601bc4f04b54f5ae9e738108bdd1aaf2529af","observation_id":"4ae15c1e-7874-467c-b565-8e07af99e537","resolution":{"observed_at":"2026-07-30T19:35:40.268268Z","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-07-30T19:35:40.271388Z","title":"AdaBoost is not an Optimal Weak to Strong Learner","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.271388Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:4dc82f4eca03684bdb5c9941c64328ae316c77807e30ac1f1ef5bbe3544f227e","observation_id":"5af49123-7245-4894-832e-335e35c58928","resolution":{"observed_at":"2026-07-30T19:35:40.271388Z","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-07-30T19:35:40.274671Z","title":"Improved Margin Generalization Bounds for Voting Classifiers","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.274671Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:0c84a4736971c6c30b32de327e7b52dc3c64f5fba8bd871b59b1ed5f7687ced2","observation_id":"5a59466b-8e7e-45e6-a635-2132f89d9e8f","resolution":{"observed_at":"2026-07-30T19:35:40.274671Z","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-07-30T19:35:40.277676Z","title":"Reproducibility in learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.277676Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:f8b54ecef4d3e8aae263a9b54581304710a37ec13cb5081a2d2f714fb5225a5f","observation_id":"19bb9269-9091-45d0-8e0c-b7512e70b07d","resolution":{"observed_at":"2026-07-30T19:35:40.277676Z","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-07-30T19:35:40.280591Z","title":"Potential-Based Agnostic Boosting","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.280591Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:87e97085a11194ce89bc8eba717713a05cd3c57dc69eaca6d7eb88fb09fc1bf0","observation_id":"77089cd2-a400-47fc-aca9-6a2c59b68445","resolution":{"observed_at":"2026-07-30T19:35:40.280591Z","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-07-30T19:35:40.287051Z","title":"The Impossibility of Parallelizing Boosting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.287051Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:d0680b97af1baf5135c612a9903408ad9637a447845e14538ffefbb179e71d6d","observation_id":"8676039c-3cab-49d5-bde2-b8e69883a620","resolution":{"observed_at":"2026-07-30T19:35:40.287051Z","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-07-30T19:35:40.290075Z","title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.290075Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:40e5a6ff529bc053b7b142f3eb5187e4f61563b72b3dbcad78ab656674508f9d","observation_id":"39d98e62-9576-4214-97fb-30b3cfe3e47a","resolution":{"observed_at":"2026-07-30T19:35:40.290075Z","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-07-30T19:35:40.293432Z","title":"Cryptographic Limitations on Learning Boolean Formulae and Finite Automata","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.293432Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:61eab94c0f3b12b78f7fc0b1b6ca3a6685e8b0cd8f14639c941ff3966d8d59d7","observation_id":"ba43b70e-a670-4b24-8ab2-3231cf7f0ac7","resolution":{"observed_at":"2026-07-30T19:35:40.293432Z","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-07-30T19:35:40.296690Z","title":"Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.296690Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:71cec4dbb0fa6bc71e0986d3e936281a2ae7954142143cfc6d96ff170e99681d","observation_id":"7fdfb6ee-27f3-4def-8e3f-b41923a31e79","resolution":{"observed_at":"2026-07-30T19:35:40.296690Z","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-07-30T19:35:40.300116Z","title":"Improved Replicable Boosting with Majority-of-Majorities","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.300116Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:75a1d03e052caedaf9d6fdaaafafc989eea62b9ea8d7eaaa529cfcc8794546f9","observation_id":"8125052b-c0b9-44f0-9b73-265e9eb6265c","resolution":{"observed_at":"2026-07-30T19:35:40.300116Z","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-07-30T19:35:40.303291Z","title":"2025 (cit","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.303291Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:d1d6aaaf24605dfe90d32a784bb8076a192da8ed78b2e34e7598a25e2b3ac2db","observation_id":"8a423788-57c9-41bb-94ff-91d240905833","resolution":{"observed_at":"2026-07-30T19:35:40.303291Z","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-07-30T19:35:40.306316Z","title":"Algorithms and Hardness Results for Parallel Large Margin Learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.306316Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:0da97450eed3596a21bac053d98478371a0dcd6107a925f2d06a0579e94800ea","observation_id":"c33d16a2-6f58-4d03-8411-03f9ee2b72f8","resolution":{"observed_at":"2026-07-30T19:35:40.306316Z","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-07-30T19:35:40.309402Z","title":"The Cost of Parallelizing Boosting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.309402Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:1dcd809336c2173daae934fe5aa81659b679f5363e2e66b6a0932164bb462b66","observation_id":"22652b90-7748-468b-b4ab-3fbf7a76254b","resolution":{"observed_at":"2026-07-30T19:35:40.309402Z","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-07-30T19:35:40.312419Z","title":"A Theory of Multiclass Boosting","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.312419Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:fc0d7ea4bd5c10dbcefe7868d5337c99a315a650bf1aec1022f6bacdba62db76","observation_id":"21861db1-0a10-42c8-88d5-650782932294","resolution":{"observed_at":"2026-07-30T19:35:40.312419Z","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-07-30T19:35:40.315682Z","title":"CatBoost: unbiased boosting with categorical features","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.315682Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:278b2805d8b68526e87c15a3003ea51739f32c48f36c3b3631e3ae7af672513e","observation_id":"4e0a86c4-1e90-4608-a32b-51607dc6f42f","resolution":{"observed_at":"2026-07-30T19:35:40.315682Z","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-07-30T19:35:40.319155Z","title":"Chaining","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.319155Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:1a06e18e994b40b1c108b4614a04a86b84eca3b5bb0d7a5866eebebc720cbc72","observation_id":"3c2bcb03-7b79-4648-8857-45f449e68ab8","resolution":{"observed_at":"2026-07-30T19:35:40.319155Z","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-07-30T19:35:40.322159Z","title":"The Strength of Weak Learnability (Extended Abstract)","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.322159Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:6dc458c7939f53a64276ed16c9c1dd93770f0c96d71a766add51e3305f3886e7","observation_id":"d6495462-cba8-4677-8032-cd2c614d3af3","resolution":{"observed_at":"2026-07-30T19:35:40.322159Z","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-07-30T19:35:40.325339Z","title":"Schapire and Yoav Freund.Boosting: Foundations and Algorithms","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.325339Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:6fccaa93cba8fa3eb0049c52267ab9210f005c1fbe26dd10a43aa15d71eeade3","observation_id":"cb50ec24-3b8c-46d6-a595-92c7daeecba5","resolution":{"observed_at":"2026-07-30T19:35:40.325339Z","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-07-30T19:35:40.328460Z","title":"Improved boosting algorithms using confidence-rated pre- dictions","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.328460Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:48d52f9929bb3ffd88a7cb2563f23210cd1d2725db33278312ca1208bd4bcc28","observation_id":"45d7fc47-6b8e-4a63-b3a7-b7117400c25d","resolution":{"observed_at":"2026-07-30T19:35:40.328460Z","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-07-30T19:35:40.331628Z","title":"Smooth Boosting and Learning with Malicious Noise","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.331628Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:703997531ad4d948979fe01b7e5933d145f47b9777b72619b01ac133a823ee46","observation_id":"6af820f7-ef7c-4c50-bb5d-b22e7830bd6d","resolution":{"observed_at":"2026-07-30T19:35:40.331628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-07-30T19:35:40.334534Z","title":"Smoothness, Low-Noise and Fast Rates","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.334534Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:21a01b42927f36f923685fb35593bad40648d543f0e56e5117ca27f955028551","observation_id":"f19a6159-0fc2-4790-b4ce-92768b5bde74","resolution":{"observed_at":"2026-07-30T19:35:40.334534Z","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-07-30T19:35:40.337848Z","title":"A Theory of the Learnable","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.337848Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:72985bf2ac8875143d4ce4e6af67f1645ff708c901a0a4e32441c9bdd88165d8","observation_id":"04a75352-a130-44d1-9b53-720174798a3b","resolution":{"observed_at":"2026-07-30T19:35:40.337848Z","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-07-30T19:35:40.341295Z","title":"On the uniform convergence of relative frequencies of events to their probabilities","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.341295Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:e925a8b6599886d41133f4a4e3e83a34a52fe16dd06e3707125ffd338b99c7c3","observation_id":"8c9214d8-d6e9-42aa-850f-6d47e6df8067","resolution":{"observed_at":"2026-07-30T19:35:40.341295Z","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-07-30T19:35:40.283997Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.283997Z"},"links":{"citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:8a5505376da4b4507236b3ec3d26f741b1c221bb545d1a06164ba7a7a29931f7","observation_id":"b65ed83b-96ab-47d9-861c-469ae3e037a0","resolution":{"observed_at":"2026-07-30T19:35:40.283997Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T01:29:46.965057Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":50},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2607.26838."}