{"as_of":"2026-08-11T03:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8140b1c3dee2e3558df008880ef99f6459af92d2aa115afe5be065de7d3c8712","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-10T06:31:04.303077+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-08T22:48:32.824182Z","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.140544Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-08-08T22:48:32.824182Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.04477","last_updated":"2025-06-13T13:25:59Z","snapshot_observed_at":"2026-08-10T19:09:01.614318Z","submitted_at":"2025-02-06T20:01:59Z","title":"Near-Optimal Sample Complexity for MDPs via Anchoring","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-08T22:48:32.824182Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2502.04477"},"observation_digest":"sha256:256114674d587d1d442da3ef8b273811b7d9f2212ba29cc1fd980eab99dd25a8","observation_id":"32ab1a26-20b5-443f-9542-807e6181f9e3","resolution":{"observed_at":"2026-08-08T22:48:32.824182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-08-07T05:54:11.972128Z","title":"Near sample-optimal reduction-based policy learning for average reward mdp","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07040","last_updated":"2026-07-13T02:54:44Z","snapshot_observed_at":"2026-08-10T05:38:53.966097Z","submitted_at":"2025-06-08T08:26:27Z","title":"Efficient Q-Learning and Actor-Critic Methods for Robust Average-Reward Reinforcement Learning","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:54:11.972128Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2506.07040"},"observation_digest":"sha256:78f297d1d5a785533da657e57d9e7959572959ebe05539b975a3be9c6caaef4b","observation_id":"a5de33fd-8f62-47de-b381-294e48cdd827","resolution":{"observed_at":"2026-08-07T05:54:11.972128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-08-06T11:22:57.865812Z","title":"Near sample-optimal reduction- based policy learning for average reward MDP","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-08T20:06:52.804874Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.865812Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:8411fdcc0ab8f0a01055662e58b361abdd527436c55a13f30915661e5c114bac","observation_id":"f54689f6-5d42-400b-a9bf-f0e1dfc99477","resolution":{"observed_at":"2026-08-06T11:22:57.865812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":"2212.00603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-07-01T18:55:59.140544Z","title":"Near sample-optimal reduction-based policy learning for average reward mdp.Preprint","venue":null,"work_id":"9cb51a59-8e27-4a05-be37-6ba2620bd6d9","year":2022},"citing_paper":{"arxiv_id":"2510.16132","last_updated":"2026-04-03T19:00:32Z","snapshot_observed_at":"2026-07-06T22:32:57.286856Z","submitted_at":"2025-10-17T18:19:00Z","title":"A Minimal-Assumption Analysis of Q-Learning with Time-Varying Policies","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-18T05:47:47.782246Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2510.16132"},"observation_digest":"sha256:7961fa1385d9c373a9cecb5faf8b5517504c4c7d1f810ff909e2fb167eb49f54","observation_id":"287162d5-da44-4a40-a323-5ea354c2632d","resolution":{"observed_at":"2026-05-18T05:50:57.135525Z","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":"2212.00603","last_updated":"2022-12-01T15:57:58Z","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP","version":1},"cited_work":{"arxiv_id":"2212.00603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.00603","snapshot_observed_at":"2026-07-01T18:55:59.140544Z","title":"Near sample-optimal reduction-based policy learning for average reward mdp.Preprint","venue":null,"work_id":"9cb51a59-8e27-4a05-be37-6ba2620bd6d9","year":2022},"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":6,"source":"pdf_text","source_observed_at":"2026-06-29T01:20:21.181843Z"},"links":{"cited_paper":"/paper/2212.00603","citing_paper":"/paper/2606.27448"},"observation_digest":"sha256:392c962b5ca5295b40fa5af79183494a96d2c186ec6104647ff9c8990cbd6e51","observation_id":"74e3f11d-0540-4342-bec9-7f8b67a8098c","resolution":{"observed_at":"2026-07-01T18:55:59.142261Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2212.00603/citation-record","integrity":"/paper/2212.00603/integrity","json":"/paper/2212.00603/citation-record.json","paper":"/paper/2212.00603"},"outbound":[],"paper":{"arxiv_id":"2212.00603","last_updated":"2022-12-01T15:57:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T05:38:46.110405Z","submitted_at":"2022-12-01T15:57:58Z","title":"Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2212.00603."}