{"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/seblock","entry":"SEBlock","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":14,"n_papers_ran":13,"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":16,"n_samples_ran":15,"n_samples_fingerprinted":6,"n_places":16,"n_places_pointer_only":9,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":14,"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":"2606.06682","paper":"/paper/arxiv-2606-06682","title":"Spatiotemporal Imputation with Graph-Informed Flow Matching","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"zepengzhang/GiFlow","path":"models/FlowMatching.py","file_url":"https://github.com/zepengzhang/GiFlow/blob/HEAD/models/FlowMatching.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8803b7443ed12af2","mcp_get_code":{"code_sha256":"8803b7443ed12af2"}},{"arxiv_id":"2602.23903","paper":"/paper/arxiv-2602-23903","title":"SegMate: Asymmetric Attention-Based Lightweight Architecture for Efficient Multi-Organ Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"andreibunea99/SegMate","path":"models/segmate_v2.py","file_url":"https://github.com/andreibunea99/SegMate/blob/HEAD/models/segmate_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"55b8e788e24d9164","mcp_get_code":{"code_sha256":"55b8e788e24d9164"}},{"arxiv_id":"2501.08885","paper":"/paper/feature-based-one-for-all-a-universal","title":"Feature-based One-For-All: A Universal Framework for Heterogeneous Knowledge Distillation","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmylin0979/PAT","path":"distillers/pat.py","file_url":"https://github.com/jimmylin0979/PAT/blob/HEAD/distillers/pat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0546ce0adeb02bde","mcp_get_code":{"code_sha256":"0546ce0adeb02bde"}},{"arxiv_id":"2309.05527","paper":"/paper/resimad-zero-shot-3d-domain-transfer-for","title":"ReSimAD: Zero-Shot 3D Domain Transfer for Autonomous Driving with Source Reconstruction and Target Simulation","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pjlab-adg/3dtrans","path":"pcdet/models/mdf_models/dense_cr.py","file_url":"https://github.com/pjlab-adg/3dtrans/blob/HEAD/pcdet/models/mdf_models/dense_cr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7914a53000be84d","mcp_get_code":{"code_sha256":"e7914a53000be84d"}},{"arxiv_id":"2303.15343","paper":"/paper/sigmoid-loss-for-language-image-pre-training","title":"Sigmoid Loss for Language Image Pre-Training","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-mobileclip","path":"mobileclip/clip.py","file_url":"https://github.com/apple/ml-mobileclip/blob/HEAD/mobileclip/clip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"49fac99e1f1a0270","mcp_get_code":{"code_sha256":"49fac99e1f1a0270"}},{"arxiv_id":"2212.02059","paper":"/paper/region-conditioned-orthogonal-3d-u-net-for","title":"Region-Conditioned Orthogonal 3D U-Net for Weather4Cast Competition","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonjeong1/22-neurips-competition-baseline","path":"models/baseline_UNET3D_bottleneck.py","file_url":"https://github.com/hyeonjeong1/22-neurips-competition-baseline/blob/HEAD/models/baseline_UNET3D_bottleneck.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"afee864821ac1744","mcp_get_code":{"code_sha256":"afee864821ac1744"}},{"arxiv_id":"2210.06373","paper":"/paper/learning-multi-resolution-functional-maps","title":"Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape Matching","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craigleili/attentivefmaps","path":"models/attnfmaps.py","file_url":"https://github.com/craigleili/attentivefmaps/blob/HEAD/models/attnfmaps.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd2179bafdb306a6","mcp_get_code":{"code_sha256":"fd2179bafdb306a6"}},{"arxiv_id":"2205.15242","paper":"/paper/re-parameterizing-your-optimizers-rather-than","title":"Re-parameterizing Your Optimizers rather than Architectures","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dingxiaoh/repoptimizers","path":"repoptimizer/repoptvgg_impl.py","file_url":"https://github.com/dingxiaoh/repoptimizers/blob/HEAD/repoptimizer/repoptvgg_impl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6f27f1009cbeacb","mcp_get_code":{"code_sha256":"d6f27f1009cbeacb"}},{"arxiv_id":"2111.01007","paper":"/paper/projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dome272/ProjectedGAN-pytorch","path":"projected_gan.py","file_url":"https://github.com/dome272/ProjectedGAN-pytorch/blob/HEAD/projected_gan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ee6dbc09a4b76ac","mcp_get_code":{"code_sha256":"3ee6dbc09a4b76ac"}},{"arxiv_id":"2104.00298","paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Klassikcat/project-NEXTLab-CNN-EfficientNet","path":"EfficientNet_codestates/model/model.py","file_url":"https://github.com/Klassikcat/project-NEXTLab-CNN-EfficientNet/blob/HEAD/EfficientNet_codestates/model/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"020b78c721a6198e","mcp_get_code":{"code_sha256":"020b78c721a6198e"}},{"arxiv_id":"2103.16385","paper":"/paper/graph-stacked-hourglass-networks-for-3d-human","title":"Graph Stacked Hourglass Networks for 3D Human Pose Estimation","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tamasino52/GraphSH","path":"models/graph_sh.py","file_url":"https://github.com/tamasino52/GraphSH/blob/HEAD/models/graph_sh.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e671e19a0d0fb6fc","mcp_get_code":{"code_sha256":"e671e19a0d0fb6fc"}},{"arxiv_id":"2101.10979","paper":"/paper/prototypical-pseudo-label-denoising-and","title":"Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation","date":"2021-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProDA","path":"models/adaptation_modelv2.py","file_url":"https://github.com/microsoft/ProDA/blob/HEAD/models/adaptation_modelv2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"332f8cc5d0d081e6","mcp_get_code":{"code_sha256":"332f8cc5d0d081e6"}},{"arxiv_id":"2101.03697","paper":"/paper/repvgg-making-vgg-style-convnets-great-again","title":"RepVGG: Making VGG-style ConvNets Great Again","date":"2021-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingXiaoH/RepVGG","path":"repvgg.py","file_url":"https://github.com/DingXiaoH/RepVGG/blob/HEAD/repvgg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7a720bff84e2e8d6","mcp_get_code":{"code_sha256":"7a720bff84e2e8d6"}},{"arxiv_id":"1905.11946","paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsing-cv/EfficientNet-tensorflow-eager","path":"model.py","file_url":"https://github.com/tsing-cv/EfficientNet-tensorflow-eager/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6356571ff908158d","mcp_get_code":{"code_sha256":"6356571ff908158d"}},{"arxiv_id":"1905.11946","paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BobMcDear/pytorch-efficientnet","path":"efficientnet.py","file_url":"https://github.com/BobMcDear/pytorch-efficientnet/blob/HEAD/efficientnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"90d110db1ebe4a9f","mcp_get_code":{"code_sha256":"90d110db1ebe4a9f"}},{"arxiv_id":"1905.11946","paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohitgr7/tvmodels","path":"tvmodels/models/blocks/effnet_blocks.py","file_url":"https://github.com/rohitgr7/tvmodels/blob/HEAD/tvmodels/models/blocks/effnet_blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4743aa1ff46fd656","mcp_get_code":{"code_sha256":"4743aa1ff46fd656"}}]}