{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J3Y3OBQIFQY2EMGJEAZGXGSJQD","short_pith_number":"pith:J3Y3OBQI","canonical_record":{"source":{"id":"2406.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-12T21:43:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"38426dd385f767a4a79fad1ce43217873dadb68fa3469a456b88b526abcfc165","abstract_canon_sha256":"1defba35ad07627112001bcdcb2aab154ba30341913169405f5eb62a555cb596"},"schema_version":"1.0"},"canonical_sha256":"4ef1b706082c31a230c920326b9a4980ebfd6a9f0a0f7602cd70c6a904a1c7b7","source":{"kind":"arxiv","id":"2406.08658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08658","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08658v1","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08658","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"J3Y3OBQIFQY2","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_16","alias_value":"J3Y3OBQIFQY2EMGJ","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_8","alias_value":"J3Y3OBQI","created_at":"2026-07-05T08:31:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J3Y3OBQIFQY2EMGJEAZGXGSJQD","target":"record","payload":{"canonical_record":{"source":{"id":"2406.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-12T21:43:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"38426dd385f767a4a79fad1ce43217873dadb68fa3469a456b88b526abcfc165","abstract_canon_sha256":"1defba35ad07627112001bcdcb2aab154ba30341913169405f5eb62a555cb596"},"schema_version":"1.0"},"canonical_sha256":"4ef1b706082c31a230c920326b9a4980ebfd6a9f0a0f7602cd70c6a904a1c7b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:20.886512Z","signature_b64":"FZnYQt5ZGXcEWjD2yzBcXHxm6nl1fWsDwjQaxulZJgsefFLFTnT+wJF5YdGDzVVXCcXNCK7yGzfaoK5va5lGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef1b706082c31a230c920326b9a4980ebfd6a9f0a0f7602cd70c6a904a1c7b7","last_reissued_at":"2026-07-05T08:31:20.886035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:20.886035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.08658","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-07-05T08:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSBz3b4967S6N0DqCOEggkTJSMfP/wi45nuu9xwLumZ0LdDV4OeiwgRsY1IUOAXXwv7YwJ82GiHCBUv+qpRBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:49:30.993303Z"},"content_sha256":"04fa1122515cacbdc09bace560f97a49a349cc99a20e698d6c0e5a8fa6f8b490","schema_version":"1.0","event_id":"sha256:04fa1122515cacbdc09bace560f97a49a349cc99a20e698d6c0e5a8fa6f8b490"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J3Y3OBQIFQY2EMGJEAZGXGSJQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pruning is Optimal for Learning Sparse Features in High-Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Murat A. Erdogdu, Nuri Mert Vural","submitted_at":"2024-06-12T21:43:12Z","abstract_excerpt":"While it is commonly observed in practice that pruning networks to a certain level of sparsity can improve the quality of the features, a theoretical explanation of this phenomenon remains elusive. In this work, we investigate this by demonstrating that a broad class of statistical models can be optimally learned using pruned neural networks trained with gradient descent, in high-dimensions.\n  We consider learning both single-index and multi-index models of the form $y = \\sigma^*(\\boldsymbol{V}^{\\top} \\boldsymbol{x}) + \\epsilon$, where $\\sigma^*$ is a degree-$p$ polynomial, and $\\boldsymbol{V}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08658","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/2406.08658/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"},"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-07-05T08:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jesMtrbGSqHsoJejOFB75MFn+Yr6ANFtCl+6/8Y1Qpb3Xdv9XPhLqG+sGTlxIZ+jkvdzUJKRr0SJHPPXt1OxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:49:30.993887Z"},"content_sha256":"88910f3d75d60d0c1ea53314b2c934f5fa097fb0bbc3cb0418de3fff484f1cfe","schema_version":"1.0","event_id":"sha256:88910f3d75d60d0c1ea53314b2c934f5fa097fb0bbc3cb0418de3fff484f1cfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/bundle.json","state_url":"https://pith.science/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/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-08-09T09:49:30Z","links":{"resolver":"https://pith.science/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD","bundle":"https://pith.science/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/bundle.json","state":"https://pith.science/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3Y3OBQIFQY2EMGJEAZGXGSJQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J3Y3OBQIFQY2EMGJEAZGXGSJQD","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":"1defba35ad07627112001bcdcb2aab154ba30341913169405f5eb62a555cb596","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-12T21:43:12Z","title_canon_sha256":"38426dd385f767a4a79fad1ce43217873dadb68fa3469a456b88b526abcfc165"},"schema_version":"1.0","source":{"id":"2406.08658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08658","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08658v1","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08658","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"J3Y3OBQIFQY2","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_16","alias_value":"J3Y3OBQIFQY2EMGJ","created_at":"2026-07-05T08:31:20Z"},{"alias_kind":"pith_short_8","alias_value":"J3Y3OBQI","created_at":"2026-07-05T08:31:20Z"}],"graph_snapshots":[{"event_id":"sha256:88910f3d75d60d0c1ea53314b2c934f5fa097fb0bbc3cb0418de3fff484f1cfe","target":"graph","created_at":"2026-07-05T08:31:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.08658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While it is commonly observed in practice that pruning networks to a certain level of sparsity can improve the quality of the features, a theoretical explanation of this phenomenon remains elusive. In this work, we investigate this by demonstrating that a broad class of statistical models can be optimally learned using pruned neural networks trained with gradient descent, in high-dimensions.\n  We consider learning both single-index and multi-index models of the form $y = \\sigma^*(\\boldsymbol{V}^{\\top} \\boldsymbol{x}) + \\epsilon$, where $\\sigma^*$ is a degree-$p$ polynomial, and $\\boldsymbol{V}","authors_text":"Murat A. Erdogdu, Nuri Mert Vural","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-12T21:43:12Z","title":"Pruning is Optimal for Learning Sparse Features in High-Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08658","kind":"arxiv","version":1},"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:04fa1122515cacbdc09bace560f97a49a349cc99a20e698d6c0e5a8fa6f8b490","target":"record","created_at":"2026-07-05T08:31:20Z","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":"1defba35ad07627112001bcdcb2aab154ba30341913169405f5eb62a555cb596","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-12T21:43:12Z","title_canon_sha256":"38426dd385f767a4a79fad1ce43217873dadb68fa3469a456b88b526abcfc165"},"schema_version":"1.0","source":{"id":"2406.08658","kind":"arxiv","version":1}},"canonical_sha256":"4ef1b706082c31a230c920326b9a4980ebfd6a9f0a0f7602cd70c6a904a1c7b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ef1b706082c31a230c920326b9a4980ebfd6a9f0a0f7602cd70c6a904a1c7b7","first_computed_at":"2026-07-05T08:31:20.886035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:31:20.886035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FZnYQt5ZGXcEWjD2yzBcXHxm6nl1fWsDwjQaxulZJgsefFLFTnT+wJF5YdGDzVVXCcXNCK7yGzfaoK5va5lGBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:31:20.886512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.08658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04fa1122515cacbdc09bace560f97a49a349cc99a20e698d6c0e5a8fa6f8b490","sha256:88910f3d75d60d0c1ea53314b2c934f5fa097fb0bbc3cb0418de3fff484f1cfe"],"state_sha256":"daac7ed5d5cb25945b933e92712460981100eb1350dc3cbcedbdb49a9449eadc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCTxgDWLwgGPEAc3m4teMpgiBF1m4Ad9x07PLZIn2me8ECJFuDXa+ADSoa2FBR8MCFRMqWASakpSnbVU3SaTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:49:30.999795Z","bundle_sha256":"f9f4ed11782aa9661736d7ee7cdccd3e81d8388cfd0e1bb5485c3571d6d49e69"}}