{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VFYWKNVUDTKTN4QINHB2V4CWFP","short_pith_number":"pith:VFYWKNVU","schema_version":"1.0","canonical_sha256":"a9716536b41cd536f20869c3aaf0562bed8ff98d51ffb8ec4ab2dfbcd2bec1f7","source":{"kind":"arxiv","id":"2507.02550","version":1},"attestation_state":"computed","paper":{"title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David A. Danhofer, Davide D'Ascenzo, Rafael Dubach, Tomaso Poggio","submitted_at":"2025-07-03T11:49:56Z","abstract_excerpt":"Overparametrized Deep Neural Networks (DNNs) have demonstrated remarkable success in a wide variety of domains too high-dimensional for classical shallow networks subject to the curse of dimensionality. However, open questions about fundamental principles, that govern the learning dynamics of DNNs, remain. In this position paper we argue that it is the ability of DNNs to exploit the compositionally sparse structure of the target function driving their success. As such, DNNs can leverage the property that most practically relevant functions can be composed from a small set of constituent functi"},"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":"2507.02550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-03T11:49:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b87e40a9b9ab50a9583e00de595ad3b701b4a39884496e46e5d5ddfc16c18237","abstract_canon_sha256":"ba0a7edfe3c51ba6b7709fee519eb0dcb2ea4b008339bc3ffddbdc9e6b767f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:30.736244Z","signature_b64":"hFEzlUYE+G3rqxpcf+Xlz+5sM9pJ829RHwJwfnLOM6Iw1k49VGDoBGUElCna//sD2CfBAUNA5Vo0U5fthY7WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9716536b41cd536f20869c3aaf0562bed8ff98d51ffb8ec4ab2dfbcd2bec1f7","last_reissued_at":"2026-07-05T11:31:30.735744Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:30.735744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Position: A Theory of Deep Learning Must Include Compositional Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David A. Danhofer, Davide D'Ascenzo, Rafael Dubach, Tomaso Poggio","submitted_at":"2025-07-03T11:49:56Z","abstract_excerpt":"Overparametrized Deep Neural Networks (DNNs) have demonstrated remarkable success in a wide variety of domains too high-dimensional for classical shallow networks subject to the curse of dimensionality. However, open questions about fundamental principles, that govern the learning dynamics of DNNs, remain. In this position paper we argue that it is the ability of DNNs to exploit the compositionally sparse structure of the target function driving their success. As such, DNNs can leverage the property that most practically relevant functions can be composed from a small set of constituent functi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.02550/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.02550","created_at":"2026-07-05T11:31:30.735806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02550v1","created_at":"2026-07-05T11:31:30.735806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02550","created_at":"2026-07-05T11:31:30.735806+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFYWKNVUDTKT","created_at":"2026-07-05T11:31:30.735806+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFYWKNVUDTKTN4QI","created_at":"2026-07-05T11:31:30.735806+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFYWKNVU","created_at":"2026-07-05T11:31:30.735806+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26705","citing_title":"Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19941","citing_title":"Compositionality Emerges in a Narrow Depth-Connectivity Regime: Architecture Constraints and Solution Manifolds","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14764","citing_title":"Compositional Sparsity as an Inductive Bias for Neural Architecture Design","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25608","citing_title":"Learning Sparse Compositional Functions with Norm-Constrained Neural Networks","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08934","citing_title":"From Mechanistic to Compositional Interpretability","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP","json":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP.json","graph_json":"https://pith.science/api/pith-number/VFYWKNVUDTKTN4QINHB2V4CWFP/graph.json","events_json":"https://pith.science/api/pith-number/VFYWKNVUDTKTN4QINHB2V4CWFP/events.json","paper":"https://pith.science/paper/VFYWKNVU"},"agent_actions":{"view_html":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP","download_json":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP.json","view_paper":"https://pith.science/paper/VFYWKNVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02550&json=true","fetch_graph":"https://pith.science/api/pith-number/VFYWKNVUDTKTN4QINHB2V4CWFP/graph.json","fetch_events":"https://pith.science/api/pith-number/VFYWKNVUDTKTN4QINHB2V4CWFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP/action/storage_attestation","attest_author":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP/action/author_attestation","sign_citation":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP/action/citation_signature","submit_replication":"https://pith.science/pith/VFYWKNVUDTKTN4QINHB2V4CWFP/action/replication_record"}},"created_at":"2026-07-05T11:31:30.735806+00:00","updated_at":"2026-07-05T11:31:30.735806+00:00"}