{"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/make-config","entry":"make_config","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":11,"n_papers_ran":6,"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":9,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":6},"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":"2609.12639","paper":"/paper/arxiv-2609-12639","title":"EXPLAINING TIME SERIES FORECASTING WITH HORIZON-RESOLVED ATTRIBUTION","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"seunghan96/HRX","path":"tsxai/config.py","file_url":"https://github.com/seunghan96/HRX/blob/HEAD/tsxai/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a768915128f9a4f","mcp_get_code":{"code_sha256":"5a768915128f9a4f"}},{"arxiv_id":"2607.06638","paper":"/paper/arxiv-2607-06638","title":"UASPL: Uncertainty-Aware Self-Paced Learning with Evidential Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"treelife979/UASPL","path":"uaspl_pic/UASPL_pic.py","file_url":"https://github.com/treelife979/UASPL/blob/HEAD/uaspl_pic/UASPL_pic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0bcb256988b1edef","mcp_get_code":{"code_sha256":"0bcb256988b1edef"}},{"arxiv_id":"2606.10528","paper":"/paper/arxiv-2606-10528","title":"Representation-Aware Advantage Estimation: Your Reward Model Provides More Than A Scalar Output","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"lmarena/arena-hard-auto","path":"BenchBuilder/label.py","file_url":"https://github.com/lmarena/arena-hard-auto/blob/HEAD/BenchBuilder/label.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"07e6f41cf857a76f","mcp_get_code":{"code_sha256":"07e6f41cf857a76f"}},{"arxiv_id":"2511.04678","paper":"/paper/arxiv-2511-04678","title":"Tracking and Understanding Object Transformations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"YihongSun/TubeletGraph","path":"TubeletGraph/get_prediction.py","file_url":"https://github.com/YihongSun/TubeletGraph/blob/HEAD/TubeletGraph/get_prediction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3316d59d103f658","mcp_get_code":{"code_sha256":"c3316d59d103f658"}},{"arxiv_id":"2511.04678","paper":"/paper/arxiv-2511-04678","title":"Tracking and Understanding Object Transformations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"YihongSun/TubeletGraph","path":"TubeletGraph/tubelet/compute_tubelets_sam.py","file_url":"https://github.com/YihongSun/TubeletGraph/blob/HEAD/TubeletGraph/tubelet/compute_tubelets_sam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"889ce0fcee2816b2","mcp_get_code":{"code_sha256":"889ce0fcee2816b2"}},{"arxiv_id":"2501.15595","paper":"/paper/sedareval-automated-evaluation-using-self","title":"SedarEval: Automated Evaluation using Self-Adaptive Rubrics","date":"2025-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwn1233/sedareval","path":"src/infer.py","file_url":"https://github.com/wwn1233/sedareval/blob/HEAD/src/infer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"07e6f41cf857a76f","mcp_get_code":{"code_sha256":"07e6f41cf857a76f"}},{"arxiv_id":"2410.14872","paper":"/paper/how-to-evaluate-reward-models-for-rlhf","title":"How to Evaluate Reward Models for RLHF","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmarena/ppe","path":"utils/core.py","file_url":"https://github.com/lmarena/ppe/blob/HEAD/utils/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"07e6f41cf857a76f","mcp_get_code":{"code_sha256":"07e6f41cf857a76f"}},{"arxiv_id":"2406.11939","paper":"/paper/from-crowdsourced-data-to-high-quality","title":"From Crowdsourced Data to High-Quality Benchmarks: Arena-Hard and BenchBuilder Pipeline","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lm-sys/arena-hard-auto","path":"BenchBuilder/label.py","file_url":"https://github.com/lm-sys/arena-hard-auto/blob/HEAD/BenchBuilder/label.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"07e6f41cf857a76f","mcp_get_code":{"code_sha256":"07e6f41cf857a76f"}},{"arxiv_id":"2401.02244","paper":"/paper/policy-regularized-offline-multi-objective","title":"Policy-regularized Offline Multi-objective Reinforcement Learning","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qianlin04/prmorl","path":"lib/utilities/common_utils.py","file_url":"https://github.com/qianlin04/prmorl/blob/HEAD/lib/utilities/common_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9b06f806783534b5","mcp_get_code":{"code_sha256":"9b06f806783534b5"}},{"arxiv_id":"2006.13979","paper":"/paper/unsupervised-cross-lingual-representation-3","title":"Unsupervised Cross-lingual Representation Learning for Speech Recognition","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLasse/wav2vec_finetune","path":"configs/make_binary_wav2vec_configs.py","file_url":"https://github.com/HLasse/wav2vec_finetune/blob/HEAD/configs/make_binary_wav2vec_configs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"799709e0afdff68f","mcp_get_code":{"code_sha256":"799709e0afdff68f"}},{"arxiv_id":"1811.09245","paper":"/paper/tganv2-efficient-training-of-large-models-for","title":"Train Sparsely, Generate Densely: Memory-efficient Unsupervised Training of High-resolution Temporal GAN","date":"2018-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/tgan2","path":"tgan2/utils.py","file_url":"https://github.com/pfnet-research/tgan2/blob/HEAD/tgan2/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"550ecc473bd99ad0","mcp_get_code":{"code_sha256":"550ecc473bd99ad0"}},{"arxiv_id":"2023.acl-long.789","paper":null,"title":"arXiv:2023.acl-long.789","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"enricoliscio/tomea","path":"lexicon_generation/shap_lexicon_gen.py","file_url":"https://github.com/enricoliscio/tomea/blob/HEAD/lexicon_generation/shap_lexicon_gen.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ed4fedb55599901","mcp_get_code":{"code_sha256":"1ed4fedb55599901"}}]}