{"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/expert","entry":"Expert","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":7,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":7,"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":0,"ran_fixture":0,"ran":6,"unverified":1},"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":"2607.08780","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-08780","title":"Sticky Routing: Training MoE Models for Memory-Efficient Inference","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"alikayyam/sticky_moe","path":"model.py","file_url":"https://github.com/alikayyam/sticky_moe/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alikayyam/sticky_moe when it was checked","code_sha256":"83099ed4206ad6c6","code_sha256_prefix":"83099ed4206ad6c6","mcp_get_code":{"code_sha256":"83099ed4206ad6c6"}},{"arxiv_id":"2605.14200","arxiv_id_is_arxiv":true,"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":"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":"eb4439589ee0f401","code_sha256_prefix":"eb4439589ee0f401","mcp_get_code":{"code_sha256":"eb4439589ee0f401"}},{"arxiv_id":"2603.01526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01526","title":"Scalable Multi-Task Low-Rank Model Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"doem97/ICLR26_mtLoRA","path":"peft/tuners/mmoelora.py","file_url":"https://github.com/doem97/ICLR26_mtLoRA/blob/HEAD/peft/tuners/mmoelora.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, doem97/ICLR26_mtLoRA when it was checked","code_sha256":"ed21676126691b8d","code_sha256_prefix":"ed21676126691b8d","mcp_get_code":{"code_sha256":"ed21676126691b8d"}},{"arxiv_id":"2504.09906","arxiv_id_is_arxiv":true,"paper":"/paper/plasticity-aware-mixture-of-experts-for","title":"Plasticity-Aware Mixture of Experts for Learning Under QoE Shifts in Adaptive Video Streaming","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinyzqh/PA-MoE","path":"src/network/distill_moe/dmoe.py","file_url":"https://github.com/tinyzqh/PA-MoE/blob/HEAD/src/network/distill_moe/dmoe.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, tinyzqh/PA-MoE when it was checked","code_sha256":"dd29e84bab75a81d","code_sha256_prefix":"dd29e84bab75a81d","mcp_get_code":{"code_sha256":"dd29e84bab75a81d"}},{"arxiv_id":"2502.00619","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-aware-fairness-learning-in","title":"Distribution-aware Fairness Learning in Medical Image Segmentation From A Control-Theoretic Perspective","date":"2025-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tvseg/dmoe","path":"3d/dmoeunet.py","file_url":"https://github.com/tvseg/dmoe/blob/HEAD/3d/dmoeunet.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, tvseg/dmoe when it was checked","code_sha256":"bf2b5d552c512ea3","code_sha256_prefix":"bf2b5d552c512ea3","mcp_get_code":{"code_sha256":"bf2b5d552c512ea3"}},{"arxiv_id":"2402.03412","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e705ad33db3ece0","code_sha256_prefix":"8e705ad33db3ece0","mcp_get_code":{"code_sha256":"8e705ad33db3ece0"}},{"arxiv_id":"2304.05288","arxiv_id_is_arxiv":true,"paper":"/paper/task-difficulty-aware-parameter-allocation","title":"Task Difficulty Aware Parameter Allocation & Regularization for Lifelong Learning","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenjinw/par","path":"src/models/par_model.py","file_url":"https://github.com/wenjinw/par/blob/HEAD/src/models/par_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6463802a6fbf4411","code_sha256_prefix":"6463802a6fbf4411","mcp_get_code":{"code_sha256":"6463802a6fbf4411"}}],"record_sha256":"9d3084cdf35d6cce62ea303177bbf4a878ea8fd949faa9baa95804c66433778f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}