{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JDHJ3KPCJGIXNGNG2IL2563NOG","short_pith_number":"pith:JDHJ3KPC","schema_version":"1.0","canonical_sha256":"48ce9da9e249917699a6d217aefb6d7196445803366f4e8b638f8695de54f627","source":{"kind":"arxiv","id":"2501.17635","version":3},"attestation_state":"computed","paper":{"title":"In-Context Meta LoRA Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.CL","authors_text":"Chenyu Zhang, Hao Tang, Hao Zhao, Jingcai Guo, Lei Li, Mengzhu Wang, Minxi Yan, Nicu Sebe, Siyu Chen, Wenjie Chen, Xinwei Long, Yang Liu, Yan Wang, Yihua Shao, Ziyang Yan","submitted_at":"2025-01-29T13:12:01Z","abstract_excerpt":"Low-rank Adaptation (LoRA) has demonstrated remarkable capabilities for task specific fine-tuning. However, in scenarios that involve multiple tasks, training a separate LoRA model for each one results in considerable inefficiency in terms of storage and inference. Moreover, existing parameter generation methods fail to capture the correlations among these tasks, making multi-task LoRA parameter generation challenging. To address these limitations, we propose In-Context Meta LoRA (ICM-LoRA), a novel approach that efficiently achieves task-specific customization of large language models (LLMs)."},"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":"2501.17635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-01-29T13:12:01Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"aa4cb1414edcb8a46778902ddda0ef684a1b2016b82ecac679b4b182f3967ddf","abstract_canon_sha256":"ecb7dce8423872a59382f3811ba33aaeee3177a04455a52a90e7d37083222fd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:23.869475Z","signature_b64":"R90a1/fbcFj0F6Qwy4rmEg8naEFFhCJFLB0VmVc5C5QapTkXomFjCXYV74ZbCZVn4Gaxf594ZbWS7kdVl3dGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ce9da9e249917699a6d217aefb6d7196445803366f4e8b638f8695de54f627","last_reissued_at":"2026-07-05T11:32:23.868957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:23.868957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"In-Context Meta LoRA Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.CL","authors_text":"Chenyu Zhang, Hao Tang, Hao Zhao, Jingcai Guo, Lei Li, Mengzhu Wang, Minxi Yan, Nicu Sebe, Siyu Chen, Wenjie Chen, Xinwei Long, Yang Liu, Yan Wang, Yihua Shao, Ziyang Yan","submitted_at":"2025-01-29T13:12:01Z","abstract_excerpt":"Low-rank Adaptation (LoRA) has demonstrated remarkable capabilities for task specific fine-tuning. However, in scenarios that involve multiple tasks, training a separate LoRA model for each one results in considerable inefficiency in terms of storage and inference. Moreover, existing parameter generation methods fail to capture the correlations among these tasks, making multi-task LoRA parameter generation challenging. To address these limitations, we propose In-Context Meta LoRA (ICM-LoRA), a novel approach that efficiently achieves task-specific customization of large language models (LLMs)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17635","kind":"arxiv","version":3},"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/2501.17635/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":"2501.17635","created_at":"2026-07-05T11:32:23.869018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17635v3","created_at":"2026-07-05T11:32:23.869018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17635","created_at":"2026-07-05T11:32:23.869018+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDHJ3KPCJGIX","created_at":"2026-07-05T11:32:23.869018+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDHJ3KPCJGIXNGNG","created_at":"2026-07-05T11:32:23.869018+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDHJ3KPC","created_at":"2026-07-05T11:32:23.869018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04945","citing_title":"STaR-Quant: State-Time Consistent Post-Training Quantization for Diffusion Large Language Models","ref_index":127,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20189","citing_title":"SOLAR: A Self-Optimizing Open-Ended Autonomous Agent for Lifelong Learning and Continual Adaptation","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21905","citing_title":"Low-Rank Adaptation Redux for Large Models","ref_index":167,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG","json":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG.json","graph_json":"https://pith.science/api/pith-number/JDHJ3KPCJGIXNGNG2IL2563NOG/graph.json","events_json":"https://pith.science/api/pith-number/JDHJ3KPCJGIXNGNG2IL2563NOG/events.json","paper":"https://pith.science/paper/JDHJ3KPC"},"agent_actions":{"view_html":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG","download_json":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG.json","view_paper":"https://pith.science/paper/JDHJ3KPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17635&json=true","fetch_graph":"https://pith.science/api/pith-number/JDHJ3KPCJGIXNGNG2IL2563NOG/graph.json","fetch_events":"https://pith.science/api/pith-number/JDHJ3KPCJGIXNGNG2IL2563NOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG/action/storage_attestation","attest_author":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG/action/author_attestation","sign_citation":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG/action/citation_signature","submit_replication":"https://pith.science/pith/JDHJ3KPCJGIXNGNG2IL2563NOG/action/replication_record"}},"created_at":"2026-07-05T11:32:23.869018+00:00","updated_at":"2026-07-05T11:32:23.869018+00:00"}