{"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-layer-layer-wise","entry":"get_num_layer_layer_wise","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":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":2,"n_places":5,"n_places_pointer_only":2,"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":"2403.17409","arxiv_id_is_arxiv":true,"paper":"/paper/neural-clustering-based-visual-representation","title":"Neural Clustering based Visual Representation Learning","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guikunchen/fec","path":"detection/mmcv_custom/layer_decay_optimizer_constructor.py","file_url":"https://github.com/guikunchen/fec/blob/HEAD/detection/mmcv_custom/layer_decay_optimizer_constructor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa8d49041d9f8442","code_sha256_prefix":"aa8d49041d9f8442","mcp_get_code":{"code_sha256":"aa8d49041d9f8442"}},{"arxiv_id":"2403.05369","arxiv_id_is_arxiv":true,"paper":"/paper/frequency-adaptive-dilated-convolution-for","title":"Frequency-Adaptive Dilated Convolution for Semantic Segmentation","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ying-fu/FADC","path":"mmcv_custom/layer_decay_optimizer_constructor.py","file_url":"https://github.com/ying-fu/FADC/blob/HEAD/mmcv_custom/layer_decay_optimizer_constructor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac7655e965b76118","code_sha256_prefix":"ac7655e965b76118","mcp_get_code":{"code_sha256":"ac7655e965b76118"}},{"arxiv_id":"2312.10758","arxiv_id_is_arxiv":true,"paper":"/paper/sharpose-sparse-high-resolution","title":"SHaRPose: Sparse High-Resolution Representation for Human Pose Estimation","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anxq/sharpose","path":"mmcv_custom/layer_decay_optimizer_constructor.py","file_url":"https://github.com/anxq/sharpose/blob/HEAD/mmcv_custom/layer_decay_optimizer_constructor.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, anxq/sharpose when it was checked","code_sha256":"aa8d49041d9f8442","code_sha256_prefix":"aa8d49041d9f8442","mcp_get_code":{"code_sha256":"aa8d49041d9f8442"}},{"arxiv_id":"2302.06052","arxiv_id_is_arxiv":true,"paper":"/paper/cfnet-cascade-fusion-network-for-dense","title":"CEDNet: A Cascade Encoder-Decoder Network for Dense Prediction","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanggang001/cfnet","path":"ced-mmseg/mmcv_custom/layer_decay_optimizer_constructor.py","file_url":"https://github.com/zhanggang001/cfnet/blob/HEAD/ced-mmseg/mmcv_custom/layer_decay_optimizer_constructor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, zhanggang001/cfnet, 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":"aa8d49041d9f8442","code_sha256_prefix":"aa8d49041d9f8442","mcp_get_code":{"code_sha256":"aa8d49041d9f8442"}},{"arxiv_id":"2301.03580","arxiv_id_is_arxiv":true,"paper":"/paper/designing-bert-for-convolutional-networks","title":"Designing BERT for Convolutional Networks: Sparse and Hierarchical Masked Modeling","date":"2023-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyu-tian/spark","path":"downstream_mmdet/mmcv_custom/layer_decay_optimizer_constructor.py","file_url":"https://github.com/keyu-tian/spark/blob/HEAD/downstream_mmdet/mmcv_custom/layer_decay_optimizer_constructor.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":"aa8d49041d9f8442","code_sha256_prefix":"aa8d49041d9f8442","mcp_get_code":{"code_sha256":"aa8d49041d9f8442"}}],"record_sha256":"d062630cb5d6461a36609af96624cd80c5ac11297609669051293812267fc266","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}