Pith. sign in

Paper Citation Record · LEDGER

Training Neural Networks is NP-Hard in Fixed Dimension

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

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

pith.paper-citation-record.v1
2303.17045 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-08T06:32:00.761636+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-07T14:51:21.496167Z

measured 1 of 1 external citation measurements

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

4
pith, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 33885e21-5e72-4a4e-8a46-ed6931ec7dde · inbound

Computational Math with Neural Networks is Hard cites this paper.

Computational Math with Neural Networks is Hard Training Neural Networks is NP-Hard in Fixed Dimension

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T14:51:21.496167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T14:51:21.496167Z digest=sha256:13c72549a65d7b653affefdf0e63b7d345d3d1ba8b2488d72eefced873635e32

Observation 9e1cf20e-0e31-4d07-b46c-ce032c4ecc1b · 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 Neural Networks is NP-Hard in Fixed Dimension

Reference 18

Resolution
verified exact
local_arxiv, observed 2026-08-01T09:39:29.936815Z

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.

source=arxiv_source observed=2026-08-01T09:35:46.192253Z digest=sha256:95b40e71fc548427afa1f1bfba043fbca66d1d96f461beeb7c24bfac0804543a