{"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/allreduce","entry":"allreduce","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":12,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":4,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":3,"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":1,"unverified":3},"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":"2606.29326","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29326","title":"Gradient boosting with vector-valued leafs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"dmlc/xgboost","path":"python-package/xgboost/collective.py","file_url":"https://github.com/dmlc/xgboost/blob/HEAD/python-package/xgboost/collective.py","status":"unverified","verification_level":0,"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":"7a4cfe12cf611fc1","code_sha256_prefix":"7a4cfe12cf611fc1","mcp_get_code":{"code_sha256":"7a4cfe12cf611fc1"}},{"arxiv_id":"2601.07293","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-07293","title":"Inference-Time Scaling for Visual AutoRegressive modeling by Searching Representative Samples","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"WD7ang/VAR-Scaling","path":"VAR-main/dist.py","file_url":"https://github.com/WD7ang/VAR-Scaling/blob/HEAD/VAR-main/dist.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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2504.02949","arxiv_id_is_arxiv":true,"paper":"/paper/vargpt-v1-1-improve-visual-autoregressive","title":"VARGPT-v1.1: Improve Visual Autoregressive Large Unified Model via Iterative Instruction Tuning and Reinforcement Learning","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VARGPT-family/VARGPT","path":"vargpt_llava/var_model/dist.py","file_url":"https://github.com/VARGPT-family/VARGPT/blob/HEAD/vargpt_llava/var_model/dist.py","status":"unverified","verification_level":0,"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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2502.20313","arxiv_id_is_arxiv":true,"paper":"/paper/flexvar-flexible-visual-autoregressive","title":"FlexVAR: Flexible Visual Autoregressive Modeling without Residual Prediction","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaosiyu1999/FlexVAR","path":"dist.py","file_url":"https://github.com/jiaosiyu1999/FlexVAR/blob/HEAD/dist.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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2501.18993","arxiv_id_is_arxiv":true,"paper":"/paper/visual-autoregressive-modeling-for-image","title":"Visual Autoregressive Modeling for Image Super-Resolution","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qyp2000/varsr","path":"dist.py","file_url":"https://github.com/qyp2000/varsr/blob/HEAD/dist.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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2412.04431","arxiv_id_is_arxiv":true,"paper":"/paper/infinity-scaling-bitwise-autoregressive","title":"Infinity: Scaling Bitwise AutoRegressive Modeling for High-Resolution Image Synthesis","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FoundationVision/VAR","path":"dist.py","file_url":"https://github.com/FoundationVision/VAR/blob/HEAD/dist.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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2411.10433","arxiv_id_is_arxiv":true,"paper":"/paper/m-var-decoupled-scale-wise-autoregressive","title":"M-VAR: Decoupled Scale-wise Autoregressive Modeling for High-Quality Image Generation","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oliverrensu/mvar","path":"dist.py","file_url":"https://github.com/oliverrensu/mvar/blob/HEAD/dist.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, oliverrensu/mvar when it was checked","code_sha256":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2408.01181","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01181","title":"VAR-CLIP: Text-to-Image Generator with Visual Auto-Regressive Modeling","date":"2024-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daixiangzi/var-clip","path":"dist.py","file_url":"https://github.com/daixiangzi/var-clip/blob/HEAD/dist.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, daixiangzi/var-clip when it was checked","code_sha256":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2406.09750","arxiv_id_is_arxiv":true,"paper":"/paper/controlvar-exploring-controllable-visual","title":"ControlVAR: Exploring Controllable Visual Autoregressive Modeling","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lxa9867/ControlVAR","path":"dist.py","file_url":"https://github.com/lxa9867/ControlVAR/blob/HEAD/dist.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, lxa9867/ControlVAR when it was checked","code_sha256":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2404.02905","arxiv_id_is_arxiv":true,"paper":"/paper/visual-autoregressive-modeling-scalable-image","title":"Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Prediction","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EkaterinaXie/LiteVAR","path":"dist.py","file_url":"https://github.com/EkaterinaXie/LiteVAR/blob/HEAD/dist.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":"ff4c548fd07140d0","code_sha256_prefix":"ff4c548fd07140d0","mcp_get_code":{"code_sha256":"ff4c548fd07140d0"}},{"arxiv_id":"2312.01697","arxiv_id_is_arxiv":true,"paper":"/paper/hulk-a-universal-knowledge-translator-for","title":"Hulk: A Universal Knowledge Translator for Human-Centric Tasks","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/hulk","path":"core/distributed_utils.py","file_url":"https://github.com/opengvlab/hulk/blob/HEAD/core/distributed_utils.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":"ae5f2eed69658ac0","code_sha256_prefix":"ae5f2eed69658ac0","mcp_get_code":{"code_sha256":"ae5f2eed69658ac0"}},{"arxiv_id":"1603.02754","arxiv_id_is_arxiv":true,"paper":"/paper/xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"360jinrong/GBST","path":"gbst_package/gbst/rabit.py","file_url":"https://github.com/360jinrong/GBST/blob/HEAD/gbst_package/gbst/rabit.py","status":"unverified","verification_level":0,"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":"56d023d699f86812","code_sha256_prefix":"56d023d699f86812","mcp_get_code":{"code_sha256":"56d023d699f86812"}}],"record_sha256":"e01274cba26aedaea3d9e82955de4cf8923267c1586a45449ecc824de059b469","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}