Pith. sign in

Paper Citation Record · LEDGER

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2405.14183.

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

pith.paper-citation-record.v1
2405.14183 v2

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-19T06:32:44.657259+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-08T22:30:49.068316Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-08T11:45:36.091036Z

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 951f6199-1e60-4cd0-9044-36f5e678e5d4 · inbound

Unifying and Optimizing Data Values for Selection via Sequential Decision-Making cites this paper.

Unifying and Optimizing Data Values for Selection via Sequential Decision-Making Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-08T22:30:49.068316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T22:30:49.068316Z digest=sha256:f72afdba067fec2cbfffb75733c73abbda5d810704b93e8cf21da91ae1f34bc1

Observation e08598d7-e897-4fdc-9236-6ab7b1143200 · inbound

Polynomial-Time Approximability of Constrained Reinforcement Learning cites this paper.

Polynomial-Time Approximability of Constrained Reinforcement Learning Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time

Reference 26

Resolution
verified exact
local_arxiv, observed 2026-08-08T11:45:36.094985Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-08-08T11:45:35.671359Z digest=sha256:ae4aff3c889f1e2391ed8be33258ecc71e9cb47b35293f36dfc191309991ebf0