{"as_of":"2026-08-18T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:843fe0461794008925b58ae4f486b617e4531fb996a9bcb3aae98f55f484b4fc","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:54:13.863800Z","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-07-03T23:49:01.921708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-08-14T04:54:13.863800Z","title":"P rovably efficient reinforcement learning with linear function approximation","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1909.02506","last_updated":"2020-06-20T17:17:19Z","snapshot_observed_at":"2026-08-16T03:49:01.484422Z","submitted_at":"2019-09-05T16:20:41Z","title":"$\\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T04:54:13.863800Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/1909.02506"},"observation_digest":"sha256:3691128e2546bba0779dfbbd0ff7598e33c7ffb6c277b0296ea44abe1749ac12","observation_id":"70db911d-5bc8-49d7-9b49-3b148c7fdae3","resolution":{"observed_at":"2026-08-14T04:54:13.863800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":"1907.05388","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-07-03T23:49:01.921708Z","title":"13 Zain Ulabedeen Farhat, Debamita Ghosh, George K Atia, and Yue Wang","venue":null,"work_id":"9398d629-7367-41f5-aa06-f8e4f0f2121c","year":1907},"citing_paper":{"arxiv_id":"2605.03125","last_updated":"2026-05-06T22:03:28Z","snapshot_observed_at":"2026-08-15T17:50:58.873332Z","submitted_at":"2026-05-04T20:04:52Z","title":"Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T19:13:15.234351Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/2605.03125"},"observation_digest":"sha256:da6b934507e2beb6273ef5a1d4b6d0aeb8efa8aa0582dd9ba95e5b1250151841","observation_id":"fe812a04-aa3f-427b-9898-609bb95c18b5","resolution":{"observed_at":"2026-05-09T06:00:35.946251Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":"1907.05388","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-07-03T23:49:01.921708Z","title":"13 Zain Ulabedeen Farhat, Debamita Ghosh, George K Atia, and Yue Wang","venue":null,"work_id":"9398d629-7367-41f5-aa06-f8e4f0f2121c","year":1907},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T13:39:24.488442Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:61132c61877ec2f21a29584f3e5cf5211dcb043babc264c6142b0133c14df6a4","observation_id":"5d06263b-74ef-4fa1-bc0e-49d7fcb93c07","resolution":{"observed_at":"2026-07-03T04:47:38.226185Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":"1907.05388","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-07-03T23:49:01.921708Z","title":"13 Zain Ulabedeen Farhat, Debamita Ghosh, George K Atia, and Yue Wang","venue":null,"work_id":"9398d629-7367-41f5-aa06-f8e4f0f2121c","year":1907},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":6},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-03T23:44:25.951719Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:30cb42c1486cc24a379d8ec9a1b5341605f76f4b0f7dfdc4b135686f80319042","observation_id":"414fb887-a556-408b-90bd-423f5d645709","resolution":{"observed_at":"2026-07-03T23:49:01.923307Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-07-12T14:23:15.089919Z","title":null,"venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":7},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T14:23:15.089919Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:cc9a75e28509fa6277a9d7e99ecef4664c1b0dcf9c086c679a9d86deb4866465","observation_id":"c5ecd9fa-2d4b-421b-86e8-fca5a2d520f3","resolution":{"observed_at":"2026-07-12T14:23:15.089919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with Linear Function Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05388","snapshot_observed_at":"2026-08-02T11:53:51.087284Z","title":null,"venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2606.11171","last_updated":"2026-07-25T21:50:01Z","snapshot_observed_at":"2026-08-02T11:53:46.153456Z","submitted_at":"2026-06-09T17:49:09Z","title":"Bellman-sufficient Information Complexity","version":9},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T11:53:51.087284Z"},"links":{"cited_paper":"/paper/1907.05388","citing_paper":"/paper/2606.11171"},"observation_digest":"sha256:9bbb02b9e7ddb1f8c03221ef65955db7fab2c1802920483618bc039740e0dfae","observation_id":"c496e685-b1f3-4c74-8553-bdac69a70c1f","resolution":{"observed_at":"2026-08-02T11:53:51.087284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.05388/citation-record","integrity":"/paper/1907.05388/integrity","json":"/paper/1907.05388/citation-record.json","paper":"/paper/1907.05388"},"outbound":[],"paper":{"arxiv_id":"1907.05388","last_updated":"2019-08-08T07:23:12Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T23:29:59.724188Z","submitted_at":"2019-07-11T17:06:11Z","title":"Provably Efficient Reinforcement Learning with 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-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 6 inbound Pith citation observations for arXiv:1907.05388."}