{"as_of":"2026-08-18T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48376e86c75849bad482981d45cb5c18c3741b5c139872dc62da5580f92f8388","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-08-16T12:42:09.225245Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T20:45:56.591385Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.13469","last_updated":"2024-03-19T18:24:43Z","snapshot_observed_at":"2026-08-18T04:14:42.921726Z","submitted_at":"2023-11-22T15:34:44Z","title":"Span-Based Optimal Sample Complexity for Average Reward MDPs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13469","snapshot_observed_at":"2026-08-16T12:42:09.225245Z","title":"Span-Based Optimal Sam ple Complexity for Average Reward MDPs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.11997","last_updated":"2025-04-16T11:47:41Z","snapshot_observed_at":"2026-08-17T19:00:23.000015Z","submitted_at":"2025-04-16T11:47:41Z","title":"A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:42:09.225245Z"},"links":{"cited_paper":"/paper/2311.13469","citing_paper":"/paper/2504.11997"},"observation_digest":"sha256:09180bd82b21f0d875b18c0c711613e613875be187b4fd46adb69371360e9134","observation_id":"486aa4c3-e495-49a0-8ec6-1b840927354f","resolution":{"observed_at":"2026-08-16T12:42:09.225245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13469","last_updated":"2024-03-19T18:24:43Z","snapshot_observed_at":"2026-08-18T04:14:42.921726Z","submitted_at":"2023-11-22T15:34:44Z","title":"Span-Based Optimal Sample Complexity for Average Reward MDPs","version":2},"cited_work":{"arxiv_id":"2311.13469","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.13469","snapshot_observed_at":"2026-08-15T20:45:56.591385Z","title":"Span-Based Optimal Sample Complexity for Average Reward MDPs","venue":"cs.LG","work_id":"d5728e61-a2e9-4437-9200-c4b65e149fb9","year":2023},"citing_paper":{"arxiv_id":"2505.12462","last_updated":"2026-06-21T21:20:26Z","snapshot_observed_at":"2026-08-17T19:23:25.884434Z","submitted_at":"2025-05-18T15:34:45Z","title":"Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.193656Z"},"links":{"cited_paper":"/paper/2311.13469","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:9989b7aeba44f946a9f2bffaa48a308f68718f114f2810696c1d68722854f328","observation_id":"03c3a3cf-0150-4f91-99a2-51666ec12ac3","resolution":{"observed_at":"2026-08-15T20:45:56.598129Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2311.13469/citation-record","integrity":"/paper/2311.13469/integrity","json":"/paper/2311.13469/citation-record.json","paper":"/paper/2311.13469"},"outbound":[],"paper":{"arxiv_id":"2311.13469","last_updated":"2024-03-19T18:24:43Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T04:14:42.921726Z","submitted_at":"2023-11-22T15:34:44Z","title":"Span-Based Optimal Sample Complexity for Average Reward MDPs"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.13469."}