{"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/save-results","entry":"save_results","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":2,"ran_fixture":0,"ran":4,"unverified":2},"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.26386","arxiv_id_is_arxiv":true,"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":"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":"9dbda7075f6e59f5","code_sha256_prefix":"9dbda7075f6e59f5","mcp_get_code":{"code_sha256":"9dbda7075f6e59f5"}},{"arxiv_id":"2603.26469","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Dogacel/Uniference (NOASSERTION)","code_sha256":"100bd7bf58328b09","code_sha256_prefix":"100bd7bf58328b09","mcp_get_code":{"code_sha256":"100bd7bf58328b09"}},{"arxiv_id":"2603.15183","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, hipvlady/agent-coherence (NOASSERTION)","code_sha256":"86e77824eda2c3cb","code_sha256_prefix":"86e77824eda2c3cb","mcp_get_code":{"code_sha256":"86e77824eda2c3cb"}},{"arxiv_id":"2510.00296","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"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, BarSGuy/ACT-ViT when it was checked","code_sha256":"fef6a66fc8598e10","code_sha256_prefix":"fef6a66fc8598e10","mcp_get_code":{"code_sha256":"fef6a66fc8598e10"}},{"arxiv_id":"2508.17690","arxiv_id_is_arxiv":true,"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":"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, DannyW618/TNT when it was checked","code_sha256":"3c896b36e888f0d1","code_sha256_prefix":"3c896b36e888f0d1","mcp_get_code":{"code_sha256":"3c896b36e888f0d1"}},{"arxiv_id":"2403.12031","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b7465494e9692ff","code_sha256_prefix":"8b7465494e9692ff","mcp_get_code":{"code_sha256":"8b7465494e9692ff"}},{"arxiv_id":"2202.12180","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20234be6a42360b2","code_sha256_prefix":"20234be6a42360b2","mcp_get_code":{"code_sha256":"20234be6a42360b2"}},{"arxiv_id":"1803.08287","arxiv_id_is_arxiv":true,"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":"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":"3312052c79a756a7","code_sha256_prefix":"3312052c79a756a7","mcp_get_code":{"code_sha256":"3312052c79a756a7"}}],"record_sha256":"21837765800b90f82241db9641734316aaa89b364db36b67bf5d765cea9933bc","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}