Pith. sign in

Paper Citation Record · LEDGER

Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2405.14956.

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

pith.paper-citation-record.v1
2405.14956 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T13:32:45.150684Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T07:21:55.169299Z

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 cec939f8-62dc-45ad-8e6b-bf0c0563917d · inbound

SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks cites this paper.

SMOSE: Sparse Mixture of Shallow Experts for Interpretable Reinforcement Learning in Continuous Control Tasks Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-11T13:32:45.150684Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T13:32:45.150684Z digest=sha256:e0b2b6c0a64b7591a8b39f20af20d8f881e87e7bdf4acbd9ef8fd9594f17e77e

Observation c0c0ad0b-248b-4083-badb-719320ba596e · inbound

Small Decision Trees for MDPs with Deductive Synthesis cites this paper.

Small Decision Trees for MDPs with Deductive Synthesis Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-10T19:30:54.408504Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-10T19:30:54.408504Z digest=sha256:b5db0b7a64234350e6aa0530d436f4d1d02f68ae753df083c8c5449535557e2a

Observation 3a3cfdfb-0c0a-463c-b835-9d4984537d60 · inbound

A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs cites this paper.

A Survey of Explainable Reinforcement Learning: Targets, Methods and Needs Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Reference 201

Resolution
unresolved
no resolver link, observed 2026-08-06T16:47:07.096224Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T16:47:07.096224Z digest=sha256:b84c6f2e1ba7bb06ec1378cfcad9df8c701eb5ccf7d500252ff0e9d011441e9b

Observation 84bdf642-30d4-4603-8c62-7f3c4d97b89f · inbound

GRAIL: Autonomous Concept Grounding for Neuro-Symbolic Reinforcement Learning cites this paper.

GRAIL: Autonomous Concept Grounding for Neuro-Symbolic Reinforcement Learning Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-05-10T07:21:55.170675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-05-10T07:20:32.282630Z digest=sha256:e10104a008029fc6892c1b3adcd3385e878a7abcca8805fb9f8fd74db9560a11

Observation e8e864a3-c648-421f-bc60-c0a6106f6ec5 · inbound

From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems cites this paper.

From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-01T23:25:56.343456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T23:25:56.343456Z digest=sha256:3c95aa413bb197d9da1865e49ba7b2d9f949d05e4fb6a82e46a8f6d6cbb09395