{"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/gen-graph","entry":"gen_graph","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":6,"n_papers_ran":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":9,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":7},"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":"2505.21825","paper":"/paper/let-me-think-a-long-chain-of-thought-can-be","title":"Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seyedparsa/let-me-think","path":"utils.py","file_url":"https://github.com/seyedparsa/let-me-think/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7896ef51724bf4e8","mcp_get_code":{"code_sha256":"7896ef51724bf4e8"}},{"arxiv_id":"2406.06954","paper":"/paper/distributional-miplib-a-multi-domain-library","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amf272/Distributional-MIPLIB-Generators","path":"MVC/generator_MVC.py","file_url":"https://github.com/amf272/Distributional-MIPLIB-Generators/blob/HEAD/MVC/generator_MVC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e7b2fffe89e8142","mcp_get_code":{"code_sha256":"0e7b2fffe89e8142"}},{"arxiv_id":"2310.00526","paper":"/paper/are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"penlu/bespoke-gnn4do","path":"utils/graph_utils.py","file_url":"https://github.com/penlu/bespoke-gnn4do/blob/HEAD/utils/graph_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f902914db1ae1dbd","mcp_get_code":{"code_sha256":"f902914db1ae1dbd"}},{"arxiv_id":"2306.09595","paper":"/paper/structured-cooperative-learning-with","title":"Structured Cooperative Learning with Graphical Model Priors","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuangtongli/scool","path":"SCooL_SBM.py","file_url":"https://github.com/shuangtongli/scool/blob/HEAD/SCooL_SBM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"3b4d375bb85e7531","mcp_get_code":{"code_sha256":"3b4d375bb85e7531"}},{"arxiv_id":"2006.06936","paper":"/paper/does-unsupervised-architecture-representation","title":"Does Unsupervised Architecture Representation Learning Help Neural Architecture Search?","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MSU-MLSys-Lab/arch2vec","path":"plot_scripts/try_networkx.py","file_url":"https://github.com/MSU-MLSys-Lab/arch2vec/blob/HEAD/plot_scripts/try_networkx.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bcb71528933a9cb0","mcp_get_code":{"code_sha256":"bcb71528933a9cb0"}},{"arxiv_id":"1809.03359","paper":"/paper/improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qcappart/learning-DD","path":"models/maxcut-random/maxcut_evaluate_random.py","file_url":"https://github.com/qcappart/learning-DD/blob/HEAD/models/maxcut-random/maxcut_evaluate_random.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4cd96863cafcc86","mcp_get_code":{"code_sha256":"a4cd96863cafcc86"}},{"arxiv_id":"1809.03359","paper":"/paper/improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qcappart/learning-DD","path":"models/maxcut-random/maxcut_training_random.py","file_url":"https://github.com/qcappart/learning-DD/blob/HEAD/models/maxcut-random/maxcut_training_random.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5e678f6a42649c6","mcp_get_code":{"code_sha256":"a5e678f6a42649c6"}},{"arxiv_id":"1809.03359","paper":"/paper/improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qcappart/learning-DD","path":"models/misp-random/misp_evaluate_random.py","file_url":"https://github.com/qcappart/learning-DD/blob/HEAD/models/misp-random/misp_evaluate_random.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5fdc258ef71d62ec","mcp_get_code":{"code_sha256":"5fdc258ef71d62ec"}},{"arxiv_id":"1809.03359","paper":"/paper/improving-optimization-bounds-using-machine","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","date":"2018-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qcappart/learning-DD","path":"models/misp-random/misp_training_random.py","file_url":"https://github.com/qcappart/learning-DD/blob/HEAD/models/misp-random/misp_training_random.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9e9b108b5510419c","mcp_get_code":{"code_sha256":"9e9b108b5510419c"}}]}