{"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/get-num-gen","entry":"get_num_gen","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"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":2,"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":"2302.06359","arxiv_id_is_arxiv":true,"paper":"/paper/fixing-overconfidence-in-dynamic-neural","title":"Fixing Overconfidence in Dynamic Neural Networks","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/calibrated-dnn","path":"op_counter.py","file_url":"https://github.com/aaltoml/calibrated-dnn/blob/HEAD/op_counter.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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2211.16726","arxiv_id_is_arxiv":true,"paper":"/paper/boosted-dynamic-neural-networks","title":"Boosted Dynamic Neural Networks","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/Boosted-Dynamic-Networks","path":"op_counter.py","file_url":"https://github.com/SHI-Labs/Boosted-Dynamic-Networks/blob/HEAD/op_counter.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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2105.03193","arxiv_id_is_arxiv":true,"paper":"/paper/network-pruning-that-matters-a-case-study-on-1","title":"Network Pruning That Matters: A Case Study on Retraining Variants","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lehduong/NPTM","path":"hrank/get_flops.py","file_url":"https://github.com/lehduong/NPTM/blob/HEAD/hrank/get_flops.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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2007.04242","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-group-convolution-for-accelerating","title":"Dynamic Group Convolution for Accelerating Convolutional Neural Networks","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuogege1943/dgc","path":"utils.py","file_url":"https://github.com/zhuogege1943/dgc/blob/HEAD/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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1904.12368","arxiv_id_is_arxiv":true,"paper":"/paper/legr-filter-pruning-via-learned-global","title":"Towards Efficient Model Compression via Learned Global Ranking","date":"2019-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmu-enyac/LeGR","path":"pruner/fp_resnet.py","file_url":"https://github.com/cmu-enyac/LeGR/blob/HEAD/pruner/fp_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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1711.02613","arxiv_id_is_arxiv":true,"paper":"/paper/moonshine-distilling-with-cheap-convolutions","title":"Moonshine: Distilling with Cheap Convolutions","date":"2017-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BayesWatch/pytorch-moonshine","path":"count_flops.py","file_url":"https://github.com/BayesWatch/pytorch-moonshine/blob/HEAD/count_flops.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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1703.09844","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-dense-networks-for-resource","title":"Multi-Scale Dense Networks for Resource Efficient Image Classification","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kalviny/MSDNet-PyTorch","path":"op_counter.py","file_url":"https://github.com/kalviny/MSDNet-PyTorch/blob/HEAD/op_counter.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":"76cc74efee42ba21","code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"136830480","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136830480 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"fanhanwei/BOCR","path":"lib/net_measure.py","file_url":"https://github.com/fanhanwei/BOCR/blob/HEAD/lib/net_measure.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":"4b1431fbfa17357a","code_sha256_prefix":"4b1431fbfa17357a","mcp_get_code":{"code_sha256":"4b1431fbfa17357a"}}],"record_sha256":"43ee63e8e762706fecfbc8b422e82b944b0bfe7b0c62213dbf1a007f61c7b894","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}