{"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/gauss-kernel","entry":"gauss_kernel","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":13,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":16,"n_places_pointer_only":4,"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":3,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":1},"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":"2601.21026","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21026","title":"Diffusion-based Annealed Boltzmann Generators : benefits, pitfalls and hopes","date":"2026-01-28","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"h2o64/dabg","path":"dabg/metrics/mmd.py","file_url":"https://github.com/h2o64/dabg/blob/HEAD/dabg/metrics/mmd.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":"dc8452534f652dbb","code_sha256_prefix":"dc8452534f652dbb","mcp_get_code":{"code_sha256":"dc8452534f652dbb"}},{"arxiv_id":"2508.00443","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-00443","title":"SDMatte: Grafting Diffusion Models for Interactive Matting","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"vivoCameraResearch/SDMatte","path":"criterion.py","file_url":"https://github.com/vivoCameraResearch/SDMatte/blob/HEAD/criterion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4991ebb886e5289","code_sha256_prefix":"b4991ebb886e5289","mcp_get_code":{"code_sha256":"b4991ebb886e5289"}},{"arxiv_id":"2407.02315","arxiv_id_is_arxiv":true,"paper":"/paper/vfimamba-video-frame-interpolation-with-state","title":"VFIMamba: Video Frame Interpolation with State Space Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcg-nju/vfimamba","path":"model/loss.py","file_url":"https://github.com/mcg-nju/vfimamba/blob/HEAD/model/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"337a38a7be8077eb","code_sha256_prefix":"337a38a7be8077eb","mcp_get_code":{"code_sha256":"337a38a7be8077eb"}},{"arxiv_id":"2406.18079","arxiv_id_is_arxiv":true,"paper":"/paper/mfdnet-multi-frequency-deflare-network-for","title":"MFDNet: Multi-Frequency Deflare Network for Efficient Nighttime Flare Removal","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiang-maomao/flare-removal","path":"models/model.py","file_url":"https://github.com/Jiang-maomao/flare-removal/blob/HEAD/models/model.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, Jiang-maomao/flare-removal when it was checked","code_sha256":"1076d550021d2b1f","code_sha256_prefix":"1076d550021d2b1f","mcp_get_code":{"code_sha256":"1076d550021d2b1f"}},{"arxiv_id":"2406.09754","arxiv_id_is_arxiv":true,"paper":"/paper/lavib-a-large-scale-video-interpolation","title":"LAVIB: A Large-scale Video Interpolation Benchmark","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexandrosstergiou/lavib","path":"VFI_codebases/EMA-VFI/model/loss.py","file_url":"https://github.com/alexandrosstergiou/lavib/blob/HEAD/VFI_codebases/EMA-VFI/model/loss.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, alexandrosstergiou/lavib when it was checked","code_sha256":"337a38a7be8077eb","code_sha256_prefix":"337a38a7be8077eb","mcp_get_code":{"code_sha256":"337a38a7be8077eb"}},{"arxiv_id":"2310.11401","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-group-fairness-in-online-settings","title":"Enhancing Group Fairness in Online Settings Using Oblique Decision Forests","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/Aranyani","path":"src/utils.py","file_url":"https://github.com/brcsomnath/Aranyani/blob/HEAD/src/utils.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":"53f142ebde71a9b7","code_sha256_prefix":"53f142ebde71a9b7","mcp_get_code":{"code_sha256":"53f142ebde71a9b7"}},{"arxiv_id":"2308.02097","arxiv_id_is_arxiv":true,"paper":"/paper/multi-interactive-feature-learning-and-a-full","title":"Multi-interactive Feature Learning and a Full-time Multi-modality Benchmark for Image Fusion and Segmentation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinyuanliu-cv/segmif","path":"lap_loss.py","file_url":"https://github.com/jinyuanliu-cv/segmif/blob/HEAD/lap_loss.py","status":"ran","verification_level":1,"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, jinyuanliu-cv/segmif when it was checked","code_sha256":"4a150d48b91667f9","code_sha256_prefix":"4a150d48b91667f9","mcp_get_code":{"code_sha256":"4a150d48b91667f9"}},{"arxiv_id":"2306.04121","arxiv_id_is_arxiv":true,"paper":"/paper/matte-anything-interactive-natural-image","title":"Matte Anything: Interactive Natural Image Matting with Segment Anything Models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hustvl/matte-anything","path":"modeling/criterion/matting_criterion.py","file_url":"https://github.com/hustvl/matte-anything/blob/HEAD/modeling/criterion/matting_criterion.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4991ebb886e5289","code_sha256_prefix":"b4991ebb886e5289","mcp_get_code":{"code_sha256":"b4991ebb886e5289"}},{"arxiv_id":"2301.08880","arxiv_id_is_arxiv":true,"paper":"/paper/a-large-scale-film-style-dataset-for-learning","title":"A Large-scale Film Style Dataset for Learning Multi-frequency Driven Film Enhancement","date":"2023-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CXH-Research/FilmNet","path":"models/filmnet.py","file_url":"https://github.com/CXH-Research/FilmNet/blob/HEAD/models/filmnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"650511897d732139","code_sha256_prefix":"650511897d732139","mcp_get_code":{"code_sha256":"650511897d732139"}},{"arxiv_id":"2203.03373","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-texture-for-fooling-person","title":"Adversarial Texture for Fooling Person Detectors in the Physical World","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WhoTHU/Adversarial_Texture","path":"utils.py","file_url":"https://github.com/WhoTHU/Adversarial_Texture/blob/HEAD/utils.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":"c3819a0a3c702ec5","code_sha256_prefix":"c3819a0a3c702ec5","mcp_get_code":{"code_sha256":"c3819a0a3c702ec5"}},{"arxiv_id":"2109.14120","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-on-a-sequence-of-imbalanced","title":"Meta Learning on a Sequence of Imbalanced Domains with Difficulty Awareness","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/imbalancemeta","path":"utils.py","file_url":"https://github.com/joey-wang123/imbalancemeta/blob/HEAD/utils.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":"635fb4926879256e","code_sha256_prefix":"635fb4926879256e","mcp_get_code":{"code_sha256":"635fb4926879256e"}},{"arxiv_id":"2004.03828","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-normalization-for-conditional-image","title":"Attentive Normalization for Conditional Image Generation","date":"2020-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shepnerd/AttenNorm","path":"inpaint-attnorm/net/ops.py","file_url":"https://github.com/shepnerd/AttenNorm/blob/HEAD/inpaint-attnorm/net/ops.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":"c5bc38ee9334ced5","code_sha256_prefix":"c5bc38ee9334ced5","mcp_get_code":{"code_sha256":"c5bc38ee9334ced5"}},{"arxiv_id":"1909.09264","arxiv_id_is_arxiv":true,"paper":"/paper/comparing-distributions-ell_1-geometry","title":"Comparing distributions: $\\ell_1$ geometry improves kernel two-sample testing","date":"2019-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meyerscetbon/l1_two_sample_test","path":"l1_two_sample_test.py","file_url":"https://github.com/meyerscetbon/l1_two_sample_test/blob/HEAD/l1_two_sample_test.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, meyerscetbon/l1_two_sample_test when it was checked","code_sha256":"5d101457cc360c0d","code_sha256_prefix":"5d101457cc360c0d","mcp_get_code":{"code_sha256":"5d101457cc360c0d"}},{"arxiv_id":"1810.08771","arxiv_id_is_arxiv":true,"paper":"/paper/image-inpainting-via-generative-multi-column","title":"Image Inpainting via Generative Multi-column Convolutional Neural Networks","date":"2018-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shepnerd/inpainting_gmcnn","path":"tensorflow/net/ops.py","file_url":"https://github.com/shepnerd/inpainting_gmcnn/blob/HEAD/tensorflow/net/ops.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":"c5bc38ee9334ced5","code_sha256_prefix":"c5bc38ee9334ced5","mcp_get_code":{"code_sha256":"c5bc38ee9334ced5"}},{"arxiv_id":"1810.08771","arxiv_id_is_arxiv":true,"paper":"/paper/image-inpainting-via-generative-multi-column","title":"Image Inpainting via Generative Multi-column Convolutional Neural Networks","date":"2018-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shepnerd/inpainting_gmcnn","path":"pytorch/util/utils.py","file_url":"https://github.com/shepnerd/inpainting_gmcnn/blob/HEAD/pytorch/util/utils.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":"23913d3031134cec","code_sha256_prefix":"23913d3031134cec","mcp_get_code":{"code_sha256":"23913d3031134cec"}},{"arxiv_id":"1603.08155","arxiv_id_is_arxiv":true,"paper":"/paper/perceptual-losses-for-real-time-style","title":"Perceptual Losses for Real-Time Style Transfer and Super-Resolution","date":"2016-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZyoungXu/MoSt-DSA","path":"model/loss.py","file_url":"https://github.com/ZyoungXu/MoSt-DSA/blob/HEAD/model/loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"337a38a7be8077eb","code_sha256_prefix":"337a38a7be8077eb","mcp_get_code":{"code_sha256":"337a38a7be8077eb"}}],"record_sha256":"2a75129d7ed1962a922fa7bb418d0c5d439217c209226be8aa1e1ca091d194e7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}