{"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/calc-gradient-penalty","entry":"calc_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":16,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":3,"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":16,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":16,"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":1,"ran":5,"unverified":8},"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":"2301.08227","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-based-conditional-ecg-generation","title":"Diffusion-based Conditional ECG Generation with Structured State Space Models","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4healthuol/sssd-ecg","path":"src/baselines/utils/utils.py","file_url":"https://github.com/ai4healthuol/sssd-ecg/blob/HEAD/src/baselines/utils/utils.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":"08bc532c558ef11c","code_sha256_prefix":"08bc532c558ef11c","mcp_get_code":{"code_sha256":"08bc532c558ef11c"}},{"arxiv_id":"2203.03373","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-texture-for-fooling-person","title":"Adversarial Texture for Fooling Person Detectors in the Physical World","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WhoTHU/Adversarial_Texture","path":"generator_dim.py","file_url":"https://github.com/WhoTHU/Adversarial_Texture/blob/HEAD/generator_dim.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":"3ec68f4651c396a2","code_sha256_prefix":"3ec68f4651c396a2","mcp_get_code":{"code_sha256":"3ec68f4651c396a2"}},{"arxiv_id":"2202.13197","arxiv_id_is_arxiv":true,"paper":"/paper/relational-surrogate-loss-learning-1","title":"Relational Surrogate Loss Learning","date":"2022-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hunto/reloss","path":"example/train_reloss/train_reloss.py","file_url":"https://github.com/hunto/reloss/blob/HEAD/example/train_reloss/train_reloss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"daf58932096695e5","code_sha256_prefix":"daf58932096695e5","mcp_get_code":{"code_sha256":"daf58932096695e5"}},{"arxiv_id":"2201.11989","arxiv_id_is_arxiv":true,"paper":"/paper/using-constant-learning-rate-of-two-time","title":"Existence and Estimation of Critical Batch Size for Training Generative Adversarial Networks with Two Time-Scale Update Rule","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iiduka-researches/gans","path":"wgan-gp.py","file_url":"https://github.com/iiduka-researches/gans/blob/HEAD/wgan-gp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, iiduka-researches/gans when it was checked","code_sha256":"7f7d85bc76796eb9","code_sha256_prefix":"7f7d85bc76796eb9","mcp_get_code":{"code_sha256":"7f7d85bc76796eb9"}},{"arxiv_id":"2007.12530","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-study-on-sign-language","title":"A Comprehensive Study on Deep Learning-based Methods for Sign Language Recognition","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iliasprc/slrzoo","path":"utils/loss.py","file_url":"https://github.com/iliasprc/slrzoo/blob/HEAD/utils/loss.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":"e6800d2aedfe20ba","code_sha256_prefix":"e6800d2aedfe20ba","mcp_get_code":{"code_sha256":"e6800d2aedfe20ba"}},{"arxiv_id":"2007.09549","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-seen-and-unseen-semantic","title":"Leveraging Seen and Unseen Semantic Relationships for Generative Zero-Shot Learning","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maunil/LsrGAN","path":"Codes/Wikipedia_based_dataset/train_CUB.py","file_url":"https://github.com/Maunil/LsrGAN/blob/HEAD/Codes/Wikipedia_based_dataset/train_CUB.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, Maunil/LsrGAN when it was checked","code_sha256":"d3890273357e43a0","code_sha256_prefix":"d3890273357e43a0","mcp_get_code":{"code_sha256":"d3890273357e43a0"}},{"arxiv_id":"2006.12226","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-patch-vae-gan-generating-diverse","title":"Hierarchical Patch VAE-GAN: Generating Diverse Videos from a Single Sample","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shirgur/hp-vae-gan","path":"modules/utils.py","file_url":"https://github.com/shirgur/hp-vae-gan/blob/HEAD/modules/utils.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":"dcaec709beaaa7c4","code_sha256_prefix":"dcaec709beaaa7c4","mcp_get_code":{"code_sha256":"dcaec709beaaa7c4"}},{"arxiv_id":"2005.05334","arxiv_id_is_arxiv":true,"paper":"/paper/getting-high-high-fidelity-simulation-of-high","title":"Getting High: High Fidelity Simulation of High Granularity Calorimeters with High Speed","date":null,"month_inferred_from_arxiv_id":"2020-05","title_source":"archive","repo":"FLC-QU-hep/getting_high","path":"WGAN/wGAN.py","file_url":"https://github.com/FLC-QU-hep/getting_high/blob/HEAD/WGAN/wGAN.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, FLC-QU-hep/getting_high when it was checked","code_sha256":"0d068fa8024ead12","code_sha256_prefix":"0d068fa8024ead12","mcp_get_code":{"code_sha256":"0d068fa8024ead12"}},{"arxiv_id":"1904.08410","arxiv_id_is_arxiv":true,"paper":"/paper/neural-painters-a-learned-differentiable","title":"Neural Painters: A learned differentiable constraint for generating brushstroke paintings","date":"2019-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reiinakano/neural-painters-pytorch","path":"neural_painters/gan_painter.py","file_url":"https://github.com/reiinakano/neural-painters-pytorch/blob/HEAD/neural_painters/gan_painter.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":"fd23c3d880c3e469","code_sha256_prefix":"fd23c3d880c3e469","mcp_get_code":{"code_sha256":"fd23c3d880c3e469"}},{"arxiv_id":"1902.07623","arxiv_id_is_arxiv":true,"paper":"/paper/advertorch-v01-an-adversarial-robustness","title":"advertorch v0.1: An Adversarial Robustness Toolbox based on PyTorch","date":"2019-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cody2333/WassNet","path":"WassNet.py","file_url":"https://github.com/Cody2333/WassNet/blob/HEAD/WassNet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-3.0, as GitHub detects it on this paper's repository, Cody2333/WassNet, is not in the permissive set Syntology serves inline","code_sha256":"340ab2dfb8dc60eb","code_sha256_prefix":"340ab2dfb8dc60eb","mcp_get_code":{"code_sha256":"340ab2dfb8dc60eb"}},{"arxiv_id":"1811.09236","arxiv_id_is_arxiv":true,"paper":"/paper/copy-the-old-or-paint-anew-an-adversarial","title":"Copy the Old or Paint Anew? An Adversarial Framework for (non-) Parametric Image Stylization","date":"2018-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zalandoresearch/famos","path":"network.py","file_url":"https://github.com/zalandoresearch/famos/blob/HEAD/network.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":"f4aa5c2bfe596cdc","code_sha256_prefix":"f4aa5c2bfe596cdc","mcp_get_code":{"code_sha256":"f4aa5c2bfe596cdc"}},{"arxiv_id":"1809.03627","arxiv_id_is_arxiv":true,"paper":"/paper/clustergan-latent-space-clustering-in","title":"ClusterGAN : Latent Space Clustering in Generative Adversarial Networks","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/cluster_gan/clustergan.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/cluster_gan/clustergan.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":"3be3af069c4dd5fb","code_sha256_prefix":"3be3af069c4dd5fb","mcp_get_code":{"code_sha256":"3be3af069c4dd5fb"}},{"arxiv_id":"1809.01361","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-feature-disentangler-for-multi","title":"A Unified Feature Disentangler for Multi-Domain Image Translation and Manipulation","date":"2018-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alexander-H-Liu/UFDN","path":"src/util.py","file_url":"https://github.com/Alexander-H-Liu/UFDN/blob/HEAD/src/util.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":"3625768918bd356f","code_sha256_prefix":"3625768918bd356f","mcp_get_code":{"code_sha256":"3625768918bd356f"}},{"arxiv_id":"1807.04740","arxiv_id_is_arxiv":true,"paper":"/paper/negative-momentum-for-improved-game-dynamics","title":"Negative Momentum for Improved Game Dynamics","date":"2018-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ReyhaneAskari/negative_momentum_for_improved_game_dynamics","path":"gan_pytorch.py","file_url":"https://github.com/ReyhaneAskari/negative_momentum_for_improved_game_dynamics/blob/HEAD/gan_pytorch.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":"8165dccb5f7b4b5d","code_sha256_prefix":"8165dccb5f7b4b5d","mcp_get_code":{"code_sha256":"8165dccb5f7b4b5d"}},{"arxiv_id":"1804.00921","arxiv_id_is_arxiv":true,"paper":"/paper/design-design-inspiration-from-generative","title":"DeSIGN: Design Inspiration from Generative Networks","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blufzzz/Design-Inspiration-from-Generative-Networks","path":"utils.py","file_url":"https://github.com/blufzzz/Design-Inspiration-from-Generative-Networks/blob/HEAD/utils.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":"6eae36f6caddabf5","code_sha256_prefix":"6eae36f6caddabf5","mcp_get_code":{"code_sha256":"6eae36f6caddabf5"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vious/LBAM_Pytorch","path":"loss/InpaintingLoss.py","file_url":"https://github.com/Vious/LBAM_Pytorch/blob/HEAD/loss/InpaintingLoss.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":"c22eeb67c665a020","code_sha256_prefix":"c22eeb67c665a020","mcp_get_code":{"code_sha256":"c22eeb67c665a020"}}],"record_sha256":"f8861c68bf754ce7b93c5057aad5b0c31a5d00ad1dbd818bec8fd85e6e967165","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}