{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BALOIIPVGZBDOOLEJEVY3SQIIE","short_pith_number":"pith:BALOIIPV","schema_version":"1.0","canonical_sha256":"0816e421f53642373964492b8dca084112a91bba43eb9cdd1d502841f854d6f1","source":{"kind":"arxiv","id":"2305.16742","version":1},"attestation_state":"computed","paper":{"title":"Parameter-Efficient Fine-Tuning without Introducing New Latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Baohao Liao, Christof Monz, Yan Meng","submitted_at":"2023-05-26T08:44:42Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) of pre-trained language models has recently demonstrated remarkable achievements, effectively matching the performance of full fine-tuning while utilizing significantly fewer trainable parameters, and consequently addressing the storage and communication constraints. Nonetheless, various PEFT methods are limited by their inherent characteristics. In the case of sparse fine-tuning, which involves modifying only a small subset of the existing parameters, the selection of fine-tuned parameters is task- and domain-specific, making it unsuitable for federated "},"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":"2305.16742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-05-26T08:44:42Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ef42a264b4103133567a478d3d006da9f8d54ababd399315386190927c6405b3","abstract_canon_sha256":"d08d4660e27bfbc6cb347dadf2c27d1b52e51d8dc9608ef9989269a4ac819891"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:17.037995Z","signature_b64":"/lGAnXNmXQA4mOOvMO65KnMe5oR3LGf4Xay8vVdfyOBLX4XrrnBckESkNoI02pJ9SnorLtZJGl7feKNt1bmXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0816e421f53642373964492b8dca084112a91bba43eb9cdd1d502841f854d6f1","last_reissued_at":"2026-07-05T06:14:17.037569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:17.037569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter-Efficient Fine-Tuning without Introducing New Latency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Baohao Liao, Christof Monz, Yan Meng","submitted_at":"2023-05-26T08:44:42Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) of pre-trained language models has recently demonstrated remarkable achievements, effectively matching the performance of full fine-tuning while utilizing significantly fewer trainable parameters, and consequently addressing the storage and communication constraints. Nonetheless, various PEFT methods are limited by their inherent characteristics. In the case of sparse fine-tuning, which involves modifying only a small subset of the existing parameters, the selection of fine-tuned parameters is task- and domain-specific, making it unsuitable for federated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16742","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/2305.16742/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":"2305.16742","created_at":"2026-07-05T06:14:17.037620+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16742v1","created_at":"2026-07-05T06:14:17.037620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16742","created_at":"2026-07-05T06:14:17.037620+00:00"},{"alias_kind":"pith_short_12","alias_value":"BALOIIPVGZBD","created_at":"2026-07-05T06:14:17.037620+00:00"},{"alias_kind":"pith_short_16","alias_value":"BALOIIPVGZBDOOLE","created_at":"2026-07-05T06:14:17.037620+00:00"},{"alias_kind":"pith_short_8","alias_value":"BALOIIPV","created_at":"2026-07-05T06:14:17.037620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE","json":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE.json","graph_json":"https://pith.science/api/pith-number/BALOIIPVGZBDOOLEJEVY3SQIIE/graph.json","events_json":"https://pith.science/api/pith-number/BALOIIPVGZBDOOLEJEVY3SQIIE/events.json","paper":"https://pith.science/paper/BALOIIPV"},"agent_actions":{"view_html":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE","download_json":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE.json","view_paper":"https://pith.science/paper/BALOIIPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16742&json=true","fetch_graph":"https://pith.science/api/pith-number/BALOIIPVGZBDOOLEJEVY3SQIIE/graph.json","fetch_events":"https://pith.science/api/pith-number/BALOIIPVGZBDOOLEJEVY3SQIIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE/action/storage_attestation","attest_author":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE/action/author_attestation","sign_citation":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE/action/citation_signature","submit_replication":"https://pith.science/pith/BALOIIPVGZBDOOLEJEVY3SQIIE/action/replication_record"}},"created_at":"2026-07-05T06:14:17.037620+00:00","updated_at":"2026-07-05T06:14:17.037620+00:00"}