Bo Han, Xin He, Bin Gao, Xiaowen Chu, Guohao Ying
2 of 2 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, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run), measured 2026-11-22; 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/136760036.json · badge: /api/ran/136760036.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 |
|---|---|---|
| marsggbo/EAGAN | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| copy_params | Ran ran; our contract draft was wrong, not the code |
marsggbo/EAGAN/network.py code served (permissive licence) · get_code("0615b65a5b3297b7") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list. 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.
|
| str2bool | Ran ran, violated the contract we drafted |
marsggbo/EAGAN/cfg.py code served (permissive licence) · get_code("f017532fc389cbfe") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) 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.
|
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 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 |
|---|---|---|---|
| str2bool | 82 other papers 52 dated earlier, 24 later, 6 same year, order not determinable |
1510.03055 (2015-10) A Diversity-Promoting Objective Function for Neural Conversation Models |
1703.06490 (2017-03) Generating Multi-label Discrete Patient Records using Generative Adversarial Networks 1710.10467 (2017-10) Generalized End-to-End Loss for Speaker Verification and 79 more not named here |
| copy_params | 4 other papers 1 dated earlier, 2 later, 1 same year, order not determinable |
1912.02037 (2019-12) AdversarialNAS: Adversarial Neural Architecture Search for GANs |
2209.13570 (2022-09) Hierarchical Sliced Wasserstein Distance 2305.00402 (2023-05) Sliced Wasserstein Estimation with Control Variates and 1 more not named here |
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.
Generative adversarial networks (GANs) have proven successful in image generation tasks. However, GAN training is inherently unstable. Although many works try to stabilize it by manually modifying GAN architecture, it requires much expertise. Neural architecture search (NAS) has become an attractive solution to search GANs automatically. The early NAS-GANs search only generators to reduce search complexity but lead to a sub-optimal GAN. Some recent works try to search both generator (G) and discriminator (D), but they suffer from the instability of GAN training. To alleviate the instability, we propose an efficient two-stage evolutionary algorithm-based NAS framework to search GANs, namely EAGAN. We decouple the search of G and D into two stages, where stage-1 searches G with a fixed D and adopts the many-to-one training strategy, and stage-2 searches D with the optimal G found in stage-1 and adopts the one-to-one training and weightresetting strategies to enhance the stability of GAN training. Both stages use the non-dominated sorting method to produce Pareto-front architectures under multiple objectives (e.g., model size, Inception Score (IS), and Fréchet Inception Distance (FID)). EAGAN is applied to the unconditional image generation task and can efficiently finish the search on the CIFAR-10 dataset in 1.2 GPU days. Our searched GANs achieve competitive results (IS=8.81±0.10, FID=9.91) on the CIFAR-10 dataset and surpass prior NAS-GANs on the STL-10 dataset (IS=10.44±0.087, FID=22.18). Source code: https://github.com/marsggbo/EAGAN.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("136760036")
get_code_for_paper("136760036")
have("136760036")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/136760036.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/136760036)
Connect an agent — have() is free.