{"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-weights-vit-timm","entry":"init_weights_vit_timm","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":6,"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":6,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":6},"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":"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":"a6c021ba2c2d56e3","code_sha256_prefix":"a6c021ba2c2d56e3","mcp_get_code":{"code_sha256":"a6c021ba2c2d56e3"}},{"arxiv_id":"2602.17559","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17559","title":"Revisiting Weight Regularization for Low-Rank Continual Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"yaoyz96/low-rank-cl","path":"methods/ewclora.py","file_url":"https://github.com/yaoyz96/low-rank-cl/blob/HEAD/methods/ewclora.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":"653d76549a080d2a","code_sha256_prefix":"653d76549a080d2a","mcp_get_code":{"code_sha256":"653d76549a080d2a"}},{"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":"38a6c338916f95c8","code_sha256_prefix":"38a6c338916f95c8","mcp_get_code":{"code_sha256":"38a6c338916f95c8"}},{"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":"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, Zhanxin-Gao/CPrompt when it was checked","code_sha256":"b0029619c3cefde0","code_sha256_prefix":"b0029619c3cefde0","mcp_get_code":{"code_sha256":"b0029619c3cefde0"}},{"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":"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, ByungKwanLee/Causal-Unsupervised-Segmentation when it was checked","code_sha256":"9c2af68d5f7355a0","code_sha256_prefix":"9c2af68d5f7355a0","mcp_get_code":{"code_sha256":"9c2af68d5f7355a0"}},{"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":"unverified","verification_level":0,"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":"9c07111952a8132e","code_sha256_prefix":"9c07111952a8132e","mcp_get_code":{"code_sha256":"9c07111952a8132e"}}],"record_sha256":"73a0649f9a2bf018d1ce0b7eb015750f0a048e38907660d73a41d6a5aa1c011e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}