{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UNDZBOOOK5QUMARKQDCZ6VHZS5","short_pith_number":"pith:UNDZBOOO","canonical_record":{"source":{"id":"2507.00327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-30T23:54:23Z","cross_cats_sorted":[],"title_canon_sha256":"9eca87f5ee99e09aff998d78012ee48b549e5ed79cf99b3d224ecaae3118be04","abstract_canon_sha256":"30276f7d0df65480b2ebeea6aed18d906c0c22b3a24f42dfa577f3494cbdcac9"},"schema_version":"1.0"},"canonical_sha256":"a34790b9ce576146022a80c59f54f997608612afc40cdce052283a18f513d057","source":{"kind":"arxiv","id":"2507.00327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00327","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00327v1","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00327","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_12","alias_value":"UNDZBOOOK5QU","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_16","alias_value":"UNDZBOOOK5QUMARK","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_8","alias_value":"UNDZBOOO","created_at":"2026-07-05T11:30:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UNDZBOOOK5QUMARKQDCZ6VHZS5","target":"record","payload":{"canonical_record":{"source":{"id":"2507.00327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-30T23:54:23Z","cross_cats_sorted":[],"title_canon_sha256":"9eca87f5ee99e09aff998d78012ee48b549e5ed79cf99b3d224ecaae3118be04","abstract_canon_sha256":"30276f7d0df65480b2ebeea6aed18d906c0c22b3a24f42dfa577f3494cbdcac9"},"schema_version":"1.0"},"canonical_sha256":"a34790b9ce576146022a80c59f54f997608612afc40cdce052283a18f513d057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:06.274358Z","signature_b64":"N/E7EOJsxButQ4u+dGE0fydmGNSWy4JY2vOn0oxaI7UT7u5wnLXva7RFCdjnXFU3hz/c+2pJq9o83AgBHolkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34790b9ce576146022a80c59f54f997608612afc40cdce052283a18f513d057","last_reissued_at":"2026-07-05T11:30:06.273871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:06.273871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.00327","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-05T11:30:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqpE4CzcJMkSvnxgzCr1X4CeGnwBjwW7KO0jyz36lkXfzhfB1Hh7qQVqheyuUkKZC19pIo8Gavb0OWwByNusCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:38:59.175414Z"},"content_sha256":"8e2ee630aa43dbbca9bbd7374bbf9c1d3ab223fc63576a386691170e683dd4de","schema_version":"1.0","event_id":"sha256:8e2ee630aa43dbbca9bbd7374bbf9c1d3ab223fc63576a386691170e683dd4de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UNDZBOOOK5QUMARKQDCZ6VHZS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond Low-Rank Tuning: Model Prior-Guided Rank Allocation for Effective Transfer in Low-Data and Large-Gap Regimes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chuyan Zhang, Kefan Wang, Yun Gu","submitted_at":"2025-06-30T23:54:23Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) has proven effective in reducing computational costs while maintaining performance comparable to fully fine-tuned foundation models across various tasks. However, its fixed low-rank structure restricts its adaptability in scenarios with substantial domain gaps, where higher ranks are often required to capture domain-specific complexities. Current adaptive LoRA methods attempt to overcome this limitation by dynamically expanding or selectively allocating ranks, but these approaches frequently depend on computationally intensive techniques such as iterative pruning, ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00327","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/2507.00327/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-05T11:30:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5igSt6nhuZRkkj7Ztret1bgRRAy3DDQumc6LQuYJrp1fY4uphcb+cN9plo8KjqYas7PKMiVtF8i3eToMddzBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:38:59.175834Z"},"content_sha256":"240876f92284b3b08e512dfde429641d525f3246190feefed0efae3dfd0a93a1","schema_version":"1.0","event_id":"sha256:240876f92284b3b08e512dfde429641d525f3246190feefed0efae3dfd0a93a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/bundle.json","state_url":"https://pith.science/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/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-05T18:38:59Z","links":{"resolver":"https://pith.science/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5","bundle":"https://pith.science/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/bundle.json","state":"https://pith.science/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNDZBOOOK5QUMARKQDCZ6VHZS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UNDZBOOOK5QUMARKQDCZ6VHZS5","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":"30276f7d0df65480b2ebeea6aed18d906c0c22b3a24f42dfa577f3494cbdcac9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-30T23:54:23Z","title_canon_sha256":"9eca87f5ee99e09aff998d78012ee48b549e5ed79cf99b3d224ecaae3118be04"},"schema_version":"1.0","source":{"id":"2507.00327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00327","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00327v1","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00327","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_12","alias_value":"UNDZBOOOK5QU","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_16","alias_value":"UNDZBOOOK5QUMARK","created_at":"2026-07-05T11:30:06Z"},{"alias_kind":"pith_short_8","alias_value":"UNDZBOOO","created_at":"2026-07-05T11:30:06Z"}],"graph_snapshots":[{"event_id":"sha256:240876f92284b3b08e512dfde429641d525f3246190feefed0efae3dfd0a93a1","target":"graph","created_at":"2026-07-05T11:30:06Z","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/2507.00327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-Rank Adaptation (LoRA) has proven effective in reducing computational costs while maintaining performance comparable to fully fine-tuned foundation models across various tasks. However, its fixed low-rank structure restricts its adaptability in scenarios with substantial domain gaps, where higher ranks are often required to capture domain-specific complexities. Current adaptive LoRA methods attempt to overcome this limitation by dynamically expanding or selectively allocating ranks, but these approaches frequently depend on computationally intensive techniques such as iterative pruning, ra","authors_text":"Chuyan Zhang, Kefan Wang, Yun Gu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-30T23:54:23Z","title":"Beyond Low-Rank Tuning: Model Prior-Guided Rank Allocation for Effective Transfer in Low-Data and Large-Gap Regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00327","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:8e2ee630aa43dbbca9bbd7374bbf9c1d3ab223fc63576a386691170e683dd4de","target":"record","created_at":"2026-07-05T11:30:06Z","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":"30276f7d0df65480b2ebeea6aed18d906c0c22b3a24f42dfa577f3494cbdcac9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-06-30T23:54:23Z","title_canon_sha256":"9eca87f5ee99e09aff998d78012ee48b549e5ed79cf99b3d224ecaae3118be04"},"schema_version":"1.0","source":{"id":"2507.00327","kind":"arxiv","version":1}},"canonical_sha256":"a34790b9ce576146022a80c59f54f997608612afc40cdce052283a18f513d057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a34790b9ce576146022a80c59f54f997608612afc40cdce052283a18f513d057","first_computed_at":"2026-07-05T11:30:06.273871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:06.273871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/E7EOJsxButQ4u+dGE0fydmGNSWy4JY2vOn0oxaI7UT7u5wnLXva7RFCdjnXFU3hz/c+2pJq9o83AgBHolkAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:06.274358Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.00327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e2ee630aa43dbbca9bbd7374bbf9c1d3ab223fc63576a386691170e683dd4de","sha256:240876f92284b3b08e512dfde429641d525f3246190feefed0efae3dfd0a93a1"],"state_sha256":"81f3e8457bf78a3a9067a930c2ac0f624ac0fbfe1236e3b0ded519d553b400f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UY3ffS7Gzw2z+DUQLpMADz1nwsTAkHar3XpACXGgNo6ly8v8w0u0773KpouQ9AECjXvWAo9QEzN5411PjzHiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:38:59.178648Z","bundle_sha256":"b296ac67a8579a3b98f7a79aee6413ef2b8224c5d8dac7a9165eecd1a9b7ae3d"}}