{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YKNS6YNAJMVQPD5F7FAN55TLI3","short_pith_number":"pith:YKNS6YNA","canonical_record":{"source":{"id":"2501.08582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-01-15T05:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"e1675411789684ce77d42410c79e65fd0dc048de13a2a02dcf3674427f63bd02","abstract_canon_sha256":"ebc9f1d85a4324375d29baaebb04bc9a626b9ebbad5cff24c1610a7fa35c4887"},"schema_version":"1.0"},"canonical_sha256":"c29b2f61a04b2b078fa5f940def66b46c74c3a31bde4c5dda5b9a4ccbdbe6e33","source":{"kind":"arxiv","id":"2501.08582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08582","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08582v1","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08582","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"YKNS6YNAJMVQ","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_16","alias_value":"YKNS6YNAJMVQPD5F","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_8","alias_value":"YKNS6YNA","created_at":"2026-07-05T10:01:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YKNS6YNAJMVQPD5F7FAN55TLI3","target":"record","payload":{"canonical_record":{"source":{"id":"2501.08582","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-01-15T05:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"e1675411789684ce77d42410c79e65fd0dc048de13a2a02dcf3674427f63bd02","abstract_canon_sha256":"ebc9f1d85a4324375d29baaebb04bc9a626b9ebbad5cff24c1610a7fa35c4887"},"schema_version":"1.0"},"canonical_sha256":"c29b2f61a04b2b078fa5f940def66b46c74c3a31bde4c5dda5b9a4ccbdbe6e33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:21.488786Z","signature_b64":"LNetwyXGdLaWlxyEHyc2aVwlqeMt9zzjIqxbPEsvC7a8qdNJHlYOGx8NLFstCfRhJ+2nq3yVA0rdLncYv71SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c29b2f61a04b2b078fa5f940def66b46c74c3a31bde4c5dda5b9a4ccbdbe6e33","last_reissued_at":"2026-07-05T10:01:21.488292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:21.488292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.08582","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JpXnxamO99/h4g/hqgdUOzU7IwSDRS7NsxyvQzMYx8xjbUGeUNqLr1lb9U8gIReiC5Jq/hy/giqmdoVvCCDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T14:32:42.079043Z"},"content_sha256":"cbe4eb3e22f18b8a4c2877a2b219d4499c9c220710681c3ab5d9a54489955c1b","schema_version":"1.0","event_id":"sha256:cbe4eb3e22f18b8a4c2877a2b219d4499c9c220710681c3ab5d9a54489955c1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YKNS6YNAJMVQPD5F7FAN55TLI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cuiping Li, Hong Chen, Jing Zhang, Xiaodong Chen, Yuxuan Hu, Zhe Zhao","submitted_at":"2025-01-15T05:07:06Z","abstract_excerpt":"Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA techniques with additional masking mechanisms. Despite these successes, such approaches suffer from an increased memory and computation overhead, which affects efficiency of LoRA methods. In response to this limitation, we introduce LoRS, an innovative method designed to achieve both memory and computation efficiency when fine-tuning sparse LLMs. To mitigate the substantial memory "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08582","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/2501.08582/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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3gpx5UrubskfG7PYpkyDAGMiwAsVUvEbaHqyvf/KFrtWLdycBiPSk9nsF6mRHV0wFFMjdVKVUS9WIzuAkKHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T14:32:42.079417Z"},"content_sha256":"9fe22a37240d411372b62e389d3569e678be5d492474d4de87f52754bdb9c76f","schema_version":"1.0","event_id":"sha256:9fe22a37240d411372b62e389d3569e678be5d492474d4de87f52754bdb9c76f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/bundle.json","state_url":"https://pith.science/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/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-03T14:32:42Z","links":{"resolver":"https://pith.science/pith/YKNS6YNAJMVQPD5F7FAN55TLI3","bundle":"https://pith.science/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/bundle.json","state":"https://pith.science/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKNS6YNAJMVQPD5F7FAN55TLI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YKNS6YNAJMVQPD5F7FAN55TLI3","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":"ebc9f1d85a4324375d29baaebb04bc9a626b9ebbad5cff24c1610a7fa35c4887","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-01-15T05:07:06Z","title_canon_sha256":"e1675411789684ce77d42410c79e65fd0dc048de13a2a02dcf3674427f63bd02"},"schema_version":"1.0","source":{"id":"2501.08582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.08582","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"2501.08582v1","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08582","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"YKNS6YNAJMVQ","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_16","alias_value":"YKNS6YNAJMVQPD5F","created_at":"2026-07-05T10:01:21Z"},{"alias_kind":"pith_short_8","alias_value":"YKNS6YNA","created_at":"2026-07-05T10:01:21Z"}],"graph_snapshots":[{"event_id":"sha256:9fe22a37240d411372b62e389d3569e678be5d492474d4de87f52754bdb9c76f","target":"graph","created_at":"2026-07-05T10:01:21Z","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/2501.08582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA techniques with additional masking mechanisms. Despite these successes, such approaches suffer from an increased memory and computation overhead, which affects efficiency of LoRA methods. In response to this limitation, we introduce LoRS, an innovative method designed to achieve both memory and computation efficiency when fine-tuning sparse LLMs. To mitigate the substantial memory ","authors_text":"Cuiping Li, Hong Chen, Jing Zhang, Xiaodong Chen, Yuxuan Hu, Zhe Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-01-15T05:07:06Z","title":"LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08582","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:cbe4eb3e22f18b8a4c2877a2b219d4499c9c220710681c3ab5d9a54489955c1b","target":"record","created_at":"2026-07-05T10:01:21Z","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":"ebc9f1d85a4324375d29baaebb04bc9a626b9ebbad5cff24c1610a7fa35c4887","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-01-15T05:07:06Z","title_canon_sha256":"e1675411789684ce77d42410c79e65fd0dc048de13a2a02dcf3674427f63bd02"},"schema_version":"1.0","source":{"id":"2501.08582","kind":"arxiv","version":1}},"canonical_sha256":"c29b2f61a04b2b078fa5f940def66b46c74c3a31bde4c5dda5b9a4ccbdbe6e33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c29b2f61a04b2b078fa5f940def66b46c74c3a31bde4c5dda5b9a4ccbdbe6e33","first_computed_at":"2026-07-05T10:01:21.488292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:01:21.488292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LNetwyXGdLaWlxyEHyc2aVwlqeMt9zzjIqxbPEsvC7a8qdNJHlYOGx8NLFstCfRhJ+2nq3yVA0rdLncYv71SAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:01:21.488786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.08582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbe4eb3e22f18b8a4c2877a2b219d4499c9c220710681c3ab5d9a54489955c1b","sha256:9fe22a37240d411372b62e389d3569e678be5d492474d4de87f52754bdb9c76f"],"state_sha256":"625e20ae3e0b9ff6f1f959c6535a55d08e3b6892d4f7586a8c2c826fe214f49d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJg49GS8C+3IyllNnVdwtyJPZaMB4NZ3CH+8x37euub3naNljB7EfVBQZrzNyS9WSpZxa2fNYq+CEYaA8TmkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T14:32:42.082092Z","bundle_sha256":"dfcfac4edbb9a224141a86ab95e10c52e7a3d638499f55c39891dc61a1fdbc71"}}