Pith. sign in

Paper Citation Record · LEDGER

Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2202.06450 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:37:01.988572Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T08:11:03.565796Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 255b7f55-7f02-4aca-8a34-25c15c2acc10 · inbound

Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation cites this paper.

Sample and Computationally Efficient Continuous-Time Reinforcement Learning with General Function Approximation Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-07T15:37:01.988572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T15:37:01.988572Z digest=sha256:1e3ffdf7e2ae2ab5e09f501196745cdeb623d05fb0fa81fc3da82508f2473bad

Observation 38280bb2-4161-4e04-9b1a-5aaefd842a09 · inbound

A Queueing-Theoretic Framework for Dynamic Attack Surfaces: Data-Integrated Risk Analysis and Adaptive Defense cites this paper.

A Queueing-Theoretic Framework for Dynamic Attack Surfaces: Data-Integrated Risk Analysis and Adaptive Defense Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality

Reference 30

Resolution
verified exact
arxiv_id, observed 2026-05-11T08:11:03.572347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-05-10T16:46:41.137868Z digest=sha256:3e7015a294a4bc07346736593a7564f09cf4169f854772d072c609387a69e4d7