{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5XQ6V2244NW6VKE634ATDAWZ7L","short_pith_number":"pith:5XQ6V224","schema_version":"1.0","canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","source":{"kind":"arxiv","id":"2605.13612","version":1},"attestation_state":"computed","paper":{"title":"Deep Learning as Neural Low-Degree Filtering: A Spectral Theory of Hierarchical Feature Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Neural Low-Degree Filtering models deep learning as an explicit iterative spectral process in which each layer selects features by maximal low-degree correlation to the label.","cross_cats":["cond-mat.dis-nn","stat.ML"],"primary_cat":"cs.LG","authors_text":"Florent Krzakala, Hugo Tabanelli, Luca Arnaboldi, Matteo Vilucchio, Yatin Dandi","submitted_at":"2026-05-13T14:44:06Z","abstract_excerpt":"Understanding how deep neural networks learn useful internal representations from data remains a central open problem in the theory of deep learning. We introduce Neural Low-Degree Filtering (Neural LoFi), a stylized limit of gradient-based training in which hierarchical feature learning becomes an explicit iterative spectral procedure. In this limit, the dynamics at each layer decouple: given the current representation, the next layer selects directions with maximal accessible low-degree correlation to the label. This yields a tractable surrogate mechanism for deep learning, together with a n"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13612","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:44:06Z","cross_cats_sorted":["cond-mat.dis-nn","stat.ML"],"title_canon_sha256":"4522539b8b8c3d792457f87e5005f4e663fe5b819c64d6bd728398a35ea9efd4","abstract_canon_sha256":"0a202ec330836c4c2500e5623f246c153a490778bde297b3f77380818356c3ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:18.036062Z","signature_b64":"WRFZNFLQP3hGtTQGloQ5PmmBvOAZZ7oqEodLwJppI5fUVe9Wb7cJMQh0hxLoG4HLcR2WOcZ3Uo+qSd1lxhicDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","last_reissued_at":"2026-05-18T02:44:18.035589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:18.035589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning as Neural Low-Degree Filtering: A Spectral Theory of Hierarchical Feature Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Neural Low-Degree Filtering models deep learning as an explicit iterative spectral process in which each layer selects features by maximal low-degree correlation to the label.","cross_cats":["cond-mat.dis-nn","stat.ML"],"primary_cat":"cs.LG","authors_text":"Florent Krzakala, Hugo Tabanelli, Luca Arnaboldi, Matteo Vilucchio, Yatin Dandi","submitted_at":"2026-05-13T14:44:06Z","abstract_excerpt":"Understanding how deep neural networks learn useful internal representations from data remains a central open problem in the theory of deep learning. We introduce Neural Low-Degree Filtering (Neural LoFi), a stylized limit of gradient-based training in which hierarchical feature learning becomes an explicit iterative spectral procedure. In this limit, the dynamics at each layer decouple: given the current representation, the next layer selects directions with maximal accessible low-degree correlation to the label. This yields a tractable surrogate mechanism for deep learning, together with a n"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Neural LoFi provides a mathematically explicit framework for studying multi-layer feature learning beyond the lazy regime. It predicts how representations are selected layer by layer, explains how emergence of concepts arises with given sample complexity, and gives a concrete mechanism by which depth progressively constructs new features from old ones through low-degree compositionality.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that, in the stylized limit of gradient-based training, the dynamics at each layer decouple so that the next layer can independently select directions with maximal accessible low-degree correlation to the label.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Neural LoFi models deep learning as layer-wise spectral filtering that selects maximal low-degree correlations, yielding a tractable surrogate for hierarchical representation learning beyond the lazy regime.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Neural Low-Degree Filtering models deep learning as an explicit iterative spectral process in which each layer selects features by maximal low-degree correlation to the label.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"98eee99d1edb500da12c14d05e1dfb95a62ef266eef7b6320f1955424f3909fb"},"source":{"id":"2605.13612","kind":"arxiv","version":1},"verdict":{"id":"da530274-bb01-41b7-a323-694891d498b7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:35:40.881672Z","strongest_claim":"Neural LoFi provides a mathematically explicit framework for studying multi-layer feature learning beyond the lazy regime. It predicts how representations are selected layer by layer, explains how emergence of concepts arises with given sample complexity, and gives a concrete mechanism by which depth progressively constructs new features from old ones through low-degree compositionality.","one_line_summary":"Neural LoFi models deep learning as layer-wise spectral filtering that selects maximal low-degree correlations, yielding a tractable surrogate for hierarchical representation learning beyond the lazy regime.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that, in the stylized limit of gradient-based training, the dynamics at each layer decouple so that the next layer can independently select directions with maximal accessible low-degree correlation to the label.","pith_extraction_headline":"Neural Low-Degree Filtering models deep learning as an explicit iterative spectral process in which each layer selects features by maximal low-degree correlation to the label."},"references":{"count":123,"sample":[{"doi":"","year":2015,"title":"Deep learning.nature, 521(7553):436–444, 2015","work_id":"8c42ff53-c495-4b0d-8fa1-03b2d8f9af31","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"The unreasonable effectiveness of deep learning in artificial intelligence","work_id":"36377418-d23c-43fe-973c-011bd3d00571","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Visualizing and understanding convolutional networks","work_id":"60453a30-3d6f-49ac-a8e6-80fb37b14549","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"How transferable are features in deep neural networks?Advances in neural information processing systems, 27","work_id":"827b6bdf-60c2-460c-bcc4-a153256c22ad","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"The Platonic Representation Hypothesis","work_id":"950baa06-36a7-4010-a959-7304fb1ce08b","ref_index":5,"cited_arxiv_id":"2405.07987","is_internal_anchor":false}],"resolved_work":123,"snapshot_sha256":"47144f6f9da2afba6d4424581cdb272f38fae383f0e6efd7a4ea4e2735efa856","internal_anchors":1},"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":"2605.13612","created_at":"2026-05-18T02:44:18.035667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13612v1","created_at":"2026-05-18T02:44:18.035667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13612","created_at":"2026-05-18T02:44:18.035667+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XQ6V2244NW6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XQ6V2244NW6VKE6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XQ6V224","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L","json":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L.json","graph_json":"https://pith.science/api/pith-number/5XQ6V2244NW6VKE634ATDAWZ7L/graph.json","events_json":"https://pith.science/api/pith-number/5XQ6V2244NW6VKE634ATDAWZ7L/events.json","paper":"https://pith.science/paper/5XQ6V224"},"agent_actions":{"view_html":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L","download_json":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L.json","view_paper":"https://pith.science/paper/5XQ6V224","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13612&json=true","fetch_graph":"https://pith.science/api/pith-number/5XQ6V2244NW6VKE634ATDAWZ7L/graph.json","fetch_events":"https://pith.science/api/pith-number/5XQ6V2244NW6VKE634ATDAWZ7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/action/storage_attestation","attest_author":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/action/author_attestation","sign_citation":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/action/citation_signature","submit_replication":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/action/replication_record"}},"created_at":"2026-05-18T02:44:18.035667+00:00","updated_at":"2026-05-18T02:44:18.035667+00:00"}