3 of 9 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 0 failures of our instrument; 6 no recorded run), measured 2026-11-22; 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/2001.01828.json · badge: /api/ran/2001.01828.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 |
|---|---|---|
| XiaofengZhu/uRank_uMart | canonical (classifier label) classifier basis: census |
3 ran · 6 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_data_model | Ran ran on a synthesized input |
XiaofengZhu/uRank_uMart/src/process_ndcg_results.py code served (permissive licence) · get_code("02139540ce6114de") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_data_path | Ran ran on a synthesized input |
XiaofengZhu/uRank_uMart/src/feature_norm_for_lambdarank.py code served (permissive licence) · get_code("05dad4ff3ca220d1") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| normalize_mean_max_feature_array | Ran ran on a synthesized input |
XiaofengZhu/uRank_uMart/src/feature_norm_for_lambdarank.py code served (permissive licence) · get_code("48b7183c5599a4ae") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_OHSUMED_data_path | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/feature_norm_for_lambdarank.py code served (permissive licence) · get_code("2b5a619a8e987439") How it ranno invocation recorded. |
| get_OHSUMED_data_path | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/lambda_cv_correct.py code served (permissive licence) · get_code("b08afbd70d190726") How it ranno invocation recorded. |
| get_ndcgs | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/process_ndcg_results.py code served (permissive licence) · get_code("b2689e16925a9157") How it ranno invocation recorded. |
| get_ndcgs_errs | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/process_results.py code served (permissive licence) · get_code("73cc2c569911c5bc") How it ranno invocation recorded. |
| input_fn | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/model/reader.py code served (permissive licence) · get_code("37f21b0f8c4c6c2e") How it ranno invocation recorded. |
| load_dataset_from_tfrecords | Not yet run unverified (harvested, no recorded run) |
XiaofengZhu/uRank_uMart/src/model/reader.py code served (permissive licence) · get_code("68fe8a2460d9a8e4") How it ranno invocation recorded. |
Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 8 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 8 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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we propose new listwise learning-to-rank models that mitigate the shortcomings of existing ones. Existing listwise learning-to-rank models are generally derived from the classical Plackett-Luce model, which has three major limitations. (1) Its permutation probabilities overlook ties, i.e., a situation when more than one document has the same rating with respect to a query. This can lead to imprecise permutation probabilities and inefficient training because of selecting documents one by one. (2) It does not favor documents having high relevance. (3) It has a loose assumption that sampling documents at different steps is independent. To overcome the first two limitations, we model ranking as selecting documents from a candidate set based on unique rating levels in decreasing order. The number of steps in training is determined by the number of unique rating levels. We propose a new loss function and associated four models for the entire sequence of weighted classification tasks by assigning high weights to the selected documents with high ratings for optimizing Normalized Discounted Cumulative Gain (NDCG). To overcome the final limitation, we further propose a novel and efficient way of refining prediction scores by combining an adapted Vanilla Recurrent Neural Network (RNN) model with pooling given selected documents at previous steps. We encode all of the documents already selected by an RNN model. In a single step, we rank all of the documents with the same ratings using the last cell of the RNN multiple times. We have implemented our models using three settings: neural networks, neural networks with gradient boosting, and regression trees with gradient boosting. We have conducted experiments on four public datasets. The experiments demonstrate that the models notably outperform state-of-the-art learning-to-rank models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.01828")
get_code_for_paper("2001.01828")
have("2001.01828")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.01828.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.01828)
Connect an agent — have() is free.