{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B7RVI3QGZ6D33MNZO33A5ZFE2H","short_pith_number":"pith:B7RVI3QG","schema_version":"1.0","canonical_sha256":"0fe3546e06cf87bdb1b976f60ee4a4d1e7d3043c1fe97c60040b50e12711432f","source":{"kind":"arxiv","id":"2409.05997","version":1},"attestation_state":"computed","paper":{"title":"TransformerRanker: A Tool for Efficiently Finding the Best-Suited Language Models for Downstream Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alan Akbik, Lukas Garbas, Max Ploner","submitted_at":"2024-09-09T18:47:00Z","abstract_excerpt":"Classification tasks in NLP are typically addressed by selecting a pre-trained language model (PLM) from a model hub, and fine-tuning it for the task at hand. However, given the very large number of PLMs that are currently available, a practical challenge is to determine which of them will perform best for a specific downstream task. With this paper, we introduce TransformerRanker, a lightweight library that efficiently ranks PLMs for classification tasks without the need for computationally costly fine-tuning. Our library implements current approaches for transferability estimation (LogME, H-"},"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":"2409.05997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-09T18:47:00Z","cross_cats_sorted":[],"title_canon_sha256":"bdf10bbc023a942fde9ab7b680c18957382c4ca4ff57846d84e848ef857d1c15","abstract_canon_sha256":"c56765d30467f48006e3a06ac507b097001d4e7e62683ddb3d02d73702b5f9b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:00.704125Z","signature_b64":"LJHXMn6Q7X0VYqj8a2uyq1A/DbWNp+1F0ifSu1Beyhb0OijyQC/i8cyafz7hjomjVU8Ihe+CA/vdp/+oDfISBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe3546e06cf87bdb1b976f60ee4a4d1e7d3043c1fe97c60040b50e12711432f","last_reissued_at":"2026-07-05T09:05:00.703612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:00.703612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TransformerRanker: A Tool for Efficiently Finding the Best-Suited Language Models for Downstream Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alan Akbik, Lukas Garbas, Max Ploner","submitted_at":"2024-09-09T18:47:00Z","abstract_excerpt":"Classification tasks in NLP are typically addressed by selecting a pre-trained language model (PLM) from a model hub, and fine-tuning it for the task at hand. However, given the very large number of PLMs that are currently available, a practical challenge is to determine which of them will perform best for a specific downstream task. With this paper, we introduce TransformerRanker, a lightweight library that efficiently ranks PLMs for classification tasks without the need for computationally costly fine-tuning. Our library implements current approaches for transferability estimation (LogME, H-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05997","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/2409.05997/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":"2409.05997","created_at":"2026-07-05T09:05:00.703680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05997v1","created_at":"2026-07-05T09:05:00.703680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05997","created_at":"2026-07-05T09:05:00.703680+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7RVI3QGZ6D3","created_at":"2026-07-05T09:05:00.703680+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7RVI3QGZ6D33MNZ","created_at":"2026-07-05T09:05:00.703680+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7RVI3QG","created_at":"2026-07-05T09:05:00.703680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11020","citing_title":"Extracting Knowledge Graphs from User Stories using LangChain","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H","json":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H.json","graph_json":"https://pith.science/api/pith-number/B7RVI3QGZ6D33MNZO33A5ZFE2H/graph.json","events_json":"https://pith.science/api/pith-number/B7RVI3QGZ6D33MNZO33A5ZFE2H/events.json","paper":"https://pith.science/paper/B7RVI3QG"},"agent_actions":{"view_html":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H","download_json":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H.json","view_paper":"https://pith.science/paper/B7RVI3QG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05997&json=true","fetch_graph":"https://pith.science/api/pith-number/B7RVI3QGZ6D33MNZO33A5ZFE2H/graph.json","fetch_events":"https://pith.science/api/pith-number/B7RVI3QGZ6D33MNZO33A5ZFE2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H/action/storage_attestation","attest_author":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H/action/author_attestation","sign_citation":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H/action/citation_signature","submit_replication":"https://pith.science/pith/B7RVI3QGZ6D33MNZO33A5ZFE2H/action/replication_record"}},"created_at":"2026-07-05T09:05:00.703680+00:00","updated_at":"2026-07-05T09:05:00.703680+00:00"}