{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GSMJ5ENP3TRYA6AOZNK4LK33VE","short_pith_number":"pith:GSMJ5ENP","schema_version":"1.0","canonical_sha256":"34989e91afdce380780ecb55c5ab7ba93e5c863c76b1c96d29f6a5688bbfb2a9","source":{"kind":"arxiv","id":"2509.09119","version":1},"attestation_state":"computed","paper":{"title":"Sensitivity-LoRA: Low-Load Sensitivity-Based Fine-Tuning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Huang, Hao Xu, Hao Zhang, Hui Yi Leong, Tianyang Wang, Xinwei Long, Xi Xiao, Zhenjia Li, Zumeng Zhang","submitted_at":"2025-09-11T03:07:05Z","abstract_excerpt":"Large Language Models (LLMs) have transformed both everyday life and scientific research. However, adapting LLMs from general-purpose models to specialized tasks remains challenging, particularly in resource-constrained environments. Low-Rank Adaptation (LoRA), a prominent method within Parameter-Efficient Fine-Tuning (PEFT), has emerged as a promising approach to LLMs by approximating model weight updates using low-rank decomposition. However, LoRA is limited by its uniform rank ( r ) allocation to each incremental matrix, and existing rank allocation techniques aimed at addressing this issue"},"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":"2509.09119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-11T03:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"2a2c0c05929787718bd27390c356ac56e8271d3cad18bcd3affb2c8911b1ee8c","abstract_canon_sha256":"776d9e5dda4b3688c0c464ff862ae37dca646aaa2e1ab8867e4b30fa3d3801cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:29.844665Z","signature_b64":"HE5Afs3mBG0JPNFBrAcb3cM00x6uv5HxY0B65UAktNOKBwfOgjR7v0lkDtI3hyKYWgun/RDOaFccJk/cVyncBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34989e91afdce380780ecb55c5ab7ba93e5c863c76b1c96d29f6a5688bbfb2a9","last_reissued_at":"2026-07-05T12:09:29.844117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:29.844117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sensitivity-LoRA: Low-Load Sensitivity-Based Fine-Tuning for Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Huang, Hao Xu, Hao Zhang, Hui Yi Leong, Tianyang Wang, Xinwei Long, Xi Xiao, Zhenjia Li, Zumeng Zhang","submitted_at":"2025-09-11T03:07:05Z","abstract_excerpt":"Large Language Models (LLMs) have transformed both everyday life and scientific research. However, adapting LLMs from general-purpose models to specialized tasks remains challenging, particularly in resource-constrained environments. Low-Rank Adaptation (LoRA), a prominent method within Parameter-Efficient Fine-Tuning (PEFT), has emerged as a promising approach to LLMs by approximating model weight updates using low-rank decomposition. However, LoRA is limited by its uniform rank ( r ) allocation to each incremental matrix, and existing rank allocation techniques aimed at addressing this issue"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09119","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/2509.09119/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":"2509.09119","created_at":"2026-07-05T12:09:29.844178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09119v1","created_at":"2026-07-05T12:09:29.844178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09119","created_at":"2026-07-05T12:09:29.844178+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSMJ5ENP3TRY","created_at":"2026-07-05T12:09:29.844178+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSMJ5ENP3TRYA6AO","created_at":"2026-07-05T12:09:29.844178+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSMJ5ENP","created_at":"2026-07-05T12:09:29.844178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26379","citing_title":"Layer-Specific Prompt Fusion Discovery via Differentiable Search in Vision Foundation Models","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28938","citing_title":"EVLA: An Electro-Aware Multimodal Assistant for Physically-Grounded Driving Reasoning and Control","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28943","citing_title":"A3M: Adaptive, Adversarial and Multi-Objective Learning for Strategic Bidding in Repeated Auctions","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28933","citing_title":"FinInvest-GTCN: Explainable Graph-Temporal-Causal Modeling for Risk-Aware Investment Decision Optimization","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28900","citing_title":"MedEvoEval: Evaluating Continual Evolution of Doctor Agents through Simulated Clinical Episodes","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE","json":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE.json","graph_json":"https://pith.science/api/pith-number/GSMJ5ENP3TRYA6AOZNK4LK33VE/graph.json","events_json":"https://pith.science/api/pith-number/GSMJ5ENP3TRYA6AOZNK4LK33VE/events.json","paper":"https://pith.science/paper/GSMJ5ENP"},"agent_actions":{"view_html":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE","download_json":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE.json","view_paper":"https://pith.science/paper/GSMJ5ENP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09119&json=true","fetch_graph":"https://pith.science/api/pith-number/GSMJ5ENP3TRYA6AOZNK4LK33VE/graph.json","fetch_events":"https://pith.science/api/pith-number/GSMJ5ENP3TRYA6AOZNK4LK33VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE/action/storage_attestation","attest_author":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE/action/author_attestation","sign_citation":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE/action/citation_signature","submit_replication":"https://pith.science/pith/GSMJ5ENP3TRYA6AOZNK4LK33VE/action/replication_record"}},"created_at":"2026-07-05T12:09:29.844178+00:00","updated_at":"2026-07-05T12:09:29.844178+00:00"}