{"as_of":"2026-08-18T16:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e8b62fa30402472f2e7eb166679c7905214ef794249d96168b612cb91ce8c03","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-15T20:45:55.311465Z","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-06T16:15:16.056665Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.07616","last_updated":"2025-02-11T06:14:22Z","snapshot_observed_at":"2026-08-18T04:56:40.534434Z","submitted_at":"2024-10-10T05:08:14Z","title":"The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.07616","snapshot_observed_at":"2026-08-15T20:45:55.311465Z","title":"The plug-in approach for average-reward and discounted mdps: Optimal sample complexity analysis.arXiv preprint arXiv:2410.07616, 2024","venue":null,"work_id":null,"year":2024},"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":53,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.311465Z"},"links":{"cited_paper":"/paper/2410.07616","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:29be9455c96033f81e03ba0f86557c337d990cbb757ae666d74e793e5fe75ef6","observation_id":"368010cc-a2a8-46d9-92c0-8c2b32488ac2","resolution":{"observed_at":"2026-08-15T20:45:55.311465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.07616","last_updated":"2025-02-11T06:14:22Z","snapshot_observed_at":"2026-08-18T04:56:40.534434Z","submitted_at":"2024-10-10T05:08:14Z","title":"The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis","version":2},"cited_work":{"arxiv_id":"2410.07616","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.07616","snapshot_observed_at":"2026-08-06T16:15:16.056665Z","title":"The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis","venue":"cs.LG","work_id":"59f9f3b6-63c8-4861-bb2a-2f65b235002b","year":2024},"citing_paper":{"arxiv_id":"2507.14444","last_updated":"2025-07-19T02:42:41Z","snapshot_observed_at":"2026-08-14T15:14:45.544908Z","submitted_at":"2025-07-19T02:42:41Z","title":"Statistical and Algorithmic Foundations of Reinforcement Learning","version":1},"reference_index":161,"source":"pdf_text","source_observed_at":"2026-08-06T16:15:16.024698Z"},"links":{"cited_paper":"/paper/2410.07616","citing_paper":"/paper/2507.14444"},"observation_digest":"sha256:ef2fa27a359379f04be18202cfa9543036251b70043662787b877ff2b7694edc","observation_id":"bb27821d-687e-41a0-8bd9-b5f0d20d23e5","resolution":{"observed_at":"2026-08-06T16:15:16.061975Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2410.07616/citation-record","integrity":"/paper/2410.07616/integrity","json":"/paper/2410.07616/citation-record.json","paper":"/paper/2410.07616"},"outbound":[],"paper":{"arxiv_id":"2410.07616","last_updated":"2025-02-11T06:14:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T04:56:40.534434Z","submitted_at":"2024-10-10T05:08:14Z","title":"The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis"},"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:2410.07616."}