{"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/calculate-fid","entry":"calculate_fid","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":26,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":9,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":16,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":8,"n_places":27,"n_places_pointer_only":10,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":5,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":4,"unverified":5},"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":"2412.09328","arxiv_id_is_arxiv":true,"paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Utils/context_fid.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/context_fid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20a4af10369ee6be","code_sha256_prefix":"20a4af10369ee6be","mcp_get_code":{"code_sha256":"20a4af10369ee6be"}},{"arxiv_id":"2412.04653","arxiv_id_is_arxiv":true,"paper":"/paper/hidden-in-the-noise-two-stage-robust","title":"Hidden in the Noise: Two-Stage Robust Watermarking for Images","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kasraarabi/Hidden-in-the-Noise","path":"inpainting.py","file_url":"https://github.com/Kasraarabi/Hidden-in-the-Noise/blob/HEAD/inpainting.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, Kasraarabi/Hidden-in-the-Noise when it was checked","code_sha256":"77b4519fb573daf7","code_sha256_prefix":"77b4519fb573daf7","mcp_get_code":{"code_sha256":"77b4519fb573daf7"}},{"arxiv_id":"2412.01427","arxiv_id_is_arxiv":true,"paper":"/paper/foundir-unleashing-million-scale-training","title":"FoundIR: Unleashing Million-scale Training Data to Advance Foundation Models for Image Restoration","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"House-Leo/FoundIR","path":"metrics/fid.py","file_url":"https://github.com/House-Leo/FoundIR/blob/HEAD/metrics/fid.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":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2411.07506","arxiv_id_is_arxiv":true,"paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Utils/context_fid.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Utils/context_fid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, unites-lab/fmts when it was checked","code_sha256":"20a4af10369ee6be","code_sha256_prefix":"20a4af10369ee6be","mcp_get_code":{"code_sha256":"20a4af10369ee6be"}},{"arxiv_id":"2411.01978","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-variational-autoencoders-with","title":"Understanding Variational Autoencoders with Intrinsic Dimension and Information Imbalance","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance","path":"vae_framework/utils/analysing_utils.py","file_url":"https://github.com/bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance/blob/HEAD/vae_framework/utils/analysing_utils.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, bancaditalia/understanding-variational-autoencoders-with-intrinsic-dimension-and-information-imbalance, is not in the permissive set Syntology serves inline","code_sha256":"5b90856055b90f54","code_sha256_prefix":"5b90856055b90f54","mcp_get_code":{"code_sha256":"5b90856055b90f54"}},{"arxiv_id":"2410.07167","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-cross-modal-alignment-in-large","title":"Deciphering Cross-Modal Alignment in Large Vision-Language Models with Modality Integration Rate","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikiw/modality-integration-rate","path":"mir_util.py","file_url":"https://github.com/shikiw/modality-integration-rate/blob/HEAD/mir_util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"708dccbfcaada399","code_sha256_prefix":"708dccbfcaada399","mcp_get_code":{"code_sha256":"708dccbfcaada399"}},{"arxiv_id":"2410.05725","arxiv_id_is_arxiv":true,"paper":"/paper/knowledgesg-privacy-preserving-synthetic-text","title":"KnowledgeSG: Privacy-Preserving Synthetic Text Generation with Knowledge Distillation from Server","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwh0411/KnowledgeSG","path":"evaluation/similarity.py","file_url":"https://github.com/wwh0411/KnowledgeSG/blob/HEAD/evaluation/similarity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wwh0411/KnowledgeSG when it was checked","code_sha256":"7fedf1b6457b251e","code_sha256_prefix":"7fedf1b6457b251e","mcp_get_code":{"code_sha256":"7fedf1b6457b251e"}},{"arxiv_id":"2409.02772","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-causal-representation-learning-with","title":"Unifying Causal Representation Learning with the Invariance Principle","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causallearningai/istant","path":"src/fid.py","file_url":"https://github.com/causallearningai/istant/blob/HEAD/src/fid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96b4601bba4ef6a5","code_sha256_prefix":"96b4601bba4ef6a5","mcp_get_code":{"code_sha256":"96b4601bba4ef6a5"}},{"arxiv_id":"2409.01274","arxiv_id_is_arxiv":true,"paper":"/paper/davide-depth-aware-video-deblurring","title":"DAVIDE: Depth-Aware Video Deblurring","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"germanftv/DAVIDE-Benckmark","path":"basicsr/metrics/fid.py","file_url":"https://github.com/germanftv/DAVIDE-Benckmark/blob/HEAD/basicsr/metrics/fid.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":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2405.09879","arxiv_id_is_arxiv":true,"paper":"/paper/generative-unlearning-for-any-identity","title":"Generative Unlearning for Any Identity","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KHU-AGI/GUIDE","path":"evaluate_fid.py","file_url":"https://github.com/KHU-AGI/GUIDE/blob/HEAD/evaluate_fid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KHU-AGI/GUIDE when it was checked","code_sha256":"cd2592a84ba8679b","code_sha256_prefix":"cd2592a84ba8679b","mcp_get_code":{"code_sha256":"cd2592a84ba8679b"}},{"arxiv_id":"2405.03349","arxiv_id_is_arxiv":true,"paper":"/paper/retinexmamba-retinex-based-mamba-for-low","title":"Retinexmamba: Retinex-based Mamba for Low-light Image Enhancement","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YhuoyuH/RetinexMamba","path":"basicsr/metrics/fid.py","file_url":"https://github.com/YhuoyuH/RetinexMamba/blob/HEAD/basicsr/metrics/fid.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":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2403.08330","arxiv_id_is_arxiv":true,"paper":"/paper/activating-wider-areas-in-image-super","title":"Activating Wider Areas in Image Super-Resolution","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arsenalcheng/mma","path":"basicsr/metrics/fid.py","file_url":"https://github.com/arsenalcheng/mma/blob/HEAD/basicsr/metrics/fid.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":"12e4da1c3a5ba27b","code_sha256_prefix":"12e4da1c3a5ba27b","mcp_get_code":{"code_sha256":"12e4da1c3a5ba27b"}},{"arxiv_id":"2403.01749","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-synthetic-data-via-1","title":"Differentially Private Synthetic Data via Foundation Model APIs 2: Text","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/aug-pe","path":"metric.py","file_url":"https://github.com/AI-secure/aug-pe/blob/HEAD/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb7941cb1fafb89d","code_sha256_prefix":"fb7941cb1fafb89d","mcp_get_code":{"code_sha256":"fb7941cb1fafb89d"}},{"arxiv_id":"2403.01742","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-ts-interpretable-diffusion-for","title":"Diffusion-TS: Interpretable Diffusion for General Time Series Generation","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"y-debug-sys/diffusion-ts","path":"Utils/context_fid.py","file_url":"https://github.com/y-debug-sys/diffusion-ts/blob/HEAD/Utils/context_fid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20a4af10369ee6be","code_sha256_prefix":"20a4af10369ee6be","mcp_get_code":{"code_sha256":"20a4af10369ee6be"}},{"arxiv_id":"2401.15235","arxiv_id_is_arxiv":true,"paper":"/paper/cascadedgaze-efficiency-in-global-context","title":"CascadedGaze: Efficiency in Global Context Extraction for Image Restoration","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ascend-Research/CascadedGaze","path":"basicsr/metrics/fid.py","file_url":"https://github.com/Ascend-Research/CascadedGaze/blob/HEAD/basicsr/metrics/fid.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":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2401.00027","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-multi-scale-network-with-learnable","title":"Efficient Multi-scale Network with Learnable Discrete Wavelet Transform for Blind Motion Deblurring","date":"2023-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thqiu0419/mlwnet","path":"basicsr/metrics/fid.py","file_url":"https://github.com/thqiu0419/mlwnet/blob/HEAD/basicsr/metrics/fid.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, thqiu0419/mlwnet when it was checked","code_sha256":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2309.03755","arxiv_id_is_arxiv":true,"paper":"/paper/tsgbench-time-series-generation-benchmark","title":"TSGBench: Time Series Generation Benchmark","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihaoang/tsgbench","path":"src/evaluation.py","file_url":"https://github.com/yihaoang/tsgbench/blob/HEAD/src/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yihaoang/tsgbench when it was checked","code_sha256":"7fedf1b6457b251e","code_sha256_prefix":"7fedf1b6457b251e","mcp_get_code":{"code_sha256":"7fedf1b6457b251e"}},{"arxiv_id":"2308.14036","arxiv_id_is_arxiv":true,"paper":"/paper/mb-taylorformer-multi-branch-efficient","title":"MB-TaylorFormer: Multi-branch Efficient Transformer Expanded by Taylor Formula for Image Dehazing","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fvl2020/iccv-2023-mb-taylorformer","path":"basicsr/metrics/fid.py","file_url":"https://github.com/fvl2020/iccv-2023-mb-taylorformer/blob/HEAD/basicsr/metrics/fid.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, fvl2020/iccv-2023-mb-taylorformer when it was checked","code_sha256":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2308.11096","arxiv_id_is_arxiv":true,"paper":"/paper/mosaiq-quantum-generative-adversarial","title":"MosaiQ: Quantum Generative Adversarial Networks for Image Generation on NISQ Computers","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SilverEngineered/MosaiQ","path":"mosaiq.py","file_url":"https://github.com/SilverEngineered/MosaiQ/blob/HEAD/mosaiq.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SilverEngineered/MosaiQ when it was checked","code_sha256":"7fedf1b6457b251e","code_sha256_prefix":"7fedf1b6457b251e","mcp_get_code":{"code_sha256":"7fedf1b6457b251e"}},{"arxiv_id":"2308.11096","arxiv_id_is_arxiv":true,"paper":"/paper/mosaiq-quantum-generative-adversarial","title":"MosaiQ: Quantum Generative Adversarial Networks for Image Generation on NISQ Computers","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SilverEngineered/MosaiQ","path":"patchgan.py","file_url":"https://github.com/SilverEngineered/MosaiQ/blob/HEAD/patchgan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SilverEngineered/MosaiQ when it was checked","code_sha256":"78469f28fe2b6979","code_sha256_prefix":"78469f28fe2b6979","mcp_get_code":{"code_sha256":"78469f28fe2b6979"}},{"arxiv_id":"2306.11970","arxiv_id_is_arxiv":true,"paper":"/paper/rsmt-real-time-stylized-motion-transition-for","title":"RSMT: Real-time Stylized Motion Transition for Characters","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyujunjun/rsmt-realtime-stylized-motion-transition","path":"benchmark.py","file_url":"https://github.com/yuyujunjun/rsmt-realtime-stylized-motion-transition/blob/HEAD/benchmark.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":"900e189485f326e2","code_sha256_prefix":"900e189485f326e2","mcp_get_code":{"code_sha256":"900e189485f326e2"}},{"arxiv_id":"2303.04743","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantized-time-series-generation-with","title":"Vector Quantized Time Series Generation with a Bidirectional Prior Model","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danelee2601/supervised-fcn","path":"supervised_FCN/example_compute_FID.py","file_url":"https://github.com/danelee2601/supervised-fcn/blob/HEAD/supervised_FCN/example_compute_FID.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ddb5d4fd13cf25d","code_sha256_prefix":"2ddb5d4fd13cf25d","mcp_get_code":{"code_sha256":"2ddb5d4fd13cf25d"}},{"arxiv_id":"2303.02881","arxiv_id_is_arxiv":true,"paper":"/paper/kbnet-kernel-basis-network-for-image","title":"KBNet: Kernel Basis Network for Image Restoration","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyi-3/kbnet","path":"basicsr/metrics/fid.py","file_url":"https://github.com/zhangyi-3/kbnet/blob/HEAD/basicsr/metrics/fid.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":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"2209.12890","arxiv_id_is_arxiv":true,"paper":"/paper/it-takes-two-learning-to-plan-for-human-robot","title":"It Takes Two: Learning to Plan for Human-Robot Cooperative Carrying","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleyng/cooperative_planner","path":"utils/stats.py","file_url":"https://github.com/eleyng/cooperative_planner/blob/HEAD/utils/stats.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":"4994ba2de5da1d5f","code_sha256_prefix":"4994ba2de5da1d5f","mcp_get_code":{"code_sha256":"4994ba2de5da1d5f"}},{"arxiv_id":"2204.04676","arxiv_id_is_arxiv":true,"paper":"/paper/simple-baselines-for-image-restoration","title":"Simple Baselines for Image Restoration","date":"2022-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"murufeng/FUIR","path":"basicsr/metrics/fid.py","file_url":"https://github.com/murufeng/FUIR/blob/HEAD/basicsr/metrics/fid.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d7ce6d6dd7ff5c1","code_sha256_prefix":"1d7ce6d6dd7ff5c1","mcp_get_code":{"code_sha256":"1d7ce6d6dd7ff5c1"}},{"arxiv_id":"1903.04411","arxiv_id_is_arxiv":true,"paper":"/paper/stroke-based-artistic-rendering-agent-with","title":"Learning to Paint With Model-based Deep Reinforcement Learning","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pschaldenbrand/ContentMaskedLoss","path":"fid.py","file_url":"https://github.com/pschaldenbrand/ContentMaskedLoss/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":"c3ce44b77ba5ecb6","code_sha256_prefix":"c3ce44b77ba5ecb6","mcp_get_code":{"code_sha256":"c3ce44b77ba5ecb6"}},{"arxiv_id":"openreview_Y3cUZ8fNnu","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_Y3cUZ8fNnu","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"chouliuzuo/IVQ","path":"vision_experiment/score/score_functions.py","file_url":"https://github.com/chouliuzuo/IVQ/blob/HEAD/vision_experiment/score/score_functions.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":"d732beae348368a7","code_sha256_prefix":"d732beae348368a7","mcp_get_code":{"code_sha256":"d732beae348368a7"}}],"record_sha256":"7c8b6cdd41b7b01f9eb6a9f76cda0a99c36e42fd38112ea9ba73bf11448ee89d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}