{"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/nmse","entry":"nmse","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":1,"ran_violates":3,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.12709","arxiv_id_is_arxiv":true,"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":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 j-duan/VS-Net, and GitHub detected no licence in that repository when it was checked","code_sha256":"d6ba4d694236aa92","code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"2603.18865","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UNIC-Lab/RadioDiff-FS when it was checked","code_sha256":"72d54925372f4621","code_sha256_prefix":"72d54925372f4621","mcp_get_code":{"code_sha256":"72d54925372f4621"}},{"arxiv_id":"2411.00605","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, matt-bendel/pcaGAN when it was checked","code_sha256":"447cd6130df407d3","code_sha256_prefix":"447cd6130df407d3","mcp_get_code":{"code_sha256":"447cd6130df407d3"}},{"arxiv_id":"2407.00088","arxiv_id_is_arxiv":true,"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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b5ce60e0071b862","code_sha256_prefix":"5b5ce60e0071b862","mcp_get_code":{"code_sha256":"5b5ce60e0071b862"}},{"arxiv_id":"2309.06642","arxiv_id_is_arxiv":true,"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":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, z-fabian/flash-diffusion when it was checked","code_sha256":"72801f6286d3dbe7","code_sha256_prefix":"72801f6286d3dbe7","mcp_get_code":{"code_sha256":"72801f6286d3dbe7"}},{"arxiv_id":"2202.04744","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, haritadell/npl_mmd_project when it was checked","code_sha256":"b28dd5a8c6e77246","code_sha256_prefix":"b28dd5a8c6e77246","mcp_get_code":{"code_sha256":"b28dd5a8c6e77246"}},{"arxiv_id":"2010.16262","arxiv_id_is_arxiv":true,"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":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 j-duan/VS-Net, and GitHub detected no licence in that repository when it was checked","code_sha256":"d6ba4d694236aa92","code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"1912.09278","arxiv_id_is_arxiv":true,"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":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 j-duan/VS-Net, and GitHub detected no licence in that repository when it was checked","code_sha256":"d6ba4d694236aa92","code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}},{"arxiv_id":"1907.10033","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, j-duan/VS-Net when it was checked","code_sha256":"d6ba4d694236aa92","code_sha256_prefix":"d6ba4d694236aa92","mcp_get_code":{"code_sha256":"d6ba4d694236aa92"}}],"record_sha256":"7d104552178cf22bc6a7c05f0b9122ff559dee38029c8ecfe6417d3d4e299eff","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}