{"as_of":"2026-08-09T15:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c4d87ecfdcb4b663286bc46bf0a2b017f9f3499b26e62d775d081786b982f81","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:16:51.975070Z","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-12T07:41:27.784625Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-07T14:16:51.975070Z","title":"Provably efficient model-free algorithm for mdps with peak constraints","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.20010","last_updated":"2025-06-21T12:44:40Z","snapshot_observed_at":"2026-08-07T13:59:15.713131Z","submitted_at":"2025-05-26T14:00:36Z","title":"Data-Dependent Regret Bounds for Constrained MABs","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T14:16:51.975070Z"},"links":{"cited_paper":"/paper/2003.05555","citing_paper":"/paper/2505.20010"},"observation_digest":"sha256:8880eb33f00a7c1897d5e6fba10fa1061fb4228239ecdfa2ac7ba5a15e443c09","observation_id":"27452e6a-0ee1-445e-882d-ea16bb0f363b","resolution":{"observed_at":"2026-08-07T14:16:51.975070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"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":"2003.05555","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05555","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2003.05555 , year=","venue":null,"work_id":"7420185e-5b87-4d69-800b-50a4f3c5ad0c","year":2003},"citing_paper":{"arxiv_id":"2605.08290","last_updated":"2026-05-08T08:22:43Z","snapshot_observed_at":"2026-07-06T23:20:33.816373Z","submitted_at":"2026-05-08T08:22:43Z","title":"Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:56.057336Z"},"links":{"cited_paper":"/paper/2003.05555","citing_paper":"/paper/2605.08290"},"observation_digest":"sha256:f67b5c70a2d760e6110e8f1dfb5136416bb31f4eb79126d2fe2d8097e78934aa","observation_id":"2e37f8fc-2085-4179-adc2-016a6f644834","resolution":{"observed_at":"2026-05-12T07:41:27.786973Z","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":"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":"2003.05555","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.05555","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2003.05555 , year=","venue":null,"work_id":"7420185e-5b87-4d69-800b-50a4f3c5ad0c","year":2003},"citing_paper":{"arxiv_id":"2605.10519","last_updated":"2026-05-11T13:07:19Z","snapshot_observed_at":"2026-07-06T23:22:28.318343Z","submitted_at":"2026-05-11T13:07:19Z","title":"Online Resource Allocation With General Constraints","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-12T04:04:36.278591Z"},"links":{"cited_paper":"/paper/2003.05555","citing_paper":"/paper/2605.10519"},"observation_digest":"sha256:75924ed51fbde5bf448c8388a34358475e234e3ee4283f455956ebddd6bce96c","observation_id":"cd92a5bb-b3cb-4b2a-a951-a824a76e1bed","resolution":{"observed_at":"2026-05-12T06:41:31.460412Z","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":"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-07-14T06:16:13.601515Z","title":"arXiv preprint arXiv:2003.05555 , year=","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.11210","last_updated":"2026-07-13T08:02:18Z","snapshot_observed_at":"2026-08-02T06:22:15.029368Z","submitted_at":"2026-07-13T08:02:18Z","title":"Decoupling Corruption and Horizon in Robust Contextual Pricing","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-14T06:16:13.601515Z"},"links":{"cited_paper":"/paper/2003.05555","citing_paper":"/paper/2607.11210"},"observation_digest":"sha256:8c7f567cb1734b65a2ca0c3b927d41bb1f3f77d238bae1884f8cb2033fada86d","observation_id":"c484bef1-cdf7-42be-9a02-60f768be6e00","resolution":{"observed_at":"2026-07-14T06:16:13.601515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2003.05555/citation-record","integrity":"/paper/2003.05555/integrity","json":"/paper/2003.05555/citation-record.json","paper":"/paper/2003.05555"},"outbound":[],"paper":{"arxiv_id":"2003.05555","last_updated":"2022-06-13T22:02:32Z","latest_version":6,"primary_category":"math.OC","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"},"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 5 inbound Pith citation observations for arXiv:2003.05555."}