{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VPUZBJOWWMK4HBNY4UG5DSF4ED","short_pith_number":"pith:VPUZBJOW","schema_version":"1.0","canonical_sha256":"abe990a5d6b315c385b8e50dd1c8bc20d67e3442053444c38288254db16d71a4","source":{"kind":"arxiv","id":"2407.19342","version":4},"attestation_state":"computed","paper":{"title":"Parameter-Efficient Fine-Tuning via Circular Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Fugee Tsung, Jia Li, Jiashun Cheng, Yu Li, Zijing Liu, Ziqi Gao","submitted_at":"2024-07-27T21:12:46Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) has gained popularity for fine-tuning large foundation models, leveraging low-rank matrices $\\mathbf{A}$ and $\\mathbf{B}$ to represent weight changes (i.e., $\\Delta \\mathbf{W} = \\mathbf{B} \\mathbf{A}$). This method reduces trainable parameters and mitigates heavy memory consumption associated with full delta matrices by sequentially multiplying $\\mathbf{A}$ and $\\mathbf{B}$ with the activation. Despite its success, the intrinsic low-rank characteristic may limit its performance. Although several variants have been proposed to address this issue, they often overlook t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.19342","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-27T21:12:46Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"133fc91ba4424c79b475d7689694d879cfbedce43b72479794c8eab05e7f78b3","abstract_canon_sha256":"421b784d44ef371c14a4b31a56bb3c6a714026141b66bbc0857db3fb2b065f4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:49.012953Z","signature_b64":"jRJyLoqewu2o7dad0XHMFRmJg7LQkrOWYwQqqA0saX8lsWv2VTWm/krmBLfyhmt9DZ0Flgvgy0f0GLEDMr3HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe990a5d6b315c385b8e50dd1c8bc20d67e3442053444c38288254db16d71a4","last_reissued_at":"2026-07-05T11:29:49.012446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:49.012446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter-Efficient Fine-Tuning via Circular Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Fugee Tsung, Jia Li, Jiashun Cheng, Yu Li, Zijing Liu, Ziqi Gao","submitted_at":"2024-07-27T21:12:46Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) has gained popularity for fine-tuning large foundation models, leveraging low-rank matrices $\\mathbf{A}$ and $\\mathbf{B}$ to represent weight changes (i.e., $\\Delta \\mathbf{W} = \\mathbf{B} \\mathbf{A}$). This method reduces trainable parameters and mitigates heavy memory consumption associated with full delta matrices by sequentially multiplying $\\mathbf{A}$ and $\\mathbf{B}$ with the activation. Despite its success, the intrinsic low-rank characteristic may limit its performance. Although several variants have been proposed to address this issue, they often overlook t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.19342","kind":"arxiv","version":4},"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/2407.19342/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.19342","created_at":"2026-07-05T11:29:49.012508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.19342v4","created_at":"2026-07-05T11:29:49.012508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.19342","created_at":"2026-07-05T11:29:49.012508+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPUZBJOWWMK4","created_at":"2026-07-05T11:29:49.012508+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPUZBJOWWMK4HBNY","created_at":"2026-07-05T11:29:49.012508+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPUZBJOW","created_at":"2026-07-05T11:29:49.012508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16787","citing_title":"Revisiting LoRA through the Lens of Parameter Redundancy: Spectral Encoding Helps","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED","json":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED.json","graph_json":"https://pith.science/api/pith-number/VPUZBJOWWMK4HBNY4UG5DSF4ED/graph.json","events_json":"https://pith.science/api/pith-number/VPUZBJOWWMK4HBNY4UG5DSF4ED/events.json","paper":"https://pith.science/paper/VPUZBJOW"},"agent_actions":{"view_html":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED","download_json":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED.json","view_paper":"https://pith.science/paper/VPUZBJOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.19342&json=true","fetch_graph":"https://pith.science/api/pith-number/VPUZBJOWWMK4HBNY4UG5DSF4ED/graph.json","fetch_events":"https://pith.science/api/pith-number/VPUZBJOWWMK4HBNY4UG5DSF4ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED/action/storage_attestation","attest_author":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED/action/author_attestation","sign_citation":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED/action/citation_signature","submit_replication":"https://pith.science/pith/VPUZBJOWWMK4HBNY4UG5DSF4ED/action/replication_record"}},"created_at":"2026-07-05T11:29:49.012508+00:00","updated_at":"2026-07-05T11:29:49.012508+00:00"}