{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3ZUAHAJD5AYQXXBKIBW5VBM4WF","short_pith_number":"pith:3ZUAHAJD","schema_version":"1.0","canonical_sha256":"de68038123e8310bdc2a406dda859cb1600b6cdfb40a6b4eddefcdadb7998933","source":{"kind":"arxiv","id":"2402.16319","version":2},"attestation_state":"computed","paper":{"title":"Data-free Weight Compress and Denoise for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dahua Lin, Hang Yan, Qipeng Guo, Runyu Peng, Xipeng Qiu, Yang Gao, Yunhua Zhou","submitted_at":"2024-02-26T05:51:47Z","abstract_excerpt":"Large Language Models (LLMs) are reshaping the research landscape in artificial intelligence, particularly as model parameters scale up significantly, unlocking remarkable capabilities across various domains. Nevertheless, the scalability of model parameters faces constraints due to limitations in GPU memory and computational speed. To address these constraints, various weight compression methods have emerged, such as Pruning and Quantization. Given the low-rank nature of weight matrices in language models, the reduction of weights through matrix decomposition undoubtedly holds significant pot"},"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":"2402.16319","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-02-26T05:51:47Z","cross_cats_sorted":[],"title_canon_sha256":"466326404071da6202453a3c3db5e23f352b245ac8ac93482c8b583e9814d842","abstract_canon_sha256":"9655c9270cf9e6d11cb7bedb649e79987f785c3481e6fc3739a37c7b616e6b3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:35.125294Z","signature_b64":"wfkVoC2xUP/jn/uZkP10ZolI45tyXvRdKCE9VPZGa67DkPuN/ddyN6igMq6AExHWl1HMJCeD9FNWf3zUOAQMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de68038123e8310bdc2a406dda859cb1600b6cdfb40a6b4eddefcdadb7998933","last_reissued_at":"2026-07-05T10:18:35.124799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:35.124799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-free Weight Compress and Denoise for Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dahua Lin, Hang Yan, Qipeng Guo, Runyu Peng, Xipeng Qiu, Yang Gao, Yunhua Zhou","submitted_at":"2024-02-26T05:51:47Z","abstract_excerpt":"Large Language Models (LLMs) are reshaping the research landscape in artificial intelligence, particularly as model parameters scale up significantly, unlocking remarkable capabilities across various domains. Nevertheless, the scalability of model parameters faces constraints due to limitations in GPU memory and computational speed. To address these constraints, various weight compression methods have emerged, such as Pruning and Quantization. Given the low-rank nature of weight matrices in language models, the reduction of weights through matrix decomposition undoubtedly holds significant pot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16319","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/2402.16319/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":"2402.16319","created_at":"2026-07-05T10:18:35.124858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.16319v2","created_at":"2026-07-05T10:18:35.124858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16319","created_at":"2026-07-05T10:18:35.124858+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZUAHAJD5AYQ","created_at":"2026-07-05T10:18:35.124858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZUAHAJD5AYQXXBK","created_at":"2026-07-05T10:18:35.124858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZUAHAJD","created_at":"2026-07-05T10:18:35.124858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.27383","citing_title":"Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compression","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF","json":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF.json","graph_json":"https://pith.science/api/pith-number/3ZUAHAJD5AYQXXBKIBW5VBM4WF/graph.json","events_json":"https://pith.science/api/pith-number/3ZUAHAJD5AYQXXBKIBW5VBM4WF/events.json","paper":"https://pith.science/paper/3ZUAHAJD"},"agent_actions":{"view_html":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF","download_json":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF.json","view_paper":"https://pith.science/paper/3ZUAHAJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.16319&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZUAHAJD5AYQXXBKIBW5VBM4WF/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZUAHAJD5AYQXXBKIBW5VBM4WF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF/action/storage_attestation","attest_author":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF/action/author_attestation","sign_citation":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF/action/citation_signature","submit_replication":"https://pith.science/pith/3ZUAHAJD5AYQXXBKIBW5VBM4WF/action/replication_record"}},"created_at":"2026-07-05T10:18:35.124858+00:00","updated_at":"2026-07-05T10:18:35.124858+00:00"}