{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5XQ6V2244NW6VKE634ATDAWZ7L","short_pith_number":"pith:5XQ6V224","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"},"canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","source":{"kind":"arxiv","id":"2605.13612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13612","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13612v1","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13612","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"5XQ6V2244NW6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5XQ6V2244NW6VKE6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5XQ6V224","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5XQ6V2244NW6VKE634ATDAWZ7L","target":"record","payload":{"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"},"canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","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"},"source_kind":"arxiv","source_id":"2605.13612","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-18T02:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNdBMeImI/3Z+BhfZwdISivVrMRzTxl9CJ+gUkjlayWJTueXsPDqA9VCN8CSXN+Y0S53as3qX9A1djzjAWFHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:40:36.895057Z"},"content_sha256":"34952cb222b10cd6a1a3a992b8ccdb48e8f2b9dc106d147a4f9324ea4b0b8b13","schema_version":"1.0","event_id":"sha256:34952cb222b10cd6a1a3a992b8ccdb48e8f2b9dc106d147a4f9324ea4b0b8b13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5XQ6V2244NW6VKE634ATDAWZ7L","target":"graph","payload":{"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"},"verdict_id":"da530274-bb01-41b7-a323-694891d498b7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGEPcGHvzGhdJ+THuDB9AU2vwl8XNGgQ6AKalfIIC1U15rMJJbuprAkHaKS76dkMOgnwhO80g39FRb3M/W2GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:40:36.896292Z"},"content_sha256":"d3d4c32959e45cfc77afbc223a4e6cc8260196577bffbb5e84c941dff1c2ef5a","schema_version":"1.0","event_id":"sha256:d3d4c32959e45cfc77afbc223a4e6cc8260196577bffbb5e84c941dff1c2ef5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/bundle.json","state_url":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XQ6V2244NW6VKE634ATDAWZ7L/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-31T07:40:36Z","links":{"resolver":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L","bundle":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/bundle.json","state":"https://pith.science/pith/5XQ6V2244NW6VKE634ATDAWZ7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XQ6V2244NW6VKE634ATDAWZ7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5XQ6V2244NW6VKE634ATDAWZ7L","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":"0a202ec330836c4c2500e5623f246c153a490778bde297b3f77380818356c3ec","cross_cats_sorted":["cond-mat.dis-nn","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:44:06Z","title_canon_sha256":"4522539b8b8c3d792457f87e5005f4e663fe5b819c64d6bd728398a35ea9efd4"},"schema_version":"1.0","source":{"id":"2605.13612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13612","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13612v1","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13612","created_at":"2026-05-18T02:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"5XQ6V2244NW6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5XQ6V2244NW6VKE6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5XQ6V224","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d3d4c32959e45cfc77afbc223a4e6cc8260196577bffbb5e84c941dff1c2ef5a","target":"graph","created_at":"2026-05-18T02:44:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"98eee99d1edb500da12c14d05e1dfb95a62ef266eef7b6320f1955424f3909fb"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Florent Krzakala, Hugo Tabanelli, Luca Arnaboldi, Matteo Vilucchio, Yatin Dandi","cross_cats":["cond-mat.dis-nn","stat.ML"],"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:44:06Z","title":"Deep Learning as Neural Low-Degree Filtering: A Spectral Theory of Hierarchical Feature Learning"},"references":{"count":123,"internal_anchors":1,"resolved_work":123,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Deep learning.nature, 521(7553):436–444, 2015","work_id":"8c42ff53-c495-4b0d-8fa1-03b2d8f9af31","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The unreasonable effectiveness of deep learning in artificial intelligence","work_id":"36377418-d23c-43fe-973c-011bd3d00571","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Visualizing and understanding convolutional networks","work_id":"60453a30-3d6f-49ac-a8e6-80fb37b14549","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"How transferable are features in deep neural networks?Advances in neural information processing systems, 27","work_id":"827b6bdf-60c2-460c-bcc4-a153256c22ad","year":2014},{"cited_arxiv_id":"2405.07987","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The Platonic Representation Hypothesis","work_id":"950baa06-36a7-4010-a959-7304fb1ce08b","year":2024}],"snapshot_sha256":"47144f6f9da2afba6d4424581cdb272f38fae383f0e6efd7a4ea4e2735efa856"},"source":{"id":"2605.13612","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:35:40.881672Z","id":"da530274-bb01-41b7-a323-694891d498b7","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"da530274-bb01-41b7-a323-694891d498b7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:34952cb222b10cd6a1a3a992b8ccdb48e8f2b9dc106d147a4f9324ea4b0b8b13","target":"record","created_at":"2026-05-18T02:44:18Z","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":"0a202ec330836c4c2500e5623f246c153a490778bde297b3f77380818356c3ec","cross_cats_sorted":["cond-mat.dis-nn","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T14:44:06Z","title_canon_sha256":"4522539b8b8c3d792457f87e5005f4e663fe5b819c64d6bd728398a35ea9efd4"},"schema_version":"1.0","source":{"id":"2605.13612","kind":"arxiv","version":1}},"canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede1eaeb5ce36deaa89edf013182d9fad6af9d0895d3d9535f83eb945b919f32","first_computed_at":"2026-05-18T02:44:18.035589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:18.035589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WRFZNFLQP3hGtTQGloQ5PmmBvOAZZ7oqEodLwJppI5fUVe9Wb7cJMQh0hxLoG4HLcR2WOcZ3Uo+qSd1lxhicDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:18.036062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34952cb222b10cd6a1a3a992b8ccdb48e8f2b9dc106d147a4f9324ea4b0b8b13","sha256:d3d4c32959e45cfc77afbc223a4e6cc8260196577bffbb5e84c941dff1c2ef5a"],"state_sha256":"63a494c7e7aa64d7c0c029a24dd80a7ed5fad7307034c7081a2d503386968c21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enjIqaUymTu2j0oYRLjtfRK7SXP1QQliDeWPBUV+9QRDM1CXpFIQDJO7vDLDRJWijz89lXUm6GjbV3CFm7NdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:40:36.901204Z","bundle_sha256":"5b37f284dd1ab0eefa046e03128941a88439ac7783ca18353fe7b22c5083148f"}}