{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M6YQ4VE664PA7WM7AC5ULBWP5W","short_pith_number":"pith:M6YQ4VE6","canonical_record":{"source":{"id":"2506.06866","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-07T17:12:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"665ed427242788487f38d3aef8158d7e96472b344c1591ff897d92762a15d514","abstract_canon_sha256":"894a16f23955fb57865279a080ade1129ae19d5522749742faa4ea615b1f47ff"},"schema_version":"1.0"},"canonical_sha256":"67b10e549ef71e0fd99f00bb4586cfed8deb45105a301833cf961de22bcda01d","source":{"kind":"arxiv","id":"2506.06866","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06866","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06866v2","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06866","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_12","alias_value":"M6YQ4VE664PA","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_16","alias_value":"M6YQ4VE664PA7WM7","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_8","alias_value":"M6YQ4VE6","created_at":"2026-07-05T11:21:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M6YQ4VE664PA7WM7AC5ULBWP5W","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06866","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-07T17:12:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"665ed427242788487f38d3aef8158d7e96472b344c1591ff897d92762a15d514","abstract_canon_sha256":"894a16f23955fb57865279a080ade1129ae19d5522749742faa4ea615b1f47ff"},"schema_version":"1.0"},"canonical_sha256":"67b10e549ef71e0fd99f00bb4586cfed8deb45105a301833cf961de22bcda01d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:48.401114Z","signature_b64":"iamVz/gNIsqdgGH+OgaEbBAIih1KDwrlAYmgyie34U4rnMFcrJ+WxP7JzEAXORSWF3b2Ic4EK+X8bJSrFcRJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b10e549ef71e0fd99f00bb4586cfed8deb45105a301833cf961de22bcda01d","last_reissued_at":"2026-07-05T11:21:48.400587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:48.400587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06866","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-07-05T11:21:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPZxjdsGSBrxpSOaGgQzVx+Eosfm3U6/CNE3QIAlsmXJfY/zRMw0QIMV3mDVhHNa/H8MGi3AeCuIJ4wHkiyWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:31:38.568698Z"},"content_sha256":"8a10dc833fe6a9a8a8c2a2575cb3b16d7ae9240049748b6ba395f44387f42bc4","schema_version":"1.0","event_id":"sha256:8a10dc833fe6a9a8a8c2a2575cb3b16d7ae9240049748b6ba395f44387f42bc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M6YQ4VE664PA7WM7AC5ULBWP5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dongyeop Lee, Jinseok Chung, Kwanhee Lee, Namhoon Lee","submitted_at":"2025-06-07T17:12:03Z","abstract_excerpt":"Sparsifying neural networks often suffers from seemingly inevitable performance degradation, and it remains challenging to restore the original performance despite much recent progress. Motivated by recent studies in robust optimization, we aim to tackle this problem by finding subnetworks that are both sparse and flat at the same time. Specifically, we formulate pruning as a sparsity-constrained optimization problem where flatness is encouraged as an objective. We solve it explicitly via an augmented Lagrange dual approach and extend it further by proposing a generalized projection operation,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06866","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/2506.06866/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-05T11:21:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"485U0QjtKcWYOblAydnrh9i1My3LIL3kZNEXmXQSH8/D5IMPeLHH41+nxs0EZtDrwo6FZ4Y5Cm62uw7hRhVaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:31:38.569204Z"},"content_sha256":"c0dc7ac5d2453decdc7c1c0abcc6a07395fb54ec09e9d1df2389c934077057c8","schema_version":"1.0","event_id":"sha256:c0dc7ac5d2453decdc7c1c0abcc6a07395fb54ec09e9d1df2389c934077057c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/bundle.json","state_url":"https://pith.science/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/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-06T18:31:38Z","links":{"resolver":"https://pith.science/pith/M6YQ4VE664PA7WM7AC5ULBWP5W","bundle":"https://pith.science/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/bundle.json","state":"https://pith.science/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6YQ4VE664PA7WM7AC5ULBWP5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M6YQ4VE664PA7WM7AC5ULBWP5W","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":"894a16f23955fb57865279a080ade1129ae19d5522749742faa4ea615b1f47ff","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-07T17:12:03Z","title_canon_sha256":"665ed427242788487f38d3aef8158d7e96472b344c1591ff897d92762a15d514"},"schema_version":"1.0","source":{"id":"2506.06866","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06866","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06866v2","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06866","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_12","alias_value":"M6YQ4VE664PA","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_16","alias_value":"M6YQ4VE664PA7WM7","created_at":"2026-07-05T11:21:48Z"},{"alias_kind":"pith_short_8","alias_value":"M6YQ4VE6","created_at":"2026-07-05T11:21:48Z"}],"graph_snapshots":[{"event_id":"sha256:c0dc7ac5d2453decdc7c1c0abcc6a07395fb54ec09e9d1df2389c934077057c8","target":"graph","created_at":"2026-07-05T11:21:48Z","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/2506.06866/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparsifying neural networks often suffers from seemingly inevitable performance degradation, and it remains challenging to restore the original performance despite much recent progress. Motivated by recent studies in robust optimization, we aim to tackle this problem by finding subnetworks that are both sparse and flat at the same time. Specifically, we formulate pruning as a sparsity-constrained optimization problem where flatness is encouraged as an objective. We solve it explicitly via an augmented Lagrange dual approach and extend it further by proposing a generalized projection operation,","authors_text":"Dongyeop Lee, Jinseok Chung, Kwanhee Lee, Namhoon Lee","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-07T17:12:03Z","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06866","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:8a10dc833fe6a9a8a8c2a2575cb3b16d7ae9240049748b6ba395f44387f42bc4","target":"record","created_at":"2026-07-05T11:21:48Z","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":"894a16f23955fb57865279a080ade1129ae19d5522749742faa4ea615b1f47ff","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-07T17:12:03Z","title_canon_sha256":"665ed427242788487f38d3aef8158d7e96472b344c1591ff897d92762a15d514"},"schema_version":"1.0","source":{"id":"2506.06866","kind":"arxiv","version":2}},"canonical_sha256":"67b10e549ef71e0fd99f00bb4586cfed8deb45105a301833cf961de22bcda01d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67b10e549ef71e0fd99f00bb4586cfed8deb45105a301833cf961de22bcda01d","first_computed_at":"2026-07-05T11:21:48.400587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:48.400587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iamVz/gNIsqdgGH+OgaEbBAIih1KDwrlAYmgyie34U4rnMFcrJ+WxP7JzEAXORSWF3b2Ic4EK+X8bJSrFcRJBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:48.401114Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06866","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a10dc833fe6a9a8a8c2a2575cb3b16d7ae9240049748b6ba395f44387f42bc4","sha256:c0dc7ac5d2453decdc7c1c0abcc6a07395fb54ec09e9d1df2389c934077057c8"],"state_sha256":"e1fe84d9fbf4c9c1f78bbf1b5f849552d8e01df466eff9fd5b5aad1640fbea55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yK//ZQYKEf1aMcj4vPCpRW3OH2l/F3rC/PRkc1UEkNy1dOD1w4Nb4L+5+ab2EseQ87JfEaELxld5QBLwOT3ICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:31:38.572738Z","bundle_sha256":"7eae239501e46c782a9bcab01d74af61a3acb27f21ff8635aa9d64440ebf70b9"}}