{"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/gaussian-filter","entry":"gaussian_filter","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":21,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":10,"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":14,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":22,"n_places_pointer_only":6,"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":2,"ran_fixture":3,"ran":7,"unverified":2},"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":"2510.20762","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-20762","title":"MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Johnny1188/meicoder","path":"csng/losses.py","file_url":"https://github.com/Johnny1188/meicoder/blob/HEAD/csng/losses.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, Johnny1188/meicoder when it was checked","code_sha256":"28a8030dafe33601","code_sha256_prefix":"28a8030dafe33601","mcp_get_code":{"code_sha256":"28a8030dafe33601"}},{"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_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":"4f04a1ea76a14dc9","code_sha256_prefix":"4f04a1ea76a14dc9","mcp_get_code":{"code_sha256":"4f04a1ea76a14dc9"}},{"arxiv_id":"2412.02099","arxiv_id_is_arxiv":true,"paper":"/paper/accdiffusion-v2-towards-more-accurate-higher","title":"AccDiffusion v2: Towards More Accurate Higher-Resolution Diffusion Extrapolation","date":"2024-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhxmu/accdiffusion_v2","path":"accdiffusion_plus.py","file_url":"https://github.com/lzhxmu/accdiffusion_v2/blob/HEAD/accdiffusion_plus.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzhxmu/accdiffusion_v2 when it was checked","code_sha256":"d62a181623d1f0cf","code_sha256_prefix":"d62a181623d1f0cf","mcp_get_code":{"code_sha256":"d62a181623d1f0cf"}},{"arxiv_id":"2410.06055","arxiv_id_is_arxiv":true,"paper":"/paper/ap-ldm-attentive-and-progressive-latent","title":"AP-LDM: Attentive and Progressive Latent Diffusion Model for Training-Free High-Resolution Image Generation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmittle/RepLDM","path":"InferencePipelines/RepLDM/pipeline_repldm_sdxl.py","file_url":"https://github.com/kmittle/RepLDM/blob/HEAD/InferencePipelines/RepLDM/pipeline_repldm_sdxl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d62a181623d1f0cf","code_sha256_prefix":"d62a181623d1f0cf","mcp_get_code":{"code_sha256":"d62a181623d1f0cf"}},{"arxiv_id":"2410.06055","arxiv_id_is_arxiv":true,"paper":"/paper/ap-ldm-attentive-and-progressive-latent","title":"AP-LDM: Attentive and Progressive Latent Diffusion Model for Training-Free High-Resolution Image Generation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmittle/ap-ldm","path":"InferencePipelines/FreeScale/scale_attention.py","file_url":"https://github.com/kmittle/ap-ldm/blob/HEAD/InferencePipelines/FreeScale/scale_attention.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":"c4ce1939cbcf8432","code_sha256_prefix":"c4ce1939cbcf8432","mcp_get_code":{"code_sha256":"c4ce1939cbcf8432"}},{"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":"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, axi404/pmt when it was checked","code_sha256":"a45837742fe325cc","code_sha256_prefix":"a45837742fe325cc","mcp_get_code":{"code_sha256":"a45837742fe325cc"}},{"arxiv_id":"2409.02919","arxiv_id_is_arxiv":true,"paper":"/paper/hiprompt-tuning-free-higher-resolution","title":"HiPrompt: Tuning-free Higher-Resolution Generation with Hierarchical MLLM Prompts","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liuxinyv/HiPrompt","path":"hiprompt_sdxl_llava.py","file_url":"https://github.com/Liuxinyv/HiPrompt/blob/HEAD/hiprompt_sdxl_llava.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Liuxinyv/HiPrompt when it was checked","code_sha256":"d62a181623d1f0cf","code_sha256_prefix":"d62a181623d1f0cf","mcp_get_code":{"code_sha256":"d62a181623d1f0cf"}},{"arxiv_id":"2407.10738","arxiv_id_is_arxiv":true,"paper":"/paper/accdiffusion-an-accurate-method-for-higher","title":"AccDiffusion: An Accurate Method for Higher-Resolution Image Generation","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhxmu/AccDiffusion","path":"accdiffusion_sdxl.py","file_url":"https://github.com/lzhxmu/AccDiffusion/blob/HEAD/accdiffusion_sdxl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzhxmu/AccDiffusion when it was checked","code_sha256":"d62a181623d1f0cf","code_sha256_prefix":"d62a181623d1f0cf","mcp_get_code":{"code_sha256":"d62a181623d1f0cf"}},{"arxiv_id":"2311.16973","arxiv_id_is_arxiv":true,"paper":"/paper/demofusion-democratising-high-resolution","title":"DemoFusion: Democratising High-Resolution Image Generation With No $$$","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PRIS-CV/DemoFusion","path":"pipeline_demofusion_sdxl_controlnet.py","file_url":"https://github.com/PRIS-CV/DemoFusion/blob/HEAD/pipeline_demofusion_sdxl_controlnet.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":"d62a181623d1f0cf","code_sha256_prefix":"d62a181623d1f0cf","mcp_get_code":{"code_sha256":"d62a181623d1f0cf"}},{"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":"fd04084240f82190","code_sha256_prefix":"fd04084240f82190","mcp_get_code":{"code_sha256":"fd04084240f82190"}},{"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":"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":"ad0128e7c4e3e49b","code_sha256_prefix":"ad0128e7c4e3e49b","mcp_get_code":{"code_sha256":"ad0128e7c4e3e49b"}},{"arxiv_id":"2005.01338","arxiv_id_is_arxiv":true,"paper":"/paper/a-comparative-study-of-image-quality","title":"Comparison of Image Quality Models for Optimization of Image Processing Systems","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingkeyan93/IQA-optimization","path":"IQA_pytorch/SSIM.py","file_url":"https://github.com/dingkeyan93/IQA-optimization/blob/HEAD/IQA_pytorch/SSIM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e62294c5d41ce581","code_sha256_prefix":"e62294c5d41ce581","mcp_get_code":{"code_sha256":"e62294c5d41ce581"}},{"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":"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":"569f86999a28550f","code_sha256_prefix":"569f86999a28550f","mcp_get_code":{"code_sha256":"569f86999a28550f"}},{"arxiv_id":"1909.04240","arxiv_id_is_arxiv":true,"paper":"/paper/neural-reparameterization-improves-structural","title":"Neural reparameterization improves structural optimization","date":"2019-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/neural-structural-optimization","path":"neural_structural_optimization/autograd_lib.py","file_url":"https://github.com/google-research/neural-structural-optimization/blob/HEAD/neural_structural_optimization/autograd_lib.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84190a23c8eac7e1","code_sha256_prefix":"84190a23c8eac7e1","mcp_get_code":{"code_sha256":"84190a23c8eac7e1"}},{"arxiv_id":"1806.07421","arxiv_id_is_arxiv":true,"paper":"/paper/rise-randomized-input-sampling-for","title":"RISE: Randomized Input Sampling for Explanation of Black-box Models","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlue-c/PyTorch-Explanations","path":"torchvex/meaningful_perturbation/mask.py","file_url":"https://github.com/vlue-c/PyTorch-Explanations/blob/HEAD/torchvex/meaningful_perturbation/mask.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":"049ca000aec357e1","code_sha256_prefix":"049ca000aec357e1","mcp_get_code":{"code_sha256":"049ca000aec357e1"}},{"arxiv_id":"1804.07729","arxiv_id_is_arxiv":true,"paper":"/paper/adef-an-iterative-algorithm-to-construct","title":"ADef: an Iterative Algorithm to Construct Adversarial Deformations","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MashmallowWoR/AdversarialDeformation","path":"deformation.py","file_url":"https://github.com/MashmallowWoR/AdversarialDeformation/blob/HEAD/deformation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"553839a61a4e4927","code_sha256_prefix":"553839a61a4e4927","mcp_get_code":{"code_sha256":"553839a61a4e4927"}},{"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":"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":"569f86999a28550f","code_sha256_prefix":"569f86999a28550f","mcp_get_code":{"code_sha256":"569f86999a28550f"}},{"arxiv_id":"1409.4842","arxiv_id_is_arxiv":true,"paper":"/paper/going-deeper-with-convolutions","title":"Going Deeper with Convolutions","date":"2014-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HolmesShuan/AIM2020-RealSR","path":"src/calculate_score.py","file_url":"https://github.com/HolmesShuan/AIM2020-RealSR/blob/HEAD/src/calculate_score.py","status":"ran","verification_level":1,"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":"569f86999a28550f","code_sha256_prefix":"569f86999a28550f","mcp_get_code":{"code_sha256":"569f86999a28550f"}},{"arxiv_id":"1312.6082","arxiv_id_is_arxiv":true,"paper":"/paper/multi-digit-number-recognition-from-street","title":"Multi-digit Number Recognition from Street View Imagery using Deep Convolutional Neural Networks","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Factotum8/test_task_street_view_house_numbers","path":"CNN_eval.py","file_url":"https://github.com/Factotum8/test_task_street_view_house_numbers/blob/HEAD/CNN_eval.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":"cb97dd4d6528d2bd","code_sha256_prefix":"cb97dd4d6528d2bd","mcp_get_code":{"code_sha256":"cb97dd4d6528d2bd"}},{"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":"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":"aff2d226c2edfa22","code_sha256_prefix":"aff2d226c2edfa22","mcp_get_code":{"code_sha256":"aff2d226c2edfa22"}},{"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":"ran_fixture","verification_level":1,"contract_check":"RAISES","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":"a45837742fe325cc","code_sha256_prefix":"a45837742fe325cc","mcp_get_code":{"code_sha256":"a45837742fe325cc"}},{"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":"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":"569f86999a28550f","code_sha256_prefix":"569f86999a28550f","mcp_get_code":{"code_sha256":"569f86999a28550f"}}],"record_sha256":"b79aebfbc95385fd2be5bd32bf30ac133082ce5add4769a2578e136059c442cd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}