{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MYR7UHH3LKVQASZXQEZJFELZL2","short_pith_number":"pith:MYR7UHH3","schema_version":"1.0","canonical_sha256":"6623fa1cfb5aab004b3781329291795ebc8358d198d03cb743d22b5d31fc6ac4","source":{"kind":"arxiv","id":"2506.20353","version":1},"attestation_state":"computed","paper":{"title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chuanlong Xie, Kaihao Huang, Rui Sun, Suzhong Fu, Xiu Yan, Xuan Ding, Yao Zhu, Yueqi Zhou, Yunjian Zhang","submitted_at":"2025-06-25T12:04:53Z","abstract_excerpt":"The ever-increasing computational demands and deployment costs of large language models (LLMs) have spurred numerous compressing methods. Compared to quantization and unstructured pruning, SVD compression offers superior hardware compatibility and theoretical guarantees. However, existing SVD-based methods focus on the overall discrepancy between the original and compressed matrices while overlooking the protection of critical components within the matrix, which leads to inferior performance in the compressed models. This paper proposes a dual-level importance protection mechanism to enhance S"},"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":"2506.20353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-25T12:04:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4e717d9154f5a2be2565b3cb67a6290dc254c0803c73d95bd48553ae8480edad","abstract_canon_sha256":"04252c4b9306cd15d9d8cc124fd2adc18bb58725c9c9029e4bb0e2e8d28e6d00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:04.146910Z","signature_b64":"CRT1Zq59bv1XiR1pnLZQQa32xZWSmTgp0c9Rw/AZ6iKuthUtB2fi18LcR2TSRoylxi2iCJaIWxPM/A+y2plIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6623fa1cfb5aab004b3781329291795ebc8358d198d03cb743d22b5d31fc6ac4","last_reissued_at":"2026-07-05T11:27:04.146382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:04.146382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DipSVD: Dual-importance Protected SVD for Efficient LLM Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chuanlong Xie, Kaihao Huang, Rui Sun, Suzhong Fu, Xiu Yan, Xuan Ding, Yao Zhu, Yueqi Zhou, Yunjian Zhang","submitted_at":"2025-06-25T12:04:53Z","abstract_excerpt":"The ever-increasing computational demands and deployment costs of large language models (LLMs) have spurred numerous compressing methods. Compared to quantization and unstructured pruning, SVD compression offers superior hardware compatibility and theoretical guarantees. However, existing SVD-based methods focus on the overall discrepancy between the original and compressed matrices while overlooking the protection of critical components within the matrix, which leads to inferior performance in the compressed models. This paper proposes a dual-level importance protection mechanism to enhance S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20353","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/2506.20353/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":"2506.20353","created_at":"2026-07-05T11:27:04.146458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20353v1","created_at":"2026-07-05T11:27:04.146458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20353","created_at":"2026-07-05T11:27:04.146458+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYR7UHH3LKVQ","created_at":"2026-07-05T11:27:04.146458+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYR7UHH3LKVQASZX","created_at":"2026-07-05T11:27:04.146458+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYR7UHH3","created_at":"2026-07-05T11:27:04.146458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17985","citing_title":"SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2510.25977","citing_title":"NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainium","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08568","citing_title":"Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2","json":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2.json","graph_json":"https://pith.science/api/pith-number/MYR7UHH3LKVQASZXQEZJFELZL2/graph.json","events_json":"https://pith.science/api/pith-number/MYR7UHH3LKVQASZXQEZJFELZL2/events.json","paper":"https://pith.science/paper/MYR7UHH3"},"agent_actions":{"view_html":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2","download_json":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2.json","view_paper":"https://pith.science/paper/MYR7UHH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20353&json=true","fetch_graph":"https://pith.science/api/pith-number/MYR7UHH3LKVQASZXQEZJFELZL2/graph.json","fetch_events":"https://pith.science/api/pith-number/MYR7UHH3LKVQASZXQEZJFELZL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2/action/storage_attestation","attest_author":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2/action/author_attestation","sign_citation":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2/action/citation_signature","submit_replication":"https://pith.science/pith/MYR7UHH3LKVQASZXQEZJFELZL2/action/replication_record"}},"created_at":"2026-07-05T11:27:04.146458+00:00","updated_at":"2026-07-05T11:27:04.146458+00:00"}