{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RJ7M6Q6YO2AAN3TKRWPOLB3OOU","short_pith_number":"pith:RJ7M6Q6Y","schema_version":"1.0","canonical_sha256":"8a7ecf43d8768006ee6a8d9ee5876e753dd41795ae0edd0ceb10fd2ae8a22b51","source":{"kind":"arxiv","id":"2110.07560","version":2},"attestation_state":"computed","paper":{"title":"Composable Sparse Fine-Tuning for Cross-Lingual Transfer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alan Ansell, Anna Korhonen, Edoardo Maria Ponti, Ivan Vuli\\'c","submitted_at":"2021-10-14T17:27:29Z","abstract_excerpt":"Fine-tuning the entire set of parameters of a large pretrained model has become the mainstream approach for transfer learning. To increase its efficiency and prevent catastrophic forgetting and interference, techniques like adapters and sparse fine-tuning have been developed. Adapters are modular, as they can be combined to adapt a model towards different facets of knowledge (e.g., dedicated language and/or task adapters). Sparse fine-tuning is expressive, as it controls the behavior of all model components. In this work, we introduce a new fine-tuning method with both these desirable properti"},"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":"2110.07560","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-10-14T17:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"965d057312a420dbf65047b9a93fcf21d97fc39816911d7951232363967c9ebf","abstract_canon_sha256":"fe7e3fbe950385c0fe158e35db209a41e88662d209aa587649ed6d45de9bb7fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:04.429156Z","signature_b64":"SDe96RFOzNLSTiOvOTUo2MemHdtLTJpsT2gORKciylbr15PTDb0ucLriq8X3Gk5tBBHRu5ZGbGOZp1koVDwfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a7ecf43d8768006ee6a8d9ee5876e753dd41795ae0edd0ceb10fd2ae8a22b51","last_reissued_at":"2026-07-05T05:40:04.428693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:04.428693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composable Sparse Fine-Tuning for Cross-Lingual Transfer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alan Ansell, Anna Korhonen, Edoardo Maria Ponti, Ivan Vuli\\'c","submitted_at":"2021-10-14T17:27:29Z","abstract_excerpt":"Fine-tuning the entire set of parameters of a large pretrained model has become the mainstream approach for transfer learning. To increase its efficiency and prevent catastrophic forgetting and interference, techniques like adapters and sparse fine-tuning have been developed. Adapters are modular, as they can be combined to adapt a model towards different facets of knowledge (e.g., dedicated language and/or task adapters). Sparse fine-tuning is expressive, as it controls the behavior of all model components. In this work, we introduce a new fine-tuning method with both these desirable properti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07560","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/2110.07560/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":"2110.07560","created_at":"2026-07-05T05:40:04.428749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07560v2","created_at":"2026-07-05T05:40:04.428749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07560","created_at":"2026-07-05T05:40:04.428749+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJ7M6Q6YO2AA","created_at":"2026-07-05T05:40:04.428749+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJ7M6Q6YO2AAN3TK","created_at":"2026-07-05T05:40:04.428749+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJ7M6Q6Y","created_at":"2026-07-05T05:40:04.428749+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":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU","json":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU.json","graph_json":"https://pith.science/api/pith-number/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/graph.json","events_json":"https://pith.science/api/pith-number/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/events.json","paper":"https://pith.science/paper/RJ7M6Q6Y"},"agent_actions":{"view_html":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU","download_json":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU.json","view_paper":"https://pith.science/paper/RJ7M6Q6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07560&json=true","fetch_graph":"https://pith.science/api/pith-number/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/graph.json","fetch_events":"https://pith.science/api/pith-number/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/action/storage_attestation","attest_author":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/action/author_attestation","sign_citation":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/action/citation_signature","submit_replication":"https://pith.science/pith/RJ7M6Q6YO2AAN3TKRWPOLB3OOU/action/replication_record"}},"created_at":"2026-07-05T05:40:04.428749+00:00","updated_at":"2026-07-05T05:40:04.428749+00:00"}