{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5547JMA64S6IC6LFMNRGDU55HR","short_pith_number":"pith:5547JMA6","canonical_record":{"source":{"id":"2510.00192","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T19:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"85a9c8a6eb86885897ee033a53f9b08123cb770cb294b78c6796661a66853cca","abstract_canon_sha256":"a1c88ff7424d23738ee33552768319761cec54e0405a38b3fcb04591a7651ce1"},"schema_version":"1.0"},"canonical_sha256":"ef79f4b01ee4bc817965636261d3bd3c5c8783cc2006ab7857e869bf2305e665","source":{"kind":"arxiv","id":"2510.00192","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.00192","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"arxiv_version","alias_value":"2510.00192v3","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00192","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_12","alias_value":"5547JMA64S6I","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_16","alias_value":"5547JMA64S6IC6LF","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_8","alias_value":"5547JMA6","created_at":"2026-07-30T01:16:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5547JMA64S6IC6LFMNRGDU55HR","target":"record","payload":{"canonical_record":{"source":{"id":"2510.00192","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T19:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"85a9c8a6eb86885897ee033a53f9b08123cb770cb294b78c6796661a66853cca","abstract_canon_sha256":"a1c88ff7424d23738ee33552768319761cec54e0405a38b3fcb04591a7651ce1"},"schema_version":"1.0"},"canonical_sha256":"ef79f4b01ee4bc817965636261d3bd3c5c8783cc2006ab7857e869bf2305e665","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef79f4b01ee4bc817965636261d3bd3c5c8783cc2006ab7857e869bf2305e665","last_reissued_at":"2026-07-30T01:16:17.127756Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:16:17.127756Z"},"source_kind":"arxiv","source_id":"2510.00192","source_version":3,"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-30T01:16:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDFp5ZMAK4sC+WVQE6zf3C0ZIGokxEOnPrhGE/EDNmZ9hvZ4CcSE9eWGfClYo9xiY5P8PQfWGezW/TLtOAkWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:58:53.820495Z"},"content_sha256":"c6c6814a8bd38b8be2152e41beab6644df756573bd24f5c3ca5fc4f1db494cf3","schema_version":"1.0","event_id":"sha256:c6c6814a8bd38b8be2152e41beab6644df756573bd24f5c3ca5fc4f1db494cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5547JMA64S6IC6LFMNRGDU55HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cong Xie, Lingzhou Xue, Tiantian Fan, Xin Yu, XunMei Liu, Zhi Zhang","submitted_at":"2025-09-30T19:10:35Z","abstract_excerpt":"Low-rank adaptation (LoRA) has become a widely used paradigm for parameter-efficient fine-tuning of large language models, yet its representational capacity often lags behind full fine-tuning. Within the context of LoRA, a key open question is how to obtain expressive low-rank adapters from over-parameterized spaces. We propose \\textit{PrunedLoRA}, a new framework that leverages structured pruning to obtain highly representative low-rank adapters from an over-parameterized initialization. Unlike prior approaches that impose a fixed low-rank budget, PrunedLoRA dynamically prunes less important "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00192","kind":"arxiv","version":3},"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/2510.00192/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-30T01:16:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+iGWnWF4lKvdgEZnPhiuYf/hyRoTdGza4Gu5VKKT8KtJnHCnPbEs3DUJH4M+11maQse9m3ZjHXY7zPi3jr6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:58:53.821285Z"},"content_sha256":"b3b86dc750ff4c2965263e92f1fa6c55fbae38f11c9e6a820906a3191c2e7b1e","schema_version":"1.0","event_id":"sha256:b3b86dc750ff4c2965263e92f1fa6c55fbae38f11c9e6a820906a3191c2e7b1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5547JMA64S6IC6LFMNRGDU55HR/bundle.json","state_url":"https://pith.science/pith/5547JMA64S6IC6LFMNRGDU55HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5547JMA64S6IC6LFMNRGDU55HR/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-04T19:58:53Z","links":{"resolver":"https://pith.science/pith/5547JMA64S6IC6LFMNRGDU55HR","bundle":"https://pith.science/pith/5547JMA64S6IC6LFMNRGDU55HR/bundle.json","state":"https://pith.science/pith/5547JMA64S6IC6LFMNRGDU55HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5547JMA64S6IC6LFMNRGDU55HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5547JMA64S6IC6LFMNRGDU55HR","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":"a1c88ff7424d23738ee33552768319761cec54e0405a38b3fcb04591a7651ce1","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T19:10:35Z","title_canon_sha256":"85a9c8a6eb86885897ee033a53f9b08123cb770cb294b78c6796661a66853cca"},"schema_version":"1.0","source":{"id":"2510.00192","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.00192","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"arxiv_version","alias_value":"2510.00192v3","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00192","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_12","alias_value":"5547JMA64S6I","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_16","alias_value":"5547JMA64S6IC6LF","created_at":"2026-07-30T01:16:17Z"},{"alias_kind":"pith_short_8","alias_value":"5547JMA6","created_at":"2026-07-30T01:16:17Z"}],"graph_snapshots":[{"event_id":"sha256:b3b86dc750ff4c2965263e92f1fa6c55fbae38f11c9e6a820906a3191c2e7b1e","target":"graph","created_at":"2026-07-30T01:16:17Z","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/2510.00192/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank adaptation (LoRA) has become a widely used paradigm for parameter-efficient fine-tuning of large language models, yet its representational capacity often lags behind full fine-tuning. Within the context of LoRA, a key open question is how to obtain expressive low-rank adapters from over-parameterized spaces. We propose \\textit{PrunedLoRA}, a new framework that leverages structured pruning to obtain highly representative low-rank adapters from an over-parameterized initialization. Unlike prior approaches that impose a fixed low-rank budget, PrunedLoRA dynamically prunes less important ","authors_text":"Cong Xie, Lingzhou Xue, Tiantian Fan, Xin Yu, XunMei Liu, Zhi Zhang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T19:10:35Z","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00192","kind":"arxiv","version":3},"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:c6c6814a8bd38b8be2152e41beab6644df756573bd24f5c3ca5fc4f1db494cf3","target":"record","created_at":"2026-07-30T01:16:17Z","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":"a1c88ff7424d23738ee33552768319761cec54e0405a38b3fcb04591a7651ce1","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T19:10:35Z","title_canon_sha256":"85a9c8a6eb86885897ee033a53f9b08123cb770cb294b78c6796661a66853cca"},"schema_version":"1.0","source":{"id":"2510.00192","kind":"arxiv","version":3}},"canonical_sha256":"ef79f4b01ee4bc817965636261d3bd3c5c8783cc2006ab7857e869bf2305e665","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef79f4b01ee4bc817965636261d3bd3c5c8783cc2006ab7857e869bf2305e665","first_computed_at":"2026-07-30T01:16:17.127756Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:16:17.127756Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2510.00192","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6c6814a8bd38b8be2152e41beab6644df756573bd24f5c3ca5fc4f1db494cf3","sha256:b3b86dc750ff4c2965263e92f1fa6c55fbae38f11c9e6a820906a3191c2e7b1e"],"state_sha256":"156bb17410584faf178482ef9feccc6e34b6c3880afc7e87a63f97f80ee567d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8TrUBQVov2vPZd0zXLNb+ioBx+hvGqR+azxqUHW0Sartf97XQIEBII1d/wLdP0WAoiDpg4Vhrs/30aSEaKrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:58:53.827631Z","bundle_sha256":"445d6dc0070937c951cc78500ee41e36527f380eaeac43a8802f977e5f311498"}}