{"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-lr","entry":"linear_warmup_lr","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":12,"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":5,"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":"2110.11945","arxiv_id_is_arxiv":true,"paper":"/paper/soft-softmax-free-transformer-with-linear","title":"SOFT: Softmax-free Transformer with Linear Complexity","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-zvg/SOFT_MindSpore_Ascend","path":"src/lr_generator.py","file_url":"https://github.com/fudan-zvg/SOFT_MindSpore_Ascend/blob/HEAD/src/lr_generator.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":"9da7260d717664f9","code_sha256_prefix":"9da7260d717664f9","mcp_get_code":{"code_sha256":"9da7260d717664f9"}},{"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":"ZhouDaShan123/vit","path":"src/lr.py","file_url":"https://github.com/ZhouDaShan123/vit/blob/HEAD/src/lr.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":"8a0d4718d0f91120","code_sha256_prefix":"8a0d4718d0f91120","mcp_get_code":{"code_sha256":"8a0d4718d0f91120"}},{"arxiv_id":"2006.04388","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-focal-loss-learning-qualified-and","title":"Generalized Focal Loss: Learning Qualified and Distributed Bounding Boxes for Dense Object Detection","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mszpc/nanodet","path":"nanodet/src/lr_schedule.py","file_url":"https://github.com/mszpc/nanodet/blob/HEAD/nanodet/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":"56d39004d57cb3a2","code_sha256_prefix":"56d39004d57cb3a2","mcp_get_code":{"code_sha256":"56d39004d57cb3a2"}},{"arxiv_id":"2005.05650","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-image-rescaling","title":"Invertible Image Rescaling","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/ms-irn","path":"src/optim/warmup_cosine_annealing_lr.py","file_url":"https://github.com/JoegameZhou/ms-irn/blob/HEAD/src/optim/warmup_cosine_annealing_lr.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":"168634e8dabebd81","code_sha256_prefix":"168634e8dabebd81","mcp_get_code":{"code_sha256":"168634e8dabebd81"}},{"arxiv_id":"2005.05650","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-image-rescaling","title":"Invertible Image Rescaling","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/ms-irn","path":"src/optim/warmup_multisteplr.py","file_url":"https://github.com/JoegameZhou/ms-irn/blob/HEAD/src/optim/warmup_multisteplr.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":"e333b3db3a301339","code_sha256_prefix":"e333b3db3a301339","mcp_get_code":{"code_sha256":"e333b3db3a301339"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghuiyao/yolov5_mindspore","path":"src/lr_scheduler.py","file_url":"https://github.com/zhanghuiyao/yolov5_mindspore/blob/HEAD/src/lr_scheduler.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":"56d39004d57cb3a2","code_sha256_prefix":"56d39004d57cb3a2","mcp_get_code":{"code_sha256":"56d39004d57cb3a2"}},{"arxiv_id":"2001.04193","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-for-person-re-identification-a","title":"Deep Learning for Person Re-identification: A Survey and Outlook","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haoyu1004/AGW_mindspore","path":"src/utils/lr_generator.py","file_url":"https://github.com/Haoyu1004/AGW_mindspore/blob/HEAD/src/utils/lr_generator.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":"56d39004d57cb3a2","code_sha256_prefix":"56d39004d57cb3a2","mcp_get_code":{"code_sha256":"56d39004d57cb3a2"}},{"arxiv_id":"1911.09070","arxiv_id_is_arxiv":true,"paper":"/paper/efficientdet-scalable-and-efficient-object","title":"EfficientDet: Scalable and Efficient Object Detection","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/efficientdet","path":"src/lr_schedule.py","file_url":"https://github.com/lyqcom/efficientdet/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":"56d39004d57cb3a2","code_sha256_prefix":"56d39004d57cb3a2","mcp_get_code":{"code_sha256":"56d39004d57cb3a2"}},{"arxiv_id":"1907.03222","arxiv_id_is_arxiv":true,"paper":"/paper/irnet-a-general-purpose-deep-residual","title":"IRNet: A General Purpose Deep Residual Regression Framework for Materials Discovery","date":"2019-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/irn","path":"src/optim/warmup_cosine_annealing_lr.py","file_url":"https://github.com/lyqcom/irn/blob/HEAD/src/optim/warmup_cosine_annealing_lr.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":"168634e8dabebd81","code_sha256_prefix":"168634e8dabebd81","mcp_get_code":{"code_sha256":"168634e8dabebd81"}},{"arxiv_id":"1907.03222","arxiv_id_is_arxiv":true,"paper":"/paper/irnet-a-general-purpose-deep-residual","title":"IRNet: A General Purpose Deep Residual Regression Framework for Materials Discovery","date":"2019-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/irn","path":"src/optim/warmup_multisteplr.py","file_url":"https://github.com/lyqcom/irn/blob/HEAD/src/optim/warmup_multisteplr.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":"e333b3db3a301339","code_sha256_prefix":"e333b3db3a301339","mcp_get_code":{"code_sha256":"e333b3db3a301339"}},{"arxiv_id":"1811.12814","arxiv_id_is_arxiv":true,"paper":"/paper/graph-based-global-reasoning-networks","title":"Graph-Based Global Reasoning Networks","date":"2018-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/glore_res200","path":"src/lr_generator.py","file_url":"https://github.com/yangyucheng000/glore_res200/blob/HEAD/src/lr_generator.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":"9da7260d717664f9","code_sha256_prefix":"9da7260d717664f9","mcp_get_code":{"code_sha256":"9da7260d717664f9"}},{"arxiv_id":"1611.06612","arxiv_id_is_arxiv":true,"paper":"/paper/refinenet-multi-path-refinement-networks-for","title":"RefineNet: Multi-Path Refinement Networks for High-Resolution Semantic Segmentation","date":"2016-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alililia/ascend_RefineNet","path":"src/learning_rates.py","file_url":"https://github.com/alililia/ascend_RefineNet/blob/HEAD/src/learning_rates.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":"9da7260d717664f9","code_sha256_prefix":"9da7260d717664f9","mcp_get_code":{"code_sha256":"9da7260d717664f9"}}],"record_sha256":"9a1e94f4630fc40a451e772dc4df09a8fe668b1166eec9c7e3378c65a8a6e207","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}