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

Apple Arcade adds four games, including Crossy Road Rush and NBA 2K27 with WNBA teams
09to5Mac
Kalshi court losses pile up as judges refuse to block state gambling laws
0Ars Technica

Tracking Vietnamese news trends with embeddings, HDBSCAN and an LLM
0dev.to
How to Organize and Improve Your AI Prompts Over Time
0dev.to
The Hackintosh Reborn
0Hacker News

Formally verifying agent-written full-stack web apps with PDD Kit
0Microsoft Research