AI & ML
Retrieve-then-Disambiguate: Scalable Reviewer Discovery
arXiv cs.IR0 views
arXiv:2610.40768v1 Announce Type: new Abstract: The growing number of scientific submissions is straining the peer review process, while a large pool of relevant researchers remains unidentified and is therefore not considered as potential reviewers. We formulate the discovery of these researchers as a retrieval problem: given a submission, we retrieve and rank researchers based on domain similarity. We present retrieve-then-disambiguate, an open-source algorithm that identifies domain relevant researchers for a query submission by retrieving similar publications from the scientific literature and resolving ambiguous author names into unique researcher identities. We evaluate the algorithm on 500 astronomy and physics publications. We use ORCID-linked first authors, coauthors, and cited researchers as proxy labels to evaluate the recovery of researchers with known connections to each query publication. When retrieving the top 500 most similar papers, the algorithm recovers roughly 68\% of first authors, 60\% of coauthors, and 45\% of cited researchers. Our code is available at https://github.com/deepthought-initiative/Retrieve-then-Disambiguate.
Source:https://arxiv.org/abs/2610.40768PreviousExplain, Then Forget: Recommendation Unlearning under Asymmetric Access ConstraintNextProdCrawl: A Replayable Test Collection for Focused Crawling
Related posts
WARN Act and Child Support — What Happens to Support Payments After a Layoff Notice
0dev.to Data
1,084 Mercado Libre Cards Told Me How Many Were Sold. Between Them They Used Ten Numbers
0dev.to Data
Three traps when an AI assistant reads insider trades from Form 4s
0dev.to Data
OpenAI's Images 2.6 Brings GIF Creation and Faster Editing to ChatGPT
0dev.to News
Nothing Teases Its First AI-Native Device: A Screen-Free Gadget Coming in December
0dev.to News
NVIDIA Crashed 9.3%. Is the AI Data-Center Boom Starting to Crack?
0dev.to News