{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DEMRO4AR7LZ77SEIX6D6NFZTGS","short_pith_number":"pith:DEMRO4AR","canonical_record":{"source":{"id":"2505.12216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-18T03:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"235bd784f0e4369bace1e304c89f8d6df1bd45596eb640c438feddefab11bcad","abstract_canon_sha256":"a35dbbb8a37b34d46c28be352d7d25c9f546bbc2f0f6299597737cf79627944c"},"schema_version":"1.0"},"canonical_sha256":"1919177011faf3ffc888bf87e6973334951bb5f0c8e1e5e208af8934f5afc9b8","source":{"kind":"arxiv","id":"2505.12216","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12216","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12216v2","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12216","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"DEMRO4AR7LZ7","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_16","alias_value":"DEMRO4AR7LZ77SEI","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_8","alias_value":"DEMRO4AR","created_at":"2026-07-05T11:09:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DEMRO4AR7LZ77SEIX6D6NFZTGS","target":"record","payload":{"canonical_record":{"source":{"id":"2505.12216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-18T03:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"235bd784f0e4369bace1e304c89f8d6df1bd45596eb640c438feddefab11bcad","abstract_canon_sha256":"a35dbbb8a37b34d46c28be352d7d25c9f546bbc2f0f6299597737cf79627944c"},"schema_version":"1.0"},"canonical_sha256":"1919177011faf3ffc888bf87e6973334951bb5f0c8e1e5e208af8934f5afc9b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:13.678265Z","signature_b64":"oTewWo4HZR1W/SuHEVb8e6hIR40p9HNUdJ8QFh+qtf2c9gW934mreVeqaASHxC7kbmHnqaUdfK68aj9+mqXuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1919177011faf3ffc888bf87e6973334951bb5f0c8e1e5e208af8934f5afc9b8","last_reissued_at":"2026-07-05T11:09:13.677748Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:13.677748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.12216","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:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Fb1NdHBtxaSXSSF2RJ11RXnu+72NWHjAI1EI94ucZAi0oxg+2Xm9j4KvoDhMeQVUigA1dzQoFja8MISbF80DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T02:18:13.351833Z"},"content_sha256":"fc698fde9142d05c8c590eaf86c685b8ecfd3ae89978313db9678b21d049434c","schema_version":"1.0","event_id":"sha256:fc698fde9142d05c8c590eaf86c685b8ecfd3ae89978313db9678b21d049434c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DEMRO4AR7LZ77SEIX6D6NFZTGS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ming Tang, Rongguang Ye","submitted_at":"2025-05-18T03:26:07Z","abstract_excerpt":"Existing pruning methods for large language models (LLMs) focus on achieving high compression rates while maintaining model performance. Although these methods have demonstrated satisfactory performance in handling a single user's compression request, their processing time increases linearly with the number of requests, making them inefficient for real-world scenarios with multiple simultaneous requests. To address this limitation, we propose a Univeral Model for Customized Compression (UniCuCo) for LLMs, which introduces a StratNet that learns to map arbitrary requests to their optimal prunin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12216","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/2505.12216/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:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JqAHLN9aaFE8diSnNfdI1fRnJlvjesVPUbTAF9Qjv0U0KiIdbJ38JJr1RMC/vsAAy79F6aS1eLt45hBVzvqjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T02:18:13.352341Z"},"content_sha256":"47ea33d50d9d0a0b2a12ad3c033821e33d221654e5f003722e850873e03f867b","schema_version":"1.0","event_id":"sha256:47ea33d50d9d0a0b2a12ad3c033821e33d221654e5f003722e850873e03f867b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/bundle.json","state_url":"https://pith.science/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/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-18T02:18:13Z","links":{"resolver":"https://pith.science/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS","bundle":"https://pith.science/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/bundle.json","state":"https://pith.science/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEMRO4AR7LZ77SEIX6D6NFZTGS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DEMRO4AR7LZ77SEIX6D6NFZTGS","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":"a35dbbb8a37b34d46c28be352d7d25c9f546bbc2f0f6299597737cf79627944c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-18T03:26:07Z","title_canon_sha256":"235bd784f0e4369bace1e304c89f8d6df1bd45596eb640c438feddefab11bcad"},"schema_version":"1.0","source":{"id":"2505.12216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12216","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12216v2","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12216","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"DEMRO4AR7LZ7","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_16","alias_value":"DEMRO4AR7LZ77SEI","created_at":"2026-07-05T11:09:13Z"},{"alias_kind":"pith_short_8","alias_value":"DEMRO4AR","created_at":"2026-07-05T11:09:13Z"}],"graph_snapshots":[{"event_id":"sha256:47ea33d50d9d0a0b2a12ad3c033821e33d221654e5f003722e850873e03f867b","target":"graph","created_at":"2026-07-05T11:09:13Z","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.12216/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Existing pruning methods for large language models (LLMs) focus on achieving high compression rates while maintaining model performance. Although these methods have demonstrated satisfactory performance in handling a single user's compression request, their processing time increases linearly with the number of requests, making them inefficient for real-world scenarios with multiple simultaneous requests. To address this limitation, we propose a Univeral Model for Customized Compression (UniCuCo) for LLMs, which introduces a StratNet that learns to map arbitrary requests to their optimal prunin","authors_text":"Ming Tang, Rongguang Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-18T03:26:07Z","title":"One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12216","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:fc698fde9142d05c8c590eaf86c685b8ecfd3ae89978313db9678b21d049434c","target":"record","created_at":"2026-07-05T11:09:13Z","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":"a35dbbb8a37b34d46c28be352d7d25c9f546bbc2f0f6299597737cf79627944c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-05-18T03:26:07Z","title_canon_sha256":"235bd784f0e4369bace1e304c89f8d6df1bd45596eb640c438feddefab11bcad"},"schema_version":"1.0","source":{"id":"2505.12216","kind":"arxiv","version":2}},"canonical_sha256":"1919177011faf3ffc888bf87e6973334951bb5f0c8e1e5e208af8934f5afc9b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1919177011faf3ffc888bf87e6973334951bb5f0c8e1e5e208af8934f5afc9b8","first_computed_at":"2026-07-05T11:09:13.677748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:13.677748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oTewWo4HZR1W/SuHEVb8e6hIR40p9HNUdJ8QFh+qtf2c9gW934mreVeqaASHxC7kbmHnqaUdfK68aj9+mqXuAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:13.678265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc698fde9142d05c8c590eaf86c685b8ecfd3ae89978313db9678b21d049434c","sha256:47ea33d50d9d0a0b2a12ad3c033821e33d221654e5f003722e850873e03f867b"],"state_sha256":"412aea937d46b99b618efeaec84185aaa0ce4434ad32f3cb38c3667d8c4e4b95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44gIYMQD55dEzOx9w0tDtWvRXxgeJQVPplzHueol1HgnnC/MQwZ4lRHWT8s/pDbCaCcNbbTJcfp1vDh80q0tCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T02:18:13.358494Z","bundle_sha256":"f3467d530ed8f75f8f5549640a599875dc2960e87a692830a8e8df6f84411f6a"}}