{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7UB6H6MTKTI2NH2J7ANFV7YNE","short_pith_number":"pith:K7UB6H6M","schema_version":"1.0","canonical_sha256":"57e81f1fcc9aa68d34fa4fc0d2d7f8691523429adc87223303f639e76664d343","source":{"kind":"arxiv","id":"2406.05223","version":3},"attestation_state":"computed","paper":{"title":"CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bernard Ghanem, Jianlong Wu, Liqiang Nie, Shuaiwen Leon Song, Xiaojie Li, Yibo Yang, Zhongzhu Zhou","submitted_at":"2024-06-07T19:10:35Z","abstract_excerpt":"Current parameter-efficient fine-tuning (PEFT) methods build adapters widely agnostic of the context of downstream task to learn, or the context of important knowledge to maintain. As a result, there is often a performance gap compared to full-parameter fine-tuning, and meanwhile the fine-tuned model suffers from catastrophic forgetting of the pre-trained world knowledge. In this paper, we propose CorDA, a Context-oriented Decomposition Adaptation method that builds learnable task-aware adapters from weight decomposition oriented by the context of downstream task or the world knowledge to main"},"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.05223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-07T19:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"933516f59753d84497799d8946fd2411c3a691b38cfc969084a2306f2a7f9b13","abstract_canon_sha256":"8a6241f1a7c608846e712814dfd841705248fd9f3a9e76a8b57d7e6353a0a740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:38.180270Z","signature_b64":"eONZ6kHZ0sYZuSS0eAl1PuCvkTMC1N/a6pTjemeeDwz49sqG2EkHHz9Amuxz7sMb1TEl6/ucVMxki19PsDHwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57e81f1fcc9aa68d34fa4fc0d2d7f8691523429adc87223303f639e76664d343","last_reissued_at":"2026-07-05T10:26:38.179647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:38.179647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CorDA: Context-Oriented Decomposition Adaptation of Large Language Models for Task-Aware Parameter-Efficient Fine-tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bernard Ghanem, Jianlong Wu, Liqiang Nie, Shuaiwen Leon Song, Xiaojie Li, Yibo Yang, Zhongzhu Zhou","submitted_at":"2024-06-07T19:10:35Z","abstract_excerpt":"Current parameter-efficient fine-tuning (PEFT) methods build adapters widely agnostic of the context of downstream task to learn, or the context of important knowledge to maintain. As a result, there is often a performance gap compared to full-parameter fine-tuning, and meanwhile the fine-tuned model suffers from catastrophic forgetting of the pre-trained world knowledge. In this paper, we propose CorDA, a Context-oriented Decomposition Adaptation method that builds learnable task-aware adapters from weight decomposition oriented by the context of downstream task or the world knowledge to main"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05223","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/2406.05223/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.05223","created_at":"2026-07-05T10:26:38.179715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05223v3","created_at":"2026-07-05T10:26:38.179715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05223","created_at":"2026-07-05T10:26:38.179715+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7UB6H6MTKTI","created_at":"2026-07-05T10:26:38.179715+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7UB6H6MTKTI2NH2","created_at":"2026-07-05T10:26:38.179715+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7UB6H6M","created_at":"2026-07-05T10:26:38.179715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17757","citing_title":"OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE","json":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE.json","graph_json":"https://pith.science/api/pith-number/K7UB6H6MTKTI2NH2J7ANFV7YNE/graph.json","events_json":"https://pith.science/api/pith-number/K7UB6H6MTKTI2NH2J7ANFV7YNE/events.json","paper":"https://pith.science/paper/K7UB6H6M"},"agent_actions":{"view_html":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE","download_json":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE.json","view_paper":"https://pith.science/paper/K7UB6H6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05223&json=true","fetch_graph":"https://pith.science/api/pith-number/K7UB6H6MTKTI2NH2J7ANFV7YNE/graph.json","fetch_events":"https://pith.science/api/pith-number/K7UB6H6MTKTI2NH2J7ANFV7YNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE/action/storage_attestation","attest_author":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE/action/author_attestation","sign_citation":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE/action/citation_signature","submit_replication":"https://pith.science/pith/K7UB6H6MTKTI2NH2J7ANFV7YNE/action/replication_record"}},"created_at":"2026-07-05T10:26:38.179715+00:00","updated_at":"2026-07-05T10:26:38.179715+00:00"}