{"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/gen-graph","entry":"gen_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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":9,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2505.21825","arxiv_id_is_arxiv":true,"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":"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":"7896ef51724bf4e8","code_sha256_prefix":"7896ef51724bf4e8","mcp_get_code":{"code_sha256":"7896ef51724bf4e8"}},{"arxiv_id":"2406.06954","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e7b2fffe89e8142","code_sha256_prefix":"0e7b2fffe89e8142","mcp_get_code":{"code_sha256":"0e7b2fffe89e8142"}},{"arxiv_id":"2310.00526","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, penlu/bespoke-gnn4do when it was checked","code_sha256":"f902914db1ae1dbd","code_sha256_prefix":"f902914db1ae1dbd","mcp_get_code":{"code_sha256":"f902914db1ae1dbd"}},{"arxiv_id":"2306.09595","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, shuangtongli/scool, is not in the permissive set Syntology serves inline","code_sha256":"3b4d375bb85e7531","code_sha256_prefix":"3b4d375bb85e7531","mcp_get_code":{"code_sha256":"3b4d375bb85e7531"}},{"arxiv_id":"2006.06936","arxiv_id_is_arxiv":true,"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":"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":"bcb71528933a9cb0","code_sha256_prefix":"bcb71528933a9cb0","mcp_get_code":{"code_sha256":"bcb71528933a9cb0"}},{"arxiv_id":"1809.03359","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a4cd96863cafcc86","code_sha256_prefix":"a4cd96863cafcc86","mcp_get_code":{"code_sha256":"a4cd96863cafcc86"}},{"arxiv_id":"1809.03359","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5e678f6a42649c6","code_sha256_prefix":"a5e678f6a42649c6","mcp_get_code":{"code_sha256":"a5e678f6a42649c6"}},{"arxiv_id":"1809.03359","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5fdc258ef71d62ec","code_sha256_prefix":"5fdc258ef71d62ec","mcp_get_code":{"code_sha256":"5fdc258ef71d62ec"}},{"arxiv_id":"1809.03359","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e9b108b5510419c","code_sha256_prefix":"9e9b108b5510419c","mcp_get_code":{"code_sha256":"9e9b108b5510419c"}}],"record_sha256":"0d70826b7b63056bee31ac478fccdbc8c1dd5b5c85457b969e121f3ef321cddd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}