{"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/zero-2","entry":"Zero","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":8,"n_places":8,"n_places_pointer_only":4,"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":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":"2306.05031","arxiv_id_is_arxiv":true,"paper":"/paper/generalizable-lightweight-proxy-for-robust-1","title":"Generalizable Lightweight Proxy for Robust NAS against Diverse Perturbations","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonjeongha/croze","path":"zero_cost_methods/pruners/measures/croze.py","file_url":"https://github.com/hyeonjeongha/croze/blob/HEAD/zero_cost_methods/pruners/measures/croze.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hyeonjeongha/croze when it was checked","code_sha256":"a6fabdd3d9998eec","code_sha256_prefix":"a6fabdd3d9998eec","mcp_get_code":{"code_sha256":"a6fabdd3d9998eec"}},{"arxiv_id":"2111.13293","arxiv_id_is_arxiv":true,"paper":"/paper/knas-green-neural-architecture-search","title":"KNAS: Green Neural Architecture Search","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingjing-nlp/knas","path":"lib/models/cell_searchs/search_cells.py","file_url":"https://github.com/jingjing-nlp/knas/blob/HEAD/lib/models/cell_searchs/search_cells.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":"241a3f0cda58125e","code_sha256_prefix":"241a3f0cda58125e","mcp_get_code":{"code_sha256":"241a3f0cda58125e"}},{"arxiv_id":"2105.12151","arxiv_id_is_arxiv":true,"paper":"/paper/autorecon-neural-architecture-search-based","title":"AutoReCon: Neural Architecture Search-based Reconstruction for Data-free Compression","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamkanghyunchoi/ait","path":"AutoReCon_AIT/model_generator.py","file_url":"https://github.com/iamkanghyunchoi/ait/blob/HEAD/AutoReCon_AIT/model_generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, iamkanghyunchoi/ait, is not in the permissive set Syntology serves inline","code_sha256":"5a30505956439bef","code_sha256_prefix":"5a30505956439bef","mcp_get_code":{"code_sha256":"5a30505956439bef"}},{"arxiv_id":"2004.07802","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-aware-gradient-algorithms-for-neural","title":"Geometry-Aware Gradient Algorithms for Neural Architecture Search","date":"2020-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NivNayman/XNAS","path":"model.py","file_url":"https://github.com/NivNayman/XNAS/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc41443a9046202e","code_sha256_prefix":"bc41443a9046202e","mcp_get_code":{"code_sha256":"bc41443a9046202e"}},{"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":"sinamoradian/SNIP-NAS-2","path":"model_search.py","file_url":"https://github.com/sinamoradian/SNIP-NAS-2/blob/HEAD/model_search.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sinamoradian/SNIP-NAS-2 when it was checked","code_sha256":"0c8c2cf75802acb2","code_sha256_prefix":"0c8c2cf75802acb2","mcp_get_code":{"code_sha256":"0c8c2cf75802acb2"}},{"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":"nikita270a/BayesianDARTS","path":"models/search_cells.py","file_url":"https://github.com/nikita270a/BayesianDARTS/blob/HEAD/models/search_cells.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":"960cb4ae0bb7b06e","code_sha256_prefix":"960cb4ae0bb7b06e","mcp_get_code":{"code_sha256":"960cb4ae0bb7b06e"}},{"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":"ky941122/darts-experiment","path":"models/search_cells.py","file_url":"https://github.com/ky941122/darts-experiment/blob/HEAD/models/search_cells.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":"40adb1723238c54f","code_sha256_prefix":"40adb1723238c54f","mcp_get_code":{"code_sha256":"40adb1723238c54f"}},{"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":"anonNo2/MulTeacher-KD","path":"models/search_cnn.py","file_url":"https://github.com/anonNo2/MulTeacher-KD/blob/HEAD/models/search_cnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anonNo2/MulTeacher-KD when it was checked","code_sha256":"157a9f2bb5c00947","code_sha256_prefix":"157a9f2bb5c00947","mcp_get_code":{"code_sha256":"157a9f2bb5c00947"}}],"record_sha256":"3e7c84f0bb46faeff886b13086f193fbcd9c1c975a41b28078fb98c53a3d0a27","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}