{"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/convmodule","entry":"ConvModule","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":7,"n_papers_ran_no_instrument_failure":7,"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":8,"n_samples_constructed":5,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":6,"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":8,"unverified":2},"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":"2208.03792","arxiv_id_is_arxiv":true,"paper":"/paper/domain-randomization-enhanced-depth","title":"Domain Randomization-Enhanced Depth Simulation and Restoration for Perceiving and Grasping Specular and Transparent Objects","date":"2022-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-EPIC/DREDS","path":"CatePoseEstimation/networks/SwinDRNet.py","file_url":"https://github.com/PKU-EPIC/DREDS/blob/HEAD/CatePoseEstimation/networks/SwinDRNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, PKU-EPIC/DREDS when it was checked","code_sha256":"ab5f7ef9bdeef918","code_sha256_prefix":"ab5f7ef9bdeef918","mcp_get_code":{"code_sha256":"ab5f7ef9bdeef918"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"upskyy/Squeezeformer","path":"squeezeformer/model.py","file_url":"https://github.com/upskyy/Squeezeformer/blob/HEAD/squeezeformer/model.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":"a6e14d81239e64ad","code_sha256_prefix":"a6e14d81239e64ad","mcp_get_code":{"code_sha256":"a6e14d81239e64ad"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kssteven418/squeezeformer","path":"src/models/conformer_encoder.py","file_url":"https://github.com/kssteven418/squeezeformer/blob/HEAD/src/models/conformer_encoder.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":"c6e0c0f0739513ec","code_sha256_prefix":"c6e0c0f0739513ec","mcp_get_code":{"code_sha256":"c6e0c0f0739513ec"}},{"arxiv_id":"2204.02574","arxiv_id_is_arxiv":true,"paper":"/paper/focalclick-towards-practical-interactive","title":"FocalClick: Towards Practical Interactive Image Segmentation","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XavierCHEN34/ClickSEG","path":"isegm/model/is_hrnet_model.py","file_url":"https://github.com/XavierCHEN34/ClickSEG/blob/HEAD/isegm/model/is_hrnet_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"36ecf3e15546035e","code_sha256_prefix":"36ecf3e15546035e","mcp_get_code":{"code_sha256":"36ecf3e15546035e"}},{"arxiv_id":"2105.15203","arxiv_id_is_arxiv":true,"paper":"/paper/segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IMvision12/SegFormer-tf","path":"models/segformer.py","file_url":"https://github.com/IMvision12/SegFormer-tf/blob/HEAD/models/segformer.py","status":"ran","verification_level":1,"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, IMvision12/SegFormer-tf when it was checked","code_sha256":"985e0029300d8b09","code_sha256_prefix":"985e0029300d8b09","mcp_get_code":{"code_sha256":"985e0029300d8b09"}},{"arxiv_id":"2105.15203","arxiv_id_is_arxiv":true,"paper":"/paper/segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sithu31296/semantic-segmentation","path":"semseg/models/segformer.py","file_url":"https://github.com/sithu31296/semantic-segmentation/blob/HEAD/semseg/models/segformer.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":"8e948e9bc7b5fc17","code_sha256_prefix":"8e948e9bc7b5fc17","mcp_get_code":{"code_sha256":"8e948e9bc7b5fc17"}},{"arxiv_id":"2104.06403","arxiv_id_is_arxiv":true,"paper":"/paper/lite-hrnet-a-lightweight-high-resolution","title":"Lite-HRNet: A Lightweight High-Resolution Network","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viet-hoang-99/Lite_HRnet_vh","path":"lib/models/lite_hrnet.py","file_url":"https://github.com/viet-hoang-99/Lite_HRnet_vh/blob/HEAD/lib/models/lite_hrnet.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, viet-hoang-99/Lite_HRnet_vh when it was checked","code_sha256":"7f5303fab6ab6aa5","code_sha256_prefix":"7f5303fab6ab6aa5","mcp_get_code":{"code_sha256":"7f5303fab6ab6aa5"}},{"arxiv_id":"2103.13746","arxiv_id_is_arxiv":true,"paper":"/paper/video-instance-segmentation-with-a-propose","title":"Video Instance Segmentation with a Propose-Reduce Paradigm","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/proposereduce","path":"mmdet/models/prop_heads/seq_prop_head.py","file_url":"https://github.com/dvlab-research/proposereduce/blob/HEAD/mmdet/models/prop_heads/seq_prop_head.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, dvlab-research/proposereduce when it was checked","code_sha256":"e6747fc7f19f1968","code_sha256_prefix":"e6747fc7f19f1968","mcp_get_code":{"code_sha256":"e6747fc7f19f1968"}},{"arxiv_id":"1612.03144","arxiv_id_is_arxiv":true,"paper":"/paper/feature-pyramid-networks-for-object-detection","title":"Feature Pyramid Networks for Object Detection","date":"2016-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JaryHuang/awesome_SSD_FPN_GIoU","path":"model/neck/build_neck.py","file_url":"https://github.com/JaryHuang/awesome_SSD_FPN_GIoU/blob/HEAD/model/neck/build_neck.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, JaryHuang/awesome_SSD_FPN_GIoU when it was checked","code_sha256":"b05c3c290ce6a7be","code_sha256_prefix":"b05c3c290ce6a7be","mcp_get_code":{"code_sha256":"b05c3c290ce6a7be"}},{"arxiv_id":"1506.02640","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-look-once-unified-real-time-object","title":"You Only Look Once: Unified, Real-Time Object Detection","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nsoul97/yolov1_pytorch","path":"code/model.py","file_url":"https://github.com/nsoul97/yolov1_pytorch/blob/HEAD/code/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nsoul97/yolov1_pytorch when it was checked","code_sha256":"2390515679b99339","code_sha256_prefix":"2390515679b99339","mcp_get_code":{"code_sha256":"2390515679b99339"}}],"record_sha256":"4f5786500ab0c777e9c71611a5a57ad94eacee57740e43fcc8db6a34d058637b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}