{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GKKFWAAVBKIYWQ6QXZTKXZA7R3","short_pith_number":"pith:GKKFWAAV","canonical_record":{"source":{"id":"2509.04884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"aff70c221b411a325a16414c8d8ff4039de67b87d2d1b069b19f8713270de045","abstract_canon_sha256":"02d6f370225c4ce36698fbc51bb29e979ced6edee69e398f87f55ff12a4ff437"},"schema_version":"1.0"},"canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","source":{"kind":"arxiv","id":"2509.04884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04884","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04884v1","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04884","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"GKKFWAAVBKIY","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_16","alias_value":"GKKFWAAVBKIYWQ6Q","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_8","alias_value":"GKKFWAAV","created_at":"2026-07-05T12:05:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GKKFWAAVBKIYWQ6QXZTKXZA7R3","target":"record","payload":{"canonical_record":{"source":{"id":"2509.04884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"aff70c221b411a325a16414c8d8ff4039de67b87d2d1b069b19f8713270de045","abstract_canon_sha256":"02d6f370225c4ce36698fbc51bb29e979ced6edee69e398f87f55ff12a4ff437"},"schema_version":"1.0"},"canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:31.603184Z","signature_b64":"E5H/aUWB7pKSzw0Q/6hT1I2E0MznT+uW5xAeS0FDxAh7MgiK2kllmsPKjfx2lVvVfZhLIWHKYQX/gR9xfd+7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","last_reissued_at":"2026-07-05T12:05:31.602682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:31.602682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.04884","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-07-05T12:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJZ9Efd0jMeGumpgnNDCi5gmNurrsXhL9wp/nLbS0pgS7rUfJe8QMz2D1a6W64Pg1K5lf78wFoBqfaKz0JfgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:34:23.719217Z"},"content_sha256":"ef7f8940e53aa4eec871a2c6c3a6e91277099ef576b776998143119af4a00777","schema_version":"1.0","event_id":"sha256:ef7f8940e53aa4eec871a2c6c3a6e91277099ef576b776998143119af4a00777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GKKFWAAVBKIYWQ6QXZTKXZA7R3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"L1RA: Dynamic Rank Assignment in LoRA Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.CL","authors_text":"Mark James Carman, Nicolo Brunello, Raul Singh, Vincenzo Scotti","submitted_at":"2025-09-05T08:03:01Z","abstract_excerpt":"The ability of Large Language Models (LLMs) to solve complex tasks has made them crucial in the development of AI-based applications. However, the high computational requirements to fine-tune these LLMs on downstream tasks pose significant challenges, particularly when resources are limited. In response to this challenge, we introduce L1RA, a novel technique aimed at dynamically distributing the rank of low-rank adapters during fine-tuning using LoRA. Given a rank budget (i.e., total sum of adapters rank), L1RA leverages L1 regularisation to prune redundant ranks and redistribute them across a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04884","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/2509.04884/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZBfBx3tMBSSJFEu6RYg0qQoXGmjl6qwKQ7Geh1neUcXRvv//Y9OJ16vnfKxx6/4bSe33gsqqqRSQDa4GFzfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:34:23.719742Z"},"content_sha256":"d0ee9d570317143159f6091ce3d048a3c87e75da853eb75258d62bb6ad661516","schema_version":"1.0","event_id":"sha256:d0ee9d570317143159f6091ce3d048a3c87e75da853eb75258d62bb6ad661516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/bundle.json","state_url":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/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-08-06T04:34:23Z","links":{"resolver":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3","bundle":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/bundle.json","state":"https://pith.science/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKKFWAAVBKIYWQ6QXZTKXZA7R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GKKFWAAVBKIYWQ6QXZTKXZA7R3","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":"02d6f370225c4ce36698fbc51bb29e979ced6edee69e398f87f55ff12a4ff437","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","title_canon_sha256":"aff70c221b411a325a16414c8d8ff4039de67b87d2d1b069b19f8713270de045"},"schema_version":"1.0","source":{"id":"2509.04884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04884","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04884v1","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04884","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"GKKFWAAVBKIY","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_16","alias_value":"GKKFWAAVBKIYWQ6Q","created_at":"2026-07-05T12:05:31Z"},{"alias_kind":"pith_short_8","alias_value":"GKKFWAAV","created_at":"2026-07-05T12:05:31Z"}],"graph_snapshots":[{"event_id":"sha256:d0ee9d570317143159f6091ce3d048a3c87e75da853eb75258d62bb6ad661516","target":"graph","created_at":"2026-07-05T12:05:31Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.04884/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The ability of Large Language Models (LLMs) to solve complex tasks has made them crucial in the development of AI-based applications. However, the high computational requirements to fine-tune these LLMs on downstream tasks pose significant challenges, particularly when resources are limited. In response to this challenge, we introduce L1RA, a novel technique aimed at dynamically distributing the rank of low-rank adapters during fine-tuning using LoRA. Given a rank budget (i.e., total sum of adapters rank), L1RA leverages L1 regularisation to prune redundant ranks and redistribute them across a","authors_text":"Mark James Carman, Nicolo Brunello, Raul Singh, Vincenzo Scotti","cross_cats":["cs.PF"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","title":"L1RA: Dynamic Rank Assignment in LoRA Fine-Tuning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04884","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef7f8940e53aa4eec871a2c6c3a6e91277099ef576b776998143119af4a00777","target":"record","created_at":"2026-07-05T12:05:31Z","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":"02d6f370225c4ce36698fbc51bb29e979ced6edee69e398f87f55ff12a4ff437","cross_cats_sorted":["cs.PF"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-09-05T08:03:01Z","title_canon_sha256":"aff70c221b411a325a16414c8d8ff4039de67b87d2d1b069b19f8713270de045"},"schema_version":"1.0","source":{"id":"2509.04884","kind":"arxiv","version":1}},"canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32945b00150a918b43d0be66abe41f8ed2a5b40982e7a4b9e580ff9b07ad684b","first_computed_at":"2026-07-05T12:05:31.602682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:31.602682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E5H/aUWB7pKSzw0Q/6hT1I2E0MznT+uW5xAeS0FDxAh7MgiK2kllmsPKjfx2lVvVfZhLIWHKYQX/gR9xfd+7CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:31.603184Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.04884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef7f8940e53aa4eec871a2c6c3a6e91277099ef576b776998143119af4a00777","sha256:d0ee9d570317143159f6091ce3d048a3c87e75da853eb75258d62bb6ad661516"],"state_sha256":"7aaf09018e38f13214ca1af6a77ec20d05fab3943b2ce1e96f2f91793fa378d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VY/6MTLazHDo1Wd6b+epZmyCVfAK0gV15B2LuhRph60CbGHCYumntDOWcaK+8g+sN18LflWQyukw8THLgeNIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:34:23.725121Z","bundle_sha256":"4943795511444d193e3788c9f1f8c130b292dd9f4fae6ace8d852e926928153a"}}