{"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/validation","entry":"validation","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":15,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":17,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":10,"n_samples_fingerprinted":0,"n_places":19,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":10},"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":"2501.05906","arxiv_id_is_arxiv":true,"paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"mol_pretrain.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/mol_pretrain.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":"ff838c924b39c15f","code_sha256_prefix":"ff838c924b39c15f","mcp_get_code":{"code_sha256":"ff838c924b39c15f"}},{"arxiv_id":"2501.05906","arxiv_id_is_arxiv":true,"paper":"/paper/q-maml-quantum-model-agnostic-meta-learning","title":"Q-MAML: Quantum Model-Agnostic Meta-Learning for Variational Quantum Algorithms","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JayC1208/Q-MAML","path":"xyz_pretrain.py","file_url":"https://github.com/JayC1208/Q-MAML/blob/HEAD/xyz_pretrain.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":"7e39ffd238e68366","code_sha256_prefix":"7e39ffd238e68366","mcp_get_code":{"code_sha256":"7e39ffd238e68366"}},{"arxiv_id":"2402.10426","arxiv_id_is_arxiv":true,"paper":"/paper/dell-generating-reactions-and-explanations","title":"DELL: Generating Reactions and Explanations for LLM-Based Misinformation Detection","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whr000001/dell","path":"expert/inference.py","file_url":"https://github.com/whr000001/dell/blob/HEAD/expert/inference.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":"4d861dde8c1140a8","code_sha256_prefix":"4d861dde8c1140a8","mcp_get_code":{"code_sha256":"4d861dde8c1140a8"}},{"arxiv_id":"2306.09264","arxiv_id_is_arxiv":true,"paper":"/paper/harvard-glaucoma-fairness-a-retinal-nerve","title":"Harvard Glaucoma Fairness: A Retinal Nerve Disease Dataset for Fairness Learning and Fair Identity Normalization","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luoyan407/harvard-gf","path":"train_glaucoma_fair.py","file_url":"https://github.com/luoyan407/harvard-gf/blob/HEAD/train_glaucoma_fair.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":"0bac398df33d448d","code_sha256_prefix":"0bac398df33d448d","mcp_get_code":{"code_sha256":"0bac398df33d448d"}},{"arxiv_id":"2303.11329","arxiv_id_is_arxiv":true,"paper":"/paper/sound-localization-from-motion-jointly","title":"Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/SLfM","path":"slfm/main_audio.py","file_url":"https://github.com/IFICL/SLfM/blob/HEAD/slfm/main_audio.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":"86a4e8ccd2e033b5","code_sha256_prefix":"86a4e8ccd2e033b5","mcp_get_code":{"code_sha256":"86a4e8ccd2e033b5"}},{"arxiv_id":"2303.11329","arxiv_id_is_arxiv":true,"paper":"/paper/sound-localization-from-motion-jointly","title":"Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/SLfM","path":"slfm/main_camera.py","file_url":"https://github.com/IFICL/SLfM/blob/HEAD/slfm/main_camera.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":"e001d7497056ed09","code_sha256_prefix":"e001d7497056ed09","mcp_get_code":{"code_sha256":"e001d7497056ed09"}},{"arxiv_id":"2301.12307","arxiv_id_is_arxiv":true,"paper":"/paper/mqag-multiple-choice-question-answering-and","title":"MQAG: Multiple-choice Question Answering and Generation for Assessing Information Consistency in Summarization","date":"2023-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"potsawee/mqag0","path":"train_generation_qa.py","file_url":"https://github.com/potsawee/mqag0/blob/HEAD/train_generation_qa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ae113683c7bcf65","code_sha256_prefix":"5ae113683c7bcf65","mcp_get_code":{"code_sha256":"5ae113683c7bcf65"}},{"arxiv_id":"2206.03393","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-and-mitigating-audio","title":"Towards Understanding and Mitigating Audio Adversarial Examples for Speaker Recognition","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"speakerguard/speakerguard","path":"adver_train.py","file_url":"https://github.com/speakerguard/speakerguard/blob/HEAD/adver_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, speakerguard/speakerguard when it was checked","code_sha256":"3e93d5999c91a2cb","code_sha256_prefix":"3e93d5999c91a2cb","mcp_get_code":{"code_sha256":"3e93d5999c91a2cb"}},{"arxiv_id":"2202.05167","arxiv_id_is_arxiv":true,"paper":"/paper/class-distance-weighted-cross-entropy-loss","title":"Class Distance Weighted Cross-Entropy Loss for Ulcerative Colitis Severity Estimation","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GorkemP/labeled-images-for-ulcerative-colitis","path":"train_classification_model_CV.py","file_url":"https://github.com/GorkemP/labeled-images-for-ulcerative-colitis/blob/HEAD/train_classification_model_CV.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":"6aed499775adb9c6","code_sha256_prefix":"6aed499775adb9c6","mcp_get_code":{"code_sha256":"6aed499775adb9c6"}},{"arxiv_id":"2111.05846","arxiv_id_is_arxiv":true,"paper":"/paper/structure-from-silence-learning-scene","title":"Structure from Silence: Learning Scene Structure from Ambient Sound","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/structure-from-silence","path":"main_lincls.py","file_url":"https://github.com/IFICL/structure-from-silence/blob/HEAD/main_lincls.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":"9dc949aa0bce60ae","code_sha256_prefix":"9dc949aa0bce60ae","mcp_get_code":{"code_sha256":"9dc949aa0bce60ae"}},{"arxiv_id":"2108.12510","arxiv_id_is_arxiv":true,"paper":"/paper/pulling-up-by-the-causal-bootstraps-causal","title":"Pulling Up by the Causal Bootstraps: Causal Data Augmentation for Pre-training Debiasing","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MLforHealth/CausalDA","path":"src/validation.py","file_url":"https://github.com/MLforHealth/CausalDA/blob/HEAD/src/validation.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":"85d5efbf0175a369","code_sha256_prefix":"85d5efbf0175a369","mcp_get_code":{"code_sha256":"85d5efbf0175a369"}},{"arxiv_id":"2008.05660","arxiv_id_is_arxiv":true,"paper":"/paper/imitating-unknown-policies-via-exploration","title":"Imitating Unknown Policies via Exploration","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"5c68d61a253a334d","code_sha256_prefix":"5c68d61a253a334d","mcp_get_code":{"code_sha256":"5c68d61a253a334d"}},{"arxiv_id":"2008.05660","arxiv_id_is_arxiv":true,"paper":"/paper/imitating-unknown-policies-via-exploration","title":"Imitating Unknown Policies via Exploration","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a90673e1d18b15a3","code_sha256_prefix":"a90673e1d18b15a3","mcp_get_code":{"code_sha256":"a90673e1d18b15a3"}},{"arxiv_id":"2005.13899","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-for-automatic-pneumonia","title":"Deep Learning for Automatic Pneumonia Detection","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tatigabru/kaggle-rsna","path":"src/train_runner.py","file_url":"https://github.com/tatigabru/kaggle-rsna/blob/HEAD/src/train_runner.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":"7286ed34a1332306","code_sha256_prefix":"7286ed34a1332306","mcp_get_code":{"code_sha256":"7286ed34a1332306"}},{"arxiv_id":"1808.10122","arxiv_id_is_arxiv":true,"paper":"/paper/learning-neural-templates-for-text-generation","title":"Learning Neural Templates for Text Generation","date":"2018-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TobeyYang/S2S_Temp","path":"gan.py","file_url":"https://github.com/TobeyYang/S2S_Temp/blob/HEAD/gan.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":"78be13a6d800db69","code_sha256_prefix":"78be13a6d800db69","mcp_get_code":{"code_sha256":"78be13a6d800db69"}},{"arxiv_id":"1805.01954","arxiv_id_is_arxiv":true,"paper":"/paper/behavioral-cloning-from-observation","title":"Behavioral Cloning from Observation","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NathanGavenski/IUPE","path":"models/policy.py","file_url":"https://github.com/NathanGavenski/IUPE/blob/HEAD/models/policy.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c68d61a253a334d","code_sha256_prefix":"5c68d61a253a334d","mcp_get_code":{"code_sha256":"5c68d61a253a334d"}},{"arxiv_id":"1805.01954","arxiv_id_is_arxiv":true,"paper":"/paper/behavioral-cloning-from-observation","title":"Behavioral Cloning from Observation","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NathanGavenski/IUPE","path":"models/idm.py","file_url":"https://github.com/NathanGavenski/IUPE/blob/HEAD/models/idm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a90673e1d18b15a3","code_sha256_prefix":"a90673e1d18b15a3","mcp_get_code":{"code_sha256":"a90673e1d18b15a3"}},{"arxiv_id":"1709.01507","arxiv_id_is_arxiv":true,"paper":"/paper/squeeze-and-excitation-networks","title":"Squeeze-and-Excitation Networks","date":"2017-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mhorton19/CNN-Kernel-Attention","path":"dot_product_generated_kernel_cnn.py","file_url":"https://github.com/mhorton19/CNN-Kernel-Attention/blob/HEAD/dot_product_generated_kernel_cnn.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, mhorton19/CNN-Kernel-Attention when it was checked","code_sha256":"c55fc48c6a7bd00e","code_sha256_prefix":"c55fc48c6a7bd00e","mcp_get_code":{"code_sha256":"c55fc48c6a7bd00e"}},{"arxiv_id":"1507.00677","arxiv_id_is_arxiv":true,"paper":"/paper/distributional-smoothing-with-virtual","title":"Distributional Smoothing with Virtual Adversarial Training","date":"2015-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ciolo/Sentiment-Analisys","path":"train_and_evaluate.py","file_url":"https://github.com/ciolo/Sentiment-Analisys/blob/HEAD/train_and_evaluate.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":"37add9083e98f27a","code_sha256_prefix":"37add9083e98f27a","mcp_get_code":{"code_sha256":"37add9083e98f27a"}}],"record_sha256":"203ad9bba14dfc2bd27c7a38dd2c8ea3778949c28a794974909d689aba06f7cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}