Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2204.01368.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-01T09:35:44.822462Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
7
pith, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation a5113a64-3800-4161-bcbb-b48149bebd35 · inbound
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training cites this paper.
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
Reference 3
- Resolution
- verified exact
- local_arxiv, observed 2026-08-01T09:39:30.122621Z
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.