{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MLCMV4UJBND7IZSRRHGPUFV52O","short_pith_number":"pith:MLCMV4UJ","schema_version":"1.0","canonical_sha256":"62c4caf2890b47f4665189ccfa16bdd3a9730cd277b67662950d51f46bfaacf9","source":{"kind":"arxiv","id":"2211.10155","version":3},"attestation_state":"computed","paper":{"title":"Structured Pruning Adapters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Alexandros Iosifidis, Aman Alok, Juby Jose, Lukas Hedegaard","submitted_at":"2022-11-17T09:03:25Z","abstract_excerpt":"Adapters are a parameter-efficient alternative to fine-tuning, which augment a frozen base network to learn new tasks. Yet, the inference of the adapted model is often slower than the corresponding fine-tuned model. To improve on this, we propose Structured Pruning Adapters (SPAs), a family of compressing, task-switching network adapters, that accelerate and specialize networks using tiny parameter sets and structured pruning. Specifically, we propose a channel-based SPA and evaluate it with a suite of pruning methods on multiple computer vision benchmarks. Compared to regular structured pruni"},"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":"2211.10155","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2022-11-17T09:03:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7eb352a8c5a19d376c6f202566be800745028018486e8a16661530584fc87f20","abstract_canon_sha256":"d74bb489df43cd1b115996be5f21e2200596bcefce10ad6875266529999256e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:10.106018Z","signature_b64":"c2f4Y2ui8SkYs6jKVzITuadWMIgCxa5+/pwbqBO+B4HvY9w/035mZ9bzRNROvCIxXbVgY5JHzc5jW03gP8xuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c4caf2890b47f4665189ccfa16bdd3a9730cd277b67662950d51f46bfaacf9","last_reissued_at":"2026-07-05T05:38:10.105567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:10.105567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Pruning Adapters","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Alexandros Iosifidis, Aman Alok, Juby Jose, Lukas Hedegaard","submitted_at":"2022-11-17T09:03:25Z","abstract_excerpt":"Adapters are a parameter-efficient alternative to fine-tuning, which augment a frozen base network to learn new tasks. Yet, the inference of the adapted model is often slower than the corresponding fine-tuned model. To improve on this, we propose Structured Pruning Adapters (SPAs), a family of compressing, task-switching network adapters, that accelerate and specialize networks using tiny parameter sets and structured pruning. Specifically, we propose a channel-based SPA and evaluate it with a suite of pruning methods on multiple computer vision benchmarks. Compared to regular structured pruni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10155","kind":"arxiv","version":3},"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/2211.10155/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":"2211.10155","created_at":"2026-07-05T05:38:10.105635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10155v3","created_at":"2026-07-05T05:38:10.105635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10155","created_at":"2026-07-05T05:38:10.105635+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLCMV4UJBND7","created_at":"2026-07-05T05:38:10.105635+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLCMV4UJBND7IZSR","created_at":"2026-07-05T05:38:10.105635+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLCMV4UJ","created_at":"2026-07-05T05:38:10.105635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2303.16199","citing_title":"LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":119,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O","json":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O.json","graph_json":"https://pith.science/api/pith-number/MLCMV4UJBND7IZSRRHGPUFV52O/graph.json","events_json":"https://pith.science/api/pith-number/MLCMV4UJBND7IZSRRHGPUFV52O/events.json","paper":"https://pith.science/paper/MLCMV4UJ"},"agent_actions":{"view_html":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O","download_json":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O.json","view_paper":"https://pith.science/paper/MLCMV4UJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10155&json=true","fetch_graph":"https://pith.science/api/pith-number/MLCMV4UJBND7IZSRRHGPUFV52O/graph.json","fetch_events":"https://pith.science/api/pith-number/MLCMV4UJBND7IZSRRHGPUFV52O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O/action/storage_attestation","attest_author":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O/action/author_attestation","sign_citation":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O/action/citation_signature","submit_replication":"https://pith.science/pith/MLCMV4UJBND7IZSRRHGPUFV52O/action/replication_record"}},"created_at":"2026-07-05T05:38:10.105635+00:00","updated_at":"2026-07-05T05:38:10.105635+00:00"}