{"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/concat","entry":"concat","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":21,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":13,"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":19,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":5,"n_places":21,"n_places_pointer_only":6,"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":5,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":7,"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":"2605.07950","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07950","title":"Slowly Annealed Langevin Dynamics: Theory and Applications to Training-Free Guided Generation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anitan0925/sald","path":"sald_FM_SD35/utils.py","file_url":"https://github.com/anitan0925/sald/blob/HEAD/sald_FM_SD35/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e585cbedd3948725","code_sha256_prefix":"e585cbedd3948725","mcp_get_code":{"code_sha256":"e585cbedd3948725"}},{"arxiv_id":"2603.03292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03292","title":"From Conflict to Consensus: Boosting Medical Reasoning via Multi-Round Agentic RAG","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"NJU-RL/MA-RAG","path":"microservice/RetrievalSystem.py","file_url":"https://github.com/NJU-RL/MA-RAG/blob/HEAD/microservice/RetrievalSystem.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, NJU-RL/MA-RAG when it was checked","code_sha256":"fe2a7acec318d635","code_sha256_prefix":"fe2a7acec318d635","mcp_get_code":{"code_sha256":"fe2a7acec318d635"}},{"arxiv_id":"2602.03811","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03811","title":"Progressive Checkerboards for Autoregressive Multiscale Image Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"deigen/checkerboardgen","path":"cbgen/checkerboard.py","file_url":"https://github.com/deigen/checkerboardgen/blob/HEAD/cbgen/checkerboard.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74dcbee2e50bcf44","code_sha256_prefix":"74dcbee2e50bcf44","mcp_get_code":{"code_sha256":"74dcbee2e50bcf44"}},{"arxiv_id":"2509.22307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-22307","title":"Johnson-Lindenstrauss Lemma Guided Network for Efficient 3D Medical Segmentation","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"JinPLu/VeloxSeg","path":"model/VeloxSeg.py","file_url":"https://github.com/JinPLu/VeloxSeg/blob/HEAD/model/VeloxSeg.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, JinPLu/VeloxSeg when it was checked","code_sha256":"4ea4b62981b4a22c","code_sha256_prefix":"4ea4b62981b4a22c","mcp_get_code":{"code_sha256":"4ea4b62981b4a22c"}},{"arxiv_id":"2502.09507","arxiv_id_is_arxiv":true,"paper":"/paper/when-and-how-does-clip-enable-domain-and","title":"When and How Does CLIP Enable Domain and Compositional Generalization?","date":"2025-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ndif-team/nnsight","path":"src/nnsight/intervention/batching.py","file_url":"https://github.com/ndif-team/nnsight/blob/HEAD/src/nnsight/intervention/batching.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":"4426e27aa118f08d","code_sha256_prefix":"4426e27aa118f08d","mcp_get_code":{"code_sha256":"4426e27aa118f08d"}},{"arxiv_id":"2407.14561","arxiv_id_is_arxiv":true,"paper":"/paper/nnsight-and-ndif-democratizing-access-to","title":"NNsight and NDIF: Democratizing Access to Open-Weight Foundation Model Internals","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jadenfiotto-kaufman/nnsight","path":"src/nnsight/intervention/batching.py","file_url":"https://github.com/jadenfiotto-kaufman/nnsight/blob/HEAD/src/nnsight/intervention/batching.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":"4426e27aa118f08d","code_sha256_prefix":"4426e27aa118f08d","mcp_get_code":{"code_sha256":"4426e27aa118f08d"}},{"arxiv_id":"2404.10688","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-conditional-diffusion-model-with","title":"Efficient Conditional Diffusion Model with Probability Flow Sampling for Image Super-resolution","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuan-Yutao/ECDP","path":"lib/model/ecdp.py","file_url":"https://github.com/Yuan-Yutao/ECDP/blob/HEAD/lib/model/ecdp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Yuan-Yutao/ECDP when it was checked","code_sha256":"7fa14c14a6bd9c3d","code_sha256_prefix":"7fa14c14a6bd9c3d","mcp_get_code":{"code_sha256":"7fa14c14a6bd9c3d"}},{"arxiv_id":"2402.13178","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-retrieval-augmented-generation","title":"Benchmarking Retrieval-Augmented Generation for Medicine","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teddy-xionggz/medrag","path":"src/utils.py","file_url":"https://github.com/teddy-xionggz/medrag/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, teddy-xionggz/medrag when it was checked","code_sha256":"fe2a7acec318d635","code_sha256_prefix":"fe2a7acec318d635","mcp_get_code":{"code_sha256":"fe2a7acec318d635"}},{"arxiv_id":"2204.12386","arxiv_id_is_arxiv":true,"paper":"/paper/learning-meta-word-embeddings-by-unsupervised-1","title":"Learning Meta Word Embeddings by Unsupervised Weighted Concatenation of Source Embeddings","date":"2022-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LivNLP/meta-concat","path":"concat.py","file_url":"https://github.com/LivNLP/meta-concat/blob/HEAD/concat.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":"8db0f90df651de66","code_sha256_prefix":"8db0f90df651de66","mcp_get_code":{"code_sha256":"8db0f90df651de66"}},{"arxiv_id":"2204.09092","arxiv_id_is_arxiv":true,"paper":"/paper/indiscriminate-data-poisoning-attacks-on","title":"Indiscriminate Data Poisoning Attacks on Neural Networks","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"watml/tgda-attack","path":"utils.py","file_url":"https://github.com/watml/tgda-attack/blob/HEAD/utils.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":"cc489bfd1fb0f0d4","code_sha256_prefix":"cc489bfd1fb0f0d4","mcp_get_code":{"code_sha256":"cc489bfd1fb0f0d4"}},{"arxiv_id":"2107.01876","arxiv_id_is_arxiv":true,"paper":"/paper/causally-invariant-predictor-with-shift","title":"Which Invariance Should We Transfer? A Causal Minimax Learning Approach","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmz123321/which_invariance","path":"findoptset/findoptset.py","file_url":"https://github.com/lmz123321/which_invariance/blob/HEAD/findoptset/findoptset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33d995585c147c9b","code_sha256_prefix":"33d995585c147c9b","mcp_get_code":{"code_sha256":"33d995585c147c9b"}},{"arxiv_id":"2104.03220","arxiv_id_is_arxiv":true,"paper":"/paper/doubleml-an-object-oriented-implementation-of-1","title":"DoubleML -- An Object-Oriented Implementation of Double Machine Learning in Python","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoubleML/doubleml-for-py","path":"doubleml/double_ml_framework.py","file_url":"https://github.com/DoubleML/doubleml-for-py/blob/HEAD/doubleml/double_ml_framework.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d89c2e14f935d16b","code_sha256_prefix":"d89c2e14f935d16b","mcp_get_code":{"code_sha256":"d89c2e14f935d16b"}},{"arxiv_id":"2010.16417","arxiv_id_is_arxiv":true,"paper":"/paper/michigan-multi-input-conditioned-hair-image","title":"MichiGAN: Multi-Input-Conditioned Hair Image Generation for Portrait Editing","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tzt101/MichiGAN","path":"models/networks/generator.py","file_url":"https://github.com/tzt101/MichiGAN/blob/HEAD/models/networks/generator.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":"a3db41dad9292ecb","code_sha256_prefix":"a3db41dad9292ecb","mcp_get_code":{"code_sha256":"a3db41dad9292ecb"}},{"arxiv_id":"2003.02546","arxiv_id_is_arxiv":true,"paper":"/paper/embedding-expansion-augmentation-in-embedding","title":"Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learning","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"puneesh00/loop","path":"loss/embedding_aug_mx.py","file_url":"https://github.com/puneesh00/loop/blob/HEAD/loss/embedding_aug_mx.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":"a645a2dfd75685c5","code_sha256_prefix":"a645a2dfd75685c5","mcp_get_code":{"code_sha256":"a645a2dfd75685c5"}},{"arxiv_id":"1909.01736","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-human-level-accuracy-computational","title":"Beyond Human-Level Accuracy: Computational Challenges in Deep Learning","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baidu-research/catamount","path":"catamount/api/ops.py","file_url":"https://github.com/baidu-research/catamount/blob/HEAD/catamount/api/ops.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":"80e960c88c6fcddf","code_sha256_prefix":"80e960c88c6fcddf","mcp_get_code":{"code_sha256":"80e960c88c6fcddf"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adammenges/DARTS-PyTorch","path":"cnn/arch.py","file_url":"https://github.com/adammenges/DARTS-PyTorch/blob/HEAD/cnn/arch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94df8664a92747e5","code_sha256_prefix":"94df8664a92747e5","mcp_get_code":{"code_sha256":"94df8664a92747e5"}},{"arxiv_id":"1806.01261","arxiv_id_is_arxiv":true,"paper":"/paper/relational-inductive-biases-deep-learning-and","title":"Relational inductive biases, deep learning, and graph networks","date":"2018-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mylonasc/tf-gnns","path":"tf_gnns/backend_ops.py","file_url":"https://github.com/mylonasc/tf-gnns/blob/HEAD/tf_gnns/backend_ops.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":"b433f1f94987c049","code_sha256_prefix":"b433f1f94987c049","mcp_get_code":{"code_sha256":"b433f1f94987c049"}},{"arxiv_id":"1707.01495","arxiv_id_is_arxiv":true,"paper":"/paper/hindsight-experience-replay","title":"Hindsight Experience Replay","date":"2017-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bacdavid/HER","path":"hindsight_experience.py","file_url":"https://github.com/bacdavid/HER/blob/HEAD/hindsight_experience.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, bacdavid/HER when it was checked","code_sha256":"f616d3cbede3329d","code_sha256_prefix":"f616d3cbede3329d","mcp_get_code":{"code_sha256":"f616d3cbede3329d"}},{"arxiv_id":"1703.05921","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-anomaly-detection-with","title":"Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeeDoYup/AnoGAN","path":"ops.py","file_url":"https://github.com/LeeDoYup/AnoGAN/blob/HEAD/ops.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":"6758e6e7c8eb29d4","code_sha256_prefix":"6758e6e7c8eb29d4","mcp_get_code":{"code_sha256":"6758e6e7c8eb29d4"}},{"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":"ChengBinJin/U-Net-TensorFlow","path":"src/model.py","file_url":"https://github.com/ChengBinJin/U-Net-TensorFlow/blob/HEAD/src/model.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, ChengBinJin/U-Net-TensorFlow when it was checked","code_sha256":"ace1773da4b6e3fd","code_sha256_prefix":"ace1773da4b6e3fd","mcp_get_code":{"code_sha256":"ace1773da4b6e3fd"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piyush2896/CNN-Text-Classifier","path":"nn/layers.py","file_url":"https://github.com/piyush2896/CNN-Text-Classifier/blob/HEAD/nn/layers.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":"4df1c013c4cd5872","code_sha256_prefix":"4df1c013c4cd5872","mcp_get_code":{"code_sha256":"4df1c013c4cd5872"}}],"record_sha256":"53d9e530b263fef558a7a97ec4d399a3d8a31da03fd8d84fd1bbf8f64e3f34b6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}