{"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/init-vit-weights","entry":"_init_vit_weights","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":0,"n_papers_ran_no_instrument_failure":0,"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":9,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":5,"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":0,"unverified":9},"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":"2503.10252","arxiv_id_is_arxiv":true,"paper":"/paper/svip-semantically-contextualized-visual","title":"SVIP: Semantically Contextualized Visual Patches for Zero-Shot Learning","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uqzhichen/SVIP","path":"models/vit_model.py","file_url":"https://github.com/uqzhichen/SVIP/blob/HEAD/models/vit_model.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, uqzhichen/SVIP when it was checked","code_sha256":"bd0a12f05f6c806c","code_sha256_prefix":"bd0a12f05f6c806c","mcp_get_code":{"code_sha256":"bd0a12f05f6c806c"}},{"arxiv_id":"2403.01412","arxiv_id_is_arxiv":true,"paper":"/paper/lum-vit-learnable-under-sampling-mask-vision","title":"LUM-ViT: Learnable Under-sampling Mask Vision Transformer for Bandwidth Limited Optical Signal Acquisition","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxllf/lum-vit","path":"LUM-ViT.py","file_url":"https://github.com/maxllf/lum-vit/blob/HEAD/LUM-ViT.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, maxllf/lum-vit when it was checked","code_sha256":"a18f2cd4db02fee5","code_sha256_prefix":"a18f2cd4db02fee5","mcp_get_code":{"code_sha256":"a18f2cd4db02fee5"}},{"arxiv_id":"2308.12510","arxiv_id_is_arxiv":true,"paper":"/paper/masked-autoencoders-are-efficient-class","title":"Masked Autoencoders are Efficient Class Incremental Learners","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scok30/MAE-CIL","path":"continual/vit.py","file_url":"https://github.com/scok30/MAE-CIL/blob/HEAD/continual/vit.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, scok30/MAE-CIL when it was checked","code_sha256":"36555c3eaf0df8b4","code_sha256_prefix":"36555c3eaf0df8b4","mcp_get_code":{"code_sha256":"36555c3eaf0df8b4"}},{"arxiv_id":"2307.15324","arxiv_id_is_arxiv":true,"paper":"/paper/taskexpert-dynamically-assembling-multi-task","title":"TaskExpert: Dynamically Assembling Multi-Task Representations with Memorial Mixture-of-Experts","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prismformore/multi-task-transformer","path":"TaskPrompter/models/transformers/taskprompter.py","file_url":"https://github.com/prismformore/multi-task-transformer/blob/HEAD/TaskPrompter/models/transformers/taskprompter.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":"fe1af6a5e64c4760","code_sha256_prefix":"fe1af6a5e64c4760","mcp_get_code":{"code_sha256":"fe1af6a5e64c4760"}},{"arxiv_id":"2303.06329","arxiv_id_is_arxiv":true,"paper":"/paper/metaviewer-towards-a-unified-multi-view","title":"MetaViewer: Towards A Unified Multi-View Representation","date":"2023-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xxLifeLover/MetaViewer","path":"methods/MetaViewer.py","file_url":"https://github.com/xxLifeLover/MetaViewer/blob/HEAD/methods/MetaViewer.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":"b96dfe5898544303","code_sha256_prefix":"b96dfe5898544303","mcp_get_code":{"code_sha256":"b96dfe5898544303"}},{"arxiv_id":"2204.07683","arxiv_id_is_arxiv":true,"paper":"/paper/safe-self-refinement-for-transformer-based","title":"Safe Self-Refinement for Transformer-based Domain Adaptation","date":"2022-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/SSRT","path":"model/SSRT.py","file_url":"https://github.com/tsun/SSRT/blob/HEAD/model/SSRT.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":"ddbeb989cf002f02","code_sha256_prefix":"ddbeb989cf002f02","mcp_get_code":{"code_sha256":"ddbeb989cf002f02"}},{"arxiv_id":"2204.03645","arxiv_id_is_arxiv":true,"paper":"/paper/davit-dual-attention-vision-transformers","title":"DaViT: Dual Attention Vision Transformers","date":"2022-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingmyu/davit","path":"timm/models/davit.py","file_url":"https://github.com/dingmyu/davit/blob/HEAD/timm/models/davit.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":"62d0b713fcda8506","code_sha256_prefix":"62d0b713fcda8506","mcp_get_code":{"code_sha256":"62d0b713fcda8506"}},{"arxiv_id":"2104.11227","arxiv_id_is_arxiv":true,"paper":"/paper/multiscale-vision-transformers","title":"Multiscale Vision Transformers","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohanshad/cmr_transformer","path":"arch/mvit.py","file_url":"https://github.com/rohanshad/cmr_transformer/blob/HEAD/arch/mvit.py","status":"unverified","verification_level":0,"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, rohanshad/cmr_transformer (NOASSERTION)","code_sha256":"31c2f4da4c4a0948","code_sha256_prefix":"31c2f4da4c4a0948","mcp_get_code":{"code_sha256":"31c2f4da4c4a0948"}},{"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":"wangguanan/light-reid","path":"lightreid/models/backbones/transformers/vit_timm.py","file_url":"https://github.com/wangguanan/light-reid/blob/HEAD/lightreid/models/backbones/transformers/vit_timm.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, wangguanan/light-reid when it was checked","code_sha256":"26d4bd0ece4e237e","code_sha256_prefix":"26d4bd0ece4e237e","mcp_get_code":{"code_sha256":"26d4bd0ece4e237e"}}],"record_sha256":"f8398dfa13852f06b7721fab185b6f619c6037da37e31d9c77f612f11d2a3d1e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}