{"as_of":"2026-08-11T01:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:453e237ed63c72a93c5cc1f7c5df8cb4dc83678a8ef921a81df479d0f08b18a9","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:44:27.569160Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T06:23:20.784755Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T06:24:00.495250Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2506.13244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.13244","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2506.13244 , year=","venue":null,"work_id":"58ce6123-9bd5-45d8-8b0d-1a167b1d48c5","year":null},"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":267,"source":"arxiv_source","source_observed_at":"2026-05-08T13:36:34.355048Z"},"links":{"cited_paper":"/paper/2506.13244","citing_paper":"/paper/2605.06190"},"observation_digest":"sha256:f30d1ddf1f62f59c177d99c2c492cd176bc12bc6e21af7dc93cfb6feb98392c6","observation_id":"c8c5cc38-7aec-449f-84e3-ae727dba3dab","resolution":{"observed_at":"2026-05-11T18:51:08.094234Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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":"2506.13244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.13244","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2506.13244 , year=","venue":null,"work_id":"58ce6123-9bd5-45d8-8b0d-1a167b1d48c5","year":null},"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":277,"source":"arxiv_source","source_observed_at":"2026-05-21T06:23:20.784755Z"},"links":{"cited_paper":"/paper/2506.13244","citing_paper":"/paper/2605.21107"},"observation_digest":"sha256:ca6a2951c76d11438cf80e3ebe0680011c2bac2f213d36284730a590946c1b5a","observation_id":"5c4b23db-c002-43cc-b389-2161da616cb5","resolution":{"observed_at":"2026-05-21T06:24:00.496839Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.13244/citation-record","integrity":"/paper/2506.13244/integrity","json":"/paper/2506.13244/citation-record.json","paper":"/paper/2506.13244"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:44:28.737156Z","title":"[2023a] focus on online allocation with a single resource","venue":null,"work_id":"8cb64e91-f20b-486f-8942-1f2f6a04d69a","year":2013},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.481704Z"},"links":{"citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:59d2ce3b1d49c24beb565af223f18d2cede044e0dc9aaf718228044872180964","observation_id":"749bf43f-291f-408b-b111-8593be55fd5d","resolution":{"observed_at":"2026-08-07T00:44:28.868007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:44:29.314074Z","title":"Adversarial bandits with knapsacks","venue":null,"work_id":"a74f8c8c-201c-4e67-8234-c3adc3cabd39","year":2019},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.609784Z"},"links":{"citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:0c9b87be1b902304e32ba505c0538109132dfbf49647e61c0c549aee00eb0cfc","observation_id":"724166f9-8385-4d40-96d4-58fdd462ea0e","resolution":{"observed_at":"2026-08-07T00:44:29.498765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.06961","last_updated":"2022-07-25T00:17:45Z","snapshot_observed_at":"2026-08-09T12:55:42.736307Z","submitted_at":"2020-12-13T04:47:37Z","title":"Online Stochastic Optimization with Wasserstein Based Non-stationarity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.06961","snapshot_observed_at":"2026-08-07T00:44:26.727369Z","title":"Online stochastic optimization with wasserstein based non-stationarity.arXiv preprint arXiv:2012.06961,","venue":null,"work_id":null,"year":2012},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.727369Z"},"links":{"cited_paper":"/paper/2012.06961","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:0d3a472ea450399587176bed356ee4f368544b340f4eb58b46905f4c0e831be8","observation_id":"682e3d12-d6a2-40af-a2d5-2fd95bf9efa7","resolution":{"observed_at":"2026-08-07T00:44:26.727369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:44:28.444681Z","title":"Learning with General ConstraintsThere exists an extended literature on online learning problem with general constraints (e.g., [Mannor et al., 2009, Liakopoulos et al., 2019])","venue":null,"work_id":"14002a4f-418e-48ec-9b3a-f74f73a04178","year":2009},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.569160Z"},"links":{"citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:6871dbe5d3b57e0baffcf8cbc9331acec5e26e5d1d6b9ce9680902e26292903a","observation_id":"3e2019fd-c2a0-45a5-b72e-d8bf4ee1bd98","resolution":{"observed_at":"2026-08-07T00:44:28.563399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:44:28.986582Z","title":"Later, Agrawal et al","venue":null,"work_id":"c86465d5-dcab-459a-8627-c309b3249393","year":2014},"citing_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},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.366740Z"},"links":{"citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:de64d7d4556ccd7e7706416ebb83ceb188b27698e5648dd7f924ef8995b60f7c","observation_id":"c3517586-4ea4-46a6-af47-4b099fe68fcf","resolution":{"observed_at":"2026-08-07T00:44:29.112056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05881","last_updated":"2022-02-04T20:18:00Z","snapshot_observed_at":"2026-08-07T00:07:49.514864Z","submitted_at":"2022-02-04T20:18:00Z","title":"Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets","version":1},"cited_work":{"arxiv_id":"2202.05881","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.05881","snapshot_observed_at":"2026-08-07T00:44:27.794031Z","title":"Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets","venue":"cs.GT","work_id":"ac5500eb-60b9-43e1-8b67-4bd9ba5efe68","year":2022},"citing_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},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.846239Z"},"links":{"cited_paper":"/paper/2202.05881","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:8b3239f11a3d6087f52245b02bfc18f75d9f6ba83e03dea73abd396761479349","observation_id":"2fd1b0ae-2a62-400a-a190-de0b67619e07","resolution":{"observed_at":"2026-08-07T00:44:27.892664Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:44:29.660424Z","title":"Bandits with knapsacks","venue":null,"work_id":"583e0b41-0876-4f8e-9498-c10327efa825","year":2013},"citing_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},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:25.993914Z"},"links":{"citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:d94c018e692a060016375aa094b0e0cb2212e7d74b9f8f386562c3b3b6d7ebc5","observation_id":"56dd4fff-747a-4e23-98de-7158cb074772","resolution":{"observed_at":"2026-08-07T00:44:29.842921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.05555","last_updated":"2022-06-13T22:02:32Z","snapshot_observed_at":"2026-08-09T06:28:58.486763Z","submitted_at":"2020-03-11T23:23:29Z","title":"Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.05555","snapshot_observed_at":"2026-08-07T00:44:26.151610Z","title":"Provably efficient model-free algorithm for mdps with peak constraints.arXiv preprint arXiv:2003.05555,","venue":null,"work_id":null,"year":2003},"citing_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},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.151610Z"},"links":{"cited_paper":"/paper/2003.05555","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:061ab7c791ec26b485e64cc759901dbbf8193850e841b8f822c0958069e784c0","observation_id":"8c408b1d-45ae-4f0e-be9a-c40a6b2ffdb9","resolution":{"observed_at":"2026-08-07T00:44:26.151610Z","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-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-07T00:44:27.137290Z","title":"Aldo Pacchiano, Mohammad Ghavamzadeh, Peter Bartlett, and Heinrich Jiang","venue":null,"work_id":null,"year":1912},"citing_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},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.137290Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:de46446529b963475690f8ca77394fb2796865e5595262eef3045ba001560f01","observation_id":"f0b63ff1-abc4-4b06-9e7e-4acfa4241994","resolution":{"observed_at":"2026-08-07T00:44:27.137290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.02189","last_updated":"2020-03-04T17:03:56Z","snapshot_observed_at":"2026-08-05T18:34:50.706165Z","submitted_at":"2020-03-04T17:03:56Z","title":"Exploration-Exploitation in Constrained MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.02189","snapshot_observed_at":"2026-08-07T00:44:26.431839Z","title":"Jon Feldman, Nitish Korula, Vahab Mirrokni, Shanmugavelayutham Muthukrishnan, and Martin P´ al","venue":null,"work_id":null,"year":2003},"citing_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},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.431839Z"},"links":{"cited_paper":"/paper/2003.02189","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:b16368a02f61a8c60b4ec79b0a89b2d562415d06e471208a917f1f3359421360","observation_id":"e0820b41-f4b5-402f-aef3-21ef84b9141e","resolution":{"observed_at":"2026-08-07T00:44:26.431839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03672","last_updated":"2025-02-07T14:08:39Z","snapshot_observed_at":"2026-08-10T11:07:11.058486Z","submitted_at":"2024-03-06T12:49:08Z","title":"Learning Adversarial MDPs with Stochastic Hard Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.03672","snapshot_observed_at":"2026-08-07T00:44:27.212457Z","title":"Learning adversarial mdps with stochastic hard constraints.arXiv preprint arXiv:2403.03672, 2024a","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:27.212457Z"},"links":{"cited_paper":"/paper/2403.03672","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:51fe253f8a3fb91d13f0b6fecaddca763c4e148730716faac1f194eb117e0440","observation_id":"a48b5e45-c020-4f85-983c-bea6457fb9b8","resolution":{"observed_at":"2026-08-07T00:44:27.212457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.14796","last_updated":"2025-03-19T00:14:20Z","snapshot_observed_at":"2026-08-07T16:53:28.255018Z","submitted_at":"2025-03-19T00:14:20Z","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","version":1},"cited_work":{"arxiv_id":"2503.14796","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.14796","snapshot_observed_at":"2026-08-07T00:44:28.059834Z","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","venue":"cs.LG","work_id":"3eef7e9e-ccaf-4cfc-abe7-ab7198f83c39","year":2025},"citing_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},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T00:44:26.277453Z"},"links":{"cited_paper":"/paper/2503.14796","citing_paper":"/paper/2506.13244"},"observation_digest":"sha256:72af38489e7340f42286635bff0f8c6d7676235ce11fecfc821731cb25db4329","observation_id":"b34d673c-8cec-4b41-ac58-f0601f8f7796","resolution":{"observed_at":"2026-08-07T00:44:28.154591Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.13244","last_updated":"2025-06-18T14:04:08Z","latest_version":3,"primary_category":"cs.LG","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!"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":12},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 2 inbound Pith citation observations for arXiv:2506.13244."}