{"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/slerp","entry":"slerp","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":28,"n_papers_ran":28,"n_papers_ran_no_instrument_failure":19,"n_papers_ran_instrument_only":9,"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":26,"n_samples_ran":26,"n_samples_constructed":0,"n_samples_ran_checked":18,"n_samples_instrument":8,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":29,"n_places_pointer_only":12,"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":7,"ran_fixture":1,"ran":18,"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":"2509.11724","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-11724","title":"DRAG: Data Reconstruction Attack using Guided Diffusion","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ntuaislab/DRAG","path":"models/functional.py","file_url":"https://github.com/ntuaislab/DRAG/blob/HEAD/models/functional.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, ntuaislab/DRAG (NOASSERTION)","code_sha256":"d655f0aa3d00cff1","code_sha256_prefix":"d655f0aa3d00cff1","mcp_get_code":{"code_sha256":"d655f0aa3d00cff1"}},{"arxiv_id":"2506.20977","arxiv_id_is_arxiv":true,"paper":"/paper/from-cradle-to-cane-a-two-pass-framework-for","title":"From Cradle to Cane: A Two-Pass Framework for High-Fidelity Lifespan Face Aging","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byliutao/Cradle2Cane","path":"lib/model/age_map.py","file_url":"https://github.com/byliutao/Cradle2Cane/blob/HEAD/lib/model/age_map.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, byliutao/Cradle2Cane when it was checked","code_sha256":"390974c5e23b0188","code_sha256_prefix":"390974c5e23b0188","mcp_get_code":{"code_sha256":"390974c5e23b0188"}},{"arxiv_id":"2506.20879","arxiv_id_is_arxiv":true,"paper":"/paper/multihuman-testbench-benchmarking-image","title":"MultiHuman-Testbench: Benchmarking Image Generation for Multiple Humans","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eclipse-t2i/lambda-eclipse-inference","path":"utils.py","file_url":"https://github.com/eclipse-t2i/lambda-eclipse-inference/blob/HEAD/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":"f76e8b9fc2869a1f","code_sha256_prefix":"f76e8b9fc2869a1f","mcp_get_code":{"code_sha256":"f76e8b9fc2869a1f"}},{"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":"343787d4eb1da770","code_sha256_prefix":"343787d4eb1da770","mcp_get_code":{"code_sha256":"343787d4eb1da770"}},{"arxiv_id":"2411.16969","arxiv_id_is_arxiv":true,"paper":"/paper/zoomldm-latent-diffusion-model-for-multi","title":"ZoomLDM: Latent Diffusion Model for multi-scale image generation","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-stonybrook/ZoomLDM","path":"large_image_gen/postprocess.py","file_url":"https://github.com/cvlab-stonybrook/ZoomLDM/blob/HEAD/large_image_gen/postprocess.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":"ecc1c08d5ab92766","code_sha256_prefix":"ecc1c08d5ab92766","mcp_get_code":{"code_sha256":"ecc1c08d5ab92766"}},{"arxiv_id":"2410.13846","arxiv_id_is_arxiv":true,"paper":"/paper/simlayerkv-a-simple-framework-for-layer-level","title":"SimLayerKV: A Simple Framework for Layer-Level KV Cache Reduction","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/simlayerkv","path":"LongBench/SimLayerKV_llama.py","file_url":"https://github.com/sail-sg/simlayerkv/blob/HEAD/LongBench/SimLayerKV_llama.py","status":"ran","verification_level":1,"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, sail-sg/simlayerkv when it was checked","code_sha256":"3a5da3106b298ea0","code_sha256_prefix":"3a5da3106b298ea0","mcp_get_code":{"code_sha256":"3a5da3106b298ea0"}},{"arxiv_id":"2407.17850","arxiv_id_is_arxiv":true,"paper":"/paper/flexiedit-frequency-aware-latent-refinement","title":"FlexiEdit: Frequency-Aware Latent Refinement for Enhanced Non-Rigid Editing","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kookie12/FlexiEdit","path":"flexiedit/_ptp_utils.py","file_url":"https://github.com/kookie12/FlexiEdit/blob/HEAD/flexiedit/_ptp_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2eb4b43093b866ae","code_sha256_prefix":"2eb4b43093b866ae","mcp_get_code":{"code_sha256":"2eb4b43093b866ae"}},{"arxiv_id":"2407.11451","arxiv_id_is_arxiv":true,"paper":"/paper/isometric-representation-learning-for","title":"Isometric Representation Learning for Disentangled Latent Space of Diffusion Models","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isno0907/isodiff","path":"ddpm_interpolation.py","file_url":"https://github.com/isno0907/isodiff/blob/HEAD/ddpm_interpolation.py","status":"ran","verification_level":1,"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, isno0907/isodiff when it was checked","code_sha256":"b23a9eaa83a22826","code_sha256_prefix":"b23a9eaa83a22826","mcp_get_code":{"code_sha256":"b23a9eaa83a22826"}},{"arxiv_id":"2406.16768","arxiv_id_is_arxiv":true,"paper":"/paper/warp-on-the-benefits-of-weight-averaged","title":"WARP: On the Benefits of Weight Averaged Rewarded Policies","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zokost/warp_implementation","path":"scripts/warp_training.py","file_url":"https://github.com/zokost/warp_implementation/blob/HEAD/scripts/warp_training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zokost/warp_implementation when it was checked","code_sha256":"d27d0a144572f75b","code_sha256_prefix":"d27d0a144572f75b","mcp_get_code":{"code_sha256":"d27d0a144572f75b"}},{"arxiv_id":"2405.20320","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-training-of-rectified-flows","title":"Improving the Training of Rectified Flows","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/rfpp","path":"generate.py","file_url":"https://github.com/sangyun884/rfpp/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, sangyun884/rfpp, is not in the permissive set Syntology serves inline","code_sha256":"dfa7a0f7f0ec846f","code_sha256_prefix":"dfa7a0f7f0ec846f","mcp_get_code":{"code_sha256":"dfa7a0f7f0ec846f"}},{"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","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":"e595256c414955d3","code_sha256_prefix":"e595256c414955d3","mcp_get_code":{"code_sha256":"e595256c414955d3"}},{"arxiv_id":"2405.00571","arxiv_id_is_arxiv":true,"paper":"/paper/spherical-linear-interpolation-and-text","title":"Spherical Linear Interpolation and Text-Anchoring for Zero-shot Composed Image Retrieval","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youngkyunJang/SLERP-TAT","path":"slerp.py","file_url":"https://github.com/youngkyunJang/SLERP-TAT/blob/HEAD/slerp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, youngkyunJang/SLERP-TAT when it was checked","code_sha256":"2762690ed8c0e631","code_sha256_prefix":"2762690ed8c0e631","mcp_get_code":{"code_sha256":"2762690ed8c0e631"}},{"arxiv_id":"2403.17924","arxiv_id_is_arxiv":true,"paper":"/paper/aid-attention-interpolation-of-text-to-image","title":"AID: Attention Interpolation of Text-to-Image Diffusion","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qy-h00/attention-interpolation-diffusion","path":"gradio_src/interpolation.py","file_url":"https://github.com/qy-h00/attention-interpolation-diffusion/blob/HEAD/gradio_src/interpolation.py","status":"ran","verification_level":1,"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, qy-h00/attention-interpolation-diffusion when it was checked","code_sha256":"179863142b812e70","code_sha256_prefix":"179863142b812e70","mcp_get_code":{"code_sha256":"179863142b812e70"}},{"arxiv_id":"2403.11105","arxiv_id_is_arxiv":true,"paper":"/paper/source-prompt-disentangled-inversion-for","title":"Source Prompt Disentangled Inversion for Boosting Image Editability with Diffusion Models","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leeruibin/SPDInv","path":"ELITE/ptp_utils.py","file_url":"https://github.com/leeruibin/SPDInv/blob/HEAD/ELITE/ptp_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, leeruibin/SPDInv when it was checked","code_sha256":"2eb4b43093b866ae","code_sha256_prefix":"2eb4b43093b866ae","mcp_get_code":{"code_sha256":"2eb4b43093b866ae"}},{"arxiv_id":"2403.08840","arxiv_id_is_arxiv":true,"paper":"/paper/noisediffusion-correcting-noise-for-image","title":"NoiseDiffusion: Correcting Noise for Image Interpolation with Diffusion Models beyond Spherical Linear Interpolation","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/NoiseDiffusion","path":"controlnet/cm.py","file_url":"https://github.com/tmlr-group/NoiseDiffusion/blob/HEAD/controlnet/cm.py","status":"ran","verification_level":1,"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, tmlr-group/NoiseDiffusion when it was checked","code_sha256":"0a85a29b5459564e","code_sha256_prefix":"0a85a29b5459564e","mcp_get_code":{"code_sha256":"0a85a29b5459564e"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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":"3f52e7a30971cc76","code_sha256_prefix":"3f52e7a30971cc76","mcp_get_code":{"code_sha256":"3f52e7a30971cc76"}},{"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":"2974e81cc67c0a55","code_sha256_prefix":"2974e81cc67c0a55","mcp_get_code":{"code_sha256":"2974e81cc67c0a55"}},{"arxiv_id":"2303.08133","arxiv_id_is_arxiv":true,"paper":"/paper/meshdiffusion-score-based-generative-3d-mesh","title":"MeshDiffusion: Score-based Generative 3D Mesh Modeling","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzzcd001/MeshDiffusion","path":"lib/diffusion/evaler.py","file_url":"https://github.com/lzzcd001/MeshDiffusion/blob/HEAD/lib/diffusion/evaler.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":"445022320acba4c2","code_sha256_prefix":"445022320acba4c2","mcp_get_code":{"code_sha256":"445022320acba4c2"}},{"arxiv_id":"2209.12892","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-with-generative-models-of","title":"Learning to Learn with Generative Models of Neural Network Checkpoints","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wpeebles/g.pt","path":"Gpt/latent_walk_helpers.py","file_url":"https://github.com/wpeebles/g.pt/blob/HEAD/Gpt/latent_walk_helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2e26f19600bfc6a","code_sha256_prefix":"c2e26f19600bfc6a","mcp_get_code":{"code_sha256":"c2e26f19600bfc6a"}},{"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","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":"904ef2c2720850a0","code_sha256_prefix":"904ef2c2720850a0","mcp_get_code":{"code_sha256":"904ef2c2720850a0"}},{"arxiv_id":"2111.05011","arxiv_id_is_arxiv":true,"paper":"/paper/rave-a-variational-autoencoder-for-fast-and-1","title":"RAVE: A variational autoencoder for fast and high-quality neural audio synthesis","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moiseshorta/rave-latent-diffusion","path":"generate.py","file_url":"https://github.com/moiseshorta/rave-latent-diffusion/blob/HEAD/generate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c768f8fe79a4c51a","code_sha256_prefix":"c768f8fe79a4c51a","mcp_get_code":{"code_sha256":"c768f8fe79a4c51a"}},{"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","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":"904ef2c2720850a0","code_sha256_prefix":"904ef2c2720850a0","mcp_get_code":{"code_sha256":"904ef2c2720850a0"}},{"arxiv_id":"2007.02798","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-origin-networks","title":"Gradient Origin Networks","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwkx/GON","path":"Implicit-GON.py","file_url":"https://github.com/cwkx/GON/blob/HEAD/Implicit-GON.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":"f685a32ca62b8db0","code_sha256_prefix":"f685a32ca62b8db0","mcp_get_code":{"code_sha256":"f685a32ca62b8db0"}},{"arxiv_id":"2007.02798","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-origin-networks","title":"Gradient Origin Networks","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"titu1994/tf_GON","path":"utils.py","file_url":"https://github.com/titu1994/tf_GON/blob/HEAD/utils.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":"def3c6042ace1a88","code_sha256_prefix":"def3c6042ace1a88","mcp_get_code":{"code_sha256":"def3c6042ace1a88"}},{"arxiv_id":"2003.14297","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-small-data-through-sampling-an","title":"Generative Latent Implicit Conditional Optimization when Learning from Small Sample","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAzuri/glico-learning-small-sample","path":"glico_model/interpolate.py","file_url":"https://github.com/IdanAzuri/glico-learning-small-sample/blob/HEAD/glico_model/interpolate.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":"b31461d93847c383","code_sha256_prefix":"b31461d93847c383","mcp_get_code":{"code_sha256":"b31461d93847c383"}},{"arxiv_id":"1912.04958","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-image-quality-of","title":"Analyzing and Improving the Image Quality of StyleGAN","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claim-berlin/3d_stylegan_circle_of_willis","path":"CoW_generator.py","file_url":"https://github.com/claim-berlin/3d_stylegan_circle_of_willis/blob/HEAD/CoW_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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, claim-berlin/3d_stylegan_circle_of_willis (NOASSERTION)","code_sha256":"6d7397331b84d54f","code_sha256_prefix":"6d7397331b84d54f","mcp_get_code":{"code_sha256":"6d7397331b84d54f"}},{"arxiv_id":"1911.08621","arxiv_id_is_arxiv":true,"paper":"/paper/open-cross-domain-visual-search","title":"Open Cross-Domain Visual Search","date":"2019-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"twuilliam/open-search","path":"retrieve-any.py","file_url":"https://github.com/twuilliam/open-search/blob/HEAD/retrieve-any.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":"fe2abfe820701e3b","code_sha256_prefix":"fe2abfe820701e3b","mcp_get_code":{"code_sha256":"fe2abfe820701e3b"}},{"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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c1b90f679a7f761","code_sha256_prefix":"9c1b90f679a7f761","mcp_get_code":{"code_sha256":"9c1b90f679a7f761"}},{"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":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c1b90f679a7f761","code_sha256_prefix":"9c1b90f679a7f761","mcp_get_code":{"code_sha256":"9c1b90f679a7f761"}}],"record_sha256":"7ed1e65885a9132627891263ea7a4b90833e1eb083afd8ba5b76fde3538ef477","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}