{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/nmse","entry":"nmse","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":6,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2604.12709","paper":"/paper/arxiv-2604-12709","title":"Information-Theoretic Optimization for Task-Adapted Compressed Sensing Magnetic Resonance Imaging","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"tianweiy/SeqMRI","path":"activemri/baselines/loupe_codes/evaluate.py","file_url":"https://github.com/tianweiy/SeqMRI/blob/HEAD/activemri/baselines/loupe_codes/evaluate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"2603.18865","paper":"/paper/arxiv-2603-18865","title":"RadioDiff-FS: Physics-Informed Manifold Alignment in Few-Shot Diffusion Models for High-Fidelity Radio Map Construction","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"UNIC-Lab/RadioDiff-FS","path":"sample_cond_ldm.py","file_url":"https://github.com/UNIC-Lab/RadioDiff-FS/blob/HEAD/sample_cond_ldm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"72d54925372f4621","mcp_get_code":{"code_sha256":"72d54925372f4621"}},{"arxiv_id":"2411.00605","paper":"/paper/pcagan-improving-posterior-sampling-cgans-via","title":"pcaGAN: Improving Posterior-Sampling cGANs via Principal Component Regularization","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matt-bendel/pcaGAN","path":"fastmri/evaluate.py","file_url":"https://github.com/matt-bendel/pcaGAN/blob/HEAD/fastmri/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"447cd6130df407d3","mcp_get_code":{"code_sha256":"447cd6130df407d3"}},{"arxiv_id":"2407.00088","paper":"/paper/t-mac-cpu-renaissance-via-table-lookup-for","title":"T-MAC: CPU Renaissance via Table Lookup for Low-Bit LLM Deployment on Edge","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/t-mac","path":"python/t_mac/utils.py","file_url":"https://github.com/microsoft/t-mac/blob/HEAD/python/t_mac/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5b5ce60e0071b862","mcp_get_code":{"code_sha256":"5b5ce60e0071b862"}},{"arxiv_id":"2309.06642","paper":"/paper/adapt-and-diffuse-sample-adaptive","title":"Adapt and Diffuse: Sample-adaptive Reconstruction via Latent Diffusion Models","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"z-fabian/flash-diffusion","path":"data_utils/metrics.py","file_url":"https://github.com/z-fabian/flash-diffusion/blob/HEAD/data_utils/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"72801f6286d3dbe7","mcp_get_code":{"code_sha256":"72801f6286d3dbe7"}},{"arxiv_id":"2202.04744","paper":"/paper/robust-bayesian-inference-for-simulator-based","title":"Robust Bayesian Inference for Simulator-based Models via the MMD Posterior Bootstrap","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haritadell/npl_mmd_project","path":"run_gandk.py","file_url":"https://github.com/haritadell/npl_mmd_project/blob/HEAD/run_gandk.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b28dd5a8c6e77246","mcp_get_code":{"code_sha256":"b28dd5a8c6e77246"}},{"arxiv_id":"2010.16262","paper":"/paper/experimental-design-for-mri-by-greedy-policy","title":"Experimental design for MRI by greedy policy search","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Timsey/pg_mri","path":"src/reconstruction_model/reconstruction_model_utils.py","file_url":"https://github.com/Timsey/pg_mri/blob/HEAD/src/reconstruction_model/reconstruction_model_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"1912.09278","paper":"/paper/-net-systematic-evaluation-of-iterative-deep","title":"$Σ$-net: Systematic Evaluation of Iterative Deep Neural Networks for Fast Parallel MR Image Reconstruction","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khammernik/sigmanet","path":"reconstruction/common/evaluate.py","file_url":"https://github.com/khammernik/sigmanet/blob/HEAD/reconstruction/common/evaluate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"1907.10033","paper":"/paper/vs-net-variable-splitting-network-for","title":"VS-Net: Variable splitting network for accelerated parallel MRI reconstruction","date":"2019-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j-duan/VS-Net","path":"vs_net.py","file_url":"https://github.com/j-duan/VS-Net/blob/HEAD/vs_net.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}}]}