{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SHNINZUC4NVAC4EIQCRRWUH4UM","short_pith_number":"pith:SHNINZUC","canonical_record":{"source":{"id":"2505.03373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-06T09:47:53Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"18ce66cbaedda8514906baa3422c7f5fee52fe17e46b7bc9e3f1fb07e1d1dfb3","abstract_canon_sha256":"574b8c5be2304e41bc42ff3a94e697700877369a0a1824e2d805376903f49e81"},"schema_version":"1.0"},"canonical_sha256":"91da86e682e36a01708880a31b50fca30e644d8fc1043b2cfe61dbbbb12943c0","source":{"kind":"arxiv","id":"2505.03373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03373","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03373v1","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03373","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"SHNINZUC4NVA","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_16","alias_value":"SHNINZUC4NVAC4EI","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_8","alias_value":"SHNINZUC","created_at":"2026-07-05T10:59:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SHNINZUC4NVAC4EIQCRRWUH4UM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.03373","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-06T09:47:53Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"18ce66cbaedda8514906baa3422c7f5fee52fe17e46b7bc9e3f1fb07e1d1dfb3","abstract_canon_sha256":"574b8c5be2304e41bc42ff3a94e697700877369a0a1824e2d805376903f49e81"},"schema_version":"1.0"},"canonical_sha256":"91da86e682e36a01708880a31b50fca30e644d8fc1043b2cfe61dbbbb12943c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:14.799301Z","signature_b64":"rfhOPqYC1om2gfKkWf2yWWHp/yBnXgpPIj0WynVTapc64n/Aad3TGt2xIqdCRK72zIBbOQ9PC60qUsy135xHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91da86e682e36a01708880a31b50fca30e644d8fc1043b2cfe61dbbbb12943c0","last_reissued_at":"2026-07-05T10:59:14.798945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:14.798945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.03373","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-05T10:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLGRetN1o4ecjM35l8d2COeJmK+2+5O/wo3R9uLmFqPd/4fbxDI/Q5sVwQ7xvMr2MOVWc9qtnAdlFGWCqELzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:35:56.609039Z"},"content_sha256":"a3d417f7561ca9b6a087257d68d9477dabecc8f3fa23d73fc77c4ef0606f5c0e","schema_version":"1.0","event_id":"sha256:a3d417f7561ca9b6a087257d68d9477dabecc8f3fa23d73fc77c4ef0606f5c0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SHNINZUC4NVAC4EIQCRRWUH4UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SPAP: Structured Pruning via Alternating Optimization and Penalty Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Hanyu Hu, Xiaoming Yuan","submitted_at":"2025-05-06T09:47:53Z","abstract_excerpt":"The deployment of large language models (LLMs) is often constrained by their substantial computational and memory demands. While structured pruning presents a viable approach by eliminating entire network components, existing methods suffer from performance degradation, reliance on heuristic metrics, or expensive finetuning. To address these challenges, we propose SPAP (Structured Pruning via Alternating Optimization and Penalty Methods), a novel and efficient structured pruning framework for LLMs grounded in optimization theory. SPAP formulates the pruning problem through a mixed-integer opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03373","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/2505.03373/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-05T10:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pfa+F2mMwKRY0LymnP/TXHGrC/40YHFDWx7ccXmfFtGPFzv7HWtb3Y9elrbPhEVmkmZ4pHPFdxFmOqd2AJEZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:35:56.609612Z"},"content_sha256":"3b3f4215cee8e9c6dfdb19b96a0166bbba2de326db0ddd45618693a319cce344","schema_version":"1.0","event_id":"sha256:3b3f4215cee8e9c6dfdb19b96a0166bbba2de326db0ddd45618693a319cce344"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/bundle.json","state_url":"https://pith.science/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/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-18T18:35:56Z","links":{"resolver":"https://pith.science/pith/SHNINZUC4NVAC4EIQCRRWUH4UM","bundle":"https://pith.science/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/bundle.json","state":"https://pith.science/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHNINZUC4NVAC4EIQCRRWUH4UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SHNINZUC4NVAC4EIQCRRWUH4UM","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":"574b8c5be2304e41bc42ff3a94e697700877369a0a1824e2d805376903f49e81","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-06T09:47:53Z","title_canon_sha256":"18ce66cbaedda8514906baa3422c7f5fee52fe17e46b7bc9e3f1fb07e1d1dfb3"},"schema_version":"1.0","source":{"id":"2505.03373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03373","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03373v1","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03373","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"SHNINZUC4NVA","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_16","alias_value":"SHNINZUC4NVAC4EI","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_8","alias_value":"SHNINZUC","created_at":"2026-07-05T10:59:14Z"}],"graph_snapshots":[{"event_id":"sha256:3b3f4215cee8e9c6dfdb19b96a0166bbba2de326db0ddd45618693a319cce344","target":"graph","created_at":"2026-07-05T10:59:14Z","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/2505.03373/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The deployment of large language models (LLMs) is often constrained by their substantial computational and memory demands. While structured pruning presents a viable approach by eliminating entire network components, existing methods suffer from performance degradation, reliance on heuristic metrics, or expensive finetuning. To address these challenges, we propose SPAP (Structured Pruning via Alternating Optimization and Penalty Methods), a novel and efficient structured pruning framework for LLMs grounded in optimization theory. SPAP formulates the pruning problem through a mixed-integer opti","authors_text":"Hanyu Hu, Xiaoming Yuan","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-06T09:47:53Z","title":"SPAP: Structured Pruning via Alternating Optimization and Penalty Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03373","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:a3d417f7561ca9b6a087257d68d9477dabecc8f3fa23d73fc77c4ef0606f5c0e","target":"record","created_at":"2026-07-05T10:59:14Z","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":"574b8c5be2304e41bc42ff3a94e697700877369a0a1824e2d805376903f49e81","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-06T09:47:53Z","title_canon_sha256":"18ce66cbaedda8514906baa3422c7f5fee52fe17e46b7bc9e3f1fb07e1d1dfb3"},"schema_version":"1.0","source":{"id":"2505.03373","kind":"arxiv","version":1}},"canonical_sha256":"91da86e682e36a01708880a31b50fca30e644d8fc1043b2cfe61dbbbb12943c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91da86e682e36a01708880a31b50fca30e644d8fc1043b2cfe61dbbbb12943c0","first_computed_at":"2026-07-05T10:59:14.798945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:14.798945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rfhOPqYC1om2gfKkWf2yWWHp/yBnXgpPIj0WynVTapc64n/Aad3TGt2xIqdCRK72zIBbOQ9PC60qUsy135xHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:14.799301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d417f7561ca9b6a087257d68d9477dabecc8f3fa23d73fc77c4ef0606f5c0e","sha256:3b3f4215cee8e9c6dfdb19b96a0166bbba2de326db0ddd45618693a319cce344"],"state_sha256":"d7fbabcab47e89591bd30a7a221dbb75f798b9926144f1189dbfa66bea623921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dCjl4VmAazddupB2eOOsvSDsAN12AL94ZDu2aKqrQDrQum5dDSkGY3AJg7EsKXTRrLtn/3kxtGSxxusriwjvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:35:56.613628Z","bundle_sha256":"60545f826723ea6b15bedaf82bb77bed93180c5587841882ca7cce54c770d4ef"}}