{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TW2WVAV3KOKUKXCDVI5WCU3BQR","short_pith_number":"pith:TW2WVAV3","schema_version":"1.0","canonical_sha256":"9db56a82bb5395455c43aa3b61536184548d12453ed56a78aba5649be59c644e","source":{"kind":"arxiv","id":"2303.17045","version":2},"attestation_state":"computed","paper":{"title":"Training Neural Networks is NP-Hard in Fixed Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.CC","authors_text":"Christoph Hertrich, Vincent Froese","submitted_at":"2023-03-29T22:16:52Z","abstract_excerpt":"We study the parameterized complexity of training two-layer neural networks with respect to the dimension of the input data and the number of hidden neurons, considering ReLU and linear threshold activation functions. Albeit the computational complexity of these problems has been studied numerous times in recent years, several questions are still open. We answer questions by Arora et al. [ICLR '18] and Khalife and Basu [IPCO '22] showing that both problems are NP-hard for two dimensions, which excludes any polynomial-time algorithm for constant dimension. We also answer a question by Froese et"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2303.17045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T22:16:52Z","cross_cats_sorted":["cs.DS","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"1f5d240a88ef1c8c517e6d6e3ffbc75600eefd768ce4243d9f734a36c18a4ee8","abstract_canon_sha256":"e4a208acc75616a9444c0975239ca90ac0e7617cbbb7ab2be403c2cd890f3e92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:47.278642Z","signature_b64":"pU1KG657NT7WFJXD7Og02UWLamAxfQIknVTMbaWuh9jvmes5h8YZ/2rDvIUMVFhUub9akRXeMfIxH75L7SNkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db56a82bb5395455c43aa3b61536184548d12453ed56a78aba5649be59c644e","last_reissued_at":"2026-07-05T07:34:47.277992Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:47.277992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training Neural Networks is NP-Hard in Fixed Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","cs.NE","stat.ML"],"primary_cat":"cs.CC","authors_text":"Christoph Hertrich, Vincent Froese","submitted_at":"2023-03-29T22:16:52Z","abstract_excerpt":"We study the parameterized complexity of training two-layer neural networks with respect to the dimension of the input data and the number of hidden neurons, considering ReLU and linear threshold activation functions. Albeit the computational complexity of these problems has been studied numerous times in recent years, several questions are still open. We answer questions by Arora et al. [ICLR '18] and Khalife and Basu [IPCO '22] showing that both problems are NP-hard for two dimensions, which excludes any polynomial-time algorithm for constant dimension. We also answer a question by Froese et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17045","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.17045/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.17045","created_at":"2026-07-05T07:34:47.278065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17045v2","created_at":"2026-07-05T07:34:47.278065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17045","created_at":"2026-07-05T07:34:47.278065+00:00"},{"alias_kind":"pith_short_12","alias_value":"TW2WVAV3KOKU","created_at":"2026-07-05T07:34:47.278065+00:00"},{"alias_kind":"pith_short_16","alias_value":"TW2WVAV3KOKUKXCD","created_at":"2026-07-05T07:34:47.278065+00:00"},{"alias_kind":"pith_short_8","alias_value":"TW2WVAV3","created_at":"2026-07-05T07:34:47.278065+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.20811","citing_title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR","json":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR.json","graph_json":"https://pith.science/api/pith-number/TW2WVAV3KOKUKXCDVI5WCU3BQR/graph.json","events_json":"https://pith.science/api/pith-number/TW2WVAV3KOKUKXCDVI5WCU3BQR/events.json","paper":"https://pith.science/paper/TW2WVAV3"},"agent_actions":{"view_html":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR","download_json":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR.json","view_paper":"https://pith.science/paper/TW2WVAV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17045&json=true","fetch_graph":"https://pith.science/api/pith-number/TW2WVAV3KOKUKXCDVI5WCU3BQR/graph.json","fetch_events":"https://pith.science/api/pith-number/TW2WVAV3KOKUKXCDVI5WCU3BQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR/action/storage_attestation","attest_author":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR/action/author_attestation","sign_citation":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR/action/citation_signature","submit_replication":"https://pith.science/pith/TW2WVAV3KOKUKXCDVI5WCU3BQR/action/replication_record"}},"created_at":"2026-07-05T07:34:47.278065+00:00","updated_at":"2026-07-05T07:34:47.278065+00:00"}