{"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/split-tensor-along-last-dim","entry":"split_tensor_along_last_dim","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":12,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":10,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":13,"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":6,"ran_fixture":0,"ran":2,"unverified":0},"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":"2506.18841","arxiv_id_is_arxiv":true,"paper":"/paper/longwriter-zero-mastering-ultra-long-text","title":"LongWriter-Zero: Mastering Ultra-Long Text Generation via Reinforcement Learning","date":"2025-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/longwriter","path":"train/patch/modeling_chatglm.py","file_url":"https://github.com/thudm/longwriter/blob/HEAD/train/patch/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"2502.20766","arxiv_id_is_arxiv":true,"paper":"/paper/flexprefill-a-context-aware-sparse-attention","title":"FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inference","date":"2025-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/FlexPrefill","path":"flex_prefill/modules/glm/glm_self_attention_foward.py","file_url":"https://github.com/bytedance/FlexPrefill/blob/HEAD/flex_prefill/modules/glm/glm_self_attention_foward.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":"08b693a1068fa690","code_sha256_prefix":"08b693a1068fa690","mcp_get_code":{"code_sha256":"08b693a1068fa690"}},{"arxiv_id":"2410.03577","arxiv_id_is_arxiv":true,"paper":"/paper/look-twice-before-you-answer-memory-space","title":"Look Twice Before You Answer: Memory-Space Visual Retracing for Hallucination Mitigation in Multimodal Large Language Models","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1zhou-Wang/MemVR","path":"modeling/modeling_chatglm.py","file_url":"https://github.com/1zhou-Wang/MemVR/blob/HEAD/modeling/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"2408.10943","arxiv_id_is_arxiv":true,"paper":"/paper/sysbench-can-large-language-models-follow","title":"SysBench: Can Large Language Models Follow System Messages?","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-baichuan-mlsystemlab/sysbench","path":"attenscore/modeling_chatglm.py","file_url":"https://github.com/pku-baichuan-mlsystemlab/sysbench/blob/HEAD/attenscore/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, pku-baichuan-mlsystemlab/sysbench when it was checked","code_sha256":"ffda302a67750064","code_sha256_prefix":"ffda302a67750064","mcp_get_code":{"code_sha256":"ffda302a67750064"}},{"arxiv_id":"2406.11257","arxiv_id_is_arxiv":true,"paper":"/paper/excp-extreme-llm-checkpoint-compression-via","title":"ExCP: Extreme LLM Checkpoint Compression via Weight-Momentum Joint Shrinking","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaffey/excp","path":"LMtrainer/mpu/utils.py","file_url":"https://github.com/gaffey/excp/blob/HEAD/LMtrainer/mpu/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff0731adadbb3e8f","code_sha256_prefix":"ff0731adadbb3e8f","mcp_get_code":{"code_sha256":"ff0731adadbb3e8f"}},{"arxiv_id":"2405.14297","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-mixture-of-experts-an-auto-tuning","title":"Dynamic Mixture of Experts: An Auto-Tuning Approach for Efficient Transformer Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/dynmoe","path":"DeepSpeed-0.9.5/deepspeed/compression/basic_layer.py","file_url":"https://github.com/lins-lab/dynmoe/blob/HEAD/DeepSpeed-0.9.5/deepspeed/compression/basic_layer.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":"09c070245728e6e2","code_sha256_prefix":"09c070245728e6e2","mcp_get_code":{"code_sha256":"09c070245728e6e2"}},{"arxiv_id":"2404.15159","arxiv_id_is_arxiv":true,"paper":"/paper/mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mikecovlee/mLoRA","path":"mlora/models/modeling_chatglm.py","file_url":"https://github.com/mikecovlee/mLoRA/blob/HEAD/mlora/models/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9281708eb4cf9161","code_sha256_prefix":"9281708eb4cf9161","mcp_get_code":{"code_sha256":"9281708eb4cf9161"}},{"arxiv_id":"2402.11809","arxiv_id_is_arxiv":true,"paper":"/paper/generation-meets-verification-accelerating","title":"Generation Meets Verification: Accelerating Large Language Model Inference with Smart Parallel Auto-Correct Decoding","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cteant/space","path":"src/models/modeling_chatglm.py","file_url":"https://github.com/cteant/space/blob/HEAD/src/models/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"2401.18058","arxiv_id_is_arxiv":true,"paper":"/paper/longalign-a-recipe-for-long-context-alignment","title":"LongAlign: A Recipe for Long Context Alignment of Large Language Models","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/longalign","path":"modeling_chatglm.py","file_url":"https://github.com/thudm/longalign/blob/HEAD/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"2311.18445","arxiv_id_is_arxiv":true,"paper":"/paper/vtimellm-empower-llm-to-grasp-video-moments","title":"VTimeLLM: Empower LLM to Grasp Video Moments","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangb23/vtimellm","path":"vtimellm/model/chatglm/modeling_chatglm.py","file_url":"https://github.com/huangb23/vtimellm/blob/HEAD/vtimellm/model/chatglm/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, huangb23/vtimellm when it was checked","code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"2307.13528","arxiv_id_is_arxiv":true,"paper":"/paper/factool-factuality-detection-in-generative-ai","title":"FacTool: Factuality Detection in Generative AI -- A Tool Augmented Framework for Multi-Task and Multi-Domain Scenarios","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"freedomintelligence/sdak","path":"code/workers/modeling_chatglm.py","file_url":"https://github.com/freedomintelligence/sdak/blob/HEAD/code/workers/modeling_chatglm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7e378ee7899fbde","code_sha256_prefix":"d7e378ee7899fbde","mcp_get_code":{"code_sha256":"d7e378ee7899fbde"}},{"arxiv_id":"1909.08053","arxiv_id_is_arxiv":true,"paper":"/paper/megatron-lm-training-multi-billion-parameter","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","date":"2019-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/fairscale","path":"fairscale/nn/model_parallel/layers.py","file_url":"https://github.com/facebookresearch/fairscale/blob/HEAD/fairscale/nn/model_parallel/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/fairscale (NOASSERTION)","code_sha256":"787ffed12fc28a46","code_sha256_prefix":"787ffed12fc28a46","mcp_get_code":{"code_sha256":"787ffed12fc28a46"}},{"arxiv_id":"1909.08053","arxiv_id_is_arxiv":true,"paper":"/paper/megatron-lm-training-multi-billion-parameter","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","date":"2019-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qhduan/CPM-LM-TF2","path":"CPM-Generate/mpu/transformer.py","file_url":"https://github.com/qhduan/CPM-LM-TF2/blob/HEAD/CPM-Generate/mpu/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c7a00a98e71fad14","code_sha256_prefix":"c7a00a98e71fad14","mcp_get_code":{"code_sha256":"c7a00a98e71fad14"}}],"record_sha256":"4b9ffd11a534cabe0d518b1eb700df3c4b55c237603bafc35c646a24ebe21915","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}