{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OW5PCP5QHMDKMR67KFG724NAR2","short_pith_number":"pith:OW5PCP5Q","canonical_record":{"source":{"id":"2505.01731","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-03T07:57:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a7bd77def96e1fc49e43b7ce78cd49a281901821b7dae2069ccabd4b23a19f9b","abstract_canon_sha256":"7a1177c80110c5e36c4ebf4b85a435997e5805e9ba725ec9aa73d95f333974f7"},"schema_version":"1.0"},"canonical_sha256":"75baf13fb03b06a647df514dfd71a08e88b9dd3e73697037e8fcd104d6c6687c","source":{"kind":"arxiv","id":"2505.01731","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.01731","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2505.01731v3","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01731","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"OW5PCP5QHMDK","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"OW5PCP5QHMDKMR67","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"OW5PCP5Q","created_at":"2026-07-05T11:06:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OW5PCP5QHMDKMR67KFG724NAR2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.01731","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-03T07:57:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a7bd77def96e1fc49e43b7ce78cd49a281901821b7dae2069ccabd4b23a19f9b","abstract_canon_sha256":"7a1177c80110c5e36c4ebf4b85a435997e5805e9ba725ec9aa73d95f333974f7"},"schema_version":"1.0"},"canonical_sha256":"75baf13fb03b06a647df514dfd71a08e88b9dd3e73697037e8fcd104d6c6687c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:31.381413Z","signature_b64":"Ze50NHNVhacaSDL8oMBE3ZyqA1g3PtpeGht7XjmMkvw1xxCkINm3ZBR+9y493rgyVRHjG9HojaYYDK0ld8XIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75baf13fb03b06a647df514dfd71a08e88b9dd3e73697037e8fcd104d6c6687c","last_reissued_at":"2026-07-05T11:06:31.380895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:31.380895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.01731","source_version":3,"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:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rVlAA900mDqaI4kr9I0rPhTh34UiAmBu4mqMJJPmlg9VvJMo4/YFh9XhBjJMrc5DQ49UCko23QTZcn83sJnuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:10:48.949732Z"},"content_sha256":"200b735bde3bd57d98589e692dbe4ddf11558cd14525dae883f27c4f0e101b7e","schema_version":"1.0","event_id":"sha256:200b735bde3bd57d98589e692dbe4ddf11558cd14525dae883f27c4f0e101b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OW5PCP5QHMDKMR67KFG724NAR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chuan Sun, Han Yu, Lizhen Cui, Xiaoxiao Li","submitted_at":"2025-05-03T07:57:02Z","abstract_excerpt":"Pruning large language models (LLMs) is a promising solution for reducing model sizes and computational complexity while preserving performance. Traditional layer-wise pruning methods often adopt a uniform sparsity approach across all layers, which leads to suboptimal performance due to the varying significance of individual transformer layers within the model not being accounted for. To this end, we propose the Shapley Value-based Non-Uniform Pruning (SV-NUP) method for LLMs. This approach quantifies the contribution of each transformer layer to the overall model performance, enabling the ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01731","kind":"arxiv","version":3},"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.01731/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:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvu2qIq5VxFWLBNRkroREjukGhUpMlVs2WJeO/JdLDJ4ojphYtD2jFRRIAXZ9JGg1lf0qFCcybKZU4eebm4nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:10:48.950229Z"},"content_sha256":"9e395077abcccd01c7d05c8182b7798ecc3e7c4d3724b8537afdb0b1cedc98d0","schema_version":"1.0","event_id":"sha256:9e395077abcccd01c7d05c8182b7798ecc3e7c4d3724b8537afdb0b1cedc98d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW5PCP5QHMDKMR67KFG724NAR2/bundle.json","state_url":"https://pith.science/pith/OW5PCP5QHMDKMR67KFG724NAR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW5PCP5QHMDKMR67KFG724NAR2/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-08T11:10:48Z","links":{"resolver":"https://pith.science/pith/OW5PCP5QHMDKMR67KFG724NAR2","bundle":"https://pith.science/pith/OW5PCP5QHMDKMR67KFG724NAR2/bundle.json","state":"https://pith.science/pith/OW5PCP5QHMDKMR67KFG724NAR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW5PCP5QHMDKMR67KFG724NAR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OW5PCP5QHMDKMR67KFG724NAR2","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":"7a1177c80110c5e36c4ebf4b85a435997e5805e9ba725ec9aa73d95f333974f7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-03T07:57:02Z","title_canon_sha256":"a7bd77def96e1fc49e43b7ce78cd49a281901821b7dae2069ccabd4b23a19f9b"},"schema_version":"1.0","source":{"id":"2505.01731","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.01731","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2505.01731v3","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01731","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"OW5PCP5QHMDK","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"OW5PCP5QHMDKMR67","created_at":"2026-07-05T11:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"OW5PCP5Q","created_at":"2026-07-05T11:06:31Z"}],"graph_snapshots":[{"event_id":"sha256:9e395077abcccd01c7d05c8182b7798ecc3e7c4d3724b8537afdb0b1cedc98d0","target":"graph","created_at":"2026-07-05T11:06:31Z","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.01731/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Pruning large language models (LLMs) is a promising solution for reducing model sizes and computational complexity while preserving performance. Traditional layer-wise pruning methods often adopt a uniform sparsity approach across all layers, which leads to suboptimal performance due to the varying significance of individual transformer layers within the model not being accounted for. To this end, we propose the Shapley Value-based Non-Uniform Pruning (SV-NUP) method for LLMs. This approach quantifies the contribution of each transformer layer to the overall model performance, enabling the ass","authors_text":"Chuan Sun, Han Yu, Lizhen Cui, Xiaoxiao Li","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-03T07:57:02Z","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01731","kind":"arxiv","version":3},"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:200b735bde3bd57d98589e692dbe4ddf11558cd14525dae883f27c4f0e101b7e","target":"record","created_at":"2026-07-05T11:06:31Z","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":"7a1177c80110c5e36c4ebf4b85a435997e5805e9ba725ec9aa73d95f333974f7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-03T07:57:02Z","title_canon_sha256":"a7bd77def96e1fc49e43b7ce78cd49a281901821b7dae2069ccabd4b23a19f9b"},"schema_version":"1.0","source":{"id":"2505.01731","kind":"arxiv","version":3}},"canonical_sha256":"75baf13fb03b06a647df514dfd71a08e88b9dd3e73697037e8fcd104d6c6687c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75baf13fb03b06a647df514dfd71a08e88b9dd3e73697037e8fcd104d6c6687c","first_computed_at":"2026-07-05T11:06:31.380895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:31.380895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ze50NHNVhacaSDL8oMBE3ZyqA1g3PtpeGht7XjmMkvw1xxCkINm3ZBR+9y493rgyVRHjG9HojaYYDK0ld8XIAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:31.381413Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.01731","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:200b735bde3bd57d98589e692dbe4ddf11558cd14525dae883f27c4f0e101b7e","sha256:9e395077abcccd01c7d05c8182b7798ecc3e7c4d3724b8537afdb0b1cedc98d0"],"state_sha256":"eff1405a96bf48ae7b3b4c94621fab1e1020e3d19ac8418a7890aeb78f89fbf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9M6cr20dG8X50/9oFZ+mW2Nnu9PnW+E0zqftjbmnyGCfTfBhUzC6ORTYe34kOpnSCixmfruUC657XU8F8qrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:10:48.954028Z","bundle_sha256":"58235623b6e57c626fc9e2d978bef57cbb926361c7bced6ccc003ea2fdb35d16"}}