{"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/setup-distributed","entry":"setup_distributed","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":5,"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":"2608.10636","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10636","title":"DistilVDR: A Compact End-to-End Visual Document Retriever via Dual-Student Distillation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Ryenhails/NanoVDR","path":"nanovdr/train/engine.py","file_url":"https://github.com/Ryenhails/NanoVDR/blob/HEAD/nanovdr/train/engine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9dc0b2955340c00f","code_sha256_prefix":"9dc0b2955340c00f","mcp_get_code":{"code_sha256":"9dc0b2955340c00f"}},{"arxiv_id":"2606.29706","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29706","title":"ARMOR: Adaptive Retriever Optimization for Low-Resource Telecom Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"heshandevaka/ARMOR","path":"retriever_training/train_armor.py","file_url":"https://github.com/heshandevaka/ARMOR/blob/HEAD/retriever_training/train_armor.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":"6da8d76c33a470c1","code_sha256_prefix":"6da8d76c33a470c1","mcp_get_code":{"code_sha256":"6da8d76c33a470c1"}},{"arxiv_id":"2605.12825","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12825","title":"Orthrus: Memory-Efficient Parallel Token Generation via Dual-View Diffusion","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chiennv2000/orthrus","path":"src/utils/distributed.py","file_url":"https://github.com/chiennv2000/orthrus/blob/HEAD/src/utils/distributed.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f08b14105593e2f6","code_sha256_prefix":"f08b14105593e2f6","mcp_get_code":{"code_sha256":"f08b14105593e2f6"}},{"arxiv_id":"2410.13842","arxiv_id_is_arxiv":true,"paper":"/paper/d-fine-redefine-regression-task-in-detrs-as","title":"D-FINE: Redefine Regression Task in DETRs as Fine-grained Distribution Refinement","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Peterande/D-FINE","path":"src/misc/dist_utils.py","file_url":"https://github.com/Peterande/D-FINE/blob/HEAD/src/misc/dist_utils.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":"a65eab71a65df60e","code_sha256_prefix":"a65eab71a65df60e","mcp_get_code":{"code_sha256":"a65eab71a65df60e"}},{"arxiv_id":"2410.10777","arxiv_id_is_arxiv":true,"paper":"/paper/unimatch-v2-pushing-the-limit-of-semi","title":"UniMatch V2: Pushing the Limit of Semi-Supervised Semantic Segmentation","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiheYoung/UniMatch-V2","path":"util/dist_helper.py","file_url":"https://github.com/LiheYoung/UniMatch-V2/blob/HEAD/util/dist_helper.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":"7c60f8e4d3bbd46f","code_sha256_prefix":"7c60f8e4d3bbd46f","mcp_get_code":{"code_sha256":"7c60f8e4d3bbd46f"}},{"arxiv_id":"2409.19291","arxiv_id_is_arxiv":true,"paper":"/paper/clip-moe-towards-building-mixture-of-experts","title":"CLIP-MoE: Towards Building Mixture of Experts for CLIP with Diversified Multiplet Upcycling","date":"2024-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenSparseLLMs/CLIP-MoE","path":"train/train_moe.py","file_url":"https://github.com/OpenSparseLLMs/CLIP-MoE/blob/HEAD/train/train_moe.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, OpenSparseLLMs/CLIP-MoE when it was checked","code_sha256":"9e6bd6ee6006a98f","code_sha256_prefix":"9e6bd6ee6006a98f","mcp_get_code":{"code_sha256":"9e6bd6ee6006a98f"}},{"arxiv_id":"2405.20610","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-and-maximizing-temporal-knowledge","title":"Revisiting and Maximizing Temporal Knowledge in Semi-supervised Semantic Segmentation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wooseok-shin/PrevMatch","path":"util/dist_helper.py","file_url":"https://github.com/wooseok-shin/PrevMatch/blob/HEAD/util/dist_helper.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":"7c60f8e4d3bbd46f","code_sha256_prefix":"7c60f8e4d3bbd46f","mcp_get_code":{"code_sha256":"7c60f8e4d3bbd46f"}},{"arxiv_id":"2404.11003","arxiv_id_is_arxiv":true,"paper":"/paper/infomatch-entropy-neural-estimation-for-semi","title":"InfoMatch: Entropy Neural Estimation for Semi-Supervised Image Classification","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kunzhan/infomatch","path":"dist_helper.py","file_url":"https://github.com/kunzhan/infomatch/blob/HEAD/dist_helper.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, kunzhan/infomatch when it was checked","code_sha256":"ecf889acbcd26a3d","code_sha256_prefix":"ecf889acbcd26a3d","mcp_get_code":{"code_sha256":"ecf889acbcd26a3d"}},{"arxiv_id":"2312.03818","arxiv_id_is_arxiv":true,"paper":"/paper/alpha-clip-a-clip-model-focusing-on-wherever","title":"Alpha-CLIP: A CLIP Model Focusing on Wherever You Want","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunzey/alphaclip","path":"train/train/train_grit_1m.py","file_url":"https://github.com/sunzey/alphaclip/blob/HEAD/train/train/train_grit_1m.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1cbf9df54ea5261f","code_sha256_prefix":"1cbf9df54ea5261f","mcp_get_code":{"code_sha256":"1cbf9df54ea5261f"}},{"arxiv_id":"2208.09910","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-weak-to-strong-consistency-in-semi","title":"Revisiting Weak-to-Strong Consistency in Semi-Supervised Semantic Segmentation","date":"2022-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiheYoung/UniMatch","path":"util/dist_helper.py","file_url":"https://github.com/LiheYoung/UniMatch/blob/HEAD/util/dist_helper.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":"7c60f8e4d3bbd46f","code_sha256_prefix":"7c60f8e4d3bbd46f","mcp_get_code":{"code_sha256":"7c60f8e4d3bbd46f"}},{"arxiv_id":"2109.13296","arxiv_id_is_arxiv":true,"paper":"/paper/turingbench-a-benchmark-environment-for","title":"TURINGBENCH: A Benchmark Environment for Turing Test in the Age of Neural Text Generation","date":"2021-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amritabh/conda-gen-text-detection","path":"contrast_training_with_da.py","file_url":"https://github.com/amritabh/conda-gen-text-detection/blob/HEAD/contrast_training_with_da.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":"af0037745f819b07","code_sha256_prefix":"af0037745f819b07","mcp_get_code":{"code_sha256":"af0037745f819b07"}}],"record_sha256":"cee26c106e1e3426549e4b367d6647d2985cebc56ddad4c1f4ed3244e6452f83","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}