Pith. sign in

REVIEW 1 cited by

Overview of the TREC 2019 Fair Ranking Track

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.11650 v1 pith:XMNBEJ4L submitted 2020-03-25 cs.IR cs.DLcs.LG

classification cs.IRcs.DLcs.LG
keywords trackfairrankingsystemsbenchmarkdatafairnessoverview
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The goal of the TREC Fair Ranking track was to develop a benchmark for evaluating retrieval systems in terms of fairness to different content providers in addition to classic notions of relevance. As part of the benchmark, we defined standardized fairness metrics with evaluation protocols and released a dataset for the fair ranking problem. The 2019 task focused on reranking academic paper abstracts given a query. The objective was to fairly represent relevant authors from several groups that were unknown at the system submission time. Thus, the track emphasized the development of systems which have robust performance across a variety of group definitions. Participants were provided with querylog data (queries, documents, and relevance) from Semantic Scholar. This paper presents an overview of the track, including the task definition, descriptions of the data and the annotation process, as well as a comparison of the performance of submitted systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantifying Misattribution Unfairness in Authorship Attribution

    cs.CL 2025-06 reject novelty 5.0 of 10

    Authorship attribution models misattribute texts to some authors far more often than chance, and the risk is highest for authors whose author embeddings sit near the centroid.

Pith tools