{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FAUMVMJ34MVGNT26QYLPUN6ISZ","short_pith_number":"pith:FAUMVMJ3","schema_version":"1.0","canonical_sha256":"2828cab13be32a66cf5e8616fa37c896453a6886b5faa4be1dce23a20d7c3e36","source":{"kind":"arxiv","id":"2607.18280","version":1},"attestation_state":"computed","paper":{"title":"Beyond Single-Dimensional Compression: The Compound Sparsity Frontier of Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Han, Haozhe Hu, Xiaoyu Shen","submitted_at":"2026-06-29T01:33:30Z","abstract_excerpt":"Large language models (LLMs) are often compressed through static parameter pruning or dynamic token-level computation, yet aggressive sparsification can trigger rapid performance degradation beyond an essential sparsity boundary. This work asks \\emph{whether combining these two mechanisms can delay such degradation by distributing the compression burden}. We study a minimalist compound sparsity framework that first applies low-rank approximation and channel pruning to obtain a statically compressed backbone, and then introduces lightweight routers for per-token dynamic layer skipping. This des"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.18280","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-29T01:33:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6d9e6661ba1183b36644587efe5d0a081c4330326942aa39fad047647cd6ca65","abstract_canon_sha256":"61b99078f2b0d4995ff971bd1536191b132b46294ce997c5df0934d7b8ffb027"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:39.885151Z","signature_b64":"sMr6GEH1pRMWPsUkBRkZi+86UQMJScL0SsRQybXAgdsuhuPq/Lpyph5muoIDr/OX7l8wKRWTMExTHtgLf3WyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2828cab13be32a66cf5e8616fa37c896453a6886b5faa4be1dce23a20d7c3e36","last_reissued_at":"2026-07-22T00:22:39.884391Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:39.884391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Single-Dimensional Compression: The Compound Sparsity Frontier of Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Han, Haozhe Hu, Xiaoyu Shen","submitted_at":"2026-06-29T01:33:30Z","abstract_excerpt":"Large language models (LLMs) are often compressed through static parameter pruning or dynamic token-level computation, yet aggressive sparsification can trigger rapid performance degradation beyond an essential sparsity boundary. This work asks \\emph{whether combining these two mechanisms can delay such degradation by distributing the compression burden}. We study a minimalist compound sparsity framework that first applies low-rank approximation and channel pruning to obtain a statically compressed backbone, and then introduces lightweight routers for per-token dynamic layer skipping. This des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18280","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/2607.18280/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.18280","created_at":"2026-07-22T00:22:39.884806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18280v1","created_at":"2026-07-22T00:22:39.884806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18280","created_at":"2026-07-22T00:22:39.884806+00:00"},{"alias_kind":"pith_short_12","alias_value":"FAUMVMJ34MVG","created_at":"2026-07-22T00:22:39.884806+00:00"},{"alias_kind":"pith_short_16","alias_value":"FAUMVMJ34MVGNT26","created_at":"2026-07-22T00:22:39.884806+00:00"},{"alias_kind":"pith_short_8","alias_value":"FAUMVMJ3","created_at":"2026-07-22T00:22:39.884806+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ","json":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ.json","graph_json":"https://pith.science/api/pith-number/FAUMVMJ34MVGNT26QYLPUN6ISZ/graph.json","events_json":"https://pith.science/api/pith-number/FAUMVMJ34MVGNT26QYLPUN6ISZ/events.json","paper":"https://pith.science/paper/FAUMVMJ3"},"agent_actions":{"view_html":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ","download_json":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ.json","view_paper":"https://pith.science/paper/FAUMVMJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18280&json=true","fetch_graph":"https://pith.science/api/pith-number/FAUMVMJ34MVGNT26QYLPUN6ISZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FAUMVMJ34MVGNT26QYLPUN6ISZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ/action/storage_attestation","attest_author":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ/action/author_attestation","sign_citation":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ/action/citation_signature","submit_replication":"https://pith.science/pith/FAUMVMJ34MVGNT26QYLPUN6ISZ/action/replication_record"}},"created_at":"2026-07-22T00:22:39.884806+00:00","updated_at":"2026-07-22T00:22:39.884806+00:00"}