{"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/dot-attention","entry":"dot_attention","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":7,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":1,"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":"2503.13012","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-domain-generalization-via-universe","title":"Test-Time Domain Generalization via Universe Learning: A Multi-Graph Matching Approach for Medical Image Segmentation","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yore0/TTDG-MGM","path":"adapteacher/modeling/GModule/multi_graph_matching.py","file_url":"https://github.com/Yore0/TTDG-MGM/blob/HEAD/adapteacher/modeling/GModule/multi_graph_matching.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Yore0/TTDG-MGM when it was checked","code_sha256":"e65af3d8e3ea20f6","code_sha256_prefix":"e65af3d8e3ea20f6","mcp_get_code":{"code_sha256":"e65af3d8e3ea20f6"}},{"arxiv_id":"2306.04954","arxiv_id_is_arxiv":true,"paper":"/paper/re-matching-a-fine-grained-semantic-matching","title":"RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zweny/RE-Matching","path":"model/model.py","file_url":"https://github.com/zweny/RE-Matching/blob/HEAD/model/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, zweny/RE-Matching when it was checked","code_sha256":"690255d0e59768d1","code_sha256_prefix":"690255d0e59768d1","mcp_get_code":{"code_sha256":"690255d0e59768d1"}},{"arxiv_id":"2305.01778","arxiv_id_is_arxiv":true,"paper":"/paper/sltunet-a-simple-unified-model-for-sign-1","title":"SLTUNET: A Simple Unified Model for Sign Language Translation","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangGo/sltunet","path":"sltunet.py","file_url":"https://github.com/bzhangGo/sltunet/blob/HEAD/sltunet.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, bzhangGo/sltunet when it was checked","code_sha256":"e49b122cb1a5be6e","code_sha256_prefix":"e49b122cb1a5be6e","mcp_get_code":{"code_sha256":"e49b122cb1a5be6e"}},{"arxiv_id":"2104.07012","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-attention-with-linear-units","title":"Sparse Attention with Linear Units","date":"2021-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangGo/zero","path":"modules/rela.py","file_url":"https://github.com/bzhangGo/zero/blob/HEAD/modules/rela.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c93a3ed41b61c72f","code_sha256_prefix":"c93a3ed41b61c72f","mcp_get_code":{"code_sha256":"c93a3ed41b61c72f"}},{"arxiv_id":"2004.11867","arxiv_id_is_arxiv":true,"paper":"/paper/improving-massively-multilingual-neural","title":"Improving Massively Multilingual Neural Machine Translation and Zero-Shot Translation","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangGo/zero","path":"models/transformer_l0drop.py","file_url":"https://github.com/bzhangGo/zero/blob/HEAD/models/transformer_l0drop.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b04d0b5aeab65a69","code_sha256_prefix":"b04d0b5aeab65a69","mcp_get_code":{"code_sha256":"b04d0b5aeab65a69"}},{"arxiv_id":"1804.09541","arxiv_id_is_arxiv":true,"paper":"/paper/qanet-combining-local-convolution-with-global","title":"QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehension","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tao-Mind/QDD_Net","path":"models/layers.py","file_url":"https://github.com/Tao-Mind/QDD_Net/blob/HEAD/models/layers.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":"96be8bbb7b022500","code_sha256_prefix":"96be8bbb7b022500","mcp_get_code":{"code_sha256":"96be8bbb7b022500"}},{"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":"bzhangGo/zero","path":"models/transformer.py","file_url":"https://github.com/bzhangGo/zero/blob/HEAD/models/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e874f7de4dfc4d8d","code_sha256_prefix":"e874f7de4dfc4d8d","mcp_get_code":{"code_sha256":"e874f7de4dfc4d8d"}}],"record_sha256":"8b6fa17ae0d380455ff46806d83a6421c2f8d596f5e946660b6ef6c1918cfe65","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}