{"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-code","entry":"run_code","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":5,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":3},"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":"2505.19764","paper":"/paper/agentic-predictor-performance-prediction-for","title":"Agentic Predictor: Performance Prediction for Agentic Workflows via Multi-View Encoding","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepauto-ai/agentic-predictor","path":"agent_predictor/operator_files/Programmer.py","file_url":"https://github.com/deepauto-ai/agentic-predictor/blob/HEAD/agent_predictor/operator_files/Programmer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68d21e2eb50348a6","mcp_get_code":{"code_sha256":"68d21e2eb50348a6"}},{"arxiv_id":"2410.03864","paper":"/paper/dots-learning-to-reason-dynamically-in-llms","title":"DOTS: Learning to Reason Dynamically in LLMs via Optimal Reasoning Trajectories Search","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MurongYue/DOTS","path":"src/LLM_reasoning_workflow_general.py","file_url":"https://github.com/MurongYue/DOTS/blob/HEAD/src/LLM_reasoning_workflow_general.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d87b285fd88d1a96","mcp_get_code":{"code_sha256":"d87b285fd88d1a96"}},{"arxiv_id":"2407.09887","paper":"/paper/benchmarking-llms-for-optimization-modeling","title":"OptiBench Meets ReSocratic: Measure and Improve LLMs for Optimization Modeling","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhch6/ReSocratic","path":"eval_sft_code.py","file_url":"https://github.com/yangzhch6/ReSocratic/blob/HEAD/eval_sft_code.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":"72b7206735fb5753","mcp_get_code":{"code_sha256":"72b7206735fb5753"}},{"arxiv_id":"2405.14918","paper":"/paper/analogcoder-analog-circuit-design-via","title":"AnalogCoder: Analog Circuit Design via Training-Free Code Generation","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laiyao1/AnalogCoder","path":"gpt_run.py","file_url":"https://github.com/laiyao1/AnalogCoder/blob/HEAD/gpt_run.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48bf1a3680ad0984","mcp_get_code":{"code_sha256":"48bf1a3680ad0984"}},{"arxiv_id":"2401.07128","paper":"/paper/ehragent-code-empowers-large-language-models","title":"EHRAgent: Code Empowers Large Language Models for Few-shot Complex Tabular Reasoning on Electronic Health Records","date":"2024-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wshi83/EhrAgent","path":"ehragent/toolset_high.py","file_url":"https://github.com/wshi83/EhrAgent/blob/HEAD/ehragent/toolset_high.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b9a38df731f966c8","mcp_get_code":{"code_sha256":"b9a38df731f966c8"}}]}