{"as_of":"2026-08-22T11:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1130ebdb70a914d00028eec1520125ba1e25eaeedd4fe71c67ca86c67ceac302","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T02:23:42.290421Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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.25480/citation-record","integrity":"/paper/2607.25480/integrity","json":"/paper/2607.25480/citation-record.json","paper":"/paper/2607.25480"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:23:41.493470Z","title":"Projection-free bandit convex optimization","venue":null,"work_id":null,"year":2047},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.493470Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:9632514fc613e0e948a2b53ce5f7df0276234de13b610acbb614297e5a32ad32","observation_id":"50d875b7-2491-4e4c-9aa0-84a73b00cb12","resolution":{"observed_at":"2026-08-01T02:23:41.493470Z","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-08-01T02:23:42.229950Z","title":"Figure 3 shows the percentage contribution of gradient refinement versus Polyak correction for each problem","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:42.229950Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:d7ed650be9970dd941b312d0f8f6bc01923fd2e73d05a3c839a3d07008679d30","observation_id":"3ff45993-95df-49a4-93a8-bbee5c3d101c","resolution":{"observed_at":"2026-08-01T02:23:42.229950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.04783","last_updated":"2017-02-17T01:21:12Z","snapshot_observed_at":"2026-08-14T21:16:17.911774Z","submitted_at":"2017-02-15T21:27:06Z","title":"Online Convex Optimization with Time-Varying Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-08-01T02:23:41.675720Z","title":"Online convex optimization with time-varying constraints.arXiv preprint arXiv:1702.04783,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.675720Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:728e8d6854eef15b35b82f412741c4d901757be0d6b02c6e46a9e5f0774ee19f","observation_id":"39c0469b-208e-47d8-a36d-0c1331cae96c","resolution":{"observed_at":"2026-08-01T02:23:41.675720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T02:23:41.899090Z","title":"generalized Pythagorean projection","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.899090Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:83dba893dcd5f6f33918e70084150e0f355c1932ba1879ea39b3c3416735b8a1","observation_id":"1ed73314-8105-48be-a5e7-fddb82708117","resolution":{"observed_at":"2026-08-01T02:23:41.899090Z","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-08-01T02:23:41.974236Z","title":"Sinceg(v) =−ρ >−ϵ, we havev /∈C ϵ","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.974236Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:848a5aeb9f21eab576d5c412f662ab194541d75f685911c98b2a7ec6d818b77a","observation_id":"d8da2a9b-b40c-47c7-9a13-4d0b3fe77f86","resolution":{"observed_at":"2026-08-01T02:23:41.974236Z","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-08-01T02:23:42.070050Z","title":"Therefore(B) = c 2 ∑ tbt/√St≤c (√GT +ϵ 0−√ϵ0 )","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:42.070050Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:ea8a79833e96539f4fd5cf8e3deee9df1ff4332f293e1081f3197231cbf8042e","observation_id":"51a9b6df-b015-453c-9209-b67586353a87","resolution":{"observed_at":"2026-08-01T02:23:42.070050Z","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-08-01T02:23:42.156105Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:42.156105Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:865d97dbcf2df8ed26854be7ba88b2eba14e53069238799d19de655fe26d06ef","observation_id":"c6bb2794-89d4-4485-a6d1-fd6e78966fc6","resolution":{"observed_at":"2026-08-01T02:23:42.156105Z","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-08-01T02:23:42.290421Z","title":"B.3 Sensitivity Analysis We examine how the bound improvement varies with the step sizeηand the shrinkage parameterρ","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:42.290421Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:20dd07b657d05df1517e936a4b630a1519591c3ec1d346389a6364db7251988e","observation_id":"3749f7b4-42b6-4c70-92d3-7654dfad3691","resolution":{"observed_at":"2026-08-01T02:23:42.290421Z","resolver_source":null,"status":"malformed_identifier"},"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-08-01T02:23:41.751230Z","title":"Jacob Steinhardt and Percy Liang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.751230Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:24b2879d5af96e31fc669e42502cdea8c2e8dc5d7577c27dd5965ab413be9bb6","observation_id":"66115df6-63f0-4e5e-bf68-71e6dba6a095","resolution":{"observed_at":"2026-08-01T02:23:41.751230Z","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-08-01T02:23:41.592676Z","title":"16 Elad Hazan and Satyen Kale","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.592676Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:56b255eb31a4e17ab5d710b21377fff61fddb6b06998953fbcd4fdfe621f008a","observation_id":"cd93e9df-9e94-419e-9b07-9cb0bdb6c17a","resolution":{"observed_at":"2026-08-01T02:23:41.592676Z","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-08-01T02:23:41.433965Z","title":"Amir Beck.First-order methods in optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.433965Z"},"links":{"citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:d5c3e0ba31a949d2c5839eacbe1c631483f00c44a201a08200a7ee2218fcf4d9","observation_id":"b9a82ddc-c9ff-4af5-b643-5086c7e72f38","resolution":{"observed_at":"2026-08-01T02:23:41.433965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.08028","last_updated":"2026-06-06T07:40:55Z","snapshot_observed_at":"2026-07-06T23:47:33.680573Z","submitted_at":"2026-06-06T07:40:55Z","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.08028","snapshot_observed_at":"2026-08-01T02:23:41.823447Z","title":"Dynamic regret with untrusted decision predictions via heterogeneous expert aggregation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T02:23:41.823447Z"},"links":{"cited_paper":"/paper/2606.08028","citing_paper":"/paper/2607.25480"},"observation_digest":"sha256:8a1b4c1055a6be8e6d67c27d433b1c32888683d626fdc6ed66d19d028be45e3d","observation_id":"d6022178-133b-40b8-a3e0-3bd9880bc59b","resolution":{"observed_at":"2026-08-01T02:23:41.823447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.25480","last_updated":"2026-07-28T09:13:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T12:17:37.546033Z","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":12},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2607.25480."}