{"as_of":"2026-08-13T21:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a19cb9ff0eadca6d2d60a8ce2781bbe8ab29f94bd39070a771d9c1393b93b734","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-13T06:32:02.005865+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-05-14T19:28:32.795407Z","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-05-14T19:29:23.733731Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.06244","last_updated":"2026-08-11T15:07:41Z","snapshot_observed_at":"2026-08-13T21:11:31.172900Z","submitted_at":"2025-12-06T02:04:50Z","title":"Auto-exploration for online reinforcement learning","version":4},"cited_work":{"arxiv_id":"2512.06244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2512.06244","snapshot_observed_at":"2026-06-25T02:18:11.514207Z","title":"and Lan, G","venue":null,"work_id":"7a2d5095-6fbf-4065-b8fa-5941c05a21e3","year":2025},"citing_paper":{"arxiv_id":"2604.06039","last_updated":"2026-04-07T16:34:16Z","snapshot_observed_at":"2026-07-06T22:54:34.877944Z","submitted_at":"2026-04-07T16:34:16Z","title":"Value Mirror Descent for Reinforcement Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T19:07:41.863349Z"},"links":{"cited_paper":"/paper/2512.06244","citing_paper":"/paper/2604.06039"},"observation_digest":"sha256:c09dd71cdb31012a6dc360f0e5ba80039c5ddc548730d45f32cc60c2b3e2a68c","observation_id":"3c2f95b9-6767-426a-8ab0-2aecb20cb122","resolution":{"observed_at":"2026-06-25T02:18:11.514207Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.06244","last_updated":"2026-08-11T15:07:41Z","snapshot_observed_at":"2026-08-13T21:11:31.172900Z","submitted_at":"2025-12-06T02:04:50Z","title":"Auto-exploration for online reinforcement learning","version":4},"cited_work":{"arxiv_id":"2512.06244","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2512.06244","snapshot_observed_at":"2026-06-25T02:18:11.514207Z","title":"and Lan, G","venue":null,"work_id":"7a2d5095-6fbf-4065-b8fa-5941c05a21e3","year":2025},"citing_paper":{"arxiv_id":"2605.13639","last_updated":"2026-05-13T15:04:59Z","snapshot_observed_at":"2026-08-02T11:45:59.910042Z","submitted_at":"2026-05-13T15:04:59Z","title":"Achieving $\\epsilon^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-14T19:28:32.795407Z"},"links":{"cited_paper":"/paper/2512.06244","citing_paper":"/paper/2605.13639"},"observation_digest":"sha256:cfec22a7327b8f9abe53ce62f68fe93783116176b2b455ecd7c9609658003ec5","observation_id":"b1293fed-13ee-4003-9f63-d3f5c7a3ce3f","resolution":{"observed_at":"2026-06-25T02:18:11.514207Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2512.06244/citation-record","integrity":"/paper/2512.06244/integrity","json":"/paper/2512.06244/citation-record.json","paper":"/paper/2512.06244"},"outbound":[],"paper":{"arxiv_id":"2512.06244","last_updated":"2026-08-11T15:07:41Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:11:31.172900Z","submitted_at":"2025-12-06T02:04:50Z","title":"Auto-exploration for online reinforcement learning"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2512.06244."}