{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6JRX6JRFUFUOD2R6OYBDKFKQP2","short_pith_number":"pith:6JRX6JRF","schema_version":"1.0","canonical_sha256":"f2637f2625a168e1ea3e76023515507ebcb41803ed6374c5f82484b993075fd1","source":{"kind":"arxiv","id":"2305.18425","version":1},"attestation_state":"computed","paper":{"title":"Efficient Storage of Fine-Tuned Models via Low-Rank Approximation of Weight Residuals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jaejun Yoo, Seunghyun Seo, Simo Ryu","submitted_at":"2023-05-28T21:10:22Z","abstract_excerpt":"In this paper, we present an efficient method for storing fine-tuned models by leveraging the low-rank properties of weight residuals. Our key observation is that weight residuals in large overparameterized models exhibit even stronger low-rank characteristics. Based on this insight, we propose Efficient Residual Encoding (ERE), a novel approach that achieves efficient storage of fine-tuned model weights by approximating the low-rank weight residuals. Furthermore, we analyze the robustness of weight residuals and push the limit of storage efficiency by utilizing additional quantization and lay"},"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":"2305.18425","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T21:10:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5109224f263005b796d74092574e19970355c12d3f7459689d92ab03c6f1b745","abstract_canon_sha256":"a96441831d494ceecf101626faa40c17c6c2377a70873f116375245657a3b7a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:15:00.773839Z","signature_b64":"xn9xS+xc4oo6zNdLpRXYymtBJt3SlUTYhXFIz5ZTb+cmiMYXxwipinFUXxprmlHxDPYI7FPN8a1+pbs8vSFmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2637f2625a168e1ea3e76023515507ebcb41803ed6374c5f82484b993075fd1","last_reissued_at":"2026-07-05T06:15:00.773459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:15:00.773459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Storage of Fine-Tuned Models via Low-Rank Approximation of Weight Residuals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jaejun Yoo, Seunghyun Seo, Simo Ryu","submitted_at":"2023-05-28T21:10:22Z","abstract_excerpt":"In this paper, we present an efficient method for storing fine-tuned models by leveraging the low-rank properties of weight residuals. Our key observation is that weight residuals in large overparameterized models exhibit even stronger low-rank characteristics. Based on this insight, we propose Efficient Residual Encoding (ERE), a novel approach that achieves efficient storage of fine-tuned model weights by approximating the low-rank weight residuals. Furthermore, we analyze the robustness of weight residuals and push the limit of storage efficiency by utilizing additional quantization and lay"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18425","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/2305.18425/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":"2305.18425","created_at":"2026-07-05T06:15:00.773510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18425v1","created_at":"2026-07-05T06:15:00.773510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18425","created_at":"2026-07-05T06:15:00.773510+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JRX6JRFUFUO","created_at":"2026-07-05T06:15:00.773510+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JRX6JRFUFUOD2R6","created_at":"2026-07-05T06:15:00.773510+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JRX6JRF","created_at":"2026-07-05T06:15:00.773510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22205","citing_title":"Skill Weaving: Efficient LLM Improvement via Modular Skillpacks","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2","json":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2.json","graph_json":"https://pith.science/api/pith-number/6JRX6JRFUFUOD2R6OYBDKFKQP2/graph.json","events_json":"https://pith.science/api/pith-number/6JRX6JRFUFUOD2R6OYBDKFKQP2/events.json","paper":"https://pith.science/paper/6JRX6JRF"},"agent_actions":{"view_html":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2","download_json":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2.json","view_paper":"https://pith.science/paper/6JRX6JRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18425&json=true","fetch_graph":"https://pith.science/api/pith-number/6JRX6JRFUFUOD2R6OYBDKFKQP2/graph.json","fetch_events":"https://pith.science/api/pith-number/6JRX6JRFUFUOD2R6OYBDKFKQP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2/action/storage_attestation","attest_author":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2/action/author_attestation","sign_citation":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2/action/citation_signature","submit_replication":"https://pith.science/pith/6JRX6JRFUFUOD2R6OYBDKFKQP2/action/replication_record"}},"created_at":"2026-07-05T06:15:00.773510+00:00","updated_at":"2026-07-05T06:15:00.773510+00:00"}