Jiang Bian, Yize Chen, Lei Song, Linjie Xu, Ruohong Liu, Yuxin Pan
3 of 3 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; 1 honoured the contract we drafted, 2 violated it and 0 have no contract verdict; 0 failures of our instrument; 0 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/2410.02236.json · badge: /api/ran/2410.02236.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 |
|---|---|---|
| RuohLiuq/C-MORL | canonical (classifier label) classifier basis not recorded on the link |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_dominated | Ran ran, violated the contract we drafted |
RuohLiuq/C-MORL/morl/utils.py pointer only (licence: NONE); the stored copy get_code serves, from chennnnnyize/BEAVER, is pointer only (licence: NONE) · get_code("1a080a1023e2bc1e") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, RuohLiuq/C-MORL when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| get_ep_indices | Ran ran, violated the contract we drafted |
RuohLiuq/C-MORL/morl/utils.py pointer only (licence: NONE); the stored copy get_code serves, from chennnnnyize/BEAVER, is pointer only (licence: NONE) · get_code("35fffdf717ade198") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, RuohLiuq/C-MORL when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| update_ep | Ran ran, honoured the contract we drafted |
RuohLiuq/C-MORL/morl/utils.py pointer only (licence: NONE); the stored copy get_code serves, from chennnnnyize/BEAVER, is pointer only (licence: NONE) · get_code("ba811cc5409d0610") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, RuohLiuq/C-MORL when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is 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, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 0 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 |
|---|---|---|---|
| check_dominated | 1 other paper 1 later |
2507.07769 (2025-07) BEAVER: Building Environments with Assessable Variation for Evaluating Multi-Objective Reinforcement Learning |
|
| get_ep_indices | 1 other paper 1 later |
2507.07769 (2025-07) BEAVER: Building Environments with Assessable Variation for Evaluating Multi-Objective Reinforcement Learning |
|
| update_ep | 1 other paper 1 later |
2507.07769 (2025-07) BEAVER: Building Environments with Assessable Variation for Evaluating Multi-Objective Reinforcement Learning |
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.
Multi-objective reinforcement learning (MORL) excels at handling rapidly changing preferences in tasks that involve multiple criteria, even for unseen preferences. However, previous dominating MORL methods typically generate a fixed policy set or preference-conditioned policy through multiple training iterations exclusively for sampled preference vectors, and cannot ensure the efficient discovery of the Pareto front. Furthermore, integrating preferences into the input of policy or value functions presents scalability challenges, in particular as the dimension of the state and preference space grow, which can complicate the learning process and hinder the algorithm's performance on more complex tasks. To address these issues, we propose a two-stage Pareto front discovery algorithm called Constrained MORL (C-MORL), which serves as a seamless bridge between constrained policy optimization and MORL. Concretely, a set of policies are trained in parallel in the initialization stage, with each optimized towards its individual preference over the multiple objectives. Then, to fill the remaining vacancies in the Pareto front, the constrained optimization steps are employed to maximize one objective while constraining the other objectives to exceed a predefined threshold. Empirically, compared to recent advancements in MORL methods, our algorithm achieves more consistent and superior performances in terms of hypervolume, expected utility, and sparsity on both discrete and continuous control tasks, especially with numerous objectives (up to nine objectives in our experiments). Our code is available at https://github.com/RuohLiuq/C-MORL. • To empirically solve C-MORL without extra computation such as in the epsilon-constraint method, we propose an efficient interior-point-based approach for finding the solution of a relaxed formulation, which can guarantee the derivation of Pareto-optimal policies under specified conditions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.02236")
get_code_for_paper("2410.02236")
have("2410.02236")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2410.02236.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2410.02236)
Connect an agent — have() is free.