1 of 6 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 1 has no contract verdict; 0 failures of our instrument; 5 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/1804.05938.json · badge: /api/ran/1804.05938.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 |
|---|---|---|
| QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank | canonical (classifier label) classifier basis: census |
1 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| selu | Ran ran on a synthesized input |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/IPW_LTR/IPWrank_model.py code served (permissive licence) · get_code("ceaa8e1e64689b47") 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 EagerTensor, 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.
|
| generate_ranklist | Not yet run unverified (harvested, no recorded run) |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/data_utils.py code served (permissive licence) · get_code("0f2327e837b11209") How it ranno invocation recorded. |
| generate_ranklist_by_scores | Not yet run unverified (harvested, no recorded run) |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/data_utils.py code served (permissive licence) · get_code("7e9c5d0da1be565f") How it ranno invocation recorded. |
| loadModelFromJson | Not yet run unverified (harvested, no recorded run) |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/click_models.py code served (permissive licence) · get_code("a46ac0897d9db30f") How it ranno invocation recorded. |
| read_data | Not yet run unverified (harvested, no recorded run) |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/data_utils.py code served (permissive licence) · get_code("47352c9331ad3a13") How it ranno invocation recorded. |
| sigmoid_prob | Not yet run unverified (harvested, no recorded run) |
QingyaoAi/Dual-Learning-Algorithm-for-Unbiased-Learning-to-Rank/Unbiased_LTR/DLA/DLA_model.py code served (permissive licence) · get_code("ab9d121998955910") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 5 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| sigmoid_prob | 1 other paper 1 later |
1912.05891 (2019-12) SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval |
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.
Learning to rank with biased click data is a well-known challenge. A variety of methods has been explored to debias click data for learning to rank such as click models, result interleaving and, more recently, the unbiased learning-to-rank framework based on inverse propensity weighting. Despite their differences, most existing studies separate the estimation of click bias (namely the \textit{propensity model}) from the learning of ranking algorithms. To estimate click propensities, they either conduct online result randomization, which can negatively affect the user experience, or offline parameter estimation, which has special requirements for click data and is optimized for objectives (e.g. click likelihood) that are not directly related to the ranking performance of the system. In this work, we address those problems by unifying the learning of propensity models and ranking models. We find that the problem of estimating a propensity model from click data is a dual problem of unbiased learning to rank. Based on this observation, we propose a Dual Learning Algorithm (DLA) that jointly learns an unbiased ranker and an \textit{unbiased propensity model}. DLA is an automatic unbiased learning-to-rank framework as it directly learns unbiased ranking models from biased click data without any preprocessing. It can adapt to the change of bias distributions and is applicable to online learning. Our empirical experiments with synthetic and real-world data show that the models trained with DLA significantly outperformed the unbiased learning-to-rank algorithms based on result randomization and the models trained with relevance signals extracted by click models.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1804.05938")
get_code_for_paper("1804.05938")
have("1804.05938")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1804.05938.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1804.05938)
Connect an agent — have() is free.