{"as_of":"2026-08-18T14:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7822164e9560a96846fece5253e68798e059f55b264cf665459e967960d94b8f","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:23:35.358508Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.07901/citation-record","integrity":"/paper/2509.07901/integrity","json":"/paper/2509.07901/citation-record.json","paper":"/paper/2509.07901"},"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-15T16:23:36.479323Z","title":"Near-optimal no-regret learning for correlated equi- libria in multi-player general-sum games","venue":null,"work_id":"31457d46-8f7b-45df-9777-393a385c7529","year":2022},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.980218Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:0f43f7c1247dc743e70b08732cc7c9043f5ce925f3ea2f48cdcb8079342c2543","observation_id":"897fa775-61ea-4c3c-9d9d-44613a1ea7b9","resolution":{"observed_at":"2026-08-15T16:23:36.483419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2021.03.023","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.508006Z","title":"doi: 10.1016/j.ejor.2021.03.023","venue":null,"work_id":"385a583d-a477-40df-90ff-390cbcdc6d94","year":2021},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.013297Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:446a2e28b27c8c26a9c690ad72e1f38527b645a9bf016c5bb06b8129d870fb6d","observation_id":"f674074d-d22c-4296-982a-632e74387701","resolution":{"observed_at":"2026-08-15T16:23:35.511219Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.02187","last_updated":"2020-02-08T07:49:32Z","snapshot_observed_at":"2026-08-18T12:11:52.211903Z","submitted_at":"2019-09-05T02:22:24Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","version":2},"cited_work":{"arxiv_id":"1909.02187","doi":"10.48550/arxiv.1909.02187","metadata_source":"pith","pith_arxiv_id":"1909.02187","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"Adaptive and Efficient Algorithms for Tracking the Best Expert","venue":"cs.LG","work_id":"30f3fce9-0ad9-468b-a022-0c60716a953e","year":2019},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.021762Z"},"links":{"cited_paper":"/paper/1909.02187","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:df1fcb7bd5fd99dff8360aeffe07053b4980b0ac2edfb6977f08cdd189e24a6f","observation_id":"e4543079-e8f6-4fd7-a467-6b5e0e3e6486","resolution":{"observed_at":"2026-08-15T16:23:35.490202Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.07310","last_updated":"2018-01-16T03:57:37Z","snapshot_observed_at":"2026-08-14T21:42:44.682951Z","submitted_at":"2016-08-25T21:01:23Z","title":"Learning in games with continuous action sets and unknown payoff functions","version":2},"cited_work":{"arxiv_id":"1608.07310","doi":"10.48550/arxiv.1608.07310","metadata_source":"pith","pith_arxiv_id":"1608.07310","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"Learning in games with continuous action sets and unknown payoff functions","venue":"math.OC","work_id":"cd472782-a35f-42a1-8bc4-53682832bb06","year":2016},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.038158Z"},"links":{"cited_paper":"/paper/1608.07310","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:b88a3f979fe9a9125a766192a49c74caca82611131b3a7b0be08b3047b815ed3","observation_id":"27399b9f-3b02-4905-a55f-3cbb646ca871","resolution":{"observed_at":"2026-08-15T16:23:35.450355Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-08-15T16:23:35.045711Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.045711Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:9448cdc99249417e62ba1b79a6cf2ffefc6281cc1e2262bf1aada42c9186136c","observation_id":"7f887d52-b9a7-4077-8634-efadbd719be3","resolution":{"observed_at":"2026-08-15T16:23:35.045711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.081604Z","title":"2023.3237486","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.081604Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:be34de35ac518d022bce269fd4f5c615bac738beb49009679a3aa83c3f1b99f3","observation_id":"3e807bb8-ae48-4cb4-814f-a9a58d052f46","resolution":{"observed_at":"2026-08-15T16:23:35.081604Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.141502Z","title":"doi: 10.5555/2969442.2969573","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.141502Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:81573e170ee5ccadd552ce98bf414f4cebc2a22dc643f6e48ad8982c4f6b2972","observation_id":"ae2e3ec0-5e78-4667-b409-64133154d275","resolution":{"observed_at":"2026-08-15T16:23:35.141502Z","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-15T16:23:36.456838Z","title":"John von Neumann","venue":null,"work_id":"0a23f12e-9168-44f0-958e-2945d98a632b","year":2016},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.170908Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:a0d2252ee09de950ba2dff3c650db983a3443ca2881869eaca9ea59a06b4868c","observation_id":"50c1f31e-cb49-4904-80c6-59f2f505f160","resolution":{"observed_at":"2026-08-15T16:23:36.460665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:23:36.446133Z","title":"cc/paper/2018/file/10a5ab2db37feedfdeaab192ead4ac0e-Paper.pdf","venue":null,"work_id":"db54f731-a723-4863-aa74-7d536d3057f8","year":2018},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.289155Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:57e213c3306456cf3953b3cd6237c5ce18e282595fad5dd7c521dcb8b4ed56d6","observation_id":"0b9678b4-dcc0-4c36-9890-86afd96c19b8","resolution":{"observed_at":"2026-08-15T16:23:36.449767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:23:36.434968Z","title":"Lijun Zhang, Guanghui Wang, Jinfeng Yi, and Tianbao Yang","venue":null,"work_id":"be6eafc7-ec0c-4c91-b428-43a505519bc3","year":2021},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.326690Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:1e430fd69fea9b485628e5cd36cb8f36ffc887085b18688880cec7919ab3d31c","observation_id":"31169e02-e74a-46e2-9184-a6a8092a1d28","resolution":{"observed_at":"2026-08-15T16:23:36.438896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"file/9393141","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.779750Z","title":"Peng Zhao, Yu-Jie Zhang, Lijun Zhang, and Zhi-Hua Zhou","venue":null,"work_id":"99d09921-174f-4c7a-8a21-30af0fb82c56","year":2020},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.349687Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:eee9e1f5d84400b026cdbb7597e5b723cfe70b1bdae2559cc41452a1ec675b98","observation_id":"d8dcf408-3c04-4d0c-95cb-b6da10849a95","resolution":{"observed_at":"2026-08-15T16:23:35.785184Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.14368","last_updated":"2024-04-07T06:50:01Z","snapshot_observed_at":"2026-08-16T17:31:29.530306Z","submitted_at":"2021-12-29T02:42:59Z","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.14368","snapshot_observed_at":"2026-08-15T16:23:35.353963Z","title":"29 Meng, Lei and Liu Peng Zhao, Yan-Feng Xie, Lijun Zhang, and Zhi-Hua Zhou","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.353963Z"},"links":{"cited_paper":"/paper/2112.14368","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:ffc045fe5231e9b31c73d2bdded84140cd3bc0ab39cdb86bfe6dc88dbdb26b37","observation_id":"5d0e8ff5-2a4d-416b-a177-43abcd6fb953","resolution":{"observed_at":"2026-08-15T16:23:35.353963Z","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-15T16:23:36.318102Z","title":"Martin Zinkevich","venue":null,"work_id":"e35a93f3-1df2-4623-a823-228e57253833","year":2022},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.358508Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:710003688025db34f8c4d0cd165f519a441edd4cc8db72e81d19f09ab1590dae","observation_id":"f5752b78-1b1e-4a9f-9201-6d1aa0a5587a","resolution":{"observed_at":"2026-08-15T16:23:36.384903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:23:35.189689Z","title":"doi: 10.1007/BF01448847","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":1928,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.189689Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:5bb430feecb5e86b09432348760aa3c41caffb37f2d671e1447517b7dc449577","observation_id":"5c89a726-c7ad-40fe-83d8-386275de208a","resolution":{"observed_at":"2026-08-15T16:23:35.189689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.050450Z","title":"doi: 10.1109/SFCS.1995.492488","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.050450Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:e064061dcb15bb880104f56b35f60041cd0377fd1e212fa4585c2a137242cd2f","observation_id":"ab789e4f-4302-4416-a1b1-cb158894ddd7","resolution":{"observed_at":"2026-08-15T16:23:35.050450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.009100Z","title":"doi: 10.1006/game","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.009100Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:b9a5678876dc411db2cc0534aed1cdbecd6ed50010bd8b72e1c6630061ff68f2","observation_id":"cdd61307-92a9-45df-9eb0-8e5957860e54","resolution":{"observed_at":"2026-08-15T16:23:35.009100Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.042232Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.042232Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:d33e4cda3f71c147c53eba81687f3a340be85cb71e0ba421c41f4b1093b9b37c","observation_id":"6dbf07aa-5d96-4e46-8c7a-01a27e4715f2","resolution":{"observed_at":"2026-08-15T16:23:35.042232Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07666","last_updated":"2021-02-15T16:50:16Z","snapshot_observed_at":"2026-08-16T18:45:27.605817Z","submitted_at":"2021-02-15T16:50:16Z","title":"A closer look at temporal variability in dynamic online learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07666","snapshot_observed_at":"2026-08-15T16:23:34.989180Z","title":"doi: 10.1007/ 978-0-387-70914-7","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.989180Z"},"links":{"cited_paper":"/paper/2102.07666","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:ec1db284082efd144d580c6e3b5dbe97c281f43c59b8ce589dc0695307eafded","observation_id":"f14903ae-412b-4b68-ae9c-2fc9e657bd50","resolution":{"observed_at":"2026-08-15T16:23:34.989180Z","resolver_source":null,"status":"malformed_identifier"},"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-15T16:23:36.467719Z","title":"doi: 10.1561/ 2200000018","venue":null,"work_id":"9bda68f1-5f17-49cf-9cd0-fbc5a23e1ec8","year":1935},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.113266Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:4787af7c78b363fdd500750638c91ce73a89d48cad643b4915f174468ae085f3","observation_id":"d840f752-8af7-4584-969f-797f097e7807","resolution":{"observed_at":"2026-08-15T16:23:36.471630Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.geb.2014.01.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.534205Z","title":"doi: 10.1016/j.geb.2014.01.003","venue":null,"work_id":"ee5437a7-b6ff-4167-89e3-c93a8796869e","year":2014},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.005627Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:c96a910fc47b624d4eaf81766443d710fdfb25c66ed36c38995bda966fffda77","observation_id":"dee749f7-576d-4909-9090-4ac0c0c31fb1","resolution":{"observed_at":"2026-08-15T16:23:35.570710Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:23:35.034715Z","title":"Panayotis Mertikopoulos and Zhengyuan Zhou","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.034715Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:9407953bcf850cdecbb46817de08636554c05c510c2ecf443c86a65e77bf308b","observation_id":"3c63d6c8-8b07-45b5-aea1-16b1f1719df0","resolution":{"observed_at":"2026-08-15T16:23:35.034715Z","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":"2017.27501","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:36.143834Z","title":"Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim","venue":null,"work_id":"f1cc319b-a630-4643-98b0-c413982523cd","year":2017},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.002263Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:dd2c40fbb19bf31c0267545aeb4ab5b4e9afb01766872b8a8c2255949e1b9668","observation_id":"567dd6bf-a9e0-43d7-a688-260c46f1c462","resolution":{"observed_at":"2026-08-15T16:23:36.200185Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.08301","last_updated":"2020-04-05T20:11:12Z","snapshot_observed_at":"2026-08-14T19:00:54.733134Z","submitted_at":"2018-06-21T15:57:17Z","title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks","version":3},"cited_work":{"arxiv_id":"1806.08301","doi":"10.48550/arxiv.1806.08301","metadata_source":"pith","pith_arxiv_id":"1806.08301","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks","venue":"stat.ML","work_id":"c482693e-bcd9-4ba8-bfd0-9b31065ac1e6","year":2018},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.997825Z"},"links":{"cited_paper":"/paper/1806.08301","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:c5b38708c463e3c411c6776b0724eac5cecb4ddb7961806fe2877e809f74c9ad","observation_id":"31449816-fad2-4f37-9682-6a1247941982","resolution":{"observed_at":"2026-08-15T16:23:35.643713Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-018-1262-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.497288Z","title":"doi: 10.1007/s10107-018-1262-8","venue":null,"work_id":"56633ff9-bfb7-4f2b-bd39-c7ac72451a9a","year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.018254Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:2c8f1fda77faaf4de2552d15337aa0e5914f5603a3671dfaba1ddf2ccffb9868","observation_id":"00e1494c-2bdf-47c7-a1e7-0d117902d9fe","resolution":{"observed_at":"2026-08-15T16:23:35.501116Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2020/731","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:23:35.400538Z","title":"Early Career","venue":null,"work_id":"d192b8e2-36f4-4bc3-abc2-a3848b935c76","year":2020},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.251057Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:80f87c39c449f1ff770fd27244aeafe1612f155d081f16ffd20cfe8752851c38","observation_id":"bc4f0f32-46d5-40a8-bbe5-3aa1fccdd17b","resolution":{"observed_at":"2026-08-15T16:23:35.405956Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07666","last_updated":"2021-02-15T16:50:16Z","snapshot_observed_at":"2026-08-16T18:45:27.605817Z","submitted_at":"2021-02-15T16:50:16Z","title":"A closer look at temporal variability in dynamic online learning","version":1},"cited_work":{"arxiv_id":"2102.07666","doi":"10.48550/arxiv.2102.07666","metadata_source":"pith","pith_arxiv_id":"2102.07666","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"A closer look at temporal variability in dynamic online learning","venue":"cs.LG","work_id":"12dd71f6-2f48-4848-a6eb-1a312b50ad10","year":2021},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.993707Z"},"links":{"cited_paper":"/paper/2102.07666","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:54c2c93bee0fcb84f5f0f766e9cb9c445a7a3bd60e96ab77fccb394af6a03d43","observation_id":"92828a35-904e-4087-9f77-28042f2be7bc","resolution":{"observed_at":"2026-08-15T16:23:35.659638Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T16:23:34.984810Z","title":"ISBN 9781450392648","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.984810Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:9702e7fa21c769ba0acf7216ab59465396266a464815f67ef29d2992cabe7bd8","observation_id":"b5e2d4aa-719a-4f0e-9827-bd312c282479","resolution":{"observed_at":"2026-08-15T16:23:34.984810Z","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":"10.1007/978-3-031-25198-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"ISBN 978-3-031-25198-6","venue":"Lecture notes in computer science","work_id":"d52b7eca-46cc-48db-9463-36ce4ddcfcea","year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.026449Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:8bd146de9bf322f604c82b3cd6b3610d8e649740191c81ac3b57a8ce6db95909","observation_id":"3ad4a506-361e-4d00-8029-3dc1da6947e0","resolution":{"observed_at":"2026-08-15T16:23:35.474729Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-981-96-6579-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":"ISBN 978-981-96-6579-2","venue":"Lecture notes in computer science","work_id":"cee875f1-fdde-4935-9df2-090abb69c400","year":null},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.030933Z"},"links":{"citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:9f946eb0798e3c1c26c68ce294671b16d9e12185dd67f19c5ca1b36392091ca8","observation_id":"5ac1757b-5a32-4830-b1c9-4cf4c2064ea1","resolution":{"observed_at":"2026-08-15T16:23:35.462535Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":5,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":7,"verified_exact":7,"verified_fuzzy":5},"total_outbound_references":29},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2509.07901."}