{"as_of":"2026-08-20T21:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a0ac7bb9befc3cd6b96a094df7ba2d79ae0ac791dfe16276845ca777ffb09b8","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:00:43.112037Z","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-07-03T23:39:03.761139Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-11T18:26:46.852334Z","title":"Introduction to online convex optimization, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.08060","last_updated":"2025-03-12T21:09:19Z","snapshot_observed_at":"2026-08-12T04:56:44.227476Z","submitted_at":"2024-12-11T03:06:42Z","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T18:26:46.852334Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2412.08060"},"observation_digest":"sha256:4e92dbe80d0d81a3f3a8cb4f719d693f9046851b023487ed0155e266effe46f5","observation_id":"82218bfe-5993-4842-a2d2-0480eb49e494","resolution":{"observed_at":"2026-08-11T18:26:46.852334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-10T21:05:16.356510Z","title":"Introduction to online convex optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.356510Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:7c16452e5333163cc696d8a2b4f7b09d28a4dcc33165f484952f606c8d07f53b","observation_id":"16515729-5222-488c-b4f9-cbbddd05be9e","resolution":{"observed_at":"2026-08-10T21:05:16.356510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-09T00:26:51.544940Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-20T05:36:52.470619Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.544940Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:6ac11c406192307027d276be0177504e450ba1627863e9d0f31b87f1cc723e27","observation_id":"f77a9955-5b13-4fd6-ac7a-d0a96d12721e","resolution":{"observed_at":"2026-08-09T00:26:51.544940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-15T22:00:43.112037Z","title":"Introduction to online convex optimizatio n","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2505.08557","last_updated":"2025-05-13T13:33:36Z","snapshot_observed_at":"2026-08-20T20:02:50.010463Z","submitted_at":"2025-05-13T13:33:36Z","title":"Online Learning and Unlearning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T22:00:43.112037Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2505.08557"},"observation_digest":"sha256:74141f21a2420b939dd4dd828e10f160e4ed06463eed86eacd1b55970705f766","observation_id":"6db6cb89-adc8-420c-ba42-c6dc1fe2bf0f","resolution":{"observed_at":"2026-08-15T22:00:43.112037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-06T19:29:04.948864Z","title":"CoRR abs/1909.05207 (2023) 11","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06035","last_updated":"2025-07-08T14:37:41Z","snapshot_observed_at":"2026-08-18T09:11:31.421977Z","submitted_at":"2025-07-08T14:37:41Z","title":"Rethinking Pricing in Energy Markets: Pay-as-Bid vs Pay-as-Clear","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:29:04.948864Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2507.06035"},"observation_digest":"sha256:7ce3879d33cf568ea32b461cd67e3fbcaa1b8b0051f4ef9423424ffd7b49c7f0","observation_id":"70abc63c-10bb-463c-ac0f-43cac7908c16","resolution":{"observed_at":"2026-08-06T19:29:04.948864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-15T18:21:41.489445Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.18289","last_updated":"2025-07-24T10:51:11Z","snapshot_observed_at":"2026-08-18T00:21:56.042262Z","submitted_at":"2025-07-24T10:51:11Z","title":"Scheduzz: Constraint-based Fuzz Driver Generation with Dual Scheduling","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:21:41.489445Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2507.18289"},"observation_digest":"sha256:eb8b9a291185f8a1d248ad87cfe8cff544c64741ea9a38437d5340d4ffe0d097","observation_id":"dbd57f2f-d177-48c4-9c56-5873258acd12","resolution":{"observed_at":"2026-08-15T18:21:41.489445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-04T20:12:37.930775Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2509.08911","last_updated":"2025-09-10T18:15:41Z","snapshot_observed_at":"2026-08-17T04:23:56.144521Z","submitted_at":"2025-09-10T18:15:41Z","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T20:12:37.930775Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2509.08911"},"observation_digest":"sha256:81041f4441ced9b17b5255228c52d6adc05fb2a6bcdc392396c41ec1a52b4224","observation_id":"cdf543cd-6be4-44f0-b08b-244df8b784ab","resolution":{"observed_at":"2026-08-04T20:12:37.930775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2601.17942","last_updated":"2026-01-25T18:38:58Z","snapshot_observed_at":"2026-08-15T05:36:40.245881Z","submitted_at":"2026-01-25T18:38:58Z","title":"LLM-Based SQL Generation: Prompting, Self-Refinement, and Adaptive Weighted Majority Voting","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T10:59:09.811335Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2601.17942"},"observation_digest":"sha256:006c41a16c6b65b5d404440951b93cdd0b69c42b78f567c0a1eb68b3abe57808","observation_id":"e781a775-6986-4d8b-8cc0-00f16848e9ed","resolution":{"observed_at":"2026-05-16T11:00:51.688092Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2603.22596","last_updated":"2026-08-10T16:26:01Z","snapshot_observed_at":"2026-08-16T01:35:13.234279Z","submitted_at":"2026-03-23T21:45:38Z","title":"ParlayMarket: Automated Market Making for Parlay-style Joint Contracts","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T10:26:29.024435Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2603.22596"},"observation_digest":"sha256:df25b205296083a7aa7b0949d9dad9e019e03822155993b4cb49e744f8b5ef00","observation_id":"aa1dd9f8-4345-41b2-873e-f762319e3083","resolution":{"observed_at":"2026-05-21T10:30:00.321693Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2604.15416","last_updated":"2026-04-16T17:55:36Z","snapshot_observed_at":"2026-08-15T05:22:14.623643Z","submitted_at":"2026-04-16T17:55:36Z","title":"StoSignSGD: Unbiased Structural Stochasticity Fixes SignSGD for Training Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T12:10:44.802059Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2604.15416"},"observation_digest":"sha256:05978cf8d71c6c5e545d988d12e7255c397a0f88a05bb15faed5a1f181c7dba7","observation_id":"804ed681-fb91-4502-a08a-baf5846921b1","resolution":{"observed_at":"2026-05-10T12:15:22.200132Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.06190","last_updated":"2026-05-07T13:04:49Z","snapshot_observed_at":"2026-08-15T01:46:09.596166Z","submitted_at":"2026-05-07T13:04:49Z","title":"Constrained Contextual Bandits with Adversarial Contexts","version":1},"reference_index":152,"source":"arxiv_source","source_observed_at":"2026-05-08T13:36:34.355048Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.06190"},"observation_digest":"sha256:1c60846f19eb1436f668cae6c4586a68a955839258b42c5f34b1fc04296a4c05","observation_id":"af0b3d30-7efb-44e5-a37c-97cefc806755","resolution":{"observed_at":"2026-05-11T18:51:08.082257Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.08290","last_updated":"2026-05-08T08:22:43Z","snapshot_observed_at":"2026-08-18T03:36:54.885490Z","submitted_at":"2026-05-08T08:22:43Z","title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:56.057336Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.08290"},"observation_digest":"sha256:acf4debb482d3ce5e9d63347f8163bb7368397c9b05ba3251867e0ced84fdc34","observation_id":"08789157-d356-416b-8ce5-4bb36aa9610f","resolution":{"observed_at":"2026-05-12T07:41:27.782786Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.10519","last_updated":"2026-05-11T13:07:19Z","snapshot_observed_at":"2026-08-15T02:29:33.688184Z","submitted_at":"2026-05-11T13:07:19Z","title":"Online Resource Allocation With General Constraints","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T04:04:36.278591Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.10519"},"observation_digest":"sha256:3faeeaf124fcc2358a1bbc6fdd2a474809f443a69973aef82a35ed9156f7c2bf","observation_id":"426300f8-17bb-4f95-87a4-c910d1492464","resolution":{"observed_at":"2026-05-12T06:41:31.756352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.21107","last_updated":"2026-07-22T05:57:53Z","snapshot_observed_at":"2026-08-15T02:56:04.440610Z","submitted_at":"2026-05-20T12:40:27Z","title":"A Geometric Approach to Constrained Online Learning","version":1},"reference_index":163,"source":"arxiv_source","source_observed_at":"2026-05-21T06:23:20.784755Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.21107"},"observation_digest":"sha256:3a500fa4b1ba654fc20aacfe2d1c0f65c476d4718393e2ccbea7e3ef88078ae3","observation_id":"2b8d4e67-83c2-480a-b89e-3cb0555a4e89","resolution":{"observed_at":"2026-05-21T06:24:00.499194Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.23887","last_updated":"2026-05-22T17:47:45Z","snapshot_observed_at":"2026-08-18T00:32:06.567012Z","submitted_at":"2026-05-22T17:47:45Z","title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T02:14:13.160967Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.23887"},"observation_digest":"sha256:2ad4296dd7d8563cb07bd6ee7061a2af0d0c1a19d94f001a995efa3a800a47b2","observation_id":"9c971946-b383-4555-b77d-91e3a71a5915","resolution":{"observed_at":"2026-05-25T02:15:14.112412Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.27718","last_updated":"2026-05-26T21:44:02Z","snapshot_observed_at":"2026-08-13T22:09:52.522994Z","submitted_at":"2026-05-26T21:44:02Z","title":"Robust Moment-Based Estimation via Spectral Gradient Reweighting","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T14:44:46.823478Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.27718"},"observation_digest":"sha256:0ed0b381e34c3b971b49e20e7d5c57288ab37b011c94d8afc3792aff030b6e14","observation_id":"7e4c6df4-28c8-48e3-90e5-8df6c9ae27ab","resolution":{"observed_at":"2026-06-29T14:53:31.364199Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2605.27831","last_updated":"2026-05-27T01:37:00Z","snapshot_observed_at":"2026-08-15T13:22:55.859357Z","submitted_at":"2026-05-27T01:37:00Z","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T14:49:21.541948Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2605.27831"},"observation_digest":"sha256:0672f5c0b5a3a3461e6ac4f1c7f5123264bf5d57954833e6fafaa5d46be98227","observation_id":"d88be3c0-63b1-4e54-8d3e-e0f7efd16f14","resolution":{"observed_at":"2026-06-29T14:53:31.216422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2606.06085","last_updated":"2026-06-04T12:23:35Z","snapshot_observed_at":"2026-08-14T17:36:29.555383Z","submitted_at":"2026-06-04T12:23:35Z","title":"Revenue Guarantees of No-Swap-Regret Dynamics in First Price Auctions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T23:21:15.407785Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2606.06085"},"observation_digest":"sha256:47aa30095d80ecec3b45a0ed5d6e823c9995a989474f0a87c2de87752cd06f24","observation_id":"52eda397-5f2f-40d5-b267-d0fc309e9260","resolution":{"observed_at":"2026-07-02T15:47:06.769385Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":"1909.05207","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-03T23:39:03.761139Z","title":"2019.Introduction to Online Convex Optimization","venue":null,"work_id":"ec24f210-ae1a-4fd2-9b3d-11c11a21bc68","year":2023},"citing_paper":{"arxiv_id":"2606.18778","last_updated":"2026-06-17T07:41:41Z","snapshot_observed_at":"2026-08-16T13:30:03.149531Z","submitted_at":"2026-06-17T07:41:41Z","title":"Online Distributional Prediction via Latent Cluster Geometry Under Drift and Corruption","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-26T21:58:08.898515Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2606.18778"},"observation_digest":"sha256:09c77f01f26eda64e1209a25087a12893fc7865a3198a437338ac64ca9a240fa","observation_id":"5e53fc11-806b-409c-baa9-364fcd824f5e","resolution":{"observed_at":"2026-07-03T23:39:03.764937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10808","last_updated":"2026-07-12T15:36:04Z","snapshot_observed_at":"2026-08-15T04:15:38.752863Z","submitted_at":"2026-07-12T15:36:04Z","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:c684d6a2c15e29658fcaa4447b43b2bd5b1f2fb0ca418e14c88c172d239066b0","observation_id":"2267f56d-ef33-425d-8b34-041502eb3d90","resolution":{"observed_at":"2026-07-14T09:06:47.558015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-07-14T06:16:13.601515Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11210","last_updated":"2026-07-13T08:02:18Z","snapshot_observed_at":"2026-08-18T02:49:52.962665Z","submitted_at":"2026-07-13T08:02:18Z","title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-14T06:16:13.601515Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2607.11210"},"observation_digest":"sha256:44f7920fce68e2967cb71b3f5674c63f6755124ad42737ce8dac05b6585c47d1","observation_id":"97af5d60-a629-4099-851d-3b36c19ba0c6","resolution":{"observed_at":"2026-07-14T06:16:13.601515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-08T20:01:36.192102Z","title":"Now Publishers, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-18T15:39:43Z","snapshot_observed_at":"2026-08-20T20:20:25.877498Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.192102Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:11a6af1218dd3bac8034e4413cc34ff4ed6c2cb8f8cf3c4b6e7ffdf43a33ed52","observation_id":"71e36459-d049-4efd-a977-64c157105efc","resolution":{"observed_at":"2026-08-08T20:01:36.192102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1909.05207/citation-record","integrity":"/paper/1909.05207/integrity","json":"/paper/1909.05207/citation-record.json","paper":"/paper/1909.05207"},"outbound":[],"paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 22 inbound Pith citation observations for arXiv:1909.05207."}