None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 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/1704.02510.json · badge: /api/ran/1704.02510.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 |
|---|---|---|
| tmabraham/UPIT | reimplementation (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| eriklindernoren/PyTorch-GAN | reimplementation (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_gradient_penalty | Not yet run unverified (harvested, no recorded run) |
tmabraham/UPIT/upit/train/dualgan.py code served (permissive licence) · get_code("389f241698c1763f") How it ranno invocation recorded. |
| compute_gradient_penalty | Not yet run unverified (harvested, no recorded run) |
eriklindernoren/PyTorch-GAN/implementations/dualgan/dualgan.py code served (permissive licence) · get_code("7df95909e48d11f5") How it ranno invocation recorded. |
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, 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 2 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.
Conditional Generative Adversarial Networks (GANs) for cross-domain image-to-image translation have made much progress recently. Depending on the task complexity, thousands to millions of labeled image pairs are needed to train a conditional GAN. However, human labeling is expensive, even impractical, and large quantities of data may not always be available. Inspired by dual learning from natural language translation, we develop a novel dual-GAN mechanism, which enables image translators to be trained from two sets of unlabeled images from two domains. In our architecture, the primal GAN learns to translate images from domain U to those in domain V, while the dual GAN learns to invert the task. The closed loop made by the primal and dual tasks allows images from either domain to be translated and then reconstructed. Hence a loss function that accounts for the reconstruction error of images can be used to train the translators. Experiments on multiple image translation tasks with unlabeled data show considerable performance gain of DualGAN over a single GAN. For some tasks, DualGAN can even achieve comparable or slightly better results than conditional GAN trained on fully labeled data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1704.02510")
get_code_for_paper("1704.02510")
have("1704.02510")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1704.02510.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1704.02510)
Connect an agent — have() is free.