Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-04T06:42:43.702820Z
Paper Citation Record · LEDGER
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees
As of 15 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:2512.01870.
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-15T06:32:42.880941+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
5 of 5 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved4
- parse uncertain0
- malformed identifier1
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 493dfb81-a2db-48e3-9e93-cd2af1d5e7be · outbound
This paper cites Practical recommendations for gradient-based training of deep ar- chitectures.
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees Practical recommendations for gradient-based training of deep ar- chitectures
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T06:42:43.195789Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 29b4905d-c44b-43da-a158-1e0cac8d614b · outbound
This paper cites On the impossibility of discovering a formula for primes using AI.
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees On the impossibility of discovering a formula for primes using AI
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T06:42:43.449894Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6a14c352-676b-42ac-92f2-ee33e3e21e12 · outbound
This paper cites A simple linear algebra identity to optimize Large-Scale Neural Network Quantum States.
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees A simple linear algebra identity to optimize Large-Scale Neural Network Quantum States
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T06:42:43.702820Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8b7bf29e-4c4e-48ef-a856-923e0ba6d0d9 · outbound
This paper cites Algorithms of the M¨ obius Function by Random Forests and Neural Networks.
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees Algorithms of the M¨ obius Function by Random Forests and Neural Networks
Reference 413
- Resolution
- malformed identifier
- doi_truncated, observed 2026-08-04T06:43:21.259208Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.
Observation ce5bef90-f545-4add-9e89-f8acfd9d4236 · outbound
This paper cites Integer Factorisation, Fermat & Machine Learning on a Classical Computer.
Testing Transformer Learnability on the Arithmetic Sequence of Rooted Trees Integer Factorisation, Fermat & Machine Learning on a Classical Computer
Reference 478
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T06:42:43.305969Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.