{"as_of":"2026-08-08T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62fc29ed2604da0da2921307c47feb5266616fa3f2e6c03633ba491f4167b255","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:51:21.496167Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":4,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.17045","last_updated":"2024-01-18T12:10:03Z","snapshot_observed_at":"2026-08-05T21:02:53.757400Z","submitted_at":"2023-03-29T22:16:52Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17045","snapshot_observed_at":"2026-08-07T14:51:21.496167Z","title":"Froese and C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17751","last_updated":"2025-05-23T11:21:05Z","snapshot_observed_at":"2026-08-07T14:39:12.500513Z","submitted_at":"2025-05-23T11:21:05Z","title":"Computational Math with Neural Networks is Hard","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:21.496167Z"},"links":{"cited_paper":"/paper/2303.17045","citing_paper":"/paper/2505.17751"},"observation_digest":"sha256:13c72549a65d7b653affefdf0e63b7d345d3d1ba8b2488d72eefced873635e32","observation_id":"33885e21-5e72-4a4e-8a46-ed6931ec7dde","resolution":{"observed_at":"2026-08-07T14:51:21.496167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17045","last_updated":"2024-01-18T12:10:03Z","snapshot_observed_at":"2026-08-05T21:02:53.757400Z","submitted_at":"2023-03-29T22:16:52Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension","version":2},"cited_work":{"arxiv_id":"2303.17045","doi":"10.48550/arxiv.2303.17045","metadata_source":"pith","pith_arxiv_id":"2303.17045","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension","venue":"cs.CC","work_id":"d1d866dc-4695-42e7-9969-ce05dbf980a2","year":2023},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.192253Z"},"links":{"cited_paper":"/paper/2303.17045","citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:95b40e71fc548427afa1f1bfba043fbca66d1d96f461beeb7c24bfac0804543a","observation_id":"9e1cf20e-0e31-4d07-b46c-ce032c4ecc1b","resolution":{"observed_at":"2026-08-01T09:39:29.936815Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2303.17045/citation-record","integrity":"/paper/2303.17045/integrity","json":"/paper/2303.17045/citation-record.json","paper":"/paper/2303.17045"},"outbound":[],"paper":{"arxiv_id":"2303.17045","last_updated":"2024-01-18T12:10:03Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-05T21:02:53.757400Z","submitted_at":"2023-03-29T22:16:52Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"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."}