{"as_of":"2026-08-18T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a7955e8bdb9682a29c75575184ca70de09db7ed5b8eaa74c13fd639744f26ec","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.198958Z","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.054263Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.08833","last_updated":"2024-02-12T19:06:53Z","snapshot_observed_at":"2026-08-18T11:10:48.482919Z","submitted_at":"2023-10-13T03:08:59Z","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.08833","snapshot_observed_at":"2026-08-16T12:42:09.198958Z","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","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-18T15:53:26.751912Z","submitted_at":"2025-04-16T11:47:41Z","title":"A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:42:09.198958Z"},"links":{"cited_paper":"/paper/2310.08833","citing_paper":"/paper/2504.11997"},"observation_digest":"sha256:9c49f16c6a9debafa4aac5d9d1e1c639023d05bd54f6253d89e3285919424b3f","observation_id":"217f2d16-2c1e-46c1-8c2e-141cdeb8a9cc","resolution":{"observed_at":"2026-08-16T12:42:09.198958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.08833","last_updated":"2024-02-12T19:06:53Z","snapshot_observed_at":"2026-08-18T11:10:48.482919Z","submitted_at":"2023-10-13T03:08:59Z","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","version":2},"cited_work":{"arxiv_id":"2310.08833","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.08833","snapshot_observed_at":"2026-08-15T20:45:56.054263Z","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","venue":"cs.LG","work_id":"6f08137a-282b-429f-b294-a13d8d543b59","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":66,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.389158Z"},"links":{"cited_paper":"/paper/2310.08833","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:ad1e8c1c11f8e8a32787bec1426357a68fbb862129375379bf142bc170e13a86","observation_id":"6291b4b6-4fc3-4311-bbb2-2b5e064cb378","resolution":{"observed_at":"2026-08-15T20:45:56.060257Z","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/2310.08833/citation-record","integrity":"/paper/2310.08833/integrity","json":"/paper/2310.08833/citation-record.json","paper":"/paper/2310.08833"},"outbound":[],"paper":{"arxiv_id":"2310.08833","last_updated":"2024-02-12T19:06:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T11:10:48.482919Z","submitted_at":"2023-10-13T03:08:59Z","title":"Optimal Sample Complexity for Average Reward 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-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:2310.08833."}