{"as_of":"2026-08-21T09:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53af31890ccf903ed0fc161a6875ee938697eddd07aa264a4419841ea114e24c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:26:20.042013Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-02T20:47:22.796014Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"1907.00316","last_updated":"2019-06-30T04:01:32Z","snapshot_observed_at":"2026-08-19T03:51:16.600403Z","submitted_at":"2019-06-30T04:01:32Z","title":"Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T13:05:40.988705Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/1907.00316"},"observation_digest":"sha256:6bbec1303c516daf47d02aab6f5e89daaed685c5824ee76fc3be1c3d27fef77b","observation_id":"bce40314-76f6-46c9-8ca7-e9548daa0780","resolution":{"observed_at":"2026-05-25T13:05:50.280372Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"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-12T18:35:08.716569Z","title":"Online convex optimization with t ime-varying constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.11574","last_updated":"2025-03-28T11:58:09Z","snapshot_observed_at":"2026-08-21T05:03:22.914486Z","submitted_at":"2024-11-18T13:50:31Z","title":"Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater Condition","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T18:35:08.716569Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2411.11574"},"observation_digest":"sha256:9908e89da8851f6a46456ec998db423ab16f6fa775fdb1f7decd1f5449497ce8","observation_id":"66a5aa5c-2f3f-4c89-8c4f-903159de12dc","resolution":{"observed_at":"2026-08-12T18:35:08.716569Z","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":{"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-11T18:26:46.864361Z","title":"Neely and Hao Yu","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.08060","last_updated":"2025-03-12T21:09:19Z","snapshot_observed_at":"2026-08-12T04:56:44.227476Z","submitted_at":"2024-12-11T03:06:42Z","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T18:26:46.864361Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2412.08060"},"observation_digest":"sha256:544b02af8134fcf0c3a6db1bbd0783715d94b7534ad037ccc96a328a11ee21b7","observation_id":"ae358a29-0e20-42a0-99f5-71494192ec75","resolution":{"observed_at":"2026-08-11T18:26:46.864361Z","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-10T01:07:48.892363Z","title":"Online Convex Optimization with Time-Varying Constraints,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.18039","last_updated":"2025-01-29T22:58:13Z","snapshot_observed_at":"2026-08-16T21:38:35.694845Z","submitted_at":"2025-01-29T22:58:13Z","title":"Online Nonstochastic Control with Convex Safety Constraints","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T01:07:48.892363Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2501.18039"},"observation_digest":"sha256:b2d1ba4cf48186671a2b9ab875070f995408f76241cbdd1e72f605e85ddb733c","observation_id":"60551f5d-bef5-4d66-b3d2-7a2042749892","resolution":{"observed_at":"2026-08-10T01:07:48.892363Z","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-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-20T03:35:55.975707Z","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:fd92b468cab4fa00b7e19633ada5df0b4f4b45322cd7e2929b891e8a75b4ca02","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":{"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-15T17:26:20.042013Z","title":"Online convex optimiza- tion with time-varying constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-19T17:33:58.837920Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.042013Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:557dcf265debe1e84b814c66c1fa75889db408c70cfe7884d8c816500692437b","observation_id":"20d2a569-2603-4e60-ae19-daeaa9410a0f","resolution":{"observed_at":"2026-08-15T17:26:20.042013Z","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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"2605.06190","last_updated":"2026-05-07T13:04:49Z","snapshot_observed_at":"2026-08-15T01:46:09.596166Z","submitted_at":"2026-05-07T13:04:49Z","title":"Constrained Contextual Bandits with Adversarial Contexts","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-05-08T13:36:34.355048Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2605.06190"},"observation_digest":"sha256:7d2b5cf0a59b707375ec12eaa31ebdad7cb0baaebcd991413bae01df7097649a","observation_id":"b127c6bd-8401-489f-b831-262066b1695c","resolution":{"observed_at":"2026-05-11T18:51:08.061083Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"2605.07386","last_updated":"2026-08-16T08:14:26Z","snapshot_observed_at":"2026-08-20T23:12:29.186662Z","submitted_at":"2026-05-08T07:42:15Z","title":"Convex Optimization with Nested Evolving Feasible Sets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-11T02:10:50.968709Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2605.07386"},"observation_digest":"sha256:b0081723c91f80e695fbbc33fa798c4bec16ef79bea97381ec715f4fcfe27216","observation_id":"3e7c84db-456b-4ffe-bdc6-66f3f8639de1","resolution":{"observed_at":"2026-05-11T03:50:57.859030Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"2605.21107","last_updated":"2026-07-22T05:57:53Z","snapshot_observed_at":"2026-08-15T02:56:04.440610Z","submitted_at":"2026-05-20T12:40:27Z","title":"A Geometric Approach to Constrained Online Learning","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-05-21T06:23:20.784755Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2605.21107"},"observation_digest":"sha256:cdd105946391b0e08e9fae479b39cfb44d22f21b3a2fcdeea43e69e699a7782f","observation_id":"d3772213-117a-4e96-b3ba-6d6f37dbeaea","resolution":{"observed_at":"2026-05-21T06:24:00.512968Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"2606.08028","last_updated":"2026-06-06T07:40:55Z","snapshot_observed_at":"2026-07-06T23:47:33.680573Z","submitted_at":"2026-06-06T07:40:55Z","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T20:11:15.029058Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2606.08028"},"observation_digest":"sha256:aabc12b05791aaf9bb4e44e6cf49d6fe38028a77cbb0e427d293bec678e2543f","observation_id":"713543c0-35c8-480a-9c09-743b42b8c9bd","resolution":{"observed_at":"2026-07-02T20:47:22.797249Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"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":"1702.04783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-07-02T20:47:22.796014Z","title":"Online Convex Optimization with Time-Varying Constraints","venue":"math.OC","work_id":"f6c8f792-4dbc-40b2-bcd8-dbf8241ad63c","year":2017},"citing_paper":{"arxiv_id":"2606.31480","last_updated":"2026-06-30T10:54:41Z","snapshot_observed_at":"2026-08-15T10:52:04.462915Z","submitted_at":"2026-06-30T10:54:41Z","title":"Constrained Online Convex Optimization without Slater's Condition","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-01T06:40:44.712616Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2606.31480"},"observation_digest":"sha256:3c67784db0fdd5b301199e2dbf90dae1788aedef28f8d9941db27abf6eeea2b0","observation_id":"d950f1bb-6d30-427a-b892-b78cbb6a09f0","resolution":{"observed_at":"2026-07-01T06:45:29.626052Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"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-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:1702.04783 , year=","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-15T04:15:38.752863Z","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":58,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:4a18ded5b04b629b55df235765d6a4e87c7bb680b7b8e06f99ed17cf85ea8c58","observation_id":"d1466e92-d2a5-4636-924b-b51688c02fd6","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"}},{"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-01T02:23:41.675720Z","title":"Online convex optimization with time-varying constraints.arXiv preprint arXiv:1702.04783,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.675720Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:728e8d6854eef15b35b82f412741c4d901757be0d6b02c6e46a9e5f0774ee19f","observation_id":"39c0469b-208e-47d8-a36d-0c1331cae96c","resolution":{"observed_at":"2026-08-01T02:23:41.675720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1702.04783/citation-record","integrity":"/paper/1702.04783/integrity","json":"/paper/1702.04783/citation-record.json","paper":"/paper/1702.04783"},"outbound":[],"paper":{"arxiv_id":"1702.04783","last_updated":"2017-02-17T01:21:12Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T21:16:17.911774Z","submitted_at":"2017-02-15T21:27:06Z","title":"Online Convex Optimization with Time-Varying Constraints"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:1702.04783."}