{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4HJLBFPQO7QUB2SBI4BRKEUMPG","short_pith_number":"pith:4HJLBFPQ","schema_version":"1.0","canonical_sha256":"e1d2b095f077e140ea41470315128c79bceef647b05cad3aebdd6c0054398fff","source":{"kind":"arxiv","id":"2401.11316","version":1},"attestation_state":"computed","paper":{"title":"PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Lior Wolf, Nadav Benedek","submitted_at":"2024-01-20T20:25:17Z","abstract_excerpt":"With the proliferation of large pre-trained language models (PLMs), fine-tuning all model parameters becomes increasingly inefficient, particularly when dealing with numerous downstream tasks that entail substantial training and storage costs. Several approaches aimed at achieving parameter-efficient fine-tuning (PEFT) have been proposed. Among them, Low-Rank Adaptation (LoRA) stands out as an archetypal method, incorporating trainable rank decomposition matrices into each target module. Nevertheless, LoRA does not consider the varying importance of each layer. To address these challenges, we "},"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":"2401.11316","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-01-20T20:25:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ad07f869b8005b32a28d0fa52a12a3c4df855a97834bd867183a2e57e9732fc8","abstract_canon_sha256":"6361fedbeee42a2a1e547d09e5af6f4d061b5b8c7a25d5d692318c4b2a03caa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:48.796794Z","signature_b64":"KACoBKcPld9k0ArJ3H94OuoPitBcJiFGhZB18ij50d1CEmzByfpgR8WL9TRQFSyDoJGovvvlN6c2uE0zhLDpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d2b095f077e140ea41470315128c79bceef647b05cad3aebdd6c0054398fff","last_reissued_at":"2026-07-05T07:35:48.796383Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:48.796383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Lior Wolf, Nadav Benedek","submitted_at":"2024-01-20T20:25:17Z","abstract_excerpt":"With the proliferation of large pre-trained language models (PLMs), fine-tuning all model parameters becomes increasingly inefficient, particularly when dealing with numerous downstream tasks that entail substantial training and storage costs. Several approaches aimed at achieving parameter-efficient fine-tuning (PEFT) have been proposed. Among them, Low-Rank Adaptation (LoRA) stands out as an archetypal method, incorporating trainable rank decomposition matrices into each target module. Nevertheless, LoRA does not consider the varying importance of each layer. To address these challenges, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11316","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/2401.11316/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":"2401.11316","created_at":"2026-07-05T07:35:48.796440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11316v1","created_at":"2026-07-05T07:35:48.796440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11316","created_at":"2026-07-05T07:35:48.796440+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HJLBFPQO7QU","created_at":"2026-07-05T07:35:48.796440+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HJLBFPQO7QUB2SB","created_at":"2026-07-05T07:35:48.796440+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HJLBFPQ","created_at":"2026-07-05T07:35:48.796440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19510","citing_title":"Parameter Efficient Fine-Tuning for Deep Learning-Based Full-Waveform Inversion","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG","json":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG.json","graph_json":"https://pith.science/api/pith-number/4HJLBFPQO7QUB2SBI4BRKEUMPG/graph.json","events_json":"https://pith.science/api/pith-number/4HJLBFPQO7QUB2SBI4BRKEUMPG/events.json","paper":"https://pith.science/paper/4HJLBFPQ"},"agent_actions":{"view_html":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG","download_json":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG.json","view_paper":"https://pith.science/paper/4HJLBFPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11316&json=true","fetch_graph":"https://pith.science/api/pith-number/4HJLBFPQO7QUB2SBI4BRKEUMPG/graph.json","fetch_events":"https://pith.science/api/pith-number/4HJLBFPQO7QUB2SBI4BRKEUMPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG/action/storage_attestation","attest_author":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG/action/author_attestation","sign_citation":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG/action/citation_signature","submit_replication":"https://pith.science/pith/4HJLBFPQO7QUB2SBI4BRKEUMPG/action/replication_record"}},"created_at":"2026-07-05T07:35:48.796440+00:00","updated_at":"2026-07-05T07:35:48.796440+00:00"}