{"as_of":"2026-08-09T15:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:53f2e0622069fd1d4d82eb3cbc96aebf90a48b0d90351d2f155c53f6c481f11f","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":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T00:26:51.544940Z","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-06T03:42:24.250183Z","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-09T00:11:49.079124Z","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:9f320c671c91be9659748c0a9db1263423654e7a0bdbf820280cd41aaa975c2b","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-06T03:42:24.250183Z","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-08T04:04:54.879342Z","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:5dccd4b2a356c321a1fef579023ba7945f8339c6d2064dc0857b220fd62c64c2","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-06T03:42:24.250183Z","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-08T00:35:55.880889Z","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:0e06d398e775163302db7cb1ffc8c152f36c478164958b7f8c06d0a56b5a9d18","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-06T03:42:24.250183Z","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-07-06T02:11:23.670680Z","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:835785fd664b1dc2ea9671091a4d8ed21f537730b4d9d9f9c48eea7ecfd3cca8","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-05-19T20:03:13Z","snapshot_observed_at":"2026-08-06T10:22:45.314063Z","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:9698a8b7034edb25284d391c06bfb4366c5406a2c0e2ffecaa9ca2076b8538a6","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07-06T23:02:58.361418Z","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:ab1d33bd31438f12da786e3c9a65df3a1eba3b0abf3dc536839a45afe24d1184","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07-06T23:18:41.400741Z","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:b95446718cc118940ed70e7600b6b1189b3062a32c1e9b1b5d9ae0ada4ada3ad","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07-06T23:20:33.816373Z","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:17ad3ff8fb911c561566f58a469938a069d05edbf8f28b9b39d4b889007c1ddd","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07-06T23:22:28.318343Z","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:dc453801a1e1ee53f58e46cf45e918cbd069dea9e2e69da99bd9a82008091d1b","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-02T13:43:27.707898Z","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:a1d3cfdab4441bdad4c2812bdebcbe0d8b984397eb44954f913c75a161f617a4","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-08T17:52:09.880645Z","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:cfcd89d4a2c6a9affc1234eff3ef02715ba16dd2ffc92aadbd209b7d8d9b0374","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07T11:00:54.123826Z","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:3f28a18c36a24518246d57af4d9f6c37d2e77ce1c665bfd4e783ce3342a4e2c4","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-08T04:42:10.219522Z","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:4e6d1b10a8499a0f1b1efc8267ad8828420bf7a4215dc552cc9e3c887be5ab68","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-02T16:22:04.430778Z","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:05fc90dee4aa8509d6a11425951784558e469c23395e1b73b6500a281b8c707a","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-07-06T23:54:09.140085Z","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:482801761b6578c6b54faa0e3872f0e56e2d96a88ef868c52adf75690bcfe9d7","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-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.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","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-06T05:59:13.257838Z","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:7d7e2cec0e1d2d83f175c8305b9ad793ce7e1e28fceb0e57e3f9cd1d2b299d50","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-06T03:42:24.250183Z","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-02T06:22:15.029368Z","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:e7b113387b472d43c89c5ba4da8caf02d6c5f81f2ef454fcdbc5f5d710c7047b","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-06T03:42:24.250183Z","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-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","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:4719f70e86cb9cf43db1d5c0249556ade0745fcf686b57d253cf11d00ad49b2c","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-06T03:42:24.250183Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:1909.05207."}