{"as_of":"2026-08-17T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af8468f1e8fea39b630eb6341cc1c23b10991adfe2c7e0c769b798470d3d7210","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:47:31.420221Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2501.11127/citation-record","integrity":"/paper/2501.11127/integrity","json":"/paper/2501.11127/citation-record.json","paper":"/paper/2501.11127"},"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-10T18:47:32.109741Z","title":"Stochastic convex optimization with bandit feedback","venue":null,"work_id":"ef85ef76-a464-4073-99b2-928b28cfdc87","year":2013},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.288474Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:383040eafcb1e4be77a44aa95ca265a76662372a9b290a39abdda9c65e4acf15","observation_id":"8a00f95a-69ab-4989-ae06-726ff8e79999","resolution":{"observed_at":"2026-08-10T18:47:32.115062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.092024Z","title":"Matrix Analysis, volume 169","venue":null,"work_id":"5f1c344f-71a4-407f-846f-7021fe05cf5c","year":1997},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.294344Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:87bdea02251ab020f8ff4a19c728aafc7ab9e8e9c41b0534ca1da7e88b7df6f9","observation_id":"fa6a41ef-97d9-4200-8702-20aee9e4ab17","resolution":{"observed_at":"2026-08-10T18:47:32.097558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.074726Z","title":"Exploratory distributions for convex functions","venue":null,"work_id":"ebb58bd1-b8bd-40b5-a303-dacd33f1aa5c","year":2018},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.300226Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:e53479dc308130c5b52f90a35d56b3ec8b6241ac7421c6fcd8df5f0f37adcde6","observation_id":"5505b29e-1e18-473f-bd25-90ca380f67cd","resolution":{"observed_at":"2026-08-10T18:47:32.080197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.057723Z","title":"Bandit convex optimization: T regret in one dimension","venue":null,"work_id":"e0fd0d92-7dd7-43d6-878f-3ebd55bccb1f","year":2015},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.306154Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:4ec3df96d1515b49ee1f8bd70aa34d4ec7b34cb9ab3e57bd381083d2885200b3","observation_id":"a2510bda-8ca8-4b6e-aaba-d1981e75b24b","resolution":{"observed_at":"2026-08-10T18:47:32.063446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.040010Z","title":"Kernel-based methods for bandit convex optimization","venue":null,"work_id":"781629c9-d863-42b5-b462-046b59d0259f","year":2021},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.311602Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:6a808a930bb8da8b56e0d641e94f0864a7d1eaec9c1e80a3098a0cd68606539c","observation_id":"3b5793e5-e3d5-4ec6-9916-0a8809aa5155","resolution":{"observed_at":"2026-08-10T18:47:32.045863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.022672Z","title":"About stein's estimators: the original result and extensions","venue":null,"work_id":"192edb97-afb1-4257-b721-93d65ebe1919","year":2019},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.317031Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:083469bb3b70e018478d23d1a217720849147281a9807fdd9a4d35c971a07744","observation_id":"5159e7bc-289f-4612-8a16-1b368aee52f0","resolution":{"observed_at":"2026-08-10T18:47:32.028263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:32.005473Z","title":"Error bounds, quadratic growth, and linear convergence of proximal methods","venue":null,"work_id":"5fb0a53b-0fc4-407f-bba3-6ed18e452b8f","year":2018},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.323073Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:b0af6c229d793477560396e653fcc578ebcc0e0ff424ca5cc32507b2134a8a21","observation_id":"5e9734ec-48ed-48d5-8d5e-de713fc865bd","resolution":{"observed_at":"2026-08-10T18:47:32.010653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.988412Z","title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","venue":null,"work_id":"cdb473e1-c079-41c8-ae5f-6f06b80ea0ce","year":2005},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.328426Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:89f3afeffde5c1d79908a6956c512d5c2db6d5a9f228caf34dac909d97b28de0","observation_id":"5eb49211-f413-43c3-8ed1-b79f42cd8410","resolution":{"observed_at":"2026-08-10T18:47:31.994347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06506","last_updated":"2024-06-10T17:44:11Z","snapshot_observed_at":"2026-08-16T13:44:26.909661Z","submitted_at":"2024-06-10T17:44:11Z","title":"Online Newton Method for Bandit Convex Optimisation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06506","snapshot_observed_at":"2026-08-10T18:47:31.333738Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.333738Z"},"links":{"cited_paper":"/paper/2406.06506","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:e51591d068615fd290837170664fe44e9c30ec2b48b2d21f0e5869615590d2ef","observation_id":"53530536-c536-4b3a-a37f-aeebea89a7b5","resolution":{"observed_at":"2026-08-10T18:47:31.333738Z","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-10T18:47:31.970899Z","title":"Bandit convex optimization: Towards tight bounds","venue":null,"work_id":"b8781fd5-a126-495d-a240-a5c40e4ab290","year":2014},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.339406Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:8d558a59cda65d5ab49d1dc4fe6ab954930660051797d2a9e958c141eca8a4d6","observation_id":"d86d558b-3698-46da-bc32-6e6cd5b78e84","resolution":{"observed_at":"2026-08-10T18:47:31.976490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.953448Z","title":"Logarithmic regret algorithms for online convex optimization","venue":null,"work_id":"a7e338fd-97dd-42f4-a627-0e8864153d31","year":2007},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.345065Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:0d021d2f42b863a0093339037066d1d40806ac7557deba20bd7701bfd971131e","observation_id":"f2a88bc0-c309-4072-b628-496f951923a4","resolution":{"observed_at":"2026-08-10T18:47:31.958529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.06293","last_updated":"2020-06-11T09:58:01Z","snapshot_observed_at":"2026-08-16T02:10:36.567075Z","submitted_at":"2020-06-11T09:58:01Z","title":"Multiplicative noise and heavy tails in stochastic optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.06293","snapshot_observed_at":"2026-08-10T18:47:31.350576Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.350576Z"},"links":{"cited_paper":"/paper/2006.06293","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:e59c55b1a043a480f15057a76d6cd00980beebaaf337bb8d3bc932ce041e70e1","observation_id":"dedcc0ab-677a-4733-9d11-1a8ac8e65ff1","resolution":{"observed_at":"2026-08-10T18:47:31.350576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.04636","last_updated":"2020-09-12T23:03:52Z","snapshot_observed_at":"2026-08-17T04:15:09.069318Z","submitted_at":"2016-08-16T15:28:24Z","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","version":4},"cited_work":{"arxiv_id":"1608.04636","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.04636","snapshot_observed_at":"2026-08-10T18:47:31.820793Z","title":"Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-\\L{}ojasiewicz Condition","venue":"cs.LG","work_id":"ee4a0fda-6a53-4f3d-9197-afa34a3ece2f","year":2016},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.356457Z"},"links":{"cited_paper":"/paper/1608.04636","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:eb76ffa1b6290968e78e084167130e5a746af8888f8157c5eddab9c6268be6e2","observation_id":"ad548936-48bd-48a8-9420-2dfab850e12f","resolution":{"observed_at":"2026-08-10T18:47:31.826698Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.936290Z","title":"Nearly tight bounds for the continuum-armed bandit problem","venue":null,"work_id":"c15201fb-27f0-4226-8375-8b0314fb6199","year":2005},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.362249Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:961ecf89c24dc369272e90b63dbd040281ed14c5223facc8dd7a9c31684699e6","observation_id":"4f4402e2-6d30-4d1b-9249-f4fe2b2a67c1","resolution":{"observed_at":"2026-08-10T18:47:31.941785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.920479Z","title":"Improved regret for zeroth-order adversarial bandit convex optimisation","venue":null,"work_id":"cdfe0673-e7b1-4586-b676-c254ca571e10","year":2020},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.367316Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:7d7249efaa92d0111284701d341accf3cd9dfecb818f1f558a481d75a8992682","observation_id":"1d0de14b-1be7-4e75-8b87-d522312a4893","resolution":{"observed_at":"2026-08-10T18:47:31.925550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.372518Z","title":"Bandit convex optimisation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.372518Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:23dd62c51ea81b00e2b002f5c6a038735b90d1f84fda388df8f8720200be955f","observation_id":"d548b7e9-3419-4c44-8fb8-8c51cf0b491e","resolution":{"observed_at":"2026-08-10T18:47:31.372518Z","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-10T18:47:31.904293Z","title":"Improved regret for zeroth-order stochastic convex bandits","venue":null,"work_id":"8e866dcc-92e3-4923-a96b-c1d58e54d634","year":2021},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.378215Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:386eba71ad8515bc9449f65a220c5e9d6cca39c5d81833095a3272ea4462cfa3","observation_id":"ad5bd9f5-a82a-4eb8-8d71-1813b79cb9f6","resolution":{"observed_at":"2026-08-10T18:47:31.909683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05371","last_updated":"2023-02-10T16:49:58Z","snapshot_observed_at":"2026-08-16T15:56:12.424364Z","submitted_at":"2023-02-10T16:49:58Z","title":"A Second-Order Method for Stochastic Bandit Convex Optimisation","version":1},"cited_work":{"arxiv_id":"2302.05371","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.05371","snapshot_observed_at":"2026-08-10T18:47:31.725513Z","title":"A Second-Order Method for Stochastic Bandit Convex Optimisation","venue":"cs.LG","work_id":"1a859968-3ccf-4e34-9412-c6df78eb6df3","year":2023},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.383279Z"},"links":{"cited_paper":"/paper/2302.05371","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:822d083f8792993070d65b5375f037bdf5b291afbd3f9b8f8e822fa39bd0f6dd","observation_id":"0c97228c-7b08-4716-8d38-7f6b1c2933a0","resolution":{"observed_at":"2026-08-10T18:47:31.731469Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.389011Z","title":"Adaptive estimation of a quadratic functional by model selection","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.389011Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:9b30a764e1ae86e49c7c471226d0696bcbf00d15220d3bc90d07a7c6497e62c6","observation_id":"f47c4bf1-bb2c-497b-814e-40f55a81cd50","resolution":{"observed_at":"2026-08-10T18:47:31.389011Z","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":"2402.12042","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:47:31.605178Z","title":"Linear bandits with polylogarithmic minimax regret","venue":null,"work_id":"598e7002-d58d-4557-9c73-51c6e5ca9e4b","year":2024},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.395064Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:93b60196bd192ec4df55362bd85f5ab267e9187ef2142494fa4d572487458c23","observation_id":"a7a992e5-2b93-448e-8c08-ae741c4b6eb9","resolution":{"observed_at":"2026-08-10T18:47:31.614518Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.400109Z","title":"Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.400109Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:6b18c78a022f2c5c921095d6f6249eb1500b50597c1ca15544e46ace9123a493","observation_id":"e220e9d8-a5d3-48d7-9683-06a9b2debaa4","resolution":{"observed_at":"2026-08-10T18:47:31.400109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02476","last_updated":"2024-10-07T17:15:37Z","snapshot_observed_at":"2026-08-16T13:12:58.517706Z","submitted_at":"2024-10-03T13:35:08Z","title":"Online Convex Optimization with a Separation Oracle","version":2},"cited_work":{"arxiv_id":"2410.02476","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.02476","snapshot_observed_at":"2026-08-10T18:47:31.504221Z","title":"Online Convex Optimization with a Separation Oracle","venue":"cs.LG","work_id":"e706a21e-23eb-4cec-8729-418e553d0bf5","year":2024},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.405199Z"},"links":{"cited_paper":"/paper/2410.02476","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:2778709d5c433acd46397d9e13c7b2011b727cf766caef03360affc5a8524220","observation_id":"2eea8380-015a-4695-b841-62cf49fc84c7","resolution":{"observed_at":"2026-08-10T18:47:31.509662Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.887163Z","title":"Estimation of the mean of a multivariate normal distribution","venue":null,"work_id":"41302d64-4e63-44c2-8e53-509e203c436d","year":1981},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.410206Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:ac7899b087c7f4d1a5200acaac5aed4a486b70506c093f40de8167389c3ce977","observation_id":"8e0913a0-9527-486c-8853-329798f627c2","resolution":{"observed_at":"2026-08-10T18:47:31.892544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08929","last_updated":"2024-10-03T04:08:17Z","snapshot_observed_at":"2026-08-16T14:18:47.218683Z","submitted_at":"2024-02-14T04:03:38Z","title":"Second Order Methods for Bandit Optimization and Control","version":2},"cited_work":{"arxiv_id":"2402.08929","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.08929","snapshot_observed_at":"2026-08-10T18:47:31.474285Z","title":"Second Order Methods for Bandit Optimization and Control","venue":"cs.LG","work_id":"bdc846ba-3c7a-40f2-bf69-e63a79ad7d84","year":2024},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.415052Z"},"links":{"cited_paper":"/paper/2402.08929","citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:e550a7a17c0819f551ba0ecc2216d6b20904295c22577278a0220039964ca53b","observation_id":"37c8e916-9fbb-46fa-9878-5ccd7f3f634d","resolution":{"observed_at":"2026-08-10T18:47:31.481964Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T18:47:31.420221Z","title":"High-dimensional probability: An introduction with applications in data science, volume 47","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T18:47:31.420221Z"},"links":{"citing_paper":"/paper/2501.11127"},"observation_digest":"sha256:ec4ce86db74a376440031dce072252c3b2a31cf726b058e42ecb5c7d689bf402","observation_id":"6823c170-cbc8-4b6c-af68-25f99a92c1cb","resolution":{"observed_at":"2026-08-10T18:47:31.420221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.11127","last_updated":"2025-01-19T17:35:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T17:02:55.243070Z","submitted_at":"2025-01-19T17:35:45Z","title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":5,"verified_fuzzy":14},"total_outbound_references":25},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2501.11127."}