{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7P25Z3VUUIMNQW2NNNKE26RDHV","short_pith_number":"pith:7P25Z3VU","canonical_record":{"source":{"id":"2605.16800","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:03:21Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7fbe677cd477af6af08ff0e77bc873b25f46d6da470bd7a192c1bb7376690bc1","abstract_canon_sha256":"4b432ff783d1fd6143ed45a4cc61dd8388e2783bd3b4d554cddf79ef5301326e"},"schema_version":"1.0"},"canonical_sha256":"fbf5dceeb4a218d85b4d6b544d7a233d7e888706292271499b95cdc583109f8f","source":{"kind":"arxiv","id":"2605.16800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16800","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16800v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16800","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"7P25Z3VUUIMN","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"7P25Z3VUUIMNQW2N","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"7P25Z3VU","created_at":"2026-05-20T00:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7P25Z3VUUIMNQW2NNNKE26RDHV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16800","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:03:21Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"7fbe677cd477af6af08ff0e77bc873b25f46d6da470bd7a192c1bb7376690bc1","abstract_canon_sha256":"4b432ff783d1fd6143ed45a4cc61dd8388e2783bd3b4d554cddf79ef5301326e"},"schema_version":"1.0"},"canonical_sha256":"fbf5dceeb4a218d85b4d6b544d7a233d7e888706292271499b95cdc583109f8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:22.875487Z","signature_b64":"n8sin3krRr5LeZ+Z44zBoPv9xsiioofDofpFHEZF1GhUahMlXh9+y1Q3D9kHU+VhY1VKQfkFelyXxExt4KppAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf5dceeb4a218d85b4d6b544d7a233d7e888706292271499b95cdc583109f8f","last_reissued_at":"2026-05-20T00:03:22.874692Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:22.874692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16800","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gciXNyzVvY29MBcvIpIszVQYO/bHOnLhX51w9Lt9W6RcLCCnCL4NalY1HvFCO9147JVafrywid5eirXIHAHCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:27:37.228254Z"},"content_sha256":"3da0f87c4de1511d015d6008858883c30ffb411a24adac79503f5513fe373345","schema_version":"1.0","event_id":"sha256:3da0f87c4de1511d015d6008858883c30ffb411a24adac79503f5513fe373345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7P25Z3VUUIMNQW2NNNKE26RDHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FIM-LoRA: Task-Informative Rank Allocation for LoRA via Calibration-Time Gradient-Variance Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Ramakrishnan Sathyavageeswaran","submitted_at":"2026-05-16T04:03:21Z","abstract_excerpt":"Low-rank adaptation (LoRA) assigns a uniform rank to every adapted weight matrix - a practical convenience that ignores a fundamental reality: different layers contribute unequally to task adaptation. We address this with a lightweight engineering solution: before fine-tuning begins, run eight calibration backward passes, compute the gradient variance of each LoRA-B matrix as a proxy for layer informativeness, and redistribute the rank budget proportionally. The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving i"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving infrastructure. On GLUE with DeBERTa-v3-base, FIM-LoRA matches LoRA (88.6 vs. 88.7) at the same parameter budget, and on commonsense reasoning with LLaMA-3-8B reaches 68.5 vs. 68.7 for LoRA.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the gradient variance of each LoRA-B matrix computed from only eight calibration backward passes serves as a reliable and stable proxy for layer informativeness, such that proportional redistribution of the fixed rank budget will preserve or improve task performance without introducing instability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FIM-LoRA allocates per-layer ranks in LoRA using calibration-time gradient variance as a proxy for informativeness via an efficient eFIM diagonal approximation, matching standard LoRA accuracy on GLUE and commonsense tasks while yielding interpretable rank patterns.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"905feec62f7fcb22dd94491ed9bca87d56fab7788223ab92645281c8bf6dacfb"},"source":{"id":"2605.16800","kind":"arxiv","version":1},"verdict":{"id":"71fd7c2a-aa3b-43e1-9fa8-18229eae2ec1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:14:54.758541Z","strongest_claim":"The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving infrastructure. On GLUE with DeBERTa-v3-base, FIM-LoRA matches LoRA (88.6 vs. 88.7) at the same parameter budget, and on commonsense reasoning with LLaMA-3-8B reaches 68.5 vs. 68.7 for LoRA.","one_line_summary":"FIM-LoRA allocates per-layer ranks in LoRA using calibration-time gradient variance as a proxy for informativeness via an efficient eFIM diagonal approximation, matching standard LoRA accuracy on GLUE and commonsense tasks while yielding interpretable rank patterns.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the gradient variance of each LoRA-B matrix computed from only eight calibration backward passes serves as a reliable and stable proxy for layer informativeness, such that proportional redistribution of the fixed rank budget will preserve or improve task performance without introducing instability.","pith_extraction_headline":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16800/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.294034Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:21:18.587080Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.287930Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.424295Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c2c939cd5764cc9a3e197ff16d8a3899f9a3e9e04ac6b1569b6df5d5f6c3638b"},"references":{"count":11,"sample":[{"doi":"","year":2022,"title":"E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, and W. Chen. LoRA: Low-Rank Adaptation of Large Language Models. In ICLR , 2022","work_id":"15de8df1-88b5-41cc-890d-875cafeca53d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Q. Zhang, M. Chen, A. Bukharin, P. He, Y. Cheng, W. Chen, and T. Zhao. AdaLoRA : Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning. In ICLR , 2023","work_id":"efb8cc50-54ef-4bed-9865-db0609c9d244","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"F. Paischer, L. Hauzenberger, T. Schmied, B. Alkin, M. P. Deisenroth, and S. Hochreiter. EVA : One-shot Initialization of Low-Rank Adaptation via Activation Variance. In NeurIPS , 2025","work_id":"6e4776af-a747-4c96-9ef9-c88b6c17f6d2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"arXiv preprint arXiv:2502.12171 , year=","work_id":"c517e54c-4d56-4f9d-ab8c-69cdd2afe34a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Z. Liu, J. Lyn, W. Zhu, X. Tian, and Y. Graham. ALoRA : Allocating Low-Rank Adaptation for Fine-tuning Large Language Models. In NAACL , 2024","work_id":"96ee4d4f-a8db-4d6d-9910-65d51877bcd7","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":11,"snapshot_sha256":"1bd4642ddc660a1a911a97a9f10a58d3eaa8df38e9ad0c4f7270b61f874c1c50","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"97696dbfb7248044bba97a19f10f055811d749d5dfcf79285122ff4a6f61569d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"71fd7c2a-aa3b-43e1-9fa8-18229eae2ec1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnB452vIHwwK+rz5fw9WBUHVbfx1/6LgKefL22hHCILL2SXHi6zyltDaxNYDA2mXbQ/X+rlFruH/nmTpCKvyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:27:37.228883Z"},"content_sha256":"7526688d0fc7e4de1f09ab24058f8c7cc0b35037a8b0fbe2b1d926e595cad42c","schema_version":"1.0","event_id":"sha256:7526688d0fc7e4de1f09ab24058f8c7cc0b35037a8b0fbe2b1d926e595cad42c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/bundle.json","state_url":"https://pith.science/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T13:27:37Z","links":{"resolver":"https://pith.science/pith/7P25Z3VUUIMNQW2NNNKE26RDHV","bundle":"https://pith.science/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/bundle.json","state":"https://pith.science/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7P25Z3VUUIMNQW2NNNKE26RDHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7P25Z3VUUIMNQW2NNNKE26RDHV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b432ff783d1fd6143ed45a4cc61dd8388e2783bd3b4d554cddf79ef5301326e","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:03:21Z","title_canon_sha256":"7fbe677cd477af6af08ff0e77bc873b25f46d6da470bd7a192c1bb7376690bc1"},"schema_version":"1.0","source":{"id":"2605.16800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16800","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16800v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16800","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"7P25Z3VUUIMN","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"7P25Z3VUUIMNQW2N","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"7P25Z3VU","created_at":"2026-05-20T00:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:7526688d0fc7e4de1f09ab24058f8c7cc0b35037a8b0fbe2b1d926e595cad42c","target":"graph","created_at":"2026-05-20T00:03:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving infrastructure. On GLUE with DeBERTa-v3-base, FIM-LoRA matches LoRA (88.6 vs. 88.7) at the same parameter budget, and on commonsense reasoning with LLaMA-3-8B reaches 68.5 vs. 68.7 for LoRA."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the gradient variance of each LoRA-B matrix computed from only eight calibration backward passes serves as a reliable and stable proxy for layer informativeness, such that proportional redistribution of the fixed rank budget will preserve or improve task performance without introducing instability."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FIM-LoRA allocates per-layer ranks in LoRA using calibration-time gradient variance as a proxy for informativeness via an efficient eFIM diagonal approximation, matching standard LoRA accuracy on GLUE and commonsense tasks while yielding interpretable rank patterns."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes."}],"snapshot_sha256":"905feec62f7fcb22dd94491ed9bca87d56fab7788223ab92645281c8bf6dacfb"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"97696dbfb7248044bba97a19f10f055811d749d5dfcf79285122ff4a6f61569d"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.294034Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:21:18.587080Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.287930Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.424295Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16800/integrity.json","findings":[],"snapshot_sha256":"c2c939cd5764cc9a3e197ff16d8a3899f9a3e9e04ac6b1569b6df5d5f6c3638b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank adaptation (LoRA) assigns a uniform rank to every adapted weight matrix - a practical convenience that ignores a fundamental reality: different layers contribute unequally to task adaptation. We address this with a lightweight engineering solution: before fine-tuning begins, run eight calibration backward passes, compute the gradient variance of each LoRA-B matrix as a proxy for layer informativeness, and redistribute the rank budget proportionally. The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving i","authors_text":"Ramakrishnan Sathyavageeswaran","cross_cats":["cs.CL"],"headline":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:03:21Z","title":"FIM-LoRA: Task-Informative Rank Allocation for LoRA via Calibration-Time Gradient-Variance Estimation"},"references":{"count":11,"internal_anchors":0,"resolved_work":11,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"E. J. Hu, Y. Shen, P. Wallis, Z. Allen-Zhu, Y. Li, S. Wang, L. Wang, and W. Chen. LoRA: Low-Rank Adaptation of Large Language Models. In ICLR , 2022","work_id":"15de8df1-88b5-41cc-890d-875cafeca53d","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Q. Zhang, M. Chen, A. Bukharin, P. He, Y. Cheng, W. Chen, and T. Zhao. AdaLoRA : Adaptive Budget Allocation for Parameter-Efficient Fine-Tuning. In ICLR , 2023","work_id":"efb8cc50-54ef-4bed-9865-db0609c9d244","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"F. Paischer, L. Hauzenberger, T. Schmied, B. Alkin, M. P. Deisenroth, and S. Hochreiter. EVA : One-shot Initialization of Low-Rank Adaptation via Activation Variance. In NeurIPS , 2025","work_id":"6e4776af-a747-4c96-9ef9-c88b6c17f6d2","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"arXiv preprint arXiv:2502.12171 , year=","work_id":"c517e54c-4d56-4f9d-ab8c-69cdd2afe34a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Z. Liu, J. Lyn, W. Zhu, X. Tian, and Y. Graham. ALoRA : Allocating Low-Rank Adaptation for Fine-tuning Large Language Models. In NAACL , 2024","work_id":"96ee4d4f-a8db-4d6d-9910-65d51877bcd7","year":2024}],"snapshot_sha256":"1bd4642ddc660a1a911a97a9f10a58d3eaa8df38e9ad0c4f7270b61f874c1c50"},"source":{"id":"2605.16800","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:14:54.758541Z","id":"71fd7c2a-aa3b-43e1-9fa8-18229eae2ec1","model_set":{"reader":"grok-4.3"},"one_line_summary":"FIM-LoRA allocates per-layer ranks in LoRA using calibration-time gradient variance as a proxy for informativeness via an efficient eFIM diagonal approximation, matching standard LoRA accuracy on GLUE and commonsense tasks while yielding interpretable rank patterns.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LoRA can match uniform-rank performance by reallocating its fixed budget according to per-layer gradient variances measured in eight calibration passes.","strongest_claim":"The resulting adapter is a standard LoRA with a per-layer rank pattern - no new parameters, no training overhead, no changes to serving infrastructure. On GLUE with DeBERTa-v3-base, FIM-LoRA matches LoRA (88.6 vs. 88.7) at the same parameter budget, and on commonsense reasoning with LLaMA-3-8B reaches 68.5 vs. 68.7 for LoRA.","weakest_assumption":"That the gradient variance of each LoRA-B matrix computed from only eight calibration backward passes serves as a reliable and stable proxy for layer informativeness, such that proportional redistribution of the fixed rank budget will preserve or improve task performance without introducing instability."}},"verdict_id":"71fd7c2a-aa3b-43e1-9fa8-18229eae2ec1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3da0f87c4de1511d015d6008858883c30ffb411a24adac79503f5513fe373345","target":"record","created_at":"2026-05-20T00:03:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b432ff783d1fd6143ed45a4cc61dd8388e2783bd3b4d554cddf79ef5301326e","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T04:03:21Z","title_canon_sha256":"7fbe677cd477af6af08ff0e77bc873b25f46d6da470bd7a192c1bb7376690bc1"},"schema_version":"1.0","source":{"id":"2605.16800","kind":"arxiv","version":1}},"canonical_sha256":"fbf5dceeb4a218d85b4d6b544d7a233d7e888706292271499b95cdc583109f8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbf5dceeb4a218d85b4d6b544d7a233d7e888706292271499b95cdc583109f8f","first_computed_at":"2026-05-20T00:03:22.874692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:22.874692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8sin3krRr5LeZ+Z44zBoPv9xsiioofDofpFHEZF1GhUahMlXh9+y1Q3D9kHU+VhY1VKQfkFelyXxExt4KppAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:22.875487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3da0f87c4de1511d015d6008858883c30ffb411a24adac79503f5513fe373345","sha256:7526688d0fc7e4de1f09ab24058f8c7cc0b35037a8b0fbe2b1d926e595cad42c"],"state_sha256":"681468f7508acf7a2804eb8bc8f78f89f91053f12b396b66c2525eb3ca1a2258"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/LpowP7ctmzPKn5dLLRD8//QwX7pmy7DoZ8KGoLpOCQlJ6zQZany799MvG1NjqK+9HHFm/b7CGOSEpcySUdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:27:37.232429Z","bundle_sha256":"449b1581defcc102190259c171893bbff79b963425238b95b538096014b42dfe"}}