{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I4OB32TPKQXVCBCJQFFDLY5X6P","short_pith_number":"pith:I4OB32TP","schema_version":"1.0","canonical_sha256":"471c1dea6f542f510449814a35e3b7f3e8cb2092bb63eb1a806ea43962946ae4","source":{"kind":"arxiv","id":"2411.15804","version":1},"attestation_state":"computed","paper":{"title":"LoRA-Mini : Adaptation Matrices Decomposition and Selective Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Ayush Singh, Rajdeep Aher, Shivank Garg","submitted_at":"2024-11-24T12:21:14Z","abstract_excerpt":"The rapid advancements in large language models (LLMs) have revolutionized natural language processing, creating an increased need for efficient, task-specific fine-tuning methods. Traditional fine-tuning of LLMs involves updating a large number of parameters, which is computationally expensive and memory-intensive. Low-Rank Adaptation (LoRA) has emerged as a promising solution, enabling parameter-efficient fine-tuning by reducing the number of trainable parameters. However, while LoRA reduces the number of trainable parameters, LoRA modules still create significant storage challenges. We prop"},"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":"2411.15804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-11-24T12:21:14Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"35bc9ede1d7b6d824679f4d6420f8030154191fe7c03fc3b0daaa9db539bf0f6","abstract_canon_sha256":"8a2574c06e62ebb7b3191fa6791fa8142d00f2124455a6f01282f6f72ee1ecc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:41.353543Z","signature_b64":"p7JIqBsbmnCSt2waPlF5G1gEg6pJXao8kaIC7fIXq6qSw2XTrEuvweS2bRP5je4gLllkGWvYWoRVbRXWekBzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"471c1dea6f542f510449814a35e3b7f3e8cb2092bb63eb1a806ea43962946ae4","last_reissued_at":"2026-07-05T09:39:41.353072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:41.353072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA-Mini : Adaptation Matrices Decomposition and Selective Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Ayush Singh, Rajdeep Aher, Shivank Garg","submitted_at":"2024-11-24T12:21:14Z","abstract_excerpt":"The rapid advancements in large language models (LLMs) have revolutionized natural language processing, creating an increased need for efficient, task-specific fine-tuning methods. Traditional fine-tuning of LLMs involves updating a large number of parameters, which is computationally expensive and memory-intensive. Low-Rank Adaptation (LoRA) has emerged as a promising solution, enabling parameter-efficient fine-tuning by reducing the number of trainable parameters. However, while LoRA reduces the number of trainable parameters, LoRA modules still create significant storage challenges. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15804","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/2411.15804/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":"2411.15804","created_at":"2026-07-05T09:39:41.353134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15804v1","created_at":"2026-07-05T09:39:41.353134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15804","created_at":"2026-07-05T09:39:41.353134+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4OB32TPKQXV","created_at":"2026-07-05T09:39:41.353134+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4OB32TPKQXVCBCJ","created_at":"2026-07-05T09:39:41.353134+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4OB32TP","created_at":"2026-07-05T09:39:41.353134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14859","citing_title":"Dynamic Adaptation of LoRA Fine-Tuning for Efficient and Task-Specific Optimization of Large Language Models","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P","json":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P.json","graph_json":"https://pith.science/api/pith-number/I4OB32TPKQXVCBCJQFFDLY5X6P/graph.json","events_json":"https://pith.science/api/pith-number/I4OB32TPKQXVCBCJQFFDLY5X6P/events.json","paper":"https://pith.science/paper/I4OB32TP"},"agent_actions":{"view_html":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P","download_json":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P.json","view_paper":"https://pith.science/paper/I4OB32TP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15804&json=true","fetch_graph":"https://pith.science/api/pith-number/I4OB32TPKQXVCBCJQFFDLY5X6P/graph.json","fetch_events":"https://pith.science/api/pith-number/I4OB32TPKQXVCBCJQFFDLY5X6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P/action/storage_attestation","attest_author":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P/action/author_attestation","sign_citation":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P/action/citation_signature","submit_replication":"https://pith.science/pith/I4OB32TPKQXVCBCJQFFDLY5X6P/action/replication_record"}},"created_at":"2026-07-05T09:39:41.353134+00:00","updated_at":"2026-07-05T09:39:41.353134+00:00"}