{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G42FNQBZXUEXHLFLX36MKO7XOC","short_pith_number":"pith:G42FNQBZ","schema_version":"1.0","canonical_sha256":"373456c039bd0973acabbefcc53bf77088efa719561ae6007aaaa0ca31dfea1f","source":{"kind":"arxiv","id":"2404.05623","version":2},"attestation_state":"computed","paper":{"title":"AnchorAL: Computationally Efficient Active Learning for Large and Imbalanced Datasets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Andreas Vlachos, Pietro Lesci","submitted_at":"2024-04-08T15:53:46Z","abstract_excerpt":"Active learning for imbalanced classification tasks is challenging as the minority classes naturally occur rarely. Gathering a large pool of unlabelled data is thus essential to capture minority instances. Standard pool-based active learning is computationally expensive on large pools and often reaches low accuracy by overfitting the initial decision boundary, thus failing to explore the input space and find minority instances. To address these issues we propose AnchorAL. At each iteration, AnchorAL chooses class-specific instances from the labelled set, or anchors, and retrieves the most simi"},"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":"2404.05623","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-08T15:53:46Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6b4c3618a679461efcd141899354f82ee21c67f2bc122e9b15cd0ca6af91e6df","abstract_canon_sha256":"4f52205c0be10a4e2e65d3fd80078c62a65b54e978bb2e8b07832c2dc60b3e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:03.535471Z","signature_b64":"DSHUAdJ+8Y53nensR9BDAFXi4cgx8l9aShA3RtqAy9BNRGwKI3c5kvddhqDSwkSYLLDMx2NHVmyk8nQXwie+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"373456c039bd0973acabbefcc53bf77088efa719561ae6007aaaa0ca31dfea1f","last_reissued_at":"2026-07-05T09:21:03.534838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:03.534838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AnchorAL: Computationally Efficient Active Learning for Large and Imbalanced Datasets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Andreas Vlachos, Pietro Lesci","submitted_at":"2024-04-08T15:53:46Z","abstract_excerpt":"Active learning for imbalanced classification tasks is challenging as the minority classes naturally occur rarely. Gathering a large pool of unlabelled data is thus essential to capture minority instances. Standard pool-based active learning is computationally expensive on large pools and often reaches low accuracy by overfitting the initial decision boundary, thus failing to explore the input space and find minority instances. To address these issues we propose AnchorAL. At each iteration, AnchorAL chooses class-specific instances from the labelled set, or anchors, and retrieves the most simi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05623","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/2404.05623/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":"2404.05623","created_at":"2026-07-05T09:21:03.534910+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05623v2","created_at":"2026-07-05T09:21:03.534910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05623","created_at":"2026-07-05T09:21:03.534910+00:00"},{"alias_kind":"pith_short_12","alias_value":"G42FNQBZXUEX","created_at":"2026-07-05T09:21:03.534910+00:00"},{"alias_kind":"pith_short_16","alias_value":"G42FNQBZXUEXHLFL","created_at":"2026-07-05T09:21:03.534910+00:00"},{"alias_kind":"pith_short_8","alias_value":"G42FNQBZ","created_at":"2026-07-05T09:21:03.534910+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.03292","citing_title":"ALPET: Active Few-shot Learning for Citation Worthiness Detection in Low-Resource Wikipedia Languages","ref_index":95,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC","json":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC.json","graph_json":"https://pith.science/api/pith-number/G42FNQBZXUEXHLFLX36MKO7XOC/graph.json","events_json":"https://pith.science/api/pith-number/G42FNQBZXUEXHLFLX36MKO7XOC/events.json","paper":"https://pith.science/paper/G42FNQBZ"},"agent_actions":{"view_html":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC","download_json":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC.json","view_paper":"https://pith.science/paper/G42FNQBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05623&json=true","fetch_graph":"https://pith.science/api/pith-number/G42FNQBZXUEXHLFLX36MKO7XOC/graph.json","fetch_events":"https://pith.science/api/pith-number/G42FNQBZXUEXHLFLX36MKO7XOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC/action/storage_attestation","attest_author":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC/action/author_attestation","sign_citation":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC/action/citation_signature","submit_replication":"https://pith.science/pith/G42FNQBZXUEXHLFLX36MKO7XOC/action/replication_record"}},"created_at":"2026-07-05T09:21:03.534910+00:00","updated_at":"2026-07-05T09:21:03.534910+00:00"}