{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SKKU6SY5EHG7LY2B4VR2ZQWZXR","short_pith_number":"pith:SKKU6SY5","schema_version":"1.0","canonical_sha256":"92954f4b1d21cdf5e341e563acc2d9bc64bc273be1edd6a4ed157e3d4cf94922","source":{"kind":"arxiv","id":"2402.09997","version":1},"attestation_state":"computed","paper":{"title":"LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wild","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Fei Wu, Guoyin Wang, Hongxia Yang, Kun Kuang, Leilei Gan, Wangchunshu Zhou, Ziyu Zhao","submitted_at":"2024-02-15T15:02:46Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) provides an effective yet efficient solution for fine-tuning large language models (LLM). The modular and plug-and-play nature of LoRA enables the integration of diverse domain-specific LoRAs to enhance the capabilities of LLMs. Previous research on exploiting multiple LoRAs either focuses on specific isolated downstream tasks or fixes the selection of LoRAs during training. However, in real-world scenarios, LLMs receive diverse prompts covering different tasks, and the pool of candidate LoRAs is often dynamically updated. To bridge this gap, we propose LoraRetriever"},"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":"2402.09997","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-02-15T15:02:46Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"7fd705608a7491f30198bdfa55c50c5be18942163bd7b47fd783a7c719a7eae4","abstract_canon_sha256":"58f90d44d17152ea759c19ccc036a3bf590aa4a2c36cd30fc1fe97f3c3d3ea46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:32.268038Z","signature_b64":"F3kJFKhAR1eq5DB/zTMRdoXkYtfkfQKcvIsoYNGrXetg/2k/e8kX1aKaacbb9pm3vB+Na7v3adR2i39LuLGPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92954f4b1d21cdf5e341e563acc2d9bc64bc273be1edd6a4ed157e3d4cf94922","last_reissued_at":"2026-07-05T07:46:32.267580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:32.267580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wild","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Fei Wu, Guoyin Wang, Hongxia Yang, Kun Kuang, Leilei Gan, Wangchunshu Zhou, Ziyu Zhao","submitted_at":"2024-02-15T15:02:46Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) provides an effective yet efficient solution for fine-tuning large language models (LLM). The modular and plug-and-play nature of LoRA enables the integration of diverse domain-specific LoRAs to enhance the capabilities of LLMs. Previous research on exploiting multiple LoRAs either focuses on specific isolated downstream tasks or fixes the selection of LoRAs during training. However, in real-world scenarios, LLMs receive diverse prompts covering different tasks, and the pool of candidate LoRAs is often dynamically updated. To bridge this gap, we propose LoraRetriever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09997","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/2402.09997/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":"2402.09997","created_at":"2026-07-05T07:46:32.267639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09997v1","created_at":"2026-07-05T07:46:32.267639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09997","created_at":"2026-07-05T07:46:32.267639+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKKU6SY5EHG7","created_at":"2026-07-05T07:46:32.267639+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKKU6SY5EHG7LY2B","created_at":"2026-07-05T07:46:32.267639+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKKU6SY5","created_at":"2026-07-05T07:46:32.267639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10617","citing_title":"SSR-Merge: Subspace Signal Routing for Training-Free LoRA Merging in Diffusion Models","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03979","citing_title":"Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories","ref_index":105,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01858","citing_title":"Polaris: Scaling Up Instruction-Guided Image Generation Towards Millions of Personalized Style Needs","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2412.04300","citing_title":"T2I-FactualBench: Benchmarking the Factuality of Text-to-Image Models with Knowledge-Intensive Concepts","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01429","citing_title":"SCALE-LoRA: Auditing Post-Retrieval LoRA Composition with Residual Merging and View Reliability","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR","json":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR.json","graph_json":"https://pith.science/api/pith-number/SKKU6SY5EHG7LY2B4VR2ZQWZXR/graph.json","events_json":"https://pith.science/api/pith-number/SKKU6SY5EHG7LY2B4VR2ZQWZXR/events.json","paper":"https://pith.science/paper/SKKU6SY5"},"agent_actions":{"view_html":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR","download_json":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR.json","view_paper":"https://pith.science/paper/SKKU6SY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09997&json=true","fetch_graph":"https://pith.science/api/pith-number/SKKU6SY5EHG7LY2B4VR2ZQWZXR/graph.json","fetch_events":"https://pith.science/api/pith-number/SKKU6SY5EHG7LY2B4VR2ZQWZXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR/action/storage_attestation","attest_author":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR/action/author_attestation","sign_citation":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR/action/citation_signature","submit_replication":"https://pith.science/pith/SKKU6SY5EHG7LY2B4VR2ZQWZXR/action/replication_record"}},"created_at":"2026-07-05T07:46:32.267639+00:00","updated_at":"2026-07-05T07:46:32.267639+00:00"}