{"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/router","entry":"Router","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":11,"n_papers_ran":8,"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":11,"n_samples_ran":8,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"unverified":3},"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.21847","paper":"/paper/arxiv-2606-21847","title":"UniRank: Unified Rank Allocation for Low-Rank LLM Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"EIT-NLP/LLM-Pruning","path":"PruningInferSim/ops/router.py","file_url":"https://github.com/EIT-NLP/LLM-Pruning/blob/HEAD/PruningInferSim/ops/router.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce5e4ffd0fce680e","mcp_get_code":{"code_sha256":"ce5e4ffd0fce680e"}},{"arxiv_id":"2605.14200","paper":"/paper/arxiv-2605-14200","title":"How to Scale Mixture-of-Experts: From µP to the Maximally Scale-Stable Parameterization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vankadara-lab/mssp-moe","path":"transformer-moe-experiments/model.py","file_url":"https://github.com/vankadara-lab/mssp-moe/blob/HEAD/transformer-moe-experiments/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b19d401a089c2b4d","mcp_get_code":{"code_sha256":"b19d401a089c2b4d"}},{"arxiv_id":"2601.05106","paper":"/paper/arxiv-2601-05106","title":"Token-Level LLM Collaboration via FUSIONROUTE","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"xiongny/FusionRoute","path":"code/router.py","file_url":"https://github.com/xiongny/FusionRoute/blob/HEAD/code/router.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"adc6f7971050b794","mcp_get_code":{"code_sha256":"adc6f7971050b794"}},{"arxiv_id":"2509.02718","paper":"/paper/arxiv-2509-02718","title":"Efficient Training-Free Online Routing for High-Volume Multi-LLM Serving","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"fzwark/PORT","path":"algo.py","file_url":"https://github.com/fzwark/PORT/blob/HEAD/algo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"94356a9787ecac40","mcp_get_code":{"code_sha256":"94356a9787ecac40"}},{"arxiv_id":"2508.16861","paper":"/paper/arxiv-2508-16861","title":"Learning from Diverse Reasoning Paths with Routing and Collaboration","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"LzyFischer/Distill","path":"main_log_router.py","file_url":"https://github.com/LzyFischer/Distill/blob/HEAD/main_log_router.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b426b2773afbfd27","mcp_get_code":{"code_sha256":"b426b2773afbfd27"}},{"arxiv_id":"2505.18809","paper":"/paper/vorta-efficient-video-diffusion-via-routing","title":"VORTA: Efficient Video Diffusion via Routing Sparse Attention","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenhao728/vorta","path":"vorta/patch/router.py","file_url":"https://github.com/wenhao728/vorta/blob/HEAD/vorta/patch/router.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97af17c59be17390","mcp_get_code":{"code_sha256":"97af17c59be17390"}},{"arxiv_id":"2503.05156","paper":null,"title":"arXiv:2503.05156","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"qiujx0520/GOC_ICCV2025","path":"DiT/models/router_models.py","file_url":"https://github.com/qiujx0520/GOC_ICCV2025/blob/HEAD/DiT/models/router_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f2fda67ed277da26","mcp_get_code":{"code_sha256":"f2fda67ed277da26"}},{"arxiv_id":"2501.04765","paper":"/paper/tread-token-routing-for-efficient","title":"TREAD: Token Routing for Efficient Architecture-agnostic Diffusion Training","date":"2025-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"compvis/tread","path":"routing_module.py","file_url":"https://github.com/compvis/tread/blob/HEAD/routing_module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"7607f09d219ebb0b","mcp_get_code":{"code_sha256":"7607f09d219ebb0b"}},{"arxiv_id":"2407.06124","paper":"/paper/structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoGo175/diffuse-treevae","path":"models/model.py","file_url":"https://github.com/JoGo175/diffuse-treevae/blob/HEAD/models/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e7da12a102fed76","mcp_get_code":{"code_sha256":"7e7da12a102fed76"}},{"arxiv_id":"2402.03412","paper":"/paper/see-more-details-efficient-image-super","title":"See More Details: Efficient Image Super-Resolution by Experts Mining","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eduardzamfir/seemoredetails","path":"basicsr/archs/seemore_arch.py","file_url":"https://github.com/eduardzamfir/seemoredetails/blob/HEAD/basicsr/archs/seemore_arch.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":"f825feff5cc9f504","mcp_get_code":{"code_sha256":"f825feff5cc9f504"}},{"arxiv_id":"2004.13912","paper":"/paper/neural-additive-models-interpretable-machine","title":"Neural Additive Models: Interpretable Machine Learning with Neural Nets","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fortuinlab/la-nam","path":"src/laplace_skorch/modules.py","file_url":"https://github.com/fortuinlab/la-nam/blob/HEAD/src/laplace_skorch/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e7fc6cfe97a24f2","mcp_get_code":{"code_sha256":"9e7fc6cfe97a24f2"}}]}