{"as_of":"2026-08-21T12:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:876dfa00f3170183b25814c1e6ec1f2a455dae188e1018703c2ab028433de7f8","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T22:13:07.433204Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.26373/citation-record","integrity":"/paper/2605.26373/integrity","json":"/paper/2605.26373/citation-record.json","paper":"/paper/2605.26373"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.10626","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:13:59.319530Z","title":"Stochastic optimization under hidden convexity.SIAM Journal on Optimization, 35(4):2544–2571, 2025a","venue":null,"work_id":"6dc98c46-c40a-43d1-add0-f8a64b0ce7f0","year":null},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:f18543a3c40a82f2b83074c6058d5985b985a0e487e32745443407264c6b9082","observation_id":"16b328e0-cd19-49c5-b2dc-6796b6040194","resolution":{"observed_at":"2026-06-29T22:13:59.322038Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2402.06535","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T09:17:48.733783Z","title":"Bandit convex optimisation","venue":null,"work_id":"9baa8891-3d52-4cde-924a-28c6ed27f5ec","year":2024},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:6b73d7f6763d44ad9a35ff1645c359f0b816536d6b4dd922767934c7c16b0560","observation_id":"59c7ef90-9276-4ba0-bad1-85df209dbfc0","resolution":{"observed_at":"2026-06-29T22:13:59.331521Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":"1912.13213","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-07-04T10:39:44.912057Z","title":"A Modern Introduction to Online Learning","venue":"cs.LG","work_id":"e1cb6c30-151b-4dc8-a662-2c547f07874f","year":2019},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:e8819fbac76023644092732388027e25869c017828204c149256d281595cc4bb","observation_id":"68a5c221-30eb-4e20-9a5a-2a82e56a9f18","resolution":{"observed_at":"2026-06-29T22:13:59.324494Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.23831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:13:59.325757Z","title":"Unveiling hidden convexity in deep learning: A sparse signal processing perspective.arXiv preprint arXiv:2603.23831,","venue":null,"work_id":"6ed6d888-73db-4faf-901a-3b9467a3260f","year":null},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:8cd26a46e95f12f5efc1e140f9081c74b4302769b44d02af28b049075c5b5ea9","observation_id":"eb1112e4-1d90-4fde-b0a1-6429bb2c7d43","resolution":{"observed_at":"2026-06-29T22:13:59.328124Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:13:07.433204Z","title":"Using Assumption 2, we obtain: ∥Jεq t (q(xt+1))∥=∥J q−1(q(xt+1))−J q−1(yt)∥ ≤G∥q(x t+1)−y t∥ ≤ηG 2 ˆGF , where the last step uses the first estimate (i) proved above","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:ace7264c2bf35c0f43940ee4ec738f0457de892f714660ca062599c0d14d57dc","observation_id":"b2540298-29d0-4d12-aeb8-803061fa7416","resolution":{"observed_at":"2026-06-29T22:13:07.433204Z","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-06-29T22:13:07.433204Z","title":"We now control the norm of the bias∥bt∥ for any t","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T22:13:07.433204Z"},"links":{"citing_paper":"/paper/2605.26373"},"observation_digest":"sha256:50e02421d385858a45aea926f045f2dc5f4f416e89bef8000615457a5c5c7bef","observation_id":"5e80c4a7-e868-47ae-9f65-3f67a0428af0","resolution":{"observed_at":"2026-06-29T22:13:07.433204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26373","last_updated":"2026-05-25T22:45:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T05:34:06.643679Z","submitted_at":"2026-05-25T22:45:04Z","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":6},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2605.26373."}