{"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":"/dataset/nats-bench/papers/ran/1","list_of":"/dataset/nats-bench","dataset":"NATS-Bench","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"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'","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,3],"of":3,"counts":{"papers_with_a_benchmark_row":10,"with_a_code_link":7,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/nats-bench/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/knas-green-neural-architecture-search","slug":"knas-green-neural-architecture-search","title":"KNAS: Green Neural Architecture Search","date":"2021-11-26","arxiv_id":"2111.13293","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":6,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jingjing-nlp/knas"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/knas-green-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/2111.13293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13293"}}}},{"paper":"/paper/neural-architecture-search-on-imagenet-in-1","slug":"neural-architecture-search-on-imagenet-in-1","title":"Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspective","date":"2021-02-23","arxiv_id":"2102.11535","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["VITA-Group/TENAS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-architecture-search-on-imagenet-in-1#ran","syntology_url":"https://syntology.ai/paper/2102.11535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11535"}}}},{"paper":"/paper/proximal-policy-optimization-algorithms","slug":"proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","arxiv_id":"1707.06347","rows_on_this_dataset":3,"code_links":188,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":176,"samples_ran":99,"samples_constructed":53,"samples_ran_checked":71,"samples_ran_instrument_failed":28,"samples_unverified":77,"pointer_only_for_licence":94,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/proximal-policy-optimization-algorithms#ran","syntology_url":"https://syntology.ai/paper/1707.06347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.06347"}}}}],"record_sha256":"799844bf4181aab4cbedf5b169ad6855dfd72dc7de431b480e28034254e8ad61","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}