{"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/run-llm","entry":"run_llm","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":6,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":2,"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":"2609.12791","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12791","title":"Cognition on Graph: Navigating Massive Knowledge Space via Cognitive Cycles and Bidirectional Graph-Text Synergy","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"zhougengxian/CoG","path":"CoG/utils.py","file_url":"https://github.com/zhougengxian/CoG/blob/HEAD/CoG/utils.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":"eee3dea1160808bc","code_sha256_prefix":"eee3dea1160808bc","mcp_get_code":{"code_sha256":"eee3dea1160808bc"}},{"arxiv_id":"2601.11047","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11047","title":"CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"zjukg/CoG","path":"CoG/utils.py","file_url":"https://github.com/zjukg/CoG/blob/HEAD/CoG/utils.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":"277f66c7640f893d","code_sha256_prefix":"277f66c7640f893d","mcp_get_code":{"code_sha256":"277f66c7640f893d"}},{"arxiv_id":"2411.10323","arxiv_id_is_arxiv":true,"paper":"/paper/the-dawn-of-gui-agent-a-preliminary-case","title":"The Dawn of GUI Agent: A Preliminary Case Study with Claude 3.5 Computer Use","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"showlab/computer_use_ootb","path":"computer_use_demo/gui_agent/llm_utils/run_llm.py","file_url":"https://github.com/showlab/computer_use_ootb/blob/HEAD/computer_use_demo/gui_agent/llm_utils/run_llm.py","status":"unverified","verification_level":0,"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":"009b1c22b10fd528","code_sha256_prefix":"009b1c22b10fd528","mcp_get_code":{"code_sha256":"009b1c22b10fd528"}},{"arxiv_id":"2410.23875","arxiv_id_is_arxiv":true,"paper":"/paper/plan-on-graph-self-correcting-adaptive","title":"Plan-on-Graph: Self-Correcting Adaptive Planning of Large Language Model on Knowledge Graphs","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liyichen-cly/pog","path":"PoG/utils.py","file_url":"https://github.com/liyichen-cly/pog/blob/HEAD/PoG/utils.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, liyichen-cly/pog when it was checked","code_sha256":"fbeffd19ff44c661","code_sha256_prefix":"fbeffd19ff44c661","mcp_get_code":{"code_sha256":"fbeffd19ff44c661"}},{"arxiv_id":"2404.14741","arxiv_id_is_arxiv":true,"paper":"/paper/generate-on-graph-treat-llm-as-both-agent-and","title":"Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YaooXu/GoG","path":"CoT/utils.py","file_url":"https://github.com/YaooXu/GoG/blob/HEAD/CoT/utils.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, YaooXu/GoG when it was checked","code_sha256":"b0aab5b997a57a62","code_sha256_prefix":"b0aab5b997a57a62","mcp_get_code":{"code_sha256":"b0aab5b997a57a62"}},{"arxiv_id":"2307.07697","arxiv_id_is_arxiv":true,"paper":"/paper/think-on-graph-deep-and-responsible-reasoning","title":"Think-on-Graph: Deep and Responsible Reasoning of Large Language Model on Knowledge Graph","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gasolsun36/tog","path":"ToG/wiki_func.py","file_url":"https://github.com/gasolsun36/tog/blob/HEAD/ToG/wiki_func.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, gasolsun36/tog when it was checked","code_sha256":"b0aab5b997a57a62","code_sha256_prefix":"b0aab5b997a57a62","mcp_get_code":{"code_sha256":"b0aab5b997a57a62"}}],"record_sha256":"abd72e82d843726406ee67f827d6e9321342a5638590e6f97f272ef1f4203b1f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}