{"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/get-gaussian-kernel","entry":"get_gaussian_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":17,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":3,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":17,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":7,"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":"2605.00578","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00578","title":"Federated Distillation for Whole Slide Image via Gaussian-Mixture Feature Alignment and Curriculum Integration","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HuahuaCodes/FedHD-ICML2026","path":"FedHD/utils/swd_loss.py","file_url":"https://github.com/HuahuaCodes/FedHD-ICML2026/blob/HEAD/FedHD/utils/swd_loss.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":"c8ceba12b6020549","code_sha256_prefix":"c8ceba12b6020549","mcp_get_code":{"code_sha256":"c8ceba12b6020549"}},{"arxiv_id":"2601.22763","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22763","title":"Is Task-Specific Training Necessary for Anomaly Detection?","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"longkukuhi/RAD","path":"rad_mvtec_visa_3dadam.py","file_url":"https://github.com/longkukuhi/RAD/blob/HEAD/rad_mvtec_visa_3dadam.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, longkukuhi/RAD when it was checked","code_sha256":"7e823caaaa915829","code_sha256_prefix":"7e823caaaa915829","mcp_get_code":{"code_sha256":"7e823caaaa915829"}},{"arxiv_id":"2505.23068","arxiv_id_is_arxiv":true,"paper":"/paper/urwkv-unified-rwkv-model-with-multi-state","title":"URWKV: Unified RWKV Model with Multi-state Perspective for Low-light Image Restoration","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FZU-N/URWKV","path":"custom_utils/losses.py","file_url":"https://github.com/FZU-N/URWKV/blob/HEAD/custom_utils/losses.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":"7f494e37955dbf6d","code_sha256_prefix":"7f494e37955dbf6d","mcp_get_code":{"code_sha256":"7f494e37955dbf6d"}},{"arxiv_id":"2407.12292","arxiv_id_is_arxiv":true,"paper":"/paper/any-target-can-be-offense-adversarial-example","title":"Any Target Can be Offense: Adversarial Example Generation via Generalized Latent Infection","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VL-Group/GAKer","path":"utils/gaussian_smoothing.py","file_url":"https://github.com/VL-Group/GAKer/blob/HEAD/utils/gaussian_smoothing.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, VL-Group/GAKer when it was checked","code_sha256":"2d69878edb36c4fa","code_sha256_prefix":"2d69878edb36c4fa","mcp_get_code":{"code_sha256":"2d69878edb36c4fa"}},{"arxiv_id":"2407.10179","arxiv_id_is_arxiv":true,"paper":"/paper/clip-guided-networks-for-transferable","title":"CLIP-Guided Generative Networks for Transferable Targeted Adversarial Attacks","date":"2024-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ffhibnese/CGNC_Targeted_Adversarial_Attacks","path":"models/generator.py","file_url":"https://github.com/ffhibnese/CGNC_Targeted_Adversarial_Attacks/blob/HEAD/models/generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ffhibnese/CGNC_Targeted_Adversarial_Attacks when it was checked","code_sha256":"7c954dffd6b6e3f5","code_sha256_prefix":"7c954dffd6b6e3f5","mcp_get_code":{"code_sha256":"7c954dffd6b6e3f5"}},{"arxiv_id":"2406.05531","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-adversarial-transferability-via","title":"Enhancing Adversarial Transferability via Information Bottleneck Constraints","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints","path":"gaussian_smoothing.py","file_url":"https://github.com/biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints/blob/HEAD/gaussian_smoothing.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, biqing-qi/enhancing-adversarial-transferability-via-information-bottleneck-constraints when it was checked","code_sha256":"2d69878edb36c4fa","code_sha256_prefix":"2d69878edb36c4fa","mcp_get_code":{"code_sha256":"2d69878edb36c4fa"}},{"arxiv_id":"2311.01323","arxiv_id_is_arxiv":true,"paper":"/paper/towards-evaluating-transfer-based-attacks","title":"Towards Evaluating Transfer-based Attacks Systematically, Practically, and Fairly","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qizhangli/TA-Bench","path":"models/condgenerators.py","file_url":"https://github.com/qizhangli/TA-Bench/blob/HEAD/models/condgenerators.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, qizhangli/TA-Bench when it was checked","code_sha256":"7c954dffd6b6e3f5","code_sha256_prefix":"7c954dffd6b6e3f5","mcp_get_code":{"code_sha256":"7c954dffd6b6e3f5"}},{"arxiv_id":"2106.12673","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-deformable-image-registration","title":"Conditional Deformable Image Registration with Convolutional Neural Network","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cwmok/dirac","path":"Code/Functions.py","file_url":"https://github.com/cwmok/dirac/blob/HEAD/Code/Functions.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":"55263643ea3ef4b6","code_sha256_prefix":"55263643ea3ef4b6","mcp_get_code":{"code_sha256":"55263643ea3ef4b6"}},{"arxiv_id":"2104.01431","arxiv_id_is_arxiv":true,"paper":"/paper/aggregated-contextual-transformations-for","title":"Aggregated Contextual Transformations for High-Resolution Image Inpainting","date":"2021-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"researchmm/AOT-GAN-for-Inpainting","path":"src/loss/common.py","file_url":"https://github.com/researchmm/AOT-GAN-for-Inpainting/blob/HEAD/src/loss/common.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":"0dcc94152add7d84","code_sha256_prefix":"0dcc94152add7d84","mcp_get_code":{"code_sha256":"0dcc94152add7d84"}},{"arxiv_id":"2007.15651","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-for-unpaired-image-to","title":"Contrastive Learning for Unpaired Image-to-Image Translation","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiudingCai/EnCo-pytorch","path":"util/SWD/swd_pytorch.py","file_url":"https://github.com/XiudingCai/EnCo-pytorch/blob/HEAD/util/SWD/swd_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8ceba12b6020549","code_sha256_prefix":"c8ceba12b6020549","mcp_get_code":{"code_sha256":"c8ceba12b6020549"}},{"arxiv_id":"2007.12668","arxiv_id_is_arxiv":true,"paper":"/paper/kprnet-improving-projection-based-lidar","title":"KPRNet: Improving projection-based LiDAR semantic segmentation","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeyvidKochanov-TomTom/kprnet","path":"utils/knn.py","file_url":"https://github.com/DeyvidKochanov-TomTom/kprnet/blob/HEAD/utils/knn.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":"f82d80ceb7289856","code_sha256_prefix":"f82d80ceb7289856","mcp_get_code":{"code_sha256":"f82d80ceb7289856"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uzielroy/StyleGan_FewShot","path":"metric/swd_score.py","file_url":"https://github.com/uzielroy/StyleGan_FewShot/blob/HEAD/metric/swd_score.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":"c8ceba12b6020549","code_sha256_prefix":"c8ceba12b6020549","mcp_get_code":{"code_sha256":"c8ceba12b6020549"}},{"arxiv_id":"1905.11736","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-transferability-of-adversarial","title":"Cross-Domain Transferability of Adversarial Perturbations","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muzammal-naseer/cda","path":"gaussian_smoothing.py","file_url":"https://github.com/muzammal-naseer/cda/blob/HEAD/gaussian_smoothing.py","status":"ran","verification_level":1,"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 VL-Group/GAKer, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d69878edb36c4fa","code_sha256_prefix":"2d69878edb36c4fa","mcp_get_code":{"code_sha256":"2d69878edb36c4fa"}},{"arxiv_id":"1905.00953","arxiv_id_is_arxiv":true,"paper":"/paper/omni-scale-feature-learning-for-person-re","title":"Omni-Scale Feature Learning for Person Re-Identification","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"InnovArul/vidreid_cosegmentation","path":"src/utils.py","file_url":"https://github.com/InnovArul/vidreid_cosegmentation/blob/HEAD/src/utils.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":"5691966090d9a9f2","code_sha256_prefix":"5691966090d9a9f2","mcp_get_code":{"code_sha256":"5691966090d9a9f2"}},{"arxiv_id":"1710.10196","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-growing-of-gans-for-improved","title":"Progressive Growing of GANs for Improved Quality, Stability, and Variation","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koshian2/swd-pytorch","path":"swd.py","file_url":"https://github.com/koshian2/swd-pytorch/blob/HEAD/swd.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":"c8ceba12b6020549","code_sha256_prefix":"c8ceba12b6020549","mcp_get_code":{"code_sha256":"c8ceba12b6020549"}},{"arxiv_id":"aaai_27859","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27859","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Nemo1999/Joint-TensoRF","path":"model/kernels.py","file_url":"https://github.com/Nemo1999/Joint-TensoRF/blob/HEAD/model/kernels.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":"92f32ba5bc84a53c","code_sha256_prefix":"92f32ba5bc84a53c","mcp_get_code":{"code_sha256":"92f32ba5bc84a53c"}},{"arxiv_id":"Ye_Robust_Message_Embedding_via_Attention_Flow-Based_Steganography_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ye_Robust_Message_Embedding_via_Attention_Flow-Based_Steganography_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"huayuan4396/RMSteg","path":"src/util/qr.py","file_url":"https://github.com/huayuan4396/RMSteg/blob/HEAD/src/util/qr.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":"492ddfbf033c7012","code_sha256_prefix":"492ddfbf033c7012","mcp_get_code":{"code_sha256":"492ddfbf033c7012"}}],"record_sha256":"8d1e84c1d09ebdf0c4ec3dcf406f03e5c7cc984e379d6df91e26cff5811c18fe","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}