Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
What makes math problems hard for reinforcement learning: a case study
As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.15332.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-06T22:12:26.786981Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-06-29T08:53:15.559455Z
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 4ff966f4-f583-4731-9fa2-faa9303fb280 · inbound
Andrews-Curtis groups cites this paper.
Andrews-Curtis groups What makes math problems hard for reinforcement learning: a case study
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T22:12:26.786981Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 00368593-4464-477e-a40c-89883050d22d · inbound
TriSearch: Learning to Optimize Triangulations via Bistellar Flips cites this paper.
TriSearch: Learning to Optimize Triangulations via Bistellar Flips What makes math problems hard for reinforcement learning: a case study
Reference 48
- Resolution
- malformed identifier
- arxiv_id, observed 2026-06-29T08:53:15.561070Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.
Observation 1ea7010b-1605-4d68-af9c-0b1c8b8fe8be · inbound
Machine-checkable equivalence certificates at the length-14 Andrews-Curtis frontier cites this paper.
Machine-checkable equivalence certificates at the length-14 Andrews-Curtis frontier What makes math problems hard for reinforcement learning: a case study
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-07-30T17:44:04.058102Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.