{"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/plot","entry":"plot","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":28,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":5,"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":28,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":5,"n_samples_unverified":14,"n_samples_fingerprinted":0,"n_places":29,"n_places_pointer_only":9,"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":4,"ran_fixture":1,"ran":9,"unverified":14},"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":"2603.12365","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-12365","title":"Optimal Experimental Design for Reliable Learning of History-Dependent Constitutive Laws","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"lcao11/constitutive_oed","path":"utils/visual.py","file_url":"https://github.com/lcao11/constitutive_oed/blob/HEAD/utils/visual.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":"c097f9010a4cfe95","code_sha256_prefix":"c097f9010a4cfe95","mcp_get_code":{"code_sha256":"c097f9010a4cfe95"}},{"arxiv_id":"2409.02135","arxiv_id_is_arxiv":true,"paper":"/paper/optimization-by-parallel-quasi-quantum","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuma-Ichikawa/QQA4CO","path":"src/qqa/bench.py","file_url":"https://github.com/Yuma-Ichikawa/QQA4CO/blob/HEAD/src/qqa/bench.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, Yuma-Ichikawa/QQA4CO, is not in the permissive set Syntology serves inline","code_sha256":"3544c5ae061d96ac","code_sha256_prefix":"3544c5ae061d96ac","mcp_get_code":{"code_sha256":"3544c5ae061d96ac"}},{"arxiv_id":"2405.10093","arxiv_id_is_arxiv":true,"paper":"/paper/lat-pfn-a-joint-embedding-predictive","title":"LaT-PFN: A Joint Embedding Predictive Architecture for In-context Time-series Forecasting","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stijnverdenius/lat-pfn","path":"util/metrics.py","file_url":"https://github.com/stijnverdenius/lat-pfn/blob/HEAD/util/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, stijnverdenius/lat-pfn, is not in the permissive set Syntology serves inline","code_sha256":"8ea068c039e9397f","code_sha256_prefix":"8ea068c039e9397f","mcp_get_code":{"code_sha256":"8ea068c039e9397f"}},{"arxiv_id":"2405.02421","arxiv_id_is_arxiv":true,"paper":"/paper/what-does-the-knowledge-neuron-thesis-have-to","title":"What does the Knowledge Neuron Thesis Have to do with Knowledge?","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frankniujc/kn_thesis","path":"kn_code/plot.py","file_url":"https://github.com/frankniujc/kn_thesis/blob/HEAD/kn_code/plot.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":"bd095a141719ae5d","code_sha256_prefix":"bd095a141719ae5d","mcp_get_code":{"code_sha256":"bd095a141719ae5d"}},{"arxiv_id":"2403.05751","arxiv_id_is_arxiv":true,"paper":"/paper/mg-tsd-multi-granularity-time-series","title":"MG-TSD: Multi-Granularity Time Series Diffusion Models with Guided Learning Process","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hundredl/MG-TSD","path":"src/utils.py","file_url":"https://github.com/Hundredl/MG-TSD/blob/HEAD/src/utils.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":"1c63d0cd11d2c9b7","code_sha256_prefix":"1c63d0cd11d2c9b7","mcp_get_code":{"code_sha256":"1c63d0cd11d2c9b7"}},{"arxiv_id":"2402.07762","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-structure-learning-for-sparse","title":"Scalable Structure Learning for Sparse Context-Specific Systems","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felixleopoldo/cslearn","path":"src/cslearn/cstree.py","file_url":"https://github.com/felixleopoldo/cslearn/blob/HEAD/src/cslearn/cstree.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":"b53c12e40a76de4d","code_sha256_prefix":"b53c12e40a76de4d","mcp_get_code":{"code_sha256":"b53c12e40a76de4d"}},{"arxiv_id":"2401.09870","arxiv_id_is_arxiv":true,"paper":"/paper/reconciling-spatial-and-temporal-abstractions","title":"Reconciling Spatial and Temporal Abstractions for Goal Representation","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosynus-lix/STAR","path":"plotting.py","file_url":"https://github.com/cosynus-lix/STAR/blob/HEAD/plotting.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, cosynus-lix/STAR when it was checked","code_sha256":"658b798591505f18","code_sha256_prefix":"658b798591505f18","mcp_get_code":{"code_sha256":"658b798591505f18"}},{"arxiv_id":"2401.08632","arxiv_id_is_arxiv":true,"paper":"/paper/synergizing-quality-diversity-with-descriptor","title":"Synergizing Quality-Diversity with Descriptor-Conditioned Reinforcement Learning","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"97d6a629daee3907","code_sha256_prefix":"97d6a629daee3907","mcp_get_code":{"code_sha256":"97d6a629daee3907"}},{"arxiv_id":"2401.08632","arxiv_id_is_arxiv":true,"paper":"/paper/synergizing-quality-diversity-with-descriptor","title":"Synergizing Quality-Diversity with Descriptor-Conditioned Reinforcement Learning","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adaptive-intelligent-robotics/dcg-map-elites","path":"analysis/plot_emitter_elites.py","file_url":"https://github.com/adaptive-intelligent-robotics/dcg-map-elites/blob/HEAD/analysis/plot_emitter_elites.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b780d3914be475f7","code_sha256_prefix":"b780d3914be475f7","mcp_get_code":{"code_sha256":"b780d3914be475f7"}},{"arxiv_id":"2210.00364","arxiv_id_is_arxiv":true,"paper":"/paper/dci-es-an-extended-disentanglement-framework","title":"DCI-ES: An Extended Disentanglement Framework with Connections to Identifiability","date":"2022-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iancovert/sage","path":"sage/plotting.py","file_url":"https://github.com/iancovert/sage/blob/HEAD/sage/plotting.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":"6b00515e5abb8eda","code_sha256_prefix":"6b00515e5abb8eda","mcp_get_code":{"code_sha256":"6b00515e5abb8eda"}},{"arxiv_id":"2206.08010","arxiv_id_is_arxiv":true,"paper":"/paper/modi-unconditional-motion-synthesis-from","title":"MoDi: Unconditional Motion Synthesis from Diverse Data","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sigal-raab/modi","path":"motion_class.py","file_url":"https://github.com/sigal-raab/modi/blob/HEAD/motion_class.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":"947e1b49a8d0fc68","code_sha256_prefix":"947e1b49a8d0fc68","mcp_get_code":{"code_sha256":"947e1b49a8d0fc68"}},{"arxiv_id":"2202.13001","arxiv_id_is_arxiv":true,"paper":"/paper/non-stationary-bandits-and-meta-learning-with","title":"Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms","date":"2022-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duongnhatthang/meta-bandit","path":"utils.py","file_url":"https://github.com/duongnhatthang/meta-bandit/blob/HEAD/utils.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":"6fb2f5d8dd058750","code_sha256_prefix":"6fb2f5d8dd058750","mcp_get_code":{"code_sha256":"6fb2f5d8dd058750"}},{"arxiv_id":"2202.03259","arxiv_id_is_arxiv":true,"paper":"/paper/theory-inspired-parameter-control-benchmarks","title":"Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caroladoerr/leadingonedac","path":"dacbench/plotting.py","file_url":"https://github.com/caroladoerr/leadingonedac/blob/HEAD/dacbench/plotting.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":"f13b5bc87dfdcf16","code_sha256_prefix":"f13b5bc87dfdcf16","mcp_get_code":{"code_sha256":"f13b5bc87dfdcf16"}},{"arxiv_id":"2112.10224","arxiv_id_is_arxiv":true,"paper":"/paper/stable-conformal-prediction-sets","title":"Stable Conformal Prediction Sets","date":"2021-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eugenendiaye/stable_conformal_prediction","path":"bench_stabCP/bench.py","file_url":"https://github.com/eugenendiaye/stable_conformal_prediction/blob/HEAD/bench_stabCP/bench.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, eugenendiaye/stable_conformal_prediction (NOASSERTION)","code_sha256":"f872f350ad5fa668","code_sha256_prefix":"f872f350ad5fa668","mcp_get_code":{"code_sha256":"f872f350ad5fa668"}},{"arxiv_id":"2109.12218","arxiv_id_is_arxiv":true,"paper":"/paper/long-range-transformers-for-dynamic","title":"Long-Range Transformers for Dynamic Spatiotemporal Forecasting","date":"2021-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qdata/spacetimeformer","path":"spacetimeformer/plot.py","file_url":"https://github.com/qdata/spacetimeformer/blob/HEAD/spacetimeformer/plot.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":"98c498131fbec7cb","code_sha256_prefix":"98c498131fbec7cb","mcp_get_code":{"code_sha256":"98c498131fbec7cb"}},{"arxiv_id":"2106.10121","arxiv_id_is_arxiv":true,"paper":"/paper/scoregrad-multivariate-probabilistic-time","title":"ScoreGrad: Multivariate Probabilistic Time Series Forecasting with Continuous Energy-based Generative Models","date":"2021-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yantijin/ScoreGradPred","path":"run_elec.py","file_url":"https://github.com/yantijin/ScoreGradPred/blob/HEAD/run_elec.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, yantijin/ScoreGradPred when it was checked","code_sha256":"2ba0838364c6d39e","code_sha256_prefix":"2ba0838364c6d39e","mcp_get_code":{"code_sha256":"2ba0838364c6d39e"}},{"arxiv_id":"2105.08541","arxiv_id_is_arxiv":true,"paper":"/paper/dacbench-a-benchmark-library-for-dynamic","title":"DACBench: A Benchmark Library for Dynamic Algorithm Configuration","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/DACBench","path":"dacbench/plotting.py","file_url":"https://github.com/automl/DACBench/blob/HEAD/dacbench/plotting.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":"5432f2deacd9aedd","code_sha256_prefix":"5432f2deacd9aedd","mcp_get_code":{"code_sha256":"5432f2deacd9aedd"}},{"arxiv_id":"2011.08105","arxiv_id_is_arxiv":true,"paper":"/paper/enforcing-robust-control-guarantees-within-1","title":"Enforcing robust control guarantees within neural network policies","date":"2020-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/robust-nn-control","path":"plots.py","file_url":"https://github.com/locuslab/robust-nn-control/blob/HEAD/plots.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":"e8f53684c815fb6c","code_sha256_prefix":"e8f53684c815fb6c","mcp_get_code":{"code_sha256":"e8f53684c815fb6c"}},{"arxiv_id":"2007.09070","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-discriminative-generative-training-via","title":"Hybrid Discriminative-Generative Training via Contrastive Learning","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhao499/HDGE","path":"utils.py","file_url":"https://github.com/lhao499/HDGE/blob/HEAD/utils.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":"cb06bf4914b94b48","code_sha256_prefix":"cb06bf4914b94b48","mcp_get_code":{"code_sha256":"cb06bf4914b94b48"}},{"arxiv_id":"1910.13466","arxiv_id_is_arxiv":true,"paper":"/paper/ordered-memory","title":"Ordered Memory","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/Ordered-Memory","path":"utils/hinton.py","file_url":"https://github.com/yikangshen/Ordered-Memory/blob/HEAD/utils/hinton.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":"78e2c02ecf09ade6","code_sha256_prefix":"78e2c02ecf09ade6","mcp_get_code":{"code_sha256":"78e2c02ecf09ade6"}},{"arxiv_id":"1909.02180","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-label-proportions-with","title":"Learning from Label Proportions with Generative Adversarial Networks","date":"2019-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liujiabin008/LLP-GAN","path":"good-llp-gan.py","file_url":"https://github.com/liujiabin008/LLP-GAN/blob/HEAD/good-llp-gan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, liujiabin008/LLP-GAN when it was checked","code_sha256":"72218f121ba80dbe","code_sha256_prefix":"72218f121ba80dbe","mcp_get_code":{"code_sha256":"72218f121ba80dbe"}},{"arxiv_id":"1906.06187","arxiv_id_is_arxiv":true,"paper":"/paper/nlprolog-reasoning-with-weak-unification-for-1","title":"NLProlog: Reasoning with Weak Unification for Question Answering in Natural Language","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonweber/nlprolog","path":"visualize_proof_tree.py","file_url":"https://github.com/leonweber/nlprolog/blob/HEAD/visualize_proof_tree.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":"b6a8a382d767df09","code_sha256_prefix":"b6a8a382d767df09","mcp_get_code":{"code_sha256":"b6a8a382d767df09"}},{"arxiv_id":"1902.09913","arxiv_id_is_arxiv":true,"paper":"/paper/hexagan-generative-adversarial-nets-for-real","title":"HexaGAN: Generative Adversarial Nets for Real World Classification","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shinyflight/HexaGAN","path":"train_mnist.py","file_url":"https://github.com/shinyflight/HexaGAN/blob/HEAD/train_mnist.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, shinyflight/HexaGAN (NOASSERTION)","code_sha256":"a5e607aa8f22733f","code_sha256_prefix":"a5e607aa8f22733f","mcp_get_code":{"code_sha256":"a5e607aa8f22733f"}},{"arxiv_id":"1811.12231","arxiv_id_is_arxiv":true,"paper":"/paper/imagenet-trained-cnns-are-biased-towards","title":"ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustness","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbuet2ner/local-global-features-cnn","path":"utils/utils.py","file_url":"https://github.com/mbuet2ner/local-global-features-cnn/blob/HEAD/utils/utils.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":"586aecacc7ce053c","code_sha256_prefix":"586aecacc7ce053c","mcp_get_code":{"code_sha256":"586aecacc7ce053c"}},{"arxiv_id":"1805.09190","arxiv_id_is_arxiv":true,"paper":"/paper/towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bethgelab/AnalysisBySynthesis","path":"abs_models/visualization.py","file_url":"https://github.com/bethgelab/AnalysisBySynthesis/blob/HEAD/abs_models/visualization.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":"16eefc701124af30","code_sha256_prefix":"16eefc701124af30","mcp_get_code":{"code_sha256":"16eefc701124af30"}},{"arxiv_id":"1711.02013","arxiv_id_is_arxiv":true,"paper":"/paper/neural-language-modeling-by-jointly-learning","title":"Neural Language Modeling by Jointly Learning Syntax and Lexicon","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nyu-mll/PRPN-Analysis","path":"hinton.py","file_url":"https://github.com/nyu-mll/PRPN-Analysis/blob/HEAD/hinton.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":"5cbbab8959d49215","code_sha256_prefix":"5cbbab8959d49215","mcp_get_code":{"code_sha256":"5cbbab8959d49215"}},{"arxiv_id":"1707.04191","arxiv_id_is_arxiv":true,"paper":"/paper/distributionally-ambiguous-optimization","title":"Distributionally Ambiguous Optimization Techniques for Batch Bayesian Optimization","date":"2017-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxfordcontrol/Bayesian-Optimization","path":"plot.py","file_url":"https://github.com/oxfordcontrol/Bayesian-Optimization/blob/HEAD/plot.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, oxfordcontrol/Bayesian-Optimization when it was checked","code_sha256":"70f1cd38147e7830","code_sha256_prefix":"70f1cd38147e7830","mcp_get_code":{"code_sha256":"70f1cd38147e7830"}},{"arxiv_id":"1504.04909","arxiv_id_is_arxiv":true,"paper":"/paper/illuminating-search-spaces-by-mapping-elites","title":"Illuminating search spaces by mapping elites","date":"2015-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adaptive-intelligent-robotics/DCRL-MAP-Elites","path":"analysis/plot_main.py","file_url":"https://github.com/adaptive-intelligent-robotics/DCRL-MAP-Elites/blob/HEAD/analysis/plot_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"97d6a629daee3907","code_sha256_prefix":"97d6a629daee3907","mcp_get_code":{"code_sha256":"97d6a629daee3907"}},{"arxiv_id":"aaai_20460","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20460","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"rpSebastian/AutoCFR","path":"autocfr/plot.py","file_url":"https://github.com/rpSebastian/AutoCFR/blob/HEAD/autocfr/plot.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":"5c207d2fd662541a","code_sha256_prefix":"5c207d2fd662541a","mcp_get_code":{"code_sha256":"5c207d2fd662541a"}}],"record_sha256":"f8581588727ffdb1fe730261486da4ae71b02ae49ebf3812086d742325b6e5d2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}