{"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/convmixer","entry":"ConvMixer","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":4,"n_samples_ran":4,"n_samples_constructed":1,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":3,"unverified":0},"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":"2411.01981","arxiv_id_is_arxiv":true,"paper":"/paper/typicalness-aware-learning-for-failure","title":"Typicalness-Aware Learning for Failure Detection","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyijungoon/TAL","path":"model/convmixer.py","file_url":"https://github.com/liuyijungoon/TAL/blob/HEAD/model/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}},{"arxiv_id":"2407.18365","arxiv_id_is_arxiv":true,"paper":"/paper/fadas-towards-federated-adaptive-asynchronous","title":"FADAS: Towards Federated Adaptive Asynchronous Optimization","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujiaw98/FADAS","path":"models/convmixer.py","file_url":"https://github.com/yujiaw98/FADAS/blob/HEAD/models/convmixer.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, yujiaw98/FADAS when it was checked","code_sha256":"e8e764d2201f257f","code_sha256_prefix":"e8e764d2201f257f","mcp_get_code":{"code_sha256":"e8e764d2201f257f"}},{"arxiv_id":"2403.02886","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-confidence-estimation-towards","title":"Revisiting Confidence Estimation: Towards Reliable Failure Prediction","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"impression2805/fmfp","path":"model/convmixer.py","file_url":"https://github.com/impression2805/fmfp/blob/HEAD/model/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}},{"arxiv_id":"2309.00570","arxiv_id_is_arxiv":true,"paper":"/paper/mechanism-of-feature-learning-in","title":"Mechanism of feature learning in convolutional neural networks","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/convrfm","path":"conv_nets/models.py","file_url":"https://github.com/aradha/convrfm/blob/HEAD/conv_nets/models.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, aradha/convrfm when it was checked","code_sha256":"b0e4baca69a85d2c","code_sha256_prefix":"b0e4baca69a85d2c","mcp_get_code":{"code_sha256":"b0e4baca69a85d2c"}},{"arxiv_id":"2306.03373","arxiv_id_is_arxiv":true,"paper":"/paper/cit-net-convolutional-neural-networks-hand-in","title":"CiT-Net: Convolutional Neural Networks Hand in Hand with Vision Transformers for Medical Image Segmentation","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SR0920/CiT-Net","path":"CiT_Net_T.py","file_url":"https://github.com/SR0920/CiT-Net/blob/HEAD/CiT_Net_T.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, SR0920/CiT-Net when it was checked","code_sha256":"b951b1094647a570","code_sha256_prefix":"b951b1094647a570","mcp_get_code":{"code_sha256":"b951b1094647a570"}},{"arxiv_id":"2201.09792","arxiv_id_is_arxiv":true,"paper":"/paper/patches-are-all-you-need-1","title":"Patches Are All You Need?","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/convmixer","path":"convmixer.py","file_url":"https://github.com/locuslab/convmixer/blob/HEAD/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}},{"arxiv_id":"2110.09057","arxiv_id_is_arxiv":true,"paper":"/paper/training-deep-neural-networks-with-adaptive","title":"Training Deep Neural Networks with Adaptive Momentum Inspired by the Quadratic Optimization","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kentaroy47/vision-transformers-cifar10","path":"models/convmixer.py","file_url":"https://github.com/kentaroy47/vision-transformers-cifar10/blob/HEAD/models/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}},{"arxiv_id":"Zhu_RCL_Reliable_Continual_Learning_for_Unified_Failure_Detection_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhu_RCL_Reliable_Continual_Learning_for_Unified_Failure_Detection_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Impression2805/RCL","path":"model/convmixer.py","file_url":"https://github.com/Impression2805/RCL/blob/HEAD/model/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}},{"arxiv_id":"136850512","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136850512 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Impression2805/FMFP","path":"model/convmixer.py","file_url":"https://github.com/Impression2805/FMFP/blob/HEAD/model/convmixer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7690d61376264fc","code_sha256_prefix":"a7690d61376264fc","mcp_get_code":{"code_sha256":"a7690d61376264fc"}}],"record_sha256":"8844a900741465cf2e9728d9d73f0a51baf6dcea02697fd8a7274526f833b88a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}