{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/compute-gradient-penalty","entry":"compute_gradient_penalty","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":15,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":17,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":11,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":11},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.07640","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-07640","title":"No Free Lunch for Synthetic Images under Data Scarcity Conditions","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BorjaArroyo/synthetic-images-tradeoff","path":"src/core/trainer.py","file_url":"https://github.com/BorjaArroyo/synthetic-images-tradeoff/blob/HEAD/src/core/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"baa017955d57c289","code_sha256_prefix":"baa017955d57c289","mcp_get_code":{"code_sha256":"baa017955d57c289"}},{"arxiv_id":"2406.02317","arxiv_id_is_arxiv":true,"paper":"/paper/generative-conditional-distributions-by","title":"Generative Conditional Distributions by Neural (Entropic) Optimal Transport","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenngocbaocmt02/gentle","path":"train_wgan_gp.py","file_url":"https://github.com/nguyenngocbaocmt02/gentle/blob/HEAD/train_wgan_gp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nguyenngocbaocmt02/gentle when it was checked","code_sha256":"56d80682979d3e38","code_sha256_prefix":"56d80682979d3e38","mcp_get_code":{"code_sha256":"56d80682979d3e38"}},{"arxiv_id":"2303.01497","arxiv_id_is_arxiv":true,"paper":"/paper/teach-a-robot-to-fish-versatile-imitation","title":"Teach a Robot to FISH: Versatile Imitation from One Minute of Demonstrations","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siddhanthaldar/FISH","path":"FISH/agent/dac.py","file_url":"https://github.com/siddhanthaldar/FISH/blob/HEAD/FISH/agent/dac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52cbdb60c855f08b","code_sha256_prefix":"52cbdb60c855f08b","mcp_get_code":{"code_sha256":"52cbdb60c855f08b"}},{"arxiv_id":"2302.00965","arxiv_id_is_arxiv":true,"paper":"/paper/visual-imitation-learning-with-patch-rewards","title":"Visual Imitation Learning with Patch Rewards","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/PatchAIL","path":"PatchAIL/agent/adv_irl.py","file_url":"https://github.com/sail-sg/PatchAIL/blob/HEAD/PatchAIL/agent/adv_irl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7749f49287c02d5","code_sha256_prefix":"d7749f49287c02d5","mcp_get_code":{"code_sha256":"d7749f49287c02d5"}},{"arxiv_id":"2106.09422","arxiv_id_is_arxiv":true,"paper":"/paper/cril-continual-robot-imitation-learning-via","title":"CRIL: Continual Robot Imitation Learning via Generative and Prediction Model","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeegerGao/CRIL","path":"wgangp.py","file_url":"https://github.com/HeegerGao/CRIL/blob/HEAD/wgangp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e8241a45eda25b9","code_sha256_prefix":"4e8241a45eda25b9","mcp_get_code":{"code_sha256":"4e8241a45eda25b9"}},{"arxiv_id":"2106.03538","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-reconstruction-meets-data-driven","title":"End-to-end reconstruction meets data-driven regularization for inverse problems","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Subhadip-1/unrolling_meets_data_driven_regularization","path":"adversarial_reg_models.py","file_url":"https://github.com/Subhadip-1/unrolling_meets_data_driven_regularization/blob/HEAD/adversarial_reg_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"068e5121b893e599","code_sha256_prefix":"068e5121b893e599","mcp_get_code":{"code_sha256":"068e5121b893e599"}},{"arxiv_id":"2103.06377","arxiv_id_is_arxiv":true,"paper":"/paper/disentangled-representation-learning-for","title":"Disentangled Representation Learning for Astronomical Chemical Tagging","date":"2021-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drd13/tagging-package","path":"tagging/scripts/train_factordis.py","file_url":"https://github.com/drd13/tagging-package/blob/HEAD/tagging/scripts/train_factordis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, drd13/tagging-package when it was checked","code_sha256":"08560cce1ac8cf98","code_sha256_prefix":"08560cce1ac8cf98","mcp_get_code":{"code_sha256":"08560cce1ac8cf98"}},{"arxiv_id":"2008.02839","arxiv_id_is_arxiv":true,"paper":"/paper/learned-convex-regularizers-for-inverse","title":"Learned convex regularizers for inverse problems","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Subhadip-1/data_driven_convex_regularization","path":"train_convex_reg.py","file_url":"https://github.com/Subhadip-1/data_driven_convex_regularization/blob/HEAD/train_convex_reg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"14faa548c958b89a","code_sha256_prefix":"14faa548c958b89a","mcp_get_code":{"code_sha256":"14faa548c958b89a"}},{"arxiv_id":"1711.09020","arxiv_id_is_arxiv":true,"paper":"/paper/stargan-unified-generative-adversarial","title":"StarGAN: Unified Generative Adversarial Networks for Multi-Domain Image-to-Image Translation","date":"2017-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/stargan/stargan.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/stargan/stargan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25032f56f7a0b4cf","code_sha256_prefix":"25032f56f7a0b4cf","mcp_get_code":{"code_sha256":"25032f56f7a0b4cf"}},{"arxiv_id":"1705.07215","arxiv_id_is_arxiv":true,"paper":"/paper/on-convergence-and-stability-of-gans","title":"On Convergence and Stability of GANs","date":"2017-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/dragan/dragan.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/dragan/dragan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0ef577ceff3d8e3","code_sha256_prefix":"c0ef577ceff3d8e3","mcp_get_code":{"code_sha256":"c0ef577ceff3d8e3"}},{"arxiv_id":"1704.02510","arxiv_id_is_arxiv":true,"paper":"/paper/dualgan-unsupervised-dual-learning-for-image","title":"DualGAN: Unsupervised Dual Learning for Image-to-Image Translation","date":"2017-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmabraham/UPIT","path":"upit/train/dualgan.py","file_url":"https://github.com/tmabraham/UPIT/blob/HEAD/upit/train/dualgan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"389f241698c1763f","code_sha256_prefix":"389f241698c1763f","mcp_get_code":{"code_sha256":"389f241698c1763f"}},{"arxiv_id":"1704.02510","arxiv_id_is_arxiv":true,"paper":"/paper/dualgan-unsupervised-dual-learning-for-image","title":"DualGAN: Unsupervised Dual Learning for Image-to-Image Translation","date":"2017-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/dualgan/dualgan.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/dualgan/dualgan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7df95909e48d11f5","code_sha256_prefix":"7df95909e48d11f5","mcp_get_code":{"code_sha256":"7df95909e48d11f5"}},{"arxiv_id":"1704.00028","arxiv_id_is_arxiv":true,"paper":"/paper/improved-training-of-wasserstein-gans","title":"Improved Training of Wasserstein GANs","date":"2017-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goldhuang/SRGAN-PyTorch","path":"model.py","file_url":"https://github.com/goldhuang/SRGAN-PyTorch/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, goldhuang/SRGAN-PyTorch when it was checked","code_sha256":"8ad87c2d347e436c","code_sha256_prefix":"8ad87c2d347e436c","mcp_get_code":{"code_sha256":"8ad87c2d347e436c"}},{"arxiv_id":"1704.00028","arxiv_id_is_arxiv":true,"paper":"/paper/improved-training-of-wasserstein-gans","title":"Improved Training of Wasserstein GANs","date":"2017-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/wgan_gp/wgan_gp.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/wgan_gp/wgan_gp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90d0782f63f78a1d","code_sha256_prefix":"90d0782f63f78a1d","mcp_get_code":{"code_sha256":"90d0782f63f78a1d"}},{"arxiv_id":"1703.10593","arxiv_id_is_arxiv":true,"paper":"/paper/unpaired-image-to-image-translation-using","title":"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks","date":"2017-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NiucunCode/Deep-Learning-proj2","path":"stargan/stargan.py","file_url":"https://github.com/NiucunCode/Deep-Learning-proj2/blob/HEAD/stargan/stargan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NiucunCode/Deep-Learning-proj2 when it was checked","code_sha256":"6150661478a11e4a","code_sha256_prefix":"6150661478a11e4a","mcp_get_code":{"code_sha256":"6150661478a11e4a"}},{"arxiv_id":"1703.05921","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-anomaly-detection-with","title":"Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"A03ki/f-AnoGAN","path":"fanogan/train_wgangp.py","file_url":"https://github.com/A03ki/f-AnoGAN/blob/HEAD/fanogan/train_wgangp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90dc48f19c618ed7","code_sha256_prefix":"90dc48f19c618ed7","mcp_get_code":{"code_sha256":"90dc48f19c618ed7"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BYOGan/BYOGan","path":"byogan-api/TrainGAN.py","file_url":"https://github.com/BYOGan/BYOGan/blob/HEAD/byogan-api/TrainGAN.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b5b6daf7185083a","code_sha256_prefix":"8b5b6daf7185083a","mcp_get_code":{"code_sha256":"8b5b6daf7185083a"}}],"record_sha256":"dcfcf0d6d974d876637027264eae38caf3478e538990d78b3facb305b31b692f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}