{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XFTEQI2K2PFAFUTCRQW3XAUYVO","short_pith_number":"pith:XFTEQI2K","canonical_record":{"source":{"id":"2602.03535","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-03T13:51:45Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"6ce60a0a448b5893c805d8d9b203a7419720a4023c7561c973490c664ce0beaf","abstract_canon_sha256":"9eec9d5a15cffbaae4bf868709259545c3c747d689ee3ffacd9b07aecfc2c954"},"schema_version":"1.0"},"canonical_sha256":"b96648234ad3ca02d2628c2dbb8298ab8dae1c052c4888f614a3c1013fa72805","source":{"kind":"arxiv","id":"2602.03535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.03535","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2602.03535v2","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.03535","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"XFTEQI2K2PFA","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"XFTEQI2K2PFAFUTC","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"XFTEQI2K","created_at":"2026-05-20T00:04:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XFTEQI2K2PFAFUTCRQW3XAUYVO","target":"record","payload":{"canonical_record":{"source":{"id":"2602.03535","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-03T13:51:45Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"6ce60a0a448b5893c805d8d9b203a7419720a4023c7561c973490c664ce0beaf","abstract_canon_sha256":"9eec9d5a15cffbaae4bf868709259545c3c747d689ee3ffacd9b07aecfc2c954"},"schema_version":"1.0"},"canonical_sha256":"b96648234ad3ca02d2628c2dbb8298ab8dae1c052c4888f614a3c1013fa72805","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:24.170360Z","signature_b64":"idWO13TPJO/ZgpDloQFCFNAnKxck0juAeQlRV+kcayDCtVLye+TCCHEqWnF1tMT7r1LFPwd/hqwPetue/Ys6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96648234ad3ca02d2628c2dbb8298ab8dae1c052c4888f614a3c1013fa72805","last_reissued_at":"2026-05-20T00:04:24.169473Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:24.169473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.03535","source_version":2,"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-20T00:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bVGKdUZRqtXYICRH8560Z7vqRaYeziQODVExzzmjTTu0vTS5l9d1ZllBKQFUive8+d2wQgh86C6c4qdM+/6VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:13:49.832199Z"},"content_sha256":"850038c7f28704f3e0ad29e1f4b7974bc0b701ccd6744447ab0611ae1da736b7","schema_version":"1.0","event_id":"sha256:850038c7f28704f3e0ad29e1f4b7974bc0b701ccd6744447ab0611ae1da736b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XFTEQI2K2PFAFUTCRQW3XAUYVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Training of Neural Networks based on Multilevel Mirror Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Leon Bungert, Sebastian J. Scott, Yannick Lunk","submitted_at":"2026-02-03T13:51:45Z","abstract_excerpt":"We introduce a dynamic sparse training algorithm based on linearized Bregman iterations / mirror descent that exploits the naturally incurred sparsity by alternating between periods of static and dynamic sparsity pattern updates. The key idea is to combine sparsity-inducing Bregman iterations with adaptive freezing of the network structure to enable efficient exploration of the sparse parameter space while maintaining sparsity. We provide convergence guaranties by embedding our method in a multilevel optimization framework. Furthermore, we empirically show that our algorithm can produce highly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.03535","kind":"arxiv","version":2},"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/2602.03535/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-05-20T00:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkeYgr7Z7UWPGe0+BYk7riP9rZznTFnjUKQLntPS16yQmh9Gzq64E6evSS9CqCvJDSkrdI8blFsp3GlCWo9VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:13:49.833353Z"},"content_sha256":"24c6aaff4d18f4044aa219e02a8116eed5924455723fa1fff4ce5efec24b5261","schema_version":"1.0","event_id":"sha256:24c6aaff4d18f4044aa219e02a8116eed5924455723fa1fff4ce5efec24b5261"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/bundle.json","state_url":"https://pith.science/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/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-06-10T13:13:49Z","links":{"resolver":"https://pith.science/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO","bundle":"https://pith.science/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/bundle.json","state":"https://pith.science/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFTEQI2K2PFAFUTCRQW3XAUYVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XFTEQI2K2PFAFUTCRQW3XAUYVO","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":"9eec9d5a15cffbaae4bf868709259545c3c747d689ee3ffacd9b07aecfc2c954","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-03T13:51:45Z","title_canon_sha256":"6ce60a0a448b5893c805d8d9b203a7419720a4023c7561c973490c664ce0beaf"},"schema_version":"1.0","source":{"id":"2602.03535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.03535","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2602.03535v2","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.03535","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"XFTEQI2K2PFA","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"XFTEQI2K2PFAFUTC","created_at":"2026-05-20T00:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"XFTEQI2K","created_at":"2026-05-20T00:04:24Z"}],"graph_snapshots":[{"event_id":"sha256:24c6aaff4d18f4044aa219e02a8116eed5924455723fa1fff4ce5efec24b5261","target":"graph","created_at":"2026-05-20T00:04:24Z","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/2602.03535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a dynamic sparse training algorithm based on linearized Bregman iterations / mirror descent that exploits the naturally incurred sparsity by alternating between periods of static and dynamic sparsity pattern updates. The key idea is to combine sparsity-inducing Bregman iterations with adaptive freezing of the network structure to enable efficient exploration of the sparse parameter space while maintaining sparsity. We provide convergence guaranties by embedding our method in a multilevel optimization framework. Furthermore, we empirically show that our algorithm can produce highly","authors_text":"Leon Bungert, Sebastian J. Scott, Yannick Lunk","cross_cats":["cs.NA","math.NA","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-03T13:51:45Z","title":"Sparse Training of Neural Networks based on Multilevel Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.03535","kind":"arxiv","version":2},"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:850038c7f28704f3e0ad29e1f4b7974bc0b701ccd6744447ab0611ae1da736b7","target":"record","created_at":"2026-05-20T00:04:24Z","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":"9eec9d5a15cffbaae4bf868709259545c3c747d689ee3ffacd9b07aecfc2c954","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-03T13:51:45Z","title_canon_sha256":"6ce60a0a448b5893c805d8d9b203a7419720a4023c7561c973490c664ce0beaf"},"schema_version":"1.0","source":{"id":"2602.03535","kind":"arxiv","version":2}},"canonical_sha256":"b96648234ad3ca02d2628c2dbb8298ab8dae1c052c4888f614a3c1013fa72805","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96648234ad3ca02d2628c2dbb8298ab8dae1c052c4888f614a3c1013fa72805","first_computed_at":"2026-05-20T00:04:24.169473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:24.169473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"idWO13TPJO/ZgpDloQFCFNAnKxck0juAeQlRV+kcayDCtVLye+TCCHEqWnF1tMT7r1LFPwd/hqwPetue/Ys6Bw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:24.170360Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.03535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:850038c7f28704f3e0ad29e1f4b7974bc0b701ccd6744447ab0611ae1da736b7","sha256:24c6aaff4d18f4044aa219e02a8116eed5924455723fa1fff4ce5efec24b5261"],"state_sha256":"6df227850b756269d53112059bc303ece553940ac033a87877c7379fdddee681"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yEvOUWDD+UOTVoNR2AMUkV7xLdBp8kBVf3VdTrTN1FCfww28/dWcuD/dtWCGCbyxBgRVwuwJJXCt9eVvFUDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:13:49.837710Z","bundle_sha256":"810bd63edc33f1c75b3c44a4ae43b0cbcdae51d1a82b35e94176df13608b6031"}}