{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:37VL664E7OB6S5Q6FCYDD53QNQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"89ce68ec9f70750f790c4b61cc740756e7ce519d988e8733808ee5d60a3166dc","cross_cats_sorted":["cs.NA","cs.NE","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-27T09:11:14Z","title_canon_sha256":"c1eefb77c8db3dae8e36551b6b1a7123df917281ccb396efb03b4f604f339efb"},"schema_version":"1.0","source":{"id":"2312.16483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.16483","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"2312.16483v2","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16483","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"37VL664E7OB6","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_16","alias_value":"37VL664E7OB6S5Q6","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_8","alias_value":"37VL664E","created_at":"2026-07-05T07:32:26Z"}],"graph_snapshots":[{"event_id":"sha256:b9114346235d7f324a76d5fd405021f7a354f2c3461f36f4da0b4e66cf43bb17","target":"graph","created_at":"2026-07-05T07:32:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.16483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate the expressivity and approximation properties of deep neural networks employing the ReLU$^k$ activation function for $k \\geq 2$. Although deep ReLU networks can approximate polynomials effectively, deep ReLU$^k$ networks have the capability to represent higher-degree polynomials precisely. Our initial contribution is a comprehensive, constructive proof for polynomial representation using deep ReLU$^k$ networks. This allows us to establish an upper bound on both the size and count of network parameters. Consequently, we are able to demonstrate a suboptimal approxim","authors_text":"Jinchao Xu, Juncai He, Tong Mao","cross_cats":["cs.NA","cs.NE","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-27T09:11:14Z","title":"Expressivity and Approximation Properties of Deep Neural Networks with ReLU$^k$ Activation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16483","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd02a24f264fee309e3bc2b99b752465beedf5eb7acbfa2fe58aed4013c9f72e","target":"record","created_at":"2026-07-05T07:32:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"89ce68ec9f70750f790c4b61cc740756e7ce519d988e8733808ee5d60a3166dc","cross_cats_sorted":["cs.NA","cs.NE","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-27T09:11:14Z","title_canon_sha256":"c1eefb77c8db3dae8e36551b6b1a7123df917281ccb396efb03b4f604f339efb"},"schema_version":"1.0","source":{"id":"2312.16483","kind":"arxiv","version":2}},"canonical_sha256":"dfeabf7b84fb83e9761e28b031f7706c3bf8435c2d4b6e9c8716027e6736a808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfeabf7b84fb83e9761e28b031f7706c3bf8435c2d4b6e9c8716027e6736a808","first_computed_at":"2026-07-05T07:32:26.307010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:26.307010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/Hm7PN8v30B1F0x/nb3eU3Sl3JO2lZX0nL7N4GdWVstqvLatkoEHiHxl2H4/wNRO8qcmzuWmHnqpRxjhLCTDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:26.307492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.16483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd02a24f264fee309e3bc2b99b752465beedf5eb7acbfa2fe58aed4013c9f72e","sha256:b9114346235d7f324a76d5fd405021f7a354f2c3461f36f4da0b4e66cf43bb17"],"state_sha256":"b6121e3629cf6e0d3d4e7d7e46dfc36c3628cb7734900864408184070bd175cf"}