None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-21; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2008.09093.json · badge: /api/ran/2008.09093.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| canjiali/PARADE | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| evaluate_sample_trec | Not yet run unverified (harvested, no recorded run) |
canjiali/PARADE/evaluation.py code served (permissive licence) · get_code("ef085d7e7ab77ca4") How it ranno invocation recorded. |
| evaluate_trec | Not yet run unverified (harvested, no recorded run) |
canjiali/PARADE/evaluation.py code served (permissive licence) · get_code("897c488c7857d810") How it ranno invocation recorded. |
| run | Not yet run unverified (harvested, no recorded run) |
canjiali/PARADE/evaluation.py code served (permissive licence) · get_code("9108b450d2590c33") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Pretrained transformer models, such as BERT and T5, have shown to be highly effective at ad-hoc passage and document ranking. Due to inherent sequence length limits of these models, they need to be run over a document's passages, rather than processing the entire document sequence at once. Although several approaches for aggregating passage-level signals have been proposed, there has yet to be an extensive comparison of these techniques. In this work, we explore strategies for aggregating relevance signals from a document's passages into a final ranking score. We find that passage representation aggregation techniques can significantly improve over techniques proposed in prior work, such as taking the maximum passage score. We call this new approach PARADE. In particular, PARADE can significantly improve results on collections with broad information needs where relevance signals can be spread throughout the document (such as TREC Robust04 and GOV2). Meanwhile, less complex aggregation techniques may work better on collections with an information need that can often be pinpointed to a single passage (such as TREC DL and TREC Genomics). We also conduct efficiency analyses, and highlight several strategies for improving transformer-based aggregation.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2008.09093")
get_code_for_paper("2008.09093")
have("2008.09093")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2008.09093.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2008.09093)
Connect an agent — have() is free.