{"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/attentionmodel","entry":"AttentionModel","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":8,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":3,"n_samples_constructed":3,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":4,"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":3,"unverified":5},"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":"2410.02604","arxiv_id_is_arxiv":true,"paper":"/paper/long-sequence-recommendation-models-need","title":"Long-Sequence Recommendation Models Need Decoupled Embeddings","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/dare","path":"model/base_model_pytorch.py","file_url":"https://github.com/thuml/dare/blob/HEAD/model/base_model_pytorch.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, thuml/dare when it was checked","code_sha256":"5f13f35abd14dc82","code_sha256_prefix":"5f13f35abd14dc82","mcp_get_code":{"code_sha256":"5f13f35abd14dc82"}},{"arxiv_id":"2404.11677","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51bd344e0972d3b3","code_sha256_prefix":"51bd344e0972d3b3","mcp_get_code":{"code_sha256":"51bd344e0972d3b3"}},{"arxiv_id":"2204.03236","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-solve-travelling-salesman-problem","title":"Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/tsp-hac","path":"nets/attention_model.py","file_url":"https://github.com/wondergo2017/tsp-hac/blob/HEAD/nets/attention_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, wondergo2017/tsp-hac when it was checked","code_sha256":"20ff2d27d0efd642","code_sha256_prefix":"20ff2d27d0efd642","mcp_get_code":{"code_sha256":"20ff2d27d0efd642"}},{"arxiv_id":"2110.13987","arxiv_id_is_arxiv":true,"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":"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, alstn12088/lcp when it was checked","code_sha256":"654e85e1dfb7a324","code_sha256_prefix":"654e85e1dfb7a324","mcp_get_code":{"code_sha256":"654e85e1dfb7a324"}},{"arxiv_id":"2110.02544","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"afcbe0b62b04095b","code_sha256_prefix":"afcbe0b62b04095b","mcp_get_code":{"code_sha256":"afcbe0b62b04095b"}},{"arxiv_id":"2108.07386","arxiv_id_is_arxiv":true,"paper":"/paper/bobcat-bilevel-optimization-based","title":"BOBCAT: Bilevel Optimization-Based Computerized Adaptive Testing","date":"2021-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arghosh/NeurIPSEducation2020","path":"model_task_1_2.py","file_url":"https://github.com/arghosh/NeurIPSEducation2020/blob/HEAD/model_task_1_2.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":"b86faf0fe0426b7f","code_sha256_prefix":"b86faf0fe0426b7f","mcp_get_code":{"code_sha256":"b86faf0fe0426b7f"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YousefGamal220/Vision-Transformers","path":"vision_transformer.py","file_url":"https://github.com/YousefGamal220/Vision-Transformers/blob/HEAD/vision_transformer.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, YousefGamal220/Vision-Transformers when it was checked","code_sha256":"b527c73fd851cfee","code_sha256_prefix":"b527c73fd851cfee","mcp_get_code":{"code_sha256":"b527c73fd851cfee"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"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":"hyunwookl/testam","path":"model.py","file_url":"https://github.com/hyunwookl/testam/blob/HEAD/model.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":"256b4c9d9ce9a4bb","code_sha256_prefix":"256b4c9d9ce9a4bb","mcp_get_code":{"code_sha256":"256b4c9d9ce9a4bb"}}],"record_sha256":"e4ac96cb59688ba9ae6317d472df7e2f01bc987e47a9af87cc749690e039aaf4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}