{"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/mab","entry":"MAB","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":12,"n_samples_ran":11,"n_samples_constructed":8,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":12,"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":11,"unverified":1},"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":"2606.11616","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11616","title":"DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"SJTU-DMTai/DeMix","path":"demix/pipelines.py","file_url":"https://github.com/SJTU-DMTai/DeMix/blob/HEAD/demix/pipelines.py","status":"ran","verification_level":1,"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, SJTU-DMTai/DeMix when it was checked","code_sha256":"e4c4bbdd06350681","code_sha256_prefix":"e4c4bbdd06350681","mcp_get_code":{"code_sha256":"e4c4bbdd06350681"}},{"arxiv_id":"2503.19331","arxiv_id_is_arxiv":true,"paper":"/paper/cha-maevit-unifying-channel-aware-masked","title":"ChA-MAEViT: Unifying Channel-Aware Masked Autoencoders and Multi-Channel Vision Transformers for Improved Cross-Channel Learning","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaudatascience/cha_mae_vit","path":"models/cha_mae_vit.py","file_url":"https://github.com/chaudatascience/cha_mae_vit/blob/HEAD/models/cha_mae_vit.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":"ca81184e1a038ae8","code_sha256_prefix":"ca81184e1a038ae8","mcp_get_code":{"code_sha256":"ca81184e1a038ae8"}},{"arxiv_id":"2307.07938","arxiv_id_is_arxiv":true,"paper":"/paper/cvsformer-cross-view-synthesis-transformer","title":"CVSformer: Cross-View Synthesis Transformer for Semantic Scene Completion","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donghaotian123/CVSformer","path":"core/semantic_scene_completion/caitModule.py","file_url":"https://github.com/donghaotian123/CVSformer/blob/HEAD/core/semantic_scene_completion/caitModule.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, donghaotian123/CVSformer when it was checked","code_sha256":"5bc34d63fe8293ba","code_sha256_prefix":"5bc34d63fe8293ba","mcp_get_code":{"code_sha256":"5bc34d63fe8293ba"}},{"arxiv_id":"2301.12780","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-architectures-for-learning-in","title":"Equivariant Architectures for Learning in Deep Weight Spaces","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvivNavon/DWSNets","path":"nn/layers/weight_to_weight.py","file_url":"https://github.com/AvivNavon/DWSNets/blob/HEAD/nn/layers/weight_to_weight.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":"dfdb026b20ec9c69","code_sha256_prefix":"dfdb026b20ec9c69","mcp_get_code":{"code_sha256":"dfdb026b20ec9c69"}},{"arxiv_id":"2206.08556","arxiv_id_is_arxiv":true,"paper":"/paper/thompson-sampling-for-robust-transfer-in","title":"Thompson Sampling for Robust Transfer in Multi-Task Bandits","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiwang123/eps-mpmab-ts","path":"module.py","file_url":"https://github.com/zhiwang123/eps-mpmab-ts/blob/HEAD/module.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":"a9ea49bb72a4fd2e","code_sha256_prefix":"a9ea49bb72a4fd2e","mcp_get_code":{"code_sha256":"a9ea49bb72a4fd2e"}},{"arxiv_id":"2204.02844","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-generate-realistic-noisy-images-2","title":"Learning to Generate Realistic Noisy Images via Pixel-level Noise-aware Adversarial Training","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GarrickZ2/Image-Denoising","path":"PNGAN/model/generator.py","file_url":"https://github.com/GarrickZ2/Image-Denoising/blob/HEAD/PNGAN/model/generator.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":"0328887c18f80d1f","code_sha256_prefix":"0328887c18f80d1f","mcp_get_code":{"code_sha256":"0328887c18f80d1f"}},{"arxiv_id":"2203.13963","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-empowered-multi-scale-contextual","title":"Transformer-empowered Multi-scale Contextual Matching and Aggregation for Multi-contrast MRI Super-resolution","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XAIMI-Lab/McMRSR","path":"networks/network_mcmrsr.py","file_url":"https://github.com/XAIMI-Lab/McMRSR/blob/HEAD/networks/network_mcmrsr.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, XAIMI-Lab/McMRSR when it was checked","code_sha256":"5cd6e584c2843e4b","code_sha256_prefix":"5cd6e584c2843e4b","mcp_get_code":{"code_sha256":"5cd6e584c2843e4b"}},{"arxiv_id":"2106.06427","arxiv_id_is_arxiv":true,"paper":"/paper/neural-symbolic-regression-that-scales","title":"Neural Symbolic Regression that Scales","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-symbolic-mathematics/TPSR","path":"nesymres/src/nesymres/architectures/model.py","file_url":"https://github.com/deep-symbolic-mathematics/TPSR/blob/HEAD/nesymres/src/nesymres/architectures/model.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":"cda79b95cee80af2","code_sha256_prefix":"cda79b95cee80af2","mcp_get_code":{"code_sha256":"cda79b95cee80af2"}},{"arxiv_id":"2106.02584","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-between-datapoints-going","title":"Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learning","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/Non-Parametric-Transformers","path":"npt/model/npt.py","file_url":"https://github.com/OATML/Non-Parametric-Transformers/blob/HEAD/npt/model/npt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7232573389ce2a5a","code_sha256_prefix":"7232573389ce2a5a","mcp_get_code":{"code_sha256":"7232573389ce2a5a"}},{"arxiv_id":"2102.11533","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinheonBaek/GMT","path":"models/nets.py","file_url":"https://github.com/JinheonBaek/GMT/blob/HEAD/models/nets.py","status":"ran","verification_level":1,"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, JinheonBaek/GMT when it was checked","code_sha256":"0060b5109c3cec3e","code_sha256_prefix":"0060b5109c3cec3e","mcp_get_code":{"code_sha256":"0060b5109c3cec3e"}},{"arxiv_id":"2010.15727","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-clustering-processes","title":"Amortized Probabilistic Detection of Communities in Graphs","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aripakman/amortized_community_detection","path":"acp/models/acp_model.py","file_url":"https://github.com/aripakman/amortized_community_detection/blob/HEAD/acp/models/acp_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5068848cf579a326","code_sha256_prefix":"5068848cf579a326","mcp_get_code":{"code_sha256":"5068848cf579a326"}},{"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":"Enigmatisms/Set-Transformer","path":"py/att_blocks.py","file_url":"https://github.com/Enigmatisms/Set-Transformer/blob/HEAD/py/att_blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9c89aad3dff8d58","code_sha256_prefix":"e9c89aad3dff8d58","mcp_get_code":{"code_sha256":"e9c89aad3dff8d58"}}],"record_sha256":"52533e7cfc42a75298214231724d196bd61ee1ef37d9dfd31bca4dee46368837","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}