{"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/preactbottleneck","entry":"PreActBottleneck","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":6,"n_papers_ran":4,"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":4,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":2},"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":"2510.16446","paper":"/paper/arxiv-2510-16446","title":"VIPAMIN: Visual Prompt Initialization via Embedding Selection and Subspace Expansion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"iamjaekyun/vipamin","path":"src/models/vit_prompt/vit_exp_self.py","file_url":"https://github.com/iamjaekyun/vipamin/blob/HEAD/src/models/vit_prompt/vit_exp_self.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"319d9c56f4ec9426","mcp_get_code":{"code_sha256":"319d9c56f4ec9426"}},{"arxiv_id":"2501.18936","paper":"/paper/adaptive-prompt-unlocking-the-power-of-visual","title":"Adaptive Prompt: Unlocking the Power of Visual Prompt Tuning","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Minhchuyentoancbn/VAPT","path":"src/models/vit_prompt/vit.py","file_url":"https://github.com/Minhchuyentoancbn/VAPT/blob/HEAD/src/models/vit_prompt/vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6a3e067070499183","mcp_get_code":{"code_sha256":"6a3e067070499183"}},{"arxiv_id":"2203.08243","paper":"/paper/unified-visual-transformer-compression-1","title":"Unified Visual Transformer Compression","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/UVC","path":"UVC/models/modeling.py","file_url":"https://github.com/VITA-Group/UVC/blob/HEAD/UVC/models/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df180144004badc3","mcp_get_code":{"code_sha256":"df180144004badc3"}},{"arxiv_id":"2010.11929","paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junyongyou/triq","path":"src/vit_iqa/ViT_pytorch/models/modeling.py","file_url":"https://github.com/junyongyou/triq/blob/HEAD/src/vit_iqa/ViT_pytorch/models/modeling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fbc710326c33118c","mcp_get_code":{"code_sha256":"fbc710326c33118c"}},{"arxiv_id":"2006.07733","paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liyi01827/noisy-contrastive","path":"simsiam/model_factory.py","file_url":"https://github.com/liyi01827/noisy-contrastive/blob/HEAD/simsiam/model_factory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"48c90dc3cead67c6","mcp_get_code":{"code_sha256":"48c90dc3cead67c6"}},{"arxiv_id":"2002.09469","paper":"/paper/an-end-to-end-approach-for-the-verification","title":"An end-to-end approach for the verification problem: learning the right distance","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joaomonteirof/e2e_verification","path":"asv/model.py","file_url":"https://github.com/joaomonteirof/e2e_verification/blob/HEAD/asv/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6294f2d6b2cdbc24","mcp_get_code":{"code_sha256":"6294f2d6b2cdbc24"}}]}