{"as_of":"2026-08-09T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07514533ff9ba3c534f648a5da21906bf84cc1d2209431e22d20ce2356d1793f","coverage":[{"denominator":253,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T09:06:47.558015Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.10808/citation-record","integrity":"/paper/2607.10808/integrity","json":"/paper/2607.10808/citation-record.json","paper":"/paper/2607.10808"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"1966 , publisher=","venue":null,"work_id":null,"year":1966},"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":1,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:bd1a3cace8b034c3e14782eac3eba45365d99bd4daffe34a381de063985cccbe","observation_id":"d8cb9c30-8d40-46ca-b3f3-57a19a118da5","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Breaking the O(","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":2,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:b26ff4f9ed27b96d30a990a4ae0beb0c6b4d54e6953f670823d1a6b39fbdb499","observation_id":"c8f8d146-f418-45c1-94d1-5e8a07df2b1b","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2026 , eprint=","venue":null,"work_id":null,"year":2026},"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":3,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:dcecc8b49c9df26a1b1e87d84a5a627bba28df578db10a740d7c9430b744555f","observation_id":"d92e2869-0d8c-4350-ac9b-16d208646783","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2016 , eprint=","venue":null,"work_id":null,"year":2016},"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":4,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:335f26a832e463a5a4f32a5acaad37830b25e3504fe86c6ca02343f6127ca4e8","observation_id":"0effb597-bd32-4c2f-ae72-a1dc56285283","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"The Thirty-eighth Annual Conference on Neural Information Processing Systems , 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-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":5,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:ead100b70536069676a10d72c3d256eb87c1e68e2adf2ce589492c62a6af1553","observation_id":"85b31608-4704-4309-944f-c14cfe0ed506","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":"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2025 , publisher =","venue":null,"work_id":null,"year":2025},"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":7,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:aeca07237220ddda3126968f016fcac64c6b2b3a4d70390a53d0e32a8a2bd812","observation_id":"f267dd24-e73d-44ba-9e41-901b01382eb5","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Geometriae Dedicata , volume=","venue":null,"work_id":null,"year":1991},"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":8,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:4087fdd279beebd38cf6a4374f7783b69b1e51052d474e3ddd2b125cea8b1b72","observation_id":"2a907b0f-3b7c-4116-8aba-47f3d759d1e5","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":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2019},"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":9,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:7d7e2cec0e1d2d83f175c8305b9ad793ce7e1e28fceb0e57e3f9cd1d2b299d50","observation_id":"2267f56d-ef33-425d-8b34-041502eb3d90","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of Thirty Fifth Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":2022},"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":10,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:77a43329f0074232a46f3eaac94baf894f038778daabe3143b63a96a1ae394c7","observation_id":"c699694d-e52a-4ba9-99ca-2979d0cb1819","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"GitHub repository , howpublished =","venue":null,"work_id":null,"year":2024},"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":11,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:59132a7e0b57bd08b2ce8f9b3412041e7ed53b2297bb0cd49b64055751396dc9","observation_id":"319bfd89-bec9-4c99-89d6-f6f0cf873d11","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the National Academy of Sciences , volume=","venue":null,"work_id":null,"year":2019},"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":12,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:bccc39c08e8d12d67abb5c8aa79e6c03fcf8d6d5921f2e1fea73019eaf08fed1","observation_id":"d6799b13-557a-44da-b990-7b52b3101fc3","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Expert systems with applications , volume=","venue":null,"work_id":null,"year":2014},"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":13,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:8bc351414ca45902d8e115ff483d1fe716cea8f0fb958fd0386c4f7f7404ee26","observation_id":"fb97397a-f903-4223-a96d-19c719dabb68","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"A low complexity algorithm with O(","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":14,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:97f9ca5c93ec804027ca2de9bc6f7dbbe4aa3ea1a2dbf6413b21b266b2d58130","observation_id":"d8311bf4-e141-45d4-ae83-1ff0d3687a1c","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization , 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-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":15,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:347e5614f56612ff4a63e67f55e443b2c9b183ccd745eec4ac80287a62eee039","observation_id":"00f877ce-fc41-49b5-946a-5f45604bb9e1","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE Transactions on automatic control , volume=","venue":null,"work_id":null,"year":2018},"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":16,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d246bd51b312cf4ea2b09c852f438f8b5b88749fd1e2503d6258095e7148eea3","observation_id":"3142783a-e44d-4aed-8454-ce15aea29e44","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE Internet of Things Journal , volume=","venue":null,"work_id":null,"year":2018},"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":17,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a38a861975768261ad3a856b3bbb9b572f2e84f27753ba0b6ade438f1bbe3815","observation_id":"1d604312-1da2-490c-a9d0-109dc4f13a19","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2018},"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":18,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d90a0d762d1163bbdd11732ea7ca83801c18f1c68d49bf02a4b3c0efa939b968","observation_id":"d5694f5c-c1bc-41d0-8dc9-c3369b67d0dd","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the Symposium on the Mathematical Theory of Automata , volume=","venue":null,"work_id":null,"year":1962},"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":19,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:c5c5917988fc02761f2ded28af8f4965de57ae79965965f0b7a41c1ce688e32c","observation_id":"77b5a1d3-fe18-4beb-a69e-f5988118de4f","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Journal of optimization theory and applications , volume=","venue":null,"work_id":null,"year":2009},"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":20,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d2f23cbfd3683e990371141fae7307bd1ed9608cd42432b50bfc49cf637131ed","observation_id":"f348361d-425a-48cd-868c-eba6d603cf9d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE Transactions on Automatic Control , 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-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":21,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:ab9a3f1cec2deb5b37bb4f9f1ff88d8236f63669d1a1128782b6e0fb3943b5e5","observation_id":"ddaa7906-3be3-4158-8220-211d5a258c25","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Nature , volume=","venue":null,"work_id":null,"year":2023},"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":22,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:54895608cfd0bc7cbb6641bcf4c67b4d573f7acd91500c38379dc3ae21f66743","observation_id":"82f20100-44e3-4a13-a914-c3370abc88cd","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Optimization for machine learning , pages=","venue":null,"work_id":null,"year":2012},"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":23,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:df643dceadd26ba0ab6a31b6e84f44d91121ae102db51e84630638403cf53d0c","observation_id":"7ba47d94-b9e1-45b4-8c55-a5c0b39e0a2f","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"1967 , publisher=","venue":null,"work_id":null,"year":1967},"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":24,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:616bf78e95cd515a82c98b5c0de319e7fbbef8a8fb40450a3ea13af03d3a9d16","observation_id":"bda4a8bb-c35d-449f-80e4-986c44a60e0d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2019},"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":25,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d48b03fb10b0feea3df0ec8e25163b77ab6992065ef7be03dbbc9a26251b2994","observation_id":"74908f1a-7577-44bc-be05-3215cb1aee15","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2020},"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":26,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:8a269ebbea510f959def5819605e11e9df48317b4fb0a426ac3dd2805813bf5e","observation_id":"c24e375e-4070-422c-a401-9bf6fd0e0a15","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE INFOCOM 2019-IEEE Conference on Computer Communications , pages=","venue":null,"work_id":null,"year":2019},"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":27,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:adce4eaa7a75b2763a78a08322fb9bede4e048cad0ed80ed0a9f26c65db29b1e","observation_id":"5398b3a0-f9df-42e6-a61f-f90d4809ae61","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2012 , publisher=","venue":null,"work_id":null,"year":2012},"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":28,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:aa8e842fa2cc90aca540b8ae937aa13fb2094acca36dbadd320cd2372fa4cff1","observation_id":"6ae7316a-edac-4d7e-bd63-9a5e70c417fa","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Kingma and Jimmy Ba , editor =","venue":null,"work_id":null,"year":2015},"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":29,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:08549f8b0fdfe94e2a824c21788234e9e82793f90c2bdab46136423e725acd7e","observation_id":"e74d54db-7633-4b1b-b946-8b395c22c6a9","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2008 , publisher=","venue":null,"work_id":null,"year":2008},"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":30,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:3eefe48444cfe95bb4927f94f7eb1aee28e6dcb2ca86b2b673771894306426d7","observation_id":"fa219c1c-3aef-45db-bfbe-8800220dbccf","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":", author=","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":31,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:36a9e0e1102867b87edbf967871725e25b5ae49735d604a423c525aac32ad33a","observation_id":"c923e069-9e32-44f5-b88f-ead910a76c6b","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2021},"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":32,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:11a1f2563c5198193225f5e93508bf437df207aadfd2924fbbf72126ce8e576a","observation_id":"e9e81fc1-d4ea-4198-95e2-b6b6bc8e6265","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":"1706.05098","last_updated":"2017-06-15T21:38:12Z","snapshot_observed_at":"2026-08-04T14:30:44.904839Z","submitted_at":"2017-06-15T21:38:12Z","title":"An Overview of Multi-Task Learning in Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.05098","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:1706.05098 , 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-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":33,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/1706.05098","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:3a798313fb2acda5fb419a75dff3caaa77e53e29095393a87fdddbadeb61958b","observation_id":"66bda9d3-7948-4aef-9b35-164e429a74b1","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2015 , publisher=","venue":null,"work_id":null,"year":2015},"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":34,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:12155dfb76210391c2df8793cf85c87e1296f7ea7ce675667b815743f9cc3261","observation_id":"1017edaa-1e98-49af-ae52-c7dec8feeff1","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":35,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:10d17fcde7bb33fa4c72421c48454f712ebd6685d241c0aee3ffadbbf00de386","observation_id":"0ebf7b55-b016-4227-b63c-b62a26f8769f","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":36,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a9ea22ed7efa27b44843d82216c22e66040614f35c090534ade7e29090ab1f20","observation_id":"9bd97cf6-4b3b-4682-b744-92bccfae6c21","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Computational Learning Theory , pages=","venue":null,"work_id":null,"year":2006},"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":37,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:5639a081c8718b0c8b49ab66d176d8b5fc0e38b260536f3a58532d2a65ab08fe","observation_id":"08dcb23f-0e63-4a51-88a0-629c2475dffe","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":38,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:9ed49e88db7b69b99eadf75f899f854eb754a2c76ad1e792d6e63d624e5917dd","observation_id":"96233d15-421d-431d-b718-afe8194fa30c","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Electronic colloquium on computational complexity (ECCC) , volume=","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":39,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:86ea218bc966509c81ce8c72fc75bc651a59f7d90391249fcaf43bca02d8d513","observation_id":"92a0e78e-56c1-46d4-9595-d437f973ac18","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Artificial Intelligence and Statistics , pages=","venue":null,"work_id":null,"year":2017},"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":40,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:9c50bf148e3b97ca7ab2bb296ebc7da20f09a9fed428e5769935c9f28e464369","observation_id":"32a066b8-d996-4b33-8df6-5adaa4b99278","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Theoretical Computer Science , volume=","venue":null,"work_id":null,"year":2018},"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":41,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:b44c10598839e2545def3e37bb2364460686a3c694a5e0c5f242c22d4360185e","observation_id":"c39b53d4-9d1b-4779-92a4-8f08f101219e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2022},"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":42,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:8ee993e1215a87609cc6d5c829f609d132b3fd09e5bdc9cb3aceabc6962eda09","observation_id":"110b70b1-5924-483c-a901-7c614d5148e7","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Machine learning , volume=","venue":null,"work_id":null,"year":2014},"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":43,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:6ab5ca86f77eec9933ad53326f57f040433ca9a129e101acdf0da3902980f498","observation_id":"3c58ed85-8387-4bce-8176-ed33c02eb5ca","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","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":44,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:8a5562bec8188c5c1b22c6ac8b0e4ce3c6c3d338f06fc74046e7d5b9126e81ec","observation_id":"754cab25-0f5a-432c-8c57-4eca83c84d54","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2019},"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":45,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:056c625ec3f8a46307104a713a22fe60266ee416a2cd454fb0cf13d0887f8752","observation_id":"799f3f83-e21b-49e4-9aca-c48c5ce9da78","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2019},"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":46,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a62c3cb72c78f4d4ce38bf5cb6ea6c24f4f4e9b0802edaa3adcb2358b8834ad2","observation_id":"db81a3a2-f5bc-4407-8c90-3ed91211bf3d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the 36th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":2019},"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":47,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:5ee501a51059c708efc30d6f03ba5711f22d2f55942816c4dfacda4bc2136c34","observation_id":"248b3906-0b34-4b0e-8fd4-785353377497","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2003 , publisher=","venue":null,"work_id":null,"year":2003},"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":48,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:0be3de6402fd0e3f7f6af418612e8005f3580b910d4fb6c254565aa12fefa2ba","observation_id":"904629d4-cc69-4dc2-b758-4c25dbcb909a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"The Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":2012},"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":49,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:698911d99cd60b45855d18705eeb654bdcfc203fc58a836ae2ef28008c7b987b","observation_id":"c3467a23-5703-467e-8c89-b9c786ca8579","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2017},"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":50,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a8887a91e20f94caaf73975d49cba702585bd832313dace030570c6030744d9a","observation_id":"b21f5cec-0f0c-4cb6-8006-b9ebb727c276","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the 34th International Conference on Machine Learning , pages =","venue":null,"work_id":null,"year":2017},"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":51,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:28cd287a02741be49d9429471c670e2988e994ebbff4edf621a2c7d87a55b635","observation_id":"63f8c822-20e8-4d85-b83e-8d866b69a75a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"ACM SIGMETRICS Performance Evaluation Review , volume=","venue":null,"work_id":null,"year":2022},"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":52,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:e814d5c66e5f82235a18b5db0044ce98ec5e4de7ea14ddaba96a16cf182af076","observation_id":"dfddb376-d13c-41c7-81ab-fafb23347d9e","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":"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-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:2306.00149 , 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-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":53,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/2306.00149","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:60e2da0362a017211bc5aa2da76a202558556b7957320697b8c010ed0c7b4a38","observation_id":"c77e87be-903f-4d4b-a164-a51677f8ac34","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"A Low Complexity Algorithm with O (","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":54,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:f48d9f29ea95fdeb0be5852a0015d6927d332ffda2b22941a5dca07606f85db4","observation_id":"af9cb386-0d9e-4cca-b444-d6d07fd12e79","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"29th IEEE Conference on Decision and Control , pages=","venue":null,"work_id":null,"year":1990},"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":55,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:4b47c27a2bd2b1e22cf0bd517d7ed93bbedaf8c29fca49b32c6e22072c67ac95","observation_id":"22b7ef18-df6e-40b7-b57f-11d01ffb6eca","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE Transactions on Communications , volume=","venue":null,"work_id":null,"year":1999},"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":56,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:03f22726e9ae9d96a293ec107fc7911d15815026067922fa091c2548c3f737dd","observation_id":"38722f99-4555-4f2d-81c6-dd8424b6588b","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"1992 , publisher=","venue":null,"work_id":null,"year":1992},"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":57,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:baf8d497dbe708a806bb3ae9a930651a2b0c29283f6e118cdcd34c8f0774e31a","observation_id":"4d5522a7-d9f2-4795-8184-27f3d33a4cf3","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-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-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-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":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:b3be9fca15869797a1e2e548b2c549ccae2fbe300a51d2b0f2f1ce90fb9ac2d0","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":", author=","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":59,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:30a5fa74ea31c7aa5daf920e74619be1dfb992a82255384c3c2fec4b8b86e5dd","observation_id":"b1f75668-c3ae-4345-a845-e80ca41bc08d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":60,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:1e4ceab8994342df886056507708aa86446ec4068a5f350437b6226e962a51c2","observation_id":"78b8d298-bf3d-4c92-a0b3-f2d988a6b6dc","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Machine Learning , pages=","venue":null,"work_id":null,"year":2016},"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":61,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:cd649df6c3211210cd2aef189dfb24a42ebe0635181a434449530e71dcf0441a","observation_id":"b2491e69-e137-4d84-9298-9bb17d9a1b8e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":62,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:f51bc6de5efe83f9f9f2db3f59ffcefa2c09bd4273116e6cd34e2ab07080206d","observation_id":"7fbcb1b8-0881-4b50-8f3b-aa3e37afc207","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt) , pages=","venue":null,"work_id":null,"year":2022},"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":63,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:cb1e400356af5190580263476b734bebfc1abda511c587d7953f642ba7b5ee89","observation_id":"6261d93b-712b-4aa7-921a-e13b278969e7","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in neural information processing systems , volume=","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":64,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:fe0659a38b3e2770033980d318341ee5ba32a769fe96ad60d00a8e04e580130b","observation_id":"079098b7-7b76-465f-a070-ab6b35f9c07a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":65,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:6fa2ad934510d37e859bbdf42687d792d15aa449359c5826e4c0b364abb5206a","observation_id":"3cce3008-28c2-40b3-a220-d3a64150f848","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":null,"venue":null,"work_id":null,"year":2024},"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":66,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:48093c23987389af07c47942b60655f81b92efed15b7095bc723e3f5c31484fd","observation_id":"16a17a48-b3b9-4ce0-950e-38f539f21074","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Mathematical Proceedings of the Cambridge Philosophical Society , volume=","venue":null,"work_id":null,"year":1952},"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":67,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:73a692abef3cbc10d9209c0bd862e25b3cde34e0a4d56f10c57601bb89c43548","observation_id":"c97da2bc-8421-4d88-8796-e70aa6c1c5e0","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","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":68,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d6f0d7db85555085dc259b631a1261a41b36621c1ad975cdebbacf73ff5b5d60","observation_id":"0239d7d9-210b-4155-b429-015f26d87e38","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":69,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:bf71e6bbafe48d817a991acddace7195cdef789f1cc997ac136436e4a2491426","observation_id":"b4a2e391-b76a-4b80-9b62-da405c1e1094","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in neural information processing systems , volume=","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":70,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:38ef02ad475d8fca7aa0c875b371c7b5d66b0b077e03684dbff1bc835d31f337","observation_id":"5af1c5b3-7a21-4e4a-8db1-2afa011d1cfc","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in neural information processing systems , volume=","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":71,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:701aca0e8f692afc7078d28429b724dbcfa1a09fa097b86b553eae187fe76110","observation_id":"c1b4e763-baa2-4af7-bf98-6c4c7f7e0629","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"1953 , publisher=","venue":null,"work_id":null,"year":1953},"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":72,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a399167a6bd790f175d9f367545798f8214f04b5ef64c8462d2fe9775cf3f20e","observation_id":"5e6e2e63-7573-48f0-986f-7d0bb2973523","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":73,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:559c380236ce00b6f697c4dc259b89ac64c1db687072edffa84dc45c5448fada","observation_id":"f19e7f3c-ee55-40cc-a437-70682f56533a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Foundations and Trends","venue":null,"work_id":null,"year":2012},"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":74,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:e406b6263a4fd341e36ad2c5b5014ede66402089763650ab1e0a54f0ae8d65ac","observation_id":"550ee652-9303-4f9f-a367-6ebee6a573c6","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":75,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:0586c476884e4c60fc79634d1873b75ec601a9bfb781521ae0732d470059da63","observation_id":"b008124a-df3f-461f-b678-b58c12444a15","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":", booktitle=","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":76,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:7e1a59882dac9c073cc427dae119e8c42c073e13d541f95d64ee986d9d6820ab","observation_id":"df90a60b-aa26-4ea4-8c44-0d06c4c24d09","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":2013},"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":77,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:301c19c14e1c4373d57074273c8c9dfb31585360223db1c440f3871213852d44","observation_id":"35f3acb9-5987-486b-bc43-ce39daef766a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the conference on fairness, accountability, and transparency , pages=","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":78,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a50bc7bfbdc4553ae697f5be01d18c47cbba87a7da1d3e6bfc1b6d9e5c1731f8","observation_id":"164e0b67-d51e-4b2a-a2e3-ae0850dc232c","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE INFOCOM 2018-IEEE Conference on Computer Communications , pages=","venue":null,"work_id":null,"year":2018},"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":79,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:56837cc818f5a91e93c9b989c6b1a3e6445e951bf314c217c04961275f9ea61e","observation_id":"564aaecb-135d-407c-97eb-bbca182c961a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"IEEE Transactions on Network Science and Engineering , volume=","venue":null,"work_id":null,"year":2019},"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":80,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d1d38437fac37c3f8fcf74f3ffc76a4b8bfe72cce3bc72fe8a67cf8e7dc67375","observation_id":"5160a686-fb7a-40ce-be0a-b26361a1c5f6","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the 2020 ACM/IEEE International Conference on Human-Robot Interaction , pages=","venue":null,"work_id":null,"year":2020},"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":81,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:be19205371c0a885058584898c16633e1d915dcb350887b59fdb1b5d085f1af8","observation_id":"1fc3c398-79ad-4cb2-95a9-3a5a2cb0612d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2004 , publisher=","venue":null,"work_id":null,"year":2004},"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":82,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:d25a2b8f3953d4d84e879a55f9490a55e9398a4926de0b49df42daa3d2ef7509","observation_id":"f5b35228-cfe8-4000-9c63-eaa82c9a6f27","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":83,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:fecd19417eb4be149f8a092bc27d36940336432242f878b0b5253e9ef994bc02","observation_id":"8c688dd5-dbf9-4814-9a60-372a5ef47a6d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Proceedings of the 24th International Conference on Artificial Intelligence , pages =","venue":null,"work_id":null,"year":2015},"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":84,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:77d4af2f8d06acc2b5ac6f2a1389fee92a9531a5b7fcf9998c8af5328bd44ac8","observation_id":"691a333c-b3a1-41d7-a0cc-3c2baa1efe1e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":85,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:bc36614de41a7bd2e15fe3d7f25d3368fc0139c7a02709726bddc5455848db3f","observation_id":"42a41212-557e-4c7f-83f0-23ce048537bb","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Advances in Neural Information Processing Systems , volume=","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":86,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:e4888cd11fbb11b7e2f4e2c65fc4fdca913a5d5697bce8404588f62146933e9c","observation_id":"b1df83c8-1d54-49dc-8816-98110a61c1fa","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"2020 , publisher=","venue":null,"work_id":null,"year":2020},"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":87,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:510a969b1f18620a0c4b621b644fb9e5d71cc27ca54fded3d938ef3ce3554cce","observation_id":"96ca9e09-1297-48d3-b81e-704dacde5489","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"1995 , publisher=","venue":null,"work_id":null,"year":1995},"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":88,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:ef850ae3c0b3c886a189b9079a3e9cf99ace2f1db67fb05ae694fb6d06f0e8b4","observation_id":"2f8e6bf2-c9ea-495e-a442-2ea25acd8e25","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":"1309.1541","last_updated":"2013-09-06T05:48:40Z","snapshot_observed_at":"2026-08-01T21:19:32.053983Z","submitted_at":"2013-09-06T05:48:40Z","title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1309.1541","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:1309.1541 , 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-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":89,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/1309.1541","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:43b49e12957825271e8fa5e9587229ed70935f4c1896e8e72853f42b1e144077","observation_id":"e1f897bc-bf1f-4efd-8c28-f39afd3c1e0d","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Journal of Machine Learning Research , volume=","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":90,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:cda8f104f9896435ae1c4d183acbcd98e834f8d928262e125db86afe4e50ae4b","observation_id":"6bbe010b-dc07-4b4d-80d0-0ca429544935","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"International Conference on Algorithmic Learning Theory , pages=","venue":null,"work_id":null,"year":2022},"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":91,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:b2539e20a9c0819eb682b809d0f1ded56e9cf68085be4d79e6f503ce3186bd60","observation_id":"1e7119f8-17f2-445a-ba04-5e53b9e17ae0","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"The Journal of Machine Learning Research , volume=","venue":null,"work_id":null,"year":2021},"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":92,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:1b6204794ce6b43a42ddeff192f872f2969b2c4c5552d517961f26656d2c5603","observation_id":"b7f29648-b137-494c-a797-a7c20824ba61","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2015},"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":93,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:4c11148f74e7b22c66e5ae204eeb8ac6a3843dcbbf7fbe271706c12ab7a45ffa","observation_id":"a4534114-a8db-4454-9c99-ba44117b0d8a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2018},"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":94,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:79fb4de680e710d2c5648a45d62797f004664fd74b1c53e861aa58b5e05429b1","observation_id":"ada68ed3-0edd-4e79-8d1e-7d9b4996d536","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Journal of the ACM , volume=","venue":null,"work_id":null,"year":2022},"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":95,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:0a63c258d1202df7ad467b680f0de75e5135b3cc517fe57dc2866dcec40221c7","observation_id":"d2647c00-c877-4627-a097-2fdabd70fc8e","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Operations research , volume=","venue":null,"work_id":null,"year":2005},"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":96,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:078d466707b92efe25b383446c0ccd69da1d4f72c289788e05ea762cde93096e","observation_id":"fdd9d74d-7240-4bd2-8253-2ff29d05b726","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2005},"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":97,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:a6b80d2c267bac6d6b07a875e1911f1cf0ec9e539c9860f0d6413cbc86b092e2","observation_id":"5f5fb054-9e9f-45f6-9941-0b5de5ef552a","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"Synthesis Lectures on Communication Networks , volume=","venue":null,"work_id":null,"year":2010},"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":98,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:46d5ddfafadda503151b9dcfb5ae2a181d38133edbe143d95dd8fe31e1c97253","observation_id":"08e2f0e5-d030-4aef-aecf-194047c05859","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":"2303.01745","last_updated":"2023-03-03T07:17:09Z","snapshot_observed_at":"2026-08-07T04:39:31.181271Z","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.01745","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:2303.01745 , 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-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":99,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/2303.01745","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:857fc2b3acc7e8d0c961296681aa717eb8696d12f53f1d731302ddcc49fa6045","observation_id":"b4077676-e2e0-4378-b8cd-da9d3c3c8e91","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"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":100,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:9f6b6c66ecd28ecf9aacc1cd88e16593b6437ed725ed1534716f78bf40cbe802","observation_id":"04d70bb8-77ef-49e3-9739-aedfb1155d05","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"}}],"paper":{"arxiv_id":"2607.10808","last_updated":"2026-07-12T15:36:04Z","latest_version":1,"primary_category":"cs.LG","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)"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":253},"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 100 of 253 outbound references and 0 inbound Pith citation observations for arXiv:2607.10808."}