3 of 8 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; 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/2109.07171.json · badge: /api/ran/2109.07171.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 |
|---|---|---|
| rssalessio/optimal-attack-control-channel-mdp | canonical (classifier label) classifier basis: census |
3 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_absolute_continuity | Ran ran on a synthesized input |
rssalessio/optimal-attack-control-channel-mdp/inventory_management_problem/utils.py code served (permissive licence) · get_code("779a5d41d9a6e05f") 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 bool, ndim 0, dtype family float, shape () 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.
|
| compute_R | Ran ran on a synthesized input |
rssalessio/optimal-attack-control-channel-mdp/linear_system_example/utils.py code served (permissive licence) · get_code("831b18395cc96105") 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 (3, 3) 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.
|
| value_iteration | Ran ran on a synthesized input |
rssalessio/optimal-attack-control-channel-mdp/inventory_management_problem/utils.py code served (permissive licence) · get_code("92644ea24d460ab0") 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. 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.
|
| check_absolute_continuity_policies | Not yet run unverified (harvested, no recorded run) |
rssalessio/optimal-attack-control-channel-mdp/inventory_management_problem/utils.py code served (permissive licence) · get_code("eebcd520478da982") How it ranno invocation recorded. |
| compute_deterministic_attack | Not yet run unverified (harvested, no recorded run) |
rssalessio/optimal-attack-control-channel-mdp/inventory_management_problem/attacker.py code served (permissive licence) · get_code("0a88c9560abbc937") How it ranno invocation recorded. |
| compute_power_series | Not yet run unverified (harvested, no recorded run) |
rssalessio/optimal-attack-control-channel-mdp/linear_system_example/utils.py code served (permissive licence) · get_code("454a951272fcfec2") How it ranno invocation recorded. |
| compute_randomized_attack | Not yet run unverified (harvested, no recorded run) |
rssalessio/optimal-attack-control-channel-mdp/inventory_management_problem/attacker.py code served (permissive licence) · get_code("92ea6eba414964df") How it ranno invocation recorded. |
| dlqr | Not yet run unverified (harvested, no recorded run) |
rssalessio/optimal-attack-control-channel-mdp/linear_system_example/utils.py code served (permissive licence) · get_code("ff64b94ebaf71f03") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 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.
We investigate the problem of designing optimal stealthy poisoning attacks on the control channel of Markov decision processes (MDPs). This research is motivated by the recent interest of the research community for adversarial and poisoning attacks applied to MDPs, and reinforcement learning (RL) methods. The policies resulting from these methods have been shown to be vulnerable to attacks perturbing the observations of the decision-maker. In such an attack, drawing inspiration from adversarial examples used in supervised learning, the amplitude of the adversarial perturbation is limited according to some norm, with the hope that this constraint will make the attack imperceptible. However, such constraints do not grant any level of undetectability and do not take into account the dynamic nature of the underlying Markov process. In this paper, we propose a new attack formulation, based on information-theoretical quantities, that considers the objective of minimizing the detectability of the attack as well as the performance of the controlled process. We analyze the trade-off between the efficiency of the attack and its detectability. We conclude with examples and numerical simulations illustrating this trade-off.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2109.07171")
get_code_for_paper("2109.07171")
have("2109.07171")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2109.07171.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2109.07171)
Connect an agent — have() is free.