{"as_of":"2026-08-18T14:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ddab46bcd3d7a25e1308591c90600add5a1117e99706d3922a7a7e1b2a36311","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:08:28.246021Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:23:35.021762Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T18:16:14.067578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"cited_work":{"arxiv_id":"1909.02187","doi":"10.48550/arxiv.1909.02187","metadata_source":"pith","pith_arxiv_id":"1909.02187","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","venue":"cs.LG","work_id":"30f3fce9-0ad9-468b-a022-0c60716a953e","year":2019},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.021762Z"},"links":{"cited_paper":"/paper/1909.02187","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:df1fcb7bd5fd99dff8360aeffe07053b4980b0ac2edfb6977f08cdd189e24a6f","observation_id":"e4543079-e8f6-4fd7-a467-6b5e0e3e6486","resolution":{"observed_at":"2026-08-15T16:23:35.490202Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.02187/citation-record","integrity":"/paper/1909.02187/integrity","json":"/paper/1909.02187/citation-record.json","paper":"/paper/1909.02187"},"outbound":[{"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:08:30.099057Z","title":"A closer look at adaptive regret","venue":null,"work_id":"34c85912-0f4f-4acf-b7d9-4067a87863bc","year":2016},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.017580Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:3b5d85294db9d952b0119351e90bfdf2927f6e21ca2d3a969001593aa5b1f17a","observation_id":"5c7bd74d-2375-4d9f-af9a-7114fecab8c2","resolution":{"observed_at":"2026-08-14T05:08:30.104747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.995272Z","title":"Tracking a small set of experts by mixing past posteriors","venue":null,"work_id":"7c7cc085-ba15-49b8-a237-a2d4f2eab0fe","year":2002},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.113448Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:a1c7bca47998bea3b9b29ef3d45fa093efed002419e905322c3c17765075a0fe","observation_id":"1874a1f6-395c-49ee-b852-a837d71abd35","resolution":{"observed_at":"2026-08-14T05:08:30.043330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:27.123935Z","title":"Convex Optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.123935Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:7d0e87fb254706454167bf23113f258d3ad35ac9501f9d68bc4be6db75389c21","observation_id":"87a5a41c-d34f-4aa8-bee5-6660f8846c3c","resolution":{"observed_at":"2026-08-14T05:08:27.123935Z","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:08:29.831128Z","title":"Improved path-length regret bounds for bandits","venue":null,"work_id":"035d6c04-a36d-4e8a-8bce-f1c699d9b29e","year":2019},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.181545Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:aa06f3b5acb045273c3cd076b2a456338ed8ae30f4f483557b3db0fc1e497b4b","observation_id":"66f34312-3245-4b0d-83c7-43e8dd2d27e9","resolution":{"observed_at":"2026-08-14T05:08:29.933205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:27.212359Z","title":"Prediction, Learning, and Games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.212359Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:724464b9f8c224863a2585e544426400d613a36c6017945db0b7ff0fb7671dc3","observation_id":"3a96a247-2dfe-4d5c-a054-fbebe9aea318","resolution":{"observed_at":"2026-08-14T05:08:27.212359Z","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:08:29.809330Z","title":"Improved second-order bounds for prediction with expert advice","venue":null,"work_id":"cbf6bbd2-8652-460e-be23-abf478722521","year":2005},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.216823Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:1156adc012ec550adacd034cee5c6536c61bc69ae02a528e3039b0fea4df4473","observation_id":"45d77ab5-35ca-4fa3-a41b-c9049f6acce5","resolution":{"observed_at":"2026-08-14T05:08:29.814394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.761094Z","title":"Mirror descent meets fixed share (and feels no regret)","venue":null,"work_id":"f05b4d9b-68af-4bd2-a887-07119d02d61f","year":2012},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.221233Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:c254106280b50a07e7dd1b4efec987c328dc95765e508b161de11ce2886f3843","observation_id":"501c023c-d79c-496b-b1ec-fbd700a6a12c","resolution":{"observed_at":"2026-08-14T05:08:29.766298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.749084Z","title":"Online optimization with gradual variations","venue":null,"work_id":"2d5177df-f988-4038-91c3-6186e260e7fc","year":2012},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.224881Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:a6bc002a860edfd30132667dc90eea41a33ad3595d8788c4ffc289f89db4922b","observation_id":"c12e1f5a-0b94-4656-a878-607b7399a834","resolution":{"observed_at":"2026-08-14T05:08:29.752773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.713013Z","title":"A decision-theoretic generalization of on-line learning and an application to boosting","venue":null,"work_id":"57eadc5b-bb58-4d70-b20e-37f997325aae","year":1997},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.286898Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:b6964a1c072a58bacc52b8df8a7c0014601e5372ca3074170658c9861d0d3f1e","observation_id":"a6084240-632a-4d38-bdb9-106afbc00477","resolution":{"observed_at":"2026-08-14T05:08:29.737892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.656176Z","title":"A second-order bound with excess losses","venue":null,"work_id":"4c2d2584-00dc-4fc9-891d-59bcc0b36b30","year":2014},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.361449Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:b2c7851491c159209ba66605bb5a34234191e17f330b18fb3d8d6ef657f00ab1","observation_id":"5b6a4f17-603c-45db-81a4-f33188a27fbd","resolution":{"observed_at":"2026-08-14T05:08:29.660713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.622271Z","title":"Lower bounds for the helmholtz function","venue":null,"work_id":"a8b1695b-6d2d-49e4-8fd6-f57ef67fa74d","year":1965},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.366383Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:ddb5684ec8b367f7d1e0e12a624bc02e26ae1072ec18ebe58249f19e7b4bff99","observation_id":"23473286-b1c8-4544-b9d6-17d0088fb2b6","resolution":{"observed_at":"2026-08-14T05:08:29.647514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.556731Z","title":"Shifting regret, mirror descent, and matrices","venue":null,"work_id":"6300498c-ea55-4c30-89b3-3971cdbc0730","year":2016},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.371881Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:d5b20a90b5cf9c1b071d5e8a5d43774f43afef7491ffb88294ee43e0f7b81a42","observation_id":"0f5f11c0-a4ff-4f9b-9914-257be5c25662","resolution":{"observed_at":"2026-08-14T05:08:29.561467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.531826Z","title":"Approximation to bayes risk in repeated play","venue":null,"work_id":"78f62e98-30b4-4804-9aa3-31aaf70604d7","year":1957},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.376901Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:c807a7b2f16cf1116691e0a757a943881df63303de23f54df1ae30d9d7329365","observation_id":"834780ef-ed38-4571-afab-90418f1711df","resolution":{"observed_at":"2026-08-14T05:08:29.548136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.451593Z","title":"Extracting certainty from uncertainty: regret bounded by variation in costs","venue":null,"work_id":"30b41f33-db0b-4783-807f-1ef71894e6af","year":2010},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.442484Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:8c0e6f41cdc153694c044b755ba5bedba21843d529dc8e0e4d03ac5973355756","observation_id":"533f11f5-2e4b-4240-b8f6-46701a7e0599","resolution":{"observed_at":"2026-08-14T05:08:29.477504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.437395Z","title":"Adaptive algorithms for online decision problems","venue":null,"work_id":"5a40738e-b0b9-41d0-9c14-a3dd266af0af","year":2007},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.447174Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:36a888fe7f810d3279f75fadbede4d73cbbf12c0e014495ff31dccd5b42c60e8","observation_id":"e32e8366-c941-4049-9390-df6c1a53720d","resolution":{"observed_at":"2026-08-14T05:08:29.441811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.362444Z","title":"Near-optimal algorithms for online matrix prediction","venue":null,"work_id":"f963b956-6ad9-43da-8cb7-79523c8f87c8","year":2012},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.451175Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:bbd36dfc60bada8747d73246a8f7c312ed9c2dba0186f2a38796616189d66f8e","observation_id":"ab75162c-6993-43c3-9d1f-4b938f1eb424","resolution":{"observed_at":"2026-08-14T05:08:29.401524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:27.455784Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.455784Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:7e2d75cb07204887153d33505a14ea798312c01de8c2f5842b9ef231796130b7","observation_id":"91456c46-f4ee-429e-905a-5fefc9c5d0a3","resolution":{"observed_at":"2026-08-14T05:08:27.455784Z","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:08:29.340727Z","title":null,"venue":null,"work_id":"1f630e35-e6bf-4378-b231-42c8535458b3","year":2001},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.541451Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:eca9fc80e62b3796d4abf20a2dfe811011caf64c5c8f3ac11feadd4f3e997277","observation_id":"ce888ccd-7adc-4090-8e1d-6cbf47012690","resolution":{"observed_at":"2026-08-14T05:08:29.345586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.256767Z","title":"Efficient algorithms for online decision problems","venue":null,"work_id":"ea130ecf-f0f8-42c0-bb1e-ba1ea6c6ea82","year":2003},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.637317Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:d44935f576d90b0482de8429e7a14424fc69523cfb17a5b93177d65f0467cb4c","observation_id":"67a6558a-d5cb-418e-8042-9f651f4509b0","resolution":{"observed_at":"2026-08-14T05:08:29.285766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.241403Z","title":"Exponentiated gradient versus gradient descent for linear predictors","venue":null,"work_id":"e1369a0b-0f03-4223-a50b-cb6e21e93d48","year":1997},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.642911Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:4b4aff3deb8789af4a4a38dafa1f3de36fc456bb776b51133346a3ad7c1916e0","observation_id":"e8537a5c-31a0-4859-a1b0-d8e3945fbb43","resolution":{"observed_at":"2026-08-14T05:08:29.247167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:29.069996Z","title":null,"venue":null,"work_id":"fa192fb2-3762-4be5-ae10-d767efeec24c","year":1994},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.775340Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:c625a958776a4077be00f135817c0dd405ed44a402e612d8bdc7b041009a0dfc","observation_id":"5281495d-0bfd-46af-a972-8674b0b4a37a","resolution":{"observed_at":"2026-08-14T05:08:29.184544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.997325Z","title":"Schapire","venue":null,"work_id":"192227a4-e526-4121-9f9f-854c46b21d2f","year":2015},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.862658Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:283b90940dbcfd2c499051ebb994d830d2a64d16e1b15d090a1bf63b8a9c85a0","observation_id":"acaa4b1c-15cc-4866-8e2a-d17a01326d23","resolution":{"observed_at":"2026-08-14T05:08:29.035013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.901575Z","title":"Online learning with predictable sequences","venue":null,"work_id":"00c68a5c-7906-4851-9252-6e7b188d5b75","year":2013},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.868100Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:d6749170843b22a704fb132608d028d2262675f9f8714979a52f491026d06ab3","observation_id":"894a8bc4-607e-4f0e-8d38-eed4954ee139","resolution":{"observed_at":"2026-08-14T05:08:28.985953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.889038Z","title":"Online Learning: Theory, Algorithms, and Applications","venue":null,"work_id":"7e02b1b1-571c-42c9-86cd-d391ed6d4a12","year":2007},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.873454Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:85eb5bff590d67daf024990d0368238f3e438b46b97257c6266c86fba1ed652b","observation_id":"dc0d919b-d373-4fef-b69c-25095b995a86","resolution":{"observed_at":"2026-08-14T05:08:28.893188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:27.976700Z","title":"Online learning and online convex optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.976700Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:e3ca9cefbe6f8d596d5ca851fb48f38ab39f2da45f10626f2d316e19239a5653","observation_id":"913cda1e-9265-4e00-8d2b-4aec0aff3507","resolution":{"observed_at":"2026-08-14T05:08:27.976700Z","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:08:28.798055Z","title":"On the universality of online mirror descent","venue":null,"work_id":"cadb38c3-e6b2-49e6-a11d-464fa316dcec","year":2011},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:27.982097Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:d08a342e86bb304732565e5aecbdf730ed3dc4cd302dc52f96e9a2b6da2fdca0","observation_id":"498b4c93-2109-4952-92b4-c93753069c1c","resolution":{"observed_at":"2026-08-14T05:08:28.802486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.693144Z","title":"Adaptivity and optimism: An improved exponentiated gradient algorithm","venue":null,"work_id":"ffe82641-e82d-4f67-acb7-ae6e38bfcb0c","year":2014},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.060680Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:6716aaae3f18917ca9693326119085e32e73b3551b362cb26b7c501470825096","observation_id":"8351b2bd-c2ae-4b24-ad44-ffb58062790a","resolution":{"observed_at":"2026-08-14T05:08:28.747081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.633316Z","title":"Inequality with applications in statistical mechanics","venue":null,"work_id":"4154183c-e8fc-4bb7-83fb-72a20d2bf1e8","year":1965},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.097280Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:74713057047b91ac35c9cdadd621e2ef58dbb425cf042c233cdb19811e13bf7c","observation_id":"2c5c61e4-b008-4b4b-9c32-662cccd7bbe3","resolution":{"observed_at":"2026-08-14T05:08:28.638576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.523887Z","title":"Matrix exponentiated gradient updates for on-line learning and bregman projection","venue":null,"work_id":"245fb195-779a-48ad-95b9-b611cb895ad8","year":2005},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.165764Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:58f47e791c433d8cbe3c25121ac41b21578814bcfa9e2826cba7c396b4abacb7","observation_id":"b4d5dee7-7d6f-46d4-b2f1-5e40ef15d2f8","resolution":{"observed_at":"2026-08-14T05:08:28.590653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.439139Z","title":null,"venue":null,"work_id":"401aa8fd-51f0-44ae-8387-fcc29f6cb2d6","year":1999},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.171010Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:27fbbd95a000341615d58647c69e02a837bcc7e470e2c7d0652ca0816d1fcb9b","observation_id":"3c90b2e8-b1bf-458e-983c-0d88c244e3f7","resolution":{"observed_at":"2026-08-14T05:08:28.486690Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.405466Z","title":null,"venue":null,"work_id":"f1f4d62d-6f99-4210-8d39-f8fc1b4d5b66","year":1990},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.174906Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:4fd592ab740114a62510a8ae581fc2b4a1894f53f425f27f7a1cc99f5d2d4a3c","observation_id":"c97fdb5a-024a-4678-9a53-3def771391f6","resolution":{"observed_at":"2026-08-14T05:08:28.410472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.337745Z","title":"More adaptive algorithms for adversarial bandits","venue":null,"work_id":"2636c6b9-de1e-4df2-a557-c975a28249f3","year":2018},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.179994Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:dbdd51f6ad98077a141a97ef47b685dfd2de67852e9bc15a266f5cbd066462d0","observation_id":"0883fa4d-3902-4270-ae05-442ad6a6f957","resolution":{"observed_at":"2026-08-14T05:08:28.381044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.287332Z","title":"Tracking the best expert in non-stationary stochastic environments","venue":null,"work_id":"4464ad4b-0648-4e30-8812-253b58823588","year":2016},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.226193Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:33f6d0910da0980c31796b1cfa4a6533a493887a49e610a2930386b8128daa59","observation_id":"701166b7-0da3-4de7-8721-83c746e772fd","resolution":{"observed_at":"2026-08-14T05:08:28.325502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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:08:28.246021Z","title":"Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung)","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T05:08:28.246021Z"},"links":{"citing_paper":"/paper/1909.02187"},"observation_digest":"sha256:001abbb4d7a8167e3c1bed4028adf3c3736e10b7d6dbcbd30315612786c1bdad","observation_id":"9c05c1fa-4193-48cc-beef-04c417aec5e3","resolution":{"observed_at":"2026-08-14T05:08:28.246021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":34},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:1909.02187."}