We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper explains the math behind a generative adversarial network (GAN) model and why it is hard to be trained. Wasserstein GAN is intended to improve GANs' training by adopting a smooth metric for measuring the distance between two probability distributions.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1904.08994")
get_code_for_paper("1904.08994")
have("1904.08994")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1904.08994.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1904.08994)
Connect an agent — have() is free.