{"as_of":"2026-08-21T10:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5834a512711ae27f5044086e686657bc701ece06571f07364a4628e77e3e50f","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T22:03:25.861133Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.03983/citation-record","integrity":"/paper/2412.03983/integrity","json":"/paper/2412.03983/citation-record.json","paper":"/paper/2412.03983"},"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-11T22:03:29.510669Z","title":"Online learning and online convex optimization,","venue":null,"work_id":"8c3da30f-43eb-45b8-924a-e990dc70c62b","year":2012},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.002657Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:92a84269be76e9f363a48fa79eedc8eb3154d242be22fd3cac4b7596beab4f39","observation_id":"58575fea-0a4d-423d-b45b-3ee6243016cf","resolution":{"observed_at":"2026-08-11T22:03:29.554181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.378398Z","title":"Introduction to online convex optimization,","venue":null,"work_id":"6ab06d80-d7c9-4732-b033-963086f72b45","year":2016},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.023328Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:b5fb1721665cddc9a33d4feb848135f63b1378be4204507c2efcd048ecb3a29a","observation_id":"4b0d1d11-d3ea-4abb-bf47-7fbdbe9bb1e7","resolution":{"observed_at":"2026-08-11T22:03:29.399351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-11T22:03:24.078175Z","title":"A modern introduction to online learning,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.078175Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:0f16a7ae8422a03493f047c5d006a12e175d388597956af9afc6136cc760a4ff","observation_id":"3afccaca-23a5-47e9-9a4c-ed767e52dc07","resolution":{"observed_at":"2026-08-11T22:03:24.078175Z","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-11T22:03:29.354161Z","title":"An online learning approach to model predictive control,","venue":null,"work_id":"621363d7-8d98-4d94-93e7-206804663046","year":2019},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.094478Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c83052429ac213f5ed5cb835ba6e5c36cd957299277538f094ee09604e123588","observation_id":"0e37beeb-b292-4c97-9536-c00a9267be6a","resolution":{"observed_at":"2026-08-11T22:03:29.365636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.336643Z","title":"Dual Online Stein Variational Inference for Control and Dynamics,","venue":null,"work_id":"051740b9-7e57-4536-a3d5-4a3572d63bf7","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.119540Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:ab897d7d00bb1aa0edf890662392abe63a0cfb7fd602be136c74edfd1079b08e","observation_id":"0725aee2-a1ef-4aef-a706-3f077e056184","resolution":{"observed_at":"2026-08-11T22:03:29.346054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.281731Z","title":"Learning to Optimize in Model Predictive Control,","venue":null,"work_id":"73ce92e3-e6a8-499c-aad5-412616da750b","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.125959Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:adbaea2adf69529ddde61c3755e5028d3491059f470a7af0e5b5f2115b43dc64","observation_id":"240110b0-7e86-4a9e-8c50-a2368670c4b8","resolution":{"observed_at":"2026-08-11T22:03:29.314532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.129130Z","title":"An online convex optimization approach to proactive network resource allocation,","venue":null,"work_id":"90fa632e-82b5-43d1-a723-7e3f55349d24","year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.131064Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:6ad2d2b0b56d1286ab610906b23705254dca1e7c0091f21335523cee31305cde","observation_id":"11e496e9-7665-4704-bfe5-dbca059ff1b4","resolution":{"observed_at":"2026-08-11T22:03:29.191223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.113816Z","title":"Stochastic averaging for constrained optimization with application to online resource allocation,","venue":null,"work_id":"96e37639-900a-4a84-88e3-71edd468b61a","year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.136277Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:aa4dd5990a722b48e468615e6bd92c151df999126ff0f6939d07527a1d70ed95","observation_id":"83f6e471-7de9-4d21-bbd4-0fd750076e34","resolution":{"observed_at":"2026-08-11T22:03:29.120691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:29.093993Z","title":"Bregman-style online convex optimization with energyharvesting constraints,","venue":null,"work_id":"eeafa409-3a70-46af-8192-9de0cc7b5583","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.194449Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:3645318aa5f8ee9859dbd1a01372065ef0f379b312beeab1f84e00810db236c7","observation_id":"e57fb0b0-b4d3-480b-ab3b-3df7ce7204bb","resolution":{"observed_at":"2026-08-11T22:03:29.104848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.971736Z","title":"Learning-aided optimization for energy- harvesting devices with outdated state information,","venue":null,"work_id":"b65c58d7-8197-46bf-a618-aff89c57a157","year":2019},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.264184Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:59a49040ea2fb2d7e41102ffcd767b003f0dc21dec54d8765b97bfd10b4da1ca","observation_id":"d7ba2e22-24fe-4318-9cfe-b589ede76a87","resolution":{"observed_at":"2026-08-11T22:03:29.058340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.815611Z","title":"Distributed constrained online convex optimiza- tion over multiple access fading channels,","venue":null,"work_id":"8720ceb4-08ea-4ea4-9f1a-05ba5862d26d","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.287299Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:cbff9437061f161713dbcc33f24d9894abb1e86f5abd74bdf164732585f60d19","observation_id":"bc846719-0803-4e26-a8b1-b63a88217b40","resolution":{"observed_at":"2026-08-11T22:03:28.880457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.797114Z","title":"Pobo: Safe and optimal re- source management for cloud microservices,","venue":null,"work_id":"ef75cd0e-670c-4d70-a766-30849b10873e","year":2023},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.302971Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:5a1f19bddcb63f827eea24b12873fcb367db820c1839563aa0fbb7a8cef4fdff","observation_id":"399f731d-ca39-4d37-a78e-6c14be2bc773","resolution":{"observed_at":"2026-08-11T22:03:28.801203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.782720Z","title":"A virtual-queue-based algorithm for constrained online convex optimization with applications to data center resource allocation,","venue":null,"work_id":"210399fb-d55d-4d67-b215-4258ec51333a","year":2018},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.307387Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:f86ea382b2979623f4bdae64688184c5f323105afd3959ed4bfee0a4f4873f32","observation_id":"fb931117-e5af-403e-84ae-dde8653ce0a7","resolution":{"observed_at":"2026-08-11T22:03:28.788210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.769490Z","title":"Integrated online learning and adaptive control in queueing systems with uncertain payoffs,","venue":null,"work_id":"a023274e-729d-4610-843c-9131ea903e84","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.312029Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:e08c2278708914013e9f2fa711e4c154ed4f552c2c61f82c26da7f8deda57269","observation_id":"ac1a765b-a1c4-43a9-b506-490176f36f98","resolution":{"observed_at":"2026-08-11T22:03:28.774288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.756706Z","title":"Matching while learning,","venue":null,"work_id":"45384f45-97a8-47ee-b9c0-d0dcc214b34b","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.346040Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:2241d430fa556201a46aa427a4a2b4457e1f0297e291f35db9bfb4c340b90885","observation_id":"3fdf2806-243b-4e7d-90eb-6ed22abcd440","resolution":{"observed_at":"2026-08-11T22:03:28.760859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.733973Z","title":"Ad click prediction: A view from the trenches,","venue":null,"work_id":"3bd59a53-2f54-4e5a-acc6-9c32535c9dda","year":2013},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.441980Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:6662a681f65efd1ddc7d570e7537cbdde8034a669382a0ea94386d0d277306ed","observation_id":"c99ffde7-630d-449e-ac26-088787d3cb48","resolution":{"observed_at":"2026-08-11T22:03:28.740749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.671255Z","title":"Dual mirror descent for online al- location problems,","venue":null,"work_id":"2d99a445-2fa0-455a-9403-e157a7ef6b45","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.487096Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:5e4b668dd5413ed23e71fbb52503dc97a1b8f2f4ede5f30412b512015a95d35d","observation_id":"29c27596-e5bf-423b-a08e-2470781f41da","resolution":{"observed_at":"2026-08-11T22:03:28.700199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.590248Z","title":"Per- sonalized hospital admission control: A contextual learning approach,","venue":null,"work_id":"c4cd80a2-9b3c-4e62-bbba-eecce6119d3d","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.506242Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:d470108e3f741715f4a1f3b88cd76ddf54e7eba8d2fee4b83ce11fc872a2fb03","observation_id":"55e92768-2926-4b0d-b41f-b8bd12e6fb83","resolution":{"observed_at":"2026-08-11T22:03:28.641216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.577280Z","title":"Tewari and S","venue":null,"work_id":"1194d41b-8749-42f9-aedb-30384fd90796","year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.537345Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:04abd66e66d89eb1f14ce6c0ac083f6ad76e2f99a7488a21d02ef69551fcd334","observation_id":"9b2a8fa9-4bd6-4482-a06c-925d71eeaa12","resolution":{"observed_at":"2026-08-11T22:03:28.581527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.562510Z","title":"Safe online convex optimization with unknown linear safety constraints,","venue":null,"work_id":"9b1545f9-5ca7-4662-a6b6-2a63d8eb7c67","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.547230Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:567f608117cc3cc25195f8d75474b0c951231ef0b8fbcdc68df95e2fd95519e7","observation_id":"f66dc49c-9209-49d3-a2c2-bc0d1e379405","resolution":{"observed_at":"2026-08-11T22:03:28.567051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.549239Z","title":"Dynamic regret analysis of safe distributed online optimization for convex and non-convex problems,","venue":null,"work_id":"db29d7a2-b58c-4035-a470-deb36cc464dc","year":2023},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.553574Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:265159380fc1493fc31997bb2f48c3e22006046b3577a425e0d4667c982c9576","observation_id":"08bd1b88-89f1-4632-a074-4d520ed666b4","resolution":{"observed_at":"2026-08-11T22:03:28.553402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.534782Z","title":"Linear stochastic bandits under safety constraints,","venue":null,"work_id":"05f65937-7a45-4f69-a053-7c6d08c9d564","year":2019},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.558422Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:de9b62fed13813b4d2fbd9fae15ab3d752f151127acac70fe8c95afed344956d","observation_id":"baa7a134-5cbd-4c82-b603-4e2adf33adad","resolution":{"observed_at":"2026-08-11T22:03:28.539650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.408615Z","title":"Linear thompson sampling under unknown linear constraints,","venue":null,"work_id":"bee49e31-b1f0-433a-991b-c97246ca5d2c","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.599051Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c33437ea285bc4321403332c99d076404a2e030911b7b86d6a60e2720e69d3ec","observation_id":"055f11d9-5432-4586-8cc4-7b1a5daa0a2d","resolution":{"observed_at":"2026-08-11T22:03:28.526711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.353200Z","title":"Generalized linear ban- dits with safety constraints,","venue":null,"work_id":"1d2457ec-83fb-4d5d-a31c-277f2bba717a","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.649357Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:2798fdaf8854b0d44f4a3e5c3bb19631ba880028b72934f235ec7e531c7b4af3","observation_id":"e402bb19-f3aa-4676-945d-50660b51ddb4","resolution":{"observed_at":"2026-08-11T22:03:28.358020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.337910Z","title":"Safe linear thompson sampling with side information,","venue":null,"work_id":"bc5488b2-d70a-47b8-b3c6-2746d303a5ac","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.728077Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:7f4477b40fd0a4002adf4aae30a293b50f607a872f5bd19320128164afc89c18","observation_id":"a3e25078-f06b-46d8-a9d8-16d0abd44f61","resolution":{"observed_at":"2026-08-11T22:03:28.343542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.287426Z","title":"Optimistic safety for online convex optimization with unknown linear constraints,","venue":null,"work_id":"520fb274-1059-4864-a3ed-890db98f2e31","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.764306Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:ae13083dd8e0b7075205c212b5c08c1fe15d99f52d6506fd087061cc63683f8f","observation_id":"646edca0-98df-4b45-9977-45a1a524a70f","resolution":{"observed_at":"2026-08-11T22:03:28.320859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:24.775633Z","title":"Trading regret for efficiency: online convex optimization with long term constraints,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.775633Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:17fd57e2373f874d2bdea92f3932c01fe95b46a7ab573f6bb6ed46c2ba428d30","observation_id":"b42e1aa0-8931-4e90-b5ad-afadfc9a5b05","resolution":{"observed_at":"2026-08-11T22:03:24.775633Z","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-11T22:03:28.179973Z","title":"Safety-aware algorithms for adversarial contextual bandit,","venue":null,"work_id":"04a9e651-92e6-4f70-8ab7-5b460774ebd4","year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.781060Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:5e1d38372790d64692212e505fba958eb836a14e75a6b79ecd05755138475146","observation_id":"acfcb129-c599-4186-9153-1d094301803b","resolution":{"observed_at":"2026-08-11T22:03:28.192650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:24.785397Z","title":"Online convex optimization with stochas- tic constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.785397Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:519271839500e44f9ee96a0efa20bedc158d0f1eaf0268b9c41aa665f1d56d69","observation_id":"66d2d6b5-d345-43d1-9f49-da64103916eb","resolution":{"observed_at":"2026-08-11T22:03:24.785397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.04783","last_updated":"2017-02-17T01:21:12Z","snapshot_observed_at":"2026-08-14T21:16:17.911774Z","submitted_at":"2017-02-15T21:27:06Z","title":"Online Convex Optimization with Time-Varying Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-08-11T22:03:24.850466Z","title":"Online convex optimization with time-varying constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.850466Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:11d03c12d3bdf2cb33178d6d2dbc439d97055a6b8250e00808b66ae39bc3c0e9","observation_id":"bddf116a-821e-48a6-bf78-181512ddb87f","resolution":{"observed_at":"2026-08-11T22:03:24.850466Z","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-11T22:03:28.160258Z","title":"Cautious regret minimization: Online optimization with long-term budget constraints,","venue":null,"work_id":"50cdaafc-8585-4c3c-93c1-e56eb7b4c68a","year":2019},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.880699Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:db158d0b64f1bed7694afb1a3ba95c3aecff2b7efb46af64907bf7d72b342d94","observation_id":"3d75a2bc-dea7-4f1e-b1b1-0b7c5b76cfdd","resolution":{"observed_at":"2026-08-11T22:03:28.164418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.146931Z","title":"Online stochastic optimization with time-varying distributions,","venue":null,"work_id":"34956129-a241-4663-ac88-40bebff1a4a6","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.913730Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:18d84f8192923517dd2dd50d0749a281628711ca9e79c01e4f7f50e973e0f5d1","observation_id":"48c14ffd-8094-4e4a-ac5c-4412520d4e48","resolution":{"observed_at":"2026-08-11T22:03:28.152523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:28.046772Z","title":"A single recipe for online submodu- lar maximization with adversarial or stochastic constraints,","venue":null,"work_id":"ed55dfbf-8ff0-40a0-9bf3-0cdee396470e","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.926460Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:abd238a407a7861ec1828db64f3ad047899bccfb2dc17d328d26431eff2a3954","observation_id":"f4a507a4-995a-4c6c-9aff-5625d69f3f91","resolution":{"observed_at":"2026-08-11T22:03:28.110164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:24.935642Z","title":"Online convex optimization for cumula- tive constraints,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.935642Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:96430d14fa7df17f99827f9acd8a68cbda8d07beda7a0ecd6e04a84e8d0cf90e","observation_id":"91475b5a-1423-48e9-9631-5c4459544198","resolution":{"observed_at":"2026-08-11T22:03:24.935642Z","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-11T22:03:27.858385Z","title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints,","venue":null,"work_id":"e45518f3-841f-4205-9525-e8c6fa08a355","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.953225Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:da2f3d38c440eeb8074c0db3493c24c941ce1108f0329db6bca64a11618a3fd0","observation_id":"19b62d50-dece-4a4e-b651-940a4e87b169","resolution":{"observed_at":"2026-08-11T22:03:27.955164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.844738Z","title":"Online convex optimization with hard constraints: Towards the best of two worlds and beyond,","venue":null,"work_id":"7e28db70-bdb6-4259-8302-23545d0e2d0a","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.957381Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:57c2cd1a8ee3e4213f9e79896229a40358ca9d70edb63a0c17bef06993ba714b","observation_id":"a3aae34d-ddb3-4d14-92b9-1daf6aac4632","resolution":{"observed_at":"2026-08-11T22:03:27.849381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.825562Z","title":"Online nonstochastic control with adver- sarial and static constraints,","venue":null,"work_id":"ca8d0d77-2d59-4325-9678-b67598e66153","year":2023},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:24.980548Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:35430a22816accefb7559deec701d743c354cf02e6590d9adecc4c4948aac4bb","observation_id":"45ec8d34-40f5-4e2d-91bb-ac220911e44f","resolution":{"observed_at":"2026-08-11T22:03:27.829854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.741979Z","title":"Optimal algorithms for online convex optimiza- tion with adversarial constraints,","venue":null,"work_id":"6432013d-f426-49de-8b8c-044e835d37e9","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.068322Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:231c9dff217d2dce657f0a1587f3bf6682308908c982de24a600538890a4298e","observation_id":"7defb458-c1b2-4416-b982-a05b1e0d13c6","resolution":{"observed_at":"2026-08-11T22:03:27.789746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.633560Z","title":"Bandits with knap- sacks,","venue":null,"work_id":"6b1a5161-56ff-4feb-b3ec-301e1c6765a1","year":2013},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.159791Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:6728e3691cf74da2424b611e588a965cad9f99dac2782fa6eea37d3d65941d80","observation_id":"d33f9a33-c8ef-4356-8b55-c50e406cb7bb","resolution":{"observed_at":"2026-08-11T22:03:27.689233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.612102Z","title":"Bandits with knap- sacks,","venue":null,"work_id":"e5c15a3e-a038-4586-8ae8-72611be90c80","year":2018},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.176240Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:546a493400df42b3b1e1f1b3e42edee450c105aa61e288354ba1bf4360c7a56d","observation_id":"7b7a54c1-ffef-4dc5-9ec4-5a8242eb4224","resolution":{"observed_at":"2026-08-11T22:03:27.616178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.600309Z","title":"Resourceful contextual bandits,","venue":null,"work_id":"fecccdf6-487e-4997-9a55-df392ab5835a","year":2014},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.206632Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:572fba8643f023ef47ebe4b56d5455ef0579ca3d112e521615c96b39b3617346","observation_id":"bf070108-1c99-4507-97ca-973b22b2f7a3","resolution":{"observed_at":"2026-08-11T22:03:27.604186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.588077Z","title":"Linear contextual bandits with knapsacks,","venue":null,"work_id":"ce1e05f4-0d67-40a2-bd09-4e1ad567ed67","year":2016},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.226417Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c15e8a0608850458b774d92b22ec4acc8d3ac3657a9c15ce50432610a7b14f9f","observation_id":"ce852cfa-6dd5-41ec-a5aa-3e03eeb66db0","resolution":{"observed_at":"2026-08-11T22:03:27.592541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.483758Z","title":"Ad- versarial bandits with knapsacks,","venue":null,"work_id":"4eecf03f-b16f-4c5d-a8b2-8b140ffca308","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.247335Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c10e1d592aa469f83982dd826d8cd98011deeb1e23b5dbdce3cf4b2a191c0f0e","observation_id":"a0fa4b4c-c17d-4658-8da4-868dd309f4fc","resolution":{"observed_at":"2026-08-11T22:03:27.531133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.470897Z","title":"Smoothed adversarial linear contextual bandits with knapsacks,","venue":null,"work_id":"ff1453bf-cb99-4243-b21e-5e82d13161b2","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.258246Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c2c5fe57e88101932fe3c03bf45e4eeb0788a9d0212e1ceb23130c65b654b17e","observation_id":"64dd7ea5-888d-443f-bef4-f609228acc7a","resolution":{"observed_at":"2026-08-11T22:03:27.475586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.455342Z","title":"Bandits with replenishable knapsacks: the best of both worlds,","venue":null,"work_id":"23272aa5-ad12-4b10-aff7-1c62c988e135","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.262873Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:d2f493989777eecddd3d8bbf93887cbbc44f125735513f04f11f0b1a23aa54a1","observation_id":"ea82d51c-abb5-4fe6-82d1-c9f6d0fea894","resolution":{"observed_at":"2026-08-11T22:03:27.461513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.294362Z","title":"Fair contextual multi-armed bandits: Theory and experiments,","venue":null,"work_id":"252bb934-13cb-41af-8502-ea835d02b2f6","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.269825Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:8642e490688a55c507b537b8ed55263842deb2029189815614059509271adaea","observation_id":"bbdc537c-b0a5-4e9a-8fba-412b6dd57dc1","resolution":{"observed_at":"2026-08-11T22:03:27.371776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.232083Z","title":"Banditq: Fair bandits with guaranteed rewards,","venue":null,"work_id":"0b914654-81ce-4642-b444-7aa818a9a8ac","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.333394Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:6b6b4d1e209e2fcf5b0fa074ee24bdee3810f450bb2e4cd4d3284da22f450a40","observation_id":"29ab8811-49d3-4c45-af46-cf9a9b5652c8","resolution":{"observed_at":"2026-08-11T22:03:27.236254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.191759Z","title":"Contextual bandits with packing and covering constraints: A modular lagrangian approach via regression,","venue":null,"work_id":"94f8acb2-073e-4ec2-bd80-603be2354f38","year":2023},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.374720Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:e8d5427a6c9f74a05be112ba0a6cd0657ec24f220651edfd013f15e7cbb94f9f","observation_id":"ab6f35ec-e47f-4029-971b-5f839d5504d5","resolution":{"observed_at":"2026-08-11T22:03:27.214023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:27.101811Z","title":"Contextual bandits with packing and covering constraints: A modular lagrangian approach via regression,","venue":null,"work_id":"efeea806-d64f-4019-b6d2-b904de5f1fec","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.439065Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:5f7c1541e82eabad9446911fdfddfb1986464387fdcefe0681cfed357c8dc0f5","observation_id":"6ca1bd30-ab16-404b-bd12-5ee0418059fa","resolution":{"observed_at":"2026-08-11T22:03:27.160796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.993452Z","title":"Stochastic constrained contextual bandits via lyapunov optimization based estimation to decision framework,","venue":null,"work_id":"a6a06401-c6d1-4f0b-bbcd-f4ecb020062c","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.482190Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:0194d5218d68404360ed51df73056e77c9319c49a0fddedf73beeb9d974400bf","observation_id":"1e5f96a2-4275-4359-bf55-1d53cac50337","resolution":{"observed_at":"2026-08-11T22:03:27.050631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.982077Z","title":"On stochastic contextual bandits with knapsacks in small budget regime,","venue":null,"work_id":"5bfe126e-7cbb-495c-a3b5-0d46ea886d00","year":2025},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.512336Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:a5e9ecb4e80fac57f6ed5d86a907b454a23e51972a1aa5d063b348bb48e1885a","observation_id":"d9349297-cdc4-4947-bc58-c46ebc53c104","resolution":{"observed_at":"2026-08-11T22:03:26.986001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.971123Z","title":"Stochastic bandits with linear constraints,","venue":null,"work_id":"cbdbb449-32b1-4399-807a-a91402d52846","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.533803Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:a7a7ae47f1d65222e70ce54d96828f8241f455d963dba6c27daadb14a70f6b7c","observation_id":"e3f73d44-d5a6-42b2-b686-401d237ec759","resolution":{"observed_at":"2026-08-11T22:03:26.974682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.859566Z","title":"Strategies for safe multi- armed bandits with logarithmic regret and risk,","venue":null,"work_id":"705da4e1-a383-48e4-9d33-f984c7aacf8d","year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.551268Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:007f5237e24358d2c0915d51c4d2f52437fb5e43460e1759fdc210012dc605cd","observation_id":"6054f715-c5eb-4c3a-bce7-a6575b76e4d6","resolution":{"observed_at":"2026-08-11T22:03:26.943464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.790099Z","title":"Safe linear bandits over unknown polytopes,","venue":null,"work_id":"c5a9acec-357f-4f8f-8d35-1f25b6083124","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.563020Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:97cf883432ee4565d571462c1684e2829d6a6e5a9ceedff61ca909deaf074bb1","observation_id":"0d9ac812-0018-4e5c-ac79-ed648bc41c41","resolution":{"observed_at":"2026-08-11T22:03:26.793737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.760152Z","title":"Testing the feasibility of linear programs with bandit feedback,","venue":null,"work_id":"f8bad387-1f53-4b47-b37a-0ab6e0d6ca8b","year":2024},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.567334Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:e9c27ed7c89b2fba9dc95b521c68f1bdbcef913e1c2d0b0e9bd55f60590b8144","observation_id":"6ccb65d0-d9cb-4941-9a5d-181e3a3b1160","resolution":{"observed_at":"2026-08-11T22:03:26.772105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.697771Z","title":"Finite-time analysis of the multiarmed bandit problem,","venue":null,"work_id":"494fad30-f890-481c-8a7c-9cb98fdec70d","year":2002},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.573431Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:5a9caea10c1a5fa3a4a28785b6844d2ca8b127b1497a276f244b15a56f1f0198","observation_id":"ec3d3382-8051-4243-8779-90ff31077b4f","resolution":{"observed_at":"2026-08-11T22:03:26.738955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.582941Z","title":"Improved algorithms for linear stochastic bandits,","venue":null,"work_id":"3bb2e097-66cf-46ea-9e2c-319ec245d0c9","year":2011},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.577268Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:da09c41cac575123dc32da995368f4465cfd67b8a3101b50d7196a5265f92e9e","observation_id":"83e15ff9-2937-43d2-9106-f768cd7b2e78","resolution":{"observed_at":"2026-08-11T22:03:26.636250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.553846Z","title":"Lattimore and C","venue":null,"work_id":"29ed678a-78c4-46df-873f-db7348bffc90","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.581785Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:43141f3af67f9655ab865eaefdbd4ede7c96393e02c4c4781ac9e1a2034ec2d0","observation_id":"86f96b57-970b-4641-8292-8d47fd59e40e","resolution":{"observed_at":"2026-08-11T22:03:26.557843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.540932Z","title":"Stochastic network optimization with application to communication and queueing systems,","venue":null,"work_id":"852cfac2-1728-4cad-9323-42d862922e4b","year":2010},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.605131Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:f5f83a83d5c5b154c666b2390c467d451c32f647ac9a7ea939e5ac11b0b7d4f7","observation_id":"4588d674-32af-4735-98aa-8a58d931d3ea","resolution":{"observed_at":"2026-08-11T22:03:26.544940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.437448Z","title":"Srikant and L","venue":null,"work_id":"c3b2585d-4b09-435a-9787-024b1e24c243","year":2014},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.680478Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:164543382593c5e659626c1e56fd9296adb3ae8124dfaccedcfc5033330cc51c","observation_id":"87b62ca5-403d-447f-a781-c1bfd4401fef","resolution":{"observed_at":"2026-08-11T22:03:26.496901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:25.747619Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.747619Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:569cae129387f578681fa9994efc4408e3649498be7c4e8da5d324667a4e6024","observation_id":"32ce86dd-cdf4-4661-9b5a-81a02641bdf1","resolution":{"observed_at":"2026-08-11T22:03:25.747619Z","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-11T22:03:26.301452Z","title":"Convergence rates of inexact proximal-gradient methods for convex optimization,","venue":null,"work_id":"7bf10cf9-11d0-4347-b4fd-868bbfec939c","year":2011},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.797452Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c31c3198d2c813260f0362fb70448e9d5c3f27ec3d53c47ebbd088e871c6d02f","observation_id":"1aee2c9c-fd23-47c0-887e-5df3154cee67","resolution":{"observed_at":"2026-08-11T22:03:26.346522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.289500Z","title":"Online convex programming and generalized infinitesi- mal gradient ascent,","venue":null,"work_id":"8670d3ab-a4f2-4711-ac09-6c877fe6ed00","year":2003},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.808699Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:a1c92ac574929a1db9c5c036d1d1b7bfaed107520b6ce24390e743747578a550","observation_id":"755201eb-8611-491c-9a84-e9e496ebfbc1","resolution":{"observed_at":"2026-08-11T22:03:26.293621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.276107Z","title":"Projection-free online learning,","venue":null,"work_id":"f0d3af8f-6a3f-4408-84b2-21074b775b17","year":2012},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.812459Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:e82cd01ffdf2103a7b5a6f55e9bb3cc7697eafbb801cb737cada945a8dca34fc","observation_id":"d4fc77da-7f35-45be-a36e-fd9004511d3b","resolution":{"observed_at":"2026-08-11T22:03:26.281718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.254864Z","title":"An efficient pessimistic-optimistic algorithm for stochastic linear bandits with general constraints,","venue":null,"work_id":"1e6060aa-984a-4b76-aaa7-5d7e8f7274df","year":2021},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.815980Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:d3ac184331e20f3dfd9e1af451be8848c1fb955603c9b5a0d946fc7b82a058e5","observation_id":"51303099-307b-44ce-a1a3-5e354d86e66b","resolution":{"observed_at":"2026-08-11T22:03:26.267718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.149577Z","title":"Convergence analysis of a proximal-like minimization algorithm using bregman functions,","venue":null,"work_id":"6e70e7c7-b2c6-4b3b-ad89-6f0ff3561bd4","year":1993},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.821710Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:c60758788c137f6884396f7cabd976f0766a2b64338574507c6e5ce82f2df544","observation_id":"eb2de26e-f632-4004-89ab-8ef480ef459f","resolution":{"observed_at":"2026-08-11T22:03:26.220403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:26.136989Z","title":"A low complexity algorithm with O( √ T ) regret and O(1) constraint violations for online convex optimization with long term constraints,","venue":null,"work_id":"d7289d5c-8c5e-475c-a484-06d8f0fbea8c","year":2020},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.837119Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:09e89b317e6b7c0f767364cdf4daaf67501933478805b1e73d8829c66dc11a5d","observation_id":"1765308d-7679-4323-a6b6-552becaa1871","resolution":{"observed_at":"2026-08-11T22:03:26.141805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07443","last_updated":"2022-03-06T06:59:07Z","snapshot_observed_at":"2026-08-16T17:27:25.499789Z","submitted_at":"2022-01-19T07:03:37Z","title":"On the Convergence Rates of Policy Gradient Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07443","snapshot_observed_at":"2026-08-11T22:03:25.852849Z","title":"On the convergence rates of policy gradient methods,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.852849Z"},"links":{"cited_paper":"/paper/2201.07443","citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:f1a54e0dbef869929b78b65b2edb27b48565e3810f62324dbc96e4b14c826f03","observation_id":"3a73246d-3782-43a8-9d1f-df028dd4a5a4","resolution":{"observed_at":"2026-08-11T22:03:25.852849Z","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-11T22:03:26.082034Z","title":"Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action","venue":null,"work_id":"cc7e123c-16ef-4bc3-bbc2-2d1fa2f04285","year":2013},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.856861Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:f5c4460f36d603ce3527a7eef6acc1f322f667cf59ca706dc16ebf21a9846acc","observation_id":"b05d80f3-4c5b-4463-80e8-1bb6df46be39","resolution":{"observed_at":"2026-08-11T22:03:26.110509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"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-11T22:03:25.920126Z","title":"New york ISO open access pricing data.,","venue":null,"work_id":"3508d70c-5a31-4c15-973f-1e7fa11c7b6f","year":null},"citing_paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T22:03:25.861133Z"},"links":{"citing_paper":"/paper/2412.03983"},"observation_digest":"sha256:7f62dd75c034138a62502a3778cc247b52458b98fd3ea00d2af187bd21117159","observation_id":"1090c944-ae29-475d-8672-7437382735d9","resolution":{"observed_at":"2026-08-11T22:03:26.014012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.03983","last_updated":"2025-03-07T10:39:01Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T21:50:32.449540Z","submitted_at":"2024-12-05T08:58:41Z","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":63},"total_outbound_references":70},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2412.03983."}