{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/apply-attention","entry":"apply_attention","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":4,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":1},"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":"2402.05391","paper":"/paper/knowledge-graphs-meet-multi-modal-learning-a","title":"Knowledge Graphs Meet Multi-Modal Learning: A Comprehensive Survey","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"China-UK-ZSL/ZS-F-VQA","path":"code/model/attention.py","file_url":"https://github.com/China-UK-ZSL/ZS-F-VQA/blob/HEAD/code/model/attention.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"745b7eb38c9d1b29","mcp_get_code":{"code_sha256":"745b7eb38c9d1b29"}},{"arxiv_id":"1812.01880","paper":"/paper/learning-to-compose-dynamic-tree-structures","title":"Learning to Compose Dynamic Tree Structures for Visual Contexts","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaihuaTang/VCTree-Visual-Question-Answering","path":"model.py","file_url":"https://github.com/KaihuaTang/VCTree-Visual-Question-Answering/blob/HEAD/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb40006c9cd123ac","mcp_get_code":{"code_sha256":"fb40006c9cd123ac"}},{"arxiv_id":"1805.07932","paper":"/paper/bilinear-attention-networks","title":"Bilinear Attention Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cyanogenoid/vqa-counting","path":"vqa-v2/model.py","file_url":"https://github.com/Cyanogenoid/vqa-counting/blob/HEAD/vqa-v2/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"26e02979502211f1","mcp_get_code":{"code_sha256":"26e02979502211f1"}},{"arxiv_id":"1704.03162","paper":"/paper/show-ask-attend-and-answer-a-strong-baseline","title":"Show, Ask, Attend, and Answer: A Strong Baseline For Visual Question Answering","date":"2017-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"388d2a6ba37219cd","mcp_get_code":{"code_sha256":"388d2a6ba37219cd"}},{"arxiv_id":"1704.03162","paper":"/paper/show-ask-attend-and-answer-a-strong-baseline","title":"Show, Ask, Attend, and Answer: A Strong Baseline For Visual Question Answering","date":"2017-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cyanogenoid/pytorch-vqa","path":"model.py","file_url":"https://github.com/Cyanogenoid/pytorch-vqa/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6e1df46e2ff7c334","mcp_get_code":{"code_sha256":"6e1df46e2ff7c334"}},{"arxiv_id":"1511.02274","paper":"/paper/stacked-attention-networks-for-image-question","title":"Stacked Attention Networks for Image Question Answering","date":"2015-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhijit-buet/VizWiz-Visual-Question-Answering-2021","path":"models.py","file_url":"https://github.com/abhijit-buet/VizWiz-Visual-Question-Answering-2021/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"388d2a6ba37219cd","mcp_get_code":{"code_sha256":"388d2a6ba37219cd"}}]}