{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/generate-data","entry":"generate_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":66,"n_papers_ran":32,"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":74,"n_samples_ran":36,"n_samples_fingerprinted":8,"n_places":76,"n_places_pointer_only":27,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":17,"ran_fixture":1,"ran":17,"unverified":38},"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":"2608.10470","paper":"/paper/arxiv-2608-10470","title":"A Joint-Distribution Route to Fair Representations with Continuous Sensitive Attributes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Yijin911/FRHSIC","path":"experiments/ablation.py","file_url":"https://github.com/Yijin911/FRHSIC/blob/HEAD/experiments/ablation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8617eb9e57635918","mcp_get_code":{"code_sha256":"8617eb9e57635918"}},{"arxiv_id":"2608.10470","paper":"/paper/arxiv-2608-10470","title":"A Joint-Distribution Route to Fair Representations with Continuous Sensitive Attributes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Yijin911/FRHSIC","path":"experiments/convergence.py","file_url":"https://github.com/Yijin911/FRHSIC/blob/HEAD/experiments/convergence.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"114b0dfd5a60edf2","mcp_get_code":{"code_sha256":"114b0dfd5a60edf2"}},{"arxiv_id":"2605.27281","paper":"/paper/arxiv-2605-27281","title":"Causal Risk Minimization for High-Dimensional Treatments","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"nikitadhawan/causal-risk-minimization","path":"src/toy_gaussian.py","file_url":"https://github.com/nikitadhawan/causal-risk-minimization/blob/HEAD/src/toy_gaussian.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a28e743322d5ccc","mcp_get_code":{"code_sha256":"8a28e743322d5ccc"}},{"arxiv_id":"2604.20161","paper":"/paper/arxiv-2604-20161","title":"SMART: A Spectral Transfer Approach to Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"boxinz17/smart","path":"smart/smart/utils.py","file_url":"https://github.com/boxinz17/smart/blob/HEAD/smart/smart/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42cf52dc429d354f","mcp_get_code":{"code_sha256":"42cf52dc429d354f"}},{"arxiv_id":"2603.06826","paper":"/paper/arxiv-2603-06826","title":"CREDO: Epistemic-Aware Conformalized Credal Envelopes for Regression","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Monoxido45/CREDO","path":"comparisons/helper.py","file_url":"https://github.com/Monoxido45/CREDO/blob/HEAD/comparisons/helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91173f35dc520a93","mcp_get_code":{"code_sha256":"91173f35dc520a93"}},{"arxiv_id":"2601.22029","paper":"/paper/arxiv-2601-22029","title":"The Ensemble Inverse Problem: Applications and Methods","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"ZhengyanHuan/The-Ensemble-Inverse-Problem--Applications-and-Methods","path":"Sec3p2/dataset.py","file_url":"https://github.com/ZhengyanHuan/The-Ensemble-Inverse-Problem--Applications-and-Methods/blob/HEAD/Sec3p2/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"537c31adc165dffa","mcp_get_code":{"code_sha256":"537c31adc165dffa"}},{"arxiv_id":"2601.18546","paper":"/paper/arxiv-2601-18546","title":"Information Hidden in Gradients of Regression with Target Noise","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"edahelsinki/noisy_targets","path":"notes/utils.py","file_url":"https://github.com/edahelsinki/noisy_targets/blob/HEAD/notes/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f30a106451e1487e","mcp_get_code":{"code_sha256":"f30a106451e1487e"}},{"arxiv_id":"2601.15500","paper":"/paper/arxiv-2601-15500","title":"Low-Dimensional Adaptation of Rectified Flow: A Diffusion and Stochastic Localization Perspective","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"roysaptaumich/Low-dim-RF","path":"data_generator.py","file_url":"https://github.com/roysaptaumich/Low-dim-RF/blob/HEAD/data_generator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e4b938638f0e2605","mcp_get_code":{"code_sha256":"e4b938638f0e2605"}},{"arxiv_id":"2506.13961","paper":"/paper/safe-domains-of-attraction-for-discrete-time","title":"Safe Domains of Attraction for Discrete-Time Nonlinear Systems: Characterization and Verifiable Neural Network Estimation","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuikunZhou/Safe_ROA_dt_LyZNet","path":"src/lyznet/generate_data.py","file_url":"https://github.com/RuikunZhou/Safe_ROA_dt_LyZNet/blob/HEAD/src/lyznet/generate_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e66ffc24945aaea7","mcp_get_code":{"code_sha256":"e66ffc24945aaea7"}},{"arxiv_id":"2506.05945","paper":"/paper/on-efficient-estimation-of-distributional","title":"On Efficient Estimation of Distributional Treatment Effects under Covariate-Adaptive Randomization","date":"2025-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberAgentAILab/dte_car","path":"simulation.py","file_url":"https://github.com/CyberAgentAILab/dte_car/blob/HEAD/simulation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43eac1e884497105","mcp_get_code":{"code_sha256":"43eac1e884497105"}},{"arxiv_id":"2505.13027","paper":"/paper/unpacking-positional-encoding-in-transformers","title":"Unpacking Positional Encoding in Transformers: A Spectral Analysis of Content-Position Coupling","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qihuai27/Deposit-Pattern-Research","path":"dis_gen/1_data_preparation/data-gen.py","file_url":"https://github.com/Qihuai27/Deposit-Pattern-Research/blob/HEAD/dis_gen/1_data_preparation/data-gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e688674c9dc7c67","mcp_get_code":{"code_sha256":"2e688674c9dc7c67"}},{"arxiv_id":"2501.08201","paper":"/paper/globally-convergent-variational-inference","title":"Globally Convergent Variational Inference","date":"2025-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declanmcnamara/gcvi_neurips","path":"amortized_clustering/generate.py","file_url":"https://github.com/declanmcnamara/gcvi_neurips/blob/HEAD/amortized_clustering/generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9419bd6dacc97f35","mcp_get_code":{"code_sha256":"9419bd6dacc97f35"}},{"arxiv_id":"2501.08201","paper":"/paper/globally-convergent-variational-inference","title":"Globally Convergent Variational Inference","date":"2025-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declanmcnamara/gcvi_neurips","path":"canonical_gaussian/generate.py","file_url":"https://github.com/declanmcnamara/gcvi_neurips/blob/HEAD/canonical_gaussian/generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e38816dc105e9f8","mcp_get_code":{"code_sha256":"0e38816dc105e9f8"}},{"arxiv_id":"2411.00498","paper":"/paper/exploring-the-precise-dynamics-of-single","title":"Exploring the Precise Dynamics of Single-Layer GAN Models: Leveraging Multi-Feature Discriminators for High-Dimensional Subspace Learning","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-MLIP/SolvableMultiFeatureGAN","path":"data.py","file_url":"https://github.com/KU-MLIP/SolvableMultiFeatureGAN/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d3542fe2e07d4605","mcp_get_code":{"code_sha256":"d3542fe2e07d4605"}},{"arxiv_id":"2410.23996","paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/DisentangledSSL","path":"synthetic_task/dataset.py","file_url":"https://github.com/uhlerlab/DisentangledSSL/blob/HEAD/synthetic_task/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f14b06907824c231","mcp_get_code":{"code_sha256":"f14b06907824c231"}},{"arxiv_id":"2410.10637","paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"loggle/Loggle_ROC.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/loggle/Loggle_ROC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b343b024bcdb434e","mcp_get_code":{"code_sha256":"b343b024bcdb434e"}},{"arxiv_id":"2410.10637","paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"loggle/Loggle_power.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/loggle/Loggle_power.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6873a0bfe21b5090","mcp_get_code":{"code_sha256":"6873a0bfe21b5090"}},{"arxiv_id":"2410.10637","paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"loggle/Loggle_type_i_deterministic.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/loggle/Loggle_type_i_deterministic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c5c14cafa07d89b3","mcp_get_code":{"code_sha256":"c5c14cafa07d89b3"}},{"arxiv_id":"2410.10637","paper":"/paper/high-dimensional-differential-parameter","title":"High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leyangw/tsm","path":"loggle/Loggle_type_i_random.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/loggle/Loggle_type_i_random.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"03ca2cd855ca00ee","mcp_get_code":{"code_sha256":"03ca2cd855ca00ee"}},{"arxiv_id":"2406.19770","paper":"/paper/self-supervised-spatial-temporal-normality","title":"Self-Supervised Spatial-Temporal Normality Learning for Time Series Anomaly Detection","date":"2024-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/sten","path":"utils/data.py","file_url":"https://github.com/mala-lab/sten/blob/HEAD/utils/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a3cb24dcc21da58","mcp_get_code":{"code_sha256":"8a3cb24dcc21da58"}},{"arxiv_id":"2406.00569","paper":"/paper/redefining-contributions-shapley-driven","title":"Redefining Contributions: Shapley-Driven Federated Learning","date":"2024-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tnurbek/shapfed","path":"data_loader.py","file_url":"https://github.com/tnurbek/shapfed/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ff381e1e66566414","mcp_get_code":{"code_sha256":"ff381e1e66566414"}},{"arxiv_id":"2405.13456","paper":"/paper/deep-linear-networks-for-regression-are","title":"Deep linear networks for regression are implicitly regularized towards flat minima","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PierreMarion23/implicit-reg-sharpness","path":"utils.py","file_url":"https://github.com/PierreMarion23/implicit-reg-sharpness/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5870180258b6c8a6","mcp_get_code":{"code_sha256":"5870180258b6c8a6"}},{"arxiv_id":"2405.02041","paper":"/paper/stabilizing-backpropagation-through-time-to","title":"Stabilizing Backpropagation Through Time to Learn Complex Physics","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/StableBPTT","path":"CartPole/Simulations/01/multi_cartpole_data.py","file_url":"https://github.com/tum-pbs/StableBPTT/blob/HEAD/CartPole/Simulations/01/multi_cartpole_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"c0a943c1eb479ed7","mcp_get_code":{"code_sha256":"c0a943c1eb479ed7"}},{"arxiv_id":"2404.09788","paper":"/paper/shape-arithmetic-expressions-advancing","title":"Shape Arithmetic Expressions: Advancing Scientific Discovery Beyond Closed-Form Equations","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krzysztof-kacprzyk/shares","path":"experiments/risk_scores_data.py","file_url":"https://github.com/krzysztof-kacprzyk/shares/blob/HEAD/experiments/risk_scores_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bc19b59ce41fe5ec","mcp_get_code":{"code_sha256":"bc19b59ce41fe5ec"}},{"arxiv_id":"2403.10610","paper":"/paper/sequential-monte-carlo-for-inclusive-kl","title":"Sequential Monte Carlo for Inclusive KL Minimization in Amortized Variational Inference","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declanmcnamara/smc-wake","path":"high_dim_gaussian/generate.py","file_url":"https://github.com/declanmcnamara/smc-wake/blob/HEAD/high_dim_gaussian/generate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"386eeb10aa3dd7b3","mcp_get_code":{"code_sha256":"386eeb10aa3dd7b3"}},{"arxiv_id":"2402.17826","paper":"/paper/prediction-powered-ranking-of-large-language","title":"Prediction-Powered Ranking of Large Language Models","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Networks-Learning/prediction-powered-ranking","path":"src/synthetic.py","file_url":"https://github.com/Networks-Learning/prediction-powered-ranking/blob/HEAD/src/synthetic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89a90895358d82f5","mcp_get_code":{"code_sha256":"89a90895358d82f5"}},{"arxiv_id":"2402.09353","paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catid/dora","path":"dora.py","file_url":"https://github.com/catid/dora/blob/HEAD/dora.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f040823d10747c45","mcp_get_code":{"code_sha256":"f040823d10747c45"}},{"arxiv_id":"2402.04906","paper":"/paper/conformal-monte-carlo-meta-learners-for","title":"Conformal Convolution and Monte Carlo Meta-learners for Predictive Inference of Individual Treatment Effects","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"predict-idlab/cct-cmc","path":"src/datasets/alaa_synthetic.py","file_url":"https://github.com/predict-idlab/cct-cmc/blob/HEAD/src/datasets/alaa_synthetic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"484ffc15894a9366","mcp_get_code":{"code_sha256":"484ffc15894a9366"}},{"arxiv_id":"2401.03006","paper":"/paper/the-rise-of-diffusion-models-in-time-series","title":"The Rise of Diffusion Models in Time-Series Forecasting","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4healthuol/sssd","path":"src/entensions/cauchy/benchmark_cauchy.py","file_url":"https://github.com/ai4healthuol/sssd/blob/HEAD/src/entensions/cauchy/benchmark_cauchy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ecb7499d0e944c1","mcp_get_code":{"code_sha256":"6ecb7499d0e944c1"}},{"arxiv_id":"2310.01082","paper":"/paper/linear-attention-is-maybe-all-you-need-to","title":"Linear attention is (maybe) all you need (to understand transformer optimization)","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chengxiang/lineartransformer","path":"linear_transformer.py","file_url":"https://github.com/chengxiang/lineartransformer/blob/HEAD/linear_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50007a7805d0a01a","mcp_get_code":{"code_sha256":"50007a7805d0a01a"}},{"arxiv_id":"2309.13705","paper":"/paper/a-neural-guided-dynamic-symbolic-network-for","title":"A Neural-Guided Dynamic Symbolic Network for Exploring Mathematical Expressions from Data","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ailwq/dysymnet","path":"DySymNet/SymbolicRegression.py","file_url":"https://github.com/ailwq/dysymnet/blob/HEAD/DySymNet/SymbolicRegression.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c65e59afc4e6086a","mcp_get_code":{"code_sha256":"c65e59afc4e6086a"}},{"arxiv_id":"2309.13705","paper":"/paper/a-neural-guided-dynamic-symbolic-network-for","title":"A Neural-Guided Dynamic Symbolic Network for Exploring Mathematical Expressions from Data","date":"2023-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ailwq/dysymnet","path":"DySymNet/SymbolicRegression.py","file_url":"https://github.com/ailwq/dysymnet/blob/HEAD/DySymNet/SymbolicRegression.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8fc5b034a28064c8","mcp_get_code":{"code_sha256":"8fc5b034a28064c8"}},{"arxiv_id":"2309.08230","paper":"/paper/a-duty-to-forget-a-right-to-be-assured","title":"A Duty to Forget, a Right to be Assured? Exposing Vulnerabilities in Machine Unlearning Services","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":"archive","repo":"tasi-lab/over-unlearning","path":"generate_attack.py","file_url":"https://github.com/tasi-lab/over-unlearning/blob/HEAD/generate_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6aac7cb910311018","mcp_get_code":{"code_sha256":"6aac7cb910311018"}},{"arxiv_id":"2307.04755","paper":"/paper/information-decomposition-to-identify","title":"Information decomposition in complex systems via machine learning","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"distributed-information-bottleneck/distributed-information-bottleneck.github.io","path":"chaos/chaos_data.py","file_url":"https://github.com/distributed-information-bottleneck/distributed-information-bottleneck.github.io/blob/HEAD/chaos/chaos_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7406399ef46ff704","mcp_get_code":{"code_sha256":"7406399ef46ff704"}},{"arxiv_id":"2306.05268","paper":"/paper/factorized-contrastive-learning-going-beyond","title":"Factorized Contrastive Learning: Going Beyond Multi-view Redundancy","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/FactorCL","path":"Synthetic/dataset.py","file_url":"https://github.com/pliang279/FactorCL/blob/HEAD/Synthetic/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"163224ba7c2a61f9","mcp_get_code":{"code_sha256":"163224ba7c2a61f9"}},{"arxiv_id":"2306.03209","paper":"/paper/end-to-end-differentiable-clustering-with","title":"End-to-end Differentiable Clustering with Associative Memories","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bsaha205/clam","path":"plot_gaussian.py","file_url":"https://github.com/bsaha205/clam/blob/HEAD/plot_gaussian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac7a55ce33b3c50e","mcp_get_code":{"code_sha256":"ac7a55ce33b3c50e"}},{"arxiv_id":"2306.02732","paper":"/paper/conformal-prediction-with-missing-values","title":"Conformal Prediction with Missing Values","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzaffran/conformalpredictionmissingvalues","path":"generation.py","file_url":"https://github.com/mzaffran/conformalpredictionmissingvalues/blob/HEAD/generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f4cd90bdd887e3f","mcp_get_code":{"code_sha256":"2f4cd90bdd887e3f"}},{"arxiv_id":"2305.16074","paper":"/paper/combinatorial-bandits-for-maximum-value","title":"Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sketch-exp/kmax","path":"experiments/framework-cat.py","file_url":"https://github.com/sketch-exp/kmax/blob/HEAD/experiments/framework-cat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d80e19aba9bcc4e5","mcp_get_code":{"code_sha256":"d80e19aba9bcc4e5"}},{"arxiv_id":"2305.16074","paper":"/paper/combinatorial-bandits-for-maximum-value","title":"Combinatorial Bandits for Maximum Value Reward Function under Max Value-Index Feedback","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sketch-exp/kmax","path":"experiments/framework.py","file_url":"https://github.com/sketch-exp/kmax/blob/HEAD/experiments/framework.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9e55351dce950570","mcp_get_code":{"code_sha256":"9e55351dce950570"}},{"arxiv_id":"2303.16312","paper":"/paper/quantum-machine-learning-at-record-speed-many","title":"Kernel based quantum machine learning at record rate : Many-body distribution functionals as compact representations","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"dkhan42/mbdf","path":"MBDF.py","file_url":"https://github.com/dkhan42/mbdf/blob/HEAD/MBDF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c1a9d2ef023d705","mcp_get_code":{"code_sha256":"3c1a9d2ef023d705"}},{"arxiv_id":"2303.09166","paper":"/paper/identifiability-results-for-multimodal","title":"Identifiability Results for Multimodal Contrastive Learning","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imantdaunhawer/multimodal-contrastive-learning","path":"main_mlp.py","file_url":"https://github.com/imantdaunhawer/multimodal-contrastive-learning/blob/HEAD/main_mlp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"fc680d8d1ece352b","mcp_get_code":{"code_sha256":"fc680d8d1ece352b"}},{"arxiv_id":"2302.13348","paper":"/paper/kernel-conditional-moment-constraints-for","title":"Kernel Conditional Moment Constraints for Confounding Robust Inference","date":"2023-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kstoneriv3/confounding-robust-inference-old","path":"kcmc/data_binary.py","file_url":"https://github.com/kstoneriv3/confounding-robust-inference-old/blob/HEAD/kcmc/data_binary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7183e20cd75cfd98","mcp_get_code":{"code_sha256":"7183e20cd75cfd98"}},{"arxiv_id":"2302.13348","paper":"/paper/kernel-conditional-moment-constraints-for","title":"Kernel Conditional Moment Constraints for Confounding Robust Inference","date":"2023-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kstoneriv3/confounding-robust-inference-old","path":"kcmc/data_continuous.py","file_url":"https://github.com/kstoneriv3/confounding-robust-inference-old/blob/HEAD/kcmc/data_continuous.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c7f42d4663c6fe4d","mcp_get_code":{"code_sha256":"c7f42d4663c6fe4d"}},{"arxiv_id":"2211.14721","paper":"/paper/generalizing-gaussian-smoothing-for-random","title":"Generalizing Gaussian Smoothing for Random Search","date":"2022-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isl-org/generalized-smoothing","path":"LinearRegression/samplers.py","file_url":"https://github.com/isl-org/generalized-smoothing/blob/HEAD/LinearRegression/samplers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a08b9c25cf3ff73","mcp_get_code":{"code_sha256":"9a08b9c25cf3ff73"}},{"arxiv_id":"2206.06602","paper":"/paper/deep-isolation-forest-for-anomaly-detection","title":"Deep Isolation Forest for Anomaly Detection","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/deep-iforest","path":"create_scal_data.py","file_url":"https://github.com/xuhongzuo/deep-iforest/blob/HEAD/create_scal_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ebd0591813c141a1","mcp_get_code":{"code_sha256":"ebd0591813c141a1"}},{"arxiv_id":"2206.04301","paper":"/paper/unveiling-transformers-with-lego-a-synthetic","title":"Unveiling Transformers with LEGO: a synthetic reasoning task","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yizhangzzz/transformers-lego","path":"lego_data.py","file_url":"https://github.com/yizhangzzz/transformers-lego/blob/HEAD/lego_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"20cc1f6911cd7b62","mcp_get_code":{"code_sha256":"20cc1f6911cd7b62"}},{"arxiv_id":"2206.03230","paper":"/paper/shedding-a-pac-bayesian-light-on-adaptive","title":"Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein Distances","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rubenohana/pac-bayesian_sliced-wasserstein","path":"evaluate_vmf.py","file_url":"https://github.com/rubenohana/pac-bayesian_sliced-wasserstein/blob/HEAD/evaluate_vmf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"469a30afba6c9809","mcp_get_code":{"code_sha256":"469a30afba6c9809"}},{"arxiv_id":"2204.01275","paper":"/paper/direct-search-based-on-probabilistic-descent","title":"Direct search based on probabilistic descent in reduced spaces","date":null,"month_inferred_from_arxiv_id":"2022-04","title_source":"archive","repo":"lindonroberts/directsearch","path":"examples/nonconvex_regression.py","file_url":"https://github.com/lindonroberts/directsearch/blob/HEAD/examples/nonconvex_regression.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"54f8d88e68c76d98","mcp_get_code":{"code_sha256":"54f8d88e68c76d98"}},{"arxiv_id":"2203.13079","paper":"/paper/learning-optimal-test-statistics-in-the","title":"Learning Optimal Test Statistics in the Presence of Nuisance Parameters","date":null,"month_inferred_from_arxiv_id":"2022-03","title_source":"archive","repo":"lukasheinrich/learning_best_average_power","path":"wald_train.py","file_url":"https://github.com/lukasheinrich/learning_best_average_power/blob/HEAD/wald_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"381e82d3eb0c4a3b","mcp_get_code":{"code_sha256":"381e82d3eb0c4a3b"}},{"arxiv_id":"2203.08958","paper":"/paper/on-the-usefulness-of-the-fit-on-the-test-view","title":"On the Usefulness of the Fit-on-the-Test View on Evaluating Calibration of Classifiers","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markus93/fit-on-the-test","path":"Experiments_Pseudo/data_generation.py","file_url":"https://github.com/markus93/fit-on-the-test/blob/HEAD/Experiments_Pseudo/data_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e19229d023ae722","mcp_get_code":{"code_sha256":"0e19229d023ae722"}},{"arxiv_id":"2202.07282","paper":"/paper/adaptive-conformal-predictions-for-time","title":"Adaptive Conformal Predictions for Time Series","date":"2022-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mzaffran/adaptiveconformalpredictionstimeseries","path":"generation.py","file_url":"https://github.com/mzaffran/adaptiveconformalpredictionstimeseries/blob/HEAD/generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4960f1aafb7e7eb9","mcp_get_code":{"code_sha256":"4960f1aafb7e7eb9"}},{"arxiv_id":"2202.01864","paper":"/paper/exploiting-independent-instruments","title":"Exploiting Independent Instruments: Identification and Distribution Generalization","date":"2022-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sorawitj/hsic-x","path":"experiments/distribution_generalization.py","file_url":"https://github.com/sorawitj/hsic-x/blob/HEAD/experiments/distribution_generalization.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b1d93b571231218a","mcp_get_code":{"code_sha256":"b1d93b571231218a"}},{"arxiv_id":"2110.12425","paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim1.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b4fd708358d370f","mcp_get_code":{"code_sha256":"3b4fd708358d370f"}},{"arxiv_id":"2110.12425","paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim1.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim1.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"08d53c1a25fc4fe1","mcp_get_code":{"code_sha256":"08d53c1a25fc4fe1"}},{"arxiv_id":"2110.02501","paper":"/paper/sharp-learning-bounds-for-contrastive","title":"On the Surrogate Gap between Contrastive and Supervised Losses","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nzw0301/gap-contrastive-and-supervised-losses","path":"code/toy_contrastive.py","file_url":"https://github.com/nzw0301/gap-contrastive-and-supervised-losses/blob/HEAD/code/toy_contrastive.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e5ac2c9d6cec4f","mcp_get_code":{"code_sha256":"b8e5ac2c9d6cec4f"}},{"arxiv_id":"2108.01220","paper":"/paper/overt-an-algorithm-for-safety-verification-of","title":"OVERT: An Algorithm for Safety Verification of Neural Network Control Policies for Nonlinear Systems","date":"2021-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sisl/OVERTVerify.jl","path":"nnet_files/jmlr/generate_smaller_networks_tora.py","file_url":"https://github.com/sisl/OVERTVerify.jl/blob/HEAD/nnet_files/jmlr/generate_smaller_networks_tora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1fd22ccb6c1486b","mcp_get_code":{"code_sha256":"b1fd22ccb6c1486b"}},{"arxiv_id":"2104.09052","paper":"/paper/metadata-normalization","title":"Metadata Normalization","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlu355/MetadataNorm","path":"utils.py","file_url":"https://github.com/mlu355/MetadataNorm/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ebaf3acfda2bdb11","mcp_get_code":{"code_sha256":"ebaf3acfda2bdb11"}},{"arxiv_id":"2006.08852","paper":"/paper/counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AishwaryaSivaraman/COMET","path":"src/ModelCalls.py","file_url":"https://github.com/AishwaryaSivaraman/COMET/blob/HEAD/src/ModelCalls.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d081ded071feb48","mcp_get_code":{"code_sha256":"6d081ded071feb48"}},{"arxiv_id":"1909.13806","paper":"/paper/min-max-optimization-without-gradients","title":"Min-Max Optimization without Gradients: Convergence and Applications to Adversarial ML","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaidiXu/ZO-minmax","path":"Main_poison_attack.py","file_url":"https://github.com/KaidiXu/ZO-minmax/blob/HEAD/Main_poison_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ef4cc5639e0d3c7","mcp_get_code":{"code_sha256":"4ef4cc5639e0d3c7"}},{"arxiv_id":"1907.11684","paper":"/paper/on-the-design-of-black-box-adversarial","title":"On the Design of Black-box Adversarial Examples by Leveraging Gradient-free Optimization and Operator Splitting Method","date":"2019-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LinLabNEU/Blackbox_ADMM","path":"test_attack_mnist.py","file_url":"https://github.com/LinLabNEU/Blackbox_ADMM/blob/HEAD/test_attack_mnist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"acc00f20a6a4cdc6","mcp_get_code":{"code_sha256":"acc00f20a6a4cdc6"}},{"arxiv_id":"1906.12183","paper":"/paper/neural-odes-as-the-deep-limit-of-resnets-with","title":"Neural ODEs as the Deep Limit of ResNets with constant weights","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BennyAvelin/DeepLimitNeuralODE","path":"Annulus_crossval.py","file_url":"https://github.com/BennyAvelin/DeepLimitNeuralODE/blob/HEAD/Annulus_crossval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"cd9985cdef068208","mcp_get_code":{"code_sha256":"cd9985cdef068208"}},{"arxiv_id":"1902.04601","paper":"/paper/contrastive-variational-autoencoder-enhances","title":"Contrastive Variational Autoencoder Enhances Salient Features","date":"2019-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abidlabs/contrastive_vae","path":"vae_utils.py","file_url":"https://github.com/abidlabs/contrastive_vae/blob/HEAD/vae_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cd43143265506a1","mcp_get_code":{"code_sha256":"5cd43143265506a1"}},{"arxiv_id":"1808.01664","paper":"/paper/structured-adversarial-attack-towards-general","title":"Structured Adversarial Attack: Towards General Implementation and Better Interpretability","date":"2018-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KaidiXu/StrAttack","path":"test_attack_iclr.py","file_url":"https://github.com/KaidiXu/StrAttack/blob/HEAD/test_attack_iclr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8da19e9d83604707","mcp_get_code":{"code_sha256":"8da19e9d83604707"}},{"arxiv_id":"1805.11770","paper":"/paper/autozoom-autoencoder-based-zeroth-order","title":"AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks","date":"2018-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Autozoom-Attack","path":"Utils.py","file_url":"https://github.com/IBM/Autozoom-Attack/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,"code_sha256_prefix":"f8fb91c06db9efe1","mcp_get_code":{"code_sha256":"f8fb91c06db9efe1"}},{"arxiv_id":"1805.11090","paper":"/paper/genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nesl/adversarial_genattack","path":"utils.py","file_url":"https://github.com/nesl/adversarial_genattack/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb5e83c39bdec690","mcp_get_code":{"code_sha256":"bb5e83c39bdec690"}},{"arxiv_id":"1804.05810","paper":"/paper/shapeshifter-robust-physical-adversarial","title":"ShapeShifter: Robust Physical Adversarial Attack on Faster R-CNN Object Detector","date":"2018-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AishrithRao/robust-physical-attack","path":"shapeshifter2d.py","file_url":"https://github.com/AishrithRao/robust-physical-attack/blob/HEAD/shapeshifter2d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"code_sha256_prefix":"76947627228fb26a","mcp_get_code":{"code_sha256":"76947627228fb26a"}},{"arxiv_id":"1804.03619","paper":"/paper/looking-to-listen-at-the-cocktail-party-a","title":"Looking to Listen at the Cocktail Party: A Speaker-Independent Audio-Visual Model for Speech Separation","date":"2018-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vitrioil/Speech-Separation","path":"src/analysis/dim_reduce_spectrogram.py","file_url":"https://github.com/vitrioil/Speech-Separation/blob/HEAD/src/analysis/dim_reduce_spectrogram.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"13787efe735dc7b8","mcp_get_code":{"code_sha256":"13787efe735dc7b8"}},{"arxiv_id":"1803.08475","paper":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rintarooo/VRP_DRL_MHA","path":"PyTorch/data.py","file_url":"https://github.com/Rintarooo/VRP_DRL_MHA/blob/HEAD/PyTorch/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a58fa4a05eb041d8","mcp_get_code":{"code_sha256":"a58fa4a05eb041d8"}},{"arxiv_id":"1802.07623","paper":"/paper/explanations-based-on-the-missing-towards","title":"Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negatives","date":"2018-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Contrastive-Explanation-Method","path":"Utils.py","file_url":"https://github.com/IBM/Contrastive-Explanation-Method/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,"code_sha256_prefix":"f8fb91c06db9efe1","mcp_get_code":{"code_sha256":"f8fb91c06db9efe1"}},{"arxiv_id":"1709.04114","paper":"/paper/ead-elastic-net-attacks-to-deep-neural","title":"EAD: Elastic-Net Attacks to Deep Neural Networks via Adversarial Examples","date":"2017-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/EAD-Attack","path":"test_attack.py","file_url":"https://github.com/IBM/EAD-Attack/blob/HEAD/test_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"455253112a78ff1e","mcp_get_code":{"code_sha256":"455253112a78ff1e"}},{"arxiv_id":"1708.03999","paper":"/paper/zoo-zeroth-order-optimization-based-black-box","title":"ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models","date":"2017-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/ZOO-Attack","path":"test_all.py","file_url":"https://github.com/IBM/ZOO-Attack/blob/HEAD/test_all.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3abcf522eaf4f685","mcp_get_code":{"code_sha256":"3abcf522eaf4f685"}},{"arxiv_id":"1608.04644","paper":"/paper/towards-evaluating-the-robustness-of-neural","title":"Towards Evaluating the Robustness of Neural Networks","date":"2016-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bhushan-Jagtap-2013/Adversarial_Attack_on_RNN","path":"test_attack.py","file_url":"https://github.com/Bhushan-Jagtap-2013/Adversarial_Attack_on_RNN/blob/HEAD/test_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"ae7a589f65750d71","mcp_get_code":{"code_sha256":"ae7a589f65750d71"}},{"arxiv_id":"1608.04644","paper":"/paper/towards-evaluating-the-robustness-of-neural","title":"Towards Evaluating the Robustness of Neural Networks","date":"2016-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carlini/nn_robust_attacks","path":"test_attack.py","file_url":"https://github.com/carlini/nn_robust_attacks/blob/HEAD/test_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"33c3e5273c448151","mcp_get_code":{"code_sha256":"33c3e5273c448151"}},{"arxiv_id":"1604.08275","paper":"/paper/crafting-adversarial-input-sequences-for","title":"Crafting Adversarial Input Sequences for Recurrent Neural Networks","date":"2016-04-28","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,"code_sha256_prefix":"ae7a589f65750d71","mcp_get_code":{"code_sha256":"ae7a589f65750d71"}},{"arxiv_id":"1511.06644","paper":"/paper/recurrent-gaussian-processes","title":"Recurrent Gaussian Processes","date":"2015-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenwendai/RGP","path":"testing/minibatch_tests.py","file_url":"https://github.com/zhenwendai/RGP/blob/HEAD/testing/minibatch_tests.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"813d2048970679c9","mcp_get_code":{"code_sha256":"813d2048970679c9"}},{"arxiv_id":"0710.3742","paper":"/paper/bayesian-online-changepoint-detection","title":"Bayesian Online Changepoint Detection","date":"2007-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gwgundersen/bocd","path":"bocd.py","file_url":"https://github.com/gwgundersen/bocd/blob/HEAD/bocd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"a3e839f4e90f8279","mcp_get_code":{"code_sha256":"a3e839f4e90f8279"}}]}