{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZNY2DA7R4V5XVTXU3IGHUQNC6N","short_pith_number":"pith:ZNY2DA7R","schema_version":"1.0","canonical_sha256":"cb71a183f1e57b7acef4da0c7a41a2f378491fae8709955abc2914673f6d8d42","source":{"kind":"arxiv","id":"1712.08688","version":3},"attestation_state":"computed","paper":{"title":"New error bounds for deep networks using sparse grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hadrien Montanelli, Qiang Du","submitted_at":"2017-12-23T00:18:32Z","abstract_excerpt":"We prove a theorem concerning the approximation of multivariate functions by deep ReLU networks. We present new error estimates for which the curse of the dimensionality is lessened by establishing a connection with sparse grids."},"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":"1712.08688","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-23T00:18:32Z","cross_cats_sorted":[],"title_canon_sha256":"ba9f40bc4d83bcbc15c6b9e7265c1557aab377efc9efbde430f35f00d6fd546d","abstract_canon_sha256":"0f72b5bc831735f9adb688230220c038f3c7766e03414e30f2a6c9d102e10ff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:15.659852Z","signature_b64":"ODrZXE2jGTW6c3IsFdh2vZzZhWKbr2GMJXj6oihkYRo5VtfvAf1r43aQr9eIpth1QEYmYz7x6sd1V6HigWJlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb71a183f1e57b7acef4da0c7a41a2f378491fae8709955abc2914673f6d8d42","last_reissued_at":"2026-05-18T00:08:15.659377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:15.659377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New error bounds for deep networks using sparse grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hadrien Montanelli, Qiang Du","submitted_at":"2017-12-23T00:18:32Z","abstract_excerpt":"We prove a theorem concerning the approximation of multivariate functions by deep ReLU networks. We present new error estimates for which the curse of the dimensionality is lessened by establishing a connection with sparse grids."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08688","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1712.08688","created_at":"2026-05-18T00:08:15.659455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08688v3","created_at":"2026-05-18T00:08:15.659455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08688","created_at":"2026-05-18T00:08:15.659455+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNY2DA7R4V5X","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNY2DA7R4V5XVTXU","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNY2DA7R","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N","json":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N.json","graph_json":"https://pith.science/api/pith-number/ZNY2DA7R4V5XVTXU3IGHUQNC6N/graph.json","events_json":"https://pith.science/api/pith-number/ZNY2DA7R4V5XVTXU3IGHUQNC6N/events.json","paper":"https://pith.science/paper/ZNY2DA7R"},"agent_actions":{"view_html":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N","download_json":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N.json","view_paper":"https://pith.science/paper/ZNY2DA7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08688&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNY2DA7R4V5XVTXU3IGHUQNC6N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNY2DA7R4V5XVTXU3IGHUQNC6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N/action/storage_attestation","attest_author":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N/action/author_attestation","sign_citation":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N/action/citation_signature","submit_replication":"https://pith.science/pith/ZNY2DA7R4V5XVTXU3IGHUQNC6N/action/replication_record"}},"created_at":"2026-05-18T00:08:15.659455+00:00","updated_at":"2026-05-18T00:08:15.659455+00:00"}