{"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/stem-2","entry":"Stem","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":5,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":3,"n_samples_constructed":3,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":2,"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":3},"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":"2405.16605","arxiv_id_is_arxiv":true,"paper":"/paper/demystify-mamba-in-vision-a-linear-attention","title":"Demystify Mamba in Vision: A Linear Attention Perspective","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeapLabTHU/MLLA","path":"models/mlla.py","file_url":"https://github.com/LeapLabTHU/MLLA/blob/HEAD/models/mlla.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":"158e1c2f6afa4d41","code_sha256_prefix":"158e1c2f6afa4d41","mcp_get_code":{"code_sha256":"158e1c2f6afa4d41"}},{"arxiv_id":"2206.09959","arxiv_id_is_arxiv":true,"paper":"/paper/global-context-vision-transformers","title":"Global Context Vision Transformers","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awsaf49/gcvit-tf","path":"gcvit/models/gcvit.py","file_url":"https://github.com/awsaf49/gcvit-tf/blob/HEAD/gcvit/models/gcvit.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":"9c9a02a583a26d70","code_sha256_prefix":"9c9a02a583a26d70","mcp_get_code":{"code_sha256":"9c9a02a583a26d70"}},{"arxiv_id":"2206.00272","arxiv_id_is_arxiv":true,"paper":"/paper/vision-gnn-an-image-is-worth-graph-of-nodes","title":"Vision GNN: An Image is Worth Graph of Nodes","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/efficient-ai-backbones","path":"vig_pytorch/vig.py","file_url":"https://github.com/huawei-noah/efficient-ai-backbones/blob/HEAD/vig_pytorch/vig.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, huawei-noah/efficient-ai-backbones when it was checked","code_sha256":"52ba09bd92b104eb","code_sha256_prefix":"52ba09bd92b104eb","mcp_get_code":{"code_sha256":"52ba09bd92b104eb"}},{"arxiv_id":"2201.03545","arxiv_id_is_arxiv":true,"paper":"/paper/a-convnet-for-the-2020s","title":"A ConvNet for the 2020s","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzeromiko/vmamba","path":"analyze/convnexts4nd/convnext_timm.py","file_url":"https://github.com/mzeromiko/vmamba/blob/HEAD/analyze/convnexts4nd/convnext_timm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"650e4fe6e5133c60","code_sha256_prefix":"650e4fe6e5133c60","mcp_get_code":{"code_sha256":"650e4fe6e5133c60"}},{"arxiv_id":"2201.03545","arxiv_id_is_arxiv":true,"paper":"/paper/a-convnet-for-the-2020s","title":"A ConvNet for the 2020s","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sithu31296/semantic-segmentation","path":"semseg/models/backbones/convnext.py","file_url":"https://github.com/sithu31296/semantic-segmentation/blob/HEAD/semseg/models/backbones/convnext.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3287c301a9e5d2a","code_sha256_prefix":"d3287c301a9e5d2a","mcp_get_code":{"code_sha256":"d3287c301a9e5d2a"}},{"arxiv_id":"2104.06403","arxiv_id_is_arxiv":true,"paper":"/paper/lite-hrnet-a-lightweight-high-resolution","title":"Lite-HRNet: A Lightweight High-Resolution Network","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viet-hoang-99/Lite_HRnet_vh","path":"lib/models/lite_hrnet.py","file_url":"https://github.com/viet-hoang-99/Lite_HRnet_vh/blob/HEAD/lib/models/lite_hrnet.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, viet-hoang-99/Lite_HRnet_vh when it was checked","code_sha256":"63a7e1662cd623f7","code_sha256_prefix":"63a7e1662cd623f7","mcp_get_code":{"code_sha256":"63a7e1662cd623f7"}}],"record_sha256":"ee20680086e5ad68fe3e3fdff4160bc0419c56d905de9d298224c0ff2d0303d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}