{"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/sigmoid","entry":"sigmoid","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":216,"n_papers_ran":142,"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":138,"n_samples_ran":65,"n_samples_fingerprinted":62,"n_places":223,"n_places_pointer_only":69,"by_status":{"ran_honours":21,"ran_violates":18,"ran_draft_wrong":2,"ran_fixture":2,"ran":22,"unverified":73},"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.13628","paper":"/paper/arxiv-2608-13628","title":"Robust Dual-Model Collaborative Random Vector Functional Link Network","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"mtanveer1/KRPRVFL","path":"RVFL.py","file_url":"https://github.com/mtanveer1/KRPRVFL/blob/HEAD/RVFL.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1a3c174f69eae69e","mcp_get_code":{"code_sha256":"1a3c174f69eae69e"}},{"arxiv_id":"2608.10349","paper":"/paper/arxiv-2608-10349","title":"Beyond Detection Accuracy: Measuring Explanation Cost, Stability, and Utility for Resource-Aware IoT Intrusion Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AbdurrahmanTolay/resource-aware-iot-xai","path":"src/stage5a1_xgboost_additivity_validation.py","file_url":"https://github.com/AbdurrahmanTolay/resource-aware-iot-xai/blob/HEAD/src/stage5a1_xgboost_additivity_validation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"41a8c26143c09e15","mcp_get_code":{"code_sha256":"41a8c26143c09e15"}},{"arxiv_id":"2606.17249","paper":"/paper/arxiv-2606-17249","title":"From Compression to Deployment: Real-Time and Energy-Efficient FastGRNN on Ultra-Constrained Microcontrollers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"emre1998/fastgrnn-har","path":"fastgrnn_numpy.py","file_url":"https://github.com/emre1998/fastgrnn-har/blob/HEAD/fastgrnn_numpy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"156855983d880ed5","mcp_get_code":{"code_sha256":"156855983d880ed5"}},{"arxiv_id":"2606.10528","paper":"/paper/arxiv-2606-10528","title":"Representation-Aware Advantage Estimation: Your Reward Model Provides More Than A Scalar Output","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"fanqiwan/FuseAI","path":"FuseChat/train/align_token_and_vocab.py","file_url":"https://github.com/fanqiwan/FuseAI/blob/HEAD/FuseChat/train/align_token_and_vocab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d0b132e4577e5bbb","mcp_get_code":{"code_sha256":"d0b132e4577e5bbb"}},{"arxiv_id":"2606.03432","paper":"/paper/arxiv-2606-03432","title":"A Hybrid Approach For Malware Classification Using Secondary Features Fusion","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"RGF-team/rgf","path":"python-package/rgf/utils.py","file_url":"https://github.com/RGF-team/rgf/blob/HEAD/python-package/rgf/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2606.02232","paper":"/paper/arxiv-2606-02232","title":"A Doeblin-Anchored Contrastive Chart for Learning Markov Transition Kernels","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Ao-Xu/doeblin_exp_2026","path":"experiments/run_experiments_v2.py","file_url":"https://github.com/Ao-Xu/doeblin_exp_2026/blob/HEAD/experiments/run_experiments_v2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f782d0cc5f850821","mcp_get_code":{"code_sha256":"f782d0cc5f850821"}},{"arxiv_id":"2605.21341","paper":"/paper/arxiv-2605-21341","title":"Semiparametric Efficient Bilevel Gradient Estimation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation","path":"Bellman_b2_inference_experiment.py","file_url":"https://github.com/fareselkhoury/Semiparametric-Efficient-Bilevel-Gradient-Estimation/blob/HEAD/Bellman_b2_inference_experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c4ac7d13b48e5db","mcp_get_code":{"code_sha256":"5c4ac7d13b48e5db"}},{"arxiv_id":"2604.22893","paper":"/paper/arxiv-2604-22893","title":"Utility-Aware Data Pricing: Token-Level Quality and Empirical Training Gain for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"BDS-SDU/utility-aware-data-pricing","path":"data_pricing/valuation.py","file_url":"https://github.com/BDS-SDU/utility-aware-data-pricing/blob/HEAD/data_pricing/valuation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e431bb0c81b02097","mcp_get_code":{"code_sha256":"e431bb0c81b02097"}},{"arxiv_id":"2604.21260","paper":"/paper/arxiv-2604-21260","title":"Calibeating Prediction-Powered Inference","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Larsvanderlaan/ppi-aipw","path":"src/ppi_aipw/_api.py","file_url":"https://github.com/Larsvanderlaan/ppi-aipw/blob/HEAD/src/ppi_aipw/_api.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d3cb240d60e1166a","mcp_get_code":{"code_sha256":"d3cb240d60e1166a"}},{"arxiv_id":"2604.07848","paper":"/paper/arxiv-2604-07848","title":"Information-Theoretic Requirements for Gradient-Based Task Affinity Estimation in Multi-Task Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"JasperZG/gradientmtl","path":"experiments/cross_domain_validation.py","file_url":"https://github.com/JasperZG/gradientmtl/blob/HEAD/experiments/cross_domain_validation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd392bf580ac3e08","mcp_get_code":{"code_sha256":"dd392bf580ac3e08"}},{"arxiv_id":"2603.20388","paper":"/paper/arxiv-2603-20388","title":"From Cross-Validation to SURE: Asymptotic Risk of Tuned Regularized Estimators","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"maxkasy/cv_and_sure_simulations","path":"cvsure_sim.py","file_url":"https://github.com/maxkasy/cv_and_sure_simulations/blob/HEAD/cvsure_sim.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"550aa44e7c263eec","mcp_get_code":{"code_sha256":"550aa44e7c263eec"}},{"arxiv_id":"2602.12113","paper":"/paper/arxiv-2602-12113","title":"Adaptive Reflection and Length Coordinated Penalty (ARLCP) STOP UNNECESSARY REFLECTION: TRAINING LRMS FOR EFFICIENT REASONING WITH ADAPTIVE REFLEC-TION AND LENGTH COORDINATED PENALTY","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ZeweiYu1/ARLCP","path":"src/rm.py","file_url":"https://github.com/ZeweiYu1/ARLCP/blob/HEAD/src/rm.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2601.18222","paper":"/paper/arxiv-2601-18222","title":"HomoFM: Deep Homography Estimation with Flow Matching","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hmf21/HomoFM","path":"model/depthfm.py","file_url":"https://github.com/hmf21/HomoFM/blob/HEAD/model/depthfm.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2601.16376","paper":"/paper/arxiv-2601-16376","title":"Polymer-Agent: Large Language Model Agent for Polymer Design","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"TheJacksonLab/OpenMacromolecularGenome","path":"scscore/scscore.py","file_url":"https://github.com/TheJacksonLab/OpenMacromolecularGenome/blob/HEAD/scscore/scscore.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"833aaa4bda94787a","mcp_get_code":{"code_sha256":"833aaa4bda94787a"}},{"arxiv_id":"2510.17671","paper":"/paper/arxiv-2510-17671","title":"LILO: Bayesian Optimization with Natural Language Feedback","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"facebookresearch/lilo","path":"lilo/utils.py","file_url":"https://github.com/facebookresearch/lilo/blob/HEAD/lilo/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d05e96dac85acf2","mcp_get_code":{"code_sha256":"7d05e96dac85acf2"}},{"arxiv_id":"2510.12503","paper":"/paper/arxiv-2510-12503","title":"The robustness of differentiable Causal Discovery in misspecified Scenarios","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"fishmoon1234/DAG-NoCurl","path":"BPR.py","file_url":"https://github.com/fishmoon1234/DAG-NoCurl/blob/HEAD/BPR.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":"d39a275f8a95ded5","mcp_get_code":{"code_sha256":"d39a275f8a95ded5"}},{"arxiv_id":"2506.07673","paper":"/paper/how-benchmark-prediction-from-fewer-data","title":"How Benchmark Prediction from Fewer Data Misses the Mark","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socialfoundations/benchmark-prediction","path":"benchpred/tiny_bench.py","file_url":"https://github.com/socialfoundations/benchmark-prediction/blob/HEAD/benchpred/tiny_bench.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a01687b77f001026","mcp_get_code":{"code_sha256":"a01687b77f001026"}},{"arxiv_id":"2506.05454","paper":"/paper/zeroth-order-optimization-finds-flat-minima","title":"Zeroth-Order Optimization Finds Flat Minima","date":"2025-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/FlatZero","path":"svm_logreg/logreg.py","file_url":"https://github.com/Liang137/FlatZero/blob/HEAD/svm_logreg/logreg.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a911f9cacbc9faf4","mcp_get_code":{"code_sha256":"a911f9cacbc9faf4"}},{"arxiv_id":"2505.13417","paper":"/paper/adaptthink-reasoning-models-can-learn-when-to","title":"AdaptThink: Reasoning Models Can Learn When to Think","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/adaptthink","path":"src/adapt_think_reward_manager.py","file_url":"https://github.com/thu-keg/adaptthink/blob/HEAD/src/adapt_think_reward_manager.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2505.11532","paper":"/paper/revisiting-adversarial-perception-attacks-and","title":"Revisiting Adversarial Perception Attacks and Defense Methods on Autonomous Driving Systems","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2504.13630","paper":"/paper/remedy-learning-machine-translation","title":"Remedy: Learning Machine Translation Evaluation from Human Preferences with Reward Modeling","date":"2025-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Smu-Tan/Remedy","path":"remedy/toolbox/calibration.py","file_url":"https://github.com/Smu-Tan/Remedy/blob/HEAD/remedy/toolbox/calibration.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":"9da49703a6c63108","mcp_get_code":{"code_sha256":"9da49703a6c63108"}},{"arxiv_id":"2502.10436","paper":"/paper/merge-3-efficient-evolutionary-merging-on","title":"MERGE$^3$: Efficient Evolutionary Merging on Consumer-grade GPUs","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tommasomncttn/merge3","path":"src/mergenetic/evaluation/perf_estimation.py","file_url":"https://github.com/tommasomncttn/merge3/blob/HEAD/src/mergenetic/evaluation/perf_estimation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a911f9cacbc9faf4","mcp_get_code":{"code_sha256":"a911f9cacbc9faf4"}},{"arxiv_id":"2412.19048","paper":"/paper/jasper-and-stella-distillation-of-sota","title":"Jasper and Stella: distillation of SOTA embedding models","date":"2024-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NLPJCL/RAG-Retrieval","path":"rag_retrieval/infer/reranker_models/llm_rankers.py","file_url":"https://github.com/NLPJCL/RAG-Retrieval/blob/HEAD/rag_retrieval/infer/reranker_models/llm_rankers.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2412.05783","paper":"/paper/two-way-deconfounder-for-off-policy","title":"Two-way Deconfounder for Off-policy Evaluation in Causal Reinforcement Learning","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fsmiu/Two-way-Deconfounder","path":"MCTrue_toy.py","file_url":"https://github.com/fsmiu/Two-way-Deconfounder/blob/HEAD/MCTrue_toy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"197071e3c0ddf1f4","mcp_get_code":{"code_sha256":"197071e3c0ddf1f4"}},{"arxiv_id":"2412.03187","paper":"/paper/weighted-reward-preference-optimization-for","title":"Weighted-Reward Preference Optimization for Implicit Model Fusion","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/fuseai","path":"FuseChat/train/align_token_and_vocab.py","file_url":"https://github.com/fanqiwan/fuseai/blob/HEAD/FuseChat/train/align_token_and_vocab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d0b132e4577e5bbb","mcp_get_code":{"code_sha256":"d0b132e4577e5bbb"}},{"arxiv_id":"2412.01981","paper":"/paper/free-process-rewards-without-process-labels","title":"Free Process Rewards without Process Labels","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/implicitprm","path":"eval/processbench.py","file_url":"https://github.com/lifan-yuan/implicitprm/blob/HEAD/eval/processbench.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":"1c192362b31daf5b","mcp_get_code":{"code_sha256":"1c192362b31daf5b"}},{"arxiv_id":"2411.19458","paper":"/paper/multiview-equivariance-improves-3d","title":"Multiview Equivariance Improves 3D Correspondence Understanding with Minimal Feature Finetuning","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"4b3a13b8aba7b6dc","mcp_get_code":{"code_sha256":"4b3a13b8aba7b6dc"}},{"arxiv_id":"2410.17980","paper":"/paper/stick-breaking-attention","title":"Scaling Stick-Breaking Attention: An Efficient Implementation and In-depth Study","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/dolomite-engine","path":"lm_engine/kernels/torch_utils.py","file_url":"https://github.com/ibm/dolomite-engine/blob/HEAD/lm_engine/kernels/torch_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":"dd3979e6d750a272","mcp_get_code":{"code_sha256":"dd3979e6d750a272"}},{"arxiv_id":"2410.09883","paper":"/paper/physics-informed-neural-mapping-and-motion","title":"Physics-informed Neural Mapping and Motion Planning in Unknown Environments","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"rtlyc/antfields-demo","path":"models/model_igibson.py","file_url":"https://github.com/rtlyc/antfields-demo/blob/HEAD/models/model_igibson.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0c4db92254391edf","mcp_get_code":{"code_sha256":"0c4db92254391edf"}},{"arxiv_id":"2410.01692","paper":"/paper/u-shaped-and-inverted-u-scaling-behind","title":"U-shaped and Inverted-U Scaling behind Emergent Abilities of Large Language Models","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tony10101105/ExpEmergence","path":"utils.py","file_url":"https://github.com/tony10101105/ExpEmergence/blob/HEAD/utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2409.17978","paper":"/paper/hydravit-stacking-heads-for-a-scalable-vit","title":"HydraViT: Stacking Heads for a Scalable ViT","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ds-kiel/HydraViT","path":"timm/layers/activations.py","file_url":"https://github.com/ds-kiel/HydraViT/blob/HEAD/timm/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2409.03563","paper":"/paper/100-instances-is-all-you-need-predicting-the","title":"100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instances","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorypack/referenceinstancespredictability","path":"src/irt.py","file_url":"https://github.com/lorypack/referenceinstancespredictability/blob/HEAD/src/irt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"a01687b77f001026","mcp_get_code":{"code_sha256":"a01687b77f001026"}},{"arxiv_id":"2408.13983","paper":"/paper/dual-path-adversarial-lifting-for-domain","title":"Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushuntang/dpal","path":"models/layers/activations.py","file_url":"https://github.com/yushuntang/dpal/blob/HEAD/models/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2406.07529","paper":"/paper/map-low-compute-model-merging-with-amortized","title":"MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximation","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luli-git/MAP","path":"MAP.py","file_url":"https://github.com/luli-git/MAP/blob/HEAD/MAP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e8f86d8ffb36ad0","mcp_get_code":{"code_sha256":"3e8f86d8ffb36ad0"}},{"arxiv_id":"2405.20693","paper":"/paper/r-2-gaussian-rectifying-radiative-gaussian","title":"R$^2$-Gaussian: Rectifying Radiative Gaussian Splatting for Tomographic Reconstruction","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyuanhao1998/x-gaussian","path":"point_cloud_vis.py","file_url":"https://github.com/caiyuanhao1998/x-gaussian/blob/HEAD/point_cloud_vis.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2405.17202","paper":"/paper/efficient-multi-prompt-evaluation-of-llms","title":"Efficient multi-prompt evaluation of LLMs","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/prompteval","path":"prompteval/methods.py","file_url":"https://github.com/felipemaiapolo/prompteval/blob/HEAD/prompteval/methods.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4621865e9ec9367","mcp_get_code":{"code_sha256":"d4621865e9ec9367"}},{"arxiv_id":"2405.07314","paper":"/paper/learnable-tokenizer-for-llm-based-generative","title":"Learnable Item Tokenization for Generative Recommendation","date":"2024-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"honghuibao2000/letter","path":"LETTER-TIGER/modeling_letter.py","file_url":"https://github.com/honghuibao2000/letter/blob/HEAD/LETTER-TIGER/modeling_letter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f47b8733b06d4cb3","mcp_get_code":{"code_sha256":"f47b8733b06d4cb3"}},{"arxiv_id":"2405.06691","paper":"/paper/fleet-of-agents-coordinated-problem-solving","title":"Fleet of Agents: Coordinated Problem Solving with Large Language Models","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"au-clan/FoA","path":"utils.py","file_url":"https://github.com/au-clan/FoA/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc3fde22457a5dee","mcp_get_code":{"code_sha256":"dc3fde22457a5dee"}},{"arxiv_id":"2405.04715","paper":"/paper/causality-pursuit-from-heterogeneous","title":"Causality Pursuit from Heterogeneous Environments via Neural Adversarial Invariance Learning","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wmyw96/fair","path":"methods/fair_algo.py","file_url":"https://github.com/wmyw96/fair/blob/HEAD/methods/fair_algo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f069ff33169e6799","mcp_get_code":{"code_sha256":"f069ff33169e6799"}},{"arxiv_id":"2404.19620","paper":"/paper/be-aware-of-the-neighborhood-effect-modeling","title":"Be Aware of the Neighborhood Effect: Modeling Selection Bias under Interference","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoxuanli-pku/iclr24-interference","path":"real-world/matrix_factorization.py","file_url":"https://github.com/haoxuanli-pku/iclr24-interference/blob/HEAD/real-world/matrix_factorization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b30dd0f0a1d1fde8","mcp_get_code":{"code_sha256":"b30dd0f0a1d1fde8"}},{"arxiv_id":"2404.19596","paper":"/paper/debiased-collaborative-filtering-with-kernel","title":"Debiased Collaborative Filtering with Kernel-Based Causal Balancing","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoxuanli-pku/ICLR24-Kernel-Balancing","path":"baselines.py","file_url":"https://github.com/haoxuanli-pku/ICLR24-Kernel-Balancing/blob/HEAD/baselines.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b30dd0f0a1d1fde8","mcp_get_code":{"code_sha256":"b30dd0f0a1d1fde8"}},{"arxiv_id":"2404.17287","paper":"/paper/when-to-trust-llms-aligning-confidence-with","title":"When to Trust LLMs: Aligning Confidence with Response Quality","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taoshuchang/conqord","path":"step4_evaluation/gpt_evaluation.py","file_url":"https://github.com/taoshuchang/conqord/blob/HEAD/step4_evaluation/gpt_evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"98ad060df3b6c611","mcp_get_code":{"code_sha256":"98ad060df3b6c611"}},{"arxiv_id":"2404.16493","paper":"/paper/commonsense-prototype-for-outdoor","title":"Commonsense Prototype for Outdoor Unsupervised 3D Object Detection","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hailanyi/CPD","path":"cpd/unsupervised_core/outline_utils.py","file_url":"https://github.com/hailanyi/CPD/blob/HEAD/cpd/unsupervised_core/outline_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c2f8b16d86cde8e1","mcp_get_code":{"code_sha256":"c2f8b16d86cde8e1"}},{"arxiv_id":"2404.07839","paper":"/paper/recurrentgemma-moving-past-transformers-for","title":"RecurrentGemma: Moving Past Transformers for Efficient Open Language Models","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/recurrentgemma","path":"recurrentgemma/jax/complex_lib.py","file_url":"https://github.com/google-deepmind/recurrentgemma/blob/HEAD/recurrentgemma/jax/complex_lib.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":"976bdf5aa58257cb","mcp_get_code":{"code_sha256":"976bdf5aa58257cb"}},{"arxiv_id":"2404.01882","paper":"/paper/scene-adaptive-sparse-transformer-for-event","title":"Scene Adaptive Sparse Transformer for Event-based Object Detection","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterande/sast","path":"models/layers/SAST/layers/activations.py","file_url":"https://github.com/peterande/sast/blob/HEAD/models/layers/SAST/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2403.16883","paper":"/paper/discrete-latent-graph-generative-modeling","title":"GLAD: Improving Latent Graph Generative Modeling with Simple Quantization","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"notani/python-glad","path":"glad.py","file_url":"https://github.com/notani/python-glad/blob/HEAD/glad.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6c965eb305670ea0","mcp_get_code":{"code_sha256":"6c965eb305670ea0"}},{"arxiv_id":"2403.14606","paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"control_flows/plot_global_vs_local_smoothing.py","file_url":"https://github.com/diffprog/code/blob/HEAD/control_flows/plot_global_vs_local_smoothing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1af82a1fc3f8bb07","mcp_get_code":{"code_sha256":"1af82a1fc3f8bb07"}},{"arxiv_id":"2403.12729","paper":"/paper/posterior-uncertainty-quantification-in","title":"Posterior Uncertainty Quantification in Neural Networks using Data Augmentation","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2403.11348","paper":"/paper/colep-certifiably-robust-learning-reasoning","title":"COLEP: Certifiably Robust Learning-Reasoning Conformal Prediction via Probabilistic Circuits","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangmintong/COLEP","path":"arc/models.py","file_url":"https://github.com/kangmintong/COLEP/blob/HEAD/arc/models.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2403.09346","paper":"/paper/avibench-towards-evaluating-the-robustness-of","title":"B-AVIBench: Towards Evaluating the Robustness of Large Vision-Language Model on Black-box Adversarial Visual-Instructions","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghao5201/b-avibench","path":"image_attack_tool/models/evolutionary_attack.py","file_url":"https://github.com/zhanghao5201/b-avibench/blob/HEAD/image_attack_tool/models/evolutionary_attack.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b7880bde365e8087","mcp_get_code":{"code_sha256":"b7880bde365e8087"}},{"arxiv_id":"2403.04160","paper":"/paper/improving-retrieval-in-theme-specific","title":"Improving Retrieval in Theme-specific Applications using a Corpus Topical Taxonomy","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeongKu-Kang/ToTER_WWW24","path":"Utils.py","file_url":"https://github.com/SeongKu-Kang/ToTER_WWW24/blob/HEAD/Utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2403.04116","paper":"/paper/radiative-gaussian-splatting-for-efficient-x","title":"Radiative Gaussian Splatting for Efficient X-ray Novel View Synthesis","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyuanhao1998/X-Gaussian","path":"point_cloud_vis.py","file_url":"https://github.com/caiyuanhao1998/X-Gaussian/blob/HEAD/point_cloud_vis.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2402.19460","paper":"/paper/benchmarking-uncertainty-disentanglement","title":"Benchmarking Uncertainty Disentanglement: Specialized Uncertainties for Specialized Tasks","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bmucsanyi/bud","path":"bud/layers/activations.py","file_url":"https://github.com/bmucsanyi/bud/blob/HEAD/bud/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2402.18392","paper":"/paper/unveiling-the-potential-of-robustness-in","title":"Unveiling the Potential of Robustness in Selecting Conditional Average Treatment Effect Estimators","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiyhuang3/CATE_estimator_selection","path":"ACIC_generate.py","file_url":"https://github.com/yiyhuang3/CATE_estimator_selection/blob/HEAD/ACIC_generate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"56d252c766b19ec0","mcp_get_code":{"code_sha256":"56d252c766b19ec0"}},{"arxiv_id":"2402.17229","paper":"/paper/preserving-fairness-generalization-in","title":"Preserving Fairness Generalization in Deepfake Detection","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"purdue-m2/fairness-generalization","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/fairness-generalization/blob/HEAD/training/fairness_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"396256bd807f90dc","mcp_get_code":{"code_sha256":"396256bd807f90dc"}},{"arxiv_id":"2402.14992","paper":"/paper/tinybenchmarks-evaluating-llms-with-fewer","title":"tinyBenchmarks: evaluating LLMs with fewer examples","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/tinybenchmarks","path":"demo/utils.py","file_url":"https://github.com/felipemaiapolo/tinybenchmarks/blob/HEAD/demo/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a911f9cacbc9faf4","mcp_get_code":{"code_sha256":"a911f9cacbc9faf4"}},{"arxiv_id":"2402.14992","paper":"/paper/tinybenchmarks-evaluating-llms-with-fewer","title":"tinyBenchmarks: evaluating LLMs with fewer examples","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/efficbench","path":"utils.py","file_url":"https://github.com/felipemaiapolo/efficbench/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"613d5fa522ce2fe7","mcp_get_code":{"code_sha256":"613d5fa522ce2fe7"}},{"arxiv_id":"2402.11338","paper":"/paper/fair-classification-with-partial-feedback-an","title":"Fair Classification with Partial Feedback: An Exploration-Based Data Collection Approach","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaykeswani/fair-classification-with-partial-feedback","path":"algorithms.py","file_url":"https://github.com/vijaykeswani/fair-classification-with-partial-feedback/blob/HEAD/algorithms.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"549a2707b6d65eb6","mcp_get_code":{"code_sha256":"549a2707b6d65eb6"}},{"arxiv_id":"2402.08579","paper":"/paper/training-coupled-phase-oscillators-as-a","title":"Training Coupled Phase Oscillators as a Neuromorphic Platform using Equilibrium Propagation","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ClaraWanjura/neuroscatter","path":"fashionMNIST/conv_ANN_small.py","file_url":"https://github.com/ClaraWanjura/neuroscatter/blob/HEAD/fashionMNIST/conv_ANN_small.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"231f6788694b28f8","mcp_get_code":{"code_sha256":"231f6788694b28f8"}},{"arxiv_id":"2402.04744","paper":"/paper/progressive-gradient-flow-for-robust-n-m","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abhibambhaniya/progressive_gradient_flow_nm_sparsity","path":"timm/layers/activations.py","file_url":"https://github.com/abhibambhaniya/progressive_gradient_flow_nm_sparsity/blob/HEAD/timm/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2402.04129","paper":"/paper/ovor-oneprompt-with-virtual-outlier","title":"OVOR: OnePrompt with Virtual Outlier Regularization for Rehearsal-Free Class-Incremental Learning","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/timm","path":"timm/layers/activations.py","file_url":"https://github.com/pprp/timm/blob/HEAD/timm/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2401.17992","paper":"/paper/multilinear-operator-networks","title":"Multilinear Operator Networks","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Allencheng97/Multilinear_Operator_Networks","path":"timm/layers/activations.py","file_url":"https://github.com/Allencheng97/Multilinear_Operator_Networks/blob/HEAD/timm/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2401.08513","paper":"/paper/x-hacking-the-threat-of-misguided-automl","title":"X Hacking: The Threat of Misguided AutoML","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"selbosh/p-hacking","path":"src/rahulsStuff/experiments/source/graphs.py","file_url":"https://github.com/selbosh/p-hacking/blob/HEAD/src/rahulsStuff/experiments/source/graphs.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2401.03214","paper":"/paper/understanding-representation-learnability-of","title":"Understanding Representation Learnability of Nonlinear Self-Supervised Learning","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanshuiyin/AAAI-2023-The-Learnability-of-Nonlinear-SSL","path":"SSL_update_process.py","file_url":"https://github.com/wanshuiyin/AAAI-2023-The-Learnability-of-Nonlinear-SSL/blob/HEAD/SSL_update_process.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2401.02683","paper":"/paper/geometric-facilitated-denoising-diffusion","title":"Geometric-Facilitated Denoising Diffusion Model for 3D Molecule Generation","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LEOXC1571/GFMDiff","path":"models/diff/noise.py","file_url":"https://github.com/LEOXC1571/GFMDiff/blob/HEAD/models/diff/noise.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"152398a541d26c5a","mcp_get_code":{"code_sha256":"152398a541d26c5a"}},{"arxiv_id":"2312.13236","paper":"/paper/diffusion-models-with-learned-adaptive-noise","title":"Diffusion Models With Learned Adaptive Noise","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-sahoo/mulan","path":"ldm/model_vdm.py","file_url":"https://github.com/s-sahoo/mulan/blob/HEAD/ldm/model_vdm.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":"ce72b6af52c249b8","mcp_get_code":{"code_sha256":"ce72b6af52c249b8"}},{"arxiv_id":"2312.10616","paper":"/paper/distilvpr-cross-modal-knowledge-distillation","title":"DistilVPR: Cross-Modal Knowledge Distillation for Visual Place Recognition","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sijieaaa/distilvpr","path":"models/loss_utils.py","file_url":"https://github.com/sijieaaa/distilvpr/blob/HEAD/models/loss_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"80c48ffa0d75f822","mcp_get_code":{"code_sha256":"80c48ffa0d75f822"}},{"arxiv_id":"2311.17327","paper":"/paper/improving-self-supervised-molecular-1","title":"Improving Self-supervised Molecular Representation Learning using Persistent Homology","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luoyk1999/molecular-homology","path":"finetune/finetune.py","file_url":"https://github.com/luoyk1999/molecular-homology/blob/HEAD/finetune/finetune.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd6b2ab1d9d8e062","mcp_get_code":{"code_sha256":"dd6b2ab1d9d8e062"}},{"arxiv_id":"2311.05420","paper":"/paper/counterfactually-fair-representation","title":"Counterfactually Fair Representation","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-srml/cf_representation_learning","path":"CVAE/fair_classifier_d.py","file_url":"https://github.com/osu-srml/cf_representation_learning/blob/HEAD/CVAE/fair_classifier_d.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2310.17488","paper":"/paper/lightlm-a-lightweight-deep-and-narrow","title":"LightLM: A Lightweight Deep and Narrow Language Model for Generative Recommendation","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongyuanjushi/lightlm","path":"indexing/GID_generation.py","file_url":"https://github.com/dongyuanjushi/lightlm/blob/HEAD/indexing/GID_generation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2310.11211","paper":"/paper/understanding-fairness-surrogate-functions-in","title":"Understanding Fairness Surrogate Functions in Algorithmic Fairness","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yw101004244/Understanding-Fairness-Surrogate-Functions","path":"lib/loss_funcs.py","file_url":"https://github.com/yw101004244/Understanding-Fairness-Surrogate-Functions/blob/HEAD/lib/loss_funcs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5e06511f6f77154d","mcp_get_code":{"code_sha256":"5e06511f6f77154d"}},{"arxiv_id":"2310.10839","paper":"/paper/collision-cone-control-barrier-functions","title":"Collision Cone Control Barrier Functions: Experimental Validation on UGVs for Kinematic Obstacle Avoidance","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":"archive","repo":"tayalmanan28/Safe-Legged-CollisionCone-CBF","path":"mpc_controller/cbf/utils.py","file_url":"https://github.com/tayalmanan28/Safe-Legged-CollisionCone-CBF/blob/HEAD/mpc_controller/cbf/utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2310.10537","paper":"/paper/microscaling-data-formats-for-deep-learning","title":"Microscaling Data Formats for Deep Learning","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/microxcaling","path":"mx/activations.py","file_url":"https://github.com/microsoft/microxcaling/blob/HEAD/mx/activations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb051d6d1c91807f","mcp_get_code":{"code_sha256":"bb051d6d1c91807f"}},{"arxiv_id":"2310.01224","paper":"/paper/revisiting-mobility-modeling-with-graph-a","title":"Revisiting Mobility Modeling with Graph: A Graph Transformer Model for Next Point-of-Interest Recommendation","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukayo/mobgt","path":"baseline_models/DeepMove/train_foursquare.py","file_url":"https://github.com/yukayo/mobgt/blob/HEAD/baseline_models/DeepMove/train_foursquare.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2310.02275","paper":"/paper/muse-gnn-learning-unified-gene-representation","title":"MuSe-GNN: Learning Unified Gene Representation From Multimodal Biological Graph Data","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HelloWorldLTY/MuSe-GNN","path":"Model/MuSeGNN_all_tissues.py","file_url":"https://github.com/HelloWorldLTY/MuSe-GNN/blob/HEAD/Model/MuSeGNN_all_tissues.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2309.17130","paper":"/paper/grande-gradient-based-decision-tree-ensembles","title":"GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-marton/gradtree","path":"experiments_paper_gradtree/utilities/GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/GDT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00ecfa2a9dd20434","mcp_get_code":{"code_sha256":"00ecfa2a9dd20434"}},{"arxiv_id":"2309.16108","paper":"/paper/channel-vision-transformers-an-image-is-worth","title":"Channel Vision Transformers: An Image Is Worth 1 x 16 x 16 Words","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insitro/channelvit","path":"channelvit/backbone/fan.py","file_url":"https://github.com/insitro/channelvit/blob/HEAD/channelvit/backbone/fan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1ab2898fd19b53d9","mcp_get_code":{"code_sha256":"1ab2898fd19b53d9"}},{"arxiv_id":"2309.12530","paper":"/paper/a-sentence-speaks-a-thousand-images-domain","title":"A Sentence Speaks a Thousand Images: Domain Generalization through Distilling CLIP with Language Guidance","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OoDBag/RISE","path":"timm/layers/activations.py","file_url":"https://github.com/OoDBag/RISE/blob/HEAD/timm/layers/activations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d83b6ecf3cdc1d6a","mcp_get_code":{"code_sha256":"d83b6ecf3cdc1d6a"}},{"arxiv_id":"2309.03020","paper":"/paper/seal-a-framework-for-systematic-evaluation-of","title":"SEAL: A Framework for Systematic Evaluation of Real-World Super-Resolution","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XPixelGroup/SEAL","path":"scripts/metrics/calculate_AR_RPR.py","file_url":"https://github.com/XPixelGroup/SEAL/blob/HEAD/scripts/metrics/calculate_AR_RPR.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2308.15122","paper":"/paper/spikebert-a-language-spikformer-trained-with","title":"SpikeBERT: A Language Spikformer Learned from BERT with Knowledge Distillation","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lvchangze/SpikeBERT","path":"snntorch/surrogate.py","file_url":"https://github.com/Lvchangze/SpikeBERT/blob/HEAD/snntorch/surrogate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"20a427d41b37eb17","mcp_get_code":{"code_sha256":"20a427d41b37eb17"}},{"arxiv_id":"2306.12625","paper":"/paper/communication-efficient-federated-learning-20","title":"Adaptive Compression in Federated Learning via Side Information","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francescopase/federated-klms","path":"flower_fl/clients/fedpm_client.py","file_url":"https://github.com/francescopase/federated-klms/blob/HEAD/flower_fl/clients/fedpm_client.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2306.05082","paper":"/paper/the-importance-of-time-in-causal-algorithmic","title":"The Importance of Time in Causal Algorithmic Recourse","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marti5ini/time-car","path":"src/utils.py","file_url":"https://github.com/marti5ini/time-car/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f5739b1dda083a1","mcp_get_code":{"code_sha256":"8f5739b1dda083a1"}},{"arxiv_id":"2306.01896","paper":"/paper/tackling-unbounded-state-spaces-in-continuing","title":"Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badger-rl/stop","path":"nmodel.py","file_url":"https://github.com/badger-rl/stop/blob/HEAD/nmodel.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"604c5823be725722","mcp_get_code":{"code_sha256":"604c5823be725722"}},{"arxiv_id":"2305.19894","paper":"/paper/med-unic-unifying-cross-lingual-medical-1","title":"Med-UniC: Unifying Cross-Lingual Medical Vision-Language Pre-Training by Diminishing Bias","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sustechbruce/med-unic","path":"zero-shot/zero_shot.py","file_url":"https://github.com/sustechbruce/med-unic/blob/HEAD/zero-shot/zero_shot.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1846a09dc0fdcb18","mcp_get_code":{"code_sha256":"1846a09dc0fdcb18"}},{"arxiv_id":"2305.06535","paper":"/paper/kga-a-general-machine-unlearning-framework","title":"KGA: A General Machine Unlearning Framework Based on Knowledge Gap Alignment","date":"2023-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingzhi-wang/kgaunlearn","path":"classification/run_classification.py","file_url":"https://github.com/lingzhi-wang/kgaunlearn/blob/HEAD/classification/run_classification.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2305.01068","paper":"/paper/personalized-federated-learning-under-mixture","title":"Personalized Federated Learning under Mixture of Distributions","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zshuai8/FedGMM_ICML2023","path":"fedem_plot.py","file_url":"https://github.com/zshuai8/FedGMM_ICML2023/blob/HEAD/fedem_plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"592303d3ca37b03a","mcp_get_code":{"code_sha256":"592303d3ca37b03a"}},{"arxiv_id":"2305.00070","paper":"/paper/online-platt-scaling-with-calibeating","title":"Online Platt Scaling with Calibeating","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aigen/df-posthoc-calibration","path":"Online Platt Scaling with Calibeating/calibration.py","file_url":"https://github.com/aigen/df-posthoc-calibration/blob/HEAD/Online%20Platt%20Scaling%20with%20Calibeating/calibration.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f8558288ee058a68","mcp_get_code":{"code_sha256":"f8558288ee058a68"}},{"arxiv_id":"2304.14831","paper":"/paper/earning-extra-performance-from-restrictive","title":"Earning Extra Performance from Restrictive Feedbacks","date":"2023-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kylejingli/EXPECTED","path":"adult/income_prediction.py","file_url":"https://github.com/kylejingli/EXPECTED/blob/HEAD/adult/income_prediction.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2304.07193","paper":"/paper/dinov2-learning-robust-visual-features","title":"DINOv2: Learning Robust Visual Features without Supervision","date":"2023-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seatizendoi/dinovdeau","path":"src/utils/evaluation.py","file_url":"https://github.com/seatizendoi/dinovdeau/blob/HEAD/src/utils/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"66fcba2b19055cb7","mcp_get_code":{"code_sha256":"66fcba2b19055cb7"}},{"arxiv_id":"2304.05552","paper":"/paper/dynamicdet-a-unified-dynamic-architecture-for","title":"DynamicDet: A Unified Dynamic Architecture for Object Detection","date":"2023-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VDIGPKU/DynamicDet","path":"models/common.py","file_url":"https://github.com/VDIGPKU/DynamicDet/blob/HEAD/models/common.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":"a74710dfd4798a0f","mcp_get_code":{"code_sha256":"a74710dfd4798a0f"}},{"arxiv_id":"2303.15286","paper":"/paper/unsupervised-adaptation-from-repeated","title":"Unsupervised Adaptation from Repeated Traversals for Autonomous Driving","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yurongyou/rote-da","path":"p2_score/p2_score_filtering_lidar_consistency.py","file_url":"https://github.com/yurongyou/rote-da/blob/HEAD/p2_score/p2_score_filtering_lidar_consistency.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2303.14195","paper":"/paper/the-limited-memory-recursive-variational","title":"The limited-memory recursive variational Gaussian approximation (L-RVGA)","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"marc-h-lambert/l-rvga","path":"KalmanMachine/KUtils.py","file_url":"https://github.com/marc-h-lambert/l-rvga/blob/HEAD/KalmanMachine/KUtils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"c384a4b763a3b322","mcp_get_code":{"code_sha256":"c384a4b763a3b322"}},{"arxiv_id":"2302.14165","paper":"/paper/gam-coach-towards-interactive-and-user","title":"GAM Coach: Towards Interactive and User-centered Algorithmic Recourse","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"poloclub/gam-coach","path":"gamcoach/gamcoach.py","file_url":"https://github.com/poloclub/gam-coach/blob/HEAD/gamcoach/gamcoach.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"86341462096c5399","mcp_get_code":{"code_sha256":"86341462096c5399"}},{"arxiv_id":"2302.12431","paper":"/paper/flexible-phase-dynamics-for-bio-plausible","title":"Flexible Phase Dynamics for Bio-Plausible Contrastive Learning","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zek3r/icml2023","path":"RBM_ICML.py","file_url":"https://github.com/zek3r/icml2023/blob/HEAD/RBM_ICML.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e21f85087b040589","mcp_get_code":{"code_sha256":"e21f85087b040589"}},{"arxiv_id":"2301.10909","paper":"/paper/optimizing-feature-set-for-click-through-rate","title":"Optimizing Feature Set for Click-Through Rate Prediction","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuyuanlyu/optfs","path":"modules/mask.py","file_url":"https://github.com/fuyuanlyu/optfs/blob/HEAD/modules/mask.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b3f273432e3c247","mcp_get_code":{"code_sha256":"2b3f273432e3c247"}},{"arxiv_id":"2212.13345","paper":"/paper/the-forward-forward-algorithm-some-1","title":"The Forward-Forward Algorithm: Some Preliminary Investigations","date":"2022-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2211.09259","paper":"/paper/the-missing-indicator-method-from-low-to-high","title":"The Missing Indicator Method: From Low to High Dimensions","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvanness354/missing_indicator_method","path":"utils/imputation_utils.py","file_url":"https://github.com/mvanness354/missing_indicator_method/blob/HEAD/utils/imputation_utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2211.06679","paper":"/paper/altclip-altering-the-language-encoder-in-clip","title":"AltCLIP: Altering the Language Encoder in CLIP for Extended Language Capabilities","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flagai-open/flagai","path":"flagai/metrics.py","file_url":"https://github.com/flagai-open/flagai/blob/HEAD/flagai/metrics.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":"98a2b2f174e040a3","mcp_get_code":{"code_sha256":"98a2b2f174e040a3"}},{"arxiv_id":"2210.07095","paper":"/paper/incorporating-context-into-subword","title":"Incorporating Context into Subword Vocabularies","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"melelbgu/sage","path":"sage_v1/Python-Modules/Utils.py","file_url":"https://github.com/melelbgu/sage/blob/HEAD/sage_v1/Python-Modules/Utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3d7a8c27e8286ada","mcp_get_code":{"code_sha256":"3d7a8c27e8286ada"}},{"arxiv_id":"2210.04563","paper":"/paper/towards-robust-visual-question-answering","title":"Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2210.03209","paper":"/paper/self-adaptive-driving-in-nonstationary","title":"Self-Adaptive Driving in Nonstationary Environments through Conjectural Online Lookahead Adaptation","date":null,"month_inferred_from_arxiv_id":"2022-10","title_source":"archive","repo":"panshark/cola","path":"macad_gym/multi_env.py","file_url":"https://github.com/panshark/cola/blob/HEAD/macad_gym/multi_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ac577fab3b01be8","mcp_get_code":{"code_sha256":"9ac577fab3b01be8"}},{"arxiv_id":"2210.02419","paper":"/paper/explanation-uncertainty-with-decision","title":"Boundary-Aware Uncertainty for Feature Attribution Explainers","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davinhill/gpec","path":"GPEC/utils/utils_np.py","file_url":"https://github.com/davinhill/gpec/blob/HEAD/GPEC/utils/utils_np.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2209.14687","paper":"/paper/diffusion-posterior-sampling-for-general","title":"Diffusion Posterior Sampling for General Noisy Inverse Problems","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexdenker/SteerableConditionalDiffusion","path":"algos/dps.py","file_url":"https://github.com/alexdenker/SteerableConditionalDiffusion/blob/HEAD/algos/dps.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"152398a541d26c5a","mcp_get_code":{"code_sha256":"152398a541d26c5a"}},{"arxiv_id":"2208.10451","paper":"/paper/minimax-auc-fairness-efficient-algorithm-with","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"purdue-m2/auc_fairness_with_noisy_groups","path":"training/fairness_metrics.py","file_url":"https://github.com/purdue-m2/auc_fairness_with_noisy_groups/blob/HEAD/training/fairness_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"396256bd807f90dc","mcp_get_code":{"code_sha256":"396256bd807f90dc"}},{"arxiv_id":"2207.09176","paper":"/paper/self-supervision-can-be-a-good-few-shot","title":"Self-Supervision Can Be a Good Few-Shot Learner","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/MSpaper","path":"UNet3+/eval_onnx.py","file_url":"https://github.com/yangyucheng000/MSpaper/blob/HEAD/UNet3%2B/eval_onnx.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":"71f6b54bb153195b","mcp_get_code":{"code_sha256":"71f6b54bb153195b"}},{"arxiv_id":"2207.09176","paper":"/paper/self-supervision-can-be-a-good-few-shot","title":"Self-Supervision Can Be a Good Few-Shot Learner","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyucheng000/MSpaper","path":"UNet3+/postprocess.py","file_url":"https://github.com/yangyucheng000/MSpaper/blob/HEAD/UNet3%2B/postprocess.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":"35f8386d0382d374","mcp_get_code":{"code_sha256":"35f8386d0382d374"}},{"arxiv_id":"2207.07553","paper":"/paper/chexplaining-in-style-counterfactual","title":"CheXplaining in Style: Counterfactual Explanations for Chest X-rays using StyleGAN","date":"2022-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"camp-explain-ai/style-chexplain","path":"code/att_find_eigenvectors.py","file_url":"https://github.com/camp-explain-ai/style-chexplain/blob/HEAD/code/att_find_eigenvectors.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"2207.02696","paper":"/paper/yolov7-trainable-bag-of-freebies-sets-new","title":"YOLOv7: Trainable bag-of-freebies sets new state-of-the-art for real-time object detectors","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghuiyao/yolov7_mindspore","path":"postprocess.py","file_url":"https://github.com/zhanghuiyao/yolov7_mindspore/blob/HEAD/postprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e9b5f76a6fafe2ee","mcp_get_code":{"code_sha256":"e9b5f76a6fafe2ee"}},{"arxiv_id":"2206.06821","paper":"/paper/dowhy-gcm-an-extension-of-dowhy-for-causal","title":"DoWhy-GCM: An extension of DoWhy for causal inference in graphical causal models","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/dowhy","path":"dowhy/datasets.py","file_url":"https://github.com/microsoft/dowhy/blob/HEAD/dowhy/datasets.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"2206.00093","paper":"/paper/easy-variational-inference-for-categorical","title":"Easy Variational Inference for Categorical Models via an Independent Binary Approximation","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tufts-ml/categorical-from-binary","path":"src/categorical_from_binary/kl.py","file_url":"https://github.com/tufts-ml/categorical-from-binary/blob/HEAD/src/categorical_from_binary/kl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d66872774634bad5","mcp_get_code":{"code_sha256":"d66872774634bad5"}},{"arxiv_id":"2205.13600","paper":"/paper/myosuite-a-contact-rich-simulation-suite-for","title":"MyoSuite -- A contact-rich simulation suite for musculoskeletal motor control","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"myo-manipulation/spasticmyoelbow","path":"dev/model_validation_experiment.py","file_url":"https://github.com/myo-manipulation/spasticmyoelbow/blob/HEAD/dev/model_validation_experiment.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":"8716af66856e8e15","mcp_get_code":{"code_sha256":"8716af66856e8e15"}},{"arxiv_id":"2205.13503","paper":"/paper/multi-layer-state-evolution-under-random","title":"Multi-layer State Evolution Under Random Convolutional Design","date":null,"month_inferred_from_arxiv_id":"2022-05","title_source":"archive","repo":"mdnls/conv-ml-amp","path":"model/factor.py","file_url":"https://github.com/mdnls/conv-ml-amp/blob/HEAD/model/factor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1c0ec1834540e2e","mcp_get_code":{"code_sha256":"d1c0ec1834540e2e"}},{"arxiv_id":"2204.08958","paper":"/paper/maniqa-multi-dimension-attention-network-for","title":"MANIQA: Multi-dimension Attention Network for No-Reference Image Quality Assessment","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianhewu/assessor360","path":"inference_one_image.py","file_url":"https://github.com/tianhewu/assessor360/blob/HEAD/inference_one_image.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2204.07826","paper":"/paper/beyond-l1-faster-and-better-sparse-models","title":"Beyond L1: Faster and Better Sparse Models with skglm","date":"2022-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathurinm/skglm","path":"skglm/datafits/single_task.py","file_url":"https://github.com/mathurinm/skglm/blob/HEAD/skglm/datafits/single_task.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":"6081999f30cf085b","mcp_get_code":{"code_sha256":"6081999f30cf085b"}},{"arxiv_id":"2204.04606","paper":"/paper/towards-efficient-representation","title":"Towards efficient representation identification in supervised learning","date":"2022-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2203.13602","paper":"/paper/zs4ie-a-toolkit-for-zero-shot-information","title":"ZS4IE: A toolkit for Zero-Shot Information Extraction with simple Verbalizations","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BBN-E/ZS4IE","path":"serif/model/entity_linker.py","file_url":"https://github.com/BBN-E/ZS4IE/blob/HEAD/serif/model/entity_linker.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":"a590d62785c3fa33","mcp_get_code":{"code_sha256":"a590d62785c3fa33"}},{"arxiv_id":"2203.09301","paper":"/paper/one-shot-adaptation-of-gan-in-just-one-clip","title":"One-Shot Adaptation of GAN in Just One CLIP","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anon96652/oneshotclip","path":"metrics/utils.py","file_url":"https://github.com/anon96652/oneshotclip/blob/HEAD/metrics/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b483042fac3893a","mcp_get_code":{"code_sha256":"8b483042fac3893a"}},{"arxiv_id":"2203.09175","paper":"/paper/generalized-classification-of-satellite-image","title":"Generalized Classification of Satellite Image Time Series with Thermal Positional Encoding","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jnyborg/tpe","path":"dataset.py","file_url":"https://github.com/jnyborg/tpe/blob/HEAD/dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ed3188ebf111362","mcp_get_code":{"code_sha256":"0ed3188ebf111362"}},{"arxiv_id":"2203.04913","paper":"/paper/leveling-down-in-computer-vision-pareto","title":"Leveling Down in Computer Vision: Pareto Inefficiencies in Fair Deep Classifiers","date":"2022-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxfordinternetinstitute/oxonfair","path":"src/oxonfair/learners/fair_frontier.py","file_url":"https://github.com/oxfordinternetinstitute/oxonfair/blob/HEAD/src/oxonfair/learners/fair_frontier.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d05c71a4b943dde3","mcp_get_code":{"code_sha256":"d05c71a4b943dde3"}},{"arxiv_id":"2202.11987","paper":"/paper/predicting-the-impact-of-treatments-over-time","title":"Predicting the impact of treatments over time with uncertainty aware neural differential equations","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/cf-ode","path":"causalode/covid_data_utils.py","file_url":"https://github.com/microsoft/cf-ode/blob/HEAD/causalode/covid_data_utils.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2201.12826","paper":"/paper/optimizing-gradient-driven-criteria-in","title":"OptG: Optimizing Gradient-driven Criteria in Network Sparsity","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyxxmu/optg","path":"imagenet.py","file_url":"https://github.com/zyxxmu/optg/blob/HEAD/imagenet.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c4ae0f426946c27a","mcp_get_code":{"code_sha256":"c4ae0f426946c27a"}},{"arxiv_id":"2112.06868","paper":"/paper/variational-autoencoders-in-the-presence-of-1","title":"Variational autoencoders in the presence of low-dimensional data: landscape and implicit bias","date":"2021-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"virajmehta/vae-training","path":"utils.py","file_url":"https://github.com/virajmehta/vae-training/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":"178cf26c5191a40c","mcp_get_code":{"code_sha256":"178cf26c5191a40c"}},{"arxiv_id":"2110.11728","paper":"/paper/blendgan-implicitly-gan-blending-for","title":"BlendGAN: Implicitly GAN Blending for Arbitrary Stylized Face Generation","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"onion-liu/BlendGAN","path":"gen_video.py","file_url":"https://github.com/onion-liu/BlendGAN/blob/HEAD/gen_video.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b483042fac3893a","mcp_get_code":{"code_sha256":"8b483042fac3893a"}},{"arxiv_id":"2110.04176","paper":"/paper/lightweight-convolutional-neural-networks-by","title":"PHNNs: Lightweight Neural Networks via Parameterized Hypercomplex Convolutions","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/hi2i","path":"core/utils.py","file_url":"https://github.com/ispamm/hi2i/blob/HEAD/core/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b483042fac3893a","mcp_get_code":{"code_sha256":"8b483042fac3893a"}},{"arxiv_id":"2110.01954","paper":"/paper/continuous-time-fitted-value-iteration-for","title":"Continuous-Time Fitted Value Iteration for Robust Policies","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milutter/value_iteration","path":"value_iteration/cost_functions/utils.py","file_url":"https://github.com/milutter/value_iteration/blob/HEAD/value_iteration/cost_functions/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b99030f39e97e88","mcp_get_code":{"code_sha256":"7b99030f39e97e88"}},{"arxiv_id":"2109.08901","paper":"/paper/s-3-vaada-submodular-subset-selection-for","title":"S$^3$VAADA: Submodular Subset Selection for Virtual Adversarial Active Domain Adaptation","date":"2021-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/s3vaada","path":"utils/utils.py","file_url":"https://github.com/val-iisc/s3vaada/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77b3b56a636e480e","mcp_get_code":{"code_sha256":"77b3b56a636e480e"}},{"arxiv_id":"2108.11179","paper":"/paper/recall-k-surrogate-loss-with-large-batches","title":"Recall@k Surrogate Loss with Large Batches and Similarity Mixup","date":"2021-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yash0307/RecallatK_surrogate","path":"src/losses.py","file_url":"https://github.com/yash0307/RecallatK_surrogate/blob/HEAD/src/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8a4ba5e22a6de79","mcp_get_code":{"code_sha256":"b8a4ba5e22a6de79"}},{"arxiv_id":"2108.03225","paper":"/paper/glass-geometric-latent-augmentation-for-shape","title":"GLASS: Geometric Latent Augmentation for Shape Spaces","date":"2021-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjeevmk/glass","path":"Src/Hessian.py","file_url":"https://github.com/sanjeevmk/glass/blob/HEAD/Src/Hessian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78bb52ae71e528a9","mcp_get_code":{"code_sha256":"78bb52ae71e528a9"}},{"arxiv_id":"2107.02363","paper":"/paper/asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aday651/embed-asym-exeriments","path":"custom_scripts/gen_data.py","file_url":"https://github.com/aday651/embed-asym-exeriments/blob/HEAD/custom_scripts/gen_data.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2107.01988","paper":"/paper/ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurospin-projects/2021_rlouiset_ucsl","path":"ucsl/utils.py","file_url":"https://github.com/neurospin-projects/2021_rlouiset_ucsl/blob/HEAD/ucsl/utils.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":"d43820de3f2d1e41","mcp_get_code":{"code_sha256":"d43820de3f2d1e41"}},{"arxiv_id":"2106.12930","paper":"/paper/vindr-spinexr-a-deep-learning-framework-for","title":"VinDr-SpineXR: A deep learning framework for spinal lesions detection and classification from radiographs","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinbigdata-medical/vindr-spinexr","path":"spine/ensemble_classifier.py","file_url":"https://github.com/vinbigdata-medical/vindr-spinexr/blob/HEAD/spine/ensemble_classifier.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":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"2106.09779","paper":"/paper/locally-differentially-private-federated","title":"Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lowya/private-federated-learning-without-a-trusted-server","path":"DP_FL_MNIST_logistic_FINAL.py","file_url":"https://github.com/lowya/private-federated-learning-without-a-trusted-server/blob/HEAD/DP_FL_MNIST_logistic_FINAL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"58eb8e19abd6d694","mcp_get_code":{"code_sha256":"58eb8e19abd6d694"}},{"arxiv_id":"2106.07769","paper":"/paper/the-flip-side-of-the-reweighted-coin-duality","title":"The Flip Side of the Reweighted Coin: Duality of Adaptive Dropout and Regularization","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlej/adaptive-dropout","path":"dropout/penalties.py","file_url":"https://github.com/dlej/adaptive-dropout/blob/HEAD/dropout/penalties.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"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_expansion.py","file_url":"https://github.com/afermanian/rnn-kernel/blob/HEAD/taylor_expansion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5e06511f6f77154d","mcp_get_code":{"code_sha256":"5e06511f6f77154d"}},{"arxiv_id":"2106.00311","paper":"/paper/what-s-a-good-imputation-to-predict-with","title":"What's a good imputation to predict with missing values?","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marinelm/impute_then_regress","path":"python/amputation.py","file_url":"https://github.com/marinelm/impute_then_regress/blob/HEAD/python/amputation.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2105.02047","paper":"/paper/cuboids-revisited-learning-robust-3d-shape","title":"Cuboids Revisited: Learning Robust 3D Shape Fitting to Single RGB Images","date":"2021-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fkluger/cuboids_revisited","path":"util/consistency.py","file_url":"https://github.com/fkluger/cuboids_revisited/blob/HEAD/util/consistency.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":"78bb52ae71e528a9","mcp_get_code":{"code_sha256":"78bb52ae71e528a9"}},{"arxiv_id":"2103.15692","paper":"/paper/self-constructing-neural-networks-through","title":"Self-Constructing Neural Networks Through Random Mutation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelschmidgall/randommutationsearch","path":"random_mutation_search.py","file_url":"https://github.com/samuelschmidgall/randommutationsearch/blob/HEAD/random_mutation_search.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f53c83eaf660d6a","mcp_get_code":{"code_sha256":"2f53c83eaf660d6a"}},{"arxiv_id":"2102.10058","paper":"/paper/principled-simplicial-neural-networks-for","title":"Principled Simplicial Neural Networks for Trajectory Prediction","date":"2021-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nglaze00/scone_gcn","path":"trajectory_analysis/trajectory_experiments.py","file_url":"https://github.com/nglaze00/scone_gcn/blob/HEAD/trajectory_analysis/trajectory_experiments.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ea7d3315d174727","mcp_get_code":{"code_sha256":"6ea7d3315d174727"}},{"arxiv_id":"2011.12379","paper":"/paper/invariant-representation-learning-for","title":"Invariant Representation Learning for Treatment Effect Estimation","date":"2020-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2011.07439","paper":"/paper/efficient-variational-inference-for-sparse-1","title":"Efficient Variational Inference for Sparse Deep Learning with Theoretical Guarantee","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinchengBai/sparse-variational-bnn","path":"models/sparsefunc.py","file_url":"https://github.com/JinchengBai/sparse-variational-bnn/blob/HEAD/models/sparsefunc.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":"6ed27939405d77df","mcp_get_code":{"code_sha256":"6ed27939405d77df"}},{"arxiv_id":"2011.00379","paper":"/paper/fair-classification-with-group-dependent","title":"Fair Classification with Group-Dependent Label Noise","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Faldict/fair-classification-with-noisy-labels","path":"PeerLoss.py","file_url":"https://github.com/Faldict/fair-classification-with-noisy-labels/blob/HEAD/PeerLoss.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f082a972a9ba05d6","mcp_get_code":{"code_sha256":"f082a972a9ba05d6"}},{"arxiv_id":"2010.14535","paper":"/paper/neural-architecture-search-of-spd-manifold-1","title":"Neural Architecture Search of SPD Manifold Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rheasukthanker/spdnetnas","path":"Code/Model.py","file_url":"https://github.com/rheasukthanker/spdnetnas/blob/HEAD/Code/Model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"2010.01823","paper":"/paper/quantifying-statistical-significance-of-1","title":"Quantifying Statistical Significance of Neural Network-based Image Segmentation by Selective Inference","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vonguyenleduy/dnn_segmentation_selective_inference","path":"util.py","file_url":"https://github.com/vonguyenleduy/dnn_segmentation_selective_inference/blob/HEAD/util.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2009.02623","paper":"/paper/information-theoretic-counterfactual-learning","title":"Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedback","date":"2020-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RyanWangZf/CVIB-Rec","path":"matrix_factorization.py","file_url":"https://github.com/RyanWangZf/CVIB-Rec/blob/HEAD/matrix_factorization.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b30dd0f0a1d1fde8","mcp_get_code":{"code_sha256":"b30dd0f0a1d1fde8"}},{"arxiv_id":"2007.13819","paper":"/paper/multi-level-local-sgd-for-heterogeneous","title":"Multi-Level Local SGD for Heterogeneous Hierarchical Networks","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpi-nsl/mll-sgd","path":"mll_sgd.py","file_url":"https://github.com/rpi-nsl/mll-sgd/blob/HEAD/mll_sgd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c803a6bd4c1c93ac","mcp_get_code":{"code_sha256":"c803a6bd4c1c93ac"}},{"arxiv_id":"2007.12163","paper":"/paper/smooth-ap-smoothing-the-path-towards-large","title":"Smooth-AP: Smoothing the Path Towards Large-Scale Image Retrieval","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Andrew-Brown1/Smooth_AP","path":"src/Smooth_AP_loss.py","file_url":"https://github.com/Andrew-Brown1/Smooth_AP/blob/HEAD/src/Smooth_AP_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4b3a13b8aba7b6dc","mcp_get_code":{"code_sha256":"4b3a13b8aba7b6dc"}},{"arxiv_id":"2007.04504","paper":"/paper/learning-differential-equations-that-are-easy","title":"Learning Differential Equations that are Easy to Solve","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobjinkelly/easy-neural-ode","path":"mnist.py","file_url":"https://github.com/jacobjinkelly/easy-neural-ode/blob/HEAD/mnist.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"82477563fa8c1d88","mcp_get_code":{"code_sha256":"82477563fa8c1d88"}},{"arxiv_id":"2007.04504","paper":"/paper/learning-differential-equations-that-are-easy","title":"Learning Differential Equations that are Easy to Solve","date":"2020-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobjinkelly/easy-neural-ode","path":"latent_ode.py","file_url":"https://github.com/jacobjinkelly/easy-neural-ode/blob/HEAD/latent_ode.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8340258d25afc74d","mcp_get_code":{"code_sha256":"8340258d25afc74d"}},{"arxiv_id":"2007.04154","paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"applications/markov/bdd_fun.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/applications/markov/bdd_fun.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2007.01162","paper":"/paper/tilted-empirical-risk-minimization","title":"Tilted Empirical Risk Minimization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litian96/TERM","path":"hierarchical/mixed_level1.py","file_url":"https://github.com/litian96/TERM/blob/HEAD/hierarchical/mixed_level1.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ea4aa57fb84c5048","mcp_get_code":{"code_sha256":"ea4aa57fb84c5048"}},{"arxiv_id":"2006.06887","paper":"/paper/stochastic-optimization-for-performative","title":"Stochastic Optimization for Performative Prediction","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zykls/performative-prediction","path":"experiments/icml2020/optimization.py","file_url":"https://github.com/zykls/performative-prediction/blob/HEAD/experiments/icml2020/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"519b6f5c1080d76c","mcp_get_code":{"code_sha256":"519b6f5c1080d76c"}},{"arxiv_id":"2004.08013","paper":"/paper/how-recurrent-networks-implement-contextual","title":"How recurrent networks implement contextual processing in sentiment analysis","date":"2020-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/computation-thru-dynamics","path":"fixed_point_finder/rnn.py","file_url":"https://github.com/google-research/computation-thru-dynamics/blob/HEAD/fixed_point_finder/rnn.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":"deee5acedc65539b","mcp_get_code":{"code_sha256":"deee5acedc65539b"}},{"arxiv_id":"2004.08013","paper":"/paper/how-recurrent-networks-implement-contextual","title":"How recurrent networks implement contextual processing in sentiment analysis","date":"2020-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/computation-thru-dynamics","path":"lfads_tutorial/lfads.py","file_url":"https://github.com/google-research/computation-thru-dynamics/blob/HEAD/lfads_tutorial/lfads.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":"48f60e785be2e858","mcp_get_code":{"code_sha256":"48f60e785be2e858"}},{"arxiv_id":"2004.01024","paper":"/paper/modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skx300/DyHATR","path":"src/evals/validation.py","file_url":"https://github.com/skx300/DyHATR/blob/HEAD/src/evals/validation.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2003.13880","paper":"/paper/muxconv-information-multiplexing-in","title":"MUXConv: Information Multiplexing in Convolutional Neural Networks","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"human-analysis/MUXConv","path":"muxnet.py","file_url":"https://github.com/human-analysis/MUXConv/blob/HEAD/muxnet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1ab2898fd19b53d9","mcp_get_code":{"code_sha256":"1ab2898fd19b53d9"}},{"arxiv_id":"2003.13350","paper":"/paper/agent57-outperforming-the-atari-human","title":"Agent57: Outperforming the Atari Human Benchmark","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pocokhc/agent57","path":"agent/common.py","file_url":"https://github.com/pocokhc/agent57/blob/HEAD/agent/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65ee8b6d0e1288d5","mcp_get_code":{"code_sha256":"65ee8b6d0e1288d5"}},{"arxiv_id":"2002.06755","paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"achalagarwal/gcn-lpa","path":"src/karate_club.py","file_url":"https://github.com/achalagarwal/gcn-lpa/blob/HEAD/src/karate_club.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2002.03557","paper":"/paper/fau-facial-expressions-valence-and-arousal-a","title":"Multitask Emotion Recognition with Incomplete Labels","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-NISL/Multitask-Emotion-Recognition-with-Incomplete-Labels","path":"Multitask-CNN-RNN/val.py","file_url":"https://github.com/HKUST-NISL/Multitask-Emotion-Recognition-with-Incomplete-Labels/blob/HEAD/Multitask-CNN-RNN/val.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"2001.06807","paper":"/paper/zero-shot-video-object-segmentation-via-1","title":"Zero-Shot Video Object Segmentation via Attentive Graph Neural Networks","date":"2020-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carrierlxk/AGNN","path":"test_iteration_conf_gnn.py","file_url":"https://github.com/carrierlxk/AGNN/blob/HEAD/test_iteration_conf_gnn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b7880bde365e8087","mcp_get_code":{"code_sha256":"b7880bde365e8087"}},{"arxiv_id":"1912.09533","paper":"/paper/towards-verifying-robustness-of-neural","title":"Towards Verifying Robustness of Neural Networks Against Semantic Perturbations","date":"2019-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JeetMo/Semantify-NN","path":"utils/activations.py","file_url":"https://github.com/JeetMo/Semantify-NN/blob/HEAD/utils/activations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54fb221cde340265","mcp_get_code":{"code_sha256":"54fb221cde340265"}},{"arxiv_id":"1912.04427","paper":"/paper/winning-the-lottery-with-continuous-1","title":"Winning the Lottery with Continuous Sparsification","date":"2019-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lolemacs/continuous-sparsification","path":"models/layers.py","file_url":"https://github.com/lolemacs/continuous-sparsification/blob/HEAD/models/layers.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":"2b3f273432e3c247","mcp_get_code":{"code_sha256":"2b3f273432e3c247"}},{"arxiv_id":"1911.04175","paper":"/paper/multi-agent-connected-autonomous-driving","title":"Multi-Agent Connected Autonomous Driving using Deep Reinforcement Learning","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"praveen-palanisamy/macad-gym","path":"src/macad_gym/carla/multi_env.py","file_url":"https://github.com/praveen-palanisamy/macad-gym/blob/HEAD/src/macad_gym/carla/multi_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ac577fab3b01be8","mcp_get_code":{"code_sha256":"9ac577fab3b01be8"}},{"arxiv_id":"1909.03601","paper":"/paper/relevance-matrix-factorization","title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usaito/unbiased-implicit-rec","path":"src/utils/data_generator.py","file_url":"https://github.com/usaito/unbiased-implicit-rec/blob/HEAD/src/utils/data_generator.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":"ebaf172fd8f34860","mcp_get_code":{"code_sha256":"ebaf172fd8f34860"}},{"arxiv_id":"1909.02050","paper":"/paper/tiger-text-to-image-grounding-for-image","title":"TIGEr: Text-to-Image Grounding for Image Caption Evaluation","date":"2019-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeleenaJM/CapEval","path":"tiger.py","file_url":"https://github.com/SeleenaJM/CapEval/blob/HEAD/tiger.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5bbf79af10ee23f0","mcp_get_code":{"code_sha256":"5bbf79af10ee23f0"}},{"arxiv_id":"1907.04809","paper":"/paper/variational-autoencoders-and-nonlinear-ica-a","title":"Variational Autoencoders and Nonlinear ICA: A Unifying Framework","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilkhem/ivae","path":"discrete.py","file_url":"https://github.com/ilkhem/ivae/blob/HEAD/discrete.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"800a7252048629bf","mcp_get_code":{"code_sha256":"800a7252048629bf"}},{"arxiv_id":"1906.03849","paper":"/paper/robustness-verification-of-tree-based-models","title":"Robustness Verification of Tree-based Models","date":"2019-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"1906.03543","paper":"/paper/apricot-submodular-selection-for-data","title":"apricot: Submodular selection for data summarization in Python","date":"2019-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmschrei/apricot","path":"apricot/functions/featureBased.py","file_url":"https://github.com/jmschrei/apricot/blob/HEAD/apricot/functions/featureBased.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c6e5731ed160e05","mcp_get_code":{"code_sha256":"7c6e5731ed160e05"}},{"arxiv_id":"1906.02390","paper":"/paper/multi-view-knowledge-graph-embedding-for","title":"Multi-view Knowledge Graph Embedding for Entity Alignment","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/MultiKE","path":"code/auto_encoder.py","file_url":"https://github.com/nju-websoft/MultiKE/blob/HEAD/code/auto_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df174f67726ee0b5","mcp_get_code":{"code_sha256":"df174f67726ee0b5"}},{"arxiv_id":"1906.01827","paper":"/paper/data-sketching-for-faster-training-of-machine","title":"Coresets for Data-efficient Training of Machine Learning Models","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baharanm/craig","path":"logistic.py","file_url":"https://github.com/baharanm/craig/blob/HEAD/logistic.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b30dd0f0a1d1fde8","mcp_get_code":{"code_sha256":"b30dd0f0a1d1fde8"}},{"arxiv_id":"1905.06873","paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jilljenn/ktm","path":"fm.py","file_url":"https://github.com/jilljenn/ktm/blob/HEAD/fm.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1905.06873","paper":"/paper/das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jilljenn/ktm","path":"ofm.py","file_url":"https://github.com/jilljenn/ktm/blob/HEAD/ofm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79b01af220b1e28c","mcp_get_code":{"code_sha256":"79b01af220b1e28c"}},{"arxiv_id":"1905.03381","paper":"/paper/190503381","title":"AutoAssist: A Framework to Accelerate Training of Deep Neural Networks","date":"2019-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangjiong724/autoassist-exp","path":"image_classification/assistant.py","file_url":"https://github.com/zhangjiong724/autoassist-exp/blob/HEAD/image_classification/assistant.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":"19ed4e8df05cecee","mcp_get_code":{"code_sha256":"19ed4e8df05cecee"}},{"arxiv_id":"1905.01067","paper":"/paper/deconstructing-lottery-tickets-zeros-signs","title":"Deconstructing Lottery Tickets: Zeros, Signs, and the Supermask","date":"2019-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/deconstructing-lottery-tickets","path":"train_lottery.py","file_url":"https://github.com/uber-research/deconstructing-lottery-tickets/blob/HEAD/train_lottery.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"6bb3881c24f66b23","mcp_get_code":{"code_sha256":"6bb3881c24f66b23"}},{"arxiv_id":"1904.01160","paper":"/paper/curls-whey-boosting-black-box-adversarial","title":"Curls & Whey: Boosting Black-Box Adversarial Attacks","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"walegahaha/Curls-Whey","path":"attacks/curls_targeted.py","file_url":"https://github.com/walegahaha/Curls-Whey/blob/HEAD/attacks/curls_targeted.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":"b7880bde365e8087","mcp_get_code":{"code_sha256":"b7880bde365e8087"}},{"arxiv_id":"1903.10410","paper":"/paper/towards-a-framework-for-the-evolution-of","title":"A Conceptual Bio-Inspired Framework for the Evolution of Artificial General Intelligence","date":"2019-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"socratesnfr/neat-nagi-python","path":"nagi/simulation_cartpole.py","file_url":"https://github.com/socratesnfr/neat-nagi-python/blob/HEAD/nagi/simulation_cartpole.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"710cb7c2e8a4007d","mcp_get_code":{"code_sha256":"710cb7c2e8a4007d"}},{"arxiv_id":"1902.10828","paper":"/paper/the-voices-from-a-distance-challenge-2019","title":"The VOiCES from a Distance Challenge 2019 Evaluation Plan","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"Lao-Tzu-Taoism/sv_score_calibration","path":"cllr_calib/apply_calibration.py","file_url":"https://github.com/Lao-Tzu-Taoism/sv_score_calibration/blob/HEAD/cllr_calib/apply_calibration.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":"d5fe5cd542d72c82","mcp_get_code":{"code_sha256":"d5fe5cd542d72c82"}},{"arxiv_id":"1902.10828","paper":"/paper/the-voices-from-a-distance-challenge-2019","title":"The VOiCES from a Distance Challenge 2019 Evaluation Plan","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"Lao-Tzu-Taoism/sv_score_calibration","path":"bin/fusion.py","file_url":"https://github.com/Lao-Tzu-Taoism/sv_score_calibration/blob/HEAD/bin/fusion.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":"87dc706e9eff2081","mcp_get_code":{"code_sha256":"87dc706e9eff2081"}},{"arxiv_id":"1902.00981","paper":"/paper/learning-counterfactual-representations-for","title":"Learning Counterfactual Representations for Estimating Individual Dose-Response Curves","date":"2019-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/drnet","path":"drnet/apps/util.py","file_url":"https://github.com/d909b/drnet/blob/HEAD/drnet/apps/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"1901.09216","paper":"/paper/multi-agent-generalized-recursive-reasoning","title":"Modelling Bounded Rationality in Multi-Agent Interactions by Generalized Recursive Reasoning","date":"2019-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ying-wen/gr2","path":"code/maci/utils.py","file_url":"https://github.com/ying-wen/gr2/blob/HEAD/code/maci/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db4eab2810a17578","mcp_get_code":{"code_sha256":"db4eab2810a17578"}},{"arxiv_id":"1901.06523","paper":"/paper/frequency-principle-fourier-analysis-sheds","title":"Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networks","date":"2019-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuzhiqin1990/F-Principle","path":"main_1d_20190924.py","file_url":"https://github.com/xuzhiqin1990/F-Principle/blob/HEAD/main_1d_20190924.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2d3e248be1323d2c","mcp_get_code":{"code_sha256":"2d3e248be1323d2c"}},{"arxiv_id":"1812.01718","paper":"/paper/deep-learning-for-classical-japanese","title":"Deep Learning for Classical Japanese Literature","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"christianversloot/keras-cnn","path":"model_ftswish_comp_relu_swish.py","file_url":"https://github.com/christianversloot/keras-cnn/blob/HEAD/model_ftswish_comp_relu_swish.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"code_sha256_prefix":"1a3c174f69eae69e","mcp_get_code":{"code_sha256":"1a3c174f69eae69e"}},{"arxiv_id":"1811.12359","paper":"/paper/challenging-common-assumptions-in-the","title":"Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/disentanglement_lib","path":"disentanglement_lib/visualize/visualize_model.py","file_url":"https://github.com/google-research/disentanglement_lib/blob/HEAD/disentanglement_lib/visualize/visualize_model.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4adb351c2e3a7b3f","mcp_get_code":{"code_sha256":"4adb351c2e3a7b3f"}},{"arxiv_id":"1811.11103","paper":"/paper/bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/BGCN","path":"src/utils_gcn.py","file_url":"https://github.com/huawei-noah/BGCN/blob/HEAD/src/utils_gcn.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1811.00145","paper":"/paper/scalable-end-to-end-autonomous-vehicle","title":"Scalable End-to-End Autonomous Vehicle Testing via Rare-event Simulation","date":"2018-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amansinha/neural-bridge","path":"envs/car_racing/WorldModel/dream_model.py","file_url":"https://github.com/amansinha/neural-bridge/blob/HEAD/envs/car_racing/WorldModel/dream_model.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1810.04805","paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icewing1996/bert_dep","path":"linalg.py","file_url":"https://github.com/icewing1996/bert_dep/blob/HEAD/linalg.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":"5ee5f3de417ac23d","mcp_get_code":{"code_sha256":"5ee5f3de417ac23d"}},{"arxiv_id":"1809.10765","paper":"/paper/auto-encoding-knockoff-generator-for-fdr","title":"Auto-Encoding Knockoff Generator for FDR Controlled Variable Selection","date":null,"month_inferred_from_arxiv_id":"2018-09","title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1806.01261","paper":"/paper/relational-inductive-biases-deep-learning-and","title":"Relational inductive biases, deep learning, and graph networks","date":"2018-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"machine-reasoning-ufrgs/graph-neural-networks","path":"neurosat/logutil.py","file_url":"https://github.com/machine-reasoning-ufrgs/graph-neural-networks/blob/HEAD/neurosat/logutil.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6a8334164beb95f","mcp_get_code":{"code_sha256":"c6a8334164beb95f"}},{"arxiv_id":"1804.02767","paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertsokol/yolov3-tf2","path":"predict.py","file_url":"https://github.com/albertsokol/yolov3-tf2/blob/HEAD/predict.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f33cd0434b7657c","mcp_get_code":{"code_sha256":"5f33cd0434b7657c"}},{"arxiv_id":"1804.02767","paper":"/paper/yolov3-an-incremental-improvement","title":"YOLOv3: An Incremental Improvement","date":"2018-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"euske/derpyolo","path":"objutils.py","file_url":"https://github.com/euske/derpyolo/blob/HEAD/objutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3fdee80a50ec1cb","mcp_get_code":{"code_sha256":"d3fdee80a50ec1cb"}},{"arxiv_id":"1804.00779","paper":"/paper/neural-autoregressive-flows","title":"Neural Autoregressive Flows","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bradyneal/realcause","path":"models/preprocess.py","file_url":"https://github.com/bradyneal/realcause/blob/HEAD/models/preprocess.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1804.00090","paper":"/paper/floornet-a-unified-framework-for-floorplan","title":"FloorNet: A Unified Framework for Floorplan Reconstruction from 3D Scans","date":"2018-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"art-programmer/FloorNet","path":"utils.py","file_url":"https://github.com/art-programmer/FloorNet/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":"6701865fd32af533","mcp_get_code":{"code_sha256":"6701865fd32af533"}},{"arxiv_id":"1802.09089","paper":"/paper/kitsune-an-ensemble-of-autoencoders-for","title":"Kitsune: An Ensemble of Autoencoders for Online Network Intrusion Detection","date":"2018-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymirsky/KitNET-py","path":"utils.py","file_url":"https://github.com/ymirsky/KitNET-py/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":"e1266296545920e8","mcp_get_code":{"code_sha256":"e1266296545920e8"}},{"arxiv_id":"1710.05941","paper":"/paper/searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WessZumino/expectation_propagation","path":"Python/esp_utils.py","file_url":"https://github.com/WessZumino/expectation_propagation/blob/HEAD/Python/esp_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":"3b622bff5ce900a3","mcp_get_code":{"code_sha256":"3b622bff5ce900a3"}},{"arxiv_id":"1706.07296","paper":"/paper/a-minimal-developmental-model-can-increase","title":"A Minimal Developmental Model Can Increase Evolvability in Soft Robots","date":"2017-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skriegman/gecco-2017","path":"evosoro/tools/utils.py","file_url":"https://github.com/skriegman/gecco-2017/blob/HEAD/evosoro/tools/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"697dfbb9c3926b6f","mcp_get_code":{"code_sha256":"697dfbb9c3926b6f"}},{"arxiv_id":"1706.03762","paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krocki/np-transformer","path":"transformer.py","file_url":"https://github.com/krocki/np-transformer/blob/HEAD/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f96ec62dab33fe2","mcp_get_code":{"code_sha256":"1f96ec62dab33fe2"}},{"arxiv_id":"1702.00748","paper":"/paper/qcd-aware-recursive-neural-networks-for-jet","title":"QCD-Aware Recursive Neural Networks for Jet Physics","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glouppe/recnn","path":"recnn/recnn.py","file_url":"https://github.com/glouppe/recnn/blob/HEAD/recnn/recnn.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":"dd85f5245490cfbc","mcp_get_code":{"code_sha256":"dd85f5245490cfbc"}},{"arxiv_id":"1612.08242","paper":"/paper/yolo9000-better-faster-stronger","title":"YOLO9000: Better, Faster, Stronger","date":"2016-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinliao/object-detection-python","path":"yolo_utils.py","file_url":"https://github.com/vinliao/object-detection-python/blob/HEAD/yolo_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"061232c6642c251d","mcp_get_code":{"code_sha256":"061232c6642c251d"}},{"arxiv_id":"1611.06585","paper":"/paper/variational-boosting-iteratively-refining","title":"Variational Boosting: Iteratively Refining Posterior Approximations","date":"2016-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andymiller/vboost","path":"code/vbproj/vi/vboost/misc.py","file_url":"https://github.com/andymiller/vboost/blob/HEAD/code/vbproj/vi/vboost/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee2be3a29cd908e3","mcp_get_code":{"code_sha256":"ee2be3a29cd908e3"}},{"arxiv_id":"1611.01734","paper":"/paper/deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdozat/Parser","path":"lib/linalg.py","file_url":"https://github.com/tdozat/Parser/blob/HEAD/lib/linalg.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":"5ee5f3de417ac23d","mcp_get_code":{"code_sha256":"5ee5f3de417ac23d"}},{"arxiv_id":"1610.03577","paper":"/paper/minimax-filter-learning-to-preserve-privacy","title":"Minimax Filter: Learning to Preserve Privacy from Inference Attacks","date":"2016-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jihunhamm/MinimaxFilter","path":"src/sparse_autoencoder.py","file_url":"https://github.com/jihunhamm/MinimaxFilter/blob/HEAD/src/sparse_autoencoder.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":"bc3b410c718adea7","mcp_get_code":{"code_sha256":"bc3b410c718adea7"}},{"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":"PerryXDeng/adversarial_mnist_attacks","path":"neural_network.py","file_url":"https://github.com/PerryXDeng/adversarial_mnist_attacks/blob/HEAD/neural_network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf589faab9919534","mcp_get_code":{"code_sha256":"cf589faab9919534"}},{"arxiv_id":"1605.03795","paper":"/paper/exponential-machines","title":"Exponential Machines","date":"2016-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bihaqo/exp-machines","path":"src/objectives/logistic.py","file_url":"https://github.com/Bihaqo/exp-machines/blob/HEAD/src/objectives/logistic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"95b8841385dc9f7e","mcp_get_code":{"code_sha256":"95b8841385dc9f7e"}},{"arxiv_id":"1602.01783","paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wxj77/TransferReinforcementLearning","path":"src/pongSimpleFunc.py","file_url":"https://github.com/wxj77/TransferReinforcementLearning/blob/HEAD/src/pongSimpleFunc.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"1511.02583","paper":"/paper/batch-normalized-maxout-network-in-network","title":"Batch-normalized Maxout Network in Network","date":"2015-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohnBensen1000/machine_learning","path":"maxoutCNN.py","file_url":"https://github.com/JohnBensen1000/machine_learning/blob/HEAD/maxoutCNN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78fdd4365700a723","mcp_get_code":{"code_sha256":"78fdd4365700a723"}},{"arxiv_id":"1510.04935","paper":"/paper/holographic-embeddings-of-knowledge-graphs","title":"Holographic Embeddings of Knowledge Graphs","date":"2015-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mnick/scikit-kge","path":"skge/base.py","file_url":"https://github.com/mnick/scikit-kge/blob/HEAD/skge/base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c50decfd17e5027a","mcp_get_code":{"code_sha256":"c50decfd17e5027a"}},{"arxiv_id":"1510.03336","paper":"/paper/evaluating-real-time-anomaly-detection","title":"Evaluating Real-time Anomaly Detection Algorithms - the Numenta Anomaly Benchmark","date":"2015-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"numenta/NAB","path":"nab/sweeper.py","file_url":"https://github.com/numenta/NAB/blob/HEAD/nab/sweeper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19a920b3f3c3951e","mcp_get_code":{"code_sha256":"19a920b3f3c3951e"}},{"arxiv_id":"1509.09292","paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HIPS/neural-fingerprint","path":"neuralfingerprint/build_vanilla_net.py","file_url":"https://github.com/HIPS/neural-fingerprint/blob/HEAD/neuralfingerprint/build_vanilla_net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b7282c36d207a92","mcp_get_code":{"code_sha256":"1b7282c36d207a92"}},{"arxiv_id":"1509.07892","paper":"/paper/evasion-and-hardening-of-tree-ensemble","title":"Evasion and Hardening of Tree Ensemble Classifiers","date":"2015-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"c27e5c071e798245","mcp_get_code":{"code_sha256":"c27e5c071e798245"}},{"arxiv_id":"1506.03099","paper":"/paper/scheduled-sampling-for-sequence-prediction","title":"Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks","date":"2015-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oplatek/e2end","path":"e2end/utils.py","file_url":"https://github.com/oplatek/e2end/blob/HEAD/e2end/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":"7386793e4883e20c","mcp_get_code":{"code_sha256":"7386793e4883e20c"}},{"arxiv_id":"1506.02640","paper":"/paper/you-only-look-once-unified-real-time-object","title":"You Only Look Once: Unified, Real-Time Object Detection","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"1505.05770","paper":"/paper/variational-inference-with-normalizing-flows","title":"Variational Inference with Normalizing Flows","date":"2015-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aditya-kiran/ResNet-VAE","path":"code/skewed_posterior_average_experiment.py","file_url":"https://github.com/Aditya-kiran/ResNet-VAE/blob/HEAD/code/skewed_posterior_average_experiment.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"1411.4028","paper":"/paper/a-quantum-approximate-optimization-algorithm-1","title":"A Quantum Approximate Optimization Algorithm","date":null,"month_inferred_from_arxiv_id":"2014-11","title_source":"archive","repo":"Matematija/QubitRBM","path":"qubitrbm/utils.py","file_url":"https://github.com/Matematija/QubitRBM/blob/HEAD/qubitrbm/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":"f9b46a6521b5d652","mcp_get_code":{"code_sha256":"f9b46a6521b5d652"}},{"arxiv_id":"1409.1556","paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paulorauber/nn","path":"model/rbm.py","file_url":"https://github.com/paulorauber/nn/blob/HEAD/model/rbm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"deaf1f220d09321c","mcp_get_code":{"code_sha256":"deaf1f220d09321c"}},{"arxiv_id":"1301.3781","paper":"/paper/efficient-estimation-of-word-representations","title":"Efficient Estimation of Word Representations in Vector Space","date":"2013-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chikalabouka/INF8225-TP4","path":"word2vec.py","file_url":"https://github.com/chikalabouka/INF8225-TP4/blob/HEAD/word2vec.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79f11a734356d4da","mcp_get_code":{"code_sha256":"79f11a734356d4da"}},{"arxiv_id":"1008.3477","paper":"/paper/the-density-matrix-renormalization-group-in","title":"The density-matrix renormalization group in the age of matrix product states","date":null,"month_inferred_from_arxiv_id":"2010-08","title_source":"archive","repo":"jhauschild/lecture_comp_methods","path":"4_machine_learning/network.py","file_url":"https://github.com/jhauschild/lecture_comp_methods/blob/HEAD/4_machine_learning/network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b0862d31e928c45","mcp_get_code":{"code_sha256":"2b0862d31e928c45"}},{"arxiv_id":"ijcai2022_0498","paper":null,"title":"arXiv:ijcai2022_0498","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xinxingwu-uk/DGAE","path":"Python/Models/dgae_alpha/evaluation.py","file_url":"https://github.com/xinxingwu-uk/DGAE/blob/HEAD/Python/Models/dgae_alpha/evaluation.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"aaai_29453","paper":null,"title":"arXiv:aaai_29453","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shapsider/scintegration","path":"integration_c/src/num.py","file_url":"https://github.com/shapsider/scintegration/blob/HEAD/integration_c/src/num.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3f69a1a8914fa135","mcp_get_code":{"code_sha256":"3f69a1a8914fa135"}},{"arxiv_id":"aaai_16605","paper":null,"title":"arXiv:aaai_16605","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RingBDStack/DGGAN","path":"code/evaluation.py","file_url":"https://github.com/RingBDStack/DGGAN/blob/HEAD/code/evaluation.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8e95809ca2c17c9","mcp_get_code":{"code_sha256":"b8e95809ca2c17c9"}},{"arxiv_id":"Patel_Recallk_Surrogate_Loss_With_Large_Batches_and_Similarity_Mixup_CVPR_2022_paper","paper":null,"title":"arXiv:Patel_Recallk_Surrogate_Loss_With_Large_Batches_and_Similarity_Mixup_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yash0307/RecallatK","path":"src/losses.py","file_url":"https://github.com/yash0307/RecallatK/blob/HEAD/src/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8a4ba5e22a6de79","mcp_get_code":{"code_sha256":"b8a4ba5e22a6de79"}},{"arxiv_id":"Guo_Improving_Robustness_of_Vision_Transformers_by_Reducing_Sensitivity_To_Patch_CVPR_2023_paper","paper":null,"title":"arXiv:Guo_Improving_Robustness_of_Vision_Transformers_by_Reducing_Sensitivity_To_Patch_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"guoyongcs/RSPC","path":"RSPC_FAN/models/fan.py","file_url":"https://github.com/guoyongcs/RSPC/blob/HEAD/RSPC_FAN/models/fan.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ab2898fd19b53d9","mcp_get_code":{"code_sha256":"1ab2898fd19b53d9"}},{"arxiv_id":"136730727","paper":null,"title":"arXiv:136730727","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"louisYen/S3R","path":"anomaly/datasets/video_dataset.py","file_url":"https://github.com/louisYen/S3R/blob/HEAD/anomaly/datasets/video_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f35babe3912ec8b1","mcp_get_code":{"code_sha256":"f35babe3912ec8b1"}},{"arxiv_id":"136670659","paper":null,"title":"arXiv:136670659","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PardoAlejo/MovieCuts","path":"src/callbacks.py","file_url":"https://github.com/PardoAlejo/MovieCuts/blob/HEAD/src/callbacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"684daa9cdbaead9f","mcp_get_code":{"code_sha256":"684daa9cdbaead9f"}},{"arxiv_id":"136640190","paper":null,"title":"arXiv:136640190","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MengyuanChen21/ECCV2022-DELU","path":"eval/eval_detection.py","file_url":"https://github.com/MengyuanChen21/ECCV2022-DELU/blob/HEAD/eval/eval_detection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68a8a4359a62d565","mcp_get_code":{"code_sha256":"68a8a4359a62d565"}}]}