{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ODNREPU4UEOJFIH5PKC4BYTSPU","short_pith_number":"pith:ODNREPU4","schema_version":"1.0","canonical_sha256":"70db123e9ca11c92a0fd7a85c0e2727d3e7cc5b7b92dd08f18c4d5b105b0cec1","source":{"kind":"arxiv","id":"1606.05336","version":6},"attestation_state":"computed","paper":{"title":"On the Expressive Power of Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ben Poole, Jascha Sohl-Dickstein, Jon Kleinberg, Maithra Raghu, Surya Ganguli","submitted_at":"2016-06-16T19:55:29Z","abstract_excerpt":"We propose a new approach to the problem of neural network expressivity, which seeks to characterize how structural properties of a neural network family affect the functions it is able to compute. Our approach is based on an interrelated set of measures of expressivity, unified by the novel notion of trajectory length, which measures how the output of a network changes as the input sweeps along a one-dimensional path. Our findings can be summarized as follows:\n  (1) The complexity of the computed function grows exponentially with depth.\n  (2) All weights are not equal: trained networks are mo"},"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":"1606.05336","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-16T19:55:29Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"982197b302ef837254a9bafa3a66326aaec9a13cdffa9bef1d63b5bd353d3df8","abstract_canon_sha256":"87b932928e15174b7dd90e42a46188fa16c1e927a981344cda765fe135be3330"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:13.000304Z","signature_b64":"uaELU/kW+KW28NW/iVPx/GgF9RHnjaLsqJohQ4tEeB95s8bVXlirKMwrpyPzXqpst5CmtatdTsWLKpgXAR+QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70db123e9ca11c92a0fd7a85c0e2727d3e7cc5b7b92dd08f18c4d5b105b0cec1","last_reissued_at":"2026-05-18T00:42:12.999296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.999296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Expressive Power of Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ben Poole, Jascha Sohl-Dickstein, Jon Kleinberg, Maithra Raghu, Surya Ganguli","submitted_at":"2016-06-16T19:55:29Z","abstract_excerpt":"We propose a new approach to the problem of neural network expressivity, which seeks to characterize how structural properties of a neural network family affect the functions it is able to compute. Our approach is based on an interrelated set of measures of expressivity, unified by the novel notion of trajectory length, which measures how the output of a network changes as the input sweeps along a one-dimensional path. Our findings can be summarized as follows:\n  (1) The complexity of the computed function grows exponentially with depth.\n  (2) All weights are not equal: trained networks are mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05336","kind":"arxiv","version":6},"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":"1606.05336","created_at":"2026-05-18T00:42:12.999615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05336v6","created_at":"2026-05-18T00:42:12.999615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05336","created_at":"2026-05-18T00:42:12.999615+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODNREPU4UEOJ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODNREPU4UEOJFIH5","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODNREPU4","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2606.27142","citing_title":"Estimation of High Dimensional Bounded Discrete Graphical Models via Regularized Generalized Score Matching","ref_index":205,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10089","citing_title":"A Theory on Flow Matching with Neural Networks","ref_index":72,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10023","citing_title":"Learning the Universe: Posterior Reliability of Neural Generative Models in High-Dimensional Field-Level Inference of Cosmic Initial Conditions","ref_index":97,"is_internal_anchor":true},{"citing_arxiv_id":"2401.01335","citing_title":"Self-Play Fine-Tuning Converts Weak Language Models to Strong Language Models","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00510","citing_title":"Scale-Aware Adversarial Analysis: A Diagnostic for Generative AI in Multiscale Complex Systems","ref_index":102,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU","json":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU.json","graph_json":"https://pith.science/api/pith-number/ODNREPU4UEOJFIH5PKC4BYTSPU/graph.json","events_json":"https://pith.science/api/pith-number/ODNREPU4UEOJFIH5PKC4BYTSPU/events.json","paper":"https://pith.science/paper/ODNREPU4"},"agent_actions":{"view_html":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU","download_json":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU.json","view_paper":"https://pith.science/paper/ODNREPU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05336&json=true","fetch_graph":"https://pith.science/api/pith-number/ODNREPU4UEOJFIH5PKC4BYTSPU/graph.json","fetch_events":"https://pith.science/api/pith-number/ODNREPU4UEOJFIH5PKC4BYTSPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU/action/storage_attestation","attest_author":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU/action/author_attestation","sign_citation":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU/action/citation_signature","submit_replication":"https://pith.science/pith/ODNREPU4UEOJFIH5PKC4BYTSPU/action/replication_record"}},"created_at":"2026-05-18T00:42:12.999615+00:00","updated_at":"2026-05-18T00:42:12.999615+00:00"}