{"as_of":"2026-08-10T07:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:718e4e940c01b2cd64d09548132eef8ee36aa2504f305603a6b9ca43e88233e0","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:34:30.560906Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2508.08413/citation-record","integrity":"/paper/2508.08413/integrity","json":"/paper/2508.08413/citation-record.json","paper":"/paper/2508.08413"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.06971","last_updated":"2018-03-19T15:02:15Z","snapshot_observed_at":"2026-07-06T06:29:04.031745Z","submitted_at":"2018-03-19T15:02:15Z","title":"What Doubling Tricks Can and Can't Do for Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.06971","snapshot_observed_at":"2026-08-05T21:34:28.978718Z","title":"What doubling tricks can and can’t do for multi-armed bandits.arXiv preprint arXiv:1803.06971,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.978718Z"},"links":{"cited_paper":"/paper/1803.06971","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:e128027dac6e177dbaf23b24d644977eb893af66416e3fa17671dbed0eaf10c6","observation_id":"5655493b-3f9c-4aad-bb32-617292eccf8e","resolution":{"observed_at":"2026-08-05T21:34:28.978718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12612","last_updated":"2024-01-25T02:31:43Z","snapshot_observed_at":"2026-08-10T01:45:29.469515Z","submitted_at":"2022-11-22T22:24:28Z","title":"Transfer Learning for Contextual Multi-armed Bandits","version":2},"cited_work":{"arxiv_id":"2211.12612","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.12612","snapshot_observed_at":"2026-08-05T21:34:31.372722Z","title":"Transfer Learning for Contextual Multi-armed Bandits","venue":"stat.ML","work_id":"ab5829c2-7555-4497-8a5d-cc16448ac37c","year":2022},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.094483Z"},"links":{"cited_paper":"/paper/2211.12612","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:622aae35f9454dc8920dc2c2ee0169c148454d8151528ae5bae8c1c8aedb41a4","observation_id":"d39d22c6-38e4-4380-9d43-94dacf5e8240","resolution":{"observed_at":"2026-08-05T21:34:31.458090Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T21:34:29.235518Z","title":"Leveraging (biased) information: Multi-armed bandits with offline data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.235518Z"},"links":{"citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:cd1ae2e36651862a5b7425acabd71fa26b9dbaa5e8c9ebf914237ce7f5202f79","observation_id":"20778f5a-b127-40ca-b80e-33bebfcbb05b","resolution":{"observed_at":"2026-08-05T21:34:29.235518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.15921","last_updated":"2022-07-12T06:20:26Z","snapshot_observed_at":"2026-08-09T00:13:47.132454Z","submitted_at":"2022-05-31T16:10:23Z","title":"Online Meta-Learning in Adversarial Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":"2205.15921","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.15921","snapshot_observed_at":"2026-08-05T21:34:30.831458Z","title":"Online Meta-Learning in Adversarial Multi-Armed Bandits","venue":"cs.LG","work_id":"99113fb3-fe48-44bc-a28e-0dd03e5de8f3","year":2022},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.733899Z"},"links":{"cited_paper":"/paper/2205.15921","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:b25256e4bac1b26d804a593c271997fa35ef2b0bcbda95811d7492cb9bd6aa6b","observation_id":"cf45d9dc-deaf-4358-abb9-216f84744679","resolution":{"observed_at":"2026-08-05T21:34:30.919358Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08259","last_updated":"2025-03-10T16:30:27Z","snapshot_observed_at":"2026-08-09T13:41:42.049432Z","submitted_at":"2025-02-12T10:05:25Z","title":"Balancing optimism and pessimism in offline-to-online learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08259","snapshot_observed_at":"2026-08-05T21:34:29.944064Z","title":"Balancing optimism and pessimism in offline-to-online learning.arXiv preprint arXiv:2502.08259,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.944064Z"},"links":{"cited_paper":"/paper/2502.08259","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:ee1ab8a433c7dce8459a047476ac6884dbffc5fb850293be52611e6a6b0ef4c2","observation_id":"304b8f12-fdd3-4811-a784-943619dfdac6","resolution":{"observed_at":"2026-08-05T21:34:29.944064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.04974","last_updated":"2023-07-20T13:11:13Z","snapshot_observed_at":"2026-07-06T14:16:17.263268Z","submitted_at":"2022-11-09T15:39:32Z","title":"Leveraging Offline Data in Online Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.04974","snapshot_observed_at":"2026-08-05T21:34:30.394721Z","title":"Leveraging offline data in online reinforcement learning.arXiv preprint arXiv:2211.04974,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:30.394721Z"},"links":{"cited_paper":"/paper/2211.04974","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:936fbc9fdb969a27d14d8d2986fb95f34affd2a9608625efa1095183780cdcd7","observation_id":"646788d6-5594-40d9-a671-2ba2e2fb386a","resolution":{"observed_at":"2026-08-05T21:34:30.394721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23165","last_updated":"2025-05-29T06:58:49Z","snapshot_observed_at":"2026-08-09T13:40:11.410845Z","submitted_at":"2025-05-29T06:58:49Z","title":"Best Arm Identification with Possibly Biased Offline Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23165","snapshot_observed_at":"2026-08-05T21:34:30.560906Z","title":"Best arm identification with possibly biased offline data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:30.560906Z"},"links":{"cited_paper":"/paper/2505.23165","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:809abe20d0f03893bdaab48db1e2d1537df397fde16f810f64d7cbfb3b94e5fa","observation_id":"c43d2d3a-9d8b-4a65-b27d-f08ea8f332e2","resolution":{"observed_at":"2026-08-05T21:34:30.560906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14128","last_updated":"2022-05-27T17:40:32Z","snapshot_observed_at":"2026-08-09T00:13:43.134383Z","submitted_at":"2022-05-27T17:40:32Z","title":"Meta-Learning Adversarial Bandits","version":1},"cited_work":{"arxiv_id":"2205.14128","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.14128","snapshot_observed_at":"2026-08-05T21:34:31.588762Z","title":"Meta-Learning Adversarial Bandits","venue":"cs.LG","work_id":"e5f579b3-2a70-4aed-81d5-12a36e6c120d","year":2022},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.497123Z"},"links":{"cited_paper":"/paper/2205.14128","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:7de792763351c8a3f1c46980c2f14d579a6a51fb8d2da28fd49a0b8e2d5e458f","observation_id":"740e932a-1f0b-4b67-9824-4e70b049ec78","resolution":{"observed_at":"2026-08-05T21:34:31.670509Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17324","last_updated":"2025-09-02T02:16:56Z","snapshot_observed_at":"2026-07-06T18:20:39.922334Z","submitted_at":"2024-05-27T16:23:34Z","title":"Leveraging Offline Data in Linear Latent Contextual Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17324","snapshot_observed_at":"2026-08-05T21:34:29.314573Z","title":"Leveraging offline data in linear latent bandits.arXiv preprint arXiv:2405.17324,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.314573Z"},"links":{"cited_paper":"/paper/2405.17324","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:fe31a7c0d7fcab7c6625b3fa002e0d8ebc7a06107ee05590a2ec0b49b29ef33d","observation_id":"2cdf827e-46dd-4e3d-abe5-0fefb13351d1","resolution":{"observed_at":"2026-08-05T21:34:29.314573Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09574","last_updated":"2025-05-16T04:56:04Z","snapshot_observed_at":"2026-07-06T18:30:41.802045Z","submitted_at":"2024-06-13T20:25:52Z","title":"Online Bandit Learning with Offline Preference Data for Improved RLHF","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09574","snapshot_observed_at":"2026-08-05T21:34:28.208406Z","title":"Online bandit learning with offline preference data.arXiv preprint arXiv:2406.09574,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.208406Z"},"links":{"cited_paper":"/paper/2406.09574","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:d210067b22b3649df8f84f855c4b31d49927be4bfab34ee19b6c49b52fbb24ce","observation_id":"999b1d41-92d8-4b78-9603-c90c16f0dd28","resolution":{"observed_at":"2026-08-05T21:34:28.208406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09048","last_updated":"2023-06-15T11:12:35Z","snapshot_observed_at":"2026-07-06T15:42:56.285045Z","submitted_at":"2023-06-15T11:12:35Z","title":"Optimal Best-Arm Identification in Bandits with Access to Offline Data","version":1},"cited_work":{"arxiv_id":"2306.09048","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.09048","snapshot_observed_at":"2026-08-05T21:34:31.774021Z","title":"Optimal Best-Arm Identification in Bandits with Access to Offline Data","venue":"cs.LG","work_id":"863f0f00-ad3a-41b2-b065-3383d39f0ca8","year":2023},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.335175Z"},"links":{"cited_paper":"/paper/2306.09048","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:b937d481c0ca5b8c2ad058e91e19fcbc5f29dd5497ca64226b3a90ea53f6f2fd","observation_id":"71bd113b-88f0-4ca3-a984-ec12b73c2e29","resolution":{"observed_at":"2026-08-05T21:34:31.872381Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10282","last_updated":"2023-05-17T15:17:23Z","snapshot_observed_at":"2026-08-10T04:58:35.765387Z","submitted_at":"2023-05-17T15:17:23Z","title":"Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2305.10282","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.10282","snapshot_observed_at":"2026-08-05T21:34:31.000857Z","title":"Reward-agnostic Fine-tuning: Provable Statistical Benefits of Hybrid Reinforcement Learning","venue":"cs.LG","work_id":"e072ba2e-8f25-4710-8584-b026d92f8d7d","year":2023},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.418727Z"},"links":{"cited_paper":"/paper/2305.10282","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:f5661e3358e6e8e2dbae17410cd6d85b03c2091d0cb9710a8dfa8ca8ae7afd30","observation_id":"412ddb58-3fe5-4cfd-84a0-dfdd76f85eca","resolution":{"observed_at":"2026-08-05T21:34:31.049836Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.06718","last_updated":"2023-03-11T11:47:54Z","snapshot_observed_at":"2026-08-02T06:10:04.416926Z","submitted_at":"2022-10-13T04:19:05Z","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.06718","snapshot_observed_at":"2026-08-05T21:34:30.243849Z","title":"Hybrid rl: Using both offline and online data can make rl efficient.arXiv preprint arXiv:2210.06718,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:30.243849Z"},"links":{"cited_paper":"/paper/2210.06718","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:e780d45618cdab3d0c34bb22c36f3695e4dd45dc371107de77875c16e3ae56db","observation_id":"54d71233-b41f-407d-9024-bd9fa7794d14","resolution":{"observed_at":"2026-08-05T21:34:30.243849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06790","last_updated":"2023-04-20T21:35:31Z","snapshot_observed_at":"2026-07-06T09:28:16.483371Z","submitted_at":"2020-06-11T20:19:41Z","title":"On Frequentist Regret of Linear Thompson Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.06790","snapshot_observed_at":"2026-08-05T21:34:29.277153Z","title":"On worst-case regret of linear thompson sampling.arXiv preprint arXiv:2006.06790,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.277153Z"},"links":{"cited_paper":"/paper/2006.06790","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:ef6db8cd7e876bd8413242d1941c25f3859553009638e923025ec043c1e91832","observation_id":"a9dcd4b8-2629-4e3d-adee-59b9053a8190","resolution":{"observed_at":"2026-08-05T21:34:29.277153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.04782","last_updated":"2021-08-10T16:52:52Z","snapshot_observed_at":"2026-08-09T01:38:34.093606Z","submitted_at":"2021-08-10T16:52:52Z","title":"Bandit Algorithms for Precision Medicine","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.04782","snapshot_observed_at":"2026-08-05T21:34:29.559992Z","title":"Bandit algorithms for precision medicine.arXiv preprint arXiv:2108.04782,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.559992Z"},"links":{"cited_paper":"/paper/2108.04782","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:6b1ba2b2e11d2e5386289655d98d09d168704f795059c5610af56744c7d825ca","observation_id":"fe62eb4f-92a2-4514-a7ef-158472a4406b","resolution":{"observed_at":"2026-08-05T21:34:29.559992Z","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-05T21:34:32.007912Z","title":"Some aspects of the sequential design of experiments","venue":null,"work_id":"1f3d258c-58b9-4fad-9897-260efca88e60","year":2026},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:29.828771Z"},"links":{"citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:8c0a5a832399e38fb1a0278fd862d3b85456c9649c01cf4c597890f76c6e8523","observation_id":"8ba8ead0-4718-4759-9bea-5837bfe5d9eb","resolution":{"observed_at":"2026-08-05T21:34:32.069251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.02948","last_updated":"2023-05-31T10:52:56Z","snapshot_observed_at":"2026-08-09T00:12:49.246866Z","submitted_at":"2023-02-06T17:30:22Z","title":"Efficient Online Reinforcement Learning with Offline Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.02948","snapshot_observed_at":"2026-08-05T21:34:28.644931Z","title":"Efficient online reinforcement learning with offline data.arXiv preprint arXiv:2302.02948,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.644931Z"},"links":{"cited_paper":"/paper/2302.02948","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:a068054e03bb9926fe4918594007265ffd041c486ed4f0d322907ae6334fca68","observation_id":"19b8f177-1080-4532-812f-1a5351fb1d6d","resolution":{"observed_at":"2026-08-05T21:34:28.644931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00025","last_updated":"2025-03-19T13:51:24Z","snapshot_observed_at":"2026-07-06T13:58:22.032846Z","submitted_at":"2022-09-30T18:03:31Z","title":"Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.00025","snapshot_observed_at":"2026-08-05T21:34:28.800001Z","title":"Artificial replay: a meta-algorithm for harnessing historical data in bandits.arXiv preprint arXiv:2210.00025,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:28.800001Z"},"links":{"cited_paper":"/paper/2210.00025","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:afc33624242f5d9efddb578d7b956f40ee1b0a3377177482289aabe84227386f","observation_id":"14dc6f08-35d7-4a9c-b466-d592d75e5a64","resolution":{"observed_at":"2026-08-05T21:34:28.800001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08405","last_updated":"2024-10-28T01:20:42Z","snapshot_observed_at":"2026-08-04T11:45:35.159629Z","submitted_at":"2020-02-19T19:36:43Z","title":"Bandits with Mean Bounds","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08405","snapshot_observed_at":"2026-08-05T21:34:30.062073Z","title":"Warm starting bandits with side information from confounded data.arXiv preprint arXiv:2002.08405,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:30.062073Z"},"links":{"cited_paper":"/paper/2002.08405","citing_paper":"/paper/2508.08413"},"observation_digest":"sha256:a1e69617a73a0dc2a396364c56822f96998cff9dc27abad3c79c4dc7ee598a0b","observation_id":"ce2bea9f-586e-443c-ac30-d1b65fea1109","resolution":{"observed_at":"2026-08-05T21:34:30.062073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.08413","last_updated":"2025-08-11T19:07:30Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T17:22:10.676539Z","submitted_at":"2025-08-11T19:07:30Z","title":"Decentralized Relaxed Smooth Optimization with Gradient Descent Methods"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":5,"verified_fuzzy":1},"total_outbound_references":19},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2508.08413."}