{"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/save-results","entry":"save_results","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":8,"n_papers_ran":0,"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":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":8},"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.26386","paper":"/paper/arxiv-2608-26386","title":"Co-Evolving Structured Knowledge and Reasoning in Language Models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"kilian-group/KBevo","path":"src/eval/evaluate.py","file_url":"https://github.com/kilian-group/KBevo/blob/HEAD/src/eval/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9dbda7075f6e59f5","mcp_get_code":{"code_sha256":"9dbda7075f6e59f5"}},{"arxiv_id":"2603.26469","paper":"/paper/arxiv-2603-26469","title":"UNIFERENCE: A Discrete Event Simulation Framework for Developing Distributed AI Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Dogacel/Uniference","path":"run_sanity_tests.py","file_url":"https://github.com/Dogacel/Uniference/blob/HEAD/run_sanity_tests.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"100bd7bf58328b09","mcp_get_code":{"code_sha256":"100bd7bf58328b09"}},{"arxiv_id":"2603.15183","paper":"/paper/arxiv-2603-15183","title":"Token Coherence: Adapting MESI Cache Protocols to Minimize Synchronization Overhead in Multi-Agent LLM Systems","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"hipvlady/agent-coherence","path":"benchmarks/langgraph_real/_scaffold.py","file_url":"https://github.com/hipvlady/agent-coherence/blob/HEAD/benchmarks/langgraph_real/_scaffold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"86e77824eda2c3cb","mcp_get_code":{"code_sha256":"86e77824eda2c3cb"}},{"arxiv_id":"2510.00296","paper":"/paper/arxiv-2510-00296","title":"Beyond Token Probes: Hallucination Detection via Activation Tensors with ACT-ViT","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BarSGuy/ACT-ViT","path":"probing.py","file_url":"https://github.com/BarSGuy/ACT-ViT/blob/HEAD/probing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fef6a66fc8598e10","mcp_get_code":{"code_sha256":"fef6a66fc8598e10"}},{"arxiv_id":"2508.17690","paper":"/paper/arxiv-2508-17690","title":"Text Meets Topology : Rethinking Out-of-distribution Detection in Text-Rich Networks","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"DannyW618/TNT","path":"tntood/experiment_utils.py","file_url":"https://github.com/DannyW618/TNT/blob/HEAD/tntood/experiment_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3c896b36e888f0d1","mcp_get_code":{"code_sha256":"3c896b36e888f0d1"}},{"arxiv_id":"2403.12031","paper":"/paper/routerbench-a-benchmark-for-multi-llm-routing","title":"RouterBench: A Benchmark for Multi-LLM Routing System","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"withmartian/routerbench","path":"evaluate_utils.py","file_url":"https://github.com/withmartian/routerbench/blob/HEAD/evaluate_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b7465494e9692ff","mcp_get_code":{"code_sha256":"8b7465494e9692ff"}},{"arxiv_id":"2202.12180","paper":"/paper/quantum-deep-reinforcement-learning-for-robot","title":"Quantum Deep Reinforcement Learning for Robot Navigation Tasks","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dfki-ric-quantum/qdrl-turtlebot-eval","path":"qeval/utils.py","file_url":"https://github.com/dfki-ric-quantum/qdrl-turtlebot-eval/blob/HEAD/qeval/utils.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":"20234be6a42360b2","mcp_get_code":{"code_sha256":"20234be6a42360b2"}},{"arxiv_id":"1803.08287","paper":"/paper/learning-based-model-predictive-control-for","title":"Learning-based Model Predictive Control for Safe Exploration","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"befelix/safe-exploration","path":"safe_exploration/exploration_runner.py","file_url":"https://github.com/befelix/safe-exploration/blob/HEAD/safe_exploration/exploration_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3312052c79a756a7","mcp_get_code":{"code_sha256":"3312052c79a756a7"}}]}