{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VRNAJSJQKIPB2ZX2NK4G4JXMXE","short_pith_number":"pith:VRNAJSJQ","schema_version":"1.0","canonical_sha256":"ac5a04c930521e1d66fa6ab86e26ecb900cb0dedabfe68177ccfddf865e618f6","source":{"kind":"arxiv","id":"2405.11696","version":1},"attestation_state":"computed","paper":{"title":"Approximation and Gradient Descent Training with Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"G. Welper","submitted_at":"2024-05-19T23:04:09Z","abstract_excerpt":"It is well understood that neural networks with carefully hand-picked weights provide powerful function approximation and that they can be successfully trained in over-parametrized regimes. Since over-parametrization ensures zero training error, these two theories are not immediately compatible. Recent work uses the smoothness that is required for approximation results to extend a neural tangent kernel (NTK) optimization argument to an under-parametrized regime and show direct approximation bounds for networks trained by gradient flow. Since gradient flow is only an idealization of a practical"},"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":"2405.11696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-19T23:04:09Z","cross_cats_sorted":[],"title_canon_sha256":"96cc9498957514774b964a313e2123da05c9efbb437dc249f38925c7483e3dd0","abstract_canon_sha256":"ffd1d17b93beb52a2302656f5cdb99683ecef058146bcc50306d69ae847f0a22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:43.161435Z","signature_b64":"HEswG+SeHRsUNUWnBfrrHARy6TSVLLLoXJBc/UCiuIil80bLYYNODonT8KhscVrryhlSWk9IPSHJ2E8YrMEaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5a04c930521e1d66fa6ab86e26ecb900cb0dedabfe68177ccfddf865e618f6","last_reissued_at":"2026-07-05T08:20:43.160952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:43.160952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation and Gradient Descent Training with Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"G. Welper","submitted_at":"2024-05-19T23:04:09Z","abstract_excerpt":"It is well understood that neural networks with carefully hand-picked weights provide powerful function approximation and that they can be successfully trained in over-parametrized regimes. Since over-parametrization ensures zero training error, these two theories are not immediately compatible. Recent work uses the smoothness that is required for approximation results to extend a neural tangent kernel (NTK) optimization argument to an under-parametrized regime and show direct approximation bounds for networks trained by gradient flow. Since gradient flow is only an idealization of a practical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11696","kind":"arxiv","version":1},"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/2405.11696/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":"2405.11696","created_at":"2026-07-05T08:20:43.161020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11696v1","created_at":"2026-07-05T08:20:43.161020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11696","created_at":"2026-07-05T08:20:43.161020+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRNAJSJQKIPB","created_at":"2026-07-05T08:20:43.161020+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRNAJSJQKIPB2ZX2","created_at":"2026-07-05T08:20:43.161020+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRNAJSJQ","created_at":"2026-07-05T08:20:43.161020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15646","citing_title":"Mathematical analysis of the gradients in deep learning","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE","json":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE.json","graph_json":"https://pith.science/api/pith-number/VRNAJSJQKIPB2ZX2NK4G4JXMXE/graph.json","events_json":"https://pith.science/api/pith-number/VRNAJSJQKIPB2ZX2NK4G4JXMXE/events.json","paper":"https://pith.science/paper/VRNAJSJQ"},"agent_actions":{"view_html":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE","download_json":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE.json","view_paper":"https://pith.science/paper/VRNAJSJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11696&json=true","fetch_graph":"https://pith.science/api/pith-number/VRNAJSJQKIPB2ZX2NK4G4JXMXE/graph.json","fetch_events":"https://pith.science/api/pith-number/VRNAJSJQKIPB2ZX2NK4G4JXMXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE/action/storage_attestation","attest_author":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE/action/author_attestation","sign_citation":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE/action/citation_signature","submit_replication":"https://pith.science/pith/VRNAJSJQKIPB2ZX2NK4G4JXMXE/action/replication_record"}},"created_at":"2026-07-05T08:20:43.161020+00:00","updated_at":"2026-07-05T08:20:43.161020+00:00"}