{"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/is-iterable","entry":"is_iterable","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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":13,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":10,"n_places":13,"n_places_pointer_only":3,"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":6,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2601.21702","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21702","title":"Beyond Forgetting: Machine Unlearning Elicits Controllable Side Behaviors and Capabilities","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"roeehendel/icl_task_vectors","path":"core/utils/nested.py","file_url":"https://github.com/roeehendel/icl_task_vectors/blob/HEAD/core/utils/nested.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, roeehendel/icl_task_vectors when it was checked","code_sha256":"3f3edc966733bda6","code_sha256_prefix":"3f3edc966733bda6","mcp_get_code":{"code_sha256":"3f3edc966733bda6"}},{"arxiv_id":"2507.12075","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.12075","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"raduangelescu/gutenbergpy","path":"gutenbergpy/orderedset.py","file_url":"https://github.com/raduangelescu/gutenbergpy/blob/HEAD/gutenbergpy/orderedset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8fe3d90cbc1825eb","code_sha256_prefix":"8fe3d90cbc1825eb","mcp_get_code":{"code_sha256":"8fe3d90cbc1825eb"}},{"arxiv_id":"2310.01807","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-compositional-and-symbolic","title":"Discrete, compositional, and symbolic representations through attractor dynamics","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrewnam/gfn_attractors","path":"src/gfn_attractors/misc/utils.py","file_url":"https://github.com/andrewnam/gfn_attractors/blob/HEAD/src/gfn_attractors/misc/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, andrewnam/gfn_attractors when it was checked","code_sha256":"0ca5b8c6d6c73ef3","code_sha256_prefix":"0ca5b8c6d6c73ef3","mcp_get_code":{"code_sha256":"0ca5b8c6d6c73ef3"}},{"arxiv_id":"2305.11175","arxiv_id_is_arxiv":true,"paper":"/paper/visionllm-large-language-model-is-also-an","title":"VisionLLM: Large Language Model is also an Open-Ended Decoder for Vision-Centric Tasks","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/visionllm","path":"VisionLLMv2/apex/apex/RNN/RNNBackend.py","file_url":"https://github.com/opengvlab/visionllm/blob/HEAD/VisionLLMv2/apex/apex/RNN/RNNBackend.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3c4be397437fd8e","code_sha256_prefix":"c3c4be397437fd8e","mcp_get_code":{"code_sha256":"c3c4be397437fd8e"}},{"arxiv_id":"2301.12260","arxiv_id_is_arxiv":true,"paper":"/paper/temporai-facilitating-machine-learning","title":"TemporAI: Facilitating Machine Learning Innovation in Time Domain Tasks for Medicine","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vanderschaarlab/temporai","path":"src/tempor/core/utils.py","file_url":"https://github.com/vanderschaarlab/temporai/blob/HEAD/src/tempor/core/utils.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":"414334dfe796fce7","code_sha256_prefix":"414334dfe796fce7","mcp_get_code":{"code_sha256":"414334dfe796fce7"}},{"arxiv_id":"2211.00677","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-domain-adaptation-for-cross","title":"Semi-Supervised Domain Adaptation for Cross-Survey Galaxy Morphology Classification and Anomaly Detection","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepskies/deepastrouda","path":"deep_astro_uda/apex/RNN/RNNBackend.py","file_url":"https://github.com/deepskies/deepastrouda/blob/HEAD/deep_astro_uda/apex/RNN/RNNBackend.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb684c9e5a6606f6","code_sha256_prefix":"bb684c9e5a6606f6","mcp_get_code":{"code_sha256":"bb684c9e5a6606f6"}},{"arxiv_id":"2210.01776","arxiv_id_is_arxiv":true,"paper":"/paper/diffdock-diffusion-steps-twists-and-turns-for","title":"DiffDock: Diffusion Steps, Twists, and Turns for Molecular Docking","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gcorso/diffdock","path":"utils/sampling.py","file_url":"https://github.com/gcorso/diffdock/blob/HEAD/utils/sampling.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7d1feb05f26a2576","code_sha256_prefix":"7d1feb05f26a2576","mcp_get_code":{"code_sha256":"7d1feb05f26a2576"}},{"arxiv_id":"2203.11815","arxiv_id_is_arxiv":true,"paper":"/paper/clustering-units-in-neural-networks-upstream","title":"Clustering units in neural networks: upstream vs downstream information","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wrongu/modularity","path":"util.py","file_url":"https://github.com/wrongu/modularity/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e777d089d7f9983f","code_sha256_prefix":"e777d089d7f9983f","mcp_get_code":{"code_sha256":"e777d089d7f9983f"}},{"arxiv_id":"2007.07606","arxiv_id_is_arxiv":true,"paper":"/paper/timexplain-a-framework-for-explaining-the","title":"timeXplain -- A Framework for Explaining the Predictions of Time Series Classifiers","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"loadingbyte/timexplain","path":"timexplain/_utils.py","file_url":"https://github.com/loadingbyte/timexplain/blob/HEAD/timexplain/_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":"8a166ad6dd2c90b6","code_sha256_prefix":"8a166ad6dd2c90b6","mcp_get_code":{"code_sha256":"8a166ad6dd2c90b6"}},{"arxiv_id":"1912.02781","arxiv_id_is_arxiv":true,"paper":"/paper/augmix-a-simple-data-processing-method-to","title":"AugMix: A Simple Data Processing Method to Improve Robustness and Uncertainty","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/augmentation-corruption","path":"experiments/overlap/augmentations/compositions.py","file_url":"https://github.com/facebookresearch/augmentation-corruption/blob/HEAD/experiments/overlap/augmentations/compositions.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9aea9a72f45f6831","code_sha256_prefix":"9aea9a72f45f6831","mcp_get_code":{"code_sha256":"9aea9a72f45f6831"}},{"arxiv_id":"1810.11702","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-common-knowledge-reinforcement","title":"Multi-Agent Common Knowledge Reinforcement Learning","date":"2018-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schroederdewitt/mackrl","path":"src/components/episode_buffer.py","file_url":"https://github.com/schroederdewitt/mackrl/blob/HEAD/src/components/episode_buffer.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":"e07d8c9a19bb5308","code_sha256_prefix":"e07d8c9a19bb5308","mcp_get_code":{"code_sha256":"e07d8c9a19bb5308"}},{"arxiv_id":"1609.03499","arxiv_id_is_arxiv":true,"paper":"/paper/wavenet-a-generative-model-for-raw-audio","title":"WaveNet: A Generative Model for Raw Audio","date":"2016-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"otosense/slang","path":"slang/snippers.py","file_url":"https://github.com/otosense/slang/blob/HEAD/slang/snippers.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":"d0e871c0709173b8","code_sha256_prefix":"d0e871c0709173b8","mcp_get_code":{"code_sha256":"d0e871c0709173b8"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsixta/jnet","path":"nets.py","file_url":"https://github.com/tsixta/jnet/blob/HEAD/nets.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tsixta/jnet when it was checked","code_sha256":"27cbda029ad7932e","code_sha256_prefix":"27cbda029ad7932e","mcp_get_code":{"code_sha256":"27cbda029ad7932e"}}],"record_sha256":"964b36106ac4993a8c4041ef7be748fc40ce9407e427da8519508a1340a0bd71","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}