{"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/layerscale","entry":"LayerScale","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":14,"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":16,"n_samples_ran":15,"n_samples_constructed":14,"n_samples_ran_checked":15,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":16,"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":15,"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":"2604.04420","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04420","title":"Is Prompt Selection Necessary for Task-Free Online Continual Learning?","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"efficient-learning-lab/SinglePrompt","path":"models/singlePrompt.py","file_url":"https://github.com/efficient-learning-lab/SinglePrompt/blob/HEAD/models/singlePrompt.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":"53f7f1cd1032ac80","code_sha256_prefix":"53f7f1cd1032ac80","mcp_get_code":{"code_sha256":"53f7f1cd1032ac80"}},{"arxiv_id":"2511.07222","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-07222","title":"Omni-View: Unlocking How Generation Facilitates Understanding in Unified 3D Model based on Multiview images","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"AIDC-AI/Omni-View","path":"modeling/bagel/bagel.py","file_url":"https://github.com/AIDC-AI/Omni-View/blob/HEAD/modeling/bagel/bagel.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":"fc6e2b056af68059","code_sha256_prefix":"fc6e2b056af68059","mcp_get_code":{"code_sha256":"fc6e2b056af68059"}},{"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":"dadddc177deadf88","code_sha256_prefix":"dadddc177deadf88","mcp_get_code":{"code_sha256":"dadddc177deadf88"}},{"arxiv_id":"2503.02394","arxiv_id_is_arxiv":true,"paper":"/paper/bhvit-binarized-hybrid-vision-transformer","title":"BHViT: Binarized Hybrid Vision Transformer","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IMRL/BHViT","path":"transformer/BHViT.py","file_url":"https://github.com/IMRL/BHViT/blob/HEAD/transformer/BHViT.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":"5a33cb0660a4f8f5","code_sha256_prefix":"5a33cb0660a4f8f5","mcp_get_code":{"code_sha256":"5a33cb0660a4f8f5"}},{"arxiv_id":"2412.04786","arxiv_id_is_arxiv":true,"paper":"/paper/slicing-vision-transformer-for-flexible","title":"Slicing Vision Transformer for Flexible Inference","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BeSpontaneous/Scala-pytorch","path":"models_scala.py","file_url":"https://github.com/BeSpontaneous/Scala-pytorch/blob/HEAD/models_scala.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":"722ebc6a6b34ca4d","code_sha256_prefix":"722ebc6a6b34ca4d","mcp_get_code":{"code_sha256":"722ebc6a6b34ca4d"}},{"arxiv_id":"2411.14429","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-integration-of-convolution-and","title":"Revisiting the Integration of Convolution and Attention for Vision Backbone","date":"2024-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rayleizhu/glmix","path":"models/glnet.py","file_url":"https://github.com/rayleizhu/glmix/blob/HEAD/models/glnet.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":"3f3123c5b41c1bda","code_sha256_prefix":"3f3123c5b41c1bda","mcp_get_code":{"code_sha256":"3f3123c5b41c1bda"}},{"arxiv_id":"2409.09016","arxiv_id_is_arxiv":true,"paper":"/paper/closed-loop-visuomotor-control-with","title":"Closed-Loop Visuomotor Control with Generative Expectation for Robotic Manipulation","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"OpenDriveLab/CLOVER","path":"FeedbackPolicy/models/policy.py","file_url":"https://github.com/OpenDriveLab/CLOVER/blob/HEAD/FeedbackPolicy/models/policy.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":"07517d004d8d3758","code_sha256_prefix":"07517d004d8d3758","mcp_get_code":{"code_sha256":"07517d004d8d3758"}},{"arxiv_id":"2408.14080","arxiv_id_is_arxiv":true,"paper":"/paper/sonics-synthetic-or-not-identifying","title":"SONICS: Synthetic Or Not -- Identifying Counterfeit Songs","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awsaf49/sonics","path":"sonics/models/spectttra.py","file_url":"https://github.com/awsaf49/sonics/blob/HEAD/sonics/models/spectttra.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, awsaf49/sonics (NOASSERTION)","code_sha256":"6ca879b9cdcae41d","code_sha256_prefix":"6ca879b9cdcae41d","mcp_get_code":{"code_sha256":"6ca879b9cdcae41d"}},{"arxiv_id":"2405.13985","arxiv_id_is_arxiv":true,"paper":"/paper/lookhere-vision-transformers-with-directed","title":"LookHere: Vision Transformers with Directed Attention Generalize and Extrapolate","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greencubic/lookhere","path":"lookhere.py","file_url":"https://github.com/greencubic/lookhere/blob/HEAD/lookhere.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":"90611bff664a489e","code_sha256_prefix":"90611bff664a489e","mcp_get_code":{"code_sha256":"90611bff664a489e"}},{"arxiv_id":"2404.12467","arxiv_id_is_arxiv":true,"paper":"/paper/towards-multi-modal-transformers-in-federated","title":"Towards Multi-modal Transformers in Federated Learning","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imguangyu/FedCola","path":"src/models/mome.py","file_url":"https://github.com/imguangyu/FedCola/blob/HEAD/src/models/mome.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":"701e39ed251d5829","code_sha256_prefix":"701e39ed251d5829","mcp_get_code":{"code_sha256":"701e39ed251d5829"}},{"arxiv_id":"2403.08568","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-prompting-for-rehearsal-free","title":"Consistent Prompting for Rehearsal-Free Continual Learning","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhanxin-Gao/CPrompt","path":"models/cprompt.py","file_url":"https://github.com/Zhanxin-Gao/CPrompt/blob/HEAD/models/cprompt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zhanxin-Gao/CPrompt when it was checked","code_sha256":"a77a876f784480d3","code_sha256_prefix":"a77a876f784480d3","mcp_get_code":{"code_sha256":"a77a876f784480d3"}},{"arxiv_id":"2304.07193","arxiv_id_is_arxiv":true,"paper":"/paper/dinov2-learning-robust-visual-features","title":"DINOv2: Learning Robust Visual Features without Supervision","date":"2023-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByungKwanLee/Causal-Unsupervised-Segmentation","path":"models/dinov2vit.py","file_url":"https://github.com/ByungKwanLee/Causal-Unsupervised-Segmentation/blob/HEAD/models/dinov2vit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ByungKwanLee/Causal-Unsupervised-Segmentation when it was checked","code_sha256":"1d18daa479e53b33","code_sha256_prefix":"1d18daa479e53b33","mcp_get_code":{"code_sha256":"1d18daa479e53b33"}},{"arxiv_id":"2304.07193","arxiv_id_is_arxiv":true,"paper":"/paper/dinov2-learning-robust-visual-features","title":"DINOv2: Learning Robust Visual Features without Supervision","date":"2023-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/highrescanopyheight","path":"models/backbone.py","file_url":"https://github.com/facebookresearch/highrescanopyheight/blob/HEAD/models/backbone.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":"d502f73859574661","code_sha256_prefix":"d502f73859574661","mcp_get_code":{"code_sha256":"d502f73859574661"}},{"arxiv_id":"2303.04249","arxiv_id_is_arxiv":true,"paper":"/paper/where-we-are-and-what-we-re-looking-at-query","title":"Where We Are and What We're Looking At: Query Based Worldwide Image Geo-localization Using Hierarchies and Scenes","date":"2023-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AHKerrigan/GeoGuessNet","path":"networks.py","file_url":"https://github.com/AHKerrigan/GeoGuessNet/blob/HEAD/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AHKerrigan/GeoGuessNet when it was checked","code_sha256":"ec250b5a99a54dcc","code_sha256_prefix":"ec250b5a99a54dcc","mcp_get_code":{"code_sha256":"ec250b5a99a54dcc"}},{"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":"frgfm/Holocron","path":"holocron/models/classification/convnext.py","file_url":"https://github.com/frgfm/Holocron/blob/HEAD/holocron/models/classification/convnext.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c237d46e09539ba8","code_sha256_prefix":"c237d46e09539ba8","mcp_get_code":{"code_sha256":"c237d46e09539ba8"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"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":"OML-Team/open-metric-learning","path":"oml/models/vit_dino/external_v2/vision_transformer.py","file_url":"https://github.com/OML-Team/open-metric-learning/blob/HEAD/oml/models/vit_dino/external_v2/vision_transformer.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":"ab8cf50d6a117f90","code_sha256_prefix":"ab8cf50d6a117f90","mcp_get_code":{"code_sha256":"ab8cf50d6a117f90"}}],"record_sha256":"1e6a7acf9347d5c51f526a71c422ca6c7e1041c441cef1c797032b83d1c1ebd9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}