{"as_of":"2026-08-11T14:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8958f3c8cd62912e0565eb0c024cb61a6315b93e1762a5d218caa6fed66a0b34","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-11T06:34:44.6726+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-10T16:18:17.455424Z","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-10T16:18:17.670948Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.04241","last_updated":"2017-06-13T20:22:54Z","snapshot_observed_at":"2026-08-11T09:47:36.851934Z","submitted_at":"2017-06-13T20:22:54Z","title":"On Optimistic versus Randomized Exploration in Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"1706.04241","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.04241","snapshot_observed_at":"2026-08-10T16:18:17.670948Z","title":"On Optimistic versus Randomized Exploration in Reinforcement Learning","venue":"stat.ML","work_id":"bcfebce1-5c7c-4477-af97-fc85436ab91b","year":2017},"citing_paper":{"arxiv_id":"2501.13394","last_updated":"2025-06-15T19:49:41Z","snapshot_observed_at":"2026-08-11T05:35:29.939153Z","submitted_at":"2025-01-23T05:37:33Z","title":"Concurrent Learning with Aggregated States via Randomized Least Squares Value Iteration","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T16:18:17.455424Z"},"links":{"cited_paper":"/paper/1706.04241","citing_paper":"/paper/2501.13394"},"observation_digest":"sha256:e8795d8f70b00a2c12d98999a8a9cbb69a98dadb5238a1eadeefd7b94c55762b","observation_id":"7af09584-591b-402a-9623-62dea23801c6","resolution":{"observed_at":"2026-08-10T16:18:17.675088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.04241/citation-record","integrity":"/paper/1706.04241/integrity","json":"/paper/1706.04241/citation-record.json","paper":"/paper/1706.04241"},"outbound":[],"paper":{"arxiv_id":"1706.04241","last_updated":"2017-06-13T20:22:54Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-11T09:47:36.851934Z","submitted_at":"2017-06-13T20:22:54Z","title":"On Optimistic versus Randomized Exploration in 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1706.04241."}