{"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/generate-graph","entry":"generate_graph","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":10,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":10,"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":0,"ran_fixture":1,"ran":4,"unverified":5},"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.12265","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12265","title":"GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"xzx34/GTA","path":"src/gtbench/generate.py","file_url":"https://github.com/xzx34/GTA/blob/HEAD/src/gtbench/generate.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":"a36efd4d6a7768ff","code_sha256_prefix":"a36efd4d6a7768ff","mcp_get_code":{"code_sha256":"a36efd4d6a7768ff"}},{"arxiv_id":"2608.23917","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23917","title":"GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"knhn1004/GATNextHop","path":"src/gatnexthop/core/generator.py","file_url":"https://github.com/knhn1004/GATNextHop/blob/HEAD/src/gatnexthop/core/generator.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, knhn1004/GATNextHop when it was checked","code_sha256":"2067dc9157aad591","code_sha256_prefix":"2067dc9157aad591","mcp_get_code":{"code_sha256":"2067dc9157aad591"}},{"arxiv_id":"2505.00596","arxiv_id_is_arxiv":true,"paper":"/paper/a-finite-state-controller-based-offline","title":"A Finite-State Controller Based Offline Solver for Deterministic POMDPs","date":"2025-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ori-goals/DetMCVI","path":"experiments/CTP/CTP_generator.py","file_url":"https://github.com/ori-goals/DetMCVI/blob/HEAD/experiments/CTP/CTP_generator.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":"f0567cb67248ef25","code_sha256_prefix":"f0567cb67248ef25","mcp_get_code":{"code_sha256":"f0567cb67248ef25"}},{"arxiv_id":"2503.17741","arxiv_id_is_arxiv":true,"paper":"/paper/rustmap-towards-project-scale-c-to-rust","title":"RustMap: Towards Project-Scale C-to-Rust Migration via Program Analysis and LLM","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"cxm211/rustmap","path":"scaffolding_py_tools/tarjan.py","file_url":"https://github.com/cxm211/rustmap/blob/HEAD/scaffolding_py_tools/tarjan.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":"561fa8cf9c49574f","code_sha256_prefix":"561fa8cf9c49574f","mcp_get_code":{"code_sha256":"561fa8cf9c49574f"}},{"arxiv_id":"2501.14314","arxiv_id_is_arxiv":true,"paper":"/paper/graph-feedback-bandits-on-similar-arms-with","title":"Graph Feedback Bandits on Similar Arms: With and Without Graph Structures","date":"2025-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qh1874/GraphBandits_SimilarArms","path":"aux_func.py","file_url":"https://github.com/qh1874/GraphBandits_SimilarArms/blob/HEAD/aux_func.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":"3876c6360df908fe","code_sha256_prefix":"3876c6360df908fe","mcp_get_code":{"code_sha256":"3876c6360df908fe"}},{"arxiv_id":"2410.05298","arxiv_id_is_arxiv":true,"paper":"/paper/how-do-large-language-models-understand-graph","title":"How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DDigimon/GraphPattern","path":"codes/generation.py","file_url":"https://github.com/DDigimon/GraphPattern/blob/HEAD/codes/generation.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, DDigimon/GraphPattern when it was checked","code_sha256":"44163594c567339c","code_sha256_prefix":"44163594c567339c","mcp_get_code":{"code_sha256":"44163594c567339c"}},{"arxiv_id":"2308.11937","arxiv_id_is_arxiv":true,"paper":"/paper/learning-bottleneck-transformer-for-event","title":"Learning Bottleneck Transformer for Event Image-Voxel Feature Fusion based Classification","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"event-ahu/efv_event_classification","path":"generate_graph/voxel2graph.py","file_url":"https://github.com/event-ahu/efv_event_classification/blob/HEAD/generate_graph/voxel2graph.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, event-ahu/efv_event_classification when it was checked","code_sha256":"386009ae53c1e784","code_sha256_prefix":"386009ae53c1e784","mcp_get_code":{"code_sha256":"386009ae53c1e784"}},{"arxiv_id":"2305.10686","arxiv_id_is_arxiv":true,"paper":"/paper/rmssinger-realistic-music-score-based-singing","title":"RMSSinger: Realistic-Music-Score based Singing Voice Synthesis","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tonnetonne814/SiFi-VITS2-44100-Ja","path":"train_SVS_synthesizer.py","file_url":"https://github.com/tonnetonne814/SiFi-VITS2-44100-Ja/blob/HEAD/train_SVS_synthesizer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3a9c00767735ee2","code_sha256_prefix":"d3a9c00767735ee2","mcp_get_code":{"code_sha256":"d3a9c00767735ee2"}},{"arxiv_id":"2006.02587","arxiv_id_is_arxiv":true,"paper":"/paper/xgnn-towards-model-level-explanations-of","title":"XGNN: Towards Model-Level Explanations of Graph Neural Networks","date":"2020-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"for-just-we/xgnn-impl","path":"TrainGenerator.py","file_url":"https://github.com/for-just-we/xgnn-impl/blob/HEAD/TrainGenerator.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, for-just-we/xgnn-impl when it was checked","code_sha256":"c0437a2a5cdd4646","code_sha256_prefix":"c0437a2a5cdd4646","mcp_get_code":{"code_sha256":"c0437a2a5cdd4646"}},{"arxiv_id":"1806.04965","arxiv_id_is_arxiv":true,"paper":"/paper/the-streaming-rollout-of-deep-networks","title":"The streaming rollout of deep networks - towards fully model-parallel execution","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/statestream","path":"statestream/utils/wrapper_networkx.py","file_url":"https://github.com/boschresearch/statestream/blob/HEAD/statestream/utils/wrapper_networkx.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":"a8c1507b69fb2a97","code_sha256_prefix":"a8c1507b69fb2a97","mcp_get_code":{"code_sha256":"a8c1507b69fb2a97"}}],"record_sha256":"0c8613b74ca89e3322215fd2bc9b0effd55bc67611c79f2d1ea24a3f7405aab1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}