{"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/linear-warmup-learning-rate","entry":"linear_warmup_learning_rate","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":0,"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":2,"unverified":0},"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":"2201.02784","arxiv_id_is_arxiv":true,"paper":"/paper/relieving-long-tailed-instance-segmentation","title":"Relieving Long-tailed Instance Segmentation via Pairwise Class Balance","date":"2022-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2023-MindSpore-1/ms-code-105","path":"src/lr_schedule.py","file_url":"https://github.com/2023-MindSpore-1/ms-code-105/blob/HEAD/src/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"2106.13230","arxiv_id_is_arxiv":true,"paper":"/paper/video-swin-transformer","title":"Video Swin Transformer","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ytw1996/swin3d_mindspore","path":"src/schedule/lr_schedule.py","file_url":"https://github.com/ytw1996/swin3d_mindspore/blob/HEAD/src/schedule/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"2103.13413","arxiv_id_is_arxiv":true,"paper":"/paper/vision-transformers-for-dense-prediction","title":"Vision Transformers for Dense Prediction","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mszpc/3d_dense","path":"3d_densenet/src/lr_schedule.py","file_url":"https://github.com/mszpc/3d_dense/blob/HEAD/3d_densenet/src/lr_schedule.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":"22bcde3a70606484","code_sha256_prefix":"22bcde3a70606484","mcp_get_code":{"code_sha256":"22bcde3a70606484"}},{"arxiv_id":"2004.04730","arxiv_id_is_arxiv":true,"paper":"/paper/x3d-expanding-architectures-for-efficient","title":"X3D: Expanding Architectures for Efficient Video Recognition","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"STONE-SAMA/x3d_mindspore","path":"src/schedule/lr_schedule.py","file_url":"https://github.com/STONE-SAMA/x3d_mindspore/blob/HEAD/src/schedule/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"1904.01906","arxiv_id_is_arxiv":true,"paper":"/paper/what-is-wrong-with-scene-text-recognition","title":"What Is Wrong With Scene Text Recognition Model Comparisons? Dataset and Model Analysis","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/cnnctc","path":"src/lr_schedule.py","file_url":"https://github.com/JoegameZhou/cnnctc/blob/HEAD/src/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"1606.06650","arxiv_id_is_arxiv":true,"paper":"/paper/3d-u-net-learning-dense-volumetric","title":"3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation","date":"2016-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiajun169/mindspore_models","path":"Unet3d/src/lr_schedule.py","file_url":"https://github.com/jiajun169/mindspore_models/blob/HEAD/Unet3d/src/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"1606.04797","arxiv_id_is_arxiv":true,"paper":"/paper/v-net-fully-convolutional-neural-networks-for","title":"V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alililia/VNet_Ascend","path":"src/utils.py","file_url":"https://github.com/alililia/VNet_Ascend/blob/HEAD/src/utils.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}},{"arxiv_id":"1506.01497","arxiv_id_is_arxiv":true,"paper":"/paper/faster-r-cnn-towards-real-time-object","title":"Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks","date":"2015-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/hrnetv2","path":"src/lr_schedule.py","file_url":"https://github.com/JoegameZhou/hrnetv2/blob/HEAD/src/lr_schedule.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":"d6a99ec714147ac1","code_sha256_prefix":"d6a99ec714147ac1","mcp_get_code":{"code_sha256":"d6a99ec714147ac1"}}],"record_sha256":"65ed3c855c192b2e1f8eff1d5791b1df71ccd7977c6096fd8eca28586f18de24","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}