{"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/calculate-gain","entry":"calculate_gain","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":14,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"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":"2409.10594","arxiv_id_is_arxiv":true,"paper":"/paper/kolmogorov-arnold-transformer","title":"Kolmogorov-Arnold Transformer","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Adamdad/kat","path":"katransformer.py","file_url":"https://github.com/Adamdad/kat/blob/HEAD/katransformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79442175a7039d31","code_sha256_prefix":"79442175a7039d31","mcp_get_code":{"code_sha256":"79442175a7039d31"}},{"arxiv_id":"2401.11772","arxiv_id_is_arxiv":true,"paper":"/paper/lightdic-a-simple-yet-effective-approach-for","title":"LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xkli-allen/lightdic","path":"models/init.py","file_url":"https://github.com/xkli-allen/lightdic/blob/HEAD/models/init.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, xkli-allen/lightdic when it was checked","code_sha256":"3f1dc5723dc35555","code_sha256_prefix":"3f1dc5723dc35555","mcp_get_code":{"code_sha256":"3f1dc5723dc35555"}},{"arxiv_id":"2203.09313","arxiv_id_is_arxiv":true,"paper":"/paper/eva2-0-investigating-open-domain-chinese","title":"EVA2.0: Investigating Open-Domain Chinese Dialogue Systems with Large-Scale Pre-Training","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MindSpore-scientific/code-6","path":"neural-audio-synthesis-wavenet/WaveNetEncoder.py","file_url":"https://github.com/MindSpore-scientific/code-6/blob/HEAD/neural-audio-synthesis-wavenet/WaveNetEncoder.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":"72d3cab82bc65d33","code_sha256_prefix":"72d3cab82bc65d33","mcp_get_code":{"code_sha256":"72d3cab82bc65d33"}},{"arxiv_id":"2107.08430","arxiv_id_is_arxiv":true,"paper":"/paper/yolox-exceeding-yolo-series-in-2021","title":"YOLOX: Exceeding YOLO Series in 2021","date":"2021-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2023-MindSpore-1/ms-code-31","path":"src/initializer.py","file_url":"https://github.com/2023-MindSpore-1/ms-code-31/blob/HEAD/src/initializer.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":"e460868d0e106ef7","code_sha256_prefix":"e460868d0e106ef7","mcp_get_code":{"code_sha256":"e460868d0e106ef7"}},{"arxiv_id":"2106.02898","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-resolution-network","title":"Dynamic Resolution Network","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LKLQQ/DRNet","path":"src/classifier.py","file_url":"https://github.com/LKLQQ/DRNet/blob/HEAD/src/classifier.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":"82c48515ddda4614","code_sha256_prefix":"82c48515ddda4614","mcp_get_code":{"code_sha256":"82c48515ddda4614"}},{"arxiv_id":"2105.15203","arxiv_id_is_arxiv":true,"paper":"/paper/segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoegameZhou/Segmenter_workers","path":"src/models/layers/weight_init.py","file_url":"https://github.com/JoegameZhou/Segmenter_workers/blob/HEAD/src/models/layers/weight_init.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":"882f145326210430","code_sha256_prefix":"882f145326210430","mcp_get_code":{"code_sha256":"882f145326210430"}},{"arxiv_id":"2104.09124","arxiv_id_is_arxiv":true,"paper":"/paper/disco-remedy-self-supervised-learning-on","title":"DisCo: Remedy Self-supervised Learning on Lightweight Models with Distilled Contrastive Learning","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/DisCo","path":"DisCo/ResNet_ms.py","file_url":"https://github.com/lyqcom/DisCo/blob/HEAD/DisCo/ResNet_ms.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":"82c48515ddda4614","code_sha256_prefix":"82c48515ddda4614","mcp_get_code":{"code_sha256":"82c48515ddda4614"}},{"arxiv_id":"2104.00298","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwzwx1190522/efficientnetv2","path":"efficientnetv2/src/models/var_init.py","file_url":"https://github.com/hwzwx1190522/efficientnetv2/blob/HEAD/efficientnetv2/src/models/var_init.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":"e460868d0e106ef7","code_sha256_prefix":"e460868d0e106ef7","mcp_get_code":{"code_sha256":"e460868d0e106ef7"}},{"arxiv_id":"2001.07685","arxiv_id_is_arxiv":true,"paper":"/paper/fixmatch-simplifying-semi-supervised-learning","title":"FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence","date":"2020-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"S-HuaBomb/FixMatch-Paddle","path":"models/initializers.py","file_url":"https://github.com/S-HuaBomb/FixMatch-Paddle/blob/HEAD/models/initializers.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":"96901d00bcfc5b79","code_sha256_prefix":"96901d00bcfc5b79","mcp_get_code":{"code_sha256":"96901d00bcfc5b79"}},{"arxiv_id":"1910.02562","arxiv_id_is_arxiv":true,"paper":"/paper/master-multi-aspect-non-local-network-for","title":"MASTER: Multi-Aspect Non-local Network for Scene Text Recognition","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"S-HuaBomb/MASTER-paddle","path":"model/initializers.py","file_url":"https://github.com/S-HuaBomb/MASTER-paddle/blob/HEAD/model/initializers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c1510caf3cf76cb","code_sha256_prefix":"5c1510caf3cf76cb","mcp_get_code":{"code_sha256":"5c1510caf3cf76cb"}},{"arxiv_id":"1812.01187","arxiv_id_is_arxiv":true,"paper":"/paper/bag-of-tricks-for-image-classification-with","title":"Bag of Tricks for Image Classification with Convolutional Neural Networks","date":"2018-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/resnet_Ascend","path":"src/resnet.py","file_url":"https://github.com/yangyucheng000/resnet_Ascend/blob/HEAD/src/resnet.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":"82c48515ddda4614","code_sha256_prefix":"82c48515ddda4614","mcp_get_code":{"code_sha256":"82c48515ddda4614"}},{"arxiv_id":"1804.02767","arxiv_id_is_arxiv":true,"paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghuiyao/yolov3_mindspore","path":"src/initializer.py","file_url":"https://github.com/zhanghuiyao/yolov3_mindspore/blob/HEAD/src/initializer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e460868d0e106ef7","code_sha256_prefix":"e460868d0e106ef7","mcp_get_code":{"code_sha256":"e460868d0e106ef7"}},{"arxiv_id":"1803.10123","arxiv_id_is_arxiv":true,"paper":"/paper/task-agnostic-continual-learning-using-online","title":"Task Agnostic Continual Learning Using Online Variational Bayes","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igolan/bgd","path":"nn_utils/init_utils.py","file_url":"https://github.com/igolan/bgd/blob/HEAD/nn_utils/init_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35b9edc57d88d973","code_sha256_prefix":"35b9edc57d88d973","mcp_get_code":{"code_sha256":"35b9edc57d88d973"}},{"arxiv_id":"1612.04402","arxiv_id_is_arxiv":true,"paper":"/paper/finding-tiny-faces","title":"Finding Tiny Faces","date":"2016-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuoQuanhao/Tiny-Face-Paddle","path":"models/initializer.py","file_url":"https://github.com/GuoQuanhao/Tiny-Face-Paddle/blob/HEAD/models/initializer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d32692be0e110bc9","code_sha256_prefix":"d32692be0e110bc9","mcp_get_code":{"code_sha256":"d32692be0e110bc9"}}],"record_sha256":"22412030073c19e8b249b7c25a105c2d26fe2a538f02f53e829bb9887de12fa5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}