{"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/loadjson","entry":"loadjson","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":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":4,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":1},"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":"2604.23626","paper":"/paper/arxiv-2604-23626","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ulab-uiuc/GraphPlanner","path":"router_planner/shared/utils.py","file_url":"https://github.com/ulab-uiuc/GraphPlanner/blob/HEAD/router_planner/shared/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e317f871b4dbfcb9","mcp_get_code":{"code_sha256":"e317f871b4dbfcb9"}},{"arxiv_id":"2410.03834","paper":"/paper/graphrouter-a-graph-based-router-for-llm","title":"GraphRouter: A Graph-based Router for LLM Selections","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ulab-uiuc/graphrouter","path":"data_processing/utils.py","file_url":"https://github.com/ulab-uiuc/graphrouter/blob/HEAD/data_processing/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"61e17b4afbd1f360","mcp_get_code":{"code_sha256":"61e17b4afbd1f360"}},{"arxiv_id":"2206.13176","paper":"/paper/a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-h/pge","path":"pge/utils.py","file_url":"https://github.com/yifan-h/pge/blob/HEAD/pge/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb22c8294f1adab1","mcp_get_code":{"code_sha256":"cb22c8294f1adab1"}},{"arxiv_id":"2206.13170","paper":"/paper/measuring-and-improving-the-use-of-graph-1","title":"Measuring and Improving the Use of Graph Information in Graph Neural Networks","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-h/CS-GNN","path":"src/utils.py","file_url":"https://github.com/yifan-h/CS-GNN/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb22c8294f1adab1","mcp_get_code":{"code_sha256":"cb22c8294f1adab1"}},{"arxiv_id":"2104.03149","paper":"/paper/beyond-question-based-biases-assessing","title":"Beyond Question-Based Biases: Assessing Multimodal Shortcut Learning in Visual Question Answering","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cdancette/detect-shortcuts","path":"vqa.py","file_url":"https://github.com/cdancette/detect-shortcuts/blob/HEAD/vqa.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f151d3d0ad479012","mcp_get_code":{"code_sha256":"f151d3d0ad479012"}}]}