Chuangchuang Sun, Dong-Ki Kim, Jonathan How, Miao Liu, Matthew Riemer, Marwa Abdulhai, Golnaz Habibi, Sebastian Lopez-Cot, Gerald Tesauro
6 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; 2 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 1 failure of our instrument; 2 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/2011.00382.json · badge: /api/ran/2011.00382.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 |
|---|---|---|
| dkkim93/meta-mapg | canonical (classifier label) classifier basis: census |
3 ran · 1 no recorded run |
| alexis-jacq/LOLA | community Papers with Code archive |
3 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| build_grads | Ran ran on a synthesized input |
alexis-jacq/LOLA/lola_dice/rpg.py code served (permissive licence) · get_code("d43d42fecfa6b959") 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 list, ndim 2, 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.
|
| build_losses | Ran ran, honoured the contract we drafted |
alexis-jacq/LOLA/lola_dice/rpg.py code served (permissive licence) · get_code("83c18353fc1e61a1") 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 2, 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.
|
| lstm_cell | Ran ran on a synthesized input |
dkkim93/meta-mapg/network/categorical_lstm.py code served (permissive licence) · get_code("f006932feacd0d06") 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 3, 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.
|
| magic_box | Ran ran; our contract draft was wrong, not the code |
dkkim93/meta-mapg/meta/dice.py code served (permissive licence) · get_code("17699ef2e449301d") 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 Tensor, 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.
|
| pc_grad | Ran ran on a synthesized input |
dkkim93/meta-mapg/meta/projection_grad.py code served (permissive licence) · get_code("fdc3c01715c2c370") 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 1, dtype family float, shape (12,) 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.
|
| stop_forward | Ran ran, honoured the contract we drafted |
alexis-jacq/LOLA/lola_dice/rpg.py code served (permissive licence) · get_code("cfc6f16a78f519bd") 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 SymbolicTensor. 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.
|
| build_new_params | Not yet run unverified (harvested, no recorded run) |
alexis-jacq/LOLA/lola_dice/rpg.py code served (permissive licence) · get_code("3084c14c98bf7e53") How it ranno invocation recorded. |
| get_dice_loss | Not yet run unverified (harvested, no recorded run) |
dkkim93/meta-mapg/meta/dice.py code served (permissive licence) · get_code("2a6aa3337b478e39") 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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 7 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 |
|---|---|---|---|
| magic_box | 2 other papers 1 dated earlier, 1 later |
1709.04326 (2017-09) Learning with Opponent-Learning Awareness |
2112.15400 (2021-12) A Theoretical Understanding of Gradient Bias in Meta-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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
A fundamental challenge in multiagent reinforcement learning is to learn beneficial behaviors in a shared environment with other simultaneously learning agents. In particular, each agent perceives the environment as effectively nonstationary due to the changing policies of other agents. Moreover, each agent is itself constantly learning, leading to natural non-stationarity in the distribution of experiences encountered. In this paper, we propose a novel meta-multiagent policy gradient theorem that directly accounts for the non-stationary policy dynamics inherent to multiagent learning settings. This is achieved by modeling our gradient updates to consider both an agent's own non-stationary policy dynamics and the non-stationary policy dynamics of other agents in the environment. We show that our theoretically grounded approach provides a general solution to the multiagent learning problem, which inherently comprises all key aspects of previous state of the art approaches on this topic. We test our method on a diverse suite of multiagent benchmarks and demonstrate a more efficient ability to adapt to new agents as they learn than baseline methods across the full spectrum of mixed incentive, competitive, and cooperative domains. Our contributions. With this insight, we make the following primary contributions in this paper: 1) New theorem: We derive a new meta-multiagent policy gradient theorem (Meta-MAPG) that, for the first time,
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.00382")
get_code_for_paper("2011.00382")
have("2011.00382")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.00382.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.00382)
Connect an agent — have() is free.