{"as_of":"2026-08-18T18:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8ffe6f75aa143b6bce67ae016df2ba404d063b8b6df7b0427b9f48f07e29389e","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:45:55.437973Z","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:55.965086Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17108","last_updated":"2024-05-27T12:24:14Z","snapshot_observed_at":"2026-08-16T13:49:04.387454Z","submitted_at":"2024-05-27T12:24:14Z","title":"Finding good policies in average-reward Markov Decision Processes without prior knowledge","version":1},"cited_work":{"arxiv_id":"2405.17108","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17108","snapshot_observed_at":"2026-08-15T20:45:55.965086Z","title":"Finding good policies in average-reward Markov Decision Processes without prior knowledge","venue":"cs.LG","work_id":"581d5006-dd1e-47f8-8926-87258ca08c8f","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":75,"source":"pdf_text","source_observed_at":"2026-08-15T20:45:55.437973Z"},"links":{"cited_paper":"/paper/2405.17108","citing_paper":"/paper/2505.12462"},"observation_digest":"sha256:852f5229148d51b3c02d538c7439f0dacac780967093d2ee74793addc252b725","observation_id":"3643a70c-a5ad-47f9-a32a-602042336f2d","resolution":{"observed_at":"2026-08-15T20:45:55.971177Z","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/2405.17108/citation-record","integrity":"/paper/2405.17108/integrity","json":"/paper/2405.17108/citation-record.json","paper":"/paper/2405.17108"},"outbound":[],"paper":{"arxiv_id":"2405.17108","last_updated":"2024-05-27T12:24:14Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T13:49:04.387454Z","submitted_at":"2024-05-27T12:24:14Z","title":"Finding good policies in average-reward Markov Decision Processes without prior knowledge"},"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 1 inbound Pith citation observation for arXiv:2405.17108."}