{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HJN3TP7F65KVKTRJJILXIPDNDR","short_pith_number":"pith:HJN3TP7F","canonical_record":{"source":{"id":"1706.03301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-11T03:07:42Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"132d117ae67f945fa6b9f712a0a64b17a6fc2885afefaacef5c0a472c370ada9","abstract_canon_sha256":"4e4868c8e06e374088513ffcacedef4b71c0fa9dd3306115a7d61af09fbbf23b"},"schema_version":"1.0"},"canonical_sha256":"3a5bb9bfe5f755554e294a17743c6d1c5eb5f2c463d9e978f28f942469b0cd62","source":{"kind":"arxiv","id":"1706.03301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03301","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03301v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03301","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"HJN3TP7F65KV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJN3TP7F65KVKTRJ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJN3TP7F","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HJN3TP7F65KVKTRJJILXIPDNDR","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03301","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-11T03:07:42Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"132d117ae67f945fa6b9f712a0a64b17a6fc2885afefaacef5c0a472c370ada9","abstract_canon_sha256":"4e4868c8e06e374088513ffcacedef4b71c0fa9dd3306115a7d61af09fbbf23b"},"schema_version":"1.0"},"canonical_sha256":"3a5bb9bfe5f755554e294a17743c6d1c5eb5f2c463d9e978f28f942469b0cd62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:37.851037Z","signature_b64":"qkHIEQ1RzSKg5mAWQU4xZ8dbMLHAwmIauNgcseDSTfLZwHb4j/rrXLZzNDQSUfrN4rRm4xKMNJHDCZSqiLVgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5bb9bfe5f755554e294a17743c6d1c5eb5f2c463d9e978f28f942469b0cd62","last_reissued_at":"2026-05-18T00:42:37.850517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:37.850517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03301","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeCdAUbWCBor+bw6ZtFScFodaZ80THeaAjEEB6O5l7c07yCdJLoEURQMSnmQkEKWTuQ9r6sNGBVCbuUd5TE8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:10:20.481258Z"},"content_sha256":"57264b026b04308be20cbe3f2a5e3af44df4e1e129a0f27d0649261e3603a6fb","schema_version":"1.0","event_id":"sha256:57264b026b04308be20cbe3f2a5e3af44df4e1e129a0f27d0649261e3603a6fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HJN3TP7F65KVKTRJJILXIPDNDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural networks and rational functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Matus Telgarsky","submitted_at":"2017-06-11T03:07:42Z","abstract_excerpt":"Neural networks and rational functions efficiently approximate each other. In more detail, it is shown here that for any ReLU network, there exists a rational function of degree $O(\\text{polylog}(1/\\epsilon))$ which is $\\epsilon$-close, and similarly for any rational function there exists a ReLU network of size $O(\\text{polylog}(1/\\epsilon))$ which is $\\epsilon$-close. By contrast, polynomials need degree $\\Omega(\\text{poly}(1/\\epsilon))$ to approximate even a single ReLU. When converting a ReLU network to a rational function as above, the hidden constants depend exponentially on the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03301","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fy8c8XG2e6nS4F1SgvCghNOKa1pLqETKKFr+uiTnLioruEX6OsnAmOHBXuCUe92yXul03NcuxwwzMzL19CUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:10:20.481642Z"},"content_sha256":"35b1e27d60f22ff660d11f7e160dad5c93e92da440e397d060378f62b02c661d","schema_version":"1.0","event_id":"sha256:35b1e27d60f22ff660d11f7e160dad5c93e92da440e397d060378f62b02c661d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJN3TP7F65KVKTRJJILXIPDNDR/bundle.json","state_url":"https://pith.science/pith/HJN3TP7F65KVKTRJJILXIPDNDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJN3TP7F65KVKTRJJILXIPDNDR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T11:10:20Z","links":{"resolver":"https://pith.science/pith/HJN3TP7F65KVKTRJJILXIPDNDR","bundle":"https://pith.science/pith/HJN3TP7F65KVKTRJJILXIPDNDR/bundle.json","state":"https://pith.science/pith/HJN3TP7F65KVKTRJJILXIPDNDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJN3TP7F65KVKTRJJILXIPDNDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HJN3TP7F65KVKTRJJILXIPDNDR","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":"4e4868c8e06e374088513ffcacedef4b71c0fa9dd3306115a7d61af09fbbf23b","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-11T03:07:42Z","title_canon_sha256":"132d117ae67f945fa6b9f712a0a64b17a6fc2885afefaacef5c0a472c370ada9"},"schema_version":"1.0","source":{"id":"1706.03301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03301","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03301v1","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03301","created_at":"2026-05-18T00:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"HJN3TP7F65KV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJN3TP7F65KVKTRJ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJN3TP7F","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:35b1e27d60f22ff660d11f7e160dad5c93e92da440e397d060378f62b02c661d","target":"graph","created_at":"2026-05-18T00:42:37Z","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"},"paper":{"abstract_excerpt":"Neural networks and rational functions efficiently approximate each other. In more detail, it is shown here that for any ReLU network, there exists a rational function of degree $O(\\text{polylog}(1/\\epsilon))$ which is $\\epsilon$-close, and similarly for any rational function there exists a ReLU network of size $O(\\text{polylog}(1/\\epsilon))$ which is $\\epsilon$-close. By contrast, polynomials need degree $\\Omega(\\text{poly}(1/\\epsilon))$ to approximate even a single ReLU. When converting a ReLU network to a rational function as above, the hidden constants depend exponentially on the number of","authors_text":"Matus Telgarsky","cross_cats":["cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-11T03:07:42Z","title":"Neural networks and rational functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03301","kind":"arxiv","version":1},"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:57264b026b04308be20cbe3f2a5e3af44df4e1e129a0f27d0649261e3603a6fb","target":"record","created_at":"2026-05-18T00:42:37Z","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":"4e4868c8e06e374088513ffcacedef4b71c0fa9dd3306115a7d61af09fbbf23b","cross_cats_sorted":["cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-11T03:07:42Z","title_canon_sha256":"132d117ae67f945fa6b9f712a0a64b17a6fc2885afefaacef5c0a472c370ada9"},"schema_version":"1.0","source":{"id":"1706.03301","kind":"arxiv","version":1}},"canonical_sha256":"3a5bb9bfe5f755554e294a17743c6d1c5eb5f2c463d9e978f28f942469b0cd62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a5bb9bfe5f755554e294a17743c6d1c5eb5f2c463d9e978f28f942469b0cd62","first_computed_at":"2026-05-18T00:42:37.850517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:37.850517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qkHIEQ1RzSKg5mAWQU4xZ8dbMLHAwmIauNgcseDSTfLZwHb4j/rrXLZzNDQSUfrN4rRm4xKMNJHDCZSqiLVgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:37.851037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57264b026b04308be20cbe3f2a5e3af44df4e1e129a0f27d0649261e3603a6fb","sha256:35b1e27d60f22ff660d11f7e160dad5c93e92da440e397d060378f62b02c661d"],"state_sha256":"59af62b11b9a7d6d082df5ef0e995f8869f92754ab601bb1e4781dc9a808ef9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AW5SE35Sci7SQC+fWU3UY/zgpEZL8PT6ZkWCk1qPr7NbSe+IpEguji44Q/Z83c1BDv/8vM+ikPssmYwb0V4dBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:10:20.484059Z","bundle_sha256":"29154863bf6aec44eea194e21393530ff0855186c6a3a05923bc46772b14281b"}}