{"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/train-batch","entry":"train_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":14,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":13},"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.02359","paper":"/paper/arxiv-2606-02359","title":"MOC: Multi-Order Communication in LLM-based Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"yao-guan/MOC","path":"experiments/common.py","file_url":"https://github.com/yao-guan/MOC/blob/HEAD/experiments/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"00049df0d16688c4","mcp_get_code":{"code_sha256":"00049df0d16688c4"}},{"arxiv_id":"2601.06429","paper":"/paper/arxiv-2601-06429","title":"A Unified Shape-Aware Foundation Model for Time Series Classification","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"qianlima-lab/UniShape","path":"unishape_pretrain.py","file_url":"https://github.com/qianlima-lab/UniShape/blob/HEAD/unishape_pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2eb58fc35287e225","mcp_get_code":{"code_sha256":"2eb58fc35287e225"}},{"arxiv_id":"2402.00397","paper":"/paper/multi-scale-traffic-pattern-bank-for-cross","title":"Multi-scale Traffic Pattern Bank for Cross-city Few-shot Traffic Forecasting","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyliu00/mtpb","path":"pretrain.py","file_url":"https://github.com/zhyliu00/mtpb/blob/HEAD/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"12c9df8e41b3d3e2","mcp_get_code":{"code_sha256":"12c9df8e41b3d3e2"}},{"arxiv_id":"2308.09727","paper":"/paper/cross-city-few-shot-traffic-forecasting-via","title":"Cross-city Few-Shot Traffic Forecasting via Traffic Pattern Bank","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyliu00/tpb","path":"pretrain.py","file_url":"https://github.com/zhyliu00/tpb/blob/HEAD/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73852ede1de684eb","mcp_get_code":{"code_sha256":"73852ede1de684eb"}},{"arxiv_id":"2302.12250","paper":"/paper/phase-diagram-of-training-dynamics-in-deep","title":"Phase diagram of early training dynamics in deep neural networks: effect of the learning rate, depth, and width","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dayal-kalra/early-training","path":"train_mse_utils.py","file_url":"https://github.com/dayal-kalra/early-training/blob/HEAD/train_mse_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"955d0ad1c977f429","mcp_get_code":{"code_sha256":"955d0ad1c977f429"}},{"arxiv_id":"2107.07432","paper":"/paper/hierarchical-graph-neural-nets-can-capture","title":"Hierarchical graph neural nets can capture long-range interactions","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rampasek/HGNet","path":"models/ops.py","file_url":"https://github.com/rampasek/HGNet/blob/HEAD/models/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2660b29da33c9d4c","mcp_get_code":{"code_sha256":"2660b29da33c9d4c"}},{"arxiv_id":"2006.13009","paper":"/paper/iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/IDGL","path":"src/core/model.py","file_url":"https://github.com/hugochan/IDGL/blob/HEAD/src/core/model.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":"11a56e75a1cddbe8","mcp_get_code":{"code_sha256":"11a56e75a1cddbe8"}},{"arxiv_id":"2004.06015","paper":"/paper/toward-subgraph-guided-knowledge-graph","title":"Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/Graph2Seq-for-KGQG","path":"src/core/model.py","file_url":"https://github.com/hugochan/Graph2Seq-for-KGQG/blob/HEAD/src/core/model.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":"3d4ba952a6f9e24c","mcp_get_code":{"code_sha256":"3d4ba952a6f9e24c"}},{"arxiv_id":"1911.12436","paper":"/paper/ar-net-a-simple-auto-regressive-neural","title":"AR-Net: A simple Auto-Regressive Neural Network for time-series","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ourownstory/AR-Net","path":"v0_1/training.py","file_url":"https://github.com/ourownstory/AR-Net/blob/HEAD/v0_1/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b90b111ca6a0d319","mcp_get_code":{"code_sha256":"b90b111ca6a0d319"}},{"arxiv_id":"1908.04942","paper":"/paper/reinforcement-learning-based-graph-to","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","date":"2019-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/RL-based-Graph2Seq-for-NQG","path":"src/core/model.py","file_url":"https://github.com/hugochan/RL-based-Graph2Seq-for-NQG/blob/HEAD/src/core/model.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":"38eb8ab78cd2933d","mcp_get_code":{"code_sha256":"38eb8ab78cd2933d"}},{"arxiv_id":"1904.00243","paper":"/paper/symmetry-based-disentangled-representation","title":"Symmetry-Based Disentangled Representation Learning requires Interaction with Environments","date":"2019-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Caselles/NeurIPS19-SBDRL","path":"code/reproduction_exp_CCI_VAE/01_train_vae.py","file_url":"https://github.com/Caselles/NeurIPS19-SBDRL/blob/HEAD/code/reproduction_exp_CCI_VAE/01_train_vae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c811211b32a7620","mcp_get_code":{"code_sha256":"5c811211b32a7620"}},{"arxiv_id":"1901.07441","paper":"/paper/padchest-a-large-chest-x-ray-image-dataset","title":"PadChest: A large chest x-ray image dataset with multi-label annotated reports","date":"2019-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajpurkarlab/chexzero","path":"run_train.py","file_url":"https://github.com/rajpurkarlab/chexzero/blob/HEAD/run_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8789fc3097e78c26","mcp_get_code":{"code_sha256":"8789fc3097e78c26"}},{"arxiv_id":"1808.09367","paper":"/paper/deriving-machine-attention-from-human","title":"Deriving Machine Attention from Human Rationales","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YujiaBao/R2A","path":"r2a/src/train_utils.py","file_url":"https://github.com/YujiaBao/R2A/blob/HEAD/r2a/src/train_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b64ec7d36879ff3b","mcp_get_code":{"code_sha256":"b64ec7d36879ff3b"}},{"arxiv_id":"1803.02999","paper":"/paper/on-first-order-meta-learning-algorithms","title":"On First-Order Meta-Learning Algorithms","date":"2018-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hfahrudin/reptile_implement_tf2","path":"Reptile.py","file_url":"https://github.com/hfahrudin/reptile_implement_tf2/blob/HEAD/Reptile.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ccf8109b819b534","mcp_get_code":{"code_sha256":"6ccf8109b819b534"}}]}