{"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/get-activations","entry":"get_activations","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":100,"n_papers_ran":24,"n_papers_ran_no_instrument_failure":17,"n_papers_ran_instrument_only":7,"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":76,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":5,"n_samples_unverified":58,"n_samples_fingerprinted":0,"n_places":118,"n_places_pointer_only":44,"n_places_pointer_only_link_open":15,"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":4,"ran_fixture":1,"ran":13,"unverified":58},"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":"2609.14439","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-14439","title":"Context-Aware Mutual Learning for Blind Image Inpainting and Beyond","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"zhenglab/CAML","path":"scores/fid_score.py","file_url":"https://github.com/zhenglab/CAML/blob/HEAD/scores/fid_score.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, zhenglab/CAML when it was checked","code_sha256":"4d4777ba95462434","code_sha256_prefix":"4d4777ba95462434","mcp_get_code":{"code_sha256":"4d4777ba95462434"}},{"arxiv_id":"2603.16331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-16331","title":"Decoding the Critique Mechanism in Large Reasoning Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mail-research/lrm-critique-vectors","path":"src/activation/activation_extraction.py","file_url":"https://github.com/mail-research/lrm-critique-vectors/blob/HEAD/src/activation/activation_extraction.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c83e792b55372de4","code_sha256_prefix":"c83e792b55372de4","mcp_get_code":{"code_sha256":"c83e792b55372de4"}},{"arxiv_id":"2602.08538","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08538","title":"Trajectory Stitching for Solving Inverse Problems with Flow-Based Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"annegnx/PnP-Flow","path":"pnpflow/fid_score.py","file_url":"https://github.com/annegnx/PnP-Flow/blob/HEAD/pnpflow/fid_score.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, annegnx/PnP-Flow when it was checked","code_sha256":"f10c698bdf0953d7","code_sha256_prefix":"f10c698bdf0953d7","mcp_get_code":{"code_sha256":"f10c698bdf0953d7"}},{"arxiv_id":"2601.06368","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06368","title":"From Easy to Hard++: Promoting Differentially Private Image Synthesis Through Spatial-Frequency Curriculum","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"mseitzer/pytorch-fid","path":"src/pytorch_fid/fid_score.py","file_url":"https://github.com/mseitzer/pytorch-fid/blob/HEAD/src/pytorch_fid/fid_score.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":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}},{"arxiv_id":"2510.24012","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24012","title":"Training-Free Safe Text Embedding Guidance for Text-to-Image Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"aailab-kaist/STG","path":"evaluation/fid.py","file_url":"https://github.com/aailab-kaist/STG/blob/HEAD/evaluation/fid.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":"dad85083840f8ed0","code_sha256_prefix":"dad85083840f8ed0","mcp_get_code":{"code_sha256":"dad85083840f8ed0"}},{"arxiv_id":"2508.19857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-19857","title":"Quantum latent distributions in deep generative models","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"NVlabs/denoising-diffusion-gan","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/NVlabs/denoising-diffusion-gan/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"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, NVlabs/denoising-diffusion-gan (NOASSERTION)","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2503.11050","arxiv_id_is_arxiv":true,"paper":"/paper/distance-based-tree-sliced-wasserstein","title":"Distance-Based Tree-Sliced Wasserstein Distance","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Fsoft-AIC/DbTSW","path":"experiments/denoising-diffusion-gan/pytorch_fid/fid_score.py","file_url":"https://github.com/Fsoft-AIC/DbTSW/blob/HEAD/experiments/denoising-diffusion-gan/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from NVlabs/denoising-diffusion-gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2407.16364","arxiv_id_is_arxiv":true,"paper":"/paper/harmonizing-visual-text-comprehension-and","title":"Harmonizing Visual Text Comprehension and Generation","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/textharmony","path":"TextHarmony/utils/fid_score.py","file_url":"https://github.com/bytedance/textharmony/blob/HEAD/TextHarmony/utils/fid_score.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":"696501a9b5a48e4b","code_sha256_prefix":"696501a9b5a48e4b","mcp_get_code":{"code_sha256":"696501a9b5a48e4b"}},{"arxiv_id":"2407.10972","arxiv_id_is_arxiv":true,"paper":"/paper/vgbench-evaluating-large-language-models-on","title":"VGBench: Evaluating Large Language Models on Vector Graphics Understanding and Generation","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vgbench/VGBench","path":"evaluate_fid_score.py","file_url":"https://github.com/vgbench/VGBench/blob/HEAD/evaluate_fid_score.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":"3f1d9512c08824f8","code_sha256_prefix":"3f1d9512c08824f8","mcp_get_code":{"code_sha256":"3f1d9512c08824f8"}},{"arxiv_id":"2407.04493","arxiv_id_is_arxiv":true,"paper":"/paper/proud-pareto-guided-diffusion-model-for-multi","title":"PROUD: PaRetO-gUided Diffusion Model for Multi-objective Generation","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EvaFlower/Pareto-guided-diffusion-model","path":"CIFAR10/evaluation/fid_score.py","file_url":"https://github.com/EvaFlower/Pareto-guided-diffusion-model/blob/HEAD/CIFAR10/evaluation/fid_score.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, EvaFlower/Pareto-guided-diffusion-model when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2407.04493","arxiv_id_is_arxiv":true,"paper":"/paper/proud-pareto-guided-diffusion-model-for-multi","title":"PROUD: PaRetO-gUided Diffusion Model for Multi-objective Generation","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EvaFlower/Pareto-guided-diffusion-model","path":"CIFAR10/fid.py","file_url":"https://github.com/EvaFlower/Pareto-guided-diffusion-model/blob/HEAD/CIFAR10/fid.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, EvaFlower/Pareto-guided-diffusion-model when it was checked","code_sha256":"7c6610249746c241","code_sha256_prefix":"7c6610249746c241","mcp_get_code":{"code_sha256":"7c6610249746c241"}},{"arxiv_id":"2407.04108","arxiv_id_is_arxiv":true,"paper":"/paper/future-events-as-backdoor-triggers","title":"Future Events as Backdoor Triggers: Investigating Temporal Vulnerabilities in LLMs","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sbp354/future_triggered_backdoors","path":"future_probing/linear_probes/utils/model_utils.py","file_url":"https://github.com/sbp354/future_triggered_backdoors/blob/HEAD/future_probing/linear_probes/utils/model_utils.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, sbp354/future_triggered_backdoors when it was checked","code_sha256":"80941a6b4b9a6ea8","code_sha256_prefix":"80941a6b4b9a6ea8","mcp_get_code":{"code_sha256":"80941a6b4b9a6ea8"}},{"arxiv_id":"2407.00626","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-entropy-inverse-reinforcement-1","title":"Maximum Entropy Inverse Reinforcement Learning of Diffusion Models with Energy-Based Models","date":"2024-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swyoon/Diffusion-by-MaxEntIRL","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/swyoon/Diffusion-by-MaxEntIRL/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 NVlabs/denoising-diffusion-gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2406.12837","arxiv_id_is_arxiv":true,"paper":"/paper/layermerge-neural-network-depth-compression","title":"LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/LayerMerge","path":"Diff-Pruning/exp_code/fid_score.py","file_url":"https://github.com/snu-mllab/LayerMerge/blob/HEAD/Diff-Pruning/exp_code/fid_score.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":"1af4059005f8a78d","code_sha256_prefix":"1af4059005f8a78d","mcp_get_code":{"code_sha256":"1af4059005f8a78d"}},{"arxiv_id":"2406.11799","arxiv_id_is_arxiv":true,"paper":"/paper/mix-domain-contrastive-learning-for-unpaired","title":"Mix-Domain Contrastive Learning for Unpaired H&E-to-IHC Stain Translation","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssongwang/mix-domaincontrastivelearning","path":"util/kid_score.py","file_url":"https://github.com/ssongwang/mix-domaincontrastivelearning/blob/HEAD/util/kid_score.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, ssongwang/mix-domaincontrastivelearning when it was checked","code_sha256":"7b41327814ab3634","code_sha256_prefix":"7b41327814ab3634","mcp_get_code":{"code_sha256":"7b41327814ab3634"}},{"arxiv_id":"2406.07126","arxiv_id_is_arxiv":true,"paper":"/paper/logical-distillation-of-graph-neural-networks","title":"Logical Distillation of Graph Neural Networks","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lexpk/logicaldistillationofgnns","path":"idt/idt.py","file_url":"https://github.com/lexpk/logicaldistillationofgnns/blob/HEAD/idt/idt.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, lexpk/logicaldistillationofgnns when it was checked","code_sha256":"ad7a32d2de23c260","code_sha256_prefix":"ad7a32d2de23c260","mcp_get_code":{"code_sha256":"ad7a32d2de23c260"}},{"arxiv_id":"2406.02540","arxiv_id_is_arxiv":true,"paper":"/paper/vidit-q-efficient-and-accurate-quantization","title":"ViDiT-Q: Efficient and Accurate Quantization of Diffusion Transformers for Image and Video Generation","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a-suozhang/vidit-q","path":"eval/image/evaluation/fid_score.py","file_url":"https://github.com/a-suozhang/vidit-q/blob/HEAD/eval/image/evaluation/fid_score.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, a-suozhang/vidit-q when it was checked","code_sha256":"7961d0b08426e139","code_sha256_prefix":"7961d0b08426e139","mcp_get_code":{"code_sha256":"7961d0b08426e139"}},{"arxiv_id":"2406.00816","arxiv_id_is_arxiv":true,"paper":"/paper/invisible-backdoor-attacks-on-diffusion","title":"Invisible Backdoor Attacks on Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"invisibletriggerdiffusion/invisible_triggers_for_diffusion","path":"fid_score.py","file_url":"https://github.com/invisibletriggerdiffusion/invisible_triggers_for_diffusion/blob/HEAD/fid_score.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, invisibletriggerdiffusion/invisible_triggers_for_diffusion when it was checked","code_sha256":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}},{"arxiv_id":"2405.15232","arxiv_id_is_arxiv":true,"paper":"/paper/deem-diffusion-models-serve-as-the-eyes-of","title":"DEEM: Diffusion Models Serve as the Eyes of Large Language Models for Image Perception","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainbowluocs/deem","path":"uni_interleaved/utils/fid_score.py","file_url":"https://github.com/rainbowluocs/deem/blob/HEAD/uni_interleaved/utils/fid_score.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":"696501a9b5a48e4b","code_sha256_prefix":"696501a9b5a48e4b","mcp_get_code":{"code_sha256":"696501a9b5a48e4b"}},{"arxiv_id":"2405.11135","arxiv_id_is_arxiv":true,"paper":"/paper/aqualora-toward-white-box-protection-for","title":"AquaLoRA: Toward White-box Protection for Customized Stable Diffusion Models via Watermark LoRA","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"georgefwt/aqualora","path":"evaluation/pytorch_fid/fid_score.py","file_url":"https://github.com/georgefwt/aqualora/blob/HEAD/evaluation/pytorch_fid/fid_score.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, georgefwt/aqualora when it was checked","code_sha256":"e82666b86e1ca879","code_sha256_prefix":"e82666b86e1ca879","mcp_get_code":{"code_sha256":"e82666b86e1ca879"}},{"arxiv_id":"2403.18705","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-wasserstein-distances-with","title":"Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jchemseddine/conditional_wasserstein_distances","path":"utils/fid_score.py","file_url":"https://github.com/jchemseddine/conditional_wasserstein_distances/blob/HEAD/utils/fid_score.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, jchemseddine/conditional_wasserstein_distances when it was checked","code_sha256":"f10c698bdf0953d7","code_sha256_prefix":"f10c698bdf0953d7","mcp_get_code":{"code_sha256":"f10c698bdf0953d7"}},{"arxiv_id":"2403.12510","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-consistency-trajectory-models-for","title":"Generalized Consistency Trajectory Models for Image Manipulation","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1202kbs/gctm","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/1202kbs/gctm/blob/HEAD/pytorch_fid/fid_score.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":"df6ccabbf9e086c5","code_sha256_prefix":"df6ccabbf9e086c5","mcp_get_code":{"code_sha256":"df6ccabbf9e086c5"}},{"arxiv_id":"2402.11846","arxiv_id_is_arxiv":true,"paper":"/paper/unlearncanvas-a-stylized-image-dataset-to","title":"UnlearnCanvas: Stylized Image Dataset for Enhanced Machine Unlearning Evaluation in Diffusion Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearncanvas","path":"diffusion_model_finetuning/evaluation/fid.py","file_url":"https://github.com/optml-group/unlearncanvas/blob/HEAD/diffusion_model_finetuning/evaluation/fid.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, optml-group/unlearncanvas when it was checked","code_sha256":"1226d62dd93f8b5f","code_sha256_prefix":"1226d62dd93f8b5f","mcp_get_code":{"code_sha256":"1226d62dd93f8b5f"}},{"arxiv_id":"2401.12517","arxiv_id_is_arxiv":true,"paper":"/paper/ddmi-domain-agnostic-latent-diffusion-models","title":"DDMI: Domain-Agnostic Latent Diffusion Models for Synthesizing High-Quality Implicit Neural Representations","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/DDMI","path":"evals/fid/fid_score.py","file_url":"https://github.com/mlvlab/DDMI/blob/HEAD/evals/fid/fid_score.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":"69fdcf265bb8f96e","code_sha256_prefix":"69fdcf265bb8f96e","mcp_get_code":{"code_sha256":"69fdcf265bb8f96e"}},{"arxiv_id":"2401.12181","arxiv_id_is_arxiv":true,"paper":"/paper/universal-neurons-in-gpt2-language-models","title":"Universal Neurons in GPT2 Language Models","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wesg52/universal-neurons","path":"correlations_fast.py","file_url":"https://github.com/wesg52/universal-neurons/blob/HEAD/correlations_fast.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":"275d9e70c0f07e83","code_sha256_prefix":"275d9e70c0f07e83","mcp_get_code":{"code_sha256":"275d9e70c0f07e83"}},{"arxiv_id":"2401.04247","arxiv_id_is_arxiv":true,"paper":"/paper/robust-image-watermarking-using-stable","title":"Attack-Resilient Image Watermarking Using Stable Diffusion","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanglijun95/ZoDiac","path":"main/fid.py","file_url":"https://github.com/zhanglijun95/ZoDiac/blob/HEAD/main/fid.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, zhanglijun95/ZoDiac when it was checked","code_sha256":"ceb163acb8634f88","code_sha256_prefix":"ceb163acb8634f88","mcp_get_code":{"code_sha256":"ceb163acb8634f88"}},{"arxiv_id":"2312.12431","arxiv_id_is_arxiv":true,"paper":"/paper/on-inference-stability-for-diffusion-models","title":"On Inference Stability for Diffusion Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/sa-dpm","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/vinairesearch/sa-dpm/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, vinairesearch/sa-dpm, is not in the permissive set Syntology serves inline","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2312.12030","arxiv_id_is_arxiv":true,"paper":"/paper/towards-accurate-guided-diffusion-sampling","title":"Towards Accurate Guided Diffusion Sampling through Symplectic Adjoint Method","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanshuyan/adjointdpm","path":"ddpm_and_guided-diffusion/evaluate/fid_score.py","file_url":"https://github.com/hanshuyan/adjointdpm/blob/HEAD/ddpm_and_guided-diffusion/evaluate/fid_score.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, hanshuyan/adjointdpm when it was checked","code_sha256":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}},{"arxiv_id":"2311.17101","arxiv_id_is_arxiv":true,"paper":"/paper/robust-diffusion-gan-using-semi-unbalanced","title":"A High-Quality Robust Diffusion Framework for Corrupted Dataset","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/RDUOT","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/VinAIResearch/RDUOT/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e313af5b82e444c1","code_sha256_prefix":"e313af5b82e444c1","mcp_get_code":{"code_sha256":"e313af5b82e444c1"}},{"arxiv_id":"2311.15941","arxiv_id_is_arxiv":true,"paper":"/paper/tell2design-a-dataset-for-language-guided","title":"Tell2Design: A Dataset for Language-Guided Floor Plan Generation","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lengsicong/tell2design","path":"CogView/eval_utils/fid_score.py","file_url":"https://github.com/lengsicong/tell2design/blob/HEAD/CogView/eval_utils/fid_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lengsicong/tell2design when it was checked","code_sha256":"eb21740d88a30ecb","code_sha256_prefix":"eb21740d88a30ecb","mcp_get_code":{"code_sha256":"eb21740d88a30ecb"}},{"arxiv_id":"2311.06322","arxiv_id_is_arxiv":true,"paper":"/paper/post-training-quantization-with-progressive","title":"Post-training Quantization for Text-to-Image Diffusion Models with Progressive Calibration and Activation Relaxing","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsa18/PCR","path":"quantization_tools/utils/evaluation.py","file_url":"https://github.com/tsa18/PCR/blob/HEAD/quantization_tools/utils/evaluation.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, tsa18/PCR when it was checked","code_sha256":"be8e0dc7aa00a307","code_sha256_prefix":"be8e0dc7aa00a307","mcp_get_code":{"code_sha256":"be8e0dc7aa00a307"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"GMI/fid_score_raw.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/GMI/fid_score_raw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zmtomorrow/mmdgs_neurips, and GitHub detected no licence in that repository when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"DMI/fid_score.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/DMI/fid_score.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":"8dcbb65408aae9e3","code_sha256_prefix":"8dcbb65408aae9e3","mcp_get_code":{"code_sha256":"8dcbb65408aae9e3"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"DMI/fid_score_raw.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/DMI/fid_score_raw.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":"c945372835eb9223","code_sha256_prefix":"c945372835eb9223","mcp_get_code":{"code_sha256":"c945372835eb9223"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"GMI/fid_score.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/GMI/fid_score.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":"7a33df383fc5fb9d","code_sha256_prefix":"7a33df383fc5fb9d","mcp_get_code":{"code_sha256":"7a33df383fc5fb9d"}},{"arxiv_id":"2309.00216","arxiv_id_is_arxiv":true,"paper":"/paper/human-inspired-facial-sketch-synthesis-with","title":"Human-Inspired Facial Sketch Synthesis with Dynamic Adaptation","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AiArt-HDU/HIDA","path":"evaluation/dirs_fid_score.py","file_url":"https://github.com/AiArt-HDU/HIDA/blob/HEAD/evaluation/dirs_fid_score.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":"bbf0f49edc553919","code_sha256_prefix":"bbf0f49edc553919","mcp_get_code":{"code_sha256":"bbf0f49edc553919"}},{"arxiv_id":"2309.00216","arxiv_id_is_arxiv":true,"paper":"/paper/human-inspired-facial-sketch-synthesis-with","title":"Human-Inspired Facial Sketch Synthesis with Dynamic Adaptation","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AiArt-HDU/HIDA","path":"SIFID/sifid_score.py","file_url":"https://github.com/AiArt-HDU/HIDA/blob/HEAD/SIFID/sifid_score.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":"747615e2328307c2","code_sha256_prefix":"747615e2328307c2","mcp_get_code":{"code_sha256":"747615e2328307c2"}},{"arxiv_id":"2309.00216","arxiv_id_is_arxiv":true,"paper":"/paper/human-inspired-facial-sketch-synthesis-with","title":"Human-Inspired Facial Sketch Synthesis with Dynamic Adaptation","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AiArt-HDU/HIDA","path":"SIFID/sifid_score_unet.py","file_url":"https://github.com/AiArt-HDU/HIDA/blob/HEAD/SIFID/sifid_score_unet.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":"ffc8d712b766ae09","code_sha256_prefix":"ffc8d712b766ae09","mcp_get_code":{"code_sha256":"ffc8d712b766ae09"}},{"arxiv_id":"2307.15139","arxiv_id_is_arxiv":true,"paper":"/paper/online-clustered-codebook","title":"Online Clustered Codebook","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyndonzheng/cvq-vae","path":"fid_score.py","file_url":"https://github.com/lyndonzheng/cvq-vae/blob/HEAD/fid_score.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":"3c77e5bea8e44a31","code_sha256_prefix":"3c77e5bea8e44a31","mcp_get_code":{"code_sha256":"3c77e5bea8e44a31"}},{"arxiv_id":"2307.11308","arxiv_id_is_arxiv":true,"paper":"/paper/dpm-ot-a-new-diffusion-probabilistic-model","title":"DPM-OT: A New Diffusion Probabilistic Model Based on Optimal Transport","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cognaclee/dpm-ot","path":"evaluation/fid_score.py","file_url":"https://github.com/cognaclee/dpm-ot/blob/HEAD/evaluation/fid_score.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, cognaclee/dpm-ot when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2307.10829","arxiv_id_is_arxiv":true,"paper":"/paper/exact-diffusion-inversion-via-bi-directional","title":"Exact Diffusion Inversion via Bi-directional Integration Approximation","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoqiang-zhang-x/BDIA","path":"text-to-image/stablediffusionV2/fid_score.py","file_url":"https://github.com/guoqiang-zhang-x/BDIA/blob/HEAD/text-to-image/stablediffusionV2/fid_score.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, guoqiang-zhang-x/BDIA when it was checked","code_sha256":"52f0b0681052dbb6","code_sha256_prefix":"52f0b0681052dbb6","mcp_get_code":{"code_sha256":"52f0b0681052dbb6"}},{"arxiv_id":"2306.10161","arxiv_id_is_arxiv":true,"paper":"/paper/building-the-bridge-of-schrodinger-a-1","title":"Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/entropicotbenchmark","path":"baselines/EntropicNeuralOptimalTransport/src/fid_score.py","file_url":"https://github.com/ngushchin/entropicotbenchmark/blob/HEAD/baselines/EntropicNeuralOptimalTransport/src/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zmtomorrow/mmdgs_neurips, and GitHub detected no licence in that repository when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2306.06874","arxiv_id_is_arxiv":true,"paper":"/paper/villandiffusion-a-unified-backdoor-attack-1","title":"VillanDiffusion: A Unified Backdoor Attack Framework for Diffusion Models","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/villandiffusion","path":"fid_score.py","file_url":"https://github.com/IBM/villandiffusion/blob/HEAD/fid_score.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":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/StyleNAT","path":"utils/fid_score.py","file_url":"https://github.com/SHI-Labs/StyleNAT/blob/HEAD/utils/fid_score.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":"c1f9693596855557","code_sha256_prefix":"c1f9693596855557","mcp_get_code":{"code_sha256":"c1f9693596855557"}},{"arxiv_id":"2305.11650","arxiv_id_is_arxiv":true,"paper":"/paper/moment-matching-denoising-gibbs-sampling","title":"Moment Matching Denoising Gibbs Sampling","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zmtomorrow/mmdgs_neurips","path":"evaluations/fid_score.py","file_url":"https://github.com/zmtomorrow/mmdgs_neurips/blob/HEAD/evaluations/fid_score.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, zmtomorrow/mmdgs_neurips when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2305.08192","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-imperceptible-and","title":"Diffusion Models for Imperceptible and Transferable Adversarial Attack","date":"2023-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"windvchen/diffattack","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/windvchen/diffattack/blob/HEAD/pytorch_fid/fid_score.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":"594c40690017a276","code_sha256_prefix":"594c40690017a276","mcp_get_code":{"code_sha256":"594c40690017a276"}},{"arxiv_id":"2305.00402","arxiv_id_is_arxiv":true,"paper":"/paper/control-variate-sliced-wasserstein-estimators","title":"Sliced Wasserstein Estimation with Control Variates","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khainb/cv-sw","path":"Generative_model/utils/fid_score.py","file_url":"https://github.com/khainb/cv-sw/blob/HEAD/Generative_model/utils/fid_score.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":"e1bb4b52f28ec8e0","code_sha256_prefix":"e1bb4b52f28ec8e0","mcp_get_code":{"code_sha256":"e1bb4b52f28ec8e0"}},{"arxiv_id":"2304.07574","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-incompatible-knowledge-transfer-in","title":"Exploring Incompatible Knowledge Transfer in Few-shot Image Generation","date":"2023-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/RICK","path":"gan_metrics/fid_score.py","file_url":"https://github.com/yunqing-me/RICK/blob/HEAD/gan_metrics/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ssongwang/mix-domaincontrastivelearning, and GitHub detected no licence in that repository when it was checked","code_sha256":"7b41327814ab3634","code_sha256_prefix":"7b41327814ab3634","mcp_get_code":{"code_sha256":"7b41327814ab3634"}},{"arxiv_id":"2304.07574","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-incompatible-knowledge-transfer-in","title":"Exploring Incompatible Knowledge Transfer in Few-shot Image Generation","date":"2023-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/RICK","path":"gan_metrics/kid_score.py","file_url":"https://github.com/yunqing-me/RICK/blob/HEAD/gan_metrics/kid_score.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":"8ab8902f4356f642","code_sha256_prefix":"8ab8902f4356f642","mcp_get_code":{"code_sha256":"8ab8902f4356f642"}},{"arxiv_id":"2303.13062","arxiv_id_is_arxiv":true,"paper":"/paper/siedob-semantic-image-editing-by","title":"SIEDOB: Semantic Image Editing by Disentangling Object and Background","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WuyangLuo/SIEDOB","path":"background/metrics/fid_score.py","file_url":"https://github.com/WuyangLuo/SIEDOB/blob/HEAD/background/metrics/fid_score.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":"dd23efc80f413d67","code_sha256_prefix":"dd23efc80f413d67","mcp_get_code":{"code_sha256":"dd23efc80f413d67"}},{"arxiv_id":"2303.05456","arxiv_id_is_arxiv":true,"paper":"/paper/restoration-based-generative-models","title":"Restoration based Generative Models","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jae-Moo/RGM","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/Jae-Moo/RGM/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 NVlabs/denoising-diffusion-gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2302.04305","arxiv_id_is_arxiv":true,"paper":"/paper/mask-conditional-synthetic-satellite-imagery","title":"Mask Conditional Synthetic Satellite Imagery","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ms-synthetic-satellite-image/synthetic-satellite-imagery","path":"SPADE/fid/fid_score.py","file_url":"https://github.com/ms-synthetic-satellite-image/synthetic-satellite-imagery/blob/HEAD/SPADE/fid/fid_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ms-synthetic-satellite-image/synthetic-satellite-imagery, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"45f6de4604f1141b","code_sha256_prefix":"45f6de4604f1141b","mcp_get_code":{"code_sha256":"45f6de4604f1141b"}},{"arxiv_id":"2302.03262","arxiv_id_is_arxiv":true,"paper":"/paper/membership-inference-attacks-against-1","title":"Membership Inference Attacks against Diffusion Models","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fseclab-osaka/mia-diffusion","path":"TTUR/fid.py","file_url":"https://github.com/fseclab-osaka/mia-diffusion/blob/HEAD/TTUR/fid.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":"1b7fb683b1a517bc","code_sha256_prefix":"1b7fb683b1a517bc","mcp_get_code":{"code_sha256":"1b7fb683b1a517bc"}},{"arxiv_id":"2212.09748","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-diffusion-models-with-transformers","title":"Scalable Diffusion Models with Transformers","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/diffusion-transformer-keras","path":"fid.py","file_url":"https://github.com/milmor/diffusion-transformer-keras/blob/HEAD/fid.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":"b3a0c9d9b68b0ba4","code_sha256_prefix":"b3a0c9d9b68b0ba4","mcp_get_code":{"code_sha256":"b3a0c9d9b68b0ba4"}},{"arxiv_id":"2212.09748","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-diffusion-models-with-transformers","title":"Scalable Diffusion Models with Transformers","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/diffusion-transformer","path":"fid.py","file_url":"https://github.com/milmor/diffusion-transformer/blob/HEAD/fid.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":"63749a9f8d05d87c","code_sha256_prefix":"63749a9f8d05d87c","mcp_get_code":{"code_sha256":"63749a9f8d05d87c"}},{"arxiv_id":"2210.16559","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-image-generation-via-adaptation","title":"Few-shot Image Generation via Adaptation-Aware Kernel Modulation","date":"2022-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/AdAM","path":"gan_metrics/fid_score.py","file_url":"https://github.com/yunqing-me/AdAM/blob/HEAD/gan_metrics/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ssongwang/mix-domaincontrastivelearning, and GitHub detected no licence in that repository when it was checked","code_sha256":"7b41327814ab3634","code_sha256_prefix":"7b41327814ab3634","mcp_get_code":{"code_sha256":"7b41327814ab3634"}},{"arxiv_id":"2210.16559","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-image-generation-via-adaptation","title":"Few-shot Image Generation via Adaptation-Aware Kernel Modulation","date":"2022-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/AdAM","path":"gan_metrics/kid_score.py","file_url":"https://github.com/yunqing-me/AdAM/blob/HEAD/gan_metrics/kid_score.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":"8ab8902f4356f642","code_sha256_prefix":"8ab8902f4356f642","mcp_get_code":{"code_sha256":"8ab8902f4356f642"}},{"arxiv_id":"2210.05950","arxiv_id_is_arxiv":true,"paper":"/paper/zits-image-inpainting-by-improving-the","title":"ZITS++: Image Inpainting by Improving the Incremental Transformer on Structural Priors","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ewrfcas/zits-plusplus","path":"inpainting_metric.py","file_url":"https://github.com/ewrfcas/zits-plusplus/blob/HEAD/inpainting_metric.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":"18bfc140d0a26202","code_sha256_prefix":"18bfc140d0a26202","mcp_get_code":{"code_sha256":"18bfc140d0a26202"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"GMI/fid_score_raw.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/GMI/fid_score_raw.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zmtomorrow/mmdgs_neurips, and GitHub detected no licence in that repository when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"DMI/fid_score.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/DMI/fid_score.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":"8dcbb65408aae9e3","code_sha256_prefix":"8dcbb65408aae9e3","mcp_get_code":{"code_sha256":"8dcbb65408aae9e3"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"DMI/fid_score_raw.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/DMI/fid_score_raw.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":"c945372835eb9223","code_sha256_prefix":"c945372835eb9223","mcp_get_code":{"code_sha256":"c945372835eb9223"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"GMI/fid_score.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/GMI/fid_score.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":"7a33df383fc5fb9d","code_sha256_prefix":"7a33df383fc5fb9d","mcp_get_code":{"code_sha256":"7a33df383fc5fb9d"}},{"arxiv_id":"2205.15269","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-neural-optimal-transport","title":"Kernel Neural Optimal Transport","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamalexkorotin/neuraloptimaltransport","path":"src/fid_score.py","file_url":"https://github.com/iamalexkorotin/neuraloptimaltransport/blob/HEAD/src/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zmtomorrow/mmdgs_neurips, and GitHub detected no licence in that repository when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2204.10965","arxiv_id_is_arxiv":true,"paper":"/paper/clip-dissect-automatic-description-of-neuron","title":"CLIP-Dissect: Automatic Description of Neuron Representations in Deep Vision Networks","date":"2022-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lkopf/cosy","path":"src/utils.py","file_url":"https://github.com/lkopf/cosy/blob/HEAD/src/utils.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, lkopf/cosy when it was checked","code_sha256":"0ad66fe23e6598ce","code_sha256_prefix":"0ad66fe23e6598ce","mcp_get_code":{"code_sha256":"0ad66fe23e6598ce"}},{"arxiv_id":"2203.00867","arxiv_id_is_arxiv":true,"paper":"/paper/incremental-transformer-structure-enhanced","title":"Incremental Transformer Structure Enhanced Image Inpainting with Masking Positional Encoding","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dqiaole/zits","path":"src/inpainting_metrics.py","file_url":"https://github.com/dqiaole/zits/blob/HEAD/src/inpainting_metrics.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":"18bfc140d0a26202","code_sha256_prefix":"18bfc140d0a26202","mcp_get_code":{"code_sha256":"18bfc140d0a26202"}},{"arxiv_id":"2202.06201","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-disentanglement-with-tensor-1","title":"Unsupervised Disentanglement with Tensor Product Representations on the Torus","date":"2022-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rotmanmi/unsupervised-disentanglement-torus","path":"fid_score.py","file_url":"https://github.com/rotmanmi/unsupervised-disentanglement-torus/blob/HEAD/fid_score.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":"6eaf22ac5df52488","code_sha256_prefix":"6eaf22ac5df52488","mcp_get_code":{"code_sha256":"6eaf22ac5df52488"}},{"arxiv_id":"2202.04053","arxiv_id_is_arxiv":true,"paper":"/paper/dall-eval-probing-the-reasoning-skills-and","title":"DALL-Eval: Probing the Reasoning Skills and Social Biases of Text-to-Image Generation Models","date":"2022-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j-min/dalleval","path":"quality/FID/fid_score.py","file_url":"https://github.com/j-min/dalleval/blob/HEAD/quality/FID/fid_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb21740d88a30ecb","code_sha256_prefix":"eb21740d88a30ecb","mcp_get_code":{"code_sha256":"eb21740d88a30ecb"}},{"arxiv_id":"2201.12220","arxiv_id_is_arxiv":true,"paper":"/paper/neural-optimal-transport","title":"Neural Optimal Transport","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milenagazdieva/extremalneuraloptimaltransport","path":"src/fid_score.py","file_url":"https://github.com/milenagazdieva/extremalneuraloptimaltransport/blob/HEAD/src/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zmtomorrow/mmdgs_neurips, and GitHub detected no licence in that repository when it was checked","code_sha256":"56afde1af5757691","code_sha256_prefix":"56afde1af5757691","mcp_get_code":{"code_sha256":"56afde1af5757691"}},{"arxiv_id":"2112.05134","arxiv_id_is_arxiv":true,"paper":"/paper/a-shared-representation-for-photorealistic","title":"A Shared Representation for Photorealistic Driving Simulators","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/semdisc","path":"fid/pytorch-fid/fid_score.py","file_url":"https://github.com/vita-epfl/semdisc/blob/HEAD/fid/pytorch-fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, vita-epfl/semdisc, is not in the permissive set Syntology serves inline","code_sha256":"2222cd506f9b4a12","code_sha256_prefix":"2222cd506f9b4a12","mcp_get_code":{"code_sha256":"2222cd506f9b4a12"}},{"arxiv_id":"2108.10310","arxiv_id_is_arxiv":true,"paper":"/paper/ranking-models-in-unlabeled-new-environments","title":"Ranking Models in Unlabeled New Environments","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sxzrt/Proxy-Set","path":"domain_gap/fd_score_label.py","file_url":"https://github.com/sxzrt/Proxy-Set/blob/HEAD/domain_gap/fd_score_label.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":"8b0372a487a32700","code_sha256_prefix":"8b0372a487a32700","mcp_get_code":{"code_sha256":"8b0372a487a32700"}},{"arxiv_id":"2106.01954","arxiv_id_is_arxiv":true,"paper":"/paper/do-neural-optimal-transport-solvers-work-a","title":"Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamalexkorotin/Wasserstein2GenerativeNetworks","path":"src/fid_score.py","file_url":"https://github.com/iamalexkorotin/Wasserstein2GenerativeNetworks/blob/HEAD/src/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 guoqiang-zhang-x/BDIA, and GitHub detected no licence in that repository when it was checked","code_sha256":"52f0b0681052dbb6","code_sha256_prefix":"52f0b0681052dbb6","mcp_get_code":{"code_sha256":"52f0b0681052dbb6"}},{"arxiv_id":"2106.00134","arxiv_id_is_arxiv":true,"paper":"/paper/gans-can-play-lottery-tickets-too-1","title":"GANs Can Play Lottery Tickets Too","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/GAN-LTH","path":"src/CycleGAN/fid_score.py","file_url":"https://github.com/VITA-Group/GAN-LTH/blob/HEAD/src/CycleGAN/fid_score.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":"f0714ae9daec4654","code_sha256_prefix":"f0714ae9daec4654","mcp_get_code":{"code_sha256":"f0714ae9daec4654"}},{"arxiv_id":"2106.00132","arxiv_id_is_arxiv":true,"paper":"/paper/on-fast-sampling-of-diffusion-probabilistic","title":"On Fast Sampling of Diffusion Probabilistic Models","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FengNiMa/FastDPM_pytorch","path":"pytorch_fid/fid_score.py","file_url":"https://github.com/FengNiMa/FastDPM_pytorch/blob/HEAD/pytorch_fid/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 NVlabs/denoising-diffusion-gan, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"26edbd4467e04bec","code_sha256_prefix":"26edbd4467e04bec","mcp_get_code":{"code_sha256":"26edbd4467e04bec"}},{"arxiv_id":"2104.13714","arxiv_id_is_arxiv":true,"paper":"/paper/the-algonauts-project-2021-challenge-how-the","title":"The Algonauts Project 2021 Challenge: How the Human Brain Makes Sense of a World in Motion","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Neural-Dynamics-of-Visual-Cognition-FUB/Algonauts2021_devkit","path":"perform_encoding.py","file_url":"https://github.com/Neural-Dynamics-of-Visual-Cognition-FUB/Algonauts2021_devkit/blob/HEAD/perform_encoding.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, Neural-Dynamics-of-Visual-Cognition-FUB/Algonauts2021_devkit when it was checked","code_sha256":"f424591c2a63eb9f","code_sha256_prefix":"f424591c2a63eb9f","mcp_get_code":{"code_sha256":"f424591c2a63eb9f"}},{"arxiv_id":"2103.15087","arxiv_id_is_arxiv":true,"paper":"/paper/learning-a-sketch-tensor-space-for-image","title":"Learning a Sketch Tensor Space for Image Inpainting of Man-made Scenes","date":"2021-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ewrfcas/MST_inpainting","path":"src/metrics.py","file_url":"https://github.com/ewrfcas/MST_inpainting/blob/HEAD/src/metrics.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":"18bfc140d0a26202","code_sha256_prefix":"18bfc140d0a26202","mcp_get_code":{"code_sha256":"18bfc140d0a26202"}},{"arxiv_id":"2103.11521","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-frechet-inception-distance","title":"Conditional Frechet Inception Distance","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Michael-Soloveitchik/CFID","path":"evaluate_models.py","file_url":"https://github.com/Michael-Soloveitchik/CFID/blob/HEAD/evaluate_models.py","status":"unverified","verification_level":0,"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":"0d8acc35492e8752","code_sha256_prefix":"0d8acc35492e8752","mcp_get_code":{"code_sha256":"0d8acc35492e8752"}},{"arxiv_id":"2009.05475","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-score-matching-and-improved","title":"Adversarial score matching and improved sampling for image generation","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexiaJM/AdversarialConsistentScoreMatching","path":"evaluation/fid_score.py","file_url":"https://github.com/AlexiaJM/AdversarialConsistentScoreMatching/blob/HEAD/evaluation/fid_score.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":"ea10a012ef6a93a9","code_sha256_prefix":"ea10a012ef6a93a9","mcp_get_code":{"code_sha256":"ea10a012ef6a93a9"}},{"arxiv_id":"2008.11062","arxiv_id_is_arxiv":true,"paper":"/paper/gan-slimming-all-in-one-gan-compression-by-a","title":"GAN Slimming: All-in-One GAN Compression by A Unified Optimization Framework","date":"2020-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/GAN-Slimming","path":"utils/fid_score.py","file_url":"https://github.com/TAMU-VITA/GAN-Slimming/blob/HEAD/utils/fid_score.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":"a15c72fa852b3ce1","code_sha256_prefix":"a15c72fa852b3ce1","mcp_get_code":{"code_sha256":"a15c72fa852b3ce1"}},{"arxiv_id":"2007.09180","arxiv_id_is_arxiv":true,"paper":"/paper/off-policy-reinforcement-learning-for","title":"Off-Policy Reinforcement Learning for Efficient and Effective GAN Architecture Search","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuantian013/E2GAN","path":"eval/utils/fid_score.py","file_url":"https://github.com/Yuantian013/E2GAN/blob/HEAD/eval/utils/fid_score.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":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/LadaGAN-pytorch","path":"fid.py","file_url":"https://github.com/milmor/LadaGAN-pytorch/blob/HEAD/fid.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":"63749a9f8d05d87c","code_sha256_prefix":"63749a9f8d05d87c","mcp_get_code":{"code_sha256":"63749a9f8d05d87c"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uzielroy/StyleGan_FewShot","path":"metric/fid_score.py","file_url":"https://github.com/uzielroy/StyleGan_FewShot/blob/HEAD/metric/fid_score.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":"a3ef5898d81d8dd1","code_sha256_prefix":"a3ef5898d81d8dd1","mcp_get_code":{"code_sha256":"a3ef5898d81d8dd1"}},{"arxiv_id":"2006.08198","arxiv_id_is_arxiv":true,"paper":"/paper/autogan-distiller-searching-to-compress","title":"AutoGAN-Distiller: Searching to Compress Generative Adversarial Networks","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gan-slimming","path":"utils/fid_score.py","file_url":"https://github.com/vita-group/gan-slimming/blob/HEAD/utils/fid_score.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":"a15c72fa852b3ce1","code_sha256_prefix":"a15c72fa852b3ce1","mcp_get_code":{"code_sha256":"a15c72fa852b3ce1"}},{"arxiv_id":"2006.06676","arxiv_id_is_arxiv":true,"paper":"/paper/training-generative-adversarial-networks-with-2","title":"Training Generative Adversarial Networks with Limited Data","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/Face2Webtoon","path":"gan_metrics_pytorch/fid_score.py","file_url":"https://github.com/sangyun884/Face2Webtoon/blob/HEAD/gan_metrics_pytorch/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ssongwang/mix-domaincontrastivelearning, and GitHub detected no licence in that repository when it was checked","code_sha256":"7b41327814ab3634","code_sha256_prefix":"7b41327814ab3634","mcp_get_code":{"code_sha256":"7b41327814ab3634"}},{"arxiv_id":"2006.06676","arxiv_id_is_arxiv":true,"paper":"/paper/training-generative-adversarial-networks-with-2","title":"Training Generative Adversarial Networks with Limited Data","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/Face2Webtoon","path":"gan_metrics_pytorch/kid_score.py","file_url":"https://github.com/sangyun884/Face2Webtoon/blob/HEAD/gan_metrics_pytorch/kid_score.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":"0bdaf2a87d584365","code_sha256_prefix":"0bdaf2a87d584365","mcp_get_code":{"code_sha256":"0bdaf2a87d584365"}},{"arxiv_id":"2003.08932","arxiv_id_is_arxiv":true,"paper":"/paper/giqa-generated-image-quality-assessment","title":"GIQA: Generated Image Quality Assessment","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cientgu/GIQA","path":"write_act.py","file_url":"https://github.com/cientgu/GIQA/blob/HEAD/write_act.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, cientgu/GIQA when it was checked","code_sha256":"1d9cc6c194a064f3","code_sha256_prefix":"1d9cc6c194a064f3","mcp_get_code":{"code_sha256":"1d9cc6c194a064f3"}},{"arxiv_id":"2003.08932","arxiv_id_is_arxiv":true,"paper":"/paper/giqa-generated-image-quality-assessment","title":"GIQA: Generated Image Quality Assessment","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cientgu/GIQA","path":"knn_score.py","file_url":"https://github.com/cientgu/GIQA/blob/HEAD/knn_score.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, cientgu/GIQA when it was checked","code_sha256":"4b138f0c51ebdd65","code_sha256_prefix":"4b138f0c51ebdd65","mcp_get_code":{"code_sha256":"4b138f0c51ebdd65"}},{"arxiv_id":"2003.08932","arxiv_id_is_arxiv":true,"paper":"/paper/giqa-generated-image-quality-assessment","title":"GIQA: Generated Image Quality Assessment","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cientgu/GIQA","path":"gmm_score.py","file_url":"https://github.com/cientgu/GIQA/blob/HEAD/gmm_score.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, cientgu/GIQA when it was checked","code_sha256":"d5acd480789791cd","code_sha256_prefix":"d5acd480789791cd","mcp_get_code":{"code_sha256":"d5acd480789791cd"}},{"arxiv_id":"2003.04618","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-occupancy-networks","title":"Convolutional Occupancy Networks","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/campari","path":"gan_training/fid_score.py","file_url":"https://github.com/autonomousvision/campari/blob/HEAD/gan_training/fid_score.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":"e66ab01277a4349c","code_sha256_prefix":"e66ab01277a4349c","mcp_get_code":{"code_sha256":"e66ab01277a4349c"}},{"arxiv_id":"2003.04297","arxiv_id_is_arxiv":true,"paper":"/paper/improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavoiems/SADt","path":"src/common/evaluation/fid.py","file_url":"https://github.com/lavoiems/SADt/blob/HEAD/src/common/evaluation/fid.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":"96aec64c84c32d81","code_sha256_prefix":"96aec64c84c32d81","mcp_get_code":{"code_sha256":"96aec64c84c32d81"}},{"arxiv_id":"2003.02567","arxiv_id_is_arxiv":true,"paper":"/paper/ganwriting-content-conditioned-generation-of","title":"GANwriting: Content-Conditioned Generation of Styled Handwritten Word Images","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omni-us/research-GANwriting","path":"fid_folder/fid_score_crop64x64.py","file_url":"https://github.com/omni-us/research-GANwriting/blob/HEAD/fid_folder/fid_score_crop64x64.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":"376156fa11538683","code_sha256_prefix":"376156fa11538683","mcp_get_code":{"code_sha256":"376156fa11538683"}},{"arxiv_id":"1912.07414","arxiv_id_is_arxiv":true,"paper":"/paper/learning-canonical-representations-for-scene","title":"Learning Canonical Representations for Scene Graph to Image Generation","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roeiherz/CanonicalSg2Im","path":"evaluation/fid_tf.py","file_url":"https://github.com/roeiherz/CanonicalSg2Im/blob/HEAD/evaluation/fid_tf.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":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"arxiv_id":"1912.07414","arxiv_id_is_arxiv":true,"paper":"/paper/learning-canonical-representations-for-scene","title":"Learning Canonical Representations for Scene Graph to Image Generation","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roeiherz/CanonicalSg2Im","path":"evaluation/fid/fid_score.py","file_url":"https://github.com/roeiherz/CanonicalSg2Im/blob/HEAD/evaluation/fid/fid_score.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":"868290905012e985","code_sha256_prefix":"868290905012e985","mcp_get_code":{"code_sha256":"868290905012e985"}},{"arxiv_id":"1912.02037","arxiv_id_is_arxiv":true,"paper":"/paper/adversarialnas-adversarial-neural","title":"AdversarialNAS: Adversarial Neural Architecture Search for GANs","date":"2019-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chengaopro/AdversarialNAS","path":"utils/fid_score.py","file_url":"https://github.com/chengaopro/AdversarialNAS/blob/HEAD/utils/fid_score.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":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"arxiv_id":"1910.06922","arxiv_id_is_arxiv":true,"paper":"/paper/connections-between-support-vector-machines","title":"Gradient penalty from a maximum margin perspective","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexiaJM/MaximumMarginGANs","path":"Code/fid.py","file_url":"https://github.com/AlexiaJM/MaximumMarginGANs/blob/HEAD/Code/fid.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":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"arxiv_id":"1907.10830","arxiv_id_is_arxiv":true,"paper":"/paper/u-gat-it-unsupervised-generative-attentional","title":"U-GAT-IT: Unsupervised Generative Attentional Networks with Adaptive Layer-Instance Normalization for Image-to-Image Translation","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/WebtoonFaces","path":"gan_metrics_pytorch/fid_score.py","file_url":"https://github.com/sangyun884/WebtoonFaces/blob/HEAD/gan_metrics_pytorch/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 ssongwang/mix-domaincontrastivelearning, and GitHub detected no licence in that repository when it was checked","code_sha256":"7b41327814ab3634","code_sha256_prefix":"7b41327814ab3634","mcp_get_code":{"code_sha256":"7b41327814ab3634"}},{"arxiv_id":"1907.10830","arxiv_id_is_arxiv":true,"paper":"/paper/u-gat-it-unsupervised-generative-attentional","title":"U-GAT-IT: Unsupervised Generative Attentional Networks with Adaptive Layer-Instance Normalization for Image-to-Image Translation","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/WebtoonFaces","path":"gan_metrics_pytorch/kid_score.py","file_url":"https://github.com/sangyun884/WebtoonFaces/blob/HEAD/gan_metrics_pytorch/kid_score.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":"0bdaf2a87d584365","code_sha256_prefix":"0bdaf2a87d584365","mcp_get_code":{"code_sha256":"0bdaf2a87d584365"}},{"arxiv_id":"1906.10335","arxiv_id_is_arxiv":true,"paper":"/paper/perceptual-generative-autoencoders","title":"Perceptual Generative Autoencoders","date":"2019-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zj10/PGA","path":"src/fid.py","file_url":"https://github.com/zj10/PGA/blob/HEAD/src/fid.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":"f3156e8742e34851","code_sha256_prefix":"f3156e8742e34851","mcp_get_code":{"code_sha256":"f3156e8742e34851"}},{"arxiv_id":"1905.01164","arxiv_id_is_arxiv":true,"paper":"/paper/singan-learning-a-generative-model-from-a","title":"SinGAN: Learning a Generative Model from a Single Natural Image","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CREVIOS/MediSinGAN","path":"SinGAN_pytorch/SIFID/sifid_score.py","file_url":"https://github.com/CREVIOS/MediSinGAN/blob/HEAD/SinGAN_pytorch/SIFID/sifid_score.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":"747615e2328307c2","code_sha256_prefix":"747615e2328307c2","mcp_get_code":{"code_sha256":"747615e2328307c2"}},{"arxiv_id":"1905.00414","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-of-neural-network-representations","title":"Similarity of Neural Network Representations Revisited","date":"2019-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/NeuronAlignment","path":"utils/crosscorrelation.py","file_url":"https://github.com/IBM/NeuronAlignment/blob/HEAD/utils/crosscorrelation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ca7973c5cf3fa73e","code_sha256_prefix":"ca7973c5cf3fa73e","mcp_get_code":{"code_sha256":"ca7973c5cf3fa73e"}},{"arxiv_id":"1904.07399","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-wing-loss-for-robust-face-alignment","title":"Adaptive Wing Loss for Robust Face Alignment via Heatmap Regression","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"affromero/SMILE","path":"metrics/fid_score.py","file_url":"https://github.com/affromero/SMILE/blob/HEAD/metrics/fid_score.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":"914550130b4d8353","code_sha256_prefix":"914550130b4d8353","mcp_get_code":{"code_sha256":"914550130b4d8353"}},{"arxiv_id":"1904.01310","arxiv_id_is_arxiv":true,"paper":"/paper/dm-gan-dynamic-memory-generative-adversarial","title":"DM-GAN: Dynamic Memory Generative Adversarial Networks for Text-to-Image Synthesis","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MinfengZhu/DM-GAN","path":"eval/FID/fid_score.py","file_url":"https://github.com/MinfengZhu/DM-GAN/blob/HEAD/eval/FID/fid_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb21740d88a30ecb","code_sha256_prefix":"eb21740d88a30ecb","mcp_get_code":{"code_sha256":"eb21740d88a30ecb"}},{"arxiv_id":"1812.08985","arxiv_id_is_arxiv":true,"paper":"/paper/non-adversarial-image-synthesis-with","title":"Non-Adversarial Image Synthesis with Generative Latent Nearest Neighbors","date":"2018-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedidh/glann","path":"fid_score.py","file_url":"https://github.com/yedidh/glann/blob/HEAD/fid_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29b09c5229b5a227","code_sha256_prefix":"29b09c5229b5a227","mcp_get_code":{"code_sha256":"29b09c5229b5a227"}},{"arxiv_id":"1807.11458","arxiv_id_is_arxiv":true,"paper":"/paper/to-learn-image-super-resolution-use-a-gan-to","title":"To learn image super-resolution, use a GAN to learn how to do image degradation first","date":"2018-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingyang2017/Face-and-Image-super-resolution","path":"fid_score.py","file_url":"https://github.com/jingyang2017/Face-and-Image-super-resolution/blob/HEAD/fid_score.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":"375c5265f7f3141f","code_sha256_prefix":"375c5265f7f3141f","mcp_get_code":{"code_sha256":"375c5265f7f3141f"}},{"arxiv_id":"1806.04326","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-compositional-kernel-learning","title":"Differentiable Compositional Kernel Learning for Gaussian Processes","date":"2018-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thjashin/spectral-stein-grad","path":"utils/fid.py","file_url":"https://github.com/thjashin/spectral-stein-grad/blob/HEAD/utils/fid.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":"e69fcd6206886931","code_sha256_prefix":"e69fcd6206886931","mcp_get_code":{"code_sha256":"e69fcd6206886931"}},{"arxiv_id":"1806.00035","arxiv_id_is_arxiv":true,"paper":"/paper/assessing-generative-models-via-precision-and","title":"Assessing Generative Models via Precision and Recall","date":"2018-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ok1zjf/lbae","path":"fid.py","file_url":"https://github.com/ok1zjf/lbae/blob/HEAD/fid.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":"579daa09f4887be8","code_sha256_prefix":"579daa09f4887be8","mcp_get_code":{"code_sha256":"579daa09f4887be8"}},{"arxiv_id":"1804.01947","arxiv_id_is_arxiv":true,"paper":"/paper/sliced-wasserstein-autoencoder-an","title":"Sliced-Wasserstein Autoencoder: An Embarrassingly Simple Generative Model","date":"2018-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmum/cwae-pytorch","path":"src/externals/fid_score.py","file_url":"https://github.com/gmum/cwae-pytorch/blob/HEAD/src/externals/fid_score.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":"17714704b95f3299","code_sha256_prefix":"17714704b95f3299","mcp_get_code":{"code_sha256":"17714704b95f3299"}},{"arxiv_id":"1802.10551","arxiv_id_is_arxiv":true,"paper":"/paper/a-variational-inequality-perspective-on","title":"A Variational Inequality Perspective on Generative Adversarial Networks","date":"2018-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GauthierGidel/Variational-Inequality-GAN","path":"tflib/fid.py","file_url":"https://github.com/GauthierGidel/Variational-Inequality-GAN/blob/HEAD/tflib/fid.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, GauthierGidel/Variational-Inequality-GAN, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"1caccbdb2933aa22","code_sha256_prefix":"1caccbdb2933aa22","mcp_get_code":{"code_sha256":"1caccbdb2933aa22"}},{"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":"NikhitaMethwani/Deep-Fakes-Cars-Generation","path":"metrics/frechet_inception_distance.py","file_url":"https://github.com/NikhitaMethwani/Deep-Fakes-Cars-Generation/blob/HEAD/metrics/frechet_inception_distance.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":"a50999e17e91e763","code_sha256_prefix":"a50999e17e91e763","mcp_get_code":{"code_sha256":"a50999e17e91e763"}},{"arxiv_id":"1706.08500","arxiv_id_is_arxiv":true,"paper":"/paper/gans-trained-by-a-two-time-scale-update-rule","title":"GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium","date":"2017-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yenchenlin/fid","path":"fid_score.py","file_url":"https://github.com/yenchenlin/fid/blob/HEAD/fid_score.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":"04254f2109518e2b","code_sha256_prefix":"04254f2109518e2b","mcp_get_code":{"code_sha256":"04254f2109518e2b"}},{"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":"ranery/Bayesian-CycleGAN","path":"evaluation/fid.py","file_url":"https://github.com/ranery/Bayesian-CycleGAN/blob/HEAD/evaluation/fid.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":"e22554578964be22","code_sha256_prefix":"e22554578964be22","mcp_get_code":{"code_sha256":"e22554578964be22"}},{"arxiv_id":"1511.06422","arxiv_id_is_arxiv":true,"paper":"/paper/all-you-need-is-a-good-init","title":"All you need is a good init","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonasWechsler/DeepLearningLab5","path":"lsuv_init.py","file_url":"https://github.com/JonasWechsler/DeepLearningLab5/blob/HEAD/lsuv_init.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":"f0ac7f8a003439d1","code_sha256_prefix":"f0ac7f8a003439d1","mcp_get_code":{"code_sha256":"f0ac7f8a003439d1"}},{"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":"WANG-Chaoyue/EvolutionaryGAN-pytorch","path":"TTUR/fid.py","file_url":"https://github.com/WANG-Chaoyue/EvolutionaryGAN-pytorch/blob/HEAD/TTUR/fid.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":"8b1528ac9fa94b80","code_sha256_prefix":"8b1528ac9fa94b80","mcp_get_code":{"code_sha256":"8b1528ac9fa94b80"}},{"arxiv_id":"1404.3878","arxiv_id_is_arxiv":true,"paper":"/paper/nilmtk-an-open-source-toolkit-for-non","title":"NILMTK: An Open Source Toolkit for Non-intrusive Load Monitoring","date":null,"month_inferred_from_arxiv_id":"2014-04","title_source":"archive","repo":"nilmtk/nilmtk","path":"nilmtk/electric.py","file_url":"https://github.com/nilmtk/nilmtk/blob/HEAD/nilmtk/electric.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":"bc8862f5db26e09c","code_sha256_prefix":"bc8862f5db26e09c","mcp_get_code":{"code_sha256":"bc8862f5db26e09c"}},{"arxiv_id":"aaai_28602","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28602","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Sainzerjj/SFERD","path":"metrics/fid_score.py","file_url":"https://github.com/Sainzerjj/SFERD/blob/HEAD/metrics/fid_score.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":"4c3e68855135f3e5","code_sha256_prefix":"4c3e68855135f3e5","mcp_get_code":{"code_sha256":"4c3e68855135f3e5"}},{"arxiv_id":"aaai_28210","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28210","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AnonymousPony/adap-edit","path":"metrics/fid_score.py","file_url":"https://github.com/AnonymousPony/adap-edit/blob/HEAD/metrics/fid_score.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":"dd23efc80f413d67","code_sha256_prefix":"dd23efc80f413d67","mcp_get_code":{"code_sha256":"dd23efc80f413d67"}},{"arxiv_id":"Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Han_UIBDiffusion_Universal_Imperceptible_Backdoor_Attack_for_Diffusion_Models_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TheLaoLab/UIBDiffusion","path":"fid_score.py","file_url":"https://github.com/TheLaoLab/UIBDiffusion/blob/HEAD/fid_score.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":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}},{"arxiv_id":"Guo_Painting_From_Part_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Guo_Painting_From_Part_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhenglab/partpainting","path":"scores/fid_score.py","file_url":"https://github.com/zhenglab/partpainting/blob/HEAD/scores/fid_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 zhenglab/CAML, and GitHub detected no licence in that repository when it was checked","code_sha256":"4d4777ba95462434","code_sha256_prefix":"4d4777ba95462434","mcp_get_code":{"code_sha256":"4d4777ba95462434"}},{"arxiv_id":"Chou_How_to_Backdoor_Diffusion_Models_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chou_How_to_Backdoor_Diffusion_Models_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IBM/BadDiffusion","path":"fid_score.py","file_url":"https://github.com/IBM/BadDiffusion/blob/HEAD/fid_score.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":"9f5980b8530c7409","code_sha256_prefix":"9f5980b8530c7409","mcp_get_code":{"code_sha256":"9f5980b8530c7409"}}],"record_sha256":"54fbe9c86b2193b8d69df5224b1d44f00d4f9a8d2bf332e1fdbfdfb58908f7b3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}