{"as_of":"2026-08-09T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e453c7dd453ee3b24dcb80ba5a84c1cedf5fc3a28678e2e1cad597db173265b7","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:49:17.054598Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T09:06:47.558015Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T22:17:25.887786Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"cited_work":{"arxiv_id":"2502.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05019","snapshot_observed_at":"2026-07-02T22:17:25.887786Z","title":"o( √ T ) static regret and instance dependent constraint violation for con- strained online convex optimization","venue":null,"work_id":"3ba98e50-eaae-4752-b513-a757f3670b1c","year":null},"citing_paper":{"arxiv_id":"2605.21107","last_updated":"2026-07-22T05:57:53Z","snapshot_observed_at":"2026-08-02T13:43:27.707898Z","submitted_at":"2026-05-20T12:40:27Z","title":"A Geometric Approach to Constrained Online Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-21T06:23:20.784755Z"},"links":{"cited_paper":"/paper/2502.05019","citing_paper":"/paper/2605.21107"},"observation_digest":"sha256:6828aa23dacbf79a1290e6ae4462e0075b4027ea4069efe4c7dad64909ac8190","observation_id":"2bf87dd1-b02a-478f-b079-9b691c7bb9bd","resolution":{"observed_at":"2026-05-21T06:24:00.516080Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"cited_work":{"arxiv_id":"2502.05019","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05019","snapshot_observed_at":"2026-07-02T22:17:25.887786Z","title":"o( √ T ) static regret and instance dependent constraint violation for con- strained online convex optimization","venue":null,"work_id":"3ba98e50-eaae-4752-b513-a757f3670b1c","year":null},"citing_paper":{"arxiv_id":"2606.08452","last_updated":"2026-06-07T04:51:32Z","snapshot_observed_at":"2026-08-06T04:01:29.728351Z","submitted_at":"2026-06-07T04:51:32Z","title":"Theoretical Foundations of Continual Learning via Drift-Plus-Penalty","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T19:06:08.261216Z"},"links":{"cited_paper":"/paper/2502.05019","citing_paper":"/paper/2606.08452"},"observation_digest":"sha256:0998ce6663f43637dd215dc903735c997b4190e873a5522e1d06290801732aa8","observation_id":"80b1e048-f954-40d3-b54d-59d201787a05","resolution":{"observed_at":"2026-07-02T22:17:25.889538Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05019","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10808","last_updated":"2026-07-12T15:36:04Z","snapshot_observed_at":"2026-08-06T05:59:13.257838Z","submitted_at":"2026-07-12T15:36:04Z","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/2502.05019","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:fbdb21e42e1db69216ac70175fd3731f9bd10a4742df5bb19cb260827c2ff097","observation_id":"33aa6af6-e4a5-4dc4-92bb-427a909f0cfe","resolution":{"observed_at":"2026-07-14T09:06:47.558015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05019/citation-record","integrity":"/paper/2502.05019/integrity","json":"/paper/2502.05019/citation-record.json","paper":"/paper/2502.05019"},"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-08T20:49:17.634119Z","title":"A nearly-linear bound for chasing nested convex bodies","venue":null,"work_id":"cd5cedfb-445b-4804-882b-4b91ed12e837","year":2019},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.945192Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:2adc5058bb8ecfa5b6a540b9d64df0220b6b0ede4add4030f429109d7264e6c1","observation_id":"3f84534e-bad1-4449-a003-c2a12f7f1485","resolution":{"observed_at":"2026-08-08T20:49:17.638917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.619248Z","title":"Nested convex bodies are chaseable","venue":null,"work_id":"721e4485-7bc4-4d7d-93e1-89ef86f99462","year":2018},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.950664Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:a967afa7df52a8968e31946ca293291df35a40343c2bd9a331c6f47c6b26ab03","observation_id":"70a1ef18-73b4-4812-ad6f-a5b51cef37bd","resolution":{"observed_at":"2026-08-08T20:49:17.623388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.603954Z","title":"Chasing nested convex bodies nearly optimally","venue":null,"work_id":"68e6acc4-8dd6-494a-ad22-3afb1f97f2a9","year":2020},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.955516Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:c4a5209a50612a82d2827a4c1b1050932b0b77ac1f8abad385d561e5f4e3d66a","observation_id":"1a2bfb0e-5b2a-4b46-966c-eeb07276917a","resolution":{"observed_at":"2026-08-08T20:49:17.608946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.588925Z","title":"Online convex optimization with time-varying constraints and bandit feedback","venue":null,"work_id":"9e81dc35-46d4-4363-ae23-8ba13c6f25e9","year":2018},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.960961Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:19edd9692b5d22ce5cd72934e34329226f0ffe2187773b91975820984b8b2927","observation_id":"115a426d-333f-40d8-961f-c821fe005e5d","resolution":{"observed_at":"2026-08-08T20:49:17.593826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.573011Z","title":"Bandit convex optimization for scalable and dynamic iot management","venue":null,"work_id":"caea3140-dc08-4d7a-96a8-cb12d2484517","year":2018},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.966651Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:c0ae1c90f7eaeb53f01241a0e56f642c6f3aa2faf570123ef1e5170a761536ca","observation_id":"fee04c3f-c824-4880-a354-11f80355454c","resolution":{"observed_at":"2026-08-08T20:49:17.577951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.556971Z","title":"Convexity, 1966","venue":null,"work_id":"6367f21c-ba93-47b5-9800-1c0db92d6922","year":1966},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.972184Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:6330600fbe9c9deb98ce098f29a0d1fa5ebebd8d566ac1b9aa449ea8268cf894","observation_id":"be27a87c-4aca-4a9b-b70d-4447e5a97571","resolution":{"observed_at":"2026-08-08T20:49:17.561754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.540734Z","title":"Online convex optimization with hard constraints: Towards the best of two worlds and beyond","venue":null,"work_id":"8ebd63cd-4bb1-4e54-a2ad-dae7555e37d6","year":2022},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.977850Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:0a59eecc44cb9035033354f1da1c69788b7f795495c09b5128e205ff430d8a4b","observation_id":"44987726-4a68-4972-98a2-f45cc884155d","resolution":{"observed_at":"2026-08-08T20:49:17.546459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.523189Z","title":"The convex optimization approach to regret minimization","venue":null,"work_id":"1150b015-0202-43d4-838a-a7aac250a424","year":2012},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.983595Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:3369bff1258af6051adf7cda2d42f9d101711a43901a9dddc01c5a2ef744cadd","observation_id":"b7886ea3-a8e5-45a7-b14f-db95bfff838a","resolution":{"observed_at":"2026-08-08T20:49:17.529205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.506652Z","title":"Adaptive algorithms for online convex optimization with long-term constraints","venue":null,"work_id":"c44e1fc7-7842-4fae-9a05-124fcbd77a66","year":2016},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.988191Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:58d5f1eaa1df26188d9010d146e41dfdc2d03fd0cb7451b33d9c52fa91e5617f","observation_id":"0e7e5dfb-388c-406e-acfa-331f9d6a4e01","resolution":{"observed_at":"2026-08-08T20:49:17.512134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.490011Z","title":"Cautious regret minimization: Online optimization with long-term budget constraints","venue":null,"work_id":"8fe58e5c-bad0-487a-a745-12e2192c9d51","year":2019},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.992366Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:b6f55beb2e389befaa2559493eed87e60a7e5e79e3d4ce9901c8b2e34e12399e","observation_id":"b0fde277-cbd9-4714-bb1e-a5020c00de40","resolution":{"observed_at":"2026-08-08T20:49:17.494404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.472969Z","title":"Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints","venue":null,"work_id":"3fe59c3b-8d11-48ba-96ef-f8ec1568c5af","year":2022},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:16.996943Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:294994b158156562fed61019398bf3f29a8e6bf00b01b4db7373763fc6e1db17","observation_id":"89f77274-7ee3-482c-8d0d-7f0e8c89ace5","resolution":{"observed_at":"2026-08-08T20:49:17.478733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.456090Z","title":"Trading regret for efficiency: online convex optimization with long term constraints","venue":null,"work_id":"bb0f7956-8924-4c21-8988-34dea2231983","year":2012},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.001262Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:25b225f14769c7037ff5097c0a0daf2399ae769826cc577c86a465ac8e1f3946","observation_id":"6ce8e5c0-65ae-438a-b18a-e6934850002d","resolution":{"observed_at":"2026-08-08T20:49:17.461173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.439171Z","title":"Maximum length of steepest descent curves for quasi-convex functions","venue":null,"work_id":"6d8a97d1-2435-497b-b03a-af6f67088ac9","year":1991},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.005758Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:08d8211e1ced2b1f2dbfec465888d4928e150eefcbfdd57dddfd3e7ae772444b","observation_id":"728c8073-da00-47ef-8431-f9684fbd81e9","resolution":{"observed_at":"2026-08-08T20:49:17.444384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.421563Z","title":"Stochastic network optimization with application to communication and queueing systems","venue":null,"work_id":"12be6412-76d7-4942-9e54-7bd5ebda177a","year":2010},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.010256Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:0cc173aac708f8d7c4ee87e1f7c960909cde2266f64cb70e5b0508472918ee8d","observation_id":"16274119-b148-4fc7-89ea-afc2b0b938b2","resolution":{"observed_at":"2026-08-08T20:49:17.427122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.04783","last_updated":"2017-02-17T01:21:12Z","snapshot_observed_at":"2026-07-06T05:30:12.080801Z","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-08T20:49:17.014695Z","title":"Online convex optimization with time-varying constraints","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.014695Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:152ab125d802e2ec739bde152ba3cf1ef0038d11764ee7ade484bf40c5fd9335","observation_id":"0eb1e71f-2068-4b5e-866b-9641e8bd00c2","resolution":{"observed_at":"2026-08-08T20:49:17.014695Z","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-08T20:49:17.403352Z","title":"Optimal algorithms for online convex optimization with adversarial constraints","venue":null,"work_id":"f101cde3-6c35-45a3-abf7-5a810c4a53b0","year":2024},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.019876Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:970a82262241b95c82765335dd8c429734af161afc36d43db5877c881ec71c85","observation_id":"ca391f24-739e-43a7-829c-afd49764f1e0","resolution":{"observed_at":"2026-08-08T20:49:17.408893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.386133Z","title":"Safety-aware algorithms for adversarial contextual bandit","venue":null,"work_id":"ad29eb48-a6a5-47d1-8836-367317197c9b","year":2017},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.023901Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:6a90b17ed70a94f8f8ed67b1bf76118626deab1b4d1b67820fa60b1fd75ad4a0","observation_id":"6267984c-6c46-4cba-ba80-f10cad297152","resolution":{"observed_at":"2026-08-08T20:49:17.391690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:49:17.297303Z","title":"On dynamic regret and constraint violations in constrained online convex optimization","venue":null,"work_id":"fb8d6783-4901-44c2-a1fe-f91a3e218dac","year":2022},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.028871Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:4599a9af8f34ee40e4674c6b0fc9b52bfef50555f72902ba190509d7cd27ffb7","observation_id":"69c93168-19a8-4ef1-9c82-e2e6ff326555","resolution":{"observed_at":"2026-08-08T20:49:17.305393Z","resolver_source":"arxiv_id_nonexistent","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.368334Z","title":"Regret and cumulative constraint violation analysis for online convex optimization with long term constraints","venue":null,"work_id":"588665d3-93e2-4f50-9020-0c18a4e10f3c","year":2021},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.034258Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:f187c1da8c3f5a2ef97974917926bfdc37e6278552ec75dfa57a4ce2a4a74300","observation_id":"ff2708bf-7c11-4847-bed6-eb4b16709d01","resolution":{"observed_at":"2026-08-08T20:49:17.374050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.00149","last_updated":"2023-05-31T19:39:15Z","snapshot_observed_at":"2026-07-06T15:36:11.529142Z","submitted_at":"2023-05-31T19:39:15Z","title":"Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.00149","snapshot_observed_at":"2026-08-08T20:49:17.039002Z","title":"Distributed online convex optimization with adversarial constraints: Reduced cumulative constraint violation bounds under slater's condition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.039002Z"},"links":{"cited_paper":"/paper/2306.00149","citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:9963fff6e754b585ab34c18123eb1aaebaa0ef89cbb8102f9cd1db1c3f58e348","observation_id":"67e03806-c919-402a-a497-5042dc626af6","resolution":{"observed_at":"2026-08-08T20:49:17.039002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.02218","last_updated":"2020-05-18T06:31:30Z","snapshot_observed_at":"2026-08-01T15:47:59.899394Z","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.02218","snapshot_observed_at":"2026-08-08T20:49:17.044261Z","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":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.044261Z"},"links":{"cited_paper":"/paper/1604.02218","citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:5d197d06ae9005fac9acff291f2b1f72b4c4f4086dd032fce13124a0d8e8b5b0","observation_id":"3dedcc25-bf48-4116-b809-a5f6413bd678","resolution":{"observed_at":"2026-08-08T20:49:17.044261Z","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-08T20:49:17.352100Z","title":"Online convex optimization with stochastic constraints","venue":null,"work_id":"e0e03fb1-c4a7-4d2a-b69f-45e69a03060d","year":2017},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.049962Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:5ed7312f2c9c7620c37f03422933b293f3b36d1d98791c834030e8b5ba5471d0","observation_id":"76572339-1242-4858-8aab-10706763002e","resolution":{"observed_at":"2026-08-08T20:49:17.357139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T20:49:17.333937Z","title":"Online convex optimization for cumulative constraints","venue":null,"work_id":"20165521-1231-4fb4-8e0b-f1a6386e3410","year":2018},"citing_paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T20:49:17.054598Z"},"links":{"citing_paper":"/paper/2502.05019"},"observation_digest":"sha256:314a6569d8af29e662a9e47f22e418e9a4c94ac21147ac7933bd367d21e0ad2a","observation_id":"21703c63-2101-4c17-9969-10862c5e4f7f","resolution":{"observed_at":"2026-08-08T20:49:17.339524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.05019","last_updated":"2025-02-07T15:47:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T10:49:59.453427Z","submitted_at":"2025-02-07T15:47:04Z","title":"$O(\\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":19},"total_outbound_references":23},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 3 inbound Pith citation observations for arXiv:2502.05019."}