{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/bottleneckblock","entry":"BottleneckBlock","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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_fingerprinted":2,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2209.14977","paper":"/paper/transformer-meets-boundary-value-inverse","title":"Transformer Meets Boundary Value Inverse Problems","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scaomath/eit-transformer","path":"libs/hut.py","file_url":"https://github.com/scaomath/eit-transformer/blob/HEAD/libs/hut.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24a9a41f13af71f1","mcp_get_code":{"code_sha256":"24a9a41f13af71f1"}},{"arxiv_id":"2201.02973","paper":"/paper/maxim-multi-axis-mlp-for-image-processing","title":"MAXIM: Multi-Axis MLP for Image Processing","date":"2022-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/maxim","path":"maxim/models/maxim.py","file_url":"https://github.com/google-research/maxim/blob/HEAD/maxim/models/maxim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1f82af068fbcb99b","mcp_get_code":{"code_sha256":"1f82af068fbcb99b"}},{"arxiv_id":"2201.02973","paper":"/paper/maxim-multi-axis-mlp-for-image-processing","title":"MAXIM: Multi-Axis MLP for Image Processing","date":"2022-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sayakpaul/maxim-tf","path":"maxim/maxim.py","file_url":"https://github.com/sayakpaul/maxim-tf/blob/HEAD/maxim/maxim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8f3bf5e1e1ab7a8a","mcp_get_code":{"code_sha256":"8f3bf5e1e1ab7a8a"}},{"arxiv_id":"2108.10904","paper":"/paper/simvlm-simple-visual-language-model","title":"SimVLM: Simple Visual Language Model Pretraining with Weak Supervision","date":"2021-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FerryHuang/SimVLM","path":"simvlm/modeling_simvlm.py","file_url":"https://github.com/FerryHuang/SimVLM/blob/HEAD/simvlm/modeling_simvlm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"325812bbd82c157f","mcp_get_code":{"code_sha256":"325812bbd82c157f"}},{"arxiv_id":"2101.11605","paper":"/paper/bottleneck-transformers-for-visual","title":"Bottleneck Transformers for Visual Recognition","date":"2021-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"The-AI-Summer/self_attention","path":"self_attention_cv/bottleneck_transformer/bot_block.py","file_url":"https://github.com/The-AI-Summer/self_attention/blob/HEAD/self_attention_cv/bottleneck_transformer/bot_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31358a487667e5f1","mcp_get_code":{"code_sha256":"31358a487667e5f1"}},{"arxiv_id":"2003.12039","paper":"/paper/raft-recurrent-all-pairs-field-transforms-for","title":"RAFT: Recurrent All-Pairs Field Transforms for Optical Flow","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plusgood-steven/id-blau","path":"PrepareCondition/core/raft.py","file_url":"https://github.com/plusgood-steven/id-blau/blob/HEAD/PrepareCondition/core/raft.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3ee0a69d26057e27","mcp_get_code":{"code_sha256":"3ee0a69d26057e27"}}]}