{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K6QOT33I6NO6I52G2PYGEYJJ7L","short_pith_number":"pith:K6QOT33I","schema_version":"1.0","canonical_sha256":"57a0e9ef68f35de47746d3f0626129fac55ef68148ba21f8359f949ca22bbc38","source":{"kind":"arxiv","id":"2406.04984","version":1},"attestation_state":"computed","paper":{"title":"MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jitai Hao, Pengjie Ren, Qi Meng, Weiwei Sun, Xin Xin, Zhaochun Ren, Zhumin Chen","submitted_at":"2024-06-07T14:49:22Z","abstract_excerpt":"Parameter-Efficient Fine-tuning (PEFT) facilitates the fine-tuning of Large Language Models (LLMs) under limited resources. However, the fine-tuning performance with PEFT on complex, knowledge-intensive tasks is limited due to the constrained model capacity, which originates from the limited number of additional trainable parameters. To overcome this limitation, we introduce a novel mechanism that fine-tunes LLMs with adapters of larger size yet memory-efficient. This is achieved by leveraging the inherent activation sparsity in the Feed-Forward Networks (FFNs) of LLMs and utilizing the larger"},"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":"2406.04984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-07T14:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"d9148b053d92af6434efce715b870a1719dd101889d352a2a2437742dddc59cb","abstract_canon_sha256":"16ef474440232f21a666597be2331d61d7706f62842b30e158d18671b8bd181a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:51.919137Z","signature_b64":"fd4G8jwV3xG3Lqitu+OqfdC2RxOYVWYh9d49KvJgjL3pd9Wsm5bM4AeRwli70QRb5CyBUKfBW0AS5wgwStUvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a0e9ef68f35de47746d3f0626129fac55ef68148ba21f8359f949ca22bbc38","last_reissued_at":"2026-07-05T08:28:51.918636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:51.918636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jitai Hao, Pengjie Ren, Qi Meng, Weiwei Sun, Xin Xin, Zhaochun Ren, Zhumin Chen","submitted_at":"2024-06-07T14:49:22Z","abstract_excerpt":"Parameter-Efficient Fine-tuning (PEFT) facilitates the fine-tuning of Large Language Models (LLMs) under limited resources. However, the fine-tuning performance with PEFT on complex, knowledge-intensive tasks is limited due to the constrained model capacity, which originates from the limited number of additional trainable parameters. To overcome this limitation, we introduce a novel mechanism that fine-tunes LLMs with adapters of larger size yet memory-efficient. This is achieved by leveraging the inherent activation sparsity in the Feed-Forward Networks (FFNs) of LLMs and utilizing the larger"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04984","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/2406.04984/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":"2406.04984","created_at":"2026-07-05T08:28:51.918711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.04984v1","created_at":"2026-07-05T08:28:51.918711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04984","created_at":"2026-07-05T08:28:51.918711+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6QOT33I6NO6","created_at":"2026-07-05T08:28:51.918711+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6QOT33I6NO6I52G","created_at":"2026-07-05T08:28:51.918711+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6QOT33I","created_at":"2026-07-05T08:28:51.918711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21645","citing_title":"Behavioral and Representational Evidence of Binomial Ordering Preferences in Large Language Models","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L","json":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L.json","graph_json":"https://pith.science/api/pith-number/K6QOT33I6NO6I52G2PYGEYJJ7L/graph.json","events_json":"https://pith.science/api/pith-number/K6QOT33I6NO6I52G2PYGEYJJ7L/events.json","paper":"https://pith.science/paper/K6QOT33I"},"agent_actions":{"view_html":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L","download_json":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L.json","view_paper":"https://pith.science/paper/K6QOT33I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.04984&json=true","fetch_graph":"https://pith.science/api/pith-number/K6QOT33I6NO6I52G2PYGEYJJ7L/graph.json","fetch_events":"https://pith.science/api/pith-number/K6QOT33I6NO6I52G2PYGEYJJ7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L/action/storage_attestation","attest_author":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L/action/author_attestation","sign_citation":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L/action/citation_signature","submit_replication":"https://pith.science/pith/K6QOT33I6NO6I52G2PYGEYJJ7L/action/replication_record"}},"created_at":"2026-07-05T08:28:51.918711+00:00","updated_at":"2026-07-05T08:28:51.918711+00:00"}