{"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/count-parameters-in-mb","entry":"count_parameters_in_MB","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":3,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":14,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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":"2403.07591","arxiv_id_is_arxiv":true,"paper":"/paper/robustifying-and-boosting-training-free","title":"Robustifying and Boosting Training-Free Neural Architecture Search","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzf1174/RoBoT","path":"darts_space/utils.py","file_url":"https://github.com/hzf1174/RoBoT/blob/HEAD/darts_space/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e615a9d09865bd9f","code_sha256_prefix":"e615a9d09865bd9f","mcp_get_code":{"code_sha256":"e615a9d09865bd9f"}},{"arxiv_id":"2307.14768","arxiv_id_is_arxiv":true,"paper":"/paper/gloss-free-sign-language-translation","title":"Gloss-free Sign Language Translation: Improving from Visual-Language Pretraining","date":"2023-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhoubenjia/gfslt-vlp","path":"utils.py","file_url":"https://github.com/zhoubenjia/gfslt-vlp/blob/HEAD/utils.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":"0fee20319bd8425a","code_sha256_prefix":"0fee20319bd8425a","mcp_get_code":{"code_sha256":"0fee20319bd8425a"}},{"arxiv_id":"2108.04392","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-architecture-selection-in-1","title":"Rethinking Architecture Selection in Differentiable NAS","date":"2021-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruocwang/darts-pt","path":"sota/cnn/projection.py","file_url":"https://github.com/ruocwang/darts-pt/blob/HEAD/sota/cnn/projection.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2103.15798","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-neural-operations-for-diverse","title":"Rethinking Neural Operations for Diverse Tasks","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nick11roberts/XD","path":"DARTS/utils.py","file_url":"https://github.com/nick11roberts/XD/blob/HEAD/DARTS/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2009.01027","arxiv_id_is_arxiv":true,"paper":"/paper/darts-robustly-stepping-out-of-performance","title":"DARTS-: Robustly Stepping out of Performance Collapse Without Indicators","date":"2020-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Meituan-AutoML/DARTS-","path":"src/utils.py","file_url":"https://github.com/Meituan-AutoML/DARTS-/blob/HEAD/src/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2007.03331","arxiv_id_is_arxiv":true,"paper":"/paper/gold-nas-gradual-one-level-differentiable","title":"GOLD-NAS: Gradual, One-Level, Differentiable","date":"2020-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunsmarterjie/GOLD_NAS","path":"cifar_search/utils.py","file_url":"https://github.com/sunsmarterjie/GOLD_NAS/blob/HEAD/cifar_search/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2007.03154","arxiv_id_is_arxiv":true,"paper":"/paper/discretization-aware-architecture-search","title":"Discretization-Aware Architecture Search","date":"2020-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunsmarterjie/DAAS","path":"cnn/utils.py","file_url":"https://github.com/sunsmarterjie/DAAS/blob/HEAD/cnn/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2006.16537","arxiv_id_is_arxiv":true,"paper":"/paper/theory-inspired-path-regularized-differential","title":"Theory-Inspired Path-Regularized Differential Network Architecture Search","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/PR-DARTS","path":"PRDARTS_eval/utils.py","file_url":"https://github.com/salesforce/PR-DARTS/blob/HEAD/PRDARTS_eval/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"2006.13554","arxiv_id_is_arxiv":true,"paper":"/paper/normalized-loss-functions-for-deep-learning","title":"Normalized Loss Functions for Deep Learning with Noisy Labels","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanxunH/Active-Passive-Losses","path":"archive/utils/utils.py","file_url":"https://github.com/HanxunH/Active-Passive-Losses/blob/HEAD/archive/utils/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":"a42ae792b2745b93","code_sha256_prefix":"a42ae792b2745b93","mcp_get_code":{"code_sha256":"a42ae792b2745b93"}},{"arxiv_id":"2004.14557","arxiv_id_is_arxiv":true,"paper":"/paper/a-multi-scale-optimization-learning-framework","title":"Learning Deformable Image Registration from Optimization: Perspective, Modules, Bilevel Training and Beyond","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alison-brie/MultiPropReg","path":"utils.py","file_url":"https://github.com/Alison-brie/MultiPropReg/blob/HEAD/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"1912.00195","arxiv_id_is_arxiv":true,"paper":"/paper/sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lightaime/sgas","path":"cnn/utils.py","file_url":"https://github.com/lightaime/sgas/blob/HEAD/cnn/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}},{"arxiv_id":"1909.09656","arxiv_id_is_arxiv":true,"paper":"/paper/190909656","title":"Understanding and Robustifying Differentiable Architecture Search","date":"2019-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/RobustDARTS","path":"src/utils.py","file_url":"https://github.com/automl/RobustDARTS/blob/HEAD/src/utils.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":"4a15744aa9113a33","code_sha256_prefix":"4a15744aa9113a33","mcp_get_code":{"code_sha256":"4a15744aa9113a33"}},{"arxiv_id":"1907.05737","arxiv_id_is_arxiv":true,"paper":"/paper/pc-darts-partial-channel-connections-for","title":"PC-DARTS: Partial Channel Connections for Memory-Efficient Architecture Search","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peteryuX/pcdarts-tf2","path":"modules/utils.py","file_url":"https://github.com/peteryuX/pcdarts-tf2/blob/HEAD/modules/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":"c936ca3fba6360d8","code_sha256_prefix":"c936ca3fba6360d8","mcp_get_code":{"code_sha256":"c936ca3fba6360d8"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quark0/darts","path":"cnn/utils.py","file_url":"https://github.com/quark0/darts/blob/HEAD/cnn/utils.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":"3e816289579cc9e9","code_sha256_prefix":"3e816289579cc9e9","mcp_get_code":{"code_sha256":"3e816289579cc9e9"}}],"record_sha256":"c95290a0161f74cf295fb7d1cc6b64f39e72c0139a71bb40cb67575c19d57907","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}