{"as_of":"2026-08-11T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70c8c1c9784e9a986c2494b7c9b3946663b904216d1ad0ea502133c95234bece","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-10T06:31:04.303077+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-10T16:45:48.381982Z","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-05T20:27:05.152416Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-10T16:45:48.381982Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.13013","last_updated":"2025-01-22T16:56:42Z","snapshot_observed_at":"2026-08-10T20:03:07.762781Z","submitted_at":"2025-01-22T16:56:42Z","title":"The regret lower bound for communicating Markov Decision Processes","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T16:45:48.381982Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2501.13013"},"observation_digest":"sha256:3f95a44a6a96b636f0fc938940123adef852870a2801341bf72a31c1d556515a","observation_id":"925c887c-8363-42e3-8304-5ca275882421","resolution":{"observed_at":"2026-08-10T16:45:48.381982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-10T16:18:17.362465Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.13394","last_updated":"2025-06-15T19:49:41Z","snapshot_observed_at":"2026-08-10T15:57:38.788689Z","submitted_at":"2025-01-23T05:37:33Z","title":"Concurrent Learning with Aggregated States via Randomized Least Squares Value Iteration","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T16:18:17.362465Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2501.13394"},"observation_digest":"sha256:fba8ee816f0d98d3b68f670a892f546b5f561372ea344ca0d1b717c47d5eed83","observation_id":"c9c514a6-8f8d-4fec-a650-1e9eea0d3f66","resolution":{"observed_at":"2026-08-10T16:18:17.362465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-08T11:58:17.064802Z","title":null,"venue":null,"work_id":null,"year":2012},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-08T11:58:17.064802Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2502.07715"},"observation_digest":"sha256:009eab1876898114beac3497cbbdca785d77b4ccad6bcc60609a9d55b132eb6c","observation_id":"800bfa74-f165-4f78-8453-ba96ac2d0931","resolution":{"observed_at":"2026-08-08T11:58:17.064802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-07T06:09:21.670031Z","title":"Regal: A regularization based algorithm for reinforcement learning in weakly communicating mdps","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.06521","last_updated":"2025-06-06T20:33:57Z","snapshot_observed_at":"2026-08-09T16:23:22.535715Z","submitted_at":"2025-06-06T20:33:57Z","title":"Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:21.670031Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2506.06521"},"observation_digest":"sha256:e520838d2c084dc69516df96dc88a6d81eee0841cd7e06de9f9818651d216b5f","observation_id":"e54fec24-9f68-4cf5-aa49-5f8fe58a873c","resolution":{"observed_at":"2026-08-07T06:09:21.670031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","version":1},"cited_work":{"arxiv_id":"1205.2661","doi":null,"metadata_source":"pith","pith_arxiv_id":"1205.2661","snapshot_observed_at":"2026-08-05T20:27:05.152416Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs","venue":"cs.LG","work_id":"edba61d7-2d79-44ad-8daa-52c1358d4fac","year":2012},"citing_paper":{"arxiv_id":"2508.10804","last_updated":"2025-08-14T16:26:00Z","snapshot_observed_at":"2026-08-10T17:02:50.595747Z","submitted_at":"2025-08-14T16:26:00Z","title":"Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T20:27:03.662892Z"},"links":{"cited_paper":"/paper/1205.2661","citing_paper":"/paper/2508.10804"},"observation_digest":"sha256:c42aafffbbe1a890e06466a1caa9f7a425cfb0c505201631456232ecc2a20c22","observation_id":"c88f8d83-b79f-41fa-9a46-20deb7bd4c54","resolution":{"observed_at":"2026-08-05T20:27:05.256092Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1205.2661/citation-record","integrity":"/paper/1205.2661/integrity","json":"/paper/1205.2661/citation-record.json","paper":"/paper/1205.2661"},"outbound":[],"paper":{"arxiv_id":"1205.2661","last_updated":"2012-05-09T14:47:06Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T02:47:58.266745Z","submitted_at":"2012-05-09T14:47:06Z","title":"REGAL: A Regularization based Algorithm for Reinforcement Learning in Weakly Communicating MDPs"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1205.2661."}