{"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-name","entry":"get_name","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":20,"n_papers_ran":10,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":16,"n_samples_ran":9,"n_samples_fingerprinted":4,"n_places":21,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":5,"unverified":7},"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":"2605.11598","paper":"/paper/arxiv-2605-11598","title":"EpiCastBench: Datasets and Benchmarks for Multivariate Epidemic Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"aimltsf/EpiCastBench","path":"Code/data_loader.py","file_url":"https://github.com/aimltsf/EpiCastBench/blob/HEAD/Code/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f0216b932e619eba","mcp_get_code":{"code_sha256":"f0216b932e619eba"}},{"arxiv_id":"2604.14624","paper":"/paper/arxiv-2604-14624","title":"Asking What Matters: Reward-Driven Clarification for Software Engineering Tasks","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"astropy/astropy","path":"astropy/modeling/bounding_box.py","file_url":"https://github.com/astropy/astropy/blob/HEAD/astropy/modeling/bounding_box.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":"7825cbf13229811e","mcp_get_code":{"code_sha256":"7825cbf13229811e"}},{"arxiv_id":"2409.10593","paper":"/paper/cskv-training-efficient-channel-shrinking-for","title":"CSKV: Training-Efficient Channel Shrinking for KV Cache in Long-Context Scenarios","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wln20/CSKV","path":"cskv_src/utils/general_utils.py","file_url":"https://github.com/wln20/CSKV/blob/HEAD/cskv_src/utils/general_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8717d7f11f169bd2","mcp_get_code":{"code_sha256":"8717d7f11f169bd2"}},{"arxiv_id":"2408.06849","paper":"/paper/causal-agent-based-on-large-language-model","title":"Causal Agent based on Large Language Model","date":"2024-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kairong-han/causal_agent","path":"dataset_gt.py","file_url":"https://github.com/kairong-han/causal_agent/blob/HEAD/dataset_gt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f47c429ede66b1c","mcp_get_code":{"code_sha256":"5f47c429ede66b1c"}},{"arxiv_id":"2408.01933","paper":"/paper/2408-01933","title":"DiReCT: Diagnostic Reasoning for Clinical Notes via Large Language Models","date":"2024-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wbw520/DiReCT","path":"utils/data_analysis.py","file_url":"https://github.com/wbw520/DiReCT/blob/HEAD/utils/data_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"02283ca71ba62f66","mcp_get_code":{"code_sha256":"02283ca71ba62f66"}},{"arxiv_id":"2406.11730","paper":"/paper/chg-shapley-efficient-data-valuation-and","title":"CHG Shapley: Efficient Data Valuation and Selection towards Trustworthy Machine Learning","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caihuaiguang/CHG-Shapley-for-Data-Valuation","path":"opendataval/util.py","file_url":"https://github.com/caihuaiguang/CHG-Shapley-for-Data-Valuation/blob/HEAD/opendataval/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4f775a9a6a730ec","mcp_get_code":{"code_sha256":"e4f775a9a6a730ec"}},{"arxiv_id":"2404.07904","paper":"/paper/hgrn2-gated-linear-rnns-with-state-expansion","title":"HGRN2: Gated Linear RNNs with State Expansion","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opennlplab/hgrn2","path":"run_lra.py","file_url":"https://github.com/opennlplab/hgrn2/blob/HEAD/run_lra.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":"a0af9c7fffe0400b","mcp_get_code":{"code_sha256":"a0af9c7fffe0400b"}},{"arxiv_id":"2403.16439","paper":"/paper/producing-and-leveraging-online-map","title":"Producing and Leveraging Online Map Uncertainty in Trajectory Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alfredgu001324/mapuncertaintyprediction","path":"DenseTNT_modified/src/utils.py","file_url":"https://github.com/alfredgu001324/mapuncertaintyprediction/blob/HEAD/DenseTNT_modified/src/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":"cb738ca038a25cf6","mcp_get_code":{"code_sha256":"cb738ca038a25cf6"}},{"arxiv_id":"2306.10577","paper":"/paper/opendataval-a-unified-benchmark-for-data-1","title":"OpenDataVal: a Unified Benchmark for Data Valuation","date":"2023-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendataval/opendataval","path":"opendataval/util.py","file_url":"https://github.com/opendataval/opendataval/blob/HEAD/opendataval/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4f775a9a6a730ec","mcp_get_code":{"code_sha256":"e4f775a9a6a730ec"}},{"arxiv_id":"2212.13881","paper":"/paper/feature-learning-in-neural-networks-and","title":"Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features","date":"2022-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aradha/deep_neural_feature_ansatz","path":"verify_deep_NFA.py","file_url":"https://github.com/aradha/deep_neural_feature_ansatz/blob/HEAD/verify_deep_NFA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"182a9ce82577c7fa","mcp_get_code":{"code_sha256":"182a9ce82577c7fa"}},{"arxiv_id":"2211.08553","paper":"/paper/hybrid-transformers-for-music-source","title":"Hybrid Transformers for Music Source Separation","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaozhipeng1997/demucs_ascend910_pytorch","path":"demucs/parser.py","file_url":"https://github.com/zhaozhipeng1997/demucs_ascend910_pytorch/blob/HEAD/demucs/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"dccae3e25e1c55a2","mcp_get_code":{"code_sha256":"dccae3e25e1c55a2"}},{"arxiv_id":"2202.11884","paper":"/paper/m2i-from-factored-marginal-trajectory","title":"M2I: From Factored Marginal Trajectory Prediction to Interactive Prediction","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tsinghua-MARS-Lab/M2I","path":"src/utils.py","file_url":"https://github.com/Tsinghua-MARS-Lab/M2I/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb738ca038a25cf6","mcp_get_code":{"code_sha256":"cb738ca038a25cf6"}},{"arxiv_id":"2108.09640","paper":"/paper/densetnt-end-to-end-trajectory-prediction","title":"DenseTNT: End-to-end Trajectory Prediction from Dense Goal Sets","date":"2021-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tsinghua-MARS-Lab/DenseTNT","path":"src/utils.py","file_url":"https://github.com/Tsinghua-MARS-Lab/DenseTNT/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb738ca038a25cf6","mcp_get_code":{"code_sha256":"cb738ca038a25cf6"}},{"arxiv_id":"2106.07597","paper":"/paper/mlperf-tiny-benchmark","title":"MLPerf Tiny Benchmark","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlcommons/tiny","path":"benchmark/runner/stream_wav_uart.py","file_url":"https://github.com/mlcommons/tiny/blob/HEAD/benchmark/runner/stream_wav_uart.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":"52eb372fa50a6b62","mcp_get_code":{"code_sha256":"52eb372fa50a6b62"}},{"arxiv_id":"2007.02559","paper":"/paper/enhancing-sat-solvers-with-glue-variable","title":"Enhancing SAT solvers with glue variable predictions","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jesse-michael-han/neuro-cadical","path":"python/solver_eval.py","file_url":"https://github.com/jesse-michael-han/neuro-cadical/blob/HEAD/python/solver_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ff660a889a945b5b","mcp_get_code":{"code_sha256":"ff660a889a945b5b"}},{"arxiv_id":"2004.14928","paper":"/paper/language-model-prior-for-low-resource-neural","title":"Language Model Prior for Low-Resource Neural Machine Translation","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cbaziotis/lm-prior-for-nmt","path":"configs/rnn/generate_nmt_experiments.py","file_url":"https://github.com/cbaziotis/lm-prior-for-nmt/blob/HEAD/configs/rnn/generate_nmt_experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb3d7ac764f53331","mcp_get_code":{"code_sha256":"cb3d7ac764f53331"}},{"arxiv_id":"2004.14928","paper":"/paper/language-model-prior-for-low-resource-neural","title":"Language Model Prior for Low-Resource Neural Machine Translation","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cbaziotis/lm-prior-for-nmt","path":"configs/transformer/generate_nmt_experiments.py","file_url":"https://github.com/cbaziotis/lm-prior-for-nmt/blob/HEAD/configs/transformer/generate_nmt_experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f1a2cddb04257e0","mcp_get_code":{"code_sha256":"0f1a2cddb04257e0"}},{"arxiv_id":"1908.02116","paper":"/paper/teacher-supervises-students-how-to-learn-from","title":"Teacher Supervises Students How to Learn From Partially Labeled Images for Facial Landmark Detection","date":"2019-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/landmark-detection","path":"SRT/cache_data/GEN_300W.py","file_url":"https://github.com/D-X-Y/landmark-detection/blob/HEAD/SRT/cache_data/GEN_300W.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e137aed896bedb2b","mcp_get_code":{"code_sha256":"e137aed896bedb2b"}},{"arxiv_id":"1809.07454","paper":"/paper/tasnet-surpassing-ideal-time-frequency","title":"Conv-TasNet: Surpassing Ideal Time-Frequency Magnitude Masking for Speech Separation","date":"2018-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IliasDG/Demucs_Project","path":"demucs/parser.py","file_url":"https://github.com/IliasDG/Demucs_Project/blob/HEAD/demucs/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"dccae3e25e1c55a2","mcp_get_code":{"code_sha256":"dccae3e25e1c55a2"}},{"arxiv_id":"1808.09075","paper":"/paper/evaluating-the-utility-of-hand-crafted","title":"Evaluating the Utility of Hand-crafted Features in Sequence Labelling","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minghao-wu/CRF-AE","path":"utils.py","file_url":"https://github.com/minghao-wu/CRF-AE/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"326dd961371b8acb","mcp_get_code":{"code_sha256":"326dd961371b8acb"}},{"arxiv_id":"Yan_INT2_Interactive_Trajectory_Prediction_at_Intersections_ICCV_2023_paper","paper":null,"title":"arXiv:Yan_INT2_Interactive_Trajectory_Prediction_at_Intersections_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AIR-DISCOVER/INT2","path":"int2_benchmark/M2I/src/utils.py","file_url":"https://github.com/AIR-DISCOVER/INT2/blob/HEAD/int2_benchmark/M2I/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb738ca038a25cf6","mcp_get_code":{"code_sha256":"cb738ca038a25cf6"}}]}