{"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/mutate","entry":"mutate","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":1,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":7,"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":2,"ran_fixture":1,"ran":1,"unverified":3},"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.21277","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-ceiling-exploring-the-potential","title":"Breaking the Ceiling: Exploring the Potential of Jailbreak Attacks through Expanding Strategy Space","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aries-iai/cl-gso","path":"generation.py","file_url":"https://github.com/aries-iai/cl-gso/blob/HEAD/generation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aries-iai/cl-gso when it was checked","code_sha256":"ca3a6ab91bde3118","code_sha256_prefix":"ca3a6ab91bde3118","mcp_get_code":{"code_sha256":"ca3a6ab91bde3118"}},{"arxiv_id":"2404.14829","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-neural-networks-for-continual","title":"Revisiting Neural Networks for Continual Learning: An Architectural Perspective","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byyx666/archcraft","path":"class_il/model_code.py","file_url":"https://github.com/byyx666/archcraft/blob/HEAD/class_il/model_code.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, byyx666/archcraft when it was checked","code_sha256":"371888147f2affb4","code_sha256_prefix":"371888147f2affb4","mcp_get_code":{"code_sha256":"371888147f2affb4"}},{"arxiv_id":"2404.14829","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-neural-networks-for-continual","title":"Revisiting Neural Networks for Continual Learning: An Architectural Perspective","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byyx666/archcraft","path":"task_il/model_code.py","file_url":"https://github.com/byyx666/archcraft/blob/HEAD/task_il/model_code.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, byyx666/archcraft when it was checked","code_sha256":"aa97e32681792f9f","code_sha256_prefix":"aa97e32681792f9f","mcp_get_code":{"code_sha256":"aa97e32681792f9f"}},{"arxiv_id":"2306.15006","arxiv_id_is_arxiv":true,"paper":"/paper/dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jerryji1993/dnabert","path":"SNP/mutate_seqs.py","file_url":"https://github.com/jerryji1993/dnabert/blob/HEAD/SNP/mutate_seqs.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":"97526e4fc5605ed7","code_sha256_prefix":"97526e4fc5605ed7","mcp_get_code":{"code_sha256":"97526e4fc5605ed7"}},{"arxiv_id":"2204.06765","arxiv_id_is_arxiv":true,"paper":"/paper/high-performance-evolutionary-algorithms-for","title":"High-performance Evolutionary Algorithms for Online Neuron Control","date":"2022-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"animadversio/actmax-optimizer-dev","path":"core/Optimizers.py","file_url":"https://github.com/animadversio/actmax-optimizer-dev/blob/HEAD/core/Optimizers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, animadversio/actmax-optimizer-dev when it was checked","code_sha256":"32564fbad862f4ae","code_sha256_prefix":"32564fbad862f4ae","mcp_get_code":{"code_sha256":"32564fbad862f4ae"}},{"arxiv_id":"2103.15692","arxiv_id_is_arxiv":true,"paper":"/paper/self-constructing-neural-networks-through","title":"Self-Constructing Neural Networks Through Random Mutation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SamuelSchmidgall/RandomMutationSearch","path":"random_mutation_search.py","file_url":"https://github.com/SamuelSchmidgall/RandomMutationSearch/blob/HEAD/random_mutation_search.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":"83bb09bb318a8a52","code_sha256_prefix":"83bb09bb318a8a52","mcp_get_code":{"code_sha256":"83bb09bb318a8a52"}},{"arxiv_id":"2006.04647","arxiv_id_is_arxiv":true,"paper":"/paper/neural-architecture-search-without-training","title":"Neural Architecture Search without Training","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlinc1905/evolutionary-reinforcement-learner","path":"utils.py","file_url":"https://github.com/nlinc1905/evolutionary-reinforcement-learner/blob/HEAD/utils.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":"91e7124a049d07e9","code_sha256_prefix":"91e7124a049d07e9","mcp_get_code":{"code_sha256":"91e7124a049d07e9"}}],"record_sha256":"0fa3b4ba316b20c4e2021c36664f1e0a1fdfffe0a66626f77fbbd7ed5bdd4829","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}