{"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/read-result","entry":"read_result","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":7,"n_papers_ran":3,"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":8,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2411.05361","paper":"/paper/dynamic-superb-phase-2-a-collaboratively","title":"Dynamic-SUPERB Phase-2: A Collaboratively Expanding Benchmark for Measuring the Capabilities of Spoken Language Models with 180 Tasks","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dynamic-superb/dynamic-superb","path":"api/metrics/llm_classification.py","file_url":"https://github.com/dynamic-superb/dynamic-superb/blob/HEAD/api/metrics/llm_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aca40522a9507173","mcp_get_code":{"code_sha256":"aca40522a9507173"}},{"arxiv_id":"2404.18185","paper":"/paper/ranked-list-truncation-for-large-language","title":"Ranked List Truncation for Large Language Model-based Re-Ranking","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuanmeng/rlt4reranking","path":"process_robust04.py","file_url":"https://github.com/chuanmeng/rlt4reranking/blob/HEAD/process_robust04.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f7976c7bc649ea7e","mcp_get_code":{"code_sha256":"f7976c7bc649ea7e"}},{"arxiv_id":"2402.09391","paper":"/paper/llasmol-advancing-large-language-models-for","title":"LlaSMol: Advancing Large Language Models for Chemistry with a Large-Scale, Comprehensive, High-Quality Instruction Tuning Dataset","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-nlp-group/llm4chem","path":"compute_metrics.py","file_url":"https://github.com/osu-nlp-group/llm4chem/blob/HEAD/compute_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8dc6f087d9f1731","mcp_get_code":{"code_sha256":"b8dc6f087d9f1731"}},{"arxiv_id":"2310.01446","paper":"/paper/adaptive-solver-framework-for-dynamic","title":"Adaptive-Solver Framework for Dynamic Strategy Selection in Large Language Model Reasoning","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"john1226966735/adaptive-solver","path":"run_pipeline_configuration/main_base_adaptation.py","file_url":"https://github.com/john1226966735/adaptive-solver/blob/HEAD/run_pipeline_configuration/main_base_adaptation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"35fd87a2e8c0a97d","mcp_get_code":{"code_sha256":"35fd87a2e8c0a97d"}},{"arxiv_id":"1909.12255","paper":"/paper/harnessing-structures-for-value-based","title":"Harnessing Structures for Value-Based Planning and Reinforcement Learning","date":"2019-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YyzHarry/SV-RL","path":"sv_rl/plot_single.py","file_url":"https://github.com/YyzHarry/SV-RL/blob/HEAD/sv_rl/plot_single.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d283028094ba6d7","mcp_get_code":{"code_sha256":"2d283028094ba6d7"}},{"arxiv_id":"1901.11282","paper":"/paper/priority-inheritance-with-backtracking-for","title":"Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"Kei18/pibt2","path":"exp_scripts/mapd.py","file_url":"https://github.com/Kei18/pibt2/blob/HEAD/exp_scripts/mapd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a137e4592d14a0ac","mcp_get_code":{"code_sha256":"a137e4592d14a0ac"}},{"arxiv_id":"1901.11282","paper":"/paper/priority-inheritance-with-backtracking-for","title":"Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"Kei18/pibt2","path":"exp_scripts/mapf.py","file_url":"https://github.com/Kei18/pibt2/blob/HEAD/exp_scripts/mapf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f1815fa2e645b1ec","mcp_get_code":{"code_sha256":"f1815fa2e645b1ec"}},{"arxiv_id":"2024.acl-long.313","paper":null,"title":"arXiv:2024.acl-long.313","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Memelank/PRP-Graph","path":"interpolate.py","file_url":"https://github.com/Memelank/PRP-Graph/blob/HEAD/interpolate.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":"19d36375f36564b7","mcp_get_code":{"code_sha256":"19d36375f36564b7"}}]}