{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GEHOQUI6ZLJLA2K2KDFQKJ4INL","short_pith_number":"pith:GEHOQUI6","canonical_record":{"source":{"id":"1611.09448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T01:07:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"05d53437ca2f6a15ab7f4b57a1f0abdde332d775ebe31827accc1215cbd3cde8","abstract_canon_sha256":"3654067cfdcff921a7217f154d68a22556d77e275921a4b1ad2cae7c93e1262a"},"schema_version":"1.0"},"canonical_sha256":"310ee8511ecad2b0695a50cb0527886aef691178c032cf42e7e86ca360e0d0db","source":{"kind":"arxiv","id":"1611.09448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09448","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09448v2","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09448","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"GEHOQUI6ZLJL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GEHOQUI6ZLJLA2K2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GEHOQUI6","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GEHOQUI6ZLJLA2K2KDFQKJ4INL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T01:07:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"05d53437ca2f6a15ab7f4b57a1f0abdde332d775ebe31827accc1215cbd3cde8","abstract_canon_sha256":"3654067cfdcff921a7217f154d68a22556d77e275921a4b1ad2cae7c93e1262a"},"schema_version":"1.0"},"canonical_sha256":"310ee8511ecad2b0695a50cb0527886aef691178c032cf42e7e86ca360e0d0db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:11.684511Z","signature_b64":"zpBxlhAudVsXdKMeYIx4R7O00FNwm3nIw0/Ondo1TT/1V50Ganwb4l8prtYyy33mTHNXqFqeFi2Czb36YzifBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"310ee8511ecad2b0695a50cb0527886aef691178c032cf42e7e86ca360e0d0db","last_reissued_at":"2026-05-18T00:56:11.684009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:11.684009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09448","source_version":2,"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6F78pMLEEFdejJPgGpEv2PTAuAntRDOdLGroPSgZPgkEM/QfwejM33mAyg2U3br4ceA7BQC1j+tt79TxJs6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:39:24.472799Z"},"content_sha256":"a21c25344b9e23e85139754a4aeff05b0d3d106a17881f1190e933ceef8f5234","schema_version":"1.0","event_id":"sha256:a21c25344b9e23e85139754a4aeff05b0d3d106a17881f1190e933ceef8f5234"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GEHOQUI6ZLJLA2K2KDFQKJ4INL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Upper Bound on Knots in Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kevin K. Chen","submitted_at":"2016-11-29T01:07:58Z","abstract_excerpt":"Neural networks with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the \"complexity\" or \"expressivity\" of a neural network is to count the number of knots in the spline model. We study the number of knots in fully-connected feedforward neural networks with rectified linear unit activation functions. We intentionally keep the neural networks very simple, so as to make theoretical analyses more approachable. An induction on the number of layers $l$ reveals a tight upper bound on the number of knots in $\\mathbb{R} \\to \\mathbb{R}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09448","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":""},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tCBvhGtaot3n9a7gXOBJBHKqwvW96mNN/n48m2kxjM4YFcASG/fa5uE71v7W4pCCMdFqVy4Se2ZJJjPaB5fAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:39:24.473554Z"},"content_sha256":"2c7ad626c1e62b983faf89fc9c3246b43e61e0b16e72257562b122bf96a24490","schema_version":"1.0","event_id":"sha256:2c7ad626c1e62b983faf89fc9c3246b43e61e0b16e72257562b122bf96a24490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/bundle.json","state_url":"https://pith.science/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/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-06-11T00:39:24Z","links":{"resolver":"https://pith.science/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL","bundle":"https://pith.science/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/bundle.json","state":"https://pith.science/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEHOQUI6ZLJLA2K2KDFQKJ4INL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GEHOQUI6ZLJLA2K2KDFQKJ4INL","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":"3654067cfdcff921a7217f154d68a22556d77e275921a4b1ad2cae7c93e1262a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T01:07:58Z","title_canon_sha256":"05d53437ca2f6a15ab7f4b57a1f0abdde332d775ebe31827accc1215cbd3cde8"},"schema_version":"1.0","source":{"id":"1611.09448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09448","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09448v2","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09448","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"GEHOQUI6ZLJL","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GEHOQUI6ZLJLA2K2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GEHOQUI6","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2c7ad626c1e62b983faf89fc9c3246b43e61e0b16e72257562b122bf96a24490","target":"graph","created_at":"2026-05-18T00:56:11Z","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 with rectified linear unit activations are essentially multivariate linear splines. As such, one of many ways to measure the \"complexity\" or \"expressivity\" of a neural network is to count the number of knots in the spline model. We study the number of knots in fully-connected feedforward neural networks with rectified linear unit activation functions. We intentionally keep the neural networks very simple, so as to make theoretical analyses more approachable. An induction on the number of layers $l$ reveals a tight upper bound on the number of knots in $\\mathbb{R} \\to \\mathbb{R}","authors_text":"Kevin K. Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T01:07:58Z","title":"The Upper Bound on Knots in Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09448","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:a21c25344b9e23e85139754a4aeff05b0d3d106a17881f1190e933ceef8f5234","target":"record","created_at":"2026-05-18T00:56:11Z","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":"3654067cfdcff921a7217f154d68a22556d77e275921a4b1ad2cae7c93e1262a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-29T01:07:58Z","title_canon_sha256":"05d53437ca2f6a15ab7f4b57a1f0abdde332d775ebe31827accc1215cbd3cde8"},"schema_version":"1.0","source":{"id":"1611.09448","kind":"arxiv","version":2}},"canonical_sha256":"310ee8511ecad2b0695a50cb0527886aef691178c032cf42e7e86ca360e0d0db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"310ee8511ecad2b0695a50cb0527886aef691178c032cf42e7e86ca360e0d0db","first_computed_at":"2026-05-18T00:56:11.684009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.684009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpBxlhAudVsXdKMeYIx4R7O00FNwm3nIw0/Ondo1TT/1V50Ganwb4l8prtYyy33mTHNXqFqeFi2Czb36YzifBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.684511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a21c25344b9e23e85139754a4aeff05b0d3d106a17881f1190e933ceef8f5234","sha256:2c7ad626c1e62b983faf89fc9c3246b43e61e0b16e72257562b122bf96a24490"],"state_sha256":"c15f2332829afcc2e452959870de83e4fefbae8c0791a7efb60a8c370ba19ec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pU5UjvVPu4o0C1raciEnQHUP4BgaXwa2iIePSOUZISId8anPF5DEoM6ZXjJyLxZkw84qsZewoUkKVONfG6maAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:39:24.478267Z","bundle_sha256":"c38d3b7472054a6b6fa513657160e22a80d4235aed4604f23a14cee5e99ea066"}}