{"as_of":"2026-08-08T23:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6d74e39f0fb1c1323965548d32f864e5dac0157d9b44fdf1c9e105c77ef683d4","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.988572Z","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-11T08:11:03.565796Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.06450","last_updated":"2022-08-31T03:04:16Z","snapshot_observed_at":"2026-07-06T12:37:21.762051Z","submitted_at":"2022-02-14T01:31:46Z","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06450","snapshot_observed_at":"2026-08-07T15:37:01.988572Z","title":"Towards deployment-efficient reinforcement learning: Lower bound and optimality","venue":null,"work_id":null,"year":2022},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:01.988572Z"},"links":{"cited_paper":"/paper/2202.06450","citing_paper":"/paper/2505.14821"},"observation_digest":"sha256:1e3ffdf7e2ae2ab5e09f501196745cdeb623d05fb0fa81fc3da82508f2473bad","observation_id":"255b7f55-7f02-4aca-8a34-25c15c2acc10","resolution":{"observed_at":"2026-08-07T15:37:01.988572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06450","last_updated":"2022-08-31T03:04:16Z","snapshot_observed_at":"2026-07-06T12:37:21.762051Z","submitted_at":"2022-02-14T01:31:46Z","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","version":3},"cited_work":{"arxiv_id":"2202.06450","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.06450","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Towards deployment-efficient reinforcement learning: Lower bound and optimal- ity","venue":null,"work_id":"c007e72e-cd45-4fb9-8534-483d7f6e349b","year":2022},"citing_paper":{"arxiv_id":"2604.10427","last_updated":"2026-04-16T12:55:31Z","snapshot_observed_at":"2026-07-06T22:59:05.519456Z","submitted_at":"2026-04-12T02:52:24Z","title":"A Queueing-Theoretic Framework for Dynamic Attack Surfaces: Data-Integrated Risk Analysis and Adaptive Defense","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-10T16:46:41.137868Z"},"links":{"cited_paper":"/paper/2202.06450","citing_paper":"/paper/2604.10427"},"observation_digest":"sha256:3e7015a294a4bc07346736593a7564f09cf4169f854772d072c609387a69e4d7","observation_id":"38280bb2-4161-4e04-9b1a-5aaefd842a09","resolution":{"observed_at":"2026-05-11T08:11:03.572347Z","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/2202.06450/citation-record","integrity":"/paper/2202.06450/integrity","json":"/paper/2202.06450/citation-record.json","paper":"/paper/2202.06450"},"outbound":[],"paper":{"arxiv_id":"2202.06450","last_updated":"2022-08-31T03:04:16Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:37:21.762051Z","submitted_at":"2022-02-14T01:31:46Z","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality"},"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:2202.06450."}