{"as_of":"2026-08-18T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:315fdb94d7ec6cfa49dcdc42c1f466b359830464b502143f4449a621ecf92c57","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:26:20.109783Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"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/2508.16992/citation-record","integrity":"/paper/2508.16992/integrity","json":"/paper/2508.16992/citation-record.json","paper":"/paper/2508.16992"},"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-15T17:26:20.283106Z","title":"We now modify the policy π to obtain a new online policy π′ which is feasible","venue":null,"work_id":"cdc6461f-5ab3-428c-a1c6-61f9718f371f","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.094344Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:3a9358434296359c654b15b25fa7631767cbf396556d659379a519a94cf86151","observation_id":"9ad2c0e9-3b39-4d15-a39b-adec46a1f266","resolution":{"observed_at":"2026-08-15T17:26:20.288578Z","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-15T17:26:20.298973Z","title":"In phase σ∈ [τ], armA1 has reward σBT/T in each round","venue":null,"work_id":"81b1b307-5bed-441f-94c1-697eef74588d","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.089837Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:3a206bc9cdcd4f561d2b44f335de93106f877b0282a299e3f8e84875d3fdc72d","observation_id":"0c6ab411-1caf-445c-b14a-7128e73cc7a1","resolution":{"observed_at":"2026-08-15T17:26:20.303614Z","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-15T17:26:20.234684Z","title":"7: Estimation Scheme: ˜ℓt(i) = ˆℓt(it) p′ t(it)1(it =i),∀i","venue":null,"work_id":"1a3402d0-d892-4a75-b237-ad5f2daec58b","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.109783Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:ff9834eb1b228f8550ac687482c8e2144779974a1540d35e4b061ef2638c3239","observation_id":"9f03c7ee-b0f8-4f32-aa26-384896d97064","resolution":{"observed_at":"2026-08-15T17:26:20.239776Z","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-15T17:26:20.362017Z","title":"A.2 Proof of Theorem 3 (1) =⇒ (2): Since f is α−approximately convex, for a given x∈X , ∃g′∈ Rn s.t","venue":null,"work_id":"0bfa878c-9938-4734-be60-23e5ad98d645","year":2003},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.070095Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:ba13bdaa5a46a1540a937d7683cf952212e1c6d1894a89d28869e36f0eebee89","observation_id":"06b96523-f199-430c-981d-902da0960499","resolution":{"observed_at":"2026-08-15T17:26:20.367205Z","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-15T17:26:20.332104Z","title":"Then from Theorem 3, part 3, there exists a convex function g such that g(x)≤ f(x)≤ αg(x),∀x∈X","venue":null,"work_id":"1f81703b-60c4-45a9-ad37-7ea4750637e9","year":2019},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.079890Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:c6dcefc3704e29ac7fbe5072de414f2522b675596726ed8921389ce566ee06ef","observation_id":"24ae2e49-1f62-4754-97e7-025909e7efd4","resolution":{"observed_at":"2026-08-15T17:26:20.337162Z","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-15T17:26:20.315024Z","title":null,"venue":null,"work_id":"cdf9781d-387f-405a-b798-2ac6d41e40d4","year":2019},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.084727Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:495b8879be477081763c519244786e609dc70162d2b7c839da9795e690a49365","observation_id":"d9f5ebe2-40b5-49df-8c61-f91de47bf054","resolution":{"observed_at":"2026-08-15T17:26:20.321412Z","resolver_source":"raw_fallback","status":"unresolved"},"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-15T17:26:20.250958Z","title":"Ea⋆∼D TX t=1 ct(a⋆)≤BT","venue":null,"work_id":"19f7cfd9-42b5-4d4e-ada3-89dd2e3c767f","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.103934Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:2cdd175448f0a98ae8fad5183f298cbcc2877b38c4c152701b1e1c7708e70951","observation_id":"51f8fbb1-c1db-4f8a-9116-d4d328b6bdb6","resolution":{"observed_at":"2026-08-15T17:26:20.256324Z","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-15T17:26:20.267577Z","title":"The setting we consider here is the same as the Bandits with Knapsacks (BwK) problem, considered by Immorlica et al","venue":null,"work_id":"a5ee15b9-5b14-4e57-8fd1-4a33efee3d3d","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.099086Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:f542fca6e4dea7567a0cf5e20a07d67d06f67a24d4cd3dde9410f724a0bef44a","observation_id":"a4178b56-8c23-488d-93b5-4cb7fbc8b09e","resolution":{"observed_at":"2026-08-15T17:26:20.272540Z","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-15T17:26:20.377067Z","title":"Online learning with knapsacks: the best of both worlds","venue":null,"work_id":"09d2816b-52d8-4480-a31d-e6d28a8d44b7","year":1905},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.036219Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:c22eed63932f6739a6371403513c7edf8e6185bd65e4bccb36030f2a62617783","observation_id":"0deb923f-17d6-4b7b-bca2-3358153a92ad","resolution":{"observed_at":"2026-08-15T17:26:20.381555Z","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":{"arxiv_id":"2506.13244","last_updated":"2025-06-18T14:04:08Z","snapshot_observed_at":"2026-08-07T00:34:12.940107Z","submitted_at":"2025-06-16T08:42:31Z","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13244","snapshot_observed_at":"2026-08-15T17:26:20.064853Z","title":"No-regret learning under adversarial resource con- straints: A spending plan is all you need! arXiv preprint arXiv:2506.13244,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.064853Z"},"links":{"cited_paper":"/paper/2506.13244","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:6037aee158fa7a16fe2a05b5b11e6c49eefb7273caa7ab2c196543cab7cdcedb","observation_id":"77dc10f0-8bf7-4402-b814-b7b026f750d6","resolution":{"observed_at":"2026-08-15T17:26:20.064853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-08-15T05:32:55.984958Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-15T17:26:20.047505Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.047505Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:476c23d9108f9796ece2f64fcec24439f60e0b2bbedf9e43d6845b941b813aaf","observation_id":"435b6d40-9bfe-4cf5-94f7-7134c719e9b0","resolution":{"observed_at":"2026-08-15T17:26:20.047505Z","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-15T17:26:20.347236Z","title":null,"venue":null,"work_id":"26f8c434-e40b-492c-9970-fbc2de13974d","year":2022},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.075086Z"},"links":{"citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:2e42820496846b5e5efa518047518a59633d655a3a77ce66f1f82526ca2806b7","observation_id":"546a96fc-f3d1-4eb3-a4d0-a3e54b1b8fe5","resolution":{"observed_at":"2026-08-15T17:26:20.351794Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"1702.04783","last_updated":"2017-02-17T01:21:12Z","snapshot_observed_at":"2026-08-14T21:16:17.911774Z","submitted_at":"2017-02-15T21:27:06Z","title":"Online Convex Optimization with Time-Varying Constraints","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.04783","snapshot_observed_at":"2026-08-15T17:26:20.042013Z","title":"Online convex optimiza- tion with time-varying constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.042013Z"},"links":{"cited_paper":"/paper/1702.04783","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:2e7ecafc37fd630592baeba01790ccd3504d4ac2de14524261572e640b375833","observation_id":"20d2a569-2603-4e60-ae19-daeaa9410a0f","resolution":{"observed_at":"2026-08-15T17:26:20.042013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.0155","last_updated":"2013-06-01T22:00:03Z","snapshot_observed_at":"2026-08-17T22:02:10.523825Z","submitted_at":"2013-06-01T22:00:03Z","title":"Dynamic Ad Allocation: Bandits with Budgets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.0155","snapshot_observed_at":"2026-08-15T17:26:20.059488Z","title":"Aleksandrs Slivkins","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.059488Z"},"links":{"cited_paper":"/paper/1306.0155","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:259141888d3c1fa46639187bae0d07dd11f3cdd45100732a1babd54f64ee8535","observation_id":"a3c323dd-e013-4e1a-a094-9825d1e5a55d","resolution":{"observed_at":"2026-08-15T17:26:20.059488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05219","last_updated":"2024-05-12T16:05:30Z","snapshot_observed_at":"2026-08-16T15:41:17.604639Z","submitted_at":"2023-04-11T13:39:47Z","title":"BanditQ: Fair Bandits with Guaranteed Rewards","version":3},"cited_work":{"arxiv_id":"2304.05219","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.05219","snapshot_observed_at":"2026-08-15T17:26:20.179360Z","title":"BanditQ: Fair Bandits with Guaranteed Rewards","venue":"cs.LG","work_id":"60b881f7-3fa8-4f2b-9043-d6dc6ab712bd","year":2023},"citing_paper":{"arxiv_id":"2508.16992","last_updated":"2025-08-23T11:21:24Z","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T17:26:20.053703Z"},"links":{"cited_paper":"/paper/2304.05219","citing_paper":"/paper/2508.16992"},"observation_digest":"sha256:3ebb224de05e3cdc3233c2d4d696806bb11eb51b349dfcc3678fbacfa702f1d7","observation_id":"7ee1a365-e788-4a09-882c-b3120bdee491","resolution":{"observed_at":"2026-08-15T17:26:20.186179Z","resolver_source":"local_arxiv","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":"2508.16992","last_updated":"2025-08-23T11:21:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T18:04:30.769182Z","submitted_at":"2025-08-23T11:21:24Z","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2508.16992."}