{"as_of":"2026-08-09T23:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae37ae97086305f958c17f945c375b33c56d9f911e882538954eec76c113a5b0","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T09:06:47.558015Z","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.487193Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.01745","last_updated":"2023-03-03T07:17:09Z","snapshot_observed_at":"2026-08-07T04:39:31.181271Z","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning","version":1},"cited_work":{"arxiv_id":"2303.01745","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.01745","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2303.01745 , year=","venue":null,"work_id":"3fd96b3b-5616-4ae4-8d9e-85e328b07903","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":106,"source":"arxiv_source","source_observed_at":"2026-05-08T13:36:34.355048Z"},"links":{"cited_paper":"/paper/2303.01745","citing_paper":"/paper/2605.06190"},"observation_digest":"sha256:5fe0e9599bca08dacae62e2f583d7beafd7e2f196b808be8659edfb80a6dbbe7","observation_id":"c5468515-3338-4d5e-936a-c91c7d2e108c","resolution":{"observed_at":"2026-05-11T18:51:08.193929Z","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":"2303.01745","last_updated":"2023-03-03T07:17:09Z","snapshot_observed_at":"2026-08-07T04:39:31.181271Z","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning","version":1},"cited_work":{"arxiv_id":"2303.01745","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.01745","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2303.01745 , year=","venue":null,"work_id":"3fd96b3b-5616-4ae4-8d9e-85e328b07903","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":117,"source":"arxiv_source","source_observed_at":"2026-05-21T06:23:20.784755Z"},"links":{"cited_paper":"/paper/2303.01745","citing_paper":"/paper/2605.21107"},"observation_digest":"sha256:906ab197a423540734b6c34900fa59c2a1230d06a0636219d1b001bb35cfa35a","observation_id":"b342fdb8-0ce7-4eda-9d97-f51e749f6ce9","resolution":{"observed_at":"2026-05-21T06:24:00.488711Z","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":"2303.01745","last_updated":"2023-03-03T07:17:09Z","snapshot_observed_at":"2026-08-07T04:39:31.181271Z","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.01745","snapshot_observed_at":"2026-07-14T09:06:47.558015Z","title":"arXiv preprint arXiv:2303.01745 , year=","venue":null,"work_id":null,"year":null},"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":99,"source":"arxiv_source","source_observed_at":"2026-07-14T09:06:47.558015Z"},"links":{"cited_paper":"/paper/2303.01745","citing_paper":"/paper/2607.10808"},"observation_digest":"sha256:857fc2b3acc7e8d0c961296681aa717eb8696d12f53f1d731302ddcc49fa6045","observation_id":"b4077676-e2e0-4378-b8cd-da9d3c3c8e91","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"}}],"links":{"evidence":"/evidence","html":"/paper/2303.01745/citation-record","integrity":"/paper/2303.01745/integrity","json":"/paper/2303.01745/citation-record.json","paper":"/paper/2303.01745"},"outbound":[],"paper":{"arxiv_id":"2303.01745","last_updated":"2023-03-03T07:17:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T04:39:31.181271Z","submitted_at":"2023-03-03T07:17:09Z","title":"Queue Scheduling with Adversarial Bandit Learning"},"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 3 inbound Pith citation observations for arXiv:2303.01745."}