{"as_of":"2026-08-10T05:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:176963d46b22ee118cb59ffb72fa9f11d52b07176c9f84088e3eadfe5425cac5","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-09T06:31:02.800959+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-08T11:58:17.285029Z","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-20T14:38:21.468285Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-08-08T11:58:17.285029Z","title":"S., and Krishnamurthy, A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.07715","last_updated":"2025-09-11T17:08:49Z","snapshot_observed_at":"2026-08-10T00:23:43.525308Z","submitted_at":"2025-02-11T17:15:55Z","title":"Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.285029Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:d610cb712a6059d99ca9b587d0894bbad562a67a901a234b69578ac17d28f45d","observation_id":"75a7666c-b69d-4573-9741-5dac53f5fe9a","resolution":{"observed_at":"2026-08-08T11:58:17.285029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-08-07T20:38:32.926910Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2502.09780","last_updated":"2025-02-13T21:28:51Z","snapshot_observed_at":"2026-08-09T11:53:25.646352Z","submitted_at":"2025-02-13T21:28:51Z","title":"Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T20:38:32.926910Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2502.09780"},"observation_digest":"sha256:68602ff520940b37643c2077ad465ab444d333024c750c28470eb4bf7b3935f9","observation_id":"94f784ff-c043-4172-8b59-4453d5003995","resolution":{"observed_at":"2026-08-07T20:38:32.926910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-08-07T00:32:53.761065Z","title":"S., and Krishnamurthy, A","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.13672","last_updated":"2025-06-16T16:30:00Z","snapshot_observed_at":"2026-08-09T12:19:47.488554Z","submitted_at":"2025-06-16T16:30:00Z","title":"The Courage to Stop: Overcoming Sunk Cost Fallacy in Deep Reinforcement Learning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T00:32:53.761065Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2506.13672"},"observation_digest":"sha256:73d468ea6bdc42026396fb910fddc566cf1869625257ca51ce24ec1aea97fc48","observation_id":"cc25d49c-21eb-4831-96f8-e5b9a1915127","resolution":{"observed_at":"2026-08-07T00:32:53.761065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":"1912.04136","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1912.04136 , year=","venue":null,"work_id":"41be504a-4993-44dc-b52f-355035c9bf30","year":1912},"citing_paper":{"arxiv_id":"2605.10909","last_updated":"2026-05-11T17:49:09Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:49:09Z","title":"Revisiting Policy Gradients for Restricted Policy Classes: Escaping Myopic Local Optima with $k$-step Policy Gradients","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-12T04:02:04.342363Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2605.10909"},"observation_digest":"sha256:ce9dcbeba6066f368867e9780625ba0dfa5c59db9aa05f505bd4dd1ae7e93e3f","observation_id":"537b7f25-8aff-4080-9cca-21b382d81ddc","resolution":{"observed_at":"2026-05-12T06:41:44.235997Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation","version":1},"cited_work":{"arxiv_id":"1912.04136","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.04136","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:1912.04136 , year=","venue":null,"work_id":"41be504a-4993-44dc-b52f-355035c9bf30","year":1912},"citing_paper":{"arxiv_id":"2605.17126","last_updated":"2026-05-29T08:34:47Z","snapshot_observed_at":"2026-08-01T15:51:01.135958Z","submitted_at":"2026-05-16T19:06:54Z","title":"Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety","version":1},"reference_index":110,"source":"arxiv_source","source_observed_at":"2026-05-20T14:37:24.057523Z"},"links":{"cited_paper":"/paper/1912.04136","citing_paper":"/paper/2605.17126"},"observation_digest":"sha256:20c4d6f946f2756589b7bede0da998174bf987d491760ad718cc35eda7f95727","observation_id":"ecf58914-12bd-4e63-8871-c8e56c99fa2c","resolution":{"observed_at":"2026-05-20T14:38:21.470059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1912.04136/citation-record","integrity":"/paper/1912.04136/integrity","json":"/paper/1912.04136/citation-record.json","paper":"/paper/1912.04136"},"outbound":[],"paper":{"arxiv_id":"1912.04136","last_updated":"2019-12-09T15:47:27Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-09T19:14:25.090165Z","submitted_at":"2019-12-09T15:47:27Z","title":"Optimism in Reinforcement Learning with Generalized Linear Function Approximation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1912.04136."}