{"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/mutation","entry":"mutation","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":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":2},"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.06904","arxiv_id_is_arxiv":true,"paper":"/paper/ecolang-efficient-and-effective-agent","title":"EcoLANG: Efficient and Effective Agent Communication Language Induction for Social Simulation","date":"2025-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xymou/EcoLANG","path":"code/diversification.py","file_url":"https://github.com/xymou/EcoLANG/blob/HEAD/code/diversification.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":"9015a77690edfb99","code_sha256_prefix":"9015a77690edfb99","mcp_get_code":{"code_sha256":"9015a77690edfb99"}},{"arxiv_id":"2305.14947","arxiv_id_is_arxiv":true,"paper":"/paper/how-predictable-are-large-language-model","title":"How Predictable Are Large Language Model Capabilities? A Case Study on BIG-bench","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/predicting-big-bench","path":"code/search/genetic_algorithm.py","file_url":"https://github.com/ink-usc/predicting-big-bench/blob/HEAD/code/search/genetic_algorithm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a2bfcf44ccd41c5","code_sha256_prefix":"1a2bfcf44ccd41c5","mcp_get_code":{"code_sha256":"1a2bfcf44ccd41c5"}},{"arxiv_id":"2009.02010","arxiv_id_is_arxiv":true,"paper":"/paper/confuciux-autonomous-hardware-resource","title":"ConfuciuX: Autonomous Hardware Resource Assignment for DNN Accelerators using Reinforcement Learning","date":"2020-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maestro-project/confuciux","path":"src/Other_Opts/other_opt_env.py","file_url":"https://github.com/maestro-project/confuciux/blob/HEAD/src/Other_Opts/other_opt_env.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":"66506442dd31d0e2","code_sha256_prefix":"66506442dd31d0e2","mcp_get_code":{"code_sha256":"66506442dd31d0e2"}},{"arxiv_id":"2003.00982","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liketheflower/jimmy_dgl","path":"python/dgl/graph.py","file_url":"https://github.com/liketheflower/jimmy_dgl/blob/HEAD/python/dgl/graph.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":"63102c67281002a7","code_sha256_prefix":"63102c67281002a7","mcp_get_code":{"code_sha256":"63102c67281002a7"}},{"arxiv_id":"1907.10804","arxiv_id_is_arxiv":true,"paper":"/paper/co-evolutionary-compression-for-unpaired","title":"Co-Evolutionary Compression for Unpaired Image Translation","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yehuitang/Pruning","path":"GAN-Pruning/GA.py","file_url":"https://github.com/yehuitang/Pruning/blob/HEAD/GAN-Pruning/GA.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yehuitang/Pruning when it was checked","code_sha256":"69c9e2133b343749","code_sha256_prefix":"69c9e2133b343749","mcp_get_code":{"code_sha256":"69c9e2133b343749"}},{"arxiv_id":"1804.02134","arxiv_id_is_arxiv":true,"paper":"/paper/population-based-de-novo-molecule-generation","title":"Population-based de novo molecule generation, using grammatical evolution","date":null,"month_inferred_from_arxiv_id":"2018-04","title_source":"archive","repo":"tsudalab/ChemGE","path":"optimize-J.py","file_url":"https://github.com/tsudalab/ChemGE/blob/HEAD/optimize-J.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"120efdb9fbf7ebd3","code_sha256_prefix":"120efdb9fbf7ebd3","mcp_get_code":{"code_sha256":"120efdb9fbf7ebd3"}}],"record_sha256":"d431c68e0ee45d1a9383d14a5e5ae290223bae02d3ffc3d2d24ce6ded19d9e43","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}