{"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/multiheadattentionlayer","entry":"MultiHeadAttentionLayer","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":6,"n_papers_ran":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":6,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2404.11677","paper":"/paper/cross-problem-learning-for-solving-vehicle","title":"Cross-Problem Learning for Solving Vehicle Routing Problems","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuoyi-lin/cross_problem_learning","path":"nets/attention_model.py","file_url":"https://github.com/zhuoyi-lin/cross_problem_learning/blob/HEAD/nets/attention_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5579c57075af815e","mcp_get_code":{"code_sha256":"5579c57075af815e"}},{"arxiv_id":"2306.00172","paper":"/paper/learning-for-edge-weighted-online-bipartite","title":"Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ren-research/lomar","path":"policy/gnn_hist.py","file_url":"https://github.com/ren-research/lomar/blob/HEAD/policy/gnn_hist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"920be8d8cd13257f","mcp_get_code":{"code_sha256":"920be8d8cd13257f"}},{"arxiv_id":"2205.13225","paper":"/paper/collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaist-silab/dppbench","path":"src/models/devformer.py","file_url":"https://github.com/kaist-silab/dppbench/blob/HEAD/src/models/devformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e974ebdae8b92931","mcp_get_code":{"code_sha256":"e974ebdae8b92931"}},{"arxiv_id":"2110.13987","paper":"/paper/learning-collaborative-policies-to-solve-np","title":"Learning Collaborative Policies to Solve NP-hard Routing Problems","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alstn12088/lcp","path":"nets/attention_model.py","file_url":"https://github.com/alstn12088/lcp/blob/HEAD/nets/attention_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd680450b0176037","mcp_get_code":{"code_sha256":"dd680450b0176037"}},{"arxiv_id":"2110.02544","paper":"/paper/learning-to-iteratively-solve-routing","title":"Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yining043/TSP-improve","path":"nets/attention_model.py","file_url":"https://github.com/yining043/TSP-improve/blob/HEAD/nets/attention_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1905f5c7465accec","mcp_get_code":{"code_sha256":"1905f5c7465accec"}},{"arxiv_id":"1706.03762","paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"demelin/nematode","path":"codebase/transformer.py","file_url":"https://github.com/demelin/nematode/blob/HEAD/codebase/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"149822f011133219","mcp_get_code":{"code_sha256":"149822f011133219"}}]}