{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/get-num-gen","entry":"get_num_gen","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":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":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2211.16726","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2105.03193","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"2007.04242","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1904.12368","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1711.02613","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"1703.09844","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"76cc74efee42ba21","mcp_get_code":{"code_sha256":"76cc74efee42ba21"}},{"arxiv_id":"136830480","paper":null,"title":"arXiv:136830480","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b1431fbfa17357a","mcp_get_code":{"code_sha256":"4b1431fbfa17357a"}}]}