{"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/load-imageid","entry":"load_imageid","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":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":2,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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":"2110.02526","paper":"/paper/coarse-to-fine-reasoning-for-visual-question","title":"Coarse-to-Fine Reasoning for Visual Question Answering","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aioz-ai/crf_vqa","path":"src/utils.py","file_url":"https://github.com/aioz-ai/crf_vqa/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf90bd27fe08f3a2","mcp_get_code":{"code_sha256":"bf90bd27fe08f3a2"}},{"arxiv_id":"2006.14744","paper":"/paper/graph-optimal-transport-for-cross-domain","title":"Graph Optimal Transport for Cross-Domain Alignment","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiqunChen0606/Graph-Optimal-Transport","path":"BAN_vqa/utils.py","file_url":"https://github.com/LiqunChen0606/Graph-Optimal-Transport/blob/HEAD/BAN_vqa/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf90bd27fe08f3a2","mcp_get_code":{"code_sha256":"bf90bd27fe08f3a2"}},{"arxiv_id":"1902.09368","paper":"/paper/dual-attention-networks-for-visual-reference","title":"Dual Attention Networks for Visual Reference Resolution in Visual Dialog","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phellonchen/DMRM","path":"utils.py","file_url":"https://github.com/phellonchen/DMRM/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf90bd27fe08f3a2","mcp_get_code":{"code_sha256":"bf90bd27fe08f3a2"}},{"arxiv_id":"1902.09368","paper":"/paper/dual-attention-networks-for-visual-reference","title":"Dual Attention Networks for Visual Reference Resolution in Visual Dialog","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gicheonkang/DAN-VisDial","path":"utils/utils.py","file_url":"https://github.com/gicheonkang/DAN-VisDial/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e90714af510bbb7f","mcp_get_code":{"code_sha256":"e90714af510bbb7f"}},{"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":"jnhwkim/ban-vqa","path":"utils.py","file_url":"https://github.com/jnhwkim/ban-vqa/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf90bd27fe08f3a2","mcp_get_code":{"code_sha256":"bf90bd27fe08f3a2"}},{"arxiv_id":"2023.findings-eacl.88","paper":null,"title":"arXiv:2023.findings-eacl.88","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sarahESL/PubMedCLIP","path":"MEVF_PubMedCLIP/utils.py","file_url":"https://github.com/sarahESL/PubMedCLIP/blob/HEAD/MEVF_PubMedCLIP/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf90bd27fe08f3a2","mcp_get_code":{"code_sha256":"bf90bd27fe08f3a2"}}]}