{"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/get-batch","entry":"get_batch","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":82,"n_papers_ran":40,"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":69,"n_samples_ran":30,"n_samples_fingerprinted":4,"n_places":105,"n_places_pointer_only":38,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":9,"ran":14,"unverified":39},"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.27035","paper":"/paper/arxiv-2608-27035","title":"Representing and Parsing Korean Constituency Structure at Different Levels of Granularity *","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"stanfordnlp/stanza","path":"stanza/models/charlm.py","file_url":"https://github.com/stanfordnlp/stanza/blob/HEAD/stanza/models/charlm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"380cf031e8cd6eec","mcp_get_code":{"code_sha256":"380cf031e8cd6eec"}},{"arxiv_id":"2605.18903","paper":"/paper/arxiv-2605-18903","title":"Reasoning Portability: Guiding Continual Learning for MLLMs in the RLVR Era","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"lluosi/RDB-CL","path":"ETrain/Models/Qwen/qwen_generation_utils.py","file_url":"https://github.com/lluosi/RDB-CL/blob/HEAD/ETrain/Models/Qwen/qwen_generation_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d2c4545e71293dec","mcp_get_code":{"code_sha256":"d2c4545e71293dec"}},{"arxiv_id":"2605.06665","paper":"/paper/arxiv-2605-06665","title":"UniPool: A Globally Shared Expert Pool for Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Centaurus-Alpha/UniPool","path":"pretrain_vision_classify.py","file_url":"https://github.com/Centaurus-Alpha/UniPool/blob/HEAD/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2605.06665","paper":"/paper/arxiv-2605-06665","title":"UniPool: A Globally Shared Expert Pool for Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Centaurus-Alpha/UniPool","path":"pretrain_vision_dino.py","file_url":"https://github.com/Centaurus-Alpha/UniPool/blob/HEAD/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2605.06665","paper":"/paper/arxiv-2605-06665","title":"UniPool: A Globally Shared Expert Pool for Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Centaurus-Alpha/UniPool","path":"pretrain_vision_inpaint.py","file_url":"https://github.com/Centaurus-Alpha/UniPool/blob/HEAD/pretrain_vision_inpaint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2602.21788","paper":"/paper/arxiv-2602-21788","title":"Efficient Scaling of LLM Training with Flexible Context Parallelism","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ivanniu/FCP","path":"pretrain_transformers.py","file_url":"https://github.com/ivanniu/FCP/blob/HEAD/pretrain_transformers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d2504a551125090","mcp_get_code":{"code_sha256":"6d2504a551125090"}},{"arxiv_id":"2602.17080","paper":"/paper/arxiv-2602-17080","title":"Adam Improves Muon Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"minxin-zhg/namo","path":"src/nanogpt/train_save.py","file_url":"https://github.com/minxin-zhg/namo/blob/HEAD/src/nanogpt/train_save.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99dce1e215c51cd5","mcp_get_code":{"code_sha256":"99dce1e215c51cd5"}},{"arxiv_id":"2602.10441","paper":"/paper/arxiv-2602-10441","title":"LakeMLB: Data Lake Machine Learning Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"zhengwang100/LakeMLB","path":"codes/baseline/utils.py","file_url":"https://github.com/zhengwang100/LakeMLB/blob/HEAD/codes/baseline/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e1bb238ede2a6597","mcp_get_code":{"code_sha256":"e1bb238ede2a6597"}},{"arxiv_id":"2602.03359","paper":"/paper/arxiv-2602-03359","title":"MeKi: Memory-based Expert Knowledge Injection for Efficient LLM Scaling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ningding-o/MeKi","path":"Megatron-LM/pretrain_vision_classify.py","file_url":"https://github.com/ningding-o/MeKi/blob/HEAD/Megatron-LM/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2602.03359","paper":"/paper/arxiv-2602-03359","title":"MeKi: Memory-based Expert Knowledge Injection for Efficient LLM Scaling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ningding-o/MeKi","path":"Megatron-LM/pretrain_vision_dino.py","file_url":"https://github.com/ningding-o/MeKi/blob/HEAD/Megatron-LM/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2602.03359","paper":"/paper/arxiv-2602-03359","title":"MeKi: Memory-based Expert Knowledge Injection for Efficient LLM Scaling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ningding-o/MeKi","path":"Megatron-LM/pretrain_vision_inpaint.py","file_url":"https://github.com/ningding-o/MeKi/blob/HEAD/Megatron-LM/pretrain_vision_inpaint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2602.02016","paper":"/paper/arxiv-2602-02016","title":"DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"IST-DASLab/DASH","path":"src/optim/utils.py","file_url":"https://github.com/IST-DASLab/DASH/blob/HEAD/src/optim/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9dc20d4ad58a5f9","mcp_get_code":{"code_sha256":"f9dc20d4ad58a5f9"}},{"arxiv_id":"2601.14327","paper":"/paper/arxiv-2601-14327","title":"Yuan3.0 Ultra: A Trillion-Parameter Enterprise-Oriented MoE LLM","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Yuan-lab-LLM/Yuan3.0-Ultra","path":"rlhf/megatron-lm/pretrain_vision_classify.py","file_url":"https://github.com/Yuan-lab-LLM/Yuan3.0-Ultra/blob/HEAD/rlhf/megatron-lm/pretrain_vision_classify.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":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2601.14327","paper":"/paper/arxiv-2601-14327","title":"Yuan3.0 Ultra: A Trillion-Parameter Enterprise-Oriented MoE LLM","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Yuan-lab-LLM/Yuan3.0-Ultra","path":"rlhf/megatron-lm/pretrain_vision_dino.py","file_url":"https://github.com/Yuan-lab-LLM/Yuan3.0-Ultra/blob/HEAD/rlhf/megatron-lm/pretrain_vision_dino.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":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2601.14327","paper":"/paper/arxiv-2601-14327","title":"Yuan3.0 Ultra: A Trillion-Parameter Enterprise-Oriented MoE LLM","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Yuan-lab-LLM/Yuan3.0-Ultra","path":"rlhf/megatron-lm/pretrain_vision_inpaint.py","file_url":"https://github.com/Yuan-lab-LLM/Yuan3.0-Ultra/blob/HEAD/rlhf/megatron-lm/pretrain_vision_inpaint.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":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2508.18672","paper":"/paper/arxiv-2508-18672","title":"Optimal Sparsity of Mixture-of-Experts Language Models for Reasoning Tasks","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"rioyokotalab/optimal-sparsity","path":"pre-training/pretrain_vision_classify.py","file_url":"https://github.com/rioyokotalab/optimal-sparsity/blob/HEAD/pre-training/pretrain_vision_classify.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":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2508.18672","paper":"/paper/arxiv-2508-18672","title":"Optimal Sparsity of Mixture-of-Experts Language Models for Reasoning Tasks","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"rioyokotalab/optimal-sparsity","path":"pre-training/pretrain_vision_dino.py","file_url":"https://github.com/rioyokotalab/optimal-sparsity/blob/HEAD/pre-training/pretrain_vision_dino.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":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2508.18672","paper":"/paper/arxiv-2508-18672","title":"Optimal Sparsity of Mixture-of-Experts Language Models for Reasoning Tasks","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"rioyokotalab/optimal-sparsity","path":"pre-training/pretrain_vision_inpaint.py","file_url":"https://github.com/rioyokotalab/optimal-sparsity/blob/HEAD/pre-training/pretrain_vision_inpaint.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":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2503.20287","paper":"/paper/insvie-1m-effective-instruction-based-video","title":"InsViE-1M: Effective Instruction-based Video Editing with Elaborate Dataset Construction","date":"2025-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"langmanbusi/insvie","path":"CogVideo/sat/sample_video.py","file_url":"https://github.com/langmanbusi/insvie/blob/HEAD/CogVideo/sat/sample_video.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f7e73ff9945218a","mcp_get_code":{"code_sha256":"4f7e73ff9945218a"}},{"arxiv_id":"2502.05179","paper":"/paper/flashvideo-flowing-fidelity-to-detail-for","title":"FlashVideo:Flowing Fidelity to Detail for Efficient High-Resolution Video Generation","date":"2025-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foundationvision/flashvideo","path":"flashvideo/utils.py","file_url":"https://github.com/foundationvision/flashvideo/blob/HEAD/flashvideo/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1bd867ae3eda28ff","mcp_get_code":{"code_sha256":"1bd867ae3eda28ff"}},{"arxiv_id":"2412.18597","paper":"/paper/ditctrl-exploring-attention-control-in-multi","title":"DiTCtrl: Exploring Attention Control in Multi-Modal Diffusion Transformer for Tuning-Free Multi-Prompt Longer Video Generation","date":"2024-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencentarc/ditctrl","path":"sat/sample_video.py","file_url":"https://github.com/tencentarc/ditctrl/blob/HEAD/sat/sample_video.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a886eb67973506d6","mcp_get_code":{"code_sha256":"a886eb67973506d6"}},{"arxiv_id":"2412.00733","paper":"/paper/hallo3-highly-dynamic-and-realistic-portrait","title":"Hallo3: Highly Dynamic and Realistic Portrait Image Animation with Video Diffusion Transformer","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-generative-vision/hallo3","path":"hallo3/sample_video.py","file_url":"https://github.com/fudan-generative-vision/hallo3/blob/HEAD/hallo3/sample_video.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f7e73ff9945218a","mcp_get_code":{"code_sha256":"4f7e73ff9945218a"}},{"arxiv_id":"2411.03884","paper":"/paper/polynomial-composition-activations-unleashing","title":"Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BryceZhuo/PolyCom","path":"dense_model/Megatron-LM-231007/pretrain_vision_classify.py","file_url":"https://github.com/BryceZhuo/PolyCom/blob/HEAD/dense_model/Megatron-LM-231007/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2411.03884","paper":"/paper/polynomial-composition-activations-unleashing","title":"Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brycezhuo/polycom","path":"dense_model/Megatron-LM-231007/pretrain_vision_dino.py","file_url":"https://github.com/brycezhuo/polycom/blob/HEAD/dense_model/Megatron-LM-231007/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2411.03884","paper":"/paper/polynomial-composition-activations-unleashing","title":"Polynomial Composition Activations: Unleashing the Dynamics of Large Language Models","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brycezhuo/polycom","path":"dense_model/Megatron-LM-231007/pretrain_vision_inpaint.py","file_url":"https://github.com/brycezhuo/polycom/blob/HEAD/dense_model/Megatron-LM-231007/pretrain_vision_inpaint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2410.24159","paper":"/paper/gpt-or-bert-why-not-both","title":"GPT or BERT: why not both?","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltgoslo/gpt-bert","path":"pretraining/train_100m.py","file_url":"https://github.com/ltgoslo/gpt-bert/blob/HEAD/pretraining/train_100m.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"53fa5c4b68859c0a","mcp_get_code":{"code_sha256":"53fa5c4b68859c0a"}},{"arxiv_id":"2408.13036","paper":"/paper/s4d-streaming-4d-real-world-reconstruction","title":"S4D: Streaming 4D Real-World Reconstruction with Gaussians and 3D Control Points","date":"2024-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hebing-sjtu/S4D","path":"utils/data_preprocess.py","file_url":"https://github.com/hebing-sjtu/S4D/blob/HEAD/utils/data_preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bd1c7a7663787d82","mcp_get_code":{"code_sha256":"bd1c7a7663787d82"}},{"arxiv_id":"2407.20299","paper":"/paper/dataset-distillation-for-offline","title":"Dataset Distillation for Offline Reinforcement Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggflow123/ddrl","path":"src/data_distillation_training_offline.py","file_url":"https://github.com/ggflow123/ddrl/blob/HEAD/src/data_distillation_training_offline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"12a6de047472cde7","mcp_get_code":{"code_sha256":"12a6de047472cde7"}},{"arxiv_id":"2406.15333","paper":"/paper/geolrm-geometry-aware-large-reconstruction","title":"GeoLRM: Geometry-Aware Large Reconstruction Model for High-Quality 3D Gaussian Generation","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-yuanjing-aigclab/geolrm","path":"sv3d_video_sample.py","file_url":"https://github.com/alibaba-yuanjing-aigclab/geolrm/blob/HEAD/sv3d_video_sample.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":"e4065e60cb9a25bc","mcp_get_code":{"code_sha256":"e4065e60cb9a25bc"}},{"arxiv_id":"2406.13236","paper":"/paper/data-contamination-can-cross-language","title":"Data Contamination Can Cross Language Barriers","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangDataLab/Deep-Contam","path":"translate/run_translation_arc.py","file_url":"https://github.com/ShangDataLab/Deep-Contam/blob/HEAD/translate/run_translation_arc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd20b28fac374fd9","mcp_get_code":{"code_sha256":"cd20b28fac374fd9"}},{"arxiv_id":"2406.13236","paper":"/paper/data-contamination-can-cross-language","title":"Data Contamination Can Cross Language Barriers","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShangDataLab/Deep-Contam","path":"translate/run_translation_mmlu.py","file_url":"https://github.com/ShangDataLab/Deep-Contam/blob/HEAD/translate/run_translation_mmlu.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24ab0391730d3865","mcp_get_code":{"code_sha256":"24ab0391730d3865"}},{"arxiv_id":"2406.10354","paper":"/paper/sigdiffusions-score-based-diffusion-models","title":"SigDiffusions: Score-Based Diffusion Models for Long Time Series via Log-Signature Embeddings","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lim0606/ddo","path":"lib/models/contconv.py","file_url":"https://github.com/lim0606/ddo/blob/HEAD/lib/models/contconv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63c721392992855f","mcp_get_code":{"code_sha256":"63c721392992855f"}},{"arxiv_id":"2406.10209","paper":"/paper/be-like-a-goldfish-don-t-memorize-mitigating","title":"Be like a Goldfish, Don't Memorize! Mitigating Memorization in Generative LLMs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahans30/goldfish-loss","path":"eval/eval_retrieval_anticausal.py","file_url":"https://github.com/ahans30/goldfish-loss/blob/HEAD/eval/eval_retrieval_anticausal.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":"41418f480eb09bbc","mcp_get_code":{"code_sha256":"41418f480eb09bbc"}},{"arxiv_id":"2405.18392","paper":"/paper/scaling-laws-and-compute-optimal-training","title":"Scaling Laws and Compute-Optimal Training Beyond Fixed Training Durations","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/schedules-and-scaling","path":"src/optim/utils.py","file_url":"https://github.com/epfml/schedules-and-scaling/blob/HEAD/src/optim/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9dc20d4ad58a5f9","mcp_get_code":{"code_sha256":"f9dc20d4ad58a5f9"}},{"arxiv_id":"2405.17976","paper":"/paper/yuan-2-0-m32-mixture-of-experts-with","title":"Yuan 2.0-M32: Mixture of Experts with Attention Router","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ieit-yuan/yuan2.0-m32","path":"pretrain_vision_classify.py","file_url":"https://github.com/ieit-yuan/yuan2.0-m32/blob/HEAD/pretrain_vision_classify.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":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2405.17976","paper":"/paper/yuan-2-0-m32-mixture-of-experts-with","title":"Yuan 2.0-M32: Mixture of Experts with Attention Router","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ieit-yuan/yuan2.0-m32","path":"pretrain_vision_dino.py","file_url":"https://github.com/ieit-yuan/yuan2.0-m32/blob/HEAD/pretrain_vision_dino.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":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2405.17976","paper":"/paper/yuan-2-0-m32-mixture-of-experts-with","title":"Yuan 2.0-M32: Mixture of Experts with Attention Router","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ieit-yuan/yuan2.0-m32","path":"pretrain_vision_inpaint.py","file_url":"https://github.com/ieit-yuan/yuan2.0-m32/blob/HEAD/pretrain_vision_inpaint.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":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2405.16947","paper":"/paper/zero-shot-video-semantic-segmentation-based","title":"Zero-Shot Video Semantic Segmentation based on Pre-Trained Diffusion Models","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QianWangX/VidSeg_diffusion","path":"scripts/sampling/sd_pipeline_vspw.py","file_url":"https://github.com/QianWangX/VidSeg_diffusion/blob/HEAD/scripts/sampling/sd_pipeline_vspw.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b680bef04344d3d","mcp_get_code":{"code_sha256":"1b680bef04344d3d"}},{"arxiv_id":"2405.16947","paper":"/paper/zero-shot-video-semantic-segmentation-based","title":"Zero-Shot Video Semantic Segmentation based on Pre-Trained Diffusion Models","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QianWangX/VidSeg_diffusion","path":"scripts/sampling/svd_pipeline_vspw.py","file_url":"https://github.com/QianWangX/VidSeg_diffusion/blob/HEAD/scripts/sampling/svd_pipeline_vspw.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b9d2aae214a5f4b","mcp_get_code":{"code_sha256":"7b9d2aae214a5f4b"}},{"arxiv_id":"2404.02148","paper":"/paper/diffusion-2-dynamic-3d-content-generation-via","title":"Diffusion$^2$: Dynamic 3D Content Generation via Score Composition of Video and Multi-view Diffusion Models","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fudan-zvg/diffusion-square","path":"sgm/inference/helpers.py","file_url":"https://github.com/fudan-zvg/diffusion-square/blob/HEAD/sgm/inference/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c52b1e32cdda91f9","mcp_get_code":{"code_sha256":"c52b1e32cdda91f9"}},{"arxiv_id":"2403.11207","paper":"/paper/mindeye2-shared-subject-models-enable-fmri-to","title":"MindEye2: Shared-Subject Models Enable fMRI-To-Image With 1 Hour of Data","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"medarc-ai/mindeyev2","path":"src/generative_models/sgm/inference/helpers.py","file_url":"https://github.com/medarc-ai/mindeyev2/blob/HEAD/src/generative_models/sgm/inference/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c52b1e32cdda91f9","mcp_get_code":{"code_sha256":"c52b1e32cdda91f9"}},{"arxiv_id":"2403.09635","paper":"/paper/transformers-get-stable-an-end-to-end-signal","title":"Transformers Get Stable: An End-to-End Signal Propagation Theory for Language Models","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilkedia/tranformersgetstable","path":"DSLM_signal_propagation_figures/pretrain_vision_classify.py","file_url":"https://github.com/akhilkedia/tranformersgetstable/blob/HEAD/DSLM_signal_propagation_figures/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2403.09635","paper":"/paper/transformers-get-stable-an-end-to-end-signal","title":"Transformers Get Stable: An End-to-End Signal Propagation Theory for Language Models","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilkedia/tranformersgetstable","path":"DSLM_signal_propagation_figures/pretrain_vision_dino.py","file_url":"https://github.com/akhilkedia/tranformersgetstable/blob/HEAD/DSLM_signal_propagation_figures/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2403.09635","paper":"/paper/transformers-get-stable-an-end-to-end-signal","title":"Transformers Get Stable: An End-to-End Signal Propagation Theory for Language Models","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akhilkedia/tranformersgetstable","path":"DSLM_signal_propagation_figures/pretrain_vision_inpaint.py","file_url":"https://github.com/akhilkedia/tranformersgetstable/blob/HEAD/DSLM_signal_propagation_figures/pretrain_vision_inpaint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2403.18926","paper":"/paper/enhancing-efficiency-in-sparse-models-with","title":"XMoE: Sparse Models with Fine-grained and Adaptive Expert Selection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ysngki/xmoe","path":"MoE-Megatron-DeepSpeed/pretrain_vision_classify.py","file_url":"https://github.com/ysngki/xmoe/blob/HEAD/MoE-Megatron-DeepSpeed/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2403.18926","paper":"/paper/enhancing-efficiency-in-sparse-models-with","title":"XMoE: Sparse Models with Fine-grained and Adaptive Expert Selection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ysngki/xmoe","path":"MoE-Megatron-DeepSpeed/pretrain_vision_dino.py","file_url":"https://github.com/ysngki/xmoe/blob/HEAD/MoE-Megatron-DeepSpeed/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2403.18926","paper":"/paper/enhancing-efficiency-in-sparse-models-with","title":"XMoE: Sparse Models with Fine-grained and Adaptive Expert Selection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ysngki/xmoe","path":"MoE-Megatron-DeepSpeed/pretrain_vision_inpaint.py","file_url":"https://github.com/ysngki/xmoe/blob/HEAD/MoE-Megatron-DeepSpeed/pretrain_vision_inpaint.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"edf213e729a014e0","mcp_get_code":{"code_sha256":"edf213e729a014e0"}},{"arxiv_id":"2402.11928","paper":"/paper/separating-common-from-salient-patterns-with","title":"Separating common from salient patterns with Contrastive Representation Learning","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurospin-projects/2024_rlouiset_sep_clr","path":"celeba_accessories/create_dataset.py","file_url":"https://github.com/neurospin-projects/2024_rlouiset_sep_clr/blob/HEAD/celeba_accessories/create_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ceefbf03ad4b4c65","mcp_get_code":{"code_sha256":"ceefbf03ad4b4c65"}},{"arxiv_id":"2402.00667","paper":"/paper/improving-weak-to-strong-generalization-with","title":"Improving Weak-to-Strong Generalization with Scalable Oversight and Ensemble Learning","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adam-bjtu/w2sg","path":"src/icl-based-W2SG/qwen_generation_utils.py","file_url":"https://github.com/adam-bjtu/w2sg/blob/HEAD/src/icl-based-W2SG/qwen_generation_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d2c4545e71293dec","mcp_get_code":{"code_sha256":"d2c4545e71293dec"}},{"arxiv_id":"2312.04916","paper":"/paper/ee-llm-large-scale-training-and-inference-of","title":"EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pan-x-c/ee-llm","path":"pretrain_vision_classify.py","file_url":"https://github.com/pan-x-c/ee-llm/blob/HEAD/pretrain_vision_classify.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f4447581128a711","mcp_get_code":{"code_sha256":"1f4447581128a711"}},{"arxiv_id":"2312.04916","paper":"/paper/ee-llm-large-scale-training-and-inference-of","title":"EE-LLM: Large-Scale Training and Inference of Early-Exit Large Language Models with 3D Parallelism","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pan-x-c/ee-llm","path":"pretrain_vision_dino.py","file_url":"https://github.com/pan-x-c/ee-llm/blob/HEAD/pretrain_vision_dino.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"92287bdc91b8ac90","mcp_get_code":{"code_sha256":"92287bdc91b8ac90"}},{"arxiv_id":"2311.16922","paper":"/paper/mitigating-object-hallucinations-in-large","title":"Mitigating Object Hallucinations in Large Vision-Language Models through Visual Contrastive Decoding","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-nlp-sg/vcd","path":"experiments/Qwen_VL/qwen_generation_utils.py","file_url":"https://github.com/damo-nlp-sg/vcd/blob/HEAD/experiments/Qwen_VL/qwen_generation_utils.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":"d2c4545e71293dec","mcp_get_code":{"code_sha256":"d2c4545e71293dec"}},{"arxiv_id":"2310.08372","paper":"/paper/improving-factual-consistency-for-knowledge","title":"Improving Factual Consistency for Knowledge-Grounded Dialogue Systems via Knowledge Enhancement and Alignment","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amourwaltz/factdial","path":"codes/dial/data.py","file_url":"https://github.com/amourwaltz/factdial/blob/HEAD/codes/dial/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"86d1701b086e4ae2","mcp_get_code":{"code_sha256":"86d1701b086e4ae2"}},{"arxiv_id":"2310.01542","paper":"/paper/fusing-models-with-complementary-expertise","title":"Fusing Models with Complementary Expertise","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/foe-iclr2024","path":"lm_experiments/sentiment_analysis_model_embedding.py","file_url":"https://github.com/hwang595/foe-iclr2024/blob/HEAD/lm_experiments/sentiment_analysis_model_embedding.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b6367a0ffd423a7","mcp_get_code":{"code_sha256":"6b6367a0ffd423a7"}},{"arxiv_id":"2309.13944","paper":"/paper/provable-training-for-graph-contrastive-1","title":"Provable Training for Graph Contrastive Learning","date":"2023-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VoidHaruhi/POT-GCL","path":"COSTA/src/model/utils.py","file_url":"https://github.com/VoidHaruhi/POT-GCL/blob/HEAD/COSTA/src/model/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06aaec706bf52e17","mcp_get_code":{"code_sha256":"06aaec706bf52e17"}},{"arxiv_id":"2303.10158","paper":"/paper/data-centric-artificial-intelligence-a-survey","title":"Data-centric Artificial Intelligence: A Survey","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daochenzha/autoshard","path":"autoshard/training.py","file_url":"https://github.com/daochenzha/autoshard/blob/HEAD/autoshard/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d2de783847f9b48e","mcp_get_code":{"code_sha256":"d2de783847f9b48e"}},{"arxiv_id":"2302.08909","paper":"/paper/meta-album-multi-domain-meta-dataset-for-few-1","title":"Meta-Album: Multi-domain Meta-Dataset for Few-Shot Image Classification","date":"2023-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dustincarrion/cd-metadl","path":"baselines/finetuning/helpers_finetuning.py","file_url":"https://github.com/dustincarrion/cd-metadl/blob/HEAD/baselines/finetuning/helpers_finetuning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4cbf490dc725d7b0","mcp_get_code":{"code_sha256":"4cbf490dc725d7b0"}},{"arxiv_id":"2212.06096","paper":"/paper/implicit-convolutional-kernels-for-steerable-1","title":"Implicit Convolutional Kernels for Steerable CNNs","date":"2022-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxxxzdn/implicit-steerable-kernels","path":"utils/modelnet_utils.py","file_url":"https://github.com/maxxxzdn/implicit-steerable-kernels/blob/HEAD/utils/modelnet_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57b773e56ea4b02f","mcp_get_code":{"code_sha256":"57b773e56ea4b02f"}},{"arxiv_id":"2212.03281","paper":"/paper/copula-conformal-prediction-for-multi-step","title":"Copula Conformal Prediction for Multi-step Time Series Forecasting","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/copulacpts","path":"src/models/transformer.py","file_url":"https://github.com/rose-stl-lab/copulacpts/blob/HEAD/src/models/transformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"527d95ed5bba9874","mcp_get_code":{"code_sha256":"527d95ed5bba9874"}},{"arxiv_id":"2208.05924","paper":"/paper/regularizing-deep-neural-networks-with-1","title":"Regularizing Deep Neural Networks with Stochastic Estimators of Hessian Trace","date":"2022-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iclrsubmission1596/regularizing-deep-neural-networks-with-stochastic-estimators-of-hessian-trace","path":"WT2/wt2_lstm.py","file_url":"https://github.com/iclrsubmission1596/regularizing-deep-neural-networks-with-stochastic-estimators-of-hessian-trace/blob/HEAD/WT2/wt2_lstm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"71b00a6f0eb4b2b0","mcp_get_code":{"code_sha256":"71b00a6f0eb4b2b0"}},{"arxiv_id":"2205.05040","paper":"/paper/a-communication-efficient-distributed-3","title":"A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks","date":"2022-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingruiliu-ml-lab/communication-efficient-local-gradient-clipping","path":"nlp/main_lstm.py","file_url":"https://github.com/mingruiliu-ml-lab/communication-efficient-local-gradient-clipping/blob/HEAD/nlp/main_lstm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"2a0640f3091a0588","mcp_get_code":{"code_sha256":"2a0640f3091a0588"}},{"arxiv_id":"2203.06345","paper":"/paper/the-principle-of-diversity-training-stronger","title":"The Principle of Diversity: Training Stronger Vision Transformers Calls for Reducing All Levels of Redundancy","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/Diverse-ViT","path":"gradient_utils.py","file_url":"https://github.com/VITA-Group/Diverse-ViT/blob/HEAD/gradient_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c1e69f1ba76b4145","mcp_get_code":{"code_sha256":"c1e69f1ba76b4145"}},{"arxiv_id":"2202.06602","paper":"/paper/neural-re-ranking-in-multi-stage-recommender","title":"Neural Re-ranking in Multi-stage Recommender Systems: A Review","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"librerank-community/librerank","path":"librerank/utils.py","file_url":"https://github.com/librerank-community/librerank/blob/HEAD/librerank/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63e6041e478da028","mcp_get_code":{"code_sha256":"63e6041e478da028"}},{"arxiv_id":"2201.07281","paper":"/paper/annotating-the-tweebank-corpus-on-named","title":"Annotating the Tweebank Corpus on Named Entity Recognition and Building NLP Models for Social Media Analysis","date":"2022-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"social-machines/tweebanknlp","path":"twitter-stanza/stanza/models/charlm.py","file_url":"https://github.com/social-machines/tweebanknlp/blob/HEAD/twitter-stanza/stanza/models/charlm.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":"380cf031e8cd6eec","mcp_get_code":{"code_sha256":"380cf031e8cd6eec"}},{"arxiv_id":"2111.06061","paper":"/paper/edge-cloud-polarization-and-collaboration-a","title":"Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luoxi-model/luoxi_models","path":"train_hub/model_execution_template.py","file_url":"https://github.com/luoxi-model/luoxi_models/blob/HEAD/train_hub/model_execution_template.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"cc4573ee793bb6d5","mcp_get_code":{"code_sha256":"cc4573ee793bb6d5"}},{"arxiv_id":"2106.00472","paper":"/paper/detecting-anomalies-in-semantic-segmentation","title":"Detecting Anomalies in Semantic Segmentation with Prototypes","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarioFontanel/PAnS","path":"dataset/utils.py","file_url":"https://github.com/DarioFontanel/PAnS/blob/HEAD/dataset/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8c4463396792237e","mcp_get_code":{"code_sha256":"8c4463396792237e"}},{"arxiv_id":"2105.13937","paper":"/paper/polygonal-unadjusted-langevin-algorithms","title":"Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fin-young/THEO_POULA","path":"train_lstm.py","file_url":"https://github.com/fin-young/THEO_POULA/blob/HEAD/train_lstm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ecea09f59d8500ab","mcp_get_code":{"code_sha256":"ecea09f59d8500ab"}},{"arxiv_id":"2102.08098","paper":"/paper/gradinit-learning-to-initialize-neural","title":"GradInit: Learning to Initialize Neural Networks for Stable and Efficient Training","date":"2021-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuchen03/gradinit","path":"gradinit_utils.py","file_url":"https://github.com/zhuchen03/gradinit/blob/HEAD/gradinit_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c1e69f1ba76b4145","mcp_get_code":{"code_sha256":"c1e69f1ba76b4145"}},{"arxiv_id":"2010.02986","paper":"/paper/compositional-demographic-word-embeddings","title":"Compositional Demographic Word Embeddings","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/awd-lstm-lm","path":"utils.py","file_url":"https://github.com/salesforce/awd-lstm-lm/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"6f3c8e0b36d76af7","mcp_get_code":{"code_sha256":"6f3c8e0b36d76af7"}},{"arxiv_id":"2010.02519","paper":"/paper/improved-analysis-of-clipping-algorithms-for","title":"Improved Analysis of Clipping Algorithms for Non-convex Optimization","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbh2047/clipping-algorithms","path":"main_lstm.py","file_url":"https://github.com/zbh2047/clipping-algorithms/blob/HEAD/main_lstm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f1095e1951238c8e","mcp_get_code":{"code_sha256":"f1095e1951238c8e"}},{"arxiv_id":"2010.00951","paper":"/paper/coupled-oscillatory-recurrent-neural-network","title":"Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependencies","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tk-rusch/coRNN","path":"adding/utils.py","file_url":"https://github.com/tk-rusch/coRNN/blob/HEAD/adding/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b6747f361a58a902","mcp_get_code":{"code_sha256":"b6747f361a58a902"}},{"arxiv_id":"2009.12829","paper":"/paper/domain-generalization-for-medical-imaging","title":"Domain Generalization for Medical Imaging Classification with Linear-Dependency Regularization","date":"2020-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyf0912/lddg","path":"train_lddg.py","file_url":"https://github.com/wyf0912/lddg/blob/HEAD/train_lddg.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d53a21921599718f","mcp_get_code":{"code_sha256":"d53a21921599718f"}},{"arxiv_id":"2001.05311","paper":"/paper/abcnet-an-attention-based-method-for-particle","title":"ABCNet: An attention-based method for particle tagging","date":null,"month_inferred_from_arxiv_id":"2020-01","title_source":"archive","repo":"ViniciusMikuni/ABCNet","path":"classification/evaluate.py","file_url":"https://github.com/ViniciusMikuni/ABCNet/blob/HEAD/classification/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eabb56867bde2f39","mcp_get_code":{"code_sha256":"eabb56867bde2f39"}},{"arxiv_id":"2001.05311","paper":"/paper/abcnet-an-attention-based-method-for-particle","title":"ABCNet: An attention-based method for particle tagging","date":null,"month_inferred_from_arxiv_id":"2020-01","title_source":"archive","repo":"ViniciusMikuni/ABCNet","path":"segmentation/evaluate.py","file_url":"https://github.com/ViniciusMikuni/ABCNet/blob/HEAD/segmentation/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4959dceeaa023f34","mcp_get_code":{"code_sha256":"4959dceeaa023f34"}},{"arxiv_id":"1912.08517","paper":"/paper/distributional-reinforcement-learning-for-1","title":"Distributional Reinforcement Learning for Energy-Based Sequential Models","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parshakova/GAMS-for-Data-Efficient-Learning","path":"cycle_r_plambda_pitheta.py","file_url":"https://github.com/parshakova/GAMS-for-Data-Efficient-Learning/blob/HEAD/cycle_r_plambda_pitheta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea56b3cd5fdd0135","mcp_get_code":{"code_sha256":"ea56b3cd5fdd0135"}},{"arxiv_id":"1910.05923","paper":"/paper/code-generation-as-a-dual-task-of-code","title":"Code Generation as a Dual Task of Code Summarization","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"code-gen/cgcs","path":"language_model/lm_train.py","file_url":"https://github.com/code-gen/cgcs/blob/HEAD/language_model/lm_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eea2e3f3d0c4b1c0","mcp_get_code":{"code_sha256":"eea2e3f3d0c4b1c0"}},{"arxiv_id":"1910.00643","paper":"/paper/slowmo-improving-communication-efficient","title":"SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuhuayu/dist-sign-momentum","path":"nanoGPT/train_ddp.py","file_url":"https://github.com/shuhuayu/dist-sign-momentum/blob/HEAD/nanoGPT/train_ddp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6531ba0f0e98d838","mcp_get_code":{"code_sha256":"6531ba0f0e98d838"}},{"arxiv_id":"1907.05545","paper":"/paper/the-dynamic-embedded-topic-model","title":"The Dynamic Embedded Topic Model","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adjidieng/DETM","path":"data.py","file_url":"https://github.com/adjidieng/DETM/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1863ef9eb725187","mcp_get_code":{"code_sha256":"d1863ef9eb725187"}},{"arxiv_id":"1907.04907","paper":"/paper/topic-modeling-in-embedding-spaces","title":"Topic Modeling in Embedding Spaces","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fumiyo0607/ETM","path":"data.py","file_url":"https://github.com/fumiyo0607/ETM/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"979dc555a8df7690","mcp_get_code":{"code_sha256":"979dc555a8df7690"}},{"arxiv_id":"1907.04907","paper":"/paper/topic-modeling-in-embedding-spaces","title":"Topic Modeling in Embedding Spaces","date":"2019-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lffloyd/embedded-topic-model","path":"embedded_topic_model/utils/data.py","file_url":"https://github.com/lffloyd/embedded-topic-model/blob/HEAD/embedded_topic_model/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d0bc25d4fe5b2259","mcp_get_code":{"code_sha256":"d0bc25d4fe5b2259"}},{"arxiv_id":"1905.11881","paper":"/paper/analysis-of-gradient-clipping-and-adaptive","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingzhaoZhang/why-clipping-accelerates","path":"utils.py","file_url":"https://github.com/JingzhaoZhang/why-clipping-accelerates/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"6f3c8e0b36d76af7","mcp_get_code":{"code_sha256":"6f3c8e0b36d76af7"}},{"arxiv_id":"1905.07473","paper":"/paper/adaptively-truncating-backpropagation-through","title":"Adaptively Truncating Backpropagation Through Time to Control Gradient Bias","date":"2019-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aicherc/adaptive_tbptt","path":"experiments/language_script.py","file_url":"https://github.com/aicherc/adaptive_tbptt/blob/HEAD/experiments/language_script.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"488b1c7ff2dceb72","mcp_get_code":{"code_sha256":"488b1c7ff2dceb72"}},{"arxiv_id":"1905.07473","paper":"/paper/adaptively-truncating-backpropagation-through","title":"Adaptively Truncating Backpropagation Through Time to Control Gradient Bias","date":"2019-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aicherc/adaptive_tbptt","path":"experiments/synth_script.py","file_url":"https://github.com/aicherc/adaptive_tbptt/blob/HEAD/experiments/synth_script.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b4a2dfd91c6a713c","mcp_get_code":{"code_sha256":"b4a2dfd91c6a713c"}},{"arxiv_id":"1904.09408","paper":"/paper/190409408","title":"Language Models with Transformers","date":"2019-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgraywang/gluon-nlp-1","path":"scripts/language_model/transformer_language_model.py","file_url":"https://github.com/cgraywang/gluon-nlp-1/blob/HEAD/scripts/language_model/transformer_language_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e66077340340871","mcp_get_code":{"code_sha256":"8e66077340340871"}},{"arxiv_id":"1902.04601","paper":"/paper/contrastive-variational-autoencoder-enhances","title":"Contrastive Variational Autoencoder Enhances Salient Features","date":"2019-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abidlabs/contrastive_vae","path":"helper.py","file_url":"https://github.com/abidlabs/contrastive_vae/blob/HEAD/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beee1bbd18d83411","mcp_get_code":{"code_sha256":"beee1bbd18d83411"}},{"arxiv_id":"1812.04948","paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yan-roo/FakeFace","path":"helper.py","file_url":"https://github.com/yan-roo/FakeFace/blob/HEAD/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beee1bbd18d83411","mcp_get_code":{"code_sha256":"beee1bbd18d83411"}},{"arxiv_id":"1810.09536","paper":"/paper/ordered-neurons-integrating-tree-structures","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","date":"2018-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IanTheColder/ONLSTM-analysis","path":"utils.py","file_url":"https://github.com/IanTheColder/ONLSTM-analysis/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"6f3c8e0b36d76af7","mcp_get_code":{"code_sha256":"6f3c8e0b36d76af7"}},{"arxiv_id":"1809.10636","paper":"/paper/conditional-wavegan","title":"Conditional WaveGAN","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acheketa/cwavegan","path":"gpu/loader.py","file_url":"https://github.com/acheketa/cwavegan/blob/HEAD/gpu/loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8dc0ff934de25eaa","mcp_get_code":{"code_sha256":"8dc0ff934de25eaa"}},{"arxiv_id":"1808.09029","paper":"/paper/pyramidal-recurrent-unit-for-language","title":"Pyramidal Recurrent Unit for Language Modeling","date":"2018-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sacmehta/PRU","path":"utils.py","file_url":"https://github.com/sacmehta/PRU/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be3874d8cf97dae0","mcp_get_code":{"code_sha256":"be3874d8cf97dae0"}},{"arxiv_id":"1806.01822","paper":"/paper/relational-recurrent-neural-networks","title":"Relational recurrent neural networks","date":"2018-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"L0SG/relational-rnn-pytorch","path":"train_embeddings.py","file_url":"https://github.com/L0SG/relational-rnn-pytorch/blob/HEAD/train_embeddings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b52ce48393b9604b","mcp_get_code":{"code_sha256":"b52ce48393b9604b"}},{"arxiv_id":"1805.09190","paper":"/paper/towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bethgelab/AnalysisBySynthesis","path":"abs_models/utils.py","file_url":"https://github.com/bethgelab/AnalysisBySynthesis/blob/HEAD/abs_models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2a408b92ba2874cc","mcp_get_code":{"code_sha256":"2a408b92ba2874cc"}},{"arxiv_id":"1805.04623","paper":"/paper/sharp-nearby-fuzzy-far-away-how-neural","title":"Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"urvashik/lm-context-analysis","path":"utils.py","file_url":"https://github.com/urvashik/lm-context-analysis/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"be3874d8cf97dae0","mcp_get_code":{"code_sha256":"be3874d8cf97dae0"}},{"arxiv_id":"1803.09877","paper":"/paper/draco-byzantine-resilient-distributed","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/Draco","path":"src/datasets/utils.py","file_url":"https://github.com/hwang595/Draco/blob/HEAD/src/datasets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d5ef5fcb7374c455","mcp_get_code":{"code_sha256":"d5ef5fcb7374c455"}},{"arxiv_id":"1803.08240","paper":"/paper/an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SachinIchake/KALM","path":"utils.py","file_url":"https://github.com/SachinIchake/KALM/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"6f3c8e0b36d76af7","mcp_get_code":{"code_sha256":"6f3c8e0b36d76af7"}},{"arxiv_id":"1803.07055","paper":"/paper/simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kayuksel/pytorch-ars","path":"ars_dataparallel.py","file_url":"https://github.com/kayuksel/pytorch-ars/blob/HEAD/ars_dataparallel.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"bd8890576c4c1b92","mcp_get_code":{"code_sha256":"bd8890576c4c1b92"}},{"arxiv_id":"1803.01271","paper":"/paper/an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linxi159/TCN","path":"TCN/lambada_language/utils.py","file_url":"https://github.com/linxi159/TCN/blob/HEAD/TCN/lambada_language/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"973c7496c149a273","mcp_get_code":{"code_sha256":"973c7496c149a273"}},{"arxiv_id":"1711.03953","paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zihangdai/mos","path":"utils.py","file_url":"https://github.com/zihangdai/mos/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8585e034505891c4","mcp_get_code":{"code_sha256":"8585e034505891c4"}},{"arxiv_id":"1711.03953","paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfreedomliTHU/mos-pytorch1.1","path":"utils.py","file_url":"https://github.com/yfreedomliTHU/mos-pytorch1.1/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"591c3d72452ed508","mcp_get_code":{"code_sha256":"591c3d72452ed508"}},{"arxiv_id":"1711.00614","paper":"/paper/a-multimodal-anomaly-detector-for-robot","title":"A Multimodal Anomaly Detector for Robot-Assisted Feeding Using an LSTM-based Variational Autoencoder","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chickenbestlover/RNN-Time-series-Anomaly-Detection","path":"1_train_predictor.py","file_url":"https://github.com/chickenbestlover/RNN-Time-series-Anomaly-Detection/blob/HEAD/1_train_predictor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"566787f11a729568","mcp_get_code":{"code_sha256":"566787f11a729568"}},{"arxiv_id":"1710.10916","paper":"/paper/stackgan-realistic-image-synthesis-with","title":"StackGAN++: Realistic Image Synthesis with Stacked Generative Adversarial Networks","date":"2017-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akanimax/T2F","path":"implementation/networks/InferSent/data.py","file_url":"https://github.com/akanimax/T2F/blob/HEAD/implementation/networks/InferSent/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f790d98a3d6af4e5","mcp_get_code":{"code_sha256":"f790d98a3d6af4e5"}},{"arxiv_id":"1710.02224","paper":"/paper/dilated-recurrent-neural-networks","title":"Dilated Recurrent Neural Networks","date":"2017-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zalandoresearch/pytorch-dilated-rnn","path":"lm.py","file_url":"https://github.com/zalandoresearch/pytorch-dilated-rnn/blob/HEAD/lm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e33987634b6a19bf","mcp_get_code":{"code_sha256":"e33987634b6a19bf"}},{"arxiv_id":"1706.02633","paper":"/paper/real-valued-medical-time-series-generation","title":"Real-valued (Medical) Time Series Generation with Recurrent Conditional GANs","date":"2017-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ratschlab/RGAN","path":"data_utils.py","file_url":"https://github.com/ratschlab/RGAN/blob/HEAD/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3c324f246767a21","mcp_get_code":{"code_sha256":"f3c324f246767a21"}},{"arxiv_id":"1705.09655","paper":"/paper/style-transfer-from-non-parallel-text-by","title":"Style Transfer from Non-Parallel Text by Cross-Alignment","date":"2017-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlahlaf/Text-Style-Transfer","path":"code/preprocess.py","file_url":"https://github.com/nlahlaf/Text-Style-Transfer/blob/HEAD/code/preprocess.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a1d74fe96cb4fd2","mcp_get_code":{"code_sha256":"6a1d74fe96cb4fd2"}},{"arxiv_id":"1607.00148","paper":"/paper/lstm-based-encoder-decoder-for-multi-sensor","title":"LSTM-based Encoder-Decoder for Multi-sensor Anomaly Detection","date":"2016-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"freedombenLiu/RNN-Time-series-Anomaly-Detection","path":"1_train_predictor.py","file_url":"https://github.com/freedombenLiu/RNN-Time-series-Anomaly-Detection/blob/HEAD/1_train_predictor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"566787f11a729568","mcp_get_code":{"code_sha256":"566787f11a729568"}},{"arxiv_id":"2023.findings-emnlp.228","paper":null,"title":"arXiv:2023.findings-emnlp.228","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"victor7246/TransJect","path":"language_modeling.py","file_url":"https://github.com/victor7246/TransJect/blob/HEAD/language_modeling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d382d9efd3ce1ea","mcp_get_code":{"code_sha256":"0d382d9efd3ce1ea"}}]}