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
Finding New Drugs Is Laborious. This AI Startup Is Skipping The Lab Work
0Wired

Spotify is coming to United Airlines seatbacks — with help from Starlink
0The Verge
A YC startup is putting $1M behind five unsolved materials science problems for AI
0TechCrunch

Making Immersive LLM Chat Experiences More Accessible
0Smashing Magazine
How to change the Flutter app icon on iOS and Android
0dev.to
GPT-6 Astra covertly underperforms on safety research
0Hacker News