{"as_of":"2026-08-10T00:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a125b5712a0217c73f3c27eb7969ae9a6d2d458dd4d32621440b77148b11a1af","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:57:52.361625Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T07:12:06.901135Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T07:14:02.569754Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"cited_work":{"arxiv_id":"2506.12781","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.12781","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unconstrained robust online convex opti- mization","venue":null,"work_id":"f8848340-fbab-4668-9f74-08a1983a22ef","year":2025},"citing_paper":{"arxiv_id":"2605.20515","last_updated":"2026-05-19T21:34:37Z","snapshot_observed_at":"2026-07-06T23:31:03.878152Z","submitted_at":"2026-05-19T21:34:37Z","title":"Online Conformal Prediction with Corrupted Feedback","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T07:12:06.901135Z"},"links":{"cited_paper":"/paper/2506.12781","citing_paper":"/paper/2605.20515"},"observation_digest":"sha256:b224de150533a43d8ea12a1fec01e21bb7b366f7bd1674458d69cd3e7c85f091","observation_id":"ffb2843e-1fcc-485d-8354-7c4280b565be","resolution":{"observed_at":"2026-05-21T07:14:02.571298Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.12781/citation-record","integrity":"/paper/2506.12781/integrity","json":"/paper/2506.12781/citation-record.json","paper":"/paper/2506.12781"},"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-07T00:57:53.517398Z","title":"L., Rakhlin, A., and Tewari, A","venue":null,"work_id":"ac8cc26b-2df5-45ac-b723-8769e165a3b5","year":2008},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:48.649231Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:f9214002df9ad5ecaba3636ee49ac1b7603f0e4954f0c31779c50c141c2ebbea","observation_id":"236cb475-6972-44ce-bbe0-c31ae8d9b43d","resolution":{"observed_at":"2026-08-07T00:57:53.521046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.506019Z","title":"Stochastic dueling bandits with adversarial corruption","venue":null,"work_id":"64567e3c-ece4-4be8-857b-bb6b80636c47","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:48.754501Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:e3dc22150dc1f43294bc6fec077d57f6da1eb148afaab4dc4a9b0e93ab10498b","observation_id":"904dde81-0cb8-4e47-bc2e-59a837f972d6","resolution":{"observed_at":"2026-08-07T00:57:53.509822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.494350Z","title":"Robust optimization, volume 28","venue":null,"work_id":"2a9daffa-7371-4a71-8ca2-20e972e03a3e","year":2009},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:48.826798Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:de943acdf9491001c665499e78beed047a98be864aff1d613b4e6a0e1c50a2c6","observation_id":"2b8654d8-1630-42e6-941a-a64fc9d9e16e","resolution":{"observed_at":"2026-08-07T00:57:53.498019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.483505Z","title":"Oracle-based robust optimization via online learning","venue":null,"work_id":"9417af4a-e547-432b-9c41-26bc63fb120c","year":2015},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:48.941015Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:2b4439310ad2b892d9a2351fa5027aab25636b461cd0f9f9c234eaf6b3e73b40","observation_id":"6d033022-f07d-4d24-a26f-940dcae281a3","resolution":{"observed_at":"2026-08-07T00:57:53.487005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.472339Z","title":"Convex optimization theory, volume 1","venue":null,"work_id":"9f8c8d9d-d138-43bd-a1a3-919268dca207","year":2009},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.008305Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:f39f822c33ee48ad0c3d6b6fa087372244753463e6ecac9e5c01811fc2f29286","observation_id":"b47bae2a-6641-4e04-9904-4fcbf80f9b81","resolution":{"observed_at":"2026-08-07T00:57:53.476031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.460910Z","title":"J., Li, X., Ma, Y., and Wright, J","venue":null,"work_id":"00601d6d-b35d-4564-989a-7c6271253885","year":2011},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.101680Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:0177e0c6144624e6ffc8b452b9cdd0b833d052559b1a01b0ffe88f1b20505ca0","observation_id":"bcccbb4e-1998-4443-b51d-336170ab98b8","resolution":{"observed_at":"2026-08-07T00:57:53.464316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.449728Z","title":"Gradient descent: Robustness to adversarial corruption","venue":null,"work_id":"7f73be8f-9149-4825-9afd-d92f21a6e4df","year":2022},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.229562Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:1c5708e135f988de33454e3ef568cc678fb08dc68bceca37d1baccbf775edfe1","observation_id":"f7789603-c451-4096-840f-630eb4c947fd","resolution":{"observed_at":"2026-08-07T00:57:53.453359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.438268Z","title":"Online and distribution-free robustness: Regression and contextual bandits with huber contamination","venue":null,"work_id":"341b9eb9-85e4-4a6e-8964-dd24a2681e67","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.329818Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:e9919e2dfaa0f858b2f9df03fe92b53cf85210b3e08223c214f9e26d73978ff8","observation_id":"7c3e3603-07cd-42c2-b856-ad425232cd19","resolution":{"observed_at":"2026-08-07T00:57:53.441891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08137","last_updated":"2020-07-16T06:44:44Z","snapshot_observed_at":"2026-08-08T21:00:24.447659Z","submitted_at":"2020-07-16T06:44:44Z","title":"Optimal Robust Linear Regression in Nearly Linear Time","version":1},"cited_work":{"arxiv_id":"2007.08137","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.08137","snapshot_observed_at":"2026-08-07T00:57:52.565549Z","title":"Optimal Robust Linear Regression in Nearly Linear Time","venue":"stat.ML","work_id":"58ec8b90-5724-475e-9cb2-cce691e3deee","year":2020},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.398969Z"},"links":{"cited_paper":"/paper/2007.08137","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:43d7655bdd044b1a02c8d0d1a63047f8d762b44a3cdbd8a5cb99daf44779010d","observation_id":"b651f2c8-93ee-4add-928a-eff2ce3bfd7a","resolution":{"observed_at":"2026-08-07T00:57:52.668605Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.427317Z","title":null,"venue":null,"work_id":"684577cb-cd3f-4aab-877b-273e8a4d51aa","year":2000},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.491162Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:0c09956934e1c01cb5d865a19eb1444cfd27263c85f54415eda2183831b4106e","observation_id":"f1363322-613b-4a36-a016-64d95ebbfa13","resolution":{"observed_at":"2026-08-07T00:57:53.430738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.415343Z","title":"Algorithms and Lower Bounds for Parameter-free Online Learning","venue":null,"work_id":"a8eea384-a972-4983-afb2-c8648401c11e","year":2018},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.636687Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:16fccd3294cb590b7dfd30fc83c44d2994223f83a25167dea0e8eaa624844666","observation_id":"1535ce87-84d3-47bb-8d6f-b49481ba2967","resolution":{"observed_at":"2026-08-07T00:57:53.419146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.402902Z","title":"Artificial constraints and hints for unbounded online learning","venue":null,"work_id":"7f02938c-5db2-4b9b-92da-c80741489e8f","year":2019},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.750780Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:7e6f8c92dcc4a3444b1254c5ce7050a612c92e7befc8089662a176678226a303","observation_id":"b92856d7-8522-40ef-ac58-8730a919665d","resolution":{"observed_at":"2026-08-07T00:57:53.406822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.390933Z","title":"and Mhammedi, Z","venue":null,"work_id":"4ffd9a91-d486-4fd8-b5a7-d99e1e3d0a2e","year":2024},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.856093Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:03da559d6d36141b43753faaf43401abd3b3b4e3b1defb83bcd1f21df8753866","observation_id":"92a58211-392d-434f-ad7d-4fdf14331157","resolution":{"observed_at":"2026-08-07T00:57:53.394753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.379112Z","title":"and Orabona, F","venue":null,"work_id":"8f09669f-5fec-478d-8478-d5c482605033","year":2018},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:49.980287Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:7607facfcdcd04808937793cd05c9484681209badb8f927ed67a2cc8998879cc","observation_id":"b6d4c16b-f660-4a2d-9b41-f64ee0e71d03","resolution":{"observed_at":"2026-08-07T00:57:53.383037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.367805Z","title":null,"venue":null,"work_id":"7d2e1e09-6f72-40f0-90a5-7939cb2ce5a0","year":2016},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.040870Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:be534fc6eb3ba3c49ec38c2d78afff0232f6a91c75d0f62ddbdc0017fb176489","observation_id":"3f697bb3-7e84-45ba-8832-c5cf4e47c228","resolution":{"observed_at":"2026-08-07T00:57:53.371429Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05911","last_updated":"2019-11-14T02:56:56Z","snapshot_observed_at":"2026-07-30T23:23:00.985786Z","submitted_at":"2019-11-14T02:56:56Z","title":"Recent Advances in Algorithmic High-Dimensional Robust Statistics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05911","snapshot_observed_at":"2026-08-07T00:57:50.123991Z","title":"and Kane, D","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.123991Z"},"links":{"cited_paper":"/paper/1911.05911","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:fa7f25333c0d09ab1055f409fa033fdcaddd02d79253ba2ab507cbd3567165f5","observation_id":"2c593b3b-3e3f-426e-a6e8-9d80a8c13900","resolution":{"observed_at":"2026-08-07T00:57:50.123991Z","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-07T00:57:53.356100Z","title":"C., Shalev-Shwartz, S., Singer, Y., and Tewari, A","venue":null,"work_id":"bdd619d1-75f8-4142-a2e9-0b45460c75b2","year":2010},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.194825Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:295d812ed91d5b846c7b2b8817fdfb50f73b7f85a71dd4abad13ce497d87c0e5","observation_id":"809e7260-df8a-495d-97cd-776366bbb5b5","resolution":{"observed_at":"2026-08-07T00:57:53.360033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.343971Z","title":"Better algorithms for stochastic bandits with adversarial corruptions","venue":null,"work_id":"199c382b-1e66-4d99-829b-c07413202e78","year":2019},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.270387Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:6e153d2d14c5afd6620f4c68f780549532c75554751540c3134fcb4ca3a0969f","observation_id":"833b1bc4-2495-44dd-bdd5-8fb39210da44","resolution":{"observed_at":"2026-08-07T00:57:53.347773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.331963Z","title":null,"venue":null,"work_id":"cc023bc1-64dc-4b7b-a377-dcae5d1be0e4","year":2004},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.318204Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:07db7ff3fcb1fa6d6099c387fda4635048f23c38dba8bb5821543d6e16611998","observation_id":"90c199ef-02e9-4268-b593-4b50d0a1de57","resolution":{"observed_at":"2026-08-07T00:57:53.335776Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.319535Z","title":"On optimal robustness to adversarial corruption in online decision problems","venue":null,"work_id":"dbb8ecf1-c684-4eba-bb9f-db1acca474cb","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.407682Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:6f325a338ee8e40a1325e4b05d59ee177c27dd513bdfaa4fe392b459ae926020","observation_id":"73d2aeeb-1e61-4507-9e41-1b9a334e4ff2","resolution":{"observed_at":"2026-08-07T00:57:53.323251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.307600Z","title":"and Cutkosky, A","venue":null,"work_id":"05796f7a-8ad6-4e5c-924d-0926c8e97c10","year":2022},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.446750Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:2f3f18afa6b6df97d204689b8378218f5861a43c7405e99ddbcba4f7c600f85d","observation_id":"40c05d23-b240-4b65-b37c-9138699bd7ed","resolution":{"observed_at":"2026-08-07T00:57:53.311263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.295903Z","title":"and Orabona, F","venue":null,"work_id":"2b120752-e53d-47cf-aff8-71a8efae870f","year":2019},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.532112Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:80c12ead159de46ab49a45818ffb70f1a5aab3642b226b419d2d375daffd4ec2","observation_id":"4a387484-4aeb-40ca-8a6e-4ff8703c1124","resolution":{"observed_at":"2026-08-07T00:57:53.299543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.284350Z","title":"K., and Meka, R","venue":null,"work_id":"60ce8d1c-64f5-4a95-b50e-ca8c6b09949c","year":2018},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.597074Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:471070c8de5ff2f2cfb84f08a484f757a2390c303e2dd470cd410b610b782ce7","observation_id":"c67071eb-9ec6-4305-9baa-2d8a18775049","resolution":{"observed_at":"2026-08-07T00:57:53.288071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.272666Z","title":"C., and Sidford, A","venue":null,"work_id":"b114ecf4-9aec-4317-ac9a-0d44cf05d514","year":2020},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.657417Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:0a4a5d104f406ecee011fc0e4256f33cfbb577a65954b21a8d734d7673a85291","observation_id":"74978626-f9a2-44b0-a345-61a9f2bde93a","resolution":{"observed_at":"2026-08-07T00:57:53.276474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.260785Z","title":"and Mendelson, S","venue":null,"work_id":"5be28aea-f724-4ff5-ac5d-019c4e1c6d0b","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.718033Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:dbff5f35bd647773164c98f3ba2ec52ad14a64900dda022ab2ea65522bd3bde3","observation_id":"2317283a-a986-46bd-b12b-2c823c7969bc","resolution":{"observed_at":"2026-08-07T00:57:53.264764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.248622Z","title":"Stochastic bandits robust to adversarial corruptions","venue":null,"work_id":"369cd0d5-9c4c-497a-8687-643bbafefc97","year":2018},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.775870Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:109fc9d639159f74ec3a5399c838cc881a7155998c3fd87997a812cb2a7e9b02","observation_id":"638847c4-7735-4d57-a434-863848569cfc","resolution":{"observed_at":"2026-08-07T00:57:53.252581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.236816Z","title":"and Streeter, M","venue":null,"work_id":"f67af99c-b2f6-4212-a0fe-6eee2cec8224","year":2012},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.832439Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:89158e01760fb7bef3df3eb064affda473430ec4d5ff390b096945ee16045e0a","observation_id":"f490967f-25fc-4650-bced-23bb2e3cb771","resolution":{"observed_at":"2026-08-07T00:57:53.240536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.225363Z","title":null,"venue":null,"work_id":"5228ebab-b5ec-45f6-a2f8-ce2302f4400b","year":2014},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:50.902447Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:9d8e7b777a28363a759bd7a5c8f523c35ffbb4b9883ad16a78f60ae51e90a867","observation_id":"b41c962a-17cf-49de-86ef-861f92cd93cb","resolution":{"observed_at":"2026-08-07T00:57:53.228756Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.213754Z","title":"and Koolen, W","venue":null,"work_id":"8fcdb13e-e28b-47d4-87b4-2e39aa2b5857","year":2020},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.013655Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:4a4bf5a42dbc1603fdfce68c2b79c55e50082f1176282237785b87da335f7e89","observation_id":"1f337920-6669-47b7-a402-f7a0c12e0048","resolution":{"observed_at":"2026-08-07T00:57:53.217248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.202836Z","title":"and Duchi, J","venue":null,"work_id":"164e7b31-6411-4ad3-b0e5-84858e562f2a","year":2016},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.075471Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:08a861911a97ca2238dcf3d0d6f5ee4f05668f1eb6777f451a65260cb7c0105f","observation_id":"e283c1c9-b1bd-4437-b544-0cf24aadc583","resolution":{"observed_at":"2026-08-07T00:57:53.206346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.190664Z","title":"Simultaneous model selection and optimization through parameter-free stochastic learning","venue":null,"work_id":"1ad6e6f2-453b-433b-bfcb-bb6e0620e7f8","year":2014},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.169054Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:48d5c7572cd1cf64b24d5d0ffd8640d37fe988a1e57db87220d34edd5bcdf94a","observation_id":"b20c20df-df03-4d4c-a006-d5c4391f8550","resolution":{"observed_at":"2026-08-07T00:57:53.194825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:51.207001Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.207001Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:04b31916338ecb1ea13763250e3aa5cdf8abc23d05025ebfea04ce0091428c9d","observation_id":"a0f3adde-e598-491d-a032-3143856b0291","resolution":{"observed_at":"2026-08-07T00:57:51.207001Z","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-07T00:57:53.178453Z","title":"and P \\'a l, D","venue":null,"work_id":"c826f61f-abda-4d6b-b589-a37ee04bac76","year":2016},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.301520Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:9e5f12b15a4880e30075367abb35349aef11e71d2f96d039d3d5c9320a65cef9","observation_id":"355ea98c-7aa0-4067-8f74-2a7e0f29263c","resolution":{"observed_at":"2026-08-07T00:57:53.182224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.02060","last_updated":"2019-09-04T19:07:33Z","snapshot_observed_at":"2026-07-06T08:19:12.871715Z","submitted_at":"2019-09-04T19:07:33Z","title":"Distributionally Robust Language Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.02060","snapshot_observed_at":"2026-08-07T00:57:51.361941Z","title":"B., and Liang, P","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.361941Z"},"links":{"cited_paper":"/paper/1909.02060","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:a90f0576223958be9b32995f665530ad939cc5003ac1ece164570a738b3c39d2","observation_id":"907c0a96-1565-4843-87ff-3d0ae34ff262","resolution":{"observed_at":"2026-08-07T00:57:51.361941Z","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-07T00:57:53.166947Z","title":"An online method for a class of distributionally robust optimization with non-convex objectives","venue":null,"work_id":"814887e0-b53f-44c9-959e-9995d9f918ab","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.453879Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:6be91a980a215617490b267abb755258ffc818f6a7c07d9d67282efdde078ff0","observation_id":"13b69790-04c5-434c-a6f2-40c2fc54a544","resolution":{"observed_at":"2026-08-07T00:57:53.170705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.154743Z","title":"M., Horn, C., Silva, J., and Marcia, R","venue":null,"work_id":"6b48e46f-ee2e-4440-aa38-d6f903f6c588","year":2012},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.529492Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:9e88f84aa597b2aff08bc1b42d95761bfb1e5d41609de6ff92ff9da0b01ea451","observation_id":"13d1d9d1-b258-436d-be01-dd2c337b2745","resolution":{"observed_at":"2026-08-07T00:57:53.158395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08731","last_updated":"2020-04-02T05:40:29Z","snapshot_observed_at":"2026-08-02T19:28:48.954133Z","submitted_at":"2019-11-20T06:43:41Z","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.08731","snapshot_observed_at":"2026-08-07T00:57:51.611013Z","title":"W., Hashimoto, T","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.611013Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:ad481e0fde365b6a46631e236c10afbf1c8b564fcc8bfc5e41af6e80ce424219","observation_id":"36dec06c-d3f8-4d42-b2fd-2ee4e40f7f68","resolution":{"observed_at":"2026-08-07T00:57:51.611013Z","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-07T00:57:53.143205Z","title":"and Narayanaswamy, B","venue":null,"work_id":"8ba9bfcb-7d22-4f5b-b777-2cf895b5c75c","year":2024},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.663810Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:6a2ee5a4d03be85a465ec87b3efb73169a15b049dbf0f14f97477ce58b93600e","observation_id":"864d862f-8afd-4c3a-9f4d-b30c9e24261a","resolution":{"observed_at":"2026-08-07T00:57:53.146874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.131996Z","title":"Y., and Song, Z","venue":null,"work_id":"bdf39998-708a-403f-ac7f-133c5a7621b8","year":2022},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.770708Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:b3ba46966828d538b97ec82a3b6ab687d6c3a061094c945a1fda3bceee60be94","observation_id":"21bbecde-7a76-48e5-887d-fa7528869865","resolution":{"observed_at":"2026-08-07T00:57:53.135488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.120261Z","title":null,"venue":null,"work_id":"841d5f9a-e3fa-466e-bed5-834e13675237","year":2002},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.836329Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:14cddc75ce130d72dffd2b9c165cb8b85dbf2ea824727e1df45f72362079323a","observation_id":"688e98fd-fe2f-48e0-898d-c607dd92eea2","resolution":{"observed_at":"2026-08-07T00:57:53.123691Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.108777Z","title":"User-specified local differential privacy in unconstrained adaptive online learning","venue":null,"work_id":"c23bc127-f964-48c2-9826-ba3bc4dc5489","year":2019},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.926295Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:1b14c7e729b14e083ca2347ad0ae1a20a8b142280a02ac9d57cf254110d08a09","observation_id":"0d1954b9-3896-4798-8e52-62fdcb674ee5","resolution":{"observed_at":"2026-08-07T00:57:53.112495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.097135Z","title":"M., and Kotlowski, W","venue":null,"work_id":"caadfe8c-6cde-4710-ac3d-c8666fd28086","year":2021},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:51.973705Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:c3faa4f05e910acf12293758281e6e75a56743cf21bcc502baaaae825e4bccf8","observation_id":"58f048db-9e02-414e-a85f-a4530b145263","resolution":{"observed_at":"2026-08-07T00:57:53.100972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.084472Z","title":"M., Pham, H., Dong, X., Du, N., Liu, H., Lu, Y., Liang, P","venue":null,"work_id":"03d5f3ca-f54d-4f77-b39f-a3889a66917f","year":2023},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.033716Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:7a9944dfcc3905c4cfa587643b3c529823fe4fc529055d347a43ebea762b18ae","observation_id":"abae6fb7-13a1-4547-a89d-c9058680c6f1","resolution":{"observed_at":"2026-08-07T00:57:53.088531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.071837Z","title":"and Cutkosky, A","venue":null,"work_id":"2df2be8b-0628-40e0-b2eb-a7c98e287a1e","year":2022},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.122974Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:7ee8453edc18ac3608deb813f265f15c114a652f3d54aeab43f242e97cca9a9b","observation_id":"f9421438-be21-487f-af35-ec7632824f44","resolution":{"observed_at":"2026-08-07T00:57:53.075509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.058574Z","title":"Pde-based optimal strategy for unconstrained online learning","venue":null,"work_id":"75e757a4-7678-4b6d-b14f-0d5043b8166e","year":2022},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.153093Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:39227a8ba2e56c0d3efcf0c6ee59be726f9951293a9c69ef291b54bae6cbe03c","observation_id":"c489b192-0743-4832-9c9d-0a62ded62654","resolution":{"observed_at":"2026-08-07T00:57:53.062861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:53.046228Z","title":null,"venue":null,"work_id":"b7ac804a-24a1-4819-8b81-1f284ad688f9","year":2024},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.241090Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:a20ce1b70961827728c81104f609589710eb246e4cc3c8a17acaa55e915e1b75","observation_id":"4fc20c3a-1317-4c68-8d20-65ce88f36e53","resolution":{"observed_at":"2026-08-07T00:57:53.049969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:52.929683Z","title":"and Paffenroth, R","venue":null,"work_id":"2b7e8a41-a821-49f5-9383-e1696809710e","year":2017},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.273463Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:f565fc2486e8e4f2f4643cf965338e0d30b231d213ac558e21a809b3a0e6c7e6","observation_id":"8c673b56-fd3f-4cb2-96e4-38cfbbbc9803","resolution":{"observed_at":"2026-08-07T00:57:53.037586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:52.794830Z","title":"Online convex programming and generalized infinitesimal gradient ascent","venue":null,"work_id":"3e44eeb6-07e9-47ed-85ab-ed5aef6d532c","year":2003},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.288275Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:3759e8c80a5a1b66989dd80012da7781d4a7f80d3fa61f10a66a9735118021d8","observation_id":"ee69c913-6323-41a2-8357-57f75dbf6ec3","resolution":{"observed_at":"2026-08-07T00:57:52.870175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"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"}],"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-07T00:57:52.361625Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:57:52.361625Z"},"links":{"citing_paper":"/paper/2506.12781"},"observation_digest":"sha256:15a8632699eb1186da32c460a943bc8f1c74e7b076f3dde2ec9c16eab4ae198c","observation_id":"9ca10b93-40be-43b9-b031-a871d9d9a3df","resolution":{"observed_at":"2026-08-07T00:57:52.361625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.12781","last_updated":"2025-06-15T09:21:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T14:07:18.291270Z","submitted_at":"2025-06-15T09:21:15Z","title":"Unconstrained Robust Online Convex Optimization"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":49},"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 10 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 1 inbound Pith citation observation for arXiv:2506.12781."}