{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TG4OYIY4W2CDG4YLEGGBT37UOP","short_pith_number":"pith:TG4OYIY4","schema_version":"1.0","canonical_sha256":"99b8ec231cb68433730b218c19eff473d4a18091ea19ccb9a2b31f5b4a8030ae","source":{"kind":"arxiv","id":"2306.09910","version":4},"attestation_state":"computed","paper":{"title":"LabelBench: A Comprehensive Framework for Benchmarking Adaptive Label-Efficient Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Arnav M. Das, Gantavya Bhatt, Gregory Canal, Jeffrey Bilmes, Jifan Zhang, Kevin Jamieson, Robert D Nowak, Simon Shaolei Du, Stephen Mussmann, Yifang Chen, Yinglun Zhu","submitted_at":"2023-06-16T15:36:49Z","abstract_excerpt":"Labeled data are critical to modern machine learning applications, but obtaining labels can be expensive. To mitigate this cost, machine learning methods, such as transfer learning, semi-supervised learning and active learning, aim to be label-efficient: achieving high predictive performance from relatively few labeled examples. While obtaining the best label-efficiency in practice often requires combinations of these techniques, existing benchmark and evaluation frameworks do not capture a concerted combination of all such techniques. This paper addresses this deficiency by introducing LabelB"},"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":"2306.09910","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-16T15:36:49Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"83b51ed67ca608e0c81b861b5307000d1604019b29162c2a56f22405e71000b2","abstract_canon_sha256":"1b493d17795c4d0a6ba8247edc62c75024c2812fbd7c2ed5e8c4642a14e5305b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:09.498999Z","signature_b64":"r7zpBYantinNa0Wl5ijH72NAAqBE3iMGHtf3sr+5th4Ofp6ABX3s13LV1XtsCueC30PSrYAkkFWeO00095pFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b8ec231cb68433730b218c19eff473d4a18091ea19ccb9a2b31f5b4a8030ae","last_reissued_at":"2026-07-05T07:51:09.498483Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:09.498483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LabelBench: A Comprehensive Framework for Benchmarking Adaptive Label-Efficient Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Arnav M. Das, Gantavya Bhatt, Gregory Canal, Jeffrey Bilmes, Jifan Zhang, Kevin Jamieson, Robert D Nowak, Simon Shaolei Du, Stephen Mussmann, Yifang Chen, Yinglun Zhu","submitted_at":"2023-06-16T15:36:49Z","abstract_excerpt":"Labeled data are critical to modern machine learning applications, but obtaining labels can be expensive. To mitigate this cost, machine learning methods, such as transfer learning, semi-supervised learning and active learning, aim to be label-efficient: achieving high predictive performance from relatively few labeled examples. While obtaining the best label-efficiency in practice often requires combinations of these techniques, existing benchmark and evaluation frameworks do not capture a concerted combination of all such techniques. This paper addresses this deficiency by introducing LabelB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09910","kind":"arxiv","version":4},"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/2306.09910/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":"2306.09910","created_at":"2026-07-05T07:51:09.498550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.09910v4","created_at":"2026-07-05T07:51:09.498550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09910","created_at":"2026-07-05T07:51:09.498550+00:00"},{"alias_kind":"pith_short_12","alias_value":"TG4OYIY4W2CD","created_at":"2026-07-05T07:51:09.498550+00:00"},{"alias_kind":"pith_short_16","alias_value":"TG4OYIY4W2CDG4YL","created_at":"2026-07-05T07:51:09.498550+00:00"},{"alias_kind":"pith_short_8","alias_value":"TG4OYIY4","created_at":"2026-07-05T07:51:09.498550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07630","citing_title":"Active Learning with Foundation Model Priors: Efficient Learning under Class Imbalance","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10075","citing_title":"Active Testing of Large Language Models via Approximate Neyman Allocation","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10075","citing_title":"Active Testing of Large Language Models via Approximate Neyman Allocation","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP","json":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP.json","graph_json":"https://pith.science/api/pith-number/TG4OYIY4W2CDG4YLEGGBT37UOP/graph.json","events_json":"https://pith.science/api/pith-number/TG4OYIY4W2CDG4YLEGGBT37UOP/events.json","paper":"https://pith.science/paper/TG4OYIY4"},"agent_actions":{"view_html":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP","download_json":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP.json","view_paper":"https://pith.science/paper/TG4OYIY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.09910&json=true","fetch_graph":"https://pith.science/api/pith-number/TG4OYIY4W2CDG4YLEGGBT37UOP/graph.json","fetch_events":"https://pith.science/api/pith-number/TG4OYIY4W2CDG4YLEGGBT37UOP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP/action/storage_attestation","attest_author":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP/action/author_attestation","sign_citation":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP/action/citation_signature","submit_replication":"https://pith.science/pith/TG4OYIY4W2CDG4YLEGGBT37UOP/action/replication_record"}},"created_at":"2026-07-05T07:51:09.498550+00:00","updated_at":"2026-07-05T07:51:09.498550+00:00"}