{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:62YEEZGCMIQPNVVTK36YOTY2YJ","short_pith_number":"pith:62YEEZGC","schema_version":"1.0","canonical_sha256":"f6b04264c26220f6d6b356fd874f1ac24b5382775d2711158e73dc8fb4a2eca8","source":{"kind":"arxiv","id":"2106.04647","version":2},"attestation_state":"computed","paper":{"title":"Compacter: Efficient Low-Rank Hypercomplex Adapter Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"James Henderson, Rabeeh Karimi Mahabadi, Sebastian Ruder","submitted_at":"2021-06-08T19:17:04Z","abstract_excerpt":"Adapting large-scale pretrained language models to downstream tasks via fine-tuning is the standard method for achieving state-of-the-art performance on NLP benchmarks. However, fine-tuning all weights of models with millions or billions of parameters is sample-inefficient, unstable in low-resource settings, and wasteful as it requires storing a separate copy of the model for each task. Recent work has developed parameter-efficient fine-tuning methods, but these approaches either still require a relatively large number of parameters or underperform standard fine-tuning. In this work, we propos"},"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":"2106.04647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-06-08T19:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"7ffe2b3e9a6da430a95ec1c7dd5acb2886154d552277f0ad75b0ba7fd7f8bc22","abstract_canon_sha256":"625cc6493669ac7288ec019db17198bae04eaaa7229de966160663b4cf58f65d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:29.215026Z","signature_b64":"+cKYH+ZrqMdEEvwS5fzsPXmZiQ3o7ga4XM1KWO8swkcJGSHCp3F4TW6qM13Ssj/6k5TJiwMgOd2QArUc5PBkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6b04264c26220f6d6b356fd874f1ac24b5382775d2711158e73dc8fb4a2eca8","last_reissued_at":"2026-07-05T03:35:29.214623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:29.214623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compacter: Efficient Low-Rank Hypercomplex Adapter Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"James Henderson, Rabeeh Karimi Mahabadi, Sebastian Ruder","submitted_at":"2021-06-08T19:17:04Z","abstract_excerpt":"Adapting large-scale pretrained language models to downstream tasks via fine-tuning is the standard method for achieving state-of-the-art performance on NLP benchmarks. However, fine-tuning all weights of models with millions or billions of parameters is sample-inefficient, unstable in low-resource settings, and wasteful as it requires storing a separate copy of the model for each task. Recent work has developed parameter-efficient fine-tuning methods, but these approaches either still require a relatively large number of parameters or underperform standard fine-tuning. In this work, we propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04647","kind":"arxiv","version":2},"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/2106.04647/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":"2106.04647","created_at":"2026-07-05T03:35:29.214680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04647v2","created_at":"2026-07-05T03:35:29.214680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04647","created_at":"2026-07-05T03:35:29.214680+00:00"},{"alias_kind":"pith_short_12","alias_value":"62YEEZGCMIQP","created_at":"2026-07-05T03:35:29.214680+00:00"},{"alias_kind":"pith_short_16","alias_value":"62YEEZGCMIQPNVVT","created_at":"2026-07-05T03:35:29.214680+00:00"},{"alias_kind":"pith_short_8","alias_value":"62YEEZGC","created_at":"2026-07-05T03:35:29.214680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14055","citing_title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ","json":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ.json","graph_json":"https://pith.science/api/pith-number/62YEEZGCMIQPNVVTK36YOTY2YJ/graph.json","events_json":"https://pith.science/api/pith-number/62YEEZGCMIQPNVVTK36YOTY2YJ/events.json","paper":"https://pith.science/paper/62YEEZGC"},"agent_actions":{"view_html":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ","download_json":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ.json","view_paper":"https://pith.science/paper/62YEEZGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04647&json=true","fetch_graph":"https://pith.science/api/pith-number/62YEEZGCMIQPNVVTK36YOTY2YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/62YEEZGCMIQPNVVTK36YOTY2YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ/action/storage_attestation","attest_author":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ/action/author_attestation","sign_citation":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ/action/citation_signature","submit_replication":"https://pith.science/pith/62YEEZGCMIQPNVVTK36YOTY2YJ/action/replication_record"}},"created_at":"2026-07-05T03:35:29.214680+00:00","updated_at":"2026-07-05T03:35:29.214680+00:00"}