{"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/f","entry":"f","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":68,"n_papers_ran":39,"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":40,"n_samples_fingerprinted":25,"n_places":77,"n_places_pointer_only":34,"by_status":{"ran_honours":13,"ran_violates":7,"ran_draft_wrong":1,"ran_fixture":6,"ran":13,"unverified":34},"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":"2609.02734","paper":"/paper/arxiv-2609-02734","title":"LoRA-TSD: Tangent-Space Spectral Descent for LoRA via Muon-Style Updates","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"brain-lab-research/LoRA-TSD","path":"src/optimizers/lora_tsd.py","file_url":"https://github.com/brain-lab-research/LoRA-TSD/blob/HEAD/src/optimizers/lora_tsd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42c1e5e5c2470c48","mcp_get_code":{"code_sha256":"42c1e5e5c2470c48"}},{"arxiv_id":"2608.02433","paper":"/paper/arxiv-2608-02433","title":"Foundations of Reinforcement Learning and Control: Connections and New Perspectives","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"onnoeberhard/forlac-tutorial","path":"mrac.py","file_url":"https://github.com/onnoeberhard/forlac-tutorial/blob/HEAD/mrac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2560d2fda0296f12","mcp_get_code":{"code_sha256":"2560d2fda0296f12"}},{"arxiv_id":"2607.18316","paper":"/paper/arxiv-2607-18316","title":"Binding Drift in Multi-Step Tool-Augmented Agents","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"shashank-indukuri/binding-drift","path":"code/aggregate_results.py","file_url":"https://github.com/shashank-indukuri/binding-drift/blob/HEAD/code/aggregate_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf2af8fba1d08847","mcp_get_code":{"code_sha256":"bf2af8fba1d08847"}},{"arxiv_id":"2602.12923","paper":"/paper/arxiv-2602-12923","title":"Annealing in variational inference mitigates mode collapse: A theoretical study on Gaussian mixtures","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Luijios/annealed_vi_gmms","path":"src/utils.py","file_url":"https://github.com/Luijios/annealed_vi_gmms/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab261af3abd042a6","mcp_get_code":{"code_sha256":"ab261af3abd042a6"}},{"arxiv_id":"2601.03401","paper":"/paper/arxiv-2601-03401","title":"Rendering Data Unlearnable by Exploiting LLM Alignment Mechanisms","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cat-claws/unlearnable","path":"grad.py","file_url":"https://github.com/cat-claws/unlearnable/blob/HEAD/grad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d1249f7f35b74dfa","mcp_get_code":{"code_sha256":"d1249f7f35b74dfa"}},{"arxiv_id":"2505.19427","paper":"/paper/wina-weight-informed-neuron-activation-for","title":"WINA: Weight Informed Neuron Activation for Accelerating Large Language Model Inference","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/wina","path":"wina/greedyopt.py","file_url":"https://github.com/microsoft/wina/blob/HEAD/wina/greedyopt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"620a529f603f65ec","mcp_get_code":{"code_sha256":"620a529f603f65ec"}},{"arxiv_id":"2505.14670","paper":"/paper/quantum-optimization-via-gradient-based","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqileng/gradient-based-qhd","path":"convex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/convex_optim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79551e8e8ab3e337","mcp_get_code":{"code_sha256":"79551e8e8ab3e337"}},{"arxiv_id":"2505.14670","paper":"/paper/quantum-optimization-via-gradient-based","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqileng/gradient-based-qhd","path":"styblinski_tang.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/styblinski_tang.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cf69a4ee90924580","mcp_get_code":{"code_sha256":"cf69a4ee90924580"}},{"arxiv_id":"2505.14670","paper":"/paper/quantum-optimization-via-gradient-based","title":"Quantum Optimization via Gradient-Based Hamiltonian Descent","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaqileng/gradient-based-qhd","path":"nonconvex_optim.py","file_url":"https://github.com/jiaqileng/gradient-based-qhd/blob/HEAD/nonconvex_optim.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e5517769dd75a5c","mcp_get_code":{"code_sha256":"7e5517769dd75a5c"}},{"arxiv_id":"2502.07154","paper":"/paper/rethinking-fine-tuning-when-scaling-test-time","title":"Rethinking Fine-Tuning when Scaling Test-Time Compute: Limiting Confidence Improves Mathematical Reasoning","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allanraventos/refine","path":"refine/training/loss_functions.py","file_url":"https://github.com/allanraventos/refine/blob/HEAD/refine/training/loss_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40a1820babef89cf","mcp_get_code":{"code_sha256":"40a1820babef89cf"}},{"arxiv_id":"2502.07154","paper":"/paper/rethinking-fine-tuning-when-scaling-test-time","title":"Rethinking Fine-Tuning when Scaling Test-Time Compute: Limiting Confidence Improves Mathematical Reasoning","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allanraventos/refine","path":"refine/training/NCO.py","file_url":"https://github.com/allanraventos/refine/blob/HEAD/refine/training/NCO.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f771bfcb5cd13900","mcp_get_code":{"code_sha256":"f771bfcb5cd13900"}},{"arxiv_id":"2411.10618","paper":"/paper/d-flow-multi-modality-flow-matching-for-d","title":"D-Flow: Multi-modality Flow Matching for D-peptide Design","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":"archive","repo":"smiles724/peptidedesign","path":"dflow/models/adjoint.py","file_url":"https://github.com/smiles724/peptidedesign/blob/HEAD/dflow/models/adjoint.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11c3c2c25a443605","mcp_get_code":{"code_sha256":"11c3c2c25a443605"}},{"arxiv_id":"2410.12289","paper":"/paper/ai-aided-kalman-filters","title":"AI-Aided Kalman Filters","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shlezingerlab/ai_aided_kfs","path":"DANSE_KTH/rtsnet_params.py","file_url":"https://github.com/shlezingerlab/ai_aided_kfs/blob/HEAD/DANSE_KTH/rtsnet_params.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7951faeb33ad1704","mcp_get_code":{"code_sha256":"7951faeb33ad1704"}},{"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":"demo_ROC_ratio.py","file_url":"https://github.com/Leyangw/tsm/blob/HEAD/demo_ROC_ratio.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"631440f27a7b5919","mcp_get_code":{"code_sha256":"631440f27a7b5919"}},{"arxiv_id":"2410.07916","paper":"/paper/robustness-auditing-for-linear-regression-to","title":"Robustness Auditing for Linear Regression: To Singularity and Beyond","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ittai-rubinstein/ols_robustness","path":"src/lower_bounds/amip.py","file_url":"https://github.com/ittai-rubinstein/ols_robustness/blob/HEAD/src/lower_bounds/amip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eff9e12561a99df1","mcp_get_code":{"code_sha256":"eff9e12561a99df1"}},{"arxiv_id":"2409.16554","paper":"/paper/emit-event-based-masked-auto-encoding-for","title":"EMIT- Event-Based Masked Auto Encoding for Irregular Time Series","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrishi-ds/EMIT","path":"src/data_preprocessing/preprocess_mimic_iii.py","file_url":"https://github.com/hrishi-ds/EMIT/blob/HEAD/src/data_preprocessing/preprocess_mimic_iii.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06ddfb40099e743b","mcp_get_code":{"code_sha256":"06ddfb40099e743b"}},{"arxiv_id":"2409.16554","paper":"/paper/emit-event-based-masked-auto-encoding-for","title":"EMIT- Event-Based Masked Auto Encoding for Irregular Time Series","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrishi-ds/EMIT","path":"src/data_preprocessing/preprocess_mimic_iii.py","file_url":"https://github.com/hrishi-ds/EMIT/blob/HEAD/src/data_preprocessing/preprocess_mimic_iii.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ff0290f2f537f28","mcp_get_code":{"code_sha256":"2ff0290f2f537f28"}},{"arxiv_id":"2407.10448","paper":"/paper/spectral-representation-for-causal-estimation","title":"Spectral Representation for Causal Estimation with Hidden Confounders","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haotiansun14/SpecIV","path":"dataset/demand_design_dataset.py","file_url":"https://github.com/haotiansun14/SpecIV/blob/HEAD/dataset/demand_design_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2c0fdf3729b3cd17","mcp_get_code":{"code_sha256":"2c0fdf3729b3cd17"}},{"arxiv_id":"2406.07709","paper":"/paper/diagnosing-and-fixing-common-problems-in","title":"Diagnosing and fixing common problems in Bayesian optimization for molecule design","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AustinT/basic-mol-bo-workshop2024","path":"figures/pitfalls.py","file_url":"https://github.com/AustinT/basic-mol-bo-workshop2024/blob/HEAD/figures/pitfalls.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31abebbd517e0a66","mcp_get_code":{"code_sha256":"31abebbd517e0a66"}},{"arxiv_id":"2405.14860","paper":"/paper/not-all-language-model-features-are-linear","title":"Not All Language Model Features Are Linear","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshengels/multidimensionalfeatures","path":"feature_deconstruction/simple_example.py","file_url":"https://github.com/joshengels/multidimensionalfeatures/blob/HEAD/feature_deconstruction/simple_example.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35bb96ea1f68e1fc","mcp_get_code":{"code_sha256":"35bb96ea1f68e1fc"}},{"arxiv_id":"2405.06424","paper":"/paper/improving-instruction-following-in-language","title":"Improving Instruction Following in Language Models through Proxy-Based Uncertainty Estimation","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"p-b-u/proxy_based_uncertainty","path":"Proxy-Uncertainty-Training-LLaMa-Factory/src/llmtuner/tuner/rm/trainer.py","file_url":"https://github.com/p-b-u/proxy_based_uncertainty/blob/HEAD/Proxy-Uncertainty-Training-LLaMa-Factory/src/llmtuner/tuner/rm/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ffb5940236d57cb1","mcp_get_code":{"code_sha256":"ffb5940236d57cb1"}},{"arxiv_id":"2405.05192","paper":"/paper/full-error-analysis-of-the-random-deep","title":"Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psc25/mlpjumps","path":"counterparty_expVG_mlp.py","file_url":"https://github.com/psc25/mlpjumps/blob/HEAD/counterparty_expVG_mlp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce609ef82b955f25","mcp_get_code":{"code_sha256":"ce609ef82b955f25"}},{"arxiv_id":"2405.05192","paper":"/paper/full-error-analysis-of-the-random-deep","title":"Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psc25/mlpjumps","path":"default_bs_mlp.py","file_url":"https://github.com/psc25/mlpjumps/blob/HEAD/default_bs_mlp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dbe497784c46be0a","mcp_get_code":{"code_sha256":"dbe497784c46be0a"}},{"arxiv_id":"2405.05192","paper":"/paper/full-error-analysis-of-the-random-deep","title":"Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psc25/randomdeepsplitting","path":"default_bs_dspl.py","file_url":"https://github.com/psc25/randomdeepsplitting/blob/HEAD/default_bs_dspl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c8e2e56a43d9baf2","mcp_get_code":{"code_sha256":"c8e2e56a43d9baf2"}},{"arxiv_id":"2403.10391","paper":"/paper/cdmad-class-distribution-mismatch-aware","title":"CDMAD: Class-Distribution-Mismatch-Aware Debiasing for Class-Imbalanced Semi-Supervised Learning","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeeHyuck/CDMAD","path":"fixmatchcdmad.py","file_url":"https://github.com/LeeHyuck/CDMAD/blob/HEAD/fixmatchcdmad.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"73eab42215d7c5fb","mcp_get_code":{"code_sha256":"73eab42215d7c5fb"}},{"arxiv_id":"2402.11168","paper":"/paper/trust-regions-for-explanations-via-black-box","title":"Trust Regions for Explanations via Black-Box Probabilistic Certification","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trusted-ai/aix360","path":"aix360/algorithms/ecertify/ExpCertifyBB.py","file_url":"https://github.com/trusted-ai/aix360/blob/HEAD/aix360/algorithms/ecertify/ExpCertifyBB.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6a51d68741d2ae12","mcp_get_code":{"code_sha256":"6a51d68741d2ae12"}},{"arxiv_id":"2401.17523","paper":"/paper/game-theoretic-unlearnable-example-generator","title":"Game-Theoretic Unlearnable Example Generator","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hong-xian/gue","path":"gue.py","file_url":"https://github.com/hong-xian/gue/blob/HEAD/gue.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2cd493567e71bb78","mcp_get_code":{"code_sha256":"2cd493567e71bb78"}},{"arxiv_id":"2311.01135","paper":"/paper/generating-qm1b-with-pyscf-text-ipu-1","title":"Generating QM1B with PySCF$_{\\text{IPU}}$","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphcore-research/pyscf-ipu","path":"pyscf_ipu/dft.py","file_url":"https://github.com/graphcore-research/pyscf-ipu/blob/HEAD/pyscf_ipu/dft.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"554977c240abe619","mcp_get_code":{"code_sha256":"554977c240abe619"}},{"arxiv_id":"2309.00983","paper":"/paper/an-ensemble-score-filter-for-tracking-high","title":"An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems","date":"2023-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zezhongzhang/ensf","path":"legacy_code/EnSF_L96.py","file_url":"https://github.com/zezhongzhang/ensf/blob/HEAD/legacy_code/EnSF_L96.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4201a9ab79142d8","mcp_get_code":{"code_sha256":"a4201a9ab79142d8"}},{"arxiv_id":"2306.15058","paper":"/paper/batchgfn-generative-flow-networks-for-batch","title":"BatchGFN: Generative Flow Networks for Batch Active Learning","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-a-malik/batchgfn","path":"batchgfn/datasets/simulated_reg.py","file_url":"https://github.com/s-a-malik/batchgfn/blob/HEAD/batchgfn/datasets/simulated_reg.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":"3092e8e91236224b","mcp_get_code":{"code_sha256":"3092e8e91236224b"}},{"arxiv_id":"2303.09736","paper":"/paper/dynamic-structure-pruning-for-compressing","title":"Dynamic Structure Pruning for Compressing CNNs","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/examples","path":"fx/invert.py","file_url":"https://github.com/pytorch/examples/blob/HEAD/fx/invert.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":"a2229a8c3bb45dd9","mcp_get_code":{"code_sha256":"a2229a8c3bb45dd9"}},{"arxiv_id":"2302.05185","paper":"/paper/on-penalty-based-bilevel-gradient-descent","title":"On Penalty-based Bilevel Gradient Descent Method","date":"2023-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanshen95/penalized-bilevel-gradient-descent","path":"V-PBGD/toy/toy.py","file_url":"https://github.com/hanshen95/penalized-bilevel-gradient-descent/blob/HEAD/V-PBGD/toy/toy.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e299e6776b649a1","mcp_get_code":{"code_sha256":"7e299e6776b649a1"}},{"arxiv_id":"2211.09342","paper":"/paper/i-see-you-a-vehicle-pedestrian-interaction","title":"I see you: A Vehicle-Pedestrian Interaction Dataset from Traffic Surveillance Cameras","date":"2022-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hvzzzz/vehicle_trajectory_dataset","path":"tools/interpolations.py","file_url":"https://github.com/hvzzzz/vehicle_trajectory_dataset/blob/HEAD/tools/interpolations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"40deda4863443024","mcp_get_code":{"code_sha256":"40deda4863443024"}},{"arxiv_id":"2210.07702","paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/angular_stress_heuristic.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/angular_stress_heuristic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8037bcf18cb92126","mcp_get_code":{"code_sha256":"8037bcf18cb92126"}},{"arxiv_id":"2210.07702","paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/tree_growing_heuristic.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/tree_growing_heuristic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d7c5382f04e9bfb6","mcp_get_code":{"code_sha256":"d7c5382f04e9bfb6"}},{"arxiv_id":"2205.14327","paper":"/paper/efficient-policy-iteration-for-robust-markov","title":"Efficient Policy Iteration for Robust Markov Decision Processes via Regularization","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navdeepkumar12/rmdp","path":"bellman.py","file_url":"https://github.com/navdeepkumar12/rmdp/blob/HEAD/bellman.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed1fb9f8c95071f8","mcp_get_code":{"code_sha256":"ed1fb9f8c95071f8"}},{"arxiv_id":"2205.00293","paper":"/paper/ttopt-a-maximum-volume-quantized-tensor-train","title":"TTOpt: A Maximum Volume Quantized Tensor Train-based Optimization and its Application to Reinforcement Learning","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndreiChertkov/ttopt","path":"demo/base.py","file_url":"https://github.com/AndreiChertkov/ttopt/blob/HEAD/demo/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c2cbec6be13031a9","mcp_get_code":{"code_sha256":"c2cbec6be13031a9"}},{"arxiv_id":"2204.02738","paper":"/paper/masking-adversarial-damage-finding","title":"Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Network","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByungKwanLee/Masking-Adversarial-Damage","path":"models/operator/mask.py","file_url":"https://github.com/ByungKwanLee/Masking-Adversarial-Damage/blob/HEAD/models/operator/mask.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c69509c702f9ebb9","mcp_get_code":{"code_sha256":"c69509c702f9ebb9"}},{"arxiv_id":"2201.08663","paper":"/paper/fast-differentiable-matrix-square-root-1","title":"Fast Differentiable Matrix Square Root","date":"2022-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kingjamessong/fastdifferentiablematsqrt","path":"torch_utils.py","file_url":"https://github.com/kingjamessong/fastdifferentiablematsqrt/blob/HEAD/torch_utils.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6edb4e9466eb1e89","mcp_get_code":{"code_sha256":"6edb4e9466eb1e89"}},{"arxiv_id":"2112.05745","paper":"/paper/a-simple-and-efficient-sampling-based","title":"A Simple and Efficient Sampling-based Algorithm for General Reachability Analysis","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordasl/randup","path":"sensitivity.py","file_url":"https://github.com/stanfordasl/randup/blob/HEAD/sensitivity.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"526f27c0c50ce6a1","mcp_get_code":{"code_sha256":"526f27c0c50ce6a1"}},{"arxiv_id":"2111.05498","paper":"/paper/attention-approximates-sparse-distributed","title":"Attention Approximates Sparse Distributed Memory","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trentbrick/attention-approximates-sdm","path":"HugFace/SDM_Circ_Inter_Funcs.py","file_url":"https://github.com/trentbrick/attention-approximates-sdm/blob/HEAD/HugFace/SDM_Circ_Inter_Funcs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7cedca63fc0c0ef4","mcp_get_code":{"code_sha256":"7cedca63fc0c0ef4"}},{"arxiv_id":"2107.14293","paper":"/paper/self-supervised-transformer-for-multivariate","title":"Self-Supervised Transformer for Sparse and Irregularly Sampled Multivariate Clinical Time-Series","date":"2021-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sindhura97/STraTS","path":"src/preprocess_mimic_iii_large.py","file_url":"https://github.com/sindhura97/STraTS/blob/HEAD/src/preprocess_mimic_iii_large.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06ddfb40099e743b","mcp_get_code":{"code_sha256":"06ddfb40099e743b"}},{"arxiv_id":"2107.14293","paper":"/paper/self-supervised-transformer-for-multivariate","title":"Self-Supervised Transformer for Sparse and Irregularly Sampled Multivariate Clinical Time-Series","date":"2021-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sindhura97/STraTS","path":"src/preprocess_mimic_iii_large.py","file_url":"https://github.com/sindhura97/STraTS/blob/HEAD/src/preprocess_mimic_iii_large.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ff0290f2f537f28","mcp_get_code":{"code_sha256":"2ff0290f2f537f28"}},{"arxiv_id":"2106.05682","paper":"/paper/distribution-aware-semantics-oriented-pseudo","title":"DASO: Distribution-Aware Semantics-Oriented Pseudo-label for Imbalanced Semi-Supervised Learning","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ytaek-oh/daso","path":"lib/algorithm/darp_reproduce.py","file_url":"https://github.com/ytaek-oh/daso/blob/HEAD/lib/algorithm/darp_reproduce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f92ee98ae819cb89","mcp_get_code":{"code_sha256":"f92ee98ae819cb89"}},{"arxiv_id":"2106.01202","paper":"/paper/framing-rnn-as-a-kernel-method-a-neural-ode","title":"Framing RNN as a kernel method: A neural ODE approach","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"afermanian/rnn-kernel","path":"taylor_experiment.py","file_url":"https://github.com/afermanian/rnn-kernel/blob/HEAD/taylor_experiment.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":"18ae94532165a154","mcp_get_code":{"code_sha256":"18ae94532165a154"}},{"arxiv_id":"2105.10762","paper":"/paper/autolrs-automatic-learning-rate-schedule-by-1","title":"AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly","date":"2021-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuchenJin/autolrs","path":"autolrs_server.py","file_url":"https://github.com/YuchenJin/autolrs/blob/HEAD/autolrs_server.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e6c34b5d19d69a2","mcp_get_code":{"code_sha256":"3e6c34b5d19d69a2"}},{"arxiv_id":"2104.04987","paper":"/paper/autogl-a-library-for-automated-graph-learning","title":"AutoGL: A Library for Automated Graph Learning","date":"2021-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUMNLab/AutoGL-light","path":"autogllight/hpo/base.py","file_url":"https://github.com/THUMNLab/AutoGL-light/blob/HEAD/autogllight/hpo/base.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":"60ea3d41f4acf8b1","mcp_get_code":{"code_sha256":"60ea3d41f4acf8b1"}},{"arxiv_id":"2103.12959","paper":"/paper/solving-and-learning-nonlinear-pdes-with","title":"Solving and Learning Nonlinear PDEs with Gaussian Processes","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanc96/nonlinpdes-gpsolver","path":"main_NonLinElliptic2d.py","file_url":"https://github.com/yifanc96/nonlinpdes-gpsolver/blob/HEAD/main_NonLinElliptic2d.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f489b49ba9ae136d","mcp_get_code":{"code_sha256":"f489b49ba9ae136d"}},{"arxiv_id":"2101.05796","paper":"/paper/deflow-learning-complex-image-degradations","title":"DeFlow: Learning Complex Image Degradations from Unpaired Data with Conditional Flows","date":"2021-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hnt4499/DeFlow","path":"codes/models/modules/glow_arch.py","file_url":"https://github.com/hnt4499/DeFlow/blob/HEAD/codes/models/modules/glow_arch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fccf3dcb1b386875","mcp_get_code":{"code_sha256":"fccf3dcb1b386875"}},{"arxiv_id":"2012.06400","paper":"/paper/differential-evolution-for-neural","title":"Differential Evolution for Neural Architecture Search","date":"2020-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/DE-NAS","path":"denas/examples/nas101/run_de_nas101.py","file_url":"https://github.com/automl/DE-NAS/blob/HEAD/denas/examples/nas101/run_de_nas101.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0f2ccd77e1f26143","mcp_get_code":{"code_sha256":"0f2ccd77e1f26143"}},{"arxiv_id":"2011.05074","paper":"/paper/efficient-and-transferable-adversarial","title":"Efficient and Transferable Adversarial Examples from Bayesian Neural Networks","date":"2020-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"framartin/transferable-bnn-adv-ex","path":"plot_metrics.py","file_url":"https://github.com/framartin/transferable-bnn-adv-ex/blob/HEAD/plot_metrics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"ed16303a06db0443","mcp_get_code":{"code_sha256":"ed16303a06db0443"}},{"arxiv_id":"2010.09824","paper":"/paper/multi-objective-bayesian-optimization-for","title":"Multi-Objective Bayesian Optimization for Accelerator Tuning","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"roussel-ryan/Accelerator_MOBO","path":"examples/simple_mobo.py","file_url":"https://github.com/roussel-ryan/Accelerator_MOBO/blob/HEAD/examples/simple_mobo.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f379ee41b867c464","mcp_get_code":{"code_sha256":"f379ee41b867c464"}},{"arxiv_id":"2008.02268","paper":"/paper/nerf-in-the-wild-neural-radiance-fields-for","title":"NeRF in the Wild: Neural Radiance Fields for Unconstrained Photo Collections","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kwea123/nerf_pl","path":"extract_color_mesh.py","file_url":"https://github.com/kwea123/nerf_pl/blob/HEAD/extract_color_mesh.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7fb907fb8afead36","mcp_get_code":{"code_sha256":"7fb907fb8afead36"}},{"arxiv_id":"2007.08844","paper":"/paper/distribution-aligning-refinery-of-pseudo","title":"Distribution Aligning Refinery of Pseudo-label for Imbalanced Semi-supervised Learning","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbuing9/DARP","path":"common.py","file_url":"https://github.com/bbuing9/DARP/blob/HEAD/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73eab42215d7c5fb","mcp_get_code":{"code_sha256":"73eab42215d7c5fb"}},{"arxiv_id":"2006.07134","paper":"/paper/tight-approximate-differential-privacy-for","title":"Tight Differential Privacy for Discrete-Valued Mechanisms and for the Subsampled Gaussian Mechanism Using FFT","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DPBayes/PLD-Accountant","path":"fourier_accountant/experimental/subsampled_gaussian_bounds.py","file_url":"https://github.com/DPBayes/PLD-Accountant/blob/HEAD/fourier_accountant/experimental/subsampled_gaussian_bounds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2df6e3aed39035e5","mcp_get_code":{"code_sha256":"2df6e3aed39035e5"}},{"arxiv_id":"2006.04182","paper":"/paper/predictive-coding-approximates-backprop-along","title":"Predictive Coding Approximates Backprop along Arbitrary Computation Graphs","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BerenMillidge/PredictiveCodingBackprop","path":"numerical_results.py","file_url":"https://github.com/BerenMillidge/PredictiveCodingBackprop/blob/HEAD/numerical_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ae5584d5f6e6b28f","mcp_get_code":{"code_sha256":"ae5584d5f6e6b28f"}},{"arxiv_id":"2006.00702","paper":"/paper/interacting-particle-solutions-of-fokker","title":"Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimation","date":null,"month_inferred_from_arxiv_id":"2020-06","title_source":"archive","repo":"dimitra-maoutsa/odes_for_sdes","path":"odes_for_sdes/models/FHN_neuron.py","file_url":"https://github.com/dimitra-maoutsa/odes_for_sdes/blob/HEAD/odes_for_sdes/models/FHN_neuron.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee4a6b293a38def0","mcp_get_code":{"code_sha256":"ee4a6b293a38def0"}},{"arxiv_id":"2006.00702","paper":"/paper/interacting-particle-solutions-of-fokker","title":"Interacting particle solutions of Fokker-Planck equations through gradient-log-density estimation","date":null,"month_inferred_from_arxiv_id":"2020-06","title_source":"archive","repo":"dimitra-maoutsa/odes_for_sdes","path":"odes_for_sdes/models/two_dim_multiwell.py","file_url":"https://github.com/dimitra-maoutsa/odes_for_sdes/blob/HEAD/odes_for_sdes/models/two_dim_multiwell.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5dc93676e0febd49","mcp_get_code":{"code_sha256":"5dc93676e0febd49"}},{"arxiv_id":"2005.10881","paper":"/paper/revisiting-membership-inference-under","title":"Revisiting Membership Inference Under Realistic Assumptions","date":"2020-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bargavj/EvaluatingDPML","path":"improved_mi/interpret_results.py","file_url":"https://github.com/bargavj/EvaluatingDPML/blob/HEAD/improved_mi/interpret_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"013948fc6c807e9c","mcp_get_code":{"code_sha256":"013948fc6c807e9c"}},{"arxiv_id":"2002.02561","paper":"/paper/spectrum-dependent-learning-curves-in-kernel","title":"Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networks","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pehlevan-Group/NTK_Learning_Curves","path":"ntk_generalization/utils/theory_lc.py","file_url":"https://github.com/Pehlevan-Group/NTK_Learning_Curves/blob/HEAD/ntk_generalization/utils/theory_lc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8d9c2ce07937ea8a","mcp_get_code":{"code_sha256":"8d9c2ce07937ea8a"}},{"arxiv_id":"1909.08540","paper":"/paper/no-regret-learning-in-unknown-games-with","title":"No-Regret Learning in Unknown Games with Correlated Payoffs","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sessap/noregretgames","path":"Movie_recommendations/Main_Script.py","file_url":"https://github.com/sessap/noregretgames/blob/HEAD/Movie_recommendations/Main_Script.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aef23fd5e5a3f64a","mcp_get_code":{"code_sha256":"aef23fd5e5a3f64a"}},{"arxiv_id":"1905.12247","paper":"/paper/fast-mixing-of-metropolized-hamiltonian-monte","title":"Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients","date":"2019-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuachen/fastmixingHMC_public","path":"mcmc_gaussian_nonisotropic_d_exps.py","file_url":"https://github.com/yuachen/fastmixingHMC_public/blob/HEAD/mcmc_gaussian_nonisotropic_d_exps.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ecee13626733e8e","mcp_get_code":{"code_sha256":"4ecee13626733e8e"}},{"arxiv_id":"1905.06598","paper":"/paper/moglow-probabilistic-and-controllable-motion","title":"MoGlow: Probabilistic and controllable motion synthesis using normalising flows","date":"2019-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simonalexanderson/StyleGestures","path":"glow/models.py","file_url":"https://github.com/simonalexanderson/StyleGestures/blob/HEAD/glow/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"c8269d5944ff8d1a","mcp_get_code":{"code_sha256":"c8269d5944ff8d1a"}},{"arxiv_id":"1905.04519","paper":"/paper/interpret-federated-learning-with-shapley","title":"Interpret Federated Learning with Shapley Values","date":"2019-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crownpku/federated_shap","path":"federated_shap.py","file_url":"https://github.com/crownpku/federated_shap/blob/HEAD/federated_shap.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a4bc03655d50e577","mcp_get_code":{"code_sha256":"a4bc03655d50e577"}},{"arxiv_id":"1904.03537","paper":"/paper/convex-concave-backtracking-for-inertial","title":"Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmahesh/cocain-bpg-escapes-spurious-stationary-points","path":"contour_plot.py","file_url":"https://github.com/mmahesh/cocain-bpg-escapes-spurious-stationary-points/blob/HEAD/contour_plot.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"075afe4d626a2df1","mcp_get_code":{"code_sha256":"075afe4d626a2df1"}},{"arxiv_id":"1811.12386","paper":"/paper/tree-structured-recurrent-switching-linear","title":"Tree-Structured Recurrent Switching Linear Dynamical Systems for Multi-Scale Modeling","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catniplab/tree_structured_rslds","path":"examples/lorenz.py","file_url":"https://github.com/catniplab/tree_structured_rslds/blob/HEAD/examples/lorenz.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a3895c16b7e8438c","mcp_get_code":{"code_sha256":"a3895c16b7e8438c"}},{"arxiv_id":"1809.05042","paper":"/paper/hamiltonian-descent-methods","title":"Hamiltonian Descent Methods","date":"2018-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"takyamamoto/FirstExplicitMethod-HDM","path":"first_explicit_method.py","file_url":"https://github.com/takyamamoto/FirstExplicitMethod-HDM/blob/HEAD/first_explicit_method.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01e5e580ceeefa06","mcp_get_code":{"code_sha256":"01e5e580ceeefa06"}},{"arxiv_id":"1805.08610","paper":"/paper/optimization-fast-and-slow-optimally","title":"Optimization, fast and slow: optimally switching between local and Bayesian optimization","date":"2018-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markm541374/gpbo","path":"gpbo/examples/eihypdemo.py","file_url":"https://github.com/markm541374/gpbo/blob/HEAD/gpbo/examples/eihypdemo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"code_sha256_prefix":"ba2f344650d0a42a","mcp_get_code":{"code_sha256":"ba2f344650d0a42a"}},{"arxiv_id":"1805.08006","paper":"/paper/bidirectional-learning-for-robust-neural","title":"Bidirectional Learning for Robust Neural Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sidneyp/bidirectional","path":"bidirectional_proof.py","file_url":"https://github.com/sidneyp/bidirectional/blob/HEAD/bidirectional_proof.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"54383f7845419e7a","mcp_get_code":{"code_sha256":"54383f7845419e7a"}},{"arxiv_id":"1702.08064","paper":"/paper/ergodic-sdes-on-submanifolds-and-related","title":"Ergodic SDEs on submanifolds and related numerical sampling schemes","date":null,"month_inferred_from_arxiv_id":"2017-02","title_source":"archive","repo":"zwpku/sampling-on-levelset","path":"plot-scripts/ex1_elliptic.py","file_url":"https://github.com/zwpku/sampling-on-levelset/blob/HEAD/plot-scripts/ex1_elliptic.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5ae01b2dc1e4e36","mcp_get_code":{"code_sha256":"e5ae01b2dc1e4e36"}},{"arxiv_id":"1606.04474","paper":"/paper/learning-to-learn-by-gradient-descent-by","title":"Learning to learn by gradient descent by gradient descent","date":"2016-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangsenius/learning-to-learn-by-pytorch","path":"learning_to_learn.py","file_url":"https://github.com/yangsenius/learning-to-learn-by-pytorch/blob/HEAD/learning_to_learn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f7f03d4cde2161b","mcp_get_code":{"code_sha256":"6f7f03d4cde2161b"}},{"arxiv_id":"1602.05629","paper":"/paper/communication-efficient-learning-of-deep","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/fedjax","path":"fedjax/core/client_datasets_benchmark.py","file_url":"https://github.com/google/fedjax/blob/HEAD/fedjax/core/client_datasets_benchmark.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":"dcee316376a55eb4","mcp_get_code":{"code_sha256":"dcee316376a55eb4"}},{"arxiv_id":"1511.02222","paper":"/paper/deep-kernel-learning","title":"Deep Kernel Learning","date":"2015-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maka89/deep-kernel-gp","path":"example.py","file_url":"https://github.com/maka89/deep-kernel-gp/blob/HEAD/example.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dc7eaed619c6bc0d","mcp_get_code":{"code_sha256":"dc7eaed619c6bc0d"}},{"arxiv_id":"1506.02142","paper":"/paper/dropout-as-a-bayesian-approximation","title":"Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning","date":"2015-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arneschmidt/bayesian_deep_learning","path":"regression_with_GP.py","file_url":"https://github.com/arneschmidt/bayesian_deep_learning/blob/HEAD/regression_with_GP.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9dc92202a028ac23","mcp_get_code":{"code_sha256":"9dc92202a028ac23"}},{"arxiv_id":"1212.5701","paper":"/paper/adadelta-an-adaptive-learning-rate-method","title":"ADADELTA: An Adaptive Learning Rate Method","date":"2012-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arko98/Gradient-Descent-Algorithms","path":"Algorithms/Adagrad.py","file_url":"https://github.com/Arko98/Gradient-Descent-Algorithms/blob/HEAD/Algorithms/Adagrad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6a2fbba8acf6ffbd","mcp_get_code":{"code_sha256":"6a2fbba8acf6ffbd"}},{"arxiv_id":"aaai_30169","paper":null,"title":"arXiv:aaai_30169","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jacobwang925/path-integral-PINN","path":"src/autoencoder/utils.py","file_url":"https://github.com/jacobwang925/path-integral-PINN/blob/HEAD/src/autoencoder/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1554a3a338ca7efc","mcp_get_code":{"code_sha256":"1554a3a338ca7efc"}},{"arxiv_id":"Ji_MMGeo_Multimodal_Compositional_Geo-Localization_for_UAVs_ICCV_2025_paper","paper":null,"title":"arXiv:Ji_MMGeo_Multimodal_Compositional_Geo-Localization_for_UAVs_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yux1angJi/MMGeo","path":"game4loc/loss.py","file_url":"https://github.com/Yux1angJi/MMGeo/blob/HEAD/game4loc/loss.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":"1ef05a5fc312f36e","mcp_get_code":{"code_sha256":"1ef05a5fc312f36e"}}]}