{"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/channelattention","entry":"ChannelAttention","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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"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":14,"n_samples_ran":12,"n_samples_constructed":7,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":14,"n_places_pointer_only":10,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":12,"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":"2603.21879","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21879","title":"SmaAT-QMix-UNet: A Parameter-Efficient Vector-Quantized UNet for Precipitation Nowcasting","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"nstavr04/MasterThesisSnellius","path":"SmaAT-QMix-UNet/models/SmaAT_UNet_VQ_lightning.py","file_url":"https://github.com/nstavr04/MasterThesisSnellius/blob/HEAD/SmaAT-QMix-UNet/models/SmaAT_UNet_VQ_lightning.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nstavr04/MasterThesisSnellius when it was checked","code_sha256":"9b35cac2322cc879","code_sha256_prefix":"9b35cac2322cc879","mcp_get_code":{"code_sha256":"9b35cac2322cc879"}},{"arxiv_id":"2602.23903","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23903","title":"SegMate: Asymmetric Attention-Based Lightweight Architecture for Efficient Multi-Organ Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"andreibunea99/SegMate","path":"models/segmate_v2.py","file_url":"https://github.com/andreibunea99/SegMate/blob/HEAD/models/segmate_v2.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, andreibunea99/SegMate when it was checked","code_sha256":"f920423f629e5e26","code_sha256_prefix":"f920423f629e5e26","mcp_get_code":{"code_sha256":"f920423f629e5e26"}},{"arxiv_id":"2601.13987","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-13987","title":"SHARE: A Fully Unsupervised Framework for Single Hyperspectral Image Restoration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"xuwayyy/SHARE","path":"models/share.py","file_url":"https://github.com/xuwayyy/SHARE/blob/HEAD/models/share.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xuwayyy/SHARE when it was checked","code_sha256":"9f8378c80bc09d6b","code_sha256_prefix":"9f8378c80bc09d6b","mcp_get_code":{"code_sha256":"9f8378c80bc09d6b"}},{"arxiv_id":"2505.15364","arxiv_id_is_arxiv":true,"paper":"/paper/mhanet-multi-scale-hybrid-attention-network","title":"MHANet: Multi-scale Hybrid Attention Network for Auditory Attention Detection","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":"fchest/MHANet","path":"model.py","file_url":"https://github.com/fchest/MHANet/blob/HEAD/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, fchest/MHANet when it was checked","code_sha256":"158619b664aec118","code_sha256_prefix":"158619b664aec118","mcp_get_code":{"code_sha256":"158619b664aec118"}},{"arxiv_id":"2505.03507","arxiv_id_is_arxiv":true,"paper":"/paper/modality-guided-dynamic-graph-fusion-and","title":"Modality-Guided Dynamic Graph Fusion and Temporal Diffusion for Self-Supervised RGB-T Tracking","date":"2025-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiShenglana/GDSTrack","path":"lib/model/models/WFCG.py","file_url":"https://github.com/LiShenglana/GDSTrack/blob/HEAD/lib/model/models/WFCG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, LiShenglana/GDSTrack, is not in the permissive set Syntology serves inline","code_sha256":"d4900c2a65f13274","code_sha256_prefix":"d4900c2a65f13274","mcp_get_code":{"code_sha256":"d4900c2a65f13274"}},{"arxiv_id":"2503.23356","arxiv_id_is_arxiv":true,"paper":"/paper/controlfusion-a-controllable-image-fusion","title":"ControlFusion: A Controllable Image Fusion Framework with Language-Vision Degradation Prompts","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linfeng-Tang/ControlFusion","path":"model/ControlFusion.py","file_url":"https://github.com/Linfeng-Tang/ControlFusion/blob/HEAD/model/ControlFusion.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, Linfeng-Tang/ControlFusion when it was checked","code_sha256":"6a8e0a2cdf7f3144","code_sha256_prefix":"6a8e0a2cdf7f3144","mcp_get_code":{"code_sha256":"6a8e0a2cdf7f3144"}},{"arxiv_id":"2410.03936","arxiv_id_is_arxiv":true,"paper":"/paper/learning-truncated-causal-history-model-for","title":"Learning Truncated Causal History Model for Video Restoration","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ascend-Research/Turtle","path":"basicsr/models/archs/turtle_arch.py","file_url":"https://github.com/Ascend-Research/Turtle/blob/HEAD/basicsr/models/archs/turtle_arch.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":"b07cc66e024e5802","code_sha256_prefix":"b07cc66e024e5802","mcp_get_code":{"code_sha256":"b07cc66e024e5802"}},{"arxiv_id":"2404.05001","arxiv_id_is_arxiv":true,"paper":"/paper/dual-scale-transformer-for-large-scale-single","title":"Dual-Scale Transformer for Large-Scale Single-Pixel Imaging","date":"2024-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gang-Qu/HATNet-SPI","path":"model/network.py","file_url":"https://github.com/Gang-Qu/HATNet-SPI/blob/HEAD/model/network.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, Gang-Qu/HATNet-SPI when it was checked","code_sha256":"e0a031075ec1461c","code_sha256_prefix":"e0a031075ec1461c","mcp_get_code":{"code_sha256":"e0a031075ec1461c"}},{"arxiv_id":"2403.01713","arxiv_id_is_arxiv":true,"paper":"/paper/mca-moment-channel-attention-networks","title":"MCA: Moment Channel Attention Networks","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSDLLab/MCA","path":"moment.py","file_url":"https://github.com/CSDLLab/MCA/blob/HEAD/moment.py","status":"ran","verification_level":1,"contract_check":null,"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, CSDLLab/MCA when it was checked","code_sha256":"75504be49750fa6c","code_sha256_prefix":"75504be49750fa6c","mcp_get_code":{"code_sha256":"75504be49750fa6c"}},{"arxiv_id":"2401.02151","arxiv_id_is_arxiv":true,"paper":"/paper/frequency-adaptive-pan-sharpening-with","title":"Frequency-Adaptive Pan-Sharpening with Mixture of Experts","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexhe101/FAME-Net","path":"model/moe.py","file_url":"https://github.com/alexhe101/FAME-Net/blob/HEAD/model/moe.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, alexhe101/FAME-Net when it was checked","code_sha256":"2acc0983bce9b310","code_sha256_prefix":"2acc0983bce9b310","mcp_get_code":{"code_sha256":"2acc0983bce9b310"}},{"arxiv_id":"2307.11404","arxiv_id_is_arxiv":true,"paper":"/paper/latent-ofer-detect-mask-and-reconstruct-with","title":"Latent-OFER: Detect, Mask, and Reconstruct with Latent Vectors for Occluded Facial Expression Recognition","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leeisack/Latent-OFER","path":"networks/OURS.py","file_url":"https://github.com/leeisack/Latent-OFER/blob/HEAD/networks/OURS.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":"16c91a259766f1b1","code_sha256_prefix":"16c91a259766f1b1","mcp_get_code":{"code_sha256":"16c91a259766f1b1"}},{"arxiv_id":"2204.03645","arxiv_id_is_arxiv":true,"paper":"/paper/davit-dual-attention-vision-transformers","title":"DaViT: Dual Attention Vision Transformers","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingmyu/davit","path":"timm/models/davit.py","file_url":"https://github.com/dingmyu/davit/blob/HEAD/timm/models/davit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae32983bf5de53c3","code_sha256_prefix":"ae32983bf5de53c3","mcp_get_code":{"code_sha256":"ae32983bf5de53c3"}},{"arxiv_id":"2203.12178","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-motion-deblurring-and-frame","title":"Unifying Motion Deblurring and Frame Interpolation with Events","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiangZ-0/EVDI","path":"codes/Networks/EVDI.py","file_url":"https://github.com/XiangZ-0/EVDI/blob/HEAD/codes/Networks/EVDI.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, XiangZ-0/EVDI when it was checked","code_sha256":"7588869b56c7ab29","code_sha256_prefix":"7588869b56c7ab29","mcp_get_code":{"code_sha256":"7588869b56c7ab29"}},{"arxiv_id":"2109.09052","arxiv_id_is_arxiv":true,"paper":"/paper/object-tracking-by-jointly-exploiting-frame","title":"Object Tracking by Jointly Exploiting Frame and Event Domain","date":"2021-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jee-King/ICCV2021_Event_Frame_Tracking","path":"ltr/models/backbone/inter_attention.py","file_url":"https://github.com/Jee-King/ICCV2021_Event_Frame_Tracking/blob/HEAD/ltr/models/backbone/inter_attention.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":"66870979109f65c3","code_sha256_prefix":"66870979109f65c3","mcp_get_code":{"code_sha256":"66870979109f65c3"}}],"record_sha256":"42c013f90c94a7ea381430f81937f7a7c16afd7b706788f903d93726f7f9c769","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}