{"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/ms-ssim","entry":"ms_ssim","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":10,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":0,"ran":2,"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.09492","arxiv_id_is_arxiv":true,"paper":"/paper/video-seal-open-and-efficient-video","title":"Video Seal: Open and Efficient Video Watermarking","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/videoseal","path":"videoseal/losses/ssim.py","file_url":"https://github.com/facebookresearch/videoseal/blob/HEAD/videoseal/losses/ssim.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":"3ba1a73724675e43","code_sha256_prefix":"3ba1a73724675e43","mcp_get_code":{"code_sha256":"3ba1a73724675e43"}},{"arxiv_id":"2409.05122","arxiv_id_is_arxiv":true,"paper":"/paper/pmt-progressive-mean-teacher-via-exploring","title":"PMT: Progressive Mean Teacher via Exploring Temporal Consistency for Semi-Supervised Medical Image Segmentation","date":"2024-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axi404/pmt","path":"code/utils/ssim.py","file_url":"https://github.com/axi404/pmt/blob/HEAD/code/utils/ssim.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, axi404/pmt when it was checked","code_sha256":"b00b0478090975d8","code_sha256_prefix":"b00b0478090975d8","mcp_get_code":{"code_sha256":"b00b0478090975d8"}},{"arxiv_id":"2303.15528","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-domain-adaptation-for-low-light-raw","title":"Few-Shot Domain Adaptation for Low Light RAW Image Enhancement","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vishal-V/FSDA-LowLight","path":"pytorch_msssim/ssim.py","file_url":"https://github.com/Vishal-V/FSDA-LowLight/blob/HEAD/pytorch_msssim/ssim.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":"9eed7a6520919cad","code_sha256_prefix":"9eed7a6520919cad","mcp_get_code":{"code_sha256":"9eed7a6520919cad"}},{"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":"losses/ssim.py","file_url":"https://github.com/AlexiaJM/AdversarialConsistentScoreMatching/blob/HEAD/losses/ssim.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":"488d353bf6efcbec","code_sha256_prefix":"488d353bf6efcbec","mcp_get_code":{"code_sha256":"488d353bf6efcbec"}},{"arxiv_id":"2008.13751","arxiv_id_is_arxiv":true,"paper":"/paper/plug-and-play-image-restoration-with-deep","title":"Plug-and-Play Image Restoration with Deep Denoiser Prior","date":"2020-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HedgehogCode/denoising-gan","path":"dngan/metrics.py","file_url":"https://github.com/HedgehogCode/denoising-gan/blob/HEAD/dngan/metrics.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":"c45644bf0bcadf02","code_sha256_prefix":"c45644bf0bcadf02","mcp_get_code":{"code_sha256":"c45644bf0bcadf02"}},{"arxiv_id":"2001.01568","arxiv_id_is_arxiv":true,"paper":"/paper/learned-image-compression-with-discretized","title":"Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modules","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiuLei95/PyTorch-Learned-Image-Compression-with-GMM-and-Attention","path":"models/ms_ssim_torch.py","file_url":"https://github.com/LiuLei95/PyTorch-Learned-Image-Compression-with-GMM-and-Attention/blob/HEAD/models/ms_ssim_torch.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":"7ea107a5705e6f95","code_sha256_prefix":"7ea107a5705e6f95","mcp_get_code":{"code_sha256":"7ea107a5705e6f95"}},{"arxiv_id":"1611.01704","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-optimized-image-compression","title":"End-to-end Optimized Image Compression","date":"2016-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liujiaheng/iclr_17_compression","path":"models/ms_ssim_torch.py","file_url":"https://github.com/liujiaheng/iclr_17_compression/blob/HEAD/models/ms_ssim_torch.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":"7ea107a5705e6f95","code_sha256_prefix":"7ea107a5705e6f95","mcp_get_code":{"code_sha256":"7ea107a5705e6f95"}},{"arxiv_id":"Yang_TINC_Tree-Structured_Implicit_Neural_Compression_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yang_TINC_Tree-Structured_Implicit_Neural_Compression_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RichealYoung/TINC","path":"utils/ssim.py","file_url":"https://github.com/RichealYoung/TINC/blob/HEAD/utils/ssim.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":"22ea7e9167c99736","code_sha256_prefix":"22ea7e9167c99736","mcp_get_code":{"code_sha256":"22ea7e9167c99736"}},{"arxiv_id":"Wang_MCF_Mutual_Correction_Framework_for_Semi-Supervised_Medical_Image_Segmentation_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_MCF_Mutual_Correction_Framework_for_Semi-Supervised_Medical_Image_Segmentation_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WYC-321/MCF","path":"code/utils/ssim.py","file_url":"https://github.com/WYC-321/MCF/blob/HEAD/code/utils/ssim.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 axi404/pmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"b00b0478090975d8","code_sha256_prefix":"b00b0478090975d8","mcp_get_code":{"code_sha256":"b00b0478090975d8"}},{"arxiv_id":"Huang_Fast_Light-Field_Disparity_Estimation_With_Multi-Disparity-Scale_Cost_Aggregation_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_Fast_Light-Field_Disparity_Estimation_With_Multi-Disparity-Scale_Cost_Aggregation_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zcong17huang/FastLFnet","path":"codeStep1/utils/loss_function.py","file_url":"https://github.com/zcong17huang/FastLFnet/blob/HEAD/codeStep1/utils/loss_function.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":"7ea107a5705e6f95","code_sha256_prefix":"7ea107a5705e6f95","mcp_get_code":{"code_sha256":"7ea107a5705e6f95"}}],"record_sha256":"b9eccc783b0e7b7cc94475f4bda2fb787a9450f8073983353152dab68a0f723f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}