{"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/run-training","entry":"run_training","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":6,"n_papers_ran":2,"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":7,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":5},"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":"2604.18293","paper":"/paper/arxiv-2604-18293","title":"An Existence Proof for Neural Language Models That Can Explain Garden-Path Effects via Surprisal","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"osekilab/RE-GPE","path":"src/reverse_engineering/train_all_valid_folds.py","file_url":"https://github.com/osekilab/RE-GPE/blob/HEAD/src/reverse_engineering/train_all_valid_folds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f9386d693a17e4e","mcp_get_code":{"code_sha256":"3f9386d693a17e4e"}},{"arxiv_id":"2604.18293","paper":"/paper/arxiv-2604-18293","title":"An Existence Proof for Neural Language Models That Can Explain Garden-Path Effects via Surprisal","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"osekilab/RE-GPE","path":"src/reverse_engineering/train_all_valid_folds_rc.py","file_url":"https://github.com/osekilab/RE-GPE/blob/HEAD/src/reverse_engineering/train_all_valid_folds_rc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"25776e2afd2a6335","mcp_get_code":{"code_sha256":"25776e2afd2a6335"}},{"arxiv_id":"2602.18502","paper":"/paper/arxiv-2602-18502","title":"Mitigating Shortcut Learning via Feature Disentanglement in Medical Imaging: A Benchmark Study","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"berenslab/medical-shortcut-mitigation","path":"src/shortcut/evaluation/measure_compute_time.py","file_url":"https://github.com/berenslab/medical-shortcut-mitigation/blob/HEAD/src/shortcut/evaluation/measure_compute_time.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ac524479b74f0a7","mcp_get_code":{"code_sha256":"5ac524479b74f0a7"}},{"arxiv_id":"2405.16684","paper":"/paper/gzip-predicts-data-dependent-scaling-laws","title":"gzip Predicts Data-dependent Scaling Laws","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhoomeiK/complexity-scaling","path":"training.py","file_url":"https://github.com/KhoomeiK/complexity-scaling/blob/HEAD/training.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"956054a202b209ff","mcp_get_code":{"code_sha256":"956054a202b209ff"}},{"arxiv_id":"2310.15290","paper":"/paper/fast-and-reliable-generation-of-ehr-time","title":"Reliable Generation of Privacy-preserving Synthetic Electronic Health Record Time Series via Diffusion Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhangtian/timediff","path":"baselines/crnngan_train.py","file_url":"https://github.com/muhangtian/timediff/blob/HEAD/baselines/crnngan_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6c25783534d01d1d","mcp_get_code":{"code_sha256":"6c25783534d01d1d"}},{"arxiv_id":"2210.01911","paper":"/paper/grounding-language-with-visual-affordances","title":"Grounding Language with Visual Affordances over Unstructured Data","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mees/hulc2","path":"hulc2/wrap_training.py","file_url":"https://github.com/mees/hulc2/blob/HEAD/hulc2/wrap_training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ccfe70a95ba3e3ed","mcp_get_code":{"code_sha256":"ccfe70a95ba3e3ed"}},{"arxiv_id":"1301.3781","paper":"/paper/efficient-estimation-of-word-representations","title":"Efficient Estimation of Word Representations in Vector Space","date":"2013-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lateral/minkowski","path":"python/train_skipgram.py","file_url":"https://github.com/lateral/minkowski/blob/HEAD/python/train_skipgram.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"23c2c9ab6bae4826","mcp_get_code":{"code_sha256":"23c2c9ab6bae4826"}}]}