{"as_of":"2026-08-08T18:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bdca95ee11177bf4f45c972df2c1c62b28842bb58c2b255314126b7098a9638","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-08T06:32:00.761636+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-08-07T15:37:01.315074Z","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-11T15:16:05.084282Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2101.00494","last_updated":"2021-01-02T18:41:27Z","snapshot_observed_at":"2026-07-06T10:29:29.006834Z","submitted_at":"2021-01-02T18:41:27Z","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00494","snapshot_observed_at":"2026-08-07T15:37:01.315074Z","title":"A provably efficient algorithm for linear markov decision process with low switching cost","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14821","last_updated":"2025-05-20T18:37:51Z","snapshot_observed_at":"2026-08-07T15:26:45.720556Z","submitted_at":"2025-05-20T18:37:51Z","title":"Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.315074Z"},"links":{"cited_paper":"/paper/2101.00494","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:ef58a5404c58b426e52df7c12352849304cd52572faeda02ebbcd74dbc0501e3","observation_id":"b1d2a57e-f7af-4e2e-81f8-98e72c58d1c5","resolution":{"observed_at":"2026-08-07T15:37:01.315074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00494","last_updated":"2021-01-02T18:41:27Z","snapshot_observed_at":"2026-07-06T10:29:29.006834Z","submitted_at":"2021-01-02T18:41:27Z","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost","version":1},"cited_work":{"arxiv_id":"2101.00494","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.00494","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A provably efficient algorithm for linear markov decision process with low switching cost.arXiv preprint arXiv:2101.00494","venue":null,"work_id":"9f172d56-a49c-4726-a24f-e2b02c0a1549","year":null},"citing_paper":{"arxiv_id":"2605.00393","last_updated":"2026-05-01T04:32:23Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T04:32:23Z","title":"Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-09T20:27:03.746672Z"},"links":{"cited_paper":"/paper/2101.00494","citing_paper":"/paper/2605.00393"},"observation_digest":"sha256:1d48db66e8f846150209445a6dc1814a0f940c5d0ecb9d5f2a2c424fae7170c1","observation_id":"07d71cca-270a-49d1-a6ec-2b6c65ca593a","resolution":{"observed_at":"2026-05-11T15:16:05.093549Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.00494/citation-record","integrity":"/paper/2101.00494/integrity","json":"/paper/2101.00494/citation-record.json","paper":"/paper/2101.00494"},"outbound":[],"paper":{"arxiv_id":"2101.00494","last_updated":"2021-01-02T18:41:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T10:29:29.006834Z","submitted_at":"2021-01-02T18:41:27Z","title":"A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2101.00494."}