{"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/new-optimizer-config","entry":"new_optimizer_config","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":5,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":0},"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":"2405.19121","paper":"/paper/spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigeisler/s2gnn","path":"main_tpugraphs.py","file_url":"https://github.com/sigeisler/s2gnn/blob/HEAD/main_tpugraphs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"398db63189d345b3","mcp_get_code":{"code_sha256":"398db63189d345b3"}},{"arxiv_id":"2405.11951","paper":"/paper/distinguished-in-uniform-self-attention-vs","title":"Distinguished In Uniform: Self Attention Vs. Virtual Nodes","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toenshoff/vn-vs-gt","path":"custom_test_cor44.py","file_url":"https://github.com/toenshoff/vn-vs-gt/blob/HEAD/custom_test_cor44.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"585566394225e457","mcp_get_code":{"code_sha256":"585566394225e457"}},{"arxiv_id":"2404.03380","paper":"/paper/on-the-theoretical-expressive-power-and-the","title":"On the Theoretical Expressive Power and the Design Space of Higher-Order Graph Transformers","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/k-transformer","path":"train_count_substructure.py","file_url":"https://github.com/zhouc20/k-transformer/blob/HEAD/train_count_substructure.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"585566394225e457","mcp_get_code":{"code_sha256":"585566394225e457"}},{"arxiv_id":"2402.02518","paper":"/paper/latent-graph-diffusion-a-unified-framework","title":"Unifying Generation and Prediction on Graphs with Latent Graph Diffusion","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/latentgraphdiffusion","path":"pretrain.py","file_url":"https://github.com/zhouc20/latentgraphdiffusion/blob/HEAD/pretrain.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"585566394225e457","mcp_get_code":{"code_sha256":"585566394225e457"}},{"arxiv_id":"2305.12322","paper":"/paper/learning-large-graph-property-prediction-via","title":"Learning Large Graph Property Prediction via Graph Segment Training","date":"2023-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaidic/gst","path":"main_tpugraphs.py","file_url":"https://github.com/kaidic/gst/blob/HEAD/main_tpugraphs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"585566394225e457","mcp_get_code":{"code_sha256":"585566394225e457"}}]}