{"as_of":"2026-08-08T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:420d411a570bcaedb56c8561048a0d3258e055dca9671036203d036f21ce837b","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:44:19.505685Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.07595/citation-record","integrity":"/paper/2506.07595/integrity","json":"/paper/2506.07595/citation-record.json","paper":"/paper/2506.07595"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:22.697403Z","title":"Observe that, given such a bound on the cheating term, we now have to consider three different terms as shown in Equation (17)","venue":null,"work_id":"d87daac0-9835-4ea9-84a2-cf418db1fbd8","year":2025},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.280723Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:360d18ed9f3b972d95e5e1bb187de55a99dc5c88e5efdac603ab5497c30a3d77","observation_id":"e6b075b6-55f0-4875-9a04-d846a04d4470","resolution":{"observed_at":"2026-08-07T05:44:22.834877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:22.943226Z","title":"Then, we have ∥z1 −z 2∥2 A1 +∥z 1 −z 2∥2 A2 ≤ ⟨w1 −w 2, z2 −z 1⟩+ (ψ 1(z2)−ψ 2(z2))−(ψ 1(z1)−ψ 2(z1))","venue":null,"work_id":"2d405464-0d91-4475-8e8e-31554bfec6cc","year":2007},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.102379Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:856b08e033c94b7ae5a94949cc8461074b3f1198758d0cac3f1a7dbaeae2b73d","observation_id":"c26026a7-eb87-4944-85e9-e815186e5bc7","resolution":{"observed_at":"2026-08-07T05:44:23.149799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:21.305458Z","title":"(2024) only manage to show that this algorithm achieves regret O dmax(G2+D) λ lnT+ dmaxG λ2 under Theorems 2.3 and 2.4","venue":null,"work_id":"7ccd503a-62ae-4883-a0a2-a10dfd0aa449","year":2024},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:19.048884Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:d90dd89e297c7203355f3b89b1cec011b1709c3dbe67d2a93df9009b9e483fce","observation_id":"1b20db1c-f6e8-44ba-9482-13d0e2c5fbd3","resolution":{"observed_at":"2026-08-07T05:44:21.443288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:23.269353Z","title":"Auxiliary results In this section, we show several auxiliary lemmas that will be helpful throughout the paper","venue":null,"work_id":"0947aea9-92c1-4539-9645-d983e101b85b","year":2025},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.936700Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:2a410328e6258b85e33cabafd0d476c1380cf123d457833e564ca5f4dafc940b","observation_id":"0f96f2a1-ded3-40c3-a351-18a66e6ce974","resolution":{"observed_at":"2026-08-07T05:44:23.425124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:22.385371Z","title":"linearized","venue":null,"work_id":"e5418743-0a8f-4bec-aecd-2ae21c01f664","year":2020},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.402140Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:4ed4ebee28402425c7288e40537b79178013e68b7454e90a8f15c5a60777ba16","observation_id":"dbf27045-8175-452d-8d02-0383a6449862","resolution":{"observed_at":"2026-08-07T05:44:22.543668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:22.125421Z","title":null,"venue":null,"work_id":"65a25c63-92a9-4895-9b57-38f59851a15f","year":2020},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.569302Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:a8fd2c155cdec4725e0824794e4aee65364eb0c775fc4e820d172ad9c2b594cd","observation_id":"a208cbd4-9d14-4806-9618-69f3f91441ec","resolution":{"observed_at":"2026-08-07T05:44:22.259815Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:21.845348Z","title":null,"venue":null,"work_id":"1695c9fc-6c3a-4de0-9754-1c1227217499","year":2025},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.712412Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:106f722a2e9718ab66800857f28db2f14c5a467c5fd4d06b6e8935032a86cf9a","observation_id":"f6ee2427-0187-4112-a6f6-01ea86813fd3","resolution":{"observed_at":"2026-08-07T05:44:21.976958Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:21.568926Z","title":"(2024) in their Algorithm","venue":null,"work_id":"82528eaf-3c42-489a-be00-6ea2832c42ff","year":2024},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:18.845746Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:0c6ea4c92cbea271caf58896ee3b53dae32e87a301d731869f6031798f041e23","observation_id":"754b89ac-d03b-430a-9e16-a30685560360","resolution":{"observed_at":"2026-08-07T05:44:21.729051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:20.990461Z","title":"linearized","venue":null,"work_id":"f3a864b6-4678-478d-b19b-2c2e9adc55cc","year":2021},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:19.215749Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:077d9604c26a556220f45fe05977d2504345ec910d16e61363dd42e4931641d1","observation_id":"c36ab7d9-df93-4b51-b362-c7c0da227d26","resolution":{"observed_at":"2026-08-07T05:44:21.160631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:20.643356Z","title":null,"venue":null,"work_id":"ea6e8ae8-65e7-4c71-8ab4-e3357600c709","year":2025},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:19.340349Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:a0542f0d25d6179221d9182d8f04b3a88ebf29f0d3cd6e44adab9ebdab501ee6","observation_id":"8d97a8af-e4ad-401d-a004-08ac3d01a08e","resolution":{"observed_at":"2026-08-07T05:44:20.819718Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:20.307156Z","title":null,"venue":null,"work_id":"0cc63a7e-f386-4e2e-9382-a94deb2ecc4f","year":2023},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:19.505685Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:4fd5c30548fa2f1bdd5bf6bcf5b28f359e24a2b86baa1695fb839f9e2aa76736","observation_id":"24fb4c5b-f296-402c-9c96-cd81e4150534","resolution":{"observed_at":"2026-08-07T05:44:20.458563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:23.769844Z","title":"Online sequential decision- making with unknown delays","venue":null,"work_id":"54792db5-2a86-402c-bcea-124ab256852d","year":2024},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.629525Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:819463357a9cecd7a6ccaef0a9f3a24925412f129107a557f1cc69e0a3467d85","observation_id":"c1012b3a-11be-4e18-ab8b-082f8aa83eaa","resolution":{"observed_at":"2026-08-07T05:44:25.718372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-07T05:44:17.170340Z","title":"A modern introduction to online learning.arXiv preprint arXiv:1912.13213v7,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.170340Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:fb415d5a9da56f19ecb4edb64e93a6acd474993beb2202a89e557e9905fef6b9","observation_id":"d08981c3-25e0-475e-a777-4155509a186c","resolution":{"observed_at":"2026-08-07T05:44:17.170340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19856","last_updated":"2025-06-26T16:47:52Z","snapshot_observed_at":"2026-08-07T16:37:44.078141Z","submitted_at":"2025-03-25T17:20:39Z","title":"Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs","version":2},"cited_work":{"arxiv_id":"2503.19856","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.19856","snapshot_observed_at":"2026-08-07T05:44:19.695201Z","title":"Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs","venue":"cs.LG","work_id":"dbba1a6f-b1e5-44ec-a8af-976f8da848b8","year":2025},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.309557Z"},"links":{"cited_paper":"/paper/2503.19856","citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:470ea63611dab4f07ef733a0ffaee7043cb60d80b01ef00c605545af87016387","observation_id":"9db28651-0f50-4d2d-b115-adab9c9ac6fe","resolution":{"observed_at":"2026-08-07T05:44:19.811650Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T05:44:16.803719Z","title":"Hazan, E., Agarwal, A., and Kale, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:16.803719Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:a545149dc6a53571a0f56cb32a534c776b9d37923de68b994a0949148198437c","observation_id":"67fc87dd-5bd2-4527-8abc-7458b7e7ea52","resolution":{"observed_at":"2026-08-07T05:44:16.803719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:25.944068Z","title":"and Cesa-Bianchi, N","venue":null,"work_id":"606add73-37c3-4c6d-a0ca-4f26a5e5c7bc","year":2022},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:16.950413Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:afcfb0ae36080be4095921f33261cd71089e31cfa4122942c3a5201242ee26ef","observation_id":"d90a6d43-76a7-4f5b-a71d-7b6aa8319e5e","resolution":{"observed_at":"2026-08-07T05:44:26.028736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:25.780205Z","title":null,"venue":null,"work_id":"680d3b2b-a4df-46be-ba6b-8c451d0b0a62","year":1959},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.447788Z"},"links":{"citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:7100a07dfad0f1fa3ca5e09ec78a05b9125c611273780b3b44f0b56d3570456f","observation_id":"97b806b2-0bf3-4f7e-bfba-43de7af28136","resolution":{"observed_at":"2026-08-07T05:44:25.844092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0911.0491","last_updated":"2009-11-03T05:25:51Z","snapshot_observed_at":"2026-07-06T02:03:36.168517Z","submitted_at":"2009-11-03T05:25:51Z","title":"Slow Learners are Fast","version":1},"cited_work":{"arxiv_id":"0911.0491","doi":null,"metadata_source":"pith","pith_arxiv_id":"0911.0491","snapshot_observed_at":"2026-08-07T05:44:19.997034Z","title":"Slow Learners are Fast","venue":"math.OC","work_id":"3add3be4-b5b1-441a-bb2d-b042e52d67a3","year":2009},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.069608Z"},"links":{"cited_paper":"/paper/0911.0491","citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:bb8e9ec761b55bb6958f240f2a165ee09327b56904949c5ac53b6722d1bd7a91","observation_id":"e6015c48-650e-44f3-a4e9-e0a3431cadb6","resolution":{"observed_at":"2026-08-07T05:44:20.132117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12528","last_updated":"2025-02-20T01:16:02Z","snapshot_observed_at":"2026-08-07T18:10:14.162812Z","submitted_at":"2025-02-18T04:32:51Z","title":"Contextual Linear Bandits with Delay as Payoff","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12528","snapshot_observed_at":"2026-08-07T05:44:17.806672Z","title":"Contextual linear bandits with delay as payoff.arXiv preprint arXiv:2502.12528v2,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:17.806672Z"},"links":{"cited_paper":"/paper/2502.12528","citing_paper":"/paper/2506.07595"},"observation_digest":"sha256:80b681b638c4690a4610d67ee32aa0dac5a7194bf6c8ae1d7346d6ab70300c2c","observation_id":"3ca4441b-c43d-41a1-9cfa-23cc7b760bf8","resolution":{"observed_at":"2026-08-07T05:44:17.806672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.07595","last_updated":"2025-06-09T09:49:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T05:27:42.243828Z","submitted_at":"2025-06-09T09:49:54Z","title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":19},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2506.07595."}