{"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-bn","entry":"get_bn","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"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":4,"ran_fixture":0,"ran":3,"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":"2502.20087","arxiv_id_is_arxiv":true,"paper":"/paper/overlock-an-overview-first-look-closely-next","title":"OverLoCK: An Overview-first-Look-Closely-next ConvNet with Context-Mixing Dynamic Kernels","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmmmeng/overlock","path":"models/overlock.py","file_url":"https://github.com/lmmmeng/overlock/blob/HEAD/models/overlock.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":"d977b7ab30c244f2","code_sha256_prefix":"d977b7ab30c244f2","mcp_get_code":{"code_sha256":"d977b7ab30c244f2"}},{"arxiv_id":"2407.08972","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-the-dark-secrets-of-extremely-large","title":"Revealing the Dark Secrets of Extremely Large Kernel ConvNets on Robustness","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lauch1ng/lkrobust","path":"adversarial_attack/replknet.py","file_url":"https://github.com/lauch1ng/lkrobust/blob/HEAD/adversarial_attack/replknet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4613da968a83fc8","code_sha256_prefix":"b4613da968a83fc8","mcp_get_code":{"code_sha256":"b4613da968a83fc8"}},{"arxiv_id":"2311.15599","arxiv_id_is_arxiv":true,"paper":"/paper/unireplknet-a-universal-perception-large","title":"UniRepLKNet: A Universal Perception Large-Kernel ConvNet for Audio, Video, Point Cloud, Time-Series and Image Recognition","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ailab-cvc/unireplknet","path":"unireplknet.py","file_url":"https://github.com/ailab-cvc/unireplknet/blob/HEAD/unireplknet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a2e756528f23042","code_sha256_prefix":"9a2e756528f23042","mcp_get_code":{"code_sha256":"9a2e756528f23042"}},{"arxiv_id":"2305.19412","arxiv_id_is_arxiv":true,"paper":"/paper/are-large-kernels-better-teachers-than","title":"Are Large Kernels Better Teachers than Transformers for ConvNets?","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/SLaK","path":"models/SLaK.py","file_url":"https://github.com/VITA-Group/SLaK/blob/HEAD/models/SLaK.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, VITA-Group/SLaK, 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":"f08479c7f5776cb2","code_sha256_prefix":"f08479c7f5776cb2","mcp_get_code":{"code_sha256":"f08479c7f5776cb2"}},{"arxiv_id":"2304.02330","arxiv_id_is_arxiv":true,"paper":"/paper/smpconv-self-moving-point-representations-for","title":"SMPConv: Self-moving Point Representations for Continuous Convolution","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangnekim/SMPConv","path":"smp_imagenet/models/SMPConv.py","file_url":"https://github.com/sangnekim/SMPConv/blob/HEAD/smp_imagenet/models/SMPConv.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4613da968a83fc8","code_sha256_prefix":"b4613da968a83fc8","mcp_get_code":{"code_sha256":"b4613da968a83fc8"}},{"arxiv_id":"2209.01404","arxiv_id_is_arxiv":true,"paper":"/paper/towards-accurate-binary-neural-networks-via","title":"Towards Accurate Binary Neural Networks via Modeling Contextual Dependencies","date":"2022-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sense-GVT/BCDNet","path":"prototype/model/a_3.py","file_url":"https://github.com/Sense-GVT/BCDNet/blob/HEAD/prototype/model/a_3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Sense-GVT/BCDNet when it was checked","code_sha256":"8a98753263fba59d","code_sha256_prefix":"8a98753263fba59d","mcp_get_code":{"code_sha256":"8a98753263fba59d"}},{"arxiv_id":"2207.08220","arxiv_id_is_arxiv":true,"paper":"/paper/fast-moco-boost-momentum-based-contrastive","title":"Fast-MoCo: Boost Momentum-based Contrastive Learning with Combinatorial Patches","date":"2022-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orashi/fast-moco","path":"core/utils/fastmoco_builder.py","file_url":"https://github.com/orashi/fast-moco/blob/HEAD/core/utils/fastmoco_builder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, orashi/fast-moco when it was checked","code_sha256":"faa005ca2bf466c8","code_sha256_prefix":"faa005ca2bf466c8","mcp_get_code":{"code_sha256":"faa005ca2bf466c8"}},{"arxiv_id":"2203.06717","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-up-your-kernels-to-31x31-revisiting","title":"Scaling Up Your Kernels to 31x31: Revisiting Large Kernel Design in CNNs","date":"2022-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingXiaoH/RepLKNet-pytorch","path":"replknet.py","file_url":"https://github.com/DingXiaoH/RepLKNet-pytorch/blob/HEAD/replknet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4613da968a83fc8","code_sha256_prefix":"b4613da968a83fc8","mcp_get_code":{"code_sha256":"b4613da968a83fc8"}},{"arxiv_id":"1807.10029","arxiv_id_is_arxiv":true,"paper":"/paper/lq-nets-learned-quantization-for-highly","title":"LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networks","date":"2018-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/LQ-Nets","path":"resnet_model.py","file_url":"https://github.com/Microsoft/LQ-Nets/blob/HEAD/resnet_model.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":"2847dfb0cae3736c","code_sha256_prefix":"2847dfb0cae3736c","mcp_get_code":{"code_sha256":"2847dfb0cae3736c"}},{"arxiv_id":"Li_ShiftwiseConv_Small_Convolutional_Kernel_with_Large_Kernel_Effect_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_ShiftwiseConv_Small_Convolutional_Kernel_with_Large_Kernel_Effect_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lidc54/shift-wiseConv","path":"models/SLaK.py","file_url":"https://github.com/lidc54/shift-wiseConv/blob/HEAD/models/SLaK.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, lidc54/shift-wiseConv, 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":"f08479c7f5776cb2","code_sha256_prefix":"f08479c7f5776cb2","mcp_get_code":{"code_sha256":"f08479c7f5776cb2"}}],"record_sha256":"3e69a3cbab3e4f3b5ba1551ec5a72bb2a5684a297f2c57c4f84aa10e5e53f4af","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}