{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-yaml-config","entry":"load_yaml_config","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":18,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":13,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":8,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":18,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":0,"ran":5,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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.17360","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17360","title":"Fair ASR: Re-Evaluating Black-Box Jailbreaks under Shared Target-Call Budgets","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"xsddys/Fair-ASR","path":"FairASR/evaluators/eval_single_turn_budget.py","file_url":"https://github.com/xsddys/Fair-ASR/blob/HEAD/FairASR/evaluators/eval_single_turn_budget.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xsddys/Fair-ASR when it was checked","code_sha256":"f30e4515fd2e0f5c","code_sha256_prefix":"f30e4515fd2e0f5c","mcp_get_code":{"code_sha256":"f30e4515fd2e0f5c"}},{"arxiv_id":"2605.20735","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20735","title":"Lowering the Barrier to IREX Participation: Open-Source Algorithms, Toolkit, and Benchmarking for Iris Recognition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"worldcoin/open-iris","path":"src/iris/pipelines/base_pipeline.py","file_url":"https://github.com/worldcoin/open-iris/blob/HEAD/src/iris/pipelines/base_pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce5137c777681694","code_sha256_prefix":"ce5137c777681694","mcp_get_code":{"code_sha256":"ce5137c777681694"}},{"arxiv_id":"2605.20170","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20170","title":"KoRe: Compact Knowledge Representations for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DavidC001/KoRe","path":"KG_LM/configuration.py","file_url":"https://github.com/DavidC001/KoRe/blob/HEAD/KG_LM/configuration.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DavidC001/KoRe when it was checked","code_sha256":"2a20041949ccd2ba","code_sha256_prefix":"2a20041949ccd2ba","mcp_get_code":{"code_sha256":"2a20041949ccd2ba"}},{"arxiv_id":"2605.18864","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18864","title":"SAGE: Shaping Anchors for Guided Exploration in RLVR of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"tally0818/SAGE","path":"src/config.py","file_url":"https://github.com/tally0818/SAGE/blob/HEAD/src/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tally0818/SAGE when it was checked","code_sha256":"06463f38f0e33a36","code_sha256_prefix":"06463f38f0e33a36","mcp_get_code":{"code_sha256":"06463f38f0e33a36"}},{"arxiv_id":"2605.18004","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18004","title":"RL4RLA: Teaching ML to Discover Randomized Linear Algebra Algorithms Through Curriculum Design and Graph-Based Search","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Tim-Xiong/RL4RLA","path":"run_batch.py","file_url":"https://github.com/Tim-Xiong/RL4RLA/blob/HEAD/run_batch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dedf784b52fef6d9","code_sha256_prefix":"dedf784b52fef6d9","mcp_get_code":{"code_sha256":"dedf784b52fef6d9"}},{"arxiv_id":"2604.05635","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-05635","title":"From Uniform to Learned Knots: A Study of Spline-Based Numerical Encodings for Tabular Deep Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"mkumar73/tdl-numerical-encodings","path":"src/config_loader.py","file_url":"https://github.com/mkumar73/tdl-numerical-encodings/blob/HEAD/src/config_loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aa67120fbea577e","code_sha256_prefix":"5aa67120fbea577e","mcp_get_code":{"code_sha256":"5aa67120fbea577e"}},{"arxiv_id":"2603.19812","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-19812","title":"Eye Gaze-Informed and Context-Aware Pedestrian Trajectory Prediction in Shared Spaces with Automated Shuttles: A Virtual Reality Study","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"danyayay/GazeX","path":"utils/config.py","file_url":"https://github.com/danyayay/GazeX/blob/HEAD/utils/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, danyayay/GazeX when it was checked","code_sha256":"7d4e9e8a48c01832","code_sha256_prefix":"7d4e9e8a48c01832","mcp_get_code":{"code_sha256":"7d4e9e8a48c01832"}},{"arxiv_id":"2602.23614","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23614","title":"When Does Multimodal Learning Help in Healthcare? A Benchmark on EHR and Chest X-Ray Fusion","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jakeykj/CareBench","path":"arguments.py","file_url":"https://github.com/jakeykj/CareBench/blob/HEAD/arguments.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a3ef7ec832c2fc1","code_sha256_prefix":"6a3ef7ec832c2fc1","mcp_get_code":{"code_sha256":"6a3ef7ec832c2fc1"}},{"arxiv_id":"2506.08184","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08184","title":"Unable to Forget: Proactive lnterference Reveals Working Memory Limits in LLMs Beyond Context Length","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuangziGiantfish/Unable-to-Forget","path":"automation/config_utils.py","file_url":"https://github.com/zhuangziGiantfish/Unable-to-Forget/blob/HEAD/automation/config_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"52b144e9fe793b19","code_sha256_prefix":"52b144e9fe793b19","mcp_get_code":{"code_sha256":"52b144e9fe793b19"}},{"arxiv_id":"2505.12186","arxiv_id_is_arxiv":true,"paper":"/paper/self-destructive-language-model","title":"Self-Destructive Language Model","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJUWYH/SEAM","path":"src/utils/config.py","file_url":"https://github.com/ZJUWYH/SEAM/blob/HEAD/src/utils/config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e139c8024bf32174","code_sha256_prefix":"e139c8024bf32174","mcp_get_code":{"code_sha256":"e139c8024bf32174"}},{"arxiv_id":"2503.22832","arxiv_id_is_arxiv":true,"paper":"/paper/l0-reasoning-bench-evaluating-procedural","title":"L0-Reasoning Bench: Evaluating Procedural Correctness in Language Models via Simple Program Execution","date":"2025-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SimengSun/L0-reasoning-bench","path":"src/evaluators/launcher.py","file_url":"https://github.com/SimengSun/L0-reasoning-bench/blob/HEAD/src/evaluators/launcher.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f07660b55ff5be0","code_sha256_prefix":"2f07660b55ff5be0","mcp_get_code":{"code_sha256":"2f07660b55ff5be0"}},{"arxiv_id":"2501.07251","arxiv_id_is_arxiv":true,"paper":"/paper/mos-attack-a-scalable-multi-objective","title":"MOS-Attack: A Scalable Multi-objective Adversarial Attack Framework","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pgg3/MOS-Attack","path":"run_experiments.py","file_url":"https://github.com/pgg3/MOS-Attack/blob/HEAD/run_experiments.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9552ad0f16d5f66","code_sha256_prefix":"f9552ad0f16d5f66","mcp_get_code":{"code_sha256":"f9552ad0f16d5f66"}},{"arxiv_id":"2412.09328","arxiv_id_is_arxiv":true,"paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Utils/io_utils.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/io_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef8e0e1d280c05be","code_sha256_prefix":"ef8e0e1d280c05be","mcp_get_code":{"code_sha256":"ef8e0e1d280c05be"}},{"arxiv_id":"2411.07506","arxiv_id_is_arxiv":true,"paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Utils/io_utils.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Utils/io_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, unites-lab/fmts when it was checked","code_sha256":"ef8e0e1d280c05be","code_sha256_prefix":"ef8e0e1d280c05be","mcp_get_code":{"code_sha256":"ef8e0e1d280c05be"}},{"arxiv_id":"2410.20886","arxiv_id_is_arxiv":true,"paper":"/paper/codes-benchmarking-coupled-ode-surrogates","title":"CODES: Benchmarking Coupled ODE Surrogates","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robin-janssen/codes-benchmark","path":"codes/tune/optuna_fcts.py","file_url":"https://github.com/robin-janssen/codes-benchmark/blob/HEAD/codes/tune/optuna_fcts.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, robin-janssen/codes-benchmark, is not in the permissive set Syntology serves inline","code_sha256":"0ac6a39f5df77fc9","code_sha256_prefix":"0ac6a39f5df77fc9","mcp_get_code":{"code_sha256":"0ac6a39f5df77fc9"}},{"arxiv_id":"2305.01319","arxiv_id_is_arxiv":true,"paper":"/paper/long-term-rhythmic-video-soundtracker","title":"Long-Term Rhythmic Video Soundtracker","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/loris","path":"d2m/utils.py","file_url":"https://github.com/opengvlab/loris/blob/HEAD/d2m/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef8e0e1d280c05be","code_sha256_prefix":"ef8e0e1d280c05be","mcp_get_code":{"code_sha256":"ef8e0e1d280c05be"}},{"arxiv_id":"2006.10201","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-role-of-sparsity-and-dag-constraints","title":"On the Role of Sparsity and DAG Constraints for Learning Linear DAGs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignavier/golem","path":"src/utils/config.py","file_url":"https://github.com/ignavier/golem/blob/HEAD/src/utils/config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a2bc2ff671b050e","code_sha256_prefix":"1a2bc2ff671b050e","mcp_get_code":{"code_sha256":"1a2bc2ff671b050e"}},{"arxiv_id":"1905.10437","arxiv_id_is_arxiv":true,"paper":"/paper/n-beats-neural-basis-expansion-analysis-for","title":"N-BEATS: Neural basis expansion analysis for interpretable time series forecasting","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"realdanielbyrne/N-BEATS-Lightning","path":"experiments/run_from_yaml.py","file_url":"https://github.com/realdanielbyrne/N-BEATS-Lightning/blob/HEAD/experiments/run_from_yaml.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f8a0c5844dcb4e9","code_sha256_prefix":"1f8a0c5844dcb4e9","mcp_get_code":{"code_sha256":"1f8a0c5844dcb4e9"}}],"record_sha256":"b49d2f70b0c250ed1c0d548fd9e0a581bd430c84ec49d06fc63a50049346f630","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}