{"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/lerp","entry":"lerp","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":27,"n_papers_ran":27,"n_papers_ran_no_instrument_failure":26,"n_papers_ran_instrument_only":1,"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":18,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":17,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":27,"n_places_pointer_only":11,"n_places_pointer_only_link_open":5,"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":4,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":12,"unverified":0},"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":"2607.21716","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-21716","title":"A Defense of the Quadratic Model","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"alexandrumeterez/QuadraticModel","path":"opt.py","file_url":"https://github.com/alexandrumeterez/QuadraticModel/blob/HEAD/opt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95733eb983e3b0e3","code_sha256_prefix":"95733eb983e3b0e3","mcp_get_code":{"code_sha256":"95733eb983e3b0e3"}},{"arxiv_id":"2605.15690","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15690","title":"FRWKV+: Periodic-Aware Adaptive Gating for Frequency-Space Linear Time Series Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"yangqingyuan-byte/FRWKV-plus","path":"src/adaptive_phasegate_kbs/FRWKV/model/FRWKV_CrossBranchPhaseGateAdaptive.py","file_url":"https://github.com/yangqingyuan-byte/FRWKV-plus/blob/HEAD/src/adaptive_phasegate_kbs/FRWKV/model/FRWKV_CrossBranchPhaseGateAdaptive.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, yangqingyuan-byte/FRWKV-plus (NOASSERTION)","code_sha256":"0f322a1e89b25ce1","code_sha256_prefix":"0f322a1e89b25ce1","mcp_get_code":{"code_sha256":"0f322a1e89b25ce1"}},{"arxiv_id":"2506.03293","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-cluster-neuronal-function","title":"Learning to cluster neuronal function","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nisone2000/sensorium","path":"sensorium/utility/measure_helpers.py","file_url":"https://github.com/nisone2000/sensorium/blob/HEAD/sensorium/utility/measure_helpers.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":"0583d3a4035ee91a","code_sha256_prefix":"0583d3a4035ee91a","mcp_get_code":{"code_sha256":"0583d3a4035ee91a"}},{"arxiv_id":"2506.06292","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-taught-for-co-adapting-policy-and","title":"Mutual-Taught for Co-adapting Policy and Reward Models","date":"2025-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stycoo/Mutual-Taught","path":"reward_model_merge/rm_merge_custom.py","file_url":"https://github.com/Stycoo/Mutual-Taught/blob/HEAD/reward_model_merge/rm_merge_custom.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":"ed054b3a2f7dde35","code_sha256_prefix":"ed054b3a2f7dde35","mcp_get_code":{"code_sha256":"ed054b3a2f7dde35"}},{"arxiv_id":"2407.11266","arxiv_id_is_arxiv":true,"paper":"/paper/towards-high-quality-3d-motion-transfer-with","title":"Towards High-Quality 3D Motion Transfer with Realistic Apparel Animation","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rongakowang/MMDMC","path":"anim/blend.py","file_url":"https://github.com/rongakowang/MMDMC/blob/HEAD/anim/blend.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rongakowang/MMDMC when it was checked","code_sha256":"ab9ff7029a444621","code_sha256_prefix":"ab9ff7029a444621","mcp_get_code":{"code_sha256":"ab9ff7029a444621"}},{"arxiv_id":"2405.14768","arxiv_id_is_arxiv":true,"paper":"/paper/wise-rethinking-the-knowledge-memory-for","title":"WISE: Rethinking the Knowledge Memory for Lifelong Model Editing of Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/easyedit","path":"easyeditor/models/wise/WISE.py","file_url":"https://github.com/zjunlp/easyedit/blob/HEAD/easyeditor/models/wise/WISE.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bfce29de3b973b3","code_sha256_prefix":"1bfce29de3b973b3","mcp_get_code":{"code_sha256":"1bfce29de3b973b3"}},{"arxiv_id":"2402.13616","arxiv_id_is_arxiv":true,"paper":"/paper/yolov9-learning-what-you-want-to-learn-using","title":"YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WongKinYiu/YOLO","path":"yolo/utils/model_utils.py","file_url":"https://github.com/WongKinYiu/YOLO/blob/HEAD/yolo/utils/model_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":"38e55f346fdfc802","code_sha256_prefix":"38e55f346fdfc802","mcp_get_code":{"code_sha256":"38e55f346fdfc802"}},{"arxiv_id":"2401.11430","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-diffusion-time-steps-for","title":"Exploring Diffusion Time-steps for Unsupervised Representation Learning","date":"2024-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/diti","path":"eval/counterfactual_generation.py","file_url":"https://github.com/yue-zhongqi/diti/blob/HEAD/eval/counterfactual_generation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yue-zhongqi/diti when it was checked","code_sha256":"75dd1f00429c0ac5","code_sha256_prefix":"75dd1f00429c0ac5","mcp_get_code":{"code_sha256":"75dd1f00429c0ac5"}},{"arxiv_id":"2312.04559","arxiv_id_is_arxiv":true,"paper":"/paper/primdiffusion-volumetric-primitives-diffusion-1","title":"PrimDiffusion: Volumetric Primitives Diffusion for 3D Human Generation","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frozenburning/primdiffusion","path":"primdiffusion/dataset/renderpeople_crossid_dataset.py","file_url":"https://github.com/frozenburning/primdiffusion/blob/HEAD/primdiffusion/dataset/renderpeople_crossid_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, frozenburning/primdiffusion when it was checked","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"2305.16150","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-gans-and-score-based-diffusion-as","title":"Unifying GANs and Score-Based Diffusion as Generative Particle Models","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"white-link/gpm","path":"gpm/eval/interpolate.py","file_url":"https://github.com/white-link/gpm/blob/HEAD/gpm/eval/interpolate.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":"cc38a3ddf551c4f9","code_sha256_prefix":"cc38a3ddf551c4f9","mcp_get_code":{"code_sha256":"cc38a3ddf551c4f9"}},{"arxiv_id":"2206.08666","arxiv_id_is_arxiv":true,"paper":"/paper/the-sensorium-competition-on-predicting-large","title":"The Sensorium competition on predicting large-scale mouse primary visual cortex activity","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sinzlab/sensorium","path":"sensorium/utility/measure_helpers.py","file_url":"https://github.com/sinzlab/sensorium/blob/HEAD/sensorium/utility/measure_helpers.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":"0583d3a4035ee91a","code_sha256_prefix":"0583d3a4035ee91a","mcp_get_code":{"code_sha256":"0583d3a4035ee91a"}},{"arxiv_id":"2206.07695","arxiv_id_is_arxiv":true,"paper":"/paper/voxgraf-fast-3d-aware-image-synthesis-with","title":"VoxGRAF: Fast 3D-Aware Image Synthesis with Sparse Voxel Grids","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/voxgraf","path":"training/loss.py","file_url":"https://github.com/autonomousvision/voxgraf/blob/HEAD/training/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":"979632c2af742960","code_sha256_prefix":"979632c2af742960","mcp_get_code":{"code_sha256":"979632c2af742960"}},{"arxiv_id":"2203.17266","arxiv_id_is_arxiv":true,"paper":"/paper/transeditor-transformer-based-dual-space-gan","title":"TransEditor: Transformer-Based Dual-Space GAN for Highly Controllable Facial Editing","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"billyxyb/transeditor","path":"metrics/evaluate_query.py","file_url":"https://github.com/billyxyb/transeditor/blob/HEAD/metrics/evaluate_query.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thenhz/progressive_growing_of_gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"2111.13152","arxiv_id_is_arxiv":true,"paper":"/paper/scene-representation-transformer-geometry","title":"Scene Representation Transformer: Geometry-Free Novel View Synthesis Through Set-Latent Scene Representations","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stelzner/srt","path":"render.py","file_url":"https://github.com/stelzner/srt/blob/HEAD/render.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe3c4d43c4028f27","code_sha256_prefix":"fe3c4d43c4028f27","mcp_get_code":{"code_sha256":"fe3c4d43c4028f27"}},{"arxiv_id":"2110.11323","arxiv_id_is_arxiv":true,"paper":"/paper/stylealign-analysis-and-applications-of-1","title":"StyleAlign: Analysis and Applications of Aligned StyleGAN Models","date":"2021-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"betterze/StyleAlign","path":"MergeFace.py","file_url":"https://github.com/betterze/StyleAlign/blob/HEAD/MergeFace.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thenhz/progressive_growing_of_gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"2104.00487","arxiv_id_is_arxiv":true,"paper":"/paper/linear-semantics-in-generative-adversarial","title":"Linear Semantics in Generative Adversarial Networks","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtlantixJJ/LinearGAN","path":"lib/op.py","file_url":"https://github.com/AtlantixJJ/LinearGAN/blob/HEAD/lib/op.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":"51c0c1703f9f7417","code_sha256_prefix":"51c0c1703f9f7417","mcp_get_code":{"code_sha256":"51c0c1703f9f7417"}},{"arxiv_id":"2007.15646","arxiv_id_is_arxiv":true,"paper":"/paper/rewriting-a-deep-generative-model","title":"Rewriting a Deep Generative Model","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterWang512/GANSketching","path":"eval/ppl.py","file_url":"https://github.com/PeterWang512/GANSketching/blob/HEAD/eval/ppl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thenhz/progressive_growing_of_gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"1909.03935","arxiv_id_is_arxiv":true,"paper":"/paper/gan-leaks-a-taxonomy-of-membership-inference","title":"GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/GAN-Leaks","path":"gan_models/pggan/networks.py","file_url":"https://github.com/DingfanChen/GAN-Leaks/blob/HEAD/gan_models/pggan/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thenhz/progressive_growing_of_gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"1904.07850","arxiv_id_is_arxiv":true,"paper":"/paper/objects-as-points","title":"Objects as Points","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hoanguyen81190/Synopticon-CenterNet","path":"src/lib/detectors/multi_pose.py","file_url":"https://github.com/hoanguyen81190/Synopticon-CenterNet/blob/HEAD/src/lib/detectors/multi_pose.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60564ec6de28bd4a","code_sha256_prefix":"60564ec6de28bd4a","mcp_get_code":{"code_sha256":"60564ec6de28bd4a"}},{"arxiv_id":"1904.00830","arxiv_id_is_arxiv":true,"paper":"/paper/depth-aware-video-frame-interpolation","title":"Depth-Aware Video Frame Interpolation","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BurguerJohn/Dain-App","path":"my_DAIN_class.py","file_url":"https://github.com/BurguerJohn/Dain-App/blob/HEAD/my_DAIN_class.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":"ec5d5402f5021210","code_sha256_prefix":"ec5d5402f5021210","mcp_get_code":{"code_sha256":"ec5d5402f5021210"}},{"arxiv_id":"1901.02015","arxiv_id_is_arxiv":true,"paper":"/paper/transit-least-squares-an-optimized-transit","title":"Transit Least Squares: An optimized transit detection algorithm to search for periodic transits of small planets","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"hippke/tls","path":"transitleastsquares/interpolation.py","file_url":"https://github.com/hippke/tls/blob/HEAD/transitleastsquares/interpolation.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":"1fa15722e6c09927","code_sha256_prefix":"1fa15722e6c09927","mcp_get_code":{"code_sha256":"1fa15722e6c09927"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/stylegan","path":"training/networks_progan.py","file_url":"https://github.com/NVlabs/stylegan/blob/HEAD/training/networks_progan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NVlabs/stylegan when it was checked","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"1805.04487","arxiv_id_is_arxiv":true,"paper":"/paper/non-stationary-texture-synthesis-by","title":"Non-Stationary Texture Synthesis by Adversarial Expansion","date":"2018-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jessemelpolio/non-stationary_texture_syn","path":"util/perlin2d.py","file_url":"https://github.com/jessemelpolio/non-stationary_texture_syn/blob/HEAD/util/perlin2d.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":"301e01a37435d339","code_sha256_prefix":"301e01a37435d339","mcp_get_code":{"code_sha256":"301e01a37435d339"}},{"arxiv_id":"1802.08797","arxiv_id_is_arxiv":true,"paper":"/paper/residual-dense-network-for-image-super","title":"Residual Dense Network for Image Super-Resolution","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DivJAth/DeepLearning5922","path":"WorkerServer/progressive_gans/networks.py","file_url":"https://github.com/DivJAth/DeepLearning5922/blob/HEAD/WorkerServer/progressive_gans/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from thenhz/progressive_growing_of_gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"1711.04340","arxiv_id_is_arxiv":true,"paper":"/paper/data-augmentation-generative-adversarial","title":"Data Augmentation Generative Adversarial Networks","date":"2017-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntreasAntoniou/DAGAN","path":"utils/interpolations.py","file_url":"https://github.com/AntreasAntoniou/DAGAN/blob/HEAD/utils/interpolations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee023c21ffe38ef3","code_sha256_prefix":"ee023c21ffe38ef3","mcp_get_code":{"code_sha256":"ee023c21ffe38ef3"}},{"arxiv_id":"1710.10196","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-growing-of-gans-for-improved","title":"Progressive Growing of GANs for Improved Quality, Stability, and Variation","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thenhz/progressive_growing_of_gan","path":"networks.py","file_url":"https://github.com/thenhz/progressive_growing_of_gan/blob/HEAD/networks.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, thenhz/progressive_growing_of_gan (NOASSERTION)","code_sha256":"0c45399f3741921e","code_sha256_prefix":"0c45399f3741921e","mcp_get_code":{"code_sha256":"0c45399f3741921e"}},{"arxiv_id":"1609.04468","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-generative-networks","title":"Sampling Generative Networks","date":"2016-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dribnet/plat","path":"plat/interpolate.py","file_url":"https://github.com/dribnet/plat/blob/HEAD/plat/interpolate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee023c21ffe38ef3","code_sha256_prefix":"ee023c21ffe38ef3","mcp_get_code":{"code_sha256":"ee023c21ffe38ef3"}}],"record_sha256":"1597c9bef12b63107ceac9158b438d3b030e53cbdef6d6db4480137dc690f07f","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}