{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BADZKZSVOQJCTADX6BHAELMJCK","short_pith_number":"pith:BADZKZSV","canonical_record":{"source":{"id":"2502.01378","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T14:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"8f451e69489db6aa22ed9d7cc46c68fcd690cd434493b03b65e7832ca2176db3","abstract_canon_sha256":"1e504c35466fbeaefdcd3a4c411f361158daca67a5b7f5e9ff42cf2a80ae8091"},"schema_version":"1.0"},"canonical_sha256":"08079566557412298077f04e022d891287a2df78d6cf2521b9a4a9d95f654a4a","source":{"kind":"arxiv","id":"2502.01378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01378","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01378v1","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01378","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"BADZKZSVOQJC","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"BADZKZSVOQJCTADX","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"BADZKZSV","created_at":"2026-07-05T10:08:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BADZKZSVOQJCTADX6BHAELMJCK","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01378","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T14:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"8f451e69489db6aa22ed9d7cc46c68fcd690cd434493b03b65e7832ca2176db3","abstract_canon_sha256":"1e504c35466fbeaefdcd3a4c411f361158daca67a5b7f5e9ff42cf2a80ae8091"},"schema_version":"1.0"},"canonical_sha256":"08079566557412298077f04e022d891287a2df78d6cf2521b9a4a9d95f654a4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:46.492909Z","signature_b64":"5PFim987ICjuDcWl5aba0vYE5DAdoPC+zIgOl/t57Wcs0l9Xe7ladPIYUUzVdwWN46+Yn5+GamYzEmXbEDjAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08079566557412298077f04e022d891287a2df78d6cf2521b9a4a9d95f654a4a","last_reissued_at":"2026-07-05T10:08:46.492437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:46.492437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01378","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-05T10:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3c3thR/BbVWxyJD4PQ5h7lR9dXy7A8T9EebZcsLOs8WJxjB+q15DuYLT7Qs6gtYcURKlqkshMxsi4+zyGPiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:44:06.804215Z"},"content_sha256":"19726765c855262f016b947b96c0f24cf4953db00929825823408c64b9b97db8","schema_version":"1.0","event_id":"sha256:19726765c855262f016b947b96c0f24cf4953db00929825823408c64b9b97db8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BADZKZSVOQJCTADX6BHAELMJCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Binhang Yuan, Guanduo Chen, Kun Yuan, Yipeng Hu, Yutong He","submitted_at":"2025-02-03T14:15:33Z","abstract_excerpt":"Large Language Models (LLMs) demonstrate exceptional performance across various tasks but demand substantial computational resources even for fine-tuning computation. Although Low-Rank Adaptation (LoRA) significantly alleviates memory consumption during fine-tuning, its impact on computational cost reduction is limited. This paper identifies the computation of activation gradients as the primary bottleneck in LoRA's backward propagation and introduces the Computation-Efficient LoRA (CE-LoRA) algorithm, which enhances computational efficiency while preserving memory efficiency. CE-LoRA leverage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01378","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/2502.01378/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-05T10:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2V5u60P0MJ3RbHBm+Sc2Pcy/eyHLcbo1L8iCZWUoxI7UsrgeWpjXWhpz+ZqDkFUqAZqMGOq7uf911UhR48TbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:44:06.804767Z"},"content_sha256":"dd019d187eebcdd3da9c68ca3565c212f76d3cd6bdaad532275af20d1e238946","schema_version":"1.0","event_id":"sha256:dd019d187eebcdd3da9c68ca3565c212f76d3cd6bdaad532275af20d1e238946"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BADZKZSVOQJCTADX6BHAELMJCK/bundle.json","state_url":"https://pith.science/pith/BADZKZSVOQJCTADX6BHAELMJCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BADZKZSVOQJCTADX6BHAELMJCK/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-08T07:44:06Z","links":{"resolver":"https://pith.science/pith/BADZKZSVOQJCTADX6BHAELMJCK","bundle":"https://pith.science/pith/BADZKZSVOQJCTADX6BHAELMJCK/bundle.json","state":"https://pith.science/pith/BADZKZSVOQJCTADX6BHAELMJCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BADZKZSVOQJCTADX6BHAELMJCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BADZKZSVOQJCTADX6BHAELMJCK","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":"1e504c35466fbeaefdcd3a4c411f361158daca67a5b7f5e9ff42cf2a80ae8091","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T14:15:33Z","title_canon_sha256":"8f451e69489db6aa22ed9d7cc46c68fcd690cd434493b03b65e7832ca2176db3"},"schema_version":"1.0","source":{"id":"2502.01378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01378","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01378v1","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01378","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"BADZKZSVOQJC","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"BADZKZSVOQJCTADX","created_at":"2026-07-05T10:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"BADZKZSV","created_at":"2026-07-05T10:08:46Z"}],"graph_snapshots":[{"event_id":"sha256:dd019d187eebcdd3da9c68ca3565c212f76d3cd6bdaad532275af20d1e238946","target":"graph","created_at":"2026-07-05T10:08:46Z","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/2502.01378/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Models (LLMs) demonstrate exceptional performance across various tasks but demand substantial computational resources even for fine-tuning computation. Although Low-Rank Adaptation (LoRA) significantly alleviates memory consumption during fine-tuning, its impact on computational cost reduction is limited. This paper identifies the computation of activation gradients as the primary bottleneck in LoRA's backward propagation and introduces the Computation-Efficient LoRA (CE-LoRA) algorithm, which enhances computational efficiency while preserving memory efficiency. CE-LoRA leverage","authors_text":"Binhang Yuan, Guanduo Chen, Kun Yuan, Yipeng Hu, Yutong He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T14:15:33Z","title":"CE-LoRA: Computation-Efficient LoRA Fine-Tuning for Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01378","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:19726765c855262f016b947b96c0f24cf4953db00929825823408c64b9b97db8","target":"record","created_at":"2026-07-05T10:08:46Z","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":"1e504c35466fbeaefdcd3a4c411f361158daca67a5b7f5e9ff42cf2a80ae8091","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-03T14:15:33Z","title_canon_sha256":"8f451e69489db6aa22ed9d7cc46c68fcd690cd434493b03b65e7832ca2176db3"},"schema_version":"1.0","source":{"id":"2502.01378","kind":"arxiv","version":1}},"canonical_sha256":"08079566557412298077f04e022d891287a2df78d6cf2521b9a4a9d95f654a4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08079566557412298077f04e022d891287a2df78d6cf2521b9a4a9d95f654a4a","first_computed_at":"2026-07-05T10:08:46.492437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:46.492437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PFim987ICjuDcWl5aba0vYE5DAdoPC+zIgOl/t57Wcs0l9Xe7ladPIYUUzVdwWN46+Yn5+GamYzEmXbEDjAAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:46.492909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19726765c855262f016b947b96c0f24cf4953db00929825823408c64b9b97db8","sha256:dd019d187eebcdd3da9c68ca3565c212f76d3cd6bdaad532275af20d1e238946"],"state_sha256":"5f03373414a653a731f85916c3769d5b0c89012210c6089aa8a63fa700651ec8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUFJ95ui4iaYuVQ/kf2KfZdVVLibbuzrtya5JATNCVoK5e41fmro6S7z/n/mN8JPuMPAlNeYgjS1L8rmfoBiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:44:06.809592Z","bundle_sha256":"60c3164def78beed6b60609ca10f16d63f73e14aef2693e07621362e75445f20"}}