{"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-model-complexity-info","entry":"get_model_complexity_info","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":1,"n_papers_ran_no_instrument_failure":1,"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":10,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":1,"unverified":9},"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":"2308.12538","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-guided-dynamic-network-for-image","title":"Mutual-Guided Dynamic Network for Image Fusion","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guanys-dar/mgdn","path":"utils/utils_modelsummary.py","file_url":"https://github.com/guanys-dar/mgdn/blob/HEAD/utils/utils_modelsummary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, guanys-dar/mgdn when it was checked","code_sha256":"6ef91108ba92f025","code_sha256_prefix":"6ef91108ba92f025","mcp_get_code":{"code_sha256":"6ef91108ba92f025"}},{"arxiv_id":"2303.11525","arxiv_id_is_arxiv":true,"paper":"/paper/sift-sparse-iso-flop-transformations-for","title":"Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiency","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CerebrasResearch/Sparse-IFT","path":"cbsparse/sparse/utils/profiler_utils.py","file_url":"https://github.com/CerebrasResearch/Sparse-IFT/blob/HEAD/cbsparse/sparse/utils/profiler_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":"f131b1b13ef74337","code_sha256_prefix":"f131b1b13ef74337","mcp_get_code":{"code_sha256":"f131b1b13ef74337"}},{"arxiv_id":"2303.09472","arxiv_id_is_arxiv":true,"paper":"/paper/diffir-efficient-diffusion-model-for-image","title":"DiffIR: Efficient Diffusion Model for Image Restoration","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zj-BinXia/DiffIR","path":"DiffIR-SRGAN/utils_modelsummary.py","file_url":"https://github.com/Zj-BinXia/DiffIR/blob/HEAD/DiffIR-SRGAN/utils_modelsummary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from guanys-dar/mgdn, and GitHub detected no licence in that repository when it was checked","code_sha256":"6ef91108ba92f025","code_sha256_prefix":"6ef91108ba92f025","mcp_get_code":{"code_sha256":"6ef91108ba92f025"}},{"arxiv_id":"2301.11929","arxiv_id_is_arxiv":true,"paper":"/paper/training-full-spike-neural-networks-via","title":"Training Full Spike Neural Networks via Auxiliary Accumulation Pathway","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iCGY96/syops-counter","path":"syops/flops_counter.py","file_url":"https://github.com/iCGY96/syops-counter/blob/HEAD/syops/flops_counter.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":"49528bea8c87044b","code_sha256_prefix":"49528bea8c87044b","mcp_get_code":{"code_sha256":"49528bea8c87044b"}},{"arxiv_id":"2212.00968","arxiv_id_is_arxiv":true,"paper":"/paper/uiu-net-u-net-in-u-net-for-infrared-small","title":"UIU-Net: U-Net in U-Net for Infrared Small Object Detection","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danfenghong/ieee_tip_uiu-net","path":"compute_cost.py","file_url":"https://github.com/danfenghong/ieee_tip_uiu-net/blob/HEAD/compute_cost.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":"03fe1448ec9d717b","code_sha256_prefix":"03fe1448ec9d717b","mcp_get_code":{"code_sha256":"03fe1448ec9d717b"}},{"arxiv_id":"2211.05910","arxiv_id_is_arxiv":true,"paper":"/paper/2211-05910","title":"Efficient and Accurate Quantized Image Super-Resolution on Mobile NPUs, Mobile AI & AIM 2022 challenge: Report","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eduardzamfir/ntire23-rtsr","path":"demo/utils/model_summary.py","file_url":"https://github.com/eduardzamfir/ntire23-rtsr/blob/HEAD/demo/utils/model_summary.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":"91383555d4366904","code_sha256_prefix":"91383555d4366904","mcp_get_code":{"code_sha256":"91383555d4366904"}},{"arxiv_id":"2210.05144","arxiv_id_is_arxiv":true,"paper":"/paper/mixture-of-attention-heads-selecting","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sovrasov/flops-counter.pytorch","path":"ptflops/flops_counter.py","file_url":"https://github.com/sovrasov/flops-counter.pytorch/blob/HEAD/ptflops/flops_counter.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":"46e7df6447a3d499","code_sha256_prefix":"46e7df6447a3d499","mcp_get_code":{"code_sha256":"46e7df6447a3d499"}},{"arxiv_id":"2207.13784","arxiv_id_is_arxiv":true,"paper":"/paper/avatarposer-articulated-full-body-pose","title":"AvatarPoser: Articulated Full-Body Pose Tracking from Sparse Motion Sensing","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-siplab/avatarposer","path":"utils/utils_modelsummary.py","file_url":"https://github.com/eth-siplab/avatarposer/blob/HEAD/utils/utils_modelsummary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from guanys-dar/mgdn, and GitHub detected no licence in that repository when it was checked","code_sha256":"6ef91108ba92f025","code_sha256_prefix":"6ef91108ba92f025","mcp_get_code":{"code_sha256":"6ef91108ba92f025"}},{"arxiv_id":"2205.05675","arxiv_id_is_arxiv":true,"paper":"/paper/ntire-2022-challenge-on-efficient-super","title":"NTIRE 2022 Challenge on Efficient Super-Resolution: Methods and Results","date":"2022-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ofsoundof/imdn","path":"utils/model_summary.py","file_url":"https://github.com/ofsoundof/imdn/blob/HEAD/utils/model_summary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from guanys-dar/mgdn, and GitHub detected no licence in that repository when it was checked","code_sha256":"6ef91108ba92f025","code_sha256_prefix":"6ef91108ba92f025","mcp_get_code":{"code_sha256":"6ef91108ba92f025"}},{"arxiv_id":"2201.06776","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-aware-sparse-regularization-for","title":"Pruning-aware Sparse Regularization for Network Pruning","date":"2022-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"casia-iva-lab/masksparsity","path":"netslim/flops_counter.py","file_url":"https://github.com/casia-iva-lab/masksparsity/blob/HEAD/netslim/flops_counter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, casia-iva-lab/masksparsity, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"fcc52c28bbf58580","code_sha256_prefix":"fcc52c28bbf58580","mcp_get_code":{"code_sha256":"fcc52c28bbf58580"}},{"arxiv_id":"2112.13635","arxiv_id_is_arxiv":true,"paper":"/paper/adaptivepose-human-parts-as-adaptive-points","title":"AdaptivePose: Human Parts as Adaptive Points","date":"2021-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"buptxyb666/AdaptivePose","path":"src/flops_counter.py","file_url":"https://github.com/buptxyb666/AdaptivePose/blob/HEAD/src/flops_counter.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":"dfff4c6662e76048","code_sha256_prefix":"dfff4c6662e76048","mcp_get_code":{"code_sha256":"dfff4c6662e76048"}},{"arxiv_id":"2106.10823","arxiv_id_is_arxiv":true,"paper":"/paper/3d-object-detection-for-autonomous-driving-a","title":"3D Object Detection for Autonomous Driving: A Survey","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui-qian/SoTA-3D-Object-Detection","path":"code/flops_counter.py","file_url":"https://github.com/rui-qian/SoTA-3D-Object-Detection/blob/HEAD/code/flops_counter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rui-qian/SoTA-3D-Object-Detection when it was checked","code_sha256":"e2eb2d4419f4bef5","code_sha256_prefix":"e2eb2d4419f4bef5","mcp_get_code":{"code_sha256":"e2eb2d4419f4bef5"}},{"arxiv_id":"1902.08570","arxiv_id_is_arxiv":true,"paper":"/paper/particlenet-jet-tagging-via-particle-clouds","title":"ParticleNet: Jet Tagging via Particle Clouds","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hqucms/weaver-core","path":"weaver/utils/flops_counter.py","file_url":"https://github.com/hqucms/weaver-core/blob/HEAD/weaver/utils/flops_counter.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":"abf919ccaf86558d","code_sha256_prefix":"abf919ccaf86558d","mcp_get_code":{"code_sha256":"abf919ccaf86558d"}},{"arxiv_id":"aaai_28394","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28394","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"iam-nacl/DTMFormer","path":"utils/flops_counter.py","file_url":"https://github.com/iam-nacl/DTMFormer/blob/HEAD/utils/flops_counter.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":"03fe1448ec9d717b","code_sha256_prefix":"03fe1448ec9d717b","mcp_get_code":{"code_sha256":"03fe1448ec9d717b"}}],"record_sha256":"03e359daebe34c04aab0f9ed26970469bf23a7e6a0fd58f52cc811e8de13047d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}