{"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/transi-fusebn","entry":"transI_fusebn","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":2,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":1},"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":"2507.05108","paper":"/paper/reviving-cultural-heritage-a-novel-approach","title":"Reviving Cultural Heritage: A Novel Approach for Comprehensive Historical Document Restoration","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SCUT-DLVCLab/AutoHDR","path":"models/common.py","file_url":"https://github.com/SCUT-DLVCLab/AutoHDR/blob/HEAD/models/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2403.17749","paper":"/paper/multi-task-dense-prediction-via-mixture-of","title":"Multi-Task Dense Prediction via Mixture of Low-Rank Experts","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuqiyang213/mlore","path":"models/transformers/MLoRE_repara.py","file_url":"https://github.com/yuqiyang213/mlore/blob/HEAD/models/transformers/MLoRE_repara.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fbc3b0ecf5603a6a","mcp_get_code":{"code_sha256":"fbc3b0ecf5603a6a"}},{"arxiv_id":"2312.12470","paper":"/paper/rotated-multi-scale-interaction-network-for","title":"Rotated Multi-Scale Interaction Network for Referring Remote Sensing Image Segmentation","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsan2401/rmsin","path":"lib/various_receptive.py","file_url":"https://github.com/lsan2401/rmsin/blob/HEAD/lib/various_receptive.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2207.02696","paper":"/paper/yolov7-trainable-bag-of-freebies-sets-new","title":"YOLOv7: Trainable bag-of-freebies sets new state-of-the-art for real-time object detectors","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadirnar/yolov7-pip","path":"yolov7/models/common.py","file_url":"https://github.com/kadirnar/yolov7-pip/blob/HEAD/yolov7/models/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2206.14651","paper":"/paper/bot-sort-robust-associations-multi-pedestrian","title":"BoT-SORT: Robust Associations Multi-Pedestrian Tracking","date":"2022-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niraharon/bot-sort","path":"yolov7/models/common.py","file_url":"https://github.com/niraharon/bot-sort/blob/HEAD/yolov7/models/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2204.00826","paper":"/paper/online-convolutional-re-parameterization","title":"Online Convolutional Re-parameterization","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JUGGHM/OREPA_CVPR2022","path":"dbb_transforms.py","file_url":"https://github.com/JUGGHM/OREPA_CVPR2022/blob/HEAD/dbb_transforms.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":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2109.03508","paper":"/paper/repnas-searching-for-efficient-re","title":"RepNAS: Searching for Efficient Re-parameterizing Blocks","date":"2021-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bestfleer/RepNAS","path":"cnn/ddb_transforms.py","file_url":"https://github.com/bestfleer/RepNAS/blob/HEAD/cnn/ddb_transforms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"079d0a85a0bfbb47","mcp_get_code":{"code_sha256":"079d0a85a0bfbb47"}},{"arxiv_id":"2103.13425","paper":"/paper/diverse-branch-block-building-a-convolution","title":"Diverse Branch Block: Building a Convolution as an Inception-like Unit","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hunto/image_classification_sota","path":"lib/models/utils/dbb/dbb_block.py","file_url":"https://github.com/hunto/image_classification_sota/blob/HEAD/lib/models/utils/dbb/dbb_block.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e28e80243880eb6f","mcp_get_code":{"code_sha256":"e28e80243880eb6f"}}]}