{"as_of":"2026-08-10T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ce3d6ec8461c2d5c7ef61ac6d31e08f020aa0eddbc81e887485bd899ccdb6a68","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-10T06:31:04.303077+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-08-07T14:41:52.317140Z","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-07-01T18:55:59.134962Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13013","last_updated":"2025-01-22T16:56:42Z","snapshot_observed_at":"2026-08-06T04:47:40.931727Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13013","snapshot_observed_at":"2026-08-07T14:41:52.317140Z","title":"_eprint: 2501.13013","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18064","last_updated":"2025-05-23T16:11:39Z","snapshot_observed_at":"2026-08-09T14:21:57.411902Z","submitted_at":"2025-05-23T16:11:39Z","title":"Asymptotically optimal regret in communicating Markov decision processes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:41:52.317140Z"},"links":{"cited_paper":"/paper/2501.13013","citing_paper":"/paper/2505.18064"},"observation_digest":"sha256:0961246376205965c3a8a5497f3933d5d5659a80b1eae72e1b81fea7f8bc6c2b","observation_id":"b97480b8-281b-492d-a57e-531ff7779aa3","resolution":{"observed_at":"2026-08-07T14:41:52.317140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13013","last_updated":"2025-01-22T16:56:42Z","snapshot_observed_at":"2026-08-06T04:47:40.931727Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes","version":1},"cited_work":{"arxiv_id":"2501.13013","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13013","snapshot_observed_at":"2026-07-01T18:55:59.134962Z","title":"Hippolyte Bourel, Odalric Maillard, and Mohammad Sadegh Talebi","venue":null,"work_id":"05d796a4-89a6-4eb6-99f5-fb667d006dd5","year":null},"citing_paper":{"arxiv_id":"2606.27448","last_updated":"2026-06-25T18:18:15Z","snapshot_observed_at":"2026-08-09T14:21:29.289392Z","submitted_at":"2026-06-25T18:18:15Z","title":"Learning in Markovian bandits with non-observable states and constrained decision epochs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"cited_paper":"/paper/2501.13013","citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:57277fa108829286faa76fdccbe86630e44f086901477d035cfffdb4cc622cf0","observation_id":"0270dfa6-9c1c-4e49-8df8-678260715a3c","resolution":{"observed_at":"2026-07-01T18:55:59.136652Z","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":"2501.13013","last_updated":"2025-01-22T16:56:42Z","snapshot_observed_at":"2026-08-06T04:47:40.931727Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13013","snapshot_observed_at":"2026-08-01T18:53:58.706383Z","title":"Boone and O.-A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17201","last_updated":"2026-07-19T11:48:09Z","snapshot_observed_at":"2026-08-07T00:34:27.724747Z","submitted_at":"2026-07-19T11:48:09Z","title":"Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T18:53:58.706383Z"},"links":{"cited_paper":"/paper/2501.13013","citing_paper":"/paper/2607.17201"},"observation_digest":"sha256:59360b1fe0495988e5a3dba43f9fa8aa495274c0ef59b77e17f28a9ae2a94a9e","observation_id":"d909eea6-b31c-4031-a7f4-2b717132859b","resolution":{"observed_at":"2026-08-01T18:53:58.706383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13013/citation-record","integrity":"/paper/2501.13013/integrity","json":"/paper/2501.13013/citation-record.json","paper":"/paper/2501.13013"},"outbound":[],"paper":{"arxiv_id":"2501.13013","last_updated":"2025-01-22T16:56:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T04:47:40.931727Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.13013."}