{"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/evaluate","entry":"evaluate","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":514,"n_papers_ran":175,"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":550,"n_samples_ran":167,"n_samples_fingerprinted":8,"n_places":609,"n_places_pointer_only":220,"by_status":{"ran_honours":34,"ran_violates":0,"ran_draft_wrong":46,"ran_fixture":8,"ran":79,"unverified":383},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.01888","paper":"/paper/arxiv-2609-01888","title":"Does Playing it Safe Count as Faithfulness? Reassessing LVLM Hallucination Mitigation Methods","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"mehrdadfazli/AssessHalVLM","path":"methods/after/inference_editing.py","file_url":"https://github.com/mehrdadfazli/AssessHalVLM/blob/HEAD/methods/after/inference_editing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7afcd3a4a3f5077","mcp_get_code":{"code_sha256":"d7afcd3a4a3f5077"}},{"arxiv_id":"2608.18116","paper":"/paper/arxiv-2608-18116","title":"You Are What You Prompt: Prompt Quality, Domain Shift, and Uncertainty in Agrifood Vision-Language Models Calidad de prompts, cambio de dominio e incertidumbre en modelos visión-lenguaje agroalimentarios","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ugritai/pid_agrifood","path":"analysis/pid.py","file_url":"https://github.com/ugritai/pid_agrifood/blob/HEAD/analysis/pid.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":"bdd106384dee6d51","mcp_get_code":{"code_sha256":"bdd106384dee6d51"}},{"arxiv_id":"2608.16010","paper":"/paper/arxiv-2608-16010","title":"Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"EnumaCaliber/BRIDGE","path":"full_finetune_oneshot.py","file_url":"https://github.com/EnumaCaliber/BRIDGE/blob/HEAD/full_finetune_oneshot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eee4dd693f93a50b","mcp_get_code":{"code_sha256":"eee4dd693f93a50b"}},{"arxiv_id":"2608.16010","paper":"/paper/arxiv-2608-16010","title":"Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"EnumaCaliber/BRIDGE","path":"prune_structure_vitTinyImageNet.py","file_url":"https://github.com/EnumaCaliber/BRIDGE/blob/HEAD/prune_structure_vitTinyImageNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3d3168675e4e5507","mcp_get_code":{"code_sha256":"3d3168675e4e5507"}},{"arxiv_id":"2608.16010","paper":"/paper/arxiv-2608-16010","title":"Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"EnumaCaliber/BRIDGE","path":"check_structure_regrowth.py","file_url":"https://github.com/EnumaCaliber/BRIDGE/blob/HEAD/check_structure_regrowth.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b993bef218b2e1ca","mcp_get_code":{"code_sha256":"b993bef218b2e1ca"}},{"arxiv_id":"2608.14705","paper":"/paper/arxiv-2608-14705","title":"On Cross-Validation for Hyperparameter Optimization of Deep Learning Image Classifiers","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ljbuturovic/cvic","path":"cvic/tunic.py","file_url":"https://github.com/ljbuturovic/cvic/blob/HEAD/cvic/tunic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7cb86c8f12da5beb","mcp_get_code":{"code_sha256":"7cb86c8f12da5beb"}},{"arxiv_id":"2608.13209","paper":"/paper/arxiv-2608-13209","title":"Chance-constrained selection of sequential intervention strategies from counterfactual estimates","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"mfriendly/counterfactual-chance-selection","path":"ccselect/decision/rules.py","file_url":"https://github.com/mfriendly/counterfactual-chance-selection/blob/HEAD/ccselect/decision/rules.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b53e191958e97ba2","mcp_get_code":{"code_sha256":"b53e191958e97ba2"}},{"arxiv_id":"2608.10679","paper":"/paper/arxiv-2608-10679","title":"ENTLORE: A Graph-Grounded Benchmark for Latent Organizational Reasoning in Enterprise Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"scitix/entlore","path":"src/evaluator.py","file_url":"https://github.com/scitix/entlore/blob/HEAD/src/evaluator.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":"a3550da09101fb66","mcp_get_code":{"code_sha256":"a3550da09101fb66"}},{"arxiv_id":"2608.10636","paper":"/paper/arxiv-2608-10636","title":"DistilVDR: A Compact End-to-End Visual Document Retriever via Dual-Student Distillation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Ryenhails/NanoVDR","path":"nanovdr/train/engine.py","file_url":"https://github.com/Ryenhails/NanoVDR/blob/HEAD/nanovdr/train/engine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96f127afa2c3dc3b","mcp_get_code":{"code_sha256":"96f127afa2c3dc3b"}},{"arxiv_id":"2607.29561","paper":"/paper/arxiv-2607-29561","title":"MOT-SR: Multi-Objective Tool-Augmented Scientific Equation Discovery with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"wswbx/MOT-SR","path":"mot_sr/evaluate_on_problems.py","file_url":"https://github.com/wswbx/MOT-SR/blob/HEAD/mot_sr/evaluate_on_problems.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0395ddcc609dd423","mcp_get_code":{"code_sha256":"0395ddcc609dd423"}},{"arxiv_id":"2607.22722","paper":"/paper/arxiv-2607-22722","title":"A New Kind of Adversarial Example: Measuring the Human-Model Gap, and Its Relationship to OOD Detection","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"alikayyam/NKE_attack","path":"nke/train_models.py","file_url":"https://github.com/alikayyam/NKE_attack/blob/HEAD/nke/train_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b01a310cedec5a0a","mcp_get_code":{"code_sha256":"b01a310cedec5a0a"}},{"arxiv_id":"2607.08867","paper":"/paper/arxiv-2607-08867","title":"Secure-by-Disguise: A Systematic Evaluation of Image Disguising for Confidential Medical Image Modeling","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Jasonmix84/Secure-By-Disguise","path":"classification/neura.py","file_url":"https://github.com/Jasonmix84/Secure-By-Disguise/blob/HEAD/classification/neura.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bd6262b1849a5ccb","mcp_get_code":{"code_sha256":"bd6262b1849a5ccb"}},{"arxiv_id":"2606.31741","paper":"/paper/arxiv-2606-31741","title":"STEB: Style Text Embedding Benchmark","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"rrivera1849/STEB","path":"steb/core.py","file_url":"https://github.com/rrivera1849/STEB/blob/HEAD/steb/core.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":"a825e2fb4e4fbd4b","mcp_get_code":{"code_sha256":"a825e2fb4e4fbd4b"}},{"arxiv_id":"2606.26485","paper":"/paper/arxiv-2606-26485","title":"Utilizing Cognitive Signals Generated during Human Reading to Enhance Keyphrase Extraction from Microblogs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"yan-xinyi/AKE","path":"evaluate.py","file_url":"https://github.com/yan-xinyi/AKE/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f88479bf368b1078","mcp_get_code":{"code_sha256":"f88479bf368b1078"}},{"arxiv_id":"2606.20629","paper":"/paper/arxiv-2606-20629","title":"Specialize Roles, Mix Deployments: Pushing the Cost-Accuracy Frontier of LLM Agent Teams","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Auto-CAP/AgentCAP","path":"agent_cap/evaluator.py","file_url":"https://github.com/Auto-CAP/AgentCAP/blob/HEAD/agent_cap/evaluator.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":"6f5f18826bfcfa69","mcp_get_code":{"code_sha256":"6f5f18826bfcfa69"}},{"arxiv_id":"2606.19374","paper":"/paper/arxiv-2606-19374","title":"Protein Representation Learning with Secondary-Structure and Energy-Filtered Hydrogen-Bond Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mohamedmohamed2021/SSProNet","path":"run_ProNet_LBA.py","file_url":"https://github.com/mohamedmohamed2021/SSProNet/blob/HEAD/run_ProNet_LBA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6ef97cecfd8351bc","mcp_get_code":{"code_sha256":"6ef97cecfd8351bc"}},{"arxiv_id":"2606.18539","paper":"/paper/arxiv-2606-18539","title":"TS-Fault: Benchmarking Time Series Forecasters Against Structural Faults","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Ray-zyy/TS-Fault","path":"adapt_foundation.py","file_url":"https://github.com/Ray-zyy/TS-Fault/blob/HEAD/adapt_foundation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cadf4d347c8da661","mcp_get_code":{"code_sha256":"cadf4d347c8da661"}},{"arxiv_id":"2606.15783","paper":"/paper/arxiv-2606-15783","title":"ttda704 at SemEval-2026 Task 4: Modeling Narrative Structures via Pseudonymization and Multi-View Sentence Alignment","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"dinhthienan33/SemEval2026-Task4-ttda704","path":"src/utils/metrics.py","file_url":"https://github.com/dinhthienan33/SemEval2026-Task4-ttda704/blob/HEAD/src/utils/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b9763a83279b7082","mcp_get_code":{"code_sha256":"b9763a83279b7082"}},{"arxiv_id":"2606.09607","paper":"/paper/arxiv-2606-09607","title":"Closure-Validated Circuit Discovery in Attention Heads: Co-activation Proposes, Ablation Disposes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"skydancerosel/coactivation-closure","path":"closure/closure_olmo_natural.py","file_url":"https://github.com/skydancerosel/coactivation-closure/blob/HEAD/closure/closure_olmo_natural.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e52205f22b814fa","mcp_get_code":{"code_sha256":"1e52205f22b814fa"}},{"arxiv_id":"2606.09607","paper":"/paper/arxiv-2606-09607","title":"Closure-Validated Circuit Discovery in Attention Heads: Co-activation Proposes, Ablation Disposes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"skydancerosel/coactivation-closure","path":"closure/closure_olmoe_route_cluster1.py","file_url":"https://github.com/skydancerosel/coactivation-closure/blob/HEAD/closure/closure_olmoe_route_cluster1.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"acf74f6ad99f9f97","mcp_get_code":{"code_sha256":"acf74f6ad99f9f97"}},{"arxiv_id":"2606.09607","paper":"/paper/arxiv-2606-09607","title":"Closure-Validated Circuit Discovery in Attention Heads: Co-activation Proposes, Ablation Disposes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"skydancerosel/coactivation-closure","path":"closure/closure_test_olmo_cluster2.py","file_url":"https://github.com/skydancerosel/coactivation-closure/blob/HEAD/closure/closure_test_olmo_cluster2.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8fa9b2fb8d43738a","mcp_get_code":{"code_sha256":"8fa9b2fb8d43738a"}},{"arxiv_id":"2606.09607","paper":"/paper/arxiv-2606-09607","title":"Closure-Validated Circuit Discovery in Attention Heads: Co-activation Proposes, Ablation Disposes","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"skydancerosel/coactivation-closure","path":"developmental/closure_at_intermediate.py","file_url":"https://github.com/skydancerosel/coactivation-closure/blob/HEAD/developmental/closure_at_intermediate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97a35722da7538dd","mcp_get_code":{"code_sha256":"97a35722da7538dd"}},{"arxiv_id":"2606.04971","paper":"/paper/arxiv-2606-04971","title":"Be Fair! Can Machine Learning Engineering Agents Adhere to Fairness Constraints?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"anna-richter/be-fair","path":"aide/logs/14-addition_2/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/14-addition_2/best_solution.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":"2c267d71b4b17300","mcp_get_code":{"code_sha256":"2c267d71b4b17300"}},{"arxiv_id":"2606.00253","paper":"/paper/arxiv-2606-00253","title":"Per-Group Error, Not Total MSE: Fine-Tuning Vision-Language-Action Models for 11-DoF Mobile Manipulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"paumontagut/per-group-mse-vla","path":"eval/per_group_mse.py","file_url":"https://github.com/paumontagut/per-group-mse-vla/blob/HEAD/eval/per_group_mse.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31d40136f6763990","mcp_get_code":{"code_sha256":"31d40136f6763990"}},{"arxiv_id":"2605.24687","paper":"/paper/arxiv-2605-24687","title":"HoloFair: Unified T2I Fairness Evaluation and Fair-GRPO Debiasing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"1059684669/HoloFair","path":"classifiers/train-age.py","file_url":"https://github.com/1059684669/HoloFair/blob/HEAD/classifiers/train-age.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":"ce2d4b8aed6a055f","mcp_get_code":{"code_sha256":"ce2d4b8aed6a055f"}},{"arxiv_id":"2605.24687","paper":"/paper/arxiv-2605-24687","title":"HoloFair: Unified T2I Fairness Evaluation and Fair-GRPO Debiasing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"1059684669/HoloFair","path":"classifiers/train_gender.py","file_url":"https://github.com/1059684669/HoloFair/blob/HEAD/classifiers/train_gender.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":"ea7d3297865d8906","mcp_get_code":{"code_sha256":"ea7d3297865d8906"}},{"arxiv_id":"2605.24687","paper":"/paper/arxiv-2605-24687","title":"HoloFair: Unified T2I Fairness Evaluation and Fair-GRPO Debiasing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"1059684669/HoloFair","path":"classifiers/train_race.py","file_url":"https://github.com/1059684669/HoloFair/blob/HEAD/classifiers/train_race.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":"b041918284029688","mcp_get_code":{"code_sha256":"b041918284029688"}},{"arxiv_id":"2605.24417","paper":"/paper/arxiv-2605-24417","title":"LLMTabBench: Evaluating LLMs on Binary Tabular Classification From Zero to Few Shots","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"sb-ai-lab/llm4tab","path":"feat-llm/utils.py","file_url":"https://github.com/sb-ai-lab/llm4tab/blob/HEAD/feat-llm/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3101ba4997e7d9b5","mcp_get_code":{"code_sha256":"3101ba4997e7d9b5"}},{"arxiv_id":"2605.21625","paper":"/paper/arxiv-2605-21625","title":"FLAT-PACK BENCH: Evaluating Spatio-Temporal Understanding in Large Vision-Language Models through Furniture Assembly","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"justachetan/flat-pack-bench","path":"src/tva/tva_judge.py","file_url":"https://github.com/justachetan/flat-pack-bench/blob/HEAD/src/tva/tva_judge.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5179e1f01539c74e","mcp_get_code":{"code_sha256":"5179e1f01539c74e"}},{"arxiv_id":"2605.16163","paper":"/paper/arxiv-2605-16163","title":"SwAIther-Precip: Lead-Time-Aware Bias Correction Enables Kilometer-Scale Downscaling of Global AI Precipitation Forecasts over Switzerland","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"danassou/swaither-precip","path":"swaither/helpers/bc_metrics.py","file_url":"https://github.com/danassou/swaither-precip/blob/HEAD/swaither/helpers/bc_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":"d6fea8d349063aa4","mcp_get_code":{"code_sha256":"d6fea8d349063aa4"}},{"arxiv_id":"2605.13043","paper":"/paper/arxiv-2605-13043","title":"Adaptive Steering and Remasking for Safe Generation in Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"leeyejin1231/DLM_Steering_Remasking","path":"utils/mmlu_eval.py","file_url":"https://github.com/leeyejin1231/DLM_Steering_Remasking/blob/HEAD/utils/mmlu_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"56f597e42de94f88","mcp_get_code":{"code_sha256":"56f597e42de94f88"}},{"arxiv_id":"2605.11884","paper":"/paper/arxiv-2605-11884","title":"Sobolev Regularized MMD Gradient Flow","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FerdTian/SrMMD","path":"src/generative/kwgflows/utils.py","file_url":"https://github.com/FerdTian/SrMMD/blob/HEAD/src/generative/kwgflows/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11e30489ac2c7110","mcp_get_code":{"code_sha256":"11e30489ac2c7110"}},{"arxiv_id":"2605.08110","paper":"/paper/arxiv-2605-08110","title":"BaLoRA: Bayesian Low-Rank Adaptation of Large Scale Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AGI-Edgerunners/LLM-Adapters","path":"multi_dataset_eval.py","file_url":"https://github.com/AGI-Edgerunners/LLM-Adapters/blob/HEAD/multi_dataset_eval.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":"2dc17f5e6fb39b3f","mcp_get_code":{"code_sha256":"2dc17f5e6fb39b3f"}},{"arxiv_id":"2605.06884","paper":"/paper/arxiv-2605-06884","title":"Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Xiaoran-Cheng/muon-randomized-svd","path":"cifar10/airbench/utils.py","file_url":"https://github.com/Xiaoran-Cheng/muon-randomized-svd/blob/HEAD/cifar10/airbench/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d81a95405659114","mcp_get_code":{"code_sha256":"5d81a95405659114"}},{"arxiv_id":"2605.06156","paper":"/paper/arxiv-2605-06156","title":"Entropy-Regularized Adjoint Matching for Offline Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ColinQiyangLi/qam","path":"evaluation.py","file_url":"https://github.com/ColinQiyangLi/qam/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14edce80be96677f","mcp_get_code":{"code_sha256":"14edce80be96677f"}},{"arxiv_id":"2605.01625","paper":"/paper/arxiv-2605-01625","title":"PRIME: Protein Representation via Physics-Informed Multiscale Equivariant Hierarchies","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HySonLab/PRIME","path":"plm_baseline.py","file_url":"https://github.com/HySonLab/PRIME/blob/HEAD/plm_baseline.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fddb0ea79ee68552","mcp_get_code":{"code_sha256":"fddb0ea79ee68552"}},{"arxiv_id":"2605.01625","paper":"/paper/arxiv-2605-01625","title":"PRIME: Protein Representation via Physics-Informed Multiscale Equivariant Hierarchies","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HySonLab/PRIME","path":"train_prime.py","file_url":"https://github.com/HySonLab/PRIME/blob/HEAD/train_prime.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e74e991ea6639f67","mcp_get_code":{"code_sha256":"e74e991ea6639f67"}},{"arxiv_id":"2605.00604","paper":"/paper/arxiv-2605-00604","title":"Affinity Is Not Enough: Recovering the Free Energy Principle in Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"russellwmy/affinity-is-not-enough","path":"prototype/routing_entropy.py","file_url":"https://github.com/russellwmy/affinity-is-not-enough/blob/HEAD/prototype/routing_entropy.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9b9d4654d1049eb5","mcp_get_code":{"code_sha256":"9b9d4654d1049eb5"}},{"arxiv_id":"2604.23824","paper":"/paper/arxiv-2604-23824","title":"Resource-Lean Lexicon Induction for German Dialects","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"mainlp/dialect-lexicon-induction","path":"src/run_bli.py","file_url":"https://github.com/mainlp/dialect-lexicon-induction/blob/HEAD/src/run_bli.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8f8ba84aa3d6052b","mcp_get_code":{"code_sha256":"8f8ba84aa3d6052b"}},{"arxiv_id":"2604.00339","paper":"/paper/arxiv-2604-00339","title":"When Career Data Runs Out: Structured Feature Engineering and Signal Limits for Founder Success Prediction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ihlamury/vcbench","path":"evaluate.py","file_url":"https://github.com/ihlamury/vcbench/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db8ef4f5f3b7a462","mcp_get_code":{"code_sha256":"db8ef4f5f3b7a462"}},{"arxiv_id":"2603.27303","paper":"/paper/arxiv-2603-27303","title":"Self-evolving AI agents for protein discovery and directed evolution","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ai4protein/VenusFactory2","path":"src/evaluate.py","file_url":"https://github.com/ai4protein/VenusFactory2/blob/HEAD/src/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"ef32c9d9f9c88a8f","mcp_get_code":{"code_sha256":"ef32c9d9f9c88a8f"}},{"arxiv_id":"2603.06248","paper":"/paper/arxiv-2603-06248","title":"Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"tml-epfl/softmax","path":"exp_classification.py","file_url":"https://github.com/tml-epfl/softmax/blob/HEAD/exp_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de1a6b54bb6d7eb2","mcp_get_code":{"code_sha256":"de1a6b54bb6d7eb2"}},{"arxiv_id":"2603.06248","paper":"/paper/arxiv-2603-06248","title":"Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"tml-epfl/softmax","path":"exp_induction.py","file_url":"https://github.com/tml-epfl/softmax/blob/HEAD/exp_induction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"195ef9d2094e5fa7","mcp_get_code":{"code_sha256":"195ef9d2094e5fa7"}},{"arxiv_id":"2601.22925","paper":"/paper/arxiv-2601-22925","title":"BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Tiny-Snow/BEAR-SIGIR-2026","path":"evaluate_batch_match.py","file_url":"https://github.com/Tiny-Snow/BEAR-SIGIR-2026/blob/HEAD/evaluate_batch_match.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06e0dab829a73677","mcp_get_code":{"code_sha256":"06e0dab829a73677"}},{"arxiv_id":"2601.16880","paper":"/paper/arxiv-2601-16880","title":"Theory of Minimal Weight Perturbations in Deep Networks and its Applications for Low-Rank Activated Backdoor Attacks","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"evansbeth/backdoor_attack","path":"Backdoor/fix_layer_classifier.py","file_url":"https://github.com/evansbeth/backdoor_attack/blob/HEAD/Backdoor/fix_layer_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cc872c3813254413","mcp_get_code":{"code_sha256":"cc872c3813254413"}},{"arxiv_id":"2601.03401","paper":"/paper/arxiv-2601-03401","title":"Rendering Data Unlearnable by Exploiting LLM Alignment Mechanisms","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cat-claws/unlearnable","path":"cifar10-retrain.py","file_url":"https://github.com/cat-claws/unlearnable/blob/HEAD/cifar10-retrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"68ae70e88b74a05c","mcp_get_code":{"code_sha256":"68ae70e88b74a05c"}},{"arxiv_id":"2512.17762","paper":"/paper/arxiv-2512-17762","title":"Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Graph-ECHO-Benchmark/ECHO","path":"PyG_implementation/echo_benchmark_example.py","file_url":"https://github.com/Graph-ECHO-Benchmark/ECHO/blob/HEAD/PyG_implementation/echo_benchmark_example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70e93e68f2edfa7d","mcp_get_code":{"code_sha256":"70e93e68f2edfa7d"}},{"arxiv_id":"2511.00446","paper":"/paper/arxiv-2511-00446","title":"ToxicTextCLIP: Text-Based Poisoning and Backdoor Attacks on CLIP Pre-training","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"xinyaocse/ToxicTextCLIP","path":"Background_aware_target_text_telector_and_victim_model/src/evaluate.py","file_url":"https://github.com/xinyaocse/ToxicTextCLIP/blob/HEAD/Background_aware_target_text_telector_and_victim_model/src/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d9bb188ab15dfa4b","mcp_get_code":{"code_sha256":"d9bb188ab15dfa4b"}},{"arxiv_id":"2510.18825","paper":"/paper/arxiv-2510-18825","title":"Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"null-xyj/M3Dphormer","path":"evaluate.py","file_url":"https://github.com/null-xyj/M3Dphormer/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce8d4a65c6646823","mcp_get_code":{"code_sha256":"ce8d4a65c6646823"}},{"arxiv_id":"2510.07964","paper":"/paper/arxiv-2510-07964","title":"PRESCRIBE: Predicting Single-Cell Responses with Bayesian Estimation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Bunnybeibei/PRESCRIBE","path":"gears/inference.py","file_url":"https://github.com/Bunnybeibei/PRESCRIBE/blob/HEAD/gears/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2064dcd76d82f44e","mcp_get_code":{"code_sha256":"2064dcd76d82f44e"}},{"arxiv_id":"2510.03276","paper":"/paper/arxiv-2510-03276","title":"QuadEnhancer: Leveraging Quadratic Transformations to Enhance Deep Neural Networks","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"chitar/QuadEnhancer","path":"LLM-finetuning/multi_dataset_eval.py","file_url":"https://github.com/chitar/QuadEnhancer/blob/HEAD/LLM-finetuning/multi_dataset_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2dc17f5e6fb39b3f","mcp_get_code":{"code_sha256":"2dc17f5e6fb39b3f"}},{"arxiv_id":"2509.18376","paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_amazon_ratings.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_amazon_ratings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b957472149f915c1","mcp_get_code":{"code_sha256":"b957472149f915c1"}},{"arxiv_id":"2509.18376","paper":"/paper/arxiv-2509-18376","title":"GNNXEMPLAR: Exemplars to Explanations -Natural Language Rules for Global GNN Interpretability","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"idea-iitd/GnnXemplar","path":"src/train/train_citeseer.py","file_url":"https://github.com/idea-iitd/GnnXemplar/blob/HEAD/src/train/train_citeseer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b3ed64d4b38eb525","mcp_get_code":{"code_sha256":"b3ed64d4b38eb525"}},{"arxiv_id":"2506.21458","paper":"/paper/spatial-mental-modeling-from-limited-views","title":"Spatial Mental Modeling from Limited Views","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mll-lab-nu/mindcube","path":"src/evaluation/evaluator.py","file_url":"https://github.com/mll-lab-nu/mindcube/blob/HEAD/src/evaluation/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2060b70a5dd8ad5c","mcp_get_code":{"code_sha256":"2060b70a5dd8ad5c"}},{"arxiv_id":"2506.18434","paper":null,"title":"arXiv:2506.18434","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"fruffini/PEFT_Prognosis","path":"src/evaluation/utils_evaluation.py","file_url":"https://github.com/fruffini/PEFT_Prognosis/blob/HEAD/src/evaluation/utils_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aaa6d10ca275401b","mcp_get_code":{"code_sha256":"aaa6d10ca275401b"}},{"arxiv_id":"2506.17709","paper":"/paper/cega-a-cost-effective-approach-for-graph","title":"CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition","date":"2025-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labrai/cega","path":"attacks/attack_0.py","file_url":"https://github.com/labrai/cega/blob/HEAD/attacks/attack_0.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dfc1002c59a8eebb","mcp_get_code":{"code_sha256":"dfc1002c59a8eebb"}},{"arxiv_id":"2506.07972","paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"global_routing/baseline/run_baseline.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/global_routing/baseline/run_baseline.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":"0a0b8626cedf1ab8","mcp_get_code":{"code_sha256":"0a0b8626cedf1ab8"}},{"arxiv_id":"2506.03355","paper":"/paper/robustness-in-both-domains-clip-needs-a","title":"Robustness in Both Domains: CLIP Needs a Robust Text Encoder","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/LEAF","path":"src/robust_vlm/train/adversarial_training_clip.py","file_url":"https://github.com/LIONS-EPFL/LEAF/blob/HEAD/src/robust_vlm/train/adversarial_training_clip.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c5a17635441cc52d","mcp_get_code":{"code_sha256":"c5a17635441cc52d"}},{"arxiv_id":"2505.20840","paper":null,"title":"arXiv:2505.20840","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"dooho00/agg-buffer","path":"evaluate/utils.py","file_url":"https://github.com/dooho00/agg-buffer/blob/HEAD/evaluate/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":"8b2f721edaf1342f","mcp_get_code":{"code_sha256":"8b2f721edaf1342f"}},{"arxiv_id":"2505.15055","paper":"/paper/lost-in-benchmarks-rethinking-large-language","title":"Lost in Benchmarks? Rethinking Large Language Model Benchmarking with Item Response Theory","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Joe-Hall-Lee/PSN-IRT","path":"models/PSN_IRT.py","file_url":"https://github.com/Joe-Hall-Lee/PSN-IRT/blob/HEAD/models/PSN_IRT.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"199f4d29b5c255ca","mcp_get_code":{"code_sha256":"199f4d29b5c255ca"}},{"arxiv_id":"2505.04608","paper":"/paper/watch-weighted-adaptive-testing-for","title":"WATCH: Adaptive Monitoring for AI Deployments via Weighted-Conformal Martingales","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaronhan223/watch","path":"src/main_mnist_cifar.py","file_url":"https://github.com/aaronhan223/watch/blob/HEAD/src/main_mnist_cifar.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":"920241d05b739b86","mcp_get_code":{"code_sha256":"920241d05b739b86"}},{"arxiv_id":"2505.02639","paper":"/paper/enhancing-chemical-reaction-and","title":"Enhancing Chemical Reaction and Retrosynthesis Prediction with Large Language Model and Dual-task Learning","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JacklinGroup/ChemDual","path":"evaluation/eval_nlp_metrics.py","file_url":"https://github.com/JacklinGroup/ChemDual/blob/HEAD/evaluation/eval_nlp_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":"2c5a0243877daa2b","mcp_get_code":{"code_sha256":"2c5a0243877daa2b"}},{"arxiv_id":"2505.00284","paper":"/paper/lightemma-lightweight-end-to-end-multimodal","title":"LightEMMA: Lightweight End-to-End Multimodal Model for Autonomous Driving","date":"2025-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michigan-traffic-lab/lightemma","path":"evaluate.py","file_url":"https://github.com/michigan-traffic-lab/lightemma/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8bc72f3d51539799","mcp_get_code":{"code_sha256":"8bc72f3d51539799"}},{"arxiv_id":"2505.00284","paper":"/paper/lightemma-lightweight-end-to-end-multimodal","title":"LightEMMA: Lightweight End-to-End Multimodal Model for Autonomous Driving","date":"2025-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michigan-traffic-lab/lightemma","path":"evaluate_all.py","file_url":"https://github.com/michigan-traffic-lab/lightemma/blob/HEAD/evaluate_all.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5029d05f539396ce","mcp_get_code":{"code_sha256":"5029d05f539396ce"}},{"arxiv_id":"2504.16438","paper":"/paper/private-federated-learning-using-preference","title":"Private Federated Learning using Preference-Optimized Synthetic Data","date":"2025-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meiyuw/popri","path":"downstream_eval.py","file_url":"https://github.com/meiyuw/popri/blob/HEAD/downstream_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79e6dd2253a6ae72","mcp_get_code":{"code_sha256":"79e6dd2253a6ae72"}},{"arxiv_id":"2503.13987","paper":"/paper/striving-for-simplicity-simple-yet-effective","title":"Striving for Simplicity: Simple Yet Effective Prior-Aware Pseudo-Labeling for Semi-Supervised Ultrasound Image Segmentation","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wutcm-lab/shape-prior-semi-seg","path":"airs/semi/code/utils/evaluate.py","file_url":"https://github.com/wutcm-lab/shape-prior-semi-seg/blob/HEAD/airs/semi/code/utils/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0aaf8aa3ba2734d6","mcp_get_code":{"code_sha256":"0aaf8aa3ba2734d6"}},{"arxiv_id":"2503.03401","paper":"/paper/evolutionary-prediction-games","title":"Evolutionary Prediction Games","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edensaig/evolutionary-prediction-games","path":"experiments/cifar/train_cifar.py","file_url":"https://github.com/edensaig/evolutionary-prediction-games/blob/HEAD/experiments/cifar/train_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1fcdde7de7d80af0","mcp_get_code":{"code_sha256":"1fcdde7de7d80af0"}},{"arxiv_id":"2503.00653","paper":"/paper/discrete-codebook-world-models-for-continuous","title":"Discrete Codebook World Models for Continuous Control","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidanscannell/dcmpc","path":"utils/evaluate.py","file_url":"https://github.com/aidanscannell/dcmpc/blob/HEAD/utils/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d3835836ba9076b","mcp_get_code":{"code_sha256":"1d3835836ba9076b"}},{"arxiv_id":"2502.19252","paper":"/paper/graphbridge-towards-arbitrary-transfer","title":"GraphBridge: Towards Arbitrary Transfer Learning in GNNs","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jujulili888/graphbridge","path":"mid_hard/transfer_tuning.py","file_url":"https://github.com/jujulili888/graphbridge/blob/HEAD/mid_hard/transfer_tuning.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":"aed29dc59270ca96","mcp_get_code":{"code_sha256":"aed29dc59270ca96"}},{"arxiv_id":"2502.15436","paper":"/paper/fed-sb-a-silver-bullet-for-extreme","title":"Fed-SB: A Silver Bullet for Extreme Communication Efficiency and Performance in (Private) Federated LoRA Fine-Tuning","date":"2025-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CERT-Lab/fed-sb","path":"fed_sb/DP/SNLI/fed_trainer.py","file_url":"https://github.com/CERT-Lab/fed-sb/blob/HEAD/fed_sb/DP/SNLI/fed_trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"16faa36d77bc31eb","mcp_get_code":{"code_sha256":"16faa36d77bc31eb"}},{"arxiv_id":"2502.11986","paper":"/paper/selective-task-group-updates-for-multi-task","title":"Selective Task Group Updates for Multi-Task Optimization","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wooseong97/sel-update-mtl","path":"sel-update-mtl/utils/train_utils.py","file_url":"https://github.com/wooseong97/sel-update-mtl/blob/HEAD/sel-update-mtl/utils/train_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc95be4bcb3a1abd","mcp_get_code":{"code_sha256":"cc95be4bcb3a1abd"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"990fcd8a91251235","mcp_get_code":{"code_sha256":"990fcd8a91251235"}},{"arxiv_id":"2502.05932","paper":"/paper/skill-expansion-and-composition-in-parameter","title":"Skill Expansion and Composition in Parameter Space","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ltlhuuu/PSEC","path":"jaxrl5/evaluation_dsrl.py","file_url":"https://github.com/ltlhuuu/PSEC/blob/HEAD/jaxrl5/evaluation_dsrl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27b1370715ab6f72","mcp_get_code":{"code_sha256":"27b1370715ab6f72"}},{"arxiv_id":"2502.04510","paper":"/paper/heterogeneous-swarms-jointly-optimizing-model","title":"Heterogeneous Swarms: Jointly Optimizing Model Roles and Weights for Multi-LLM Systems","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BunsenFeng/heterogeneous_swarm","path":"search.py","file_url":"https://github.com/BunsenFeng/heterogeneous_swarm/blob/HEAD/search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c3251894d6a5c6ec","mcp_get_code":{"code_sha256":"c3251894d6a5c6ec"}},{"arxiv_id":"2501.08330","paper":"/paper/gradient-equilibrium-in-online-learning","title":"Gradient Equilibrium in Online Learning: Theory and Applications","date":"2025-01-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/gradient-equilibrium","path":"helpsteer/train_and_generate_rewards.py","file_url":"https://github.com/aangelopoulos/gradient-equilibrium/blob/HEAD/helpsteer/train_and_generate_rewards.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e41761889fc4d29","mcp_get_code":{"code_sha256":"1e41761889fc4d29"}},{"arxiv_id":"2412.13662","paper":"/paper/when-should-we-prefer-state-to-visual-dagger","title":"When Should We Prefer State-to-Visual DAgger Over Visual Reinforcement Learning?","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongzhoumu/s2v-dagger","path":"scripts/state_sac_adroit.py","file_url":"https://github.com/tongzhoumu/s2v-dagger/blob/HEAD/scripts/state_sac_adroit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"322670cb8fb632dd","mcp_get_code":{"code_sha256":"322670cb8fb632dd"}},{"arxiv_id":"2412.13178","paper":"/paper/safeagentbench-a-benchmark-for-safe-task","title":"SafeAgentBench: A Benchmark for Safe Task Planning of Embodied LLM Agents","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shengyin1224/safeagentbench","path":"evaluator/abstract_evaluate.py","file_url":"https://github.com/shengyin1224/safeagentbench/blob/HEAD/evaluator/abstract_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b1f70631ef7016f","mcp_get_code":{"code_sha256":"1b1f70631ef7016f"}},{"arxiv_id":"2412.12841","paper":"/paper/benchmarking-and-understanding-compositional","title":"Benchmarking and Understanding Compositional Relational Reasoning of LLMs","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caiyun-ai/gar","path":"MLP/code/train_and_test_MLP.py","file_url":"https://github.com/caiyun-ai/gar/blob/HEAD/MLP/code/train_and_test_MLP.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5cfede186da6f438","mcp_get_code":{"code_sha256":"5cfede186da6f438"}},{"arxiv_id":"2412.07762","paper":"/paper/efficient-online-reinforcement-learning-fine","title":"Efficient Online Reinforcement Learning Fine-Tuning Need Not Retain Offline Data","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouzypaul/wsrl","path":"wsrl/common/evaluation.py","file_url":"https://github.com/zhouzypaul/wsrl/blob/HEAD/wsrl/common/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e7f74feab9af0bcc","mcp_get_code":{"code_sha256":"e7f74feab9af0bcc"}},{"arxiv_id":"2411.14429","paper":"/paper/revisiting-the-integration-of-convolution-and","title":"Revisiting the Integration of Convolution and Attention for Vision Backbone","date":"2024-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rayleizhu/GLMix","path":"ConvNextV2/engine_finetune.py","file_url":"https://github.com/rayleizhu/GLMix/blob/HEAD/ConvNextV2/engine_finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ab1c8b0afb86428","mcp_get_code":{"code_sha256":"6ab1c8b0afb86428"}},{"arxiv_id":"2411.06448","paper":"/paper/over-parameterized-student-model-via-tensor","title":"Over-parameterized Student Model via Tensor Decomposition Boosted Knowledge Distillation","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intell-sci-comput/OPDF","path":"BERT-of-Theseus/run_glue_MPO_losslayer.py","file_url":"https://github.com/intell-sci-comput/OPDF/blob/HEAD/BERT-of-Theseus/run_glue_MPO_losslayer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d34cc0827c3ebfd6","mcp_get_code":{"code_sha256":"d34cc0827c3ebfd6"}},{"arxiv_id":"2411.02988","paper":"/paper/confidence-calibration-of-classifiers-with","title":"Confidence Calibration of Classifiers with Many Classes","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/PLMCalibration","path":"prompt-dynamics.py","file_url":"https://github.com/lifan-yuan/PLMCalibration/blob/HEAD/prompt-dynamics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2ecbd7ff12e83d5","mcp_get_code":{"code_sha256":"e2ecbd7ff12e83d5"}},{"arxiv_id":"2411.00566","paper":"/paper/patternboost-constructions-in-mathematics","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zawagner22/transformers_math_experiments","path":"makebettertokens.py","file_url":"https://github.com/zawagner22/transformers_math_experiments/blob/HEAD/makebettertokens.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"620b50d564c38f6f","mcp_get_code":{"code_sha256":"620b50d564c38f6f"}},{"arxiv_id":"2411.00566","paper":"/paper/patternboost-constructions-in-mathematics","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zawagner22/transformers_math_experiments","path":"makemoretokens.py","file_url":"https://github.com/zawagner22/transformers_math_experiments/blob/HEAD/makemoretokens.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c0404a54188e528d","mcp_get_code":{"code_sha256":"c0404a54188e528d"}},{"arxiv_id":"2411.00177","paper":"/paper/llm4mat-bench-benchmarking-large-language","title":"LLM4Mat-Bench: Benchmarking Large Language Models for Materials Property Prediction","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vertaix/llm4mat-bench","path":"code/llmprop_and_matbert/evaluate.py","file_url":"https://github.com/vertaix/llm4mat-bench/blob/HEAD/code/llmprop_and_matbert/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3de2652a4ecfff48","mcp_get_code":{"code_sha256":"3de2652a4ecfff48"}},{"arxiv_id":"2410.23940","paper":"/paper/quantum-deep-equilibrium-models","title":"Quantum Deep Equilibrium Models","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martaskrt/qdeq","path":"DEQ-Quantum/train_qdeq.py","file_url":"https://github.com/martaskrt/qdeq/blob/HEAD/DEQ-Quantum/train_qdeq.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee0aeb0dbfe062f7","mcp_get_code":{"code_sha256":"ee0aeb0dbfe062f7"}},{"arxiv_id":"2410.23042","paper":"/paper/toward-understanding-in-context-vs-in-weight","title":"Toward Understanding In-context vs. In-weight Learning","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chanb/icl_vs_iwl","path":"experiments/utils.py","file_url":"https://github.com/chanb/icl_vs_iwl/blob/HEAD/experiments/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3530bb7a687ad762","mcp_get_code":{"code_sha256":"3530bb7a687ad762"}},{"arxiv_id":"2410.20868","paper":"/paper/recflow-an-industrial-full-flow","title":"RecFlow: An Industrial Full Flow Recommendation Dataset","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"recflow-iclr/recflow","path":"coarse/metrics.py","file_url":"https://github.com/recflow-iclr/recflow/blob/HEAD/coarse/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"code_sha256_prefix":"0e11171ee3a742b5","mcp_get_code":{"code_sha256":"0e11171ee3a742b5"}},{"arxiv_id":"2410.13831","paper":"/paper/the-disparate-benefits-of-deep-ensembles","title":"The Disparate Benefits of Deep Ensembles","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/disparate-benefits","path":"source/utils/train_utils.py","file_url":"https://github.com/ml-jku/disparate-benefits/blob/HEAD/source/utils/train_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7262c1188d1b942a","mcp_get_code":{"code_sha256":"7262c1188d1b942a"}},{"arxiv_id":"2410.11247","paper":"/paper/a-unified-framework-for-forward-and-inverse","title":"A Unified Framework for Forward and Inverse Problems in Subsurface Imaging using Latent Space Translations","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kgml-lab/generalized-forward-inverse-framework-for-dl4si","path":"src/train_forward.py","file_url":"https://github.com/kgml-lab/generalized-forward-inverse-framework-for-dl4si/blob/HEAD/src/train_forward.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b93f3fd47a0eae21","mcp_get_code":{"code_sha256":"b93f3fd47a0eae21"}},{"arxiv_id":"2410.11247","paper":"/paper/a-unified-framework-for-forward-and-inverse","title":"A Unified Framework for Forward and Inverse Problems in Subsurface Imaging using Latent Space Translations","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kgml-lab/generalized-forward-inverse-framework-for-dl4si","path":"src/train_inverse.py","file_url":"https://github.com/kgml-lab/generalized-forward-inverse-framework-for-dl4si/blob/HEAD/src/train_inverse.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c370d85ad78c9d88","mcp_get_code":{"code_sha256":"c370d85ad78c9d88"}},{"arxiv_id":"2410.11061","paper":"/paper/learning-to-optimize-for-mixed-integer-non","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/l2o-pminlp","path":"run/nonconvex.py","file_url":"https://github.com/pnnl/l2o-pminlp/blob/HEAD/run/nonconvex.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b0e0c9009e30f4b0","mcp_get_code":{"code_sha256":"b0e0c9009e30f4b0"}},{"arxiv_id":"2410.11061","paper":"/paper/learning-to-optimize-for-mixed-integer-non","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/l2o-pminlp","path":"run/quadratic.py","file_url":"https://github.com/pnnl/l2o-pminlp/blob/HEAD/run/quadratic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"171645155c800b62","mcp_get_code":{"code_sha256":"171645155c800b62"}},{"arxiv_id":"2410.11061","paper":"/paper/learning-to-optimize-for-mixed-integer-non","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/l2o-pminlp","path":"run/rosenbrock.py","file_url":"https://github.com/pnnl/l2o-pminlp/blob/HEAD/run/rosenbrock.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f20ae166063e333b","mcp_get_code":{"code_sha256":"f20ae166063e333b"}},{"arxiv_id":"2410.07671","paper":"/paper/disco-a-hierarchical-disentangled-cognitive","title":"DISCO: A Hierarchical Disentangled Cognitive Diagnosis Framework for Interpretable Job Recommendation","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LabyrinthineLeo/DISCO","path":"utils/train_model.py","file_url":"https://github.com/LabyrinthineLeo/DISCO/blob/HEAD/utils/train_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"51c736265fabc6ce","mcp_get_code":{"code_sha256":"51c736265fabc6ce"}},{"arxiv_id":"2410.04612","paper":"/paper/regressing-the-relative-future-efficient","title":"Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaolingao/refuel","path":"setting_one/refuel.py","file_url":"https://github.com/zhaolingao/refuel/blob/HEAD/setting_one/refuel.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":"52f5fd73e21e6108","mcp_get_code":{"code_sha256":"52f5fd73e21e6108"}},{"arxiv_id":"2410.02223","paper":"/paper/embedllm-learning-compact-representations-of","title":"EmbedLLM: Learning Compact Representations of Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardzhuang0412/embedllm","path":"algorithm/mf.py","file_url":"https://github.com/richardzhuang0412/embedllm/blob/HEAD/algorithm/mf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2adf956b4cc18778","mcp_get_code":{"code_sha256":"2adf956b4cc18778"}},{"arxiv_id":"2410.02184","paper":"/paper/codejudge-evaluating-code-generation-with","title":"CodeJudge: Evaluating Code Generation with Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terryyz/ice-score","path":"llm_code_eval/evaluator.py","file_url":"https://github.com/terryyz/ice-score/blob/HEAD/llm_code_eval/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bcf3a566009fd040","mcp_get_code":{"code_sha256":"bcf3a566009fd040"}},{"arxiv_id":"2409.20012","paper":"/paper/towards-robust-multimodal-sentiment-analysis","title":"Towards Robust Multimodal Sentiment Analysis with Incomplete Data","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Haoyu-ha/LNLN","path":"robust_evaluation.py","file_url":"https://github.com/Haoyu-ha/LNLN/blob/HEAD/robust_evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"980a7a91e8c19f50","mcp_get_code":{"code_sha256":"980a7a91e8c19f50"}},{"arxiv_id":"2409.17687","paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/GraphEdX","path":"src/train_graphedx.py","file_url":"https://github.com/structlearning/GraphEdX/blob/HEAD/src/train_graphedx.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ab108ac04cb5ade","mcp_get_code":{"code_sha256":"0ab108ac04cb5ade"}},{"arxiv_id":"2409.17687","paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/GraphEdX","path":"src/train_graphedx_label.py","file_url":"https://github.com/structlearning/GraphEdX/blob/HEAD/src/train_graphedx_label.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"18a32d300eb754e3","mcp_get_code":{"code_sha256":"18a32d300eb754e3"}},{"arxiv_id":"2409.17446","paper":"/paper/efficient-federated-learning-against","title":"Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailability","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingxiang12/fedawe","path":"util/util.py","file_url":"https://github.com/mingxiang12/fedawe/blob/HEAD/util/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b12aa7e0222930cf","mcp_get_code":{"code_sha256":"b12aa7e0222930cf"}},{"arxiv_id":"2409.17372","paper":"/paper/search-for-efficient-large-language-models","title":"Search for Efficient Large Language Models","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnricecake/search-llm","path":"evolution.py","file_url":"https://github.com/shawnricecake/search-llm/blob/HEAD/evolution.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"da31d3daaf108d8e","mcp_get_code":{"code_sha256":"da31d3daaf108d8e"}},{"arxiv_id":"2409.12181","paper":"/paper/a-controlled-study-on-long-context-extension","title":"A Controlled Study on Long Context Extension and Generalization in LLMs","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leooyii/lceg","path":"eval_perplexity/eval_lm_infinite.py","file_url":"https://github.com/leooyii/lceg/blob/HEAD/eval_perplexity/eval_lm_infinite.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d8751620f2e23ff","mcp_get_code":{"code_sha256":"7d8751620f2e23ff"}},{"arxiv_id":"2409.12181","paper":"/paper/a-controlled-study-on-long-context-extension","title":"A Controlled Study on Long Context Extension and Generalization in LLMs","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leooyii/lceg","path":"eval_perplexity/eval_clex.py","file_url":"https://github.com/leooyii/lceg/blob/HEAD/eval_perplexity/eval_clex.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"708bed3133d01060","mcp_get_code":{"code_sha256":"708bed3133d01060"}},{"arxiv_id":"2409.12181","paper":"/paper/a-controlled-study-on-long-context-extension","title":"A Controlled Study on Long Context Extension and Generalization in LLMs","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leooyii/lceg","path":"eval_perplexity/eval_landmark.py","file_url":"https://github.com/leooyii/lceg/blob/HEAD/eval_perplexity/eval_landmark.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d69813e43224dc01","mcp_get_code":{"code_sha256":"d69813e43224dc01"}},{"arxiv_id":"2409.07440","paper":"/paper/super-evaluating-agents-on-setting-up-and","title":"SUPER: Evaluating Agents on Setting Up and Executing Tasks from Research Repositories","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/super-benchmark","path":"super/evaluate_dataset.py","file_url":"https://github.com/allenai/super-benchmark/blob/HEAD/super/evaluate_dataset.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":"4b2aba55654320d3","mcp_get_code":{"code_sha256":"4b2aba55654320d3"}},{"arxiv_id":"2409.03662","paper":"/paper/the-representation-landscape-of-few-shot","title":"The representation landscape of few-shot learning and fine-tuning in large language models","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diegodoimo/geometry_icl_finetuning","path":"finetune.py","file_url":"https://github.com/diegodoimo/geometry_icl_finetuning/blob/HEAD/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4e34b8e1dddc6b87","mcp_get_code":{"code_sha256":"4e34b8e1dddc6b87"}},{"arxiv_id":"2409.03368","paper":"/paper/training-free-conversion-of-pretrained-anns","title":"Inference-Scale Complexity in ANN-SNN Conversion for High-Performance and Low-Power Applications","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"putshua/inference-scale-ann-snn","path":"utils.py","file_url":"https://github.com/putshua/inference-scale-ann-snn/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"813f8e2327491b01","mcp_get_code":{"code_sha256":"813f8e2327491b01"}},{"arxiv_id":"2409.01035","paper":"/paper/unleashing-the-power-of-task-specific","title":"Task-Specific Directions: Definition, Exploration, and Utilization in Parameter Efficient Fine-Tuning","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chongjie-Si/Subspace-Tuning","path":"CR_MR/multi_dataset_eval.py","file_url":"https://github.com/Chongjie-Si/Subspace-Tuning/blob/HEAD/CR_MR/multi_dataset_eval.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":"2dc17f5e6fb39b3f","mcp_get_code":{"code_sha256":"2dc17f5e6fb39b3f"}},{"arxiv_id":"2409.08282","paper":"/paper/lsr-igru-stock-trend-prediction-based-on-long","title":"LSR-IGRU: Stock Trend Prediction Based on Long Short-Term Relationships and Improved GRU","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zp1481616577/baselines_lsr-igru","path":"18_THGNN/5_model_train_predict.py","file_url":"https://github.com/zp1481616577/baselines_lsr-igru/blob/HEAD/18_THGNN/5_model_train_predict.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c86e746913de988","mcp_get_code":{"code_sha256":"0c86e746913de988"}},{"arxiv_id":"2409.00101","paper":"/paper/neurolm-a-universal-multi-task-foundation","title":"NeuroLM: A Universal Multi-task Foundation Model for Bridging the Gap between Language and EEG Signals","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"935963004/neurolm","path":"train_pretrain.py","file_url":"https://github.com/935963004/neurolm/blob/HEAD/train_pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46f04b20e87a817d","mcp_get_code":{"code_sha256":"46f04b20e87a817d"}},{"arxiv_id":"2408.16939","paper":"/paper/theoretical-insights-into-overparameterized","title":"Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learning","date":"2024-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aminbana/MTL-Theory","path":"train_continual.py","file_url":"https://github.com/aminbana/MTL-Theory/blob/HEAD/train_continual.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"98ce707761800b89","mcp_get_code":{"code_sha256":"98ce707761800b89"}},{"arxiv_id":"2408.11815","paper":"/paper/great-memory-shallow-reasoning-limits-of-k-nn","title":"Great Memory, Shallow Reasoning: Limits of $k$NN-LMs","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsyfate/knnlm-limits","path":"eval_bbh.py","file_url":"https://github.com/gsyfate/knnlm-limits/blob/HEAD/eval_bbh.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"699be993f9d76a78","mcp_get_code":{"code_sha256":"699be993f9d76a78"}},{"arxiv_id":"2408.11804","paper":"/paper/approaching-deep-learning-through-the","title":"Approaching Deep Learning through the Spectral Dynamics of Weights","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyunis/spectral_dynamics","path":"language_modeling/evaluate_run.py","file_url":"https://github.com/dyunis/spectral_dynamics/blob/HEAD/language_modeling/evaluate_run.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1aad283571ee906a","mcp_get_code":{"code_sha256":"1aad283571ee906a"}},{"arxiv_id":"2408.11804","paper":"/paper/approaching-deep-learning-through-the","title":"Approaching Deep Learning through the Spectral Dynamics of Weights","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyunis/spectral_dynamics","path":"language_modeling/evaluate_lmc.py","file_url":"https://github.com/dyunis/spectral_dynamics/blob/HEAD/language_modeling/evaluate_lmc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"73f3caf50cec419a","mcp_get_code":{"code_sha256":"73f3caf50cec419a"}},{"arxiv_id":"2408.08054","paper":"/paper/text2bim-generating-building-models-using-a","title":"Text2BIM: Generating Building Models Using a Large Language Model-based Multi-Agent Framework","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dcy0577/Text2BIM","path":"tool_agent/python_interpreter.py","file_url":"https://github.com/dcy0577/Text2BIM/blob/HEAD/tool_agent/python_interpreter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"623800324f32e3a0","mcp_get_code":{"code_sha256":"623800324f32e3a0"}},{"arxiv_id":"2407.15352","paper":"/paper/maven-fact-a-large-scale-event-factuality","title":"MAVEN-Fact: A Large-scale Event Factuality Detection Dataset","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/MAVEN-FACT","path":"trainEFD/train_t5.py","file_url":"https://github.com/THU-KEG/MAVEN-FACT/blob/HEAD/trainEFD/train_t5.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"43f9150bce8a7987","mcp_get_code":{"code_sha256":"43f9150bce8a7987"}},{"arxiv_id":"2407.11756","paper":"/paper/a-theoretical-formulation-of-many-body","title":"A Theoretical Formulation of Many-body Message Passing Neural Networks","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jthh/many-body-mpnn","path":"utils.py","file_url":"https://github.com/jthh/many-body-mpnn/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0cc26e3d0c7cfdb6","mcp_get_code":{"code_sha256":"0cc26e3d0c7cfdb6"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Meihan-Liu/24AAAI-A2GNN","path":"A2GNN-adv/utils.py","file_url":"https://github.com/Meihan-Liu/24AAAI-A2GNN/blob/HEAD/A2GNN-adv/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fa70e2f6d7d22341","mcp_get_code":{"code_sha256":"fa70e2f6d7d22341"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"run_dann.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/run_dann.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e44b2f9346bef174","mcp_get_code":{"code_sha256":"e44b2f9346bef174"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"run_dgda.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/run_dgda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e11bd86d839000c0","mcp_get_code":{"code_sha256":"e11bd86d839000c0"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"run_diva.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/run_diva.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"687b820b60b21304","mcp_get_code":{"code_sha256":"687b820b60b21304"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"run_dsr.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/run_dsr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ccd766ebf0ae1ca0","mcp_get_code":{"code_sha256":"ccd766ebf0ae1ca0"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rynewu224/GraphDA","path":"run_mdd.py","file_url":"https://github.com/rynewu224/GraphDA/blob/HEAD/run_mdd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b3b89ff191f4ffa5","mcp_get_code":{"code_sha256":"b3b89ff191f4ffa5"}},{"arxiv_id":"2407.03961","paper":"/paper/leveraging-latent-diffusion-models-for","title":"Leveraging Latent Diffusion Models for Training-Free In-Distribution Data Augmentation for Surface Defect Detection","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligolabs/diag","path":"train_ResNet50.py","file_url":"https://github.com/intelligolabs/diag/blob/HEAD/train_ResNet50.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ea47978cfb7cc95","mcp_get_code":{"code_sha256":"8ea47978cfb7cc95"}},{"arxiv_id":"2407.03856","paper":"/paper/q-adapter-training-your-llm-adapter-as-a","title":"Q-Adapter: Customizing Pre-trained LLMs to New Preferences with Forgetting Mitigation","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LAMDA-RL/Q-Adapter","path":"make_replay_data.py","file_url":"https://github.com/LAMDA-RL/Q-Adapter/blob/HEAD/make_replay_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"06ed656b6c40d9ac","mcp_get_code":{"code_sha256":"06ed656b6c40d9ac"}},{"arxiv_id":"2407.03618","paper":"/paper/bm25s-orders-of-magnitude-faster-lexical","title":"BM25S: Orders of magnitude faster lexical search via eager sparse scoring","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xhluca/bm25-benchmarks","path":"benchmark/on_bm25s.py","file_url":"https://github.com/xhluca/bm25-benchmarks/blob/HEAD/benchmark/on_bm25s.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cae3ad88ac9412a8","mcp_get_code":{"code_sha256":"cae3ad88ac9412a8"}},{"arxiv_id":"2407.07723","paper":"/paper/understanding-is-compression","title":"Lossless data compression by large models","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcGill-NLP/medal","path":"utils.py","file_url":"https://github.com/mcGill-NLP/medal/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ba02ce5ab3059cd9","mcp_get_code":{"code_sha256":"ba02ce5ab3059cd9"}},{"arxiv_id":"2406.14924","paper":"/paper/dipex-dispersing-prompt-expansion-for-class","title":"DiPEx: Dispersing Prompt Expansion for Class-Agnostic Object Detection","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jason-lim26/DiPEx","path":"Open-GroundingDino/datasets/coco_eval.py","file_url":"https://github.com/jason-lim26/DiPEx/blob/HEAD/Open-GroundingDino/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2406.12329","paper":"/paper/snap-unlearning-selective-knowledge-in-large","title":"Opt-Out: Investigating Entity-Level Unlearning for Large Language Models via Optimal Transport","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brightjade/Opt-Out","path":"evaluator.py","file_url":"https://github.com/brightjade/Opt-Out/blob/HEAD/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7602201e656afaf5","mcp_get_code":{"code_sha256":"7602201e656afaf5"}},{"arxiv_id":"2406.11614","paper":"/paper/intrinsic-evaluation-of-unlearning-using","title":"Intrinsic Evaluation of Unlearning Using Parametric Knowledge Traces","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihuaihong/conceptvectors","path":"evaluate_util.py","file_url":"https://github.com/yihuaihong/conceptvectors/blob/HEAD/evaluate_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"b5f15de193c7c033","mcp_get_code":{"code_sha256":"b5f15de193c7c033"}},{"arxiv_id":"2406.11614","paper":"/paper/intrinsic-evaluation-of-unlearning-using","title":"Intrinsic Evaluation of Unlearning Using Parametric Knowledge Traces","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihuaihong/conceptvectors","path":"Jailbreak/evaluate_util.py","file_url":"https://github.com/yihuaihong/conceptvectors/blob/HEAD/Jailbreak/evaluate_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"d06a2159d79e0268","mcp_get_code":{"code_sha256":"d06a2159d79e0268"}},{"arxiv_id":"2406.11614","paper":"/paper/intrinsic-evaluation-of-unlearning-using","title":"Intrinsic Evaluation of Unlearning Using Parametric Knowledge Traces","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihuaihong/conceptvectors","path":"forget.py","file_url":"https://github.com/yihuaihong/conceptvectors/blob/HEAD/forget.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"0a20c1af0875a853","mcp_get_code":{"code_sha256":"0a20c1af0875a853"}},{"arxiv_id":"2406.10685","paper":"/paper/scale-equivariant-graph-metanetworks","title":"Scale Equivariant Graph Metanetworks","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkalogero/scalegmn","path":"predicting_generalization.py","file_url":"https://github.com/jkalogero/scalegmn/blob/HEAD/predicting_generalization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"248f1ce6a37e2737","mcp_get_code":{"code_sha256":"248f1ce6a37e2737"}},{"arxiv_id":"2406.09976","paper":"/paper/robust-model-based-reinforcement-learning-1","title":"Robust Model-Based Reinforcement Learning with an Adversarial Auxiliary Model","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmbpo-eval/rmbpo-eval","path":"evaluate.py","file_url":"https://github.com/rmbpo-eval/rmbpo-eval/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91c30788a79c7bf8","mcp_get_code":{"code_sha256":"91c30788a79c7bf8"}},{"arxiv_id":"2406.09215","paper":"/paper/on-softmax-direct-preference-optimization-for","title":"On Softmax Direct Preference Optimization for Recommendation","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyuxin1999/S-DPO","path":"evaluate_batch.py","file_url":"https://github.com/chenyuxin1999/S-DPO/blob/HEAD/evaluate_batch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"26dfc6c299402922","mcp_get_code":{"code_sha256":"26dfc6c299402922"}},{"arxiv_id":"2406.08527","paper":"/paper/optimized-feature-generation-for-tabular-data","title":"Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaehyun513/OCTree","path":"ours/utils_xg.py","file_url":"https://github.com/jaehyun513/OCTree/blob/HEAD/ours/utils_xg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dd609d5a98e9f51f","mcp_get_code":{"code_sha256":"dd609d5a98e9f51f"}},{"arxiv_id":"2406.07594","paper":"/paper/mllmguard-a-multi-dimensional-safety","title":"MLLMGuard: A Multi-dimensional Safety Evaluation Suite for Multimodal Large Language Models","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Carol-gutianle/MLLMGuard","path":"evaluate.py","file_url":"https://github.com/Carol-gutianle/MLLMGuard/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7afcd3a4a3f5077","mcp_get_code":{"code_sha256":"d7afcd3a4a3f5077"}},{"arxiv_id":"2406.07083","paper":"/paper/efficient-mixture-learning-in-black-box","title":"Efficient Mixture Learning in Black-Box Variational Inference","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"okviman/efficient-mixtures","path":"mnist_train.py","file_url":"https://github.com/okviman/efficient-mixtures/blob/HEAD/mnist_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"15cef4b080fc9a0d","mcp_get_code":{"code_sha256":"15cef4b080fc9a0d"}},{"arxiv_id":"2406.03459","paper":"/paper/lw-detr-a-transformer-replacement-to-yolo-for","title":"LW-DETR: A Transformer Replacement to YOLO for Real-Time Detection","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atten4vis/lw-detr","path":"datasets/coco_eval.py","file_url":"https://github.com/atten4vis/lw-detr/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2406.03148","paper":"/paper/aligning-transformers-with-weisfeiler-leman","title":"Aligning Transformers with Weisfeiler-Leman","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luis-mueller/wl-transformers","path":"pre-training/pcqm4m.py","file_url":"https://github.com/luis-mueller/wl-transformers/blob/HEAD/pre-training/pcqm4m.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"da81c8bfa64e6020","mcp_get_code":{"code_sha256":"da81c8bfa64e6020"}},{"arxiv_id":"2405.20067","paper":"/paper/n-dimensional-gaussians-for-fitting-of-high","title":"N-Dimensional Gaussians for Fitting of High Dimensional Functions","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel/ngd-fitting","path":"synthetic/synthetic_preview.py","file_url":"https://github.com/intel/ngd-fitting/blob/HEAD/synthetic/synthetic_preview.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c82cea86fe56982f","mcp_get_code":{"code_sha256":"c82cea86fe56982f"}},{"arxiv_id":"2405.19597","paper":"/paper/svft-parameter-efficient-fine-tuning-with","title":"SVFT: Parameter-Efficient Fine-Tuning with Singular Vectors","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaylingam95/svft","path":"LLM-Adapters/multi_dataset_eval.py","file_url":"https://github.com/vijaylingam95/svft/blob/HEAD/LLM-Adapters/multi_dataset_eval.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":"aa4c428037088270","mcp_get_code":{"code_sha256":"aa4c428037088270"}},{"arxiv_id":"2405.17913","paper":"/paper/ov-dquo-open-vocabulary-detr-with-denoising","title":"OV-DQUO: Open-Vocabulary DETR with Denoising Text Query Training and Open-World Unknown Objects Supervision","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaomoguhz/ov-dquo","path":"datasets/coco_eval.py","file_url":"https://github.com/xiaomoguhz/ov-dquo/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2405.17476","paper":"/paper/how-to-leverage-diverse-demonstrations-in","title":"How to Leverage Diverse Demonstrations in Offline Imitation Learning","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liziniu/ISWBC","path":"mujoco/run_iswbc_full_replay.py","file_url":"https://github.com/liziniu/ISWBC/blob/HEAD/mujoco/run_iswbc_full_replay.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"83e1823efe8292e6","mcp_get_code":{"code_sha256":"83e1823efe8292e6"}},{"arxiv_id":"2405.06418","paper":"/paper/pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdi-lab/ReED","path":"evaluate.py","file_url":"https://github.com/bdi-lab/ReED/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"639f24e7ee72a1f7","mcp_get_code":{"code_sha256":"639f24e7ee72a1f7"}},{"arxiv_id":"2405.06418","paper":"/paper/pac-bayesian-generalization-bounds-for-2","title":"PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdi-lab/ReED","path":"evaluate_txt.py","file_url":"https://github.com/bdi-lab/ReED/blob/HEAD/evaluate_txt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"95cec4b7772c4dfe","mcp_get_code":{"code_sha256":"95cec4b7772c4dfe"}},{"arxiv_id":"2405.03274","paper":"/paper/mace-a-machine-learning-approach-to-chemistry","title":"MACE: A Machine learning Approach to Chemistry Emulation","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"silkemaes/mace","path":"src/mace/integrated.py","file_url":"https://github.com/silkemaes/mace/blob/HEAD/src/mace/integrated.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":"7151d9f9b77d6ff0","mcp_get_code":{"code_sha256":"7151d9f9b77d6ff0"}},{"arxiv_id":"2405.02437","paper":"/paper/fastlloyd-federated-accurate-secure-and","title":"FastLloyd: Federated, Accurate, Secure, and Tunable $k$-Means Clustering with Differential Privacy","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d-diaa/fastlloyd","path":"utils/evaluations.py","file_url":"https://github.com/d-diaa/fastlloyd/blob/HEAD/utils/evaluations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3ce4034a231b69fd","mcp_get_code":{"code_sha256":"3ce4034a231b69fd"}},{"arxiv_id":"2405.02287","paper":"/paper/vibe-eval-a-hard-evaluation-suite-for","title":"Vibe-Eval: A hard evaluation suite for measuring progress of multimodal language models","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reka-ai/reka-vibe-eval","path":"evaluate.py","file_url":"https://github.com/reka-ai/reka-vibe-eval/blob/HEAD/evaluate.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":"330f7dfe33fdca3e","mcp_get_code":{"code_sha256":"330f7dfe33fdca3e"}},{"arxiv_id":"2405.00740","paper":"/paper/modeling-caption-diversity-in-contrastive","title":"Modeling Caption Diversity in Contrastive Vision-Language Pretraining","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/llip","path":"llip/clipeval/eval_zeroshot.py","file_url":"https://github.com/facebookresearch/llip/blob/HEAD/llip/clipeval/eval_zeroshot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"e2c5a40d6b301ed0","mcp_get_code":{"code_sha256":"e2c5a40d6b301ed0"}},{"arxiv_id":"2404.17454","paper":"/paper/domain-adaptive-and-fine-grained-anomaly","title":"Domain Adaptive and Fine-grained Anomaly Detection for Single-cell Sequencing Data and Beyond","date":"2024-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Catchxu/ACsleuth","path":"sleuth/_utils.py","file_url":"https://github.com/Catchxu/ACsleuth/blob/HEAD/sleuth/_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6a55822d3e71797","mcp_get_code":{"code_sha256":"a6a55822d3e71797"}},{"arxiv_id":"2404.16779","paper":"/paper/drs-learning-reusable-dense-rewards-for-multi","title":"DrS: Learning Reusable Dense Rewards for Multi-Stage Tasks","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongzhoumu/DrS","path":"drs/drs_reuse_reward_maniskill2.py","file_url":"https://github.com/tongzhoumu/DrS/blob/HEAD/drs/drs_reuse_reward_maniskill2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"322670cb8fb632dd","mcp_get_code":{"code_sha256":"322670cb8fb632dd"}},{"arxiv_id":"2404.16767","paper":"/paper/rebel-reinforcement-learning-via-regressing","title":"REBEL: Reinforcement Learning via Regressing Relative Rewards","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaolingao/rebel","path":"src/tldr/rm.py","file_url":"https://github.com/zhaolingao/rebel/blob/HEAD/src/tldr/rm.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":"d58b842cdc7fda2b","mcp_get_code":{"code_sha256":"d58b842cdc7fda2b"}},{"arxiv_id":"2404.15004","paper":"/paper/taxi-evaluating-categorical-knowledge-editing","title":"TAXI: Evaluating Categorical Knowledge Editing for Language Models","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"derekpowell/taxi","path":"easyeditor/custom/custom.py","file_url":"https://github.com/derekpowell/taxi/blob/HEAD/easyeditor/custom/custom.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe17455a0444ff9e","mcp_get_code":{"code_sha256":"fe17455a0444ff9e"}},{"arxiv_id":"2404.14215","paper":"/paper/text-tuple-table-towards-information","title":"Text-Tuple-Table: Towards Information Integration in Text-to-Table Generation via Global Tuple Extraction","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/livesum","path":"evaluate.py","file_url":"https://github.com/hkust-knowcomp/livesum/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db5ab71619a96eda","mcp_get_code":{"code_sha256":"db5ab71619a96eda"}},{"arxiv_id":"2404.14183","paper":"/paper/semeval-2024-task-8-multidomain-multimodel","title":"SemEval-2024 Task 8: Multidomain, Multimodel and Multilingual Machine-Generated Text Detection","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/COLING-2025-Workshop-on-MGT-Detection-Task1","path":"scorer.py","file_url":"https://github.com/mbzuai-nlp/COLING-2025-Workshop-on-MGT-Detection-Task1/blob/HEAD/scorer.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":"b30e0a45a52d661f","mcp_get_code":{"code_sha256":"b30e0a45a52d661f"}},{"arxiv_id":"2404.09491","paper":"/paper/large-language-models-can-automatically","title":"Large Language Models Can Automatically Engineer Features for Few-Shot Tabular Learning","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sungwon-Han/FeatLLM","path":"utils.py","file_url":"https://github.com/Sungwon-Han/FeatLLM/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3101ba4997e7d9b5","mcp_get_code":{"code_sha256":"3101ba4997e7d9b5"}},{"arxiv_id":"2404.03543","paper":"/paper/codeeditorbench-evaluating-code-editing","title":"CodeEditorBench: Evaluating Code Editing Capability of Large Language Models","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CodeEditorBench/CodeEditorBench","path":"vllm_inference.py","file_url":"https://github.com/CodeEditorBench/CodeEditorBench/blob/HEAD/vllm_inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"081d7101e7078625","mcp_get_code":{"code_sha256":"081d7101e7078625"}},{"arxiv_id":"2404.02478","paper":"/paper/fedselect-personalized-federated-learning","title":"FedSelect: Personalized Federated Learning with Customized Selection of Parameters for Fine-Tuning","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lapisrocks/fedselect","path":"fedselect.py","file_url":"https://github.com/lapisrocks/fedselect/blob/HEAD/fedselect.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9af578129e5fbde5","mcp_get_code":{"code_sha256":"9af578129e5fbde5"}},{"arxiv_id":"2404.02418","paper":"/paper/auxiliary-task-demands-mask-the-capabilities","title":"Auxiliary task demands mask the capabilities of smaller language models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennhu/lm-task-demands","path":"src/metrics/blimp.py","file_url":"https://github.com/jennhu/lm-task-demands/blob/HEAD/src/metrics/blimp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"54df85a235f3a419","mcp_get_code":{"code_sha256":"54df85a235f3a419"}},{"arxiv_id":"2404.02418","paper":"/paper/auxiliary-task-demands-mask-the-capabilities","title":"Auxiliary task demands mask the capabilities of smaller language models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennhu/lm-task-demands","path":"src/metrics/dgl.py","file_url":"https://github.com/jennhu/lm-task-demands/blob/HEAD/src/metrics/dgl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b372c2e8aeb3cdf2","mcp_get_code":{"code_sha256":"b372c2e8aeb3cdf2"}},{"arxiv_id":"2404.02418","paper":"/paper/auxiliary-task-demands-mask-the-capabilities","title":"Auxiliary task demands mask the capabilities of smaller language models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennhu/lm-task-demands","path":"src/metrics/digit_mat.py","file_url":"https://github.com/jennhu/lm-task-demands/blob/HEAD/src/metrics/digit_mat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"72bbe7d3ff89dea1","mcp_get_code":{"code_sha256":"72bbe7d3ff89dea1"}},{"arxiv_id":"2404.02418","paper":"/paper/auxiliary-task-demands-mask-the-capabilities","title":"Auxiliary task demands mask the capabilities of smaller language models","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jennhu/lm-task-demands","path":"src/metrics/lambada.py","file_url":"https://github.com/jennhu/lm-task-demands/blob/HEAD/src/metrics/lambada.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d0ac95d172d351a","mcp_get_code":{"code_sha256":"7d0ac95d172d351a"}},{"arxiv_id":"2404.02072","paper":"/paper/egtr-extracting-graph-from-transformer-for","title":"EGTR: Extracting Graph from Transformer for Scene Graph Generation","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/egtr","path":"lib/evaluation/coco_eval.py","file_url":"https://github.com/naver-ai/egtr/blob/HEAD/lib/evaluation/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2403.19332","paper":"/paper/learning-a-formally-verified-control-barrier","title":"Learning a Formally Verified Control Barrier Function in Stochastic Environment","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"tayalmanan28/Stochastic-NCBF","path":"deep_differential_network/utils.py","file_url":"https://github.com/tayalmanan28/Stochastic-NCBF/blob/HEAD/deep_differential_network/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7b783c33a94c0873","mcp_get_code":{"code_sha256":"7b783c33a94c0873"}},{"arxiv_id":"2403.18624","paper":"/paper/vulnerability-detection-with-code-language","title":"Vulnerability Detection with Code Language Models: How Far Are We?","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlvuldet/primevul","path":"os_expr/run_ft.py","file_url":"https://github.com/dlvuldet/primevul/blob/HEAD/os_expr/run_ft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5737bb1a8eda93a3","mcp_get_code":{"code_sha256":"5737bb1a8eda93a3"}},{"arxiv_id":"2403.18624","paper":"/paper/vulnerability-detection-with-code-language","title":"Vulnerability Detection with Code Language Models: How Far Are We?","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlvuldet/primevul","path":"os_expr/run_ft_accelerator.py","file_url":"https://github.com/dlvuldet/primevul/blob/HEAD/os_expr/run_ft_accelerator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24722c9f04658f98","mcp_get_code":{"code_sha256":"24722c9f04658f98"}},{"arxiv_id":"2403.18624","paper":"/paper/vulnerability-detection-with-code-language","title":"Vulnerability Detection with Code Language Models: How Far Are We?","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlvuldet/primevul","path":"os_expr/run_ft_clr.py","file_url":"https://github.com/dlvuldet/primevul/blob/HEAD/os_expr/run_ft_clr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ad6ec6651bb9bdf0","mcp_get_code":{"code_sha256":"ad6ec6651bb9bdf0"}},{"arxiv_id":"2403.17259","paper":"/paper/diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntkien1904/dmns","path":"main_cond.py","file_url":"https://github.com/ntkien1904/dmns/blob/HEAD/main_cond.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9fa2bfe219927696","mcp_get_code":{"code_sha256":"9fa2bfe219927696"}},{"arxiv_id":"2403.16831","paper":"/paper/urbanvlp-a-multi-granularity-vision-language","title":"UrbanVLP: Multi-Granularity Vision-Language Pretraining for Urban Socioeconomic Indicator Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stupidbuluchacha/urbanclip","path":"mlp.py","file_url":"https://github.com/stupidbuluchacha/urbanclip/blob/HEAD/mlp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"349f43e5b0e6e7d9","mcp_get_code":{"code_sha256":"349f43e5b0e6e7d9"}},{"arxiv_id":"2403.16831","paper":"/paper/urbanvlp-a-multi-granularity-vision-language","title":"UrbanVLP: Multi-Granularity Vision-Language Pretraining for Urban Socioeconomic Indicator Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"citymind-lab/urbanvlp","path":"models/mlp_urbanvlp.py","file_url":"https://github.com/citymind-lab/urbanvlp/blob/HEAD/models/mlp_urbanvlp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"885eb2a718f63cf4","mcp_get_code":{"code_sha256":"885eb2a718f63cf4"}},{"arxiv_id":"2403.16820","paper":"/paper/cross-lingual-contextualized-phrase-retrieval","title":"Cross-lingual Contextualized Phrase Retrieval","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghrua/ccpr_release","path":"Platypus/inference.py","file_url":"https://github.com/ghrua/ccpr_release/blob/HEAD/Platypus/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3b6550e7e41ca28e","mcp_get_code":{"code_sha256":"3b6550e7e41ca28e"}},{"arxiv_id":"2403.14198","paper":"/paper/unleashing-unlabeled-data-a-paradigm-for","title":"Unleashing Unlabeled Data: A Paradigm for Cross-View Geo-Localization","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liguopeng0923/UCVGL","path":"train_crossview_sat.py","file_url":"https://github.com/liguopeng0923/UCVGL/blob/HEAD/train_crossview_sat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2833c02f736f1042","mcp_get_code":{"code_sha256":"2833c02f736f1042"}},{"arxiv_id":"2403.07954","paper":"/paper/optimizing-polynomial-graph-filters-a-novel","title":"Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/AdaptKry","path":"non-homo/2main.py","file_url":"https://github.com/kkhuang81/AdaptKry/blob/HEAD/non-homo/2main.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fbbb4f78de4235d1","mcp_get_code":{"code_sha256":"fbbb4f78de4235d1"}},{"arxiv_id":"2403.04086","paper":"/paper/automated-multi-task-learning-for-joint","title":"Automated Multi-Task Learning for Joint Disease Prediction on Electronic Health Records","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sh-src/autodp","path":"utils/experiments.py","file_url":"https://github.com/sh-src/autodp/blob/HEAD/utils/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce266ecd2c99da86","mcp_get_code":{"code_sha256":"ce266ecd2c99da86"}},{"arxiv_id":"2403.03536","paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"normal_train.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/normal_train.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b8c6ada77a2cbf8","mcp_get_code":{"code_sha256":"4b8c6ada77a2cbf8"}},{"arxiv_id":"2403.03536","paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"unlearning_e2urec.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/unlearning_e2urec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5a36708dd455d822","mcp_get_code":{"code_sha256":"5a36708dd455d822"}},{"arxiv_id":"2403.03536","paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"evaluate.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ac2ccd71797efc72","mcp_get_code":{"code_sha256":"ac2ccd71797efc72"}},{"arxiv_id":"2403.03536","paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"sisa_evaluate.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/sisa_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"899ecc9dd739e114","mcp_get_code":{"code_sha256":"899ecc9dd739e114"}},{"arxiv_id":"2403.03194","paper":"/paper/magid-an-automated-pipeline-for-generating","title":"MAGID: An Automated Pipeline for Generating Synthetic Multi-modal Datasets","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/MAGID","path":"src/tools.py","file_url":"https://github.com/amazon-science/MAGID/blob/HEAD/src/tools.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":"c382afdeac958e47","mcp_get_code":{"code_sha256":"c382afdeac958e47"}},{"arxiv_id":"2403.03194","paper":"/paper/magid-an-automated-pipeline-for-generating","title":"MAGID: An Automated Pipeline for Generating Synthetic Multi-modal Datasets","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/MAGID","path":"src/multimodal_dataset/tools.py","file_url":"https://github.com/amazon-science/MAGID/blob/HEAD/src/multimodal_dataset/tools.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":"021bd99e595c6897","mcp_get_code":{"code_sha256":"021bd99e595c6897"}},{"arxiv_id":"2403.02683","paper":"/paper/learning-to-defer-to-a-population-a-meta","title":"Learning to Defer to a Population: A Meta-Learning Approach","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvtailor/meta-l2d","path":"train_classifier.py","file_url":"https://github.com/dvtailor/meta-l2d/blob/HEAD/train_classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6770e1b1b3fc9de1","mcp_get_code":{"code_sha256":"6770e1b1b3fc9de1"}},{"arxiv_id":"2403.01942","paper":"/paper/mitigating-label-noise-on-graph-via","title":"Mitigating Label Noise on Graph via Topological Sample Selection","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2024_ICML_TSS","path":"train_eval.py","file_url":"https://github.com/tmllab/2024_ICML_TSS/blob/HEAD/train_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"22af6af53b4c250b","mcp_get_code":{"code_sha256":"22af6af53b4c250b"}},{"arxiv_id":"2403.00252","paper":"/paper/europa-a-legal-multilingual-keyphrase","title":"EUROPA: A Legal Multilingual Keyphrase Generation Dataset","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rali-udem/europa","path":"eval/eval_OpenNMT_KPG.py","file_url":"https://github.com/rali-udem/europa/blob/HEAD/eval/eval_OpenNMT_KPG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ebf6b35a7eb511cb","mcp_get_code":{"code_sha256":"ebf6b35a7eb511cb"}},{"arxiv_id":"2403.00791","paper":"/paper/textit-l-m-24-building-a-dataset-for-language","title":"L+M-24: Building a Dataset for Language + Molecules @ ACL 2024","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"language-plus-molecules/lpm-24-dataset","path":"evaluation/text_translation_metrics.py","file_url":"https://github.com/language-plus-molecules/lpm-24-dataset/blob/HEAD/evaluation/text_translation_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1661dcb7ecdb3b3e","mcp_get_code":{"code_sha256":"1661dcb7ecdb3b3e"}},{"arxiv_id":"2403.00791","paper":"/paper/textit-l-m-24-building-a-dataset-for-language","title":"L+M-24: Building a Dataset for Language + Molecules @ ACL 2024","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"language-plus-molecules/lpm-24-dataset","path":"final_evaluation/captioning/scorer.py","file_url":"https://github.com/language-plus-molecules/lpm-24-dataset/blob/HEAD/final_evaluation/captioning/scorer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a332b9c75c492e25","mcp_get_code":{"code_sha256":"a332b9c75c492e25"}},{"arxiv_id":"2402.18510","paper":"/paper/rnns-are-not-transformers-yet-the-key","title":"RNNs are not Transformers (Yet): The Key Bottleneck on In-context Retrieval","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dangxingyu/rnn-icrag","path":"rnn/val.py","file_url":"https://github.com/dangxingyu/rnn-icrag/blob/HEAD/rnn/val.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd7451e108a22a91","mcp_get_code":{"code_sha256":"fd7451e108a22a91"}},{"arxiv_id":"2402.17699","paper":"/paper/gradient-based-discrete-sampling-with","title":"Gradient-based Discrete Sampling with Automatic Cyclical Scheduling","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"patrickpynadath1/automatic_cyclical_sampling","path":"ais.py","file_url":"https://github.com/patrickpynadath1/automatic_cyclical_sampling/blob/HEAD/ais.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"924730532d5e99f9","mcp_get_code":{"code_sha256":"924730532d5e99f9"}},{"arxiv_id":"2402.17135","paper":"/paper/unsupervised-zero-shot-reinforcement-learning","title":"Unsupervised Zero-Shot Reinforcement Learning via Functional Reward Encodings","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvfrans/fre","path":"common/evaluation.py","file_url":"https://github.com/kvfrans/fre/blob/HEAD/common/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"645ceabf0ab26408","mcp_get_code":{"code_sha256":"645ceabf0ab26408"}},{"arxiv_id":"2402.16914","paper":"/paper/drattack-prompt-decomposition-and","title":"DrAttack: Prompt Decomposition and Reconstruction Makes Powerful LLM Jailbreakers","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xirui-li/drattack","path":"experiments/evaluate_with_GPT.py","file_url":"https://github.com/xirui-li/drattack/blob/HEAD/experiments/evaluate_with_GPT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5f35c29b3798704","mcp_get_code":{"code_sha256":"f5f35c29b3798704"}},{"arxiv_id":"2402.12659","paper":"/paper/the-finben-an-holistic-financial-benchmark","title":"FinBen: A Holistic Financial Benchmark for Large Language Models","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chancefocus/pixiu","path":"src/interface.py","file_url":"https://github.com/chancefocus/pixiu/blob/HEAD/src/interface.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a6e0b41ccbd8a98","mcp_get_code":{"code_sha256":"5a6e0b41ccbd8a98"}},{"arxiv_id":"2402.11845","paper":"/paper/modularized-networks-for-few-shot-hateful","title":"Modularized Networks for Few-shot Hateful Meme Detection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"social-ai-studio/mod_hate","path":"src/interp_gen_eval.py","file_url":"https://github.com/social-ai-studio/mod_hate/blob/HEAD/src/interp_gen_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d4ee8f67012b321","mcp_get_code":{"code_sha256":"5d4ee8f67012b321"}},{"arxiv_id":"2402.11493","paper":"/paper/benchmarking-knowledge-boundary-for-large","title":"Benchmarking Knowledge Boundary for Large Language Models: A Different Perspective on Model Evaluation","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkulcwmzx/knowledge-boundary","path":"utils_eval.py","file_url":"https://github.com/pkulcwmzx/knowledge-boundary/blob/HEAD/utils_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"833ecf7a36f47a2f","mcp_get_code":{"code_sha256":"833ecf7a36f47a2f"}},{"arxiv_id":"2402.09353","paper":"/paper/dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/DoRA","path":"commonsense_reasoning/multi_dataset_eval.py","file_url":"https://github.com/NVlabs/DoRA/blob/HEAD/commonsense_reasoning/multi_dataset_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2dc17f5e6fb39b3f","mcp_get_code":{"code_sha256":"2dc17f5e6fb39b3f"}},{"arxiv_id":"2402.08831","paper":"/paper/ecellm-generalizing-large-language-models-for","title":"eCeLLM: Generalizing Large Language Models for E-commerce from Large-scale, High-quality Instruction Data","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninglab/eCeLLM","path":"inference.py","file_url":"https://github.com/ninglab/eCeLLM/blob/HEAD/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"4462fe58e356cf2b","mcp_get_code":{"code_sha256":"4462fe58e356cf2b"}},{"arxiv_id":"2402.08831","paper":"/paper/ecellm-generalizing-large-language-models-for","title":"eCeLLM: Generalizing Large Language Models for E-commerce from Large-scale, High-quality Instruction Data","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninglab/ecellm","path":"inference_T5.py","file_url":"https://github.com/ninglab/ecellm/blob/HEAD/inference_T5.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"31de0047d6b0e716","mcp_get_code":{"code_sha256":"31de0047d6b0e716"}},{"arxiv_id":"2402.08831","paper":"/paper/ecellm-generalizing-large-language-models-for","title":"eCeLLM: Generalizing Large Language Models for E-commerce from Large-scale, High-quality Instruction Data","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninglab/ecellm","path":"inference_merged.py","file_url":"https://github.com/ninglab/ecellm/blob/HEAD/inference_merged.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"b82b23926785a96d","mcp_get_code":{"code_sha256":"b82b23926785a96d"}},{"arxiv_id":"2402.07502","paper":"/paper/clustertabnet-supervised-clustering-method","title":"ClusterTabNet: Supervised clustering method for table detection and table structure recognition","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sap-samples/clustertabnet","path":"train/coco_eval.py","file_url":"https://github.com/sap-samples/clustertabnet/blob/HEAD/train/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2402.01830","paper":"/paper/peer-review-in-llms-automatic-evaluation","title":"PiCO: Peer Review in LLMs based on the Consistency Optimization","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-YuanGroup/Peer-review-in-LLMs","path":"con_optimization/main_ablation.py","file_url":"https://github.com/PKU-YuanGroup/Peer-review-in-LLMs/blob/HEAD/con_optimization/main_ablation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1e556153d971820f","mcp_get_code":{"code_sha256":"1e556153d971820f"}},{"arxiv_id":"2402.01155","paper":"/paper/cabinet-content-relevance-based-noise","title":"CABINET: Content Relevance based Noise Reduction for Table Question Answering","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sohanpatnaik106/cabinet_qa","path":"TAPEX/tapex/model_eval.py","file_url":"https://github.com/sohanpatnaik106/cabinet_qa/blob/HEAD/TAPEX/tapex/model_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b61c750429c62e5","mcp_get_code":{"code_sha256":"6b61c750429c62e5"}},{"arxiv_id":"2401.14159","paper":"/paper/grounded-sam-assembling-open-world-models-for","title":"Grounded SAM: Assembling Open-World Models for Diverse Visual Tasks","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-research/groundingdino","path":"groundingdino/datasets/cocogrounding_eval.py","file_url":"https://github.com/idea-research/groundingdino/blob/HEAD/groundingdino/datasets/cocogrounding_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2401.12532","paper":"/paper/dafa-distance-aware-fair-adversarial-training","title":"DAFA: Distance-Aware Fair Adversarial Training","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannxu123/fair_robust","path":"utils_frl.py","file_url":"https://github.com/hannxu123/fair_robust/blob/HEAD/utils_frl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4cf5ffbe5a5795e2","mcp_get_code":{"code_sha256":"4cf5ffbe5a5795e2"}},{"arxiv_id":"2401.10700","paper":"/paper/safe-offline-reinforcement-learning-with","title":"Safe Offline Reinforcement Learning with Feasibility-Guided Diffusion Model","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengyinan-air/fisor","path":"jaxrl5/evaluation.py","file_url":"https://github.com/zhengyinan-air/fisor/blob/HEAD/jaxrl5/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e9deb66cfd03bf3c","mcp_get_code":{"code_sha256":"e9deb66cfd03bf3c"}},{"arxiv_id":"2401.10065","paper":"/paper/code-prompting-elicits-conditional-reasoning","title":"Code Prompting Elicits Conditional Reasoning Abilities in Text+Code LLMs","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2024-conditional-reasoning-llms","path":"src/boardgameqa/evaluation.py","file_url":"https://github.com/ukplab/arxiv2024-conditional-reasoning-llms/blob/HEAD/src/boardgameqa/evaluation.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":"43bb95dff6d09d00","mcp_get_code":{"code_sha256":"43bb95dff6d09d00"}},{"arxiv_id":"2401.10065","paper":"/paper/code-prompting-elicits-conditional-reasoning","title":"Code Prompting Elicits Conditional Reasoning Abilities in Text+Code LLMs","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2024-conditional-reasoning-llms","path":"src/conditionalqa/evaluation.py","file_url":"https://github.com/ukplab/arxiv2024-conditional-reasoning-llms/blob/HEAD/src/conditionalqa/evaluation.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":"80ea8ce64f656cc3","mcp_get_code":{"code_sha256":"80ea8ce64f656cc3"}},{"arxiv_id":"2401.03989","paper":"/paper/ms-detr-efficient-detr-training-with-mixed","title":"MS-DETR: Efficient DETR Training with Mixed Supervision","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atten4vis/ms-detr","path":"datasets/coco_eval.py","file_url":"https://github.com/atten4vis/ms-detr/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2312.17118","paper":"/paper/fully-sparse-3d-panoptic-occupancy-prediction","title":"Fully Sparse 3D Occupancy Prediction","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcg-nju/sparsebev","path":"val.py","file_url":"https://github.com/mcg-nju/sparsebev/blob/HEAD/val.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97c6373ac9809717","mcp_get_code":{"code_sha256":"97c6373ac9809717"}},{"arxiv_id":"2312.15661","paper":"/paper/unlocking-the-potential-of-large-language","title":"Unlocking the Potential of Large Language Models for Explainable Recommendations","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"godfire66666/llm_rec_explanation","path":"src/gen_compare_result/gen_compare_test_all.py","file_url":"https://github.com/godfire66666/llm_rec_explanation/blob/HEAD/src/gen_compare_result/gen_compare_test_all.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f0cdc782b1ad28e9","mcp_get_code":{"code_sha256":"f0cdc782b1ad28e9"}},{"arxiv_id":"2312.15614","paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"defect/code/defect.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/defect/code/defect.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"36c97f6df416b811","mcp_get_code":{"code_sha256":"36c97f6df416b811"}},{"arxiv_id":"2312.15614","paper":"/paper/a-comprehensive-evaluation-of-parameter","title":"A Comprehensive Evaluation of Parameter-Efficient Fine-Tuning on Software Engineering Tasks","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwtnju/peft","path":"search/code/search.py","file_url":"https://github.com/zwtnju/peft/blob/HEAD/search/code/search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a057595416cbd19e","mcp_get_code":{"code_sha256":"a057595416cbd19e"}},{"arxiv_id":"2312.11973","paper":"/paper/continual-learning-forget-free-winning","title":"Continual Learning: Forget-free Winning Subnetworks for Video Representations","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihaeyong/pfnr","path":"train_nerv.py","file_url":"https://github.com/ihaeyong/pfnr/blob/HEAD/train_nerv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8684b8a9ca3ef7a","mcp_get_code":{"code_sha256":"d8684b8a9ca3ef7a"}},{"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":"evaluate.py","file_url":"https://github.com/sijieaaa/distilvpr/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"01409f30c9d443df","mcp_get_code":{"code_sha256":"01409f30c9d443df"}},{"arxiv_id":"2312.04772","paper":"/paper/remembering-to-be-fair-on-non-markovian","title":"Remembering to Be Fair: Non-Markovian Fairness in Sequential Decision Making","date":"2023-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"praal/remembering-to-be-fair","path":"ql.py","file_url":"https://github.com/praal/remembering-to-be-fair/blob/HEAD/ql.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ebf0a52271654cb","mcp_get_code":{"code_sha256":"1ebf0a52271654cb"}},{"arxiv_id":"2312.04746","paper":"/paper/quilt-llava-visual-instruction-tuning-by","title":"Quilt-LLaVA: Visual Instruction Tuning by Extracting Localized Narratives from Open-Source Histopathology Videos","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aldraus/quilt-llava","path":"llava/eval/quilt_eval.py","file_url":"https://github.com/aldraus/quilt-llava/blob/HEAD/llava/eval/quilt_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0f12178b8ecbfaf0","mcp_get_code":{"code_sha256":"0f12178b8ecbfaf0"}},{"arxiv_id":"2312.02622","paper":"/paper/on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lspongebobjh/virgo_icml2023","path":"comp1.py","file_url":"https://github.com/lspongebobjh/virgo_icml2023/blob/HEAD/comp1.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":"3391b7a2f0d87a26","mcp_get_code":{"code_sha256":"3391b7a2f0d87a26"}},{"arxiv_id":"2311.15156","paper":"/paper/xtrimogene-an-efficient-and-scalable","title":"xTrimoGene: An Efficient and Scalable Representation Learner for Single-Cell RNA-Seq Data","date":"2023-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/GEARS","path":"gears/inference.py","file_url":"https://github.com/snap-stanford/GEARS/blob/HEAD/gears/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2064dcd76d82f44e","mcp_get_code":{"code_sha256":"2064dcd76d82f44e"}},{"arxiv_id":"2311.09356","paper":"/paper/lepard-a-large-scale-dataset-of-judges-citing","title":"LePaRD: A Large-Scale Dataset of Judges Citing Precedents","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmahari/lepard","path":"src/model/transformer_models.py","file_url":"https://github.com/rmahari/lepard/blob/HEAD/src/model/transformer_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5ab473df7894df29","mcp_get_code":{"code_sha256":"5ab473df7894df29"}},{"arxiv_id":"2311.07222","paper":"/paper/neural-general-circulation-models","title":"Neural General Circulation Models for Weather and Climate","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dinosaur","path":"dinosaur/associated_legendre.py","file_url":"https://github.com/google-research/dinosaur/blob/HEAD/dinosaur/associated_legendre.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":"7466f5a2d81103db","mcp_get_code":{"code_sha256":"7466f5a2d81103db"}},{"arxiv_id":"2311.04879","paper":"/paper/longqlora-efficient-and-effective-method-to","title":"LongQLoRA: Efficient and Effective Method to Extend Context Length of Large Language Models","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"24732fd7312ff4a8","mcp_get_code":{"code_sha256":"24732fd7312ff4a8"}},{"arxiv_id":"2311.04806","paper":"/paper/the-petshop-dataset-finding-causes-of","title":"The PetShop Dataset -- Finding Causes of Performance Issues across Microservices","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/petshop-root-cause-analysis","path":"code/rca_task.py","file_url":"https://github.com/amazon-science/petshop-root-cause-analysis/blob/HEAD/code/rca_task.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":"584c5668c01f4b7c","mcp_get_code":{"code_sha256":"584c5668c01f4b7c"}},{"arxiv_id":"2311.02401","paper":"/paper/barcodebert-transformers-for-biodiversity","title":"BarcodeBERT: Transformers for Biodiversity Analysis","date":"2023-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioscan-ml/barcodebert","path":"barcodebert/pretraining.py","file_url":"https://github.com/bioscan-ml/barcodebert/blob/HEAD/barcodebert/pretraining.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38d6d30dfe22d0ed","mcp_get_code":{"code_sha256":"38d6d30dfe22d0ed"}},{"arxiv_id":"2311.02401","paper":"/paper/barcodebert-transformers-for-biodiversity","title":"BarcodeBERT: Transformers for Biodiversity Analysis","date":"2023-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioscan-ml/BarcodeBERT","path":"barcodebert/evaluation.py","file_url":"https://github.com/bioscan-ml/BarcodeBERT/blob/HEAD/barcodebert/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eba6034b65efb5e6","mcp_get_code":{"code_sha256":"eba6034b65efb5e6"}},{"arxiv_id":"2311.01460","paper":"/paper/implicit-chain-of-thought-reasoning-via","title":"Implicit Chain of Thought Reasoning via Knowledge Distillation","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"da03/implicit_chain_of_thought","path":"src/train_thought_emulator.py","file_url":"https://github.com/da03/implicit_chain_of_thought/blob/HEAD/src/train_thought_emulator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7844ac0a6705ad28","mcp_get_code":{"code_sha256":"7844ac0a6705ad28"}},{"arxiv_id":"2310.17550","paper":null,"title":"arXiv:2310.17550","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"mycal-tucker/human-guided-abstractions","path":"human_guided_abstractions/scripts/finetune.py","file_url":"https://github.com/mycal-tucker/human-guided-abstractions/blob/HEAD/human_guided_abstractions/scripts/finetune.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef71668118061e89","mcp_get_code":{"code_sha256":"ef71668118061e89"}},{"arxiv_id":"2310.15164","paper":"/paper/linc-a-neurosymbolic-approach-for-logical","title":"LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benlipkin/linc","path":"eval/tasks/folio.py","file_url":"https://github.com/benlipkin/linc/blob/HEAD/eval/tasks/folio.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c6af10b5a9445eee","mcp_get_code":{"code_sha256":"c6af10b5a9445eee"}},{"arxiv_id":"2310.14029","paper":"/paper/llm-prop-predicting-physical-and-electronic","title":"LLM-Prop: Predicting Physical And Electronic Properties Of Crystalline Solids From Their Text Descriptions","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vertaix/llm-prop","path":"llmprop_train.py","file_url":"https://github.com/vertaix/llm-prop/blob/HEAD/llmprop_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a230640c03be6fb9","mcp_get_code":{"code_sha256":"a230640c03be6fb9"}},{"arxiv_id":"2310.12490","paper":"/paper/co-2-pt-mitigating-bias-in-pre-trained","title":"Co$^2$PT: Mitigating Bias in Pre-trained Language Models through Counterfactual Contrastive Prompt Tuning","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongxiangjue/co2pt","path":"run_base_bios.py","file_url":"https://github.com/dongxiangjue/co2pt/blob/HEAD/run_base_bios.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":"25a3833a09960a7b","mcp_get_code":{"code_sha256":"25a3833a09960a7b"}},{"arxiv_id":"2310.12457","paper":"/paper/musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haitian-jiang/MuseGNN","path":"batch.py","file_url":"https://github.com/haitian-jiang/MuseGNN/blob/HEAD/batch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1e2ea2b0220b753","mcp_get_code":{"code_sha256":"b1e2ea2b0220b753"}},{"arxiv_id":"2310.10362","paper":"/paper/prompt-tuning-for-multi-view-graph","title":"Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gongchenghua/self-pro","path":"Self-Pro/hete/ds.py","file_url":"https://github.com/gongchenghua/self-pro/blob/HEAD/Self-Pro/hete/ds.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"320e1e2142cea229","mcp_get_code":{"code_sha256":"320e1e2142cea229"}},{"arxiv_id":"2310.09754","paper":"/paper/ex-fever-a-dataset-for-multi-hop-explainable","title":"EX-FEVER: A Dataset for Multi-hop Explainable Fact Verification","date":"2023-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dependentsign/EX-FEVER","path":"run_hover.py","file_url":"https://github.com/dependentsign/EX-FEVER/blob/HEAD/run_hover.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5f9ef2c4173521ed","mcp_get_code":{"code_sha256":"5f9ef2c4173521ed"}},{"arxiv_id":"2310.09336","paper":"/paper/compositional-abilities-emerge","title":"Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Task","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phys-ai/concept_graphs","path":"linear_classifier_3classes.py","file_url":"https://github.com/phys-ai/concept_graphs/blob/HEAD/linear_classifier_3classes.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"56a29e961fdb940c","mcp_get_code":{"code_sha256":"56a29e961fdb940c"}},{"arxiv_id":"2310.05620","paper":"/paper/laiw-a-chinese-legal-large-language-models","title":"LAiW: A Chinese Legal Large Language Models Benchmark","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dai-shen/laiw","path":"src/interface.py","file_url":"https://github.com/dai-shen/laiw/blob/HEAD/src/interface.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a6e0b41ccbd8a98","mcp_get_code":{"code_sha256":"5a6e0b41ccbd8a98"}},{"arxiv_id":"2310.00451","paper":"/paper/on-the-role-of-neural-collapse-in-meta","title":"On the Role of Neural Collapse in Meta Learning Models for Few-shot Learning","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saakethmm/nc-prototypical-networks","path":"protonets/utils/model.py","file_url":"https://github.com/saakethmm/nc-prototypical-networks/blob/HEAD/protonets/utils/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6737d2c557fcf23d","mcp_get_code":{"code_sha256":"6737d2c557fcf23d"}},{"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/grande","path":"GRANDE/GRANDE.py","file_url":"https://github.com/s-marton/grande/blob/HEAD/GRANDE/GRANDE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e82568961456e67f","mcp_get_code":{"code_sha256":"e82568961456e67f"}},{"arxiv_id":"2309.08825","paper":"/paper/distributionally-robust-post-hoc-classifiers","title":"Distributionally Robust Post-hoc Classifiers under Prior Shifts","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijiaheng/Drops","path":"utils.py","file_url":"https://github.com/weijiaheng/Drops/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e19d0c3f75393ec1","mcp_get_code":{"code_sha256":"e19d0c3f75393ec1"}},{"arxiv_id":"2309.07875","paper":"/paper/safety-tuned-llamas-lessons-from-improving","title":"Safety-Tuned LLaMAs: Lessons From Improving the Safety of Large Language Models that Follow Instructions","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinid/instruction-llms-safety-eval","path":"generation/generate_answers.py","file_url":"https://github.com/vinid/instruction-llms-safety-eval/blob/HEAD/generation/generate_answers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f775a3ad942ea848","mcp_get_code":{"code_sha256":"f775a3ad942ea848"}},{"arxiv_id":"2308.16475","paper":"/paper/transformer-compression-via-subspace","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyx1999/sp3","path":"bert/pipeline/glue/perf_entry.py","file_url":"https://github.com/hyx1999/sp3/blob/HEAD/bert/pipeline/glue/perf_entry.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2cab98f6275ec5b6","mcp_get_code":{"code_sha256":"2cab98f6275ec5b6"}},{"arxiv_id":"2308.11462","paper":"/paper/legalbench-a-collaboratively-built-benchmark-1","title":"LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Models","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/legalbench","path":"evaluation.py","file_url":"https://github.com/hazyresearch/legalbench/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7e97e39108975e4f","mcp_get_code":{"code_sha256":"7e97e39108975e4f"}},{"arxiv_id":"2308.10278","paper":"/paper/characterchat-learning-towards-conversational","title":"CharacterChat: Learning towards Conversational AI with Personalized Social Support","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"morecry/characterchat","path":"model/BERT/train_persona_score.py","file_url":"https://github.com/morecry/characterchat/blob/HEAD/model/BERT/train_persona_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"792ea15d0ed52b15","mcp_get_code":{"code_sha256":"792ea15d0ed52b15"}},{"arxiv_id":"2308.10174","paper":"/paper/neural-interactive-keypoint-detection","title":"Neural Interactive Keypoint Detection","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-research/click-pose","path":"datasets/coco_eval.py","file_url":"https://github.com/idea-research/click-pose/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2308.09583","paper":"/paper/wizardmath-empowering-mathematical-reasoning","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpxucan/WizardLM","path":"WizardLM/src/inference_wizardlm.py","file_url":"https://github.com/nlpxucan/WizardLM/blob/HEAD/WizardLM/src/inference_wizardlm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8f1e18f0c59b59be","mcp_get_code":{"code_sha256":"8f1e18f0c59b59be"}},{"arxiv_id":"2308.09583","paper":"/paper/wizardmath-empowering-mathematical-reasoning","title":"WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpxucan/WizardLM","path":"WizardCoder/src/inference_wizardcoder.py","file_url":"https://github.com/nlpxucan/WizardLM/blob/HEAD/WizardCoder/src/inference_wizardcoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e03723b85938f4f0","mcp_get_code":{"code_sha256":"e03723b85938f4f0"}},{"arxiv_id":"2308.09000","paper":"/paper/dealmvc-dual-contrastive-calibration-for","title":"DealMVC: Dual Contrastive Calibration for Multi-view Clustering","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xihongyang1999/dealmvc","path":"metric.py","file_url":"https://github.com/xihongyang1999/dealmvc/blob/HEAD/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"141e6f3460ee3670","mcp_get_code":{"code_sha256":"141e6f3460ee3670"}},{"arxiv_id":"2308.07317","paper":"/paper/platypus-quick-cheap-and-powerful-refinement","title":"Platypus: Quick, Cheap, and Powerful Refinement of LLMs","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arielnlee/Platypus","path":"inference.py","file_url":"https://github.com/arielnlee/Platypus/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"240b56d95762b81d","mcp_get_code":{"code_sha256":"240b56d95762b81d"}},{"arxiv_id":"2308.03723","paper":"/paper/dimensionality-reduction-for-improving-out-of","title":"Dimensionality Reduction for Improving Out-of-Distribution Detection in Medical Image Segmentation","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mckellwoodland/dimen_reduce_mahal","path":"OOD/utils.py","file_url":"https://github.com/mckellwoodland/dimen_reduce_mahal/blob/HEAD/OOD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66c0b787946bfcf5","mcp_get_code":{"code_sha256":"66c0b787946bfcf5"}},{"arxiv_id":"2307.16177","paper":"/paper/fusing-vhr-post-disaster-aerial-imagery-and","title":"Fusing VHR Post-disaster Aerial Imagery and LiDAR Data for Roof Classification in the Caribbean","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GFDRR/caribbean-rooftop-classification","path":"utils/eval_utils.py","file_url":"https://github.com/GFDRR/caribbean-rooftop-classification/blob/HEAD/utils/eval_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"731b87be9248e809","mcp_get_code":{"code_sha256":"731b87be9248e809"}},{"arxiv_id":"2307.11341","paper":"/paper/opengda-graph-domain-adaptation-benchmark-for","title":"OpenGDA: Graph Domain Adaptation Benchmark for Cross-network Learning","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skyorca/opengda","path":"model/GRADE/start_gc.py","file_url":"https://github.com/skyorca/opengda/blob/HEAD/model/GRADE/start_gc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c322585b0cfbe18b","mcp_get_code":{"code_sha256":"c322585b0cfbe18b"}},{"arxiv_id":"2307.09423","paper":"/paper/scaling-laws-for-imitation-learning-in","title":"Scaling Laws for Imitation Learning in Single-Agent Games","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/il-scaling-in-games","path":"il_scale/atari/eval_return.py","file_url":"https://github.com/princeton-nlp/il-scaling-in-games/blob/HEAD/il_scale/atari/eval_return.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"597f29032b27dac0","mcp_get_code":{"code_sha256":"597f29032b27dac0"}},{"arxiv_id":"2306.16248","paper":"/paper/latent-sdes-on-homogeneous-spaces-1","title":"Latent SDEs on Homogeneous Spaces","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plus-rkwitt/latentsdeonhs","path":"activity_classification.py","file_url":"https://github.com/plus-rkwitt/latentsdeonhs/blob/HEAD/activity_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a0b5a9a4be5b403e","mcp_get_code":{"code_sha256":"a0b5a9a4be5b403e"}},{"arxiv_id":"2306.16248","paper":"/paper/latent-sdes-on-homogeneous-spaces-1","title":"Latent SDEs on Homogeneous Spaces","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plus-rkwitt/latentsdeonhs","path":"pendulum_regression.py","file_url":"https://github.com/plus-rkwitt/latentsdeonhs/blob/HEAD/pendulum_regression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"419c28179ba1d796","mcp_get_code":{"code_sha256":"419c28179ba1d796"}},{"arxiv_id":"2306.16248","paper":"/paper/latent-sdes-on-homogeneous-spaces-1","title":"Latent SDEs on Homogeneous Spaces","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plus-rkwitt/latentsdeonhs","path":"rotating_mnist.py","file_url":"https://github.com/plus-rkwitt/latentsdeonhs/blob/HEAD/rotating_mnist.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e31148ff0fa79c2a","mcp_get_code":{"code_sha256":"e31148ff0fa79c2a"}},{"arxiv_id":"2306.15595","paper":"/paper/extending-context-window-of-large-language","title":"Extending Context Window of Large Language Models via Positional Interpolation","date":"2023-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangjianxin1/longqlora","path":"script/evaluate/evaluate.py","file_url":"https://github.com/yangjianxin1/longqlora/blob/HEAD/script/evaluate/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24732fd7312ff4a8","mcp_get_code":{"code_sha256":"24732fd7312ff4a8"}},{"arxiv_id":"2306.15543","paper":"/paper/semi-bandit-dynamics-in-congestion-games","title":"Semi Bandit Dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":"archive","repo":"lviano/sbgd-ce","path":"graph.py","file_url":"https://github.com/lviano/sbgd-ce/blob/HEAD/graph.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"823490d514362782","mcp_get_code":{"code_sha256":"823490d514362782"}},{"arxiv_id":"2306.14610","paper":"/paper/sugarcrepe-fixing-hackable-benchmarks-for-1","title":"SugarCrepe: Fixing Hackable Benchmarks for Vision-Language Compositionality","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raivnlab/sugar-crepe","path":"text_model_eval.py","file_url":"https://github.com/raivnlab/sugar-crepe/blob/HEAD/text_model_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75c6d3daf110d116","mcp_get_code":{"code_sha256":"75c6d3daf110d116"}},{"arxiv_id":"2306.14610","paper":"/paper/sugarcrepe-fixing-hackable-benchmarks-for-1","title":"SugarCrepe: Fixing Hackable Benchmarks for Vision-Language Compositionality","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raivnlab/sugar-crepe","path":"main_eval.py","file_url":"https://github.com/raivnlab/sugar-crepe/blob/HEAD/main_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"60a5ab2704caa825","mcp_get_code":{"code_sha256":"60a5ab2704caa825"}},{"arxiv_id":"2306.12941","paper":"/paper/robust-semantic-segmentation-strong","title":"Towards Reliable Evaluation and Fast Training of Robust Semantic Segmentation Models","date":"2023-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmndeep/robust-segmentation","path":"tools/infer.py","file_url":"https://github.com/nmndeep/robust-segmentation/blob/HEAD/tools/infer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69576f9a9c57ce46","mcp_get_code":{"code_sha256":"69576f9a9c57ce46"}},{"arxiv_id":"2306.10759","paper":"/paper/simplifying-and-empowering-transformers-for-1","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/SGFormer","path":"100M/nb-sample.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/100M/nb-sample.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f1e99a101ce9610","mcp_get_code":{"code_sha256":"2f1e99a101ce9610"}},{"arxiv_id":"2306.07608","paper":"/paper/finding-the-missing-half-graph-complementary","title":"Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyzisastudyreallyhardguy/goal-graph-complementary-learning","path":"GOAL_main/goal_conv.py","file_url":"https://github.com/zyzisastudyreallyhardguy/goal-graph-complementary-learning/blob/HEAD/GOAL_main/goal_conv.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":"d47560e57f2bf6db","mcp_get_code":{"code_sha256":"d47560e57f2bf6db"}},{"arxiv_id":"2306.05628","paper":"/paper/quantifying-the-knowledge-in-gnns-for","title":"Quantifying the Knowledge in GNNs for Reliable Distillation into MLPs","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/rkd","path":"src/train_and_eval.py","file_url":"https://github.com/lirongwu/rkd/blob/HEAD/src/train_and_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1901d498eb16daad","mcp_get_code":{"code_sha256":"1901d498eb16daad"}},{"arxiv_id":"2306.05175","paper":"/paper/large-scale-dataset-pruning-with-dynamic","title":"Large-scale Dataset Pruning with Dynamic Uncertainty","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prasangadhungel/Data-Pruning-with-Extrapolated-Scores","path":"src/extrapolate/gnn_extrapolate.py","file_url":"https://github.com/prasangadhungel/Data-Pruning-with-Extrapolated-Scores/blob/HEAD/src/extrapolate/gnn_extrapolate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cea7a9f36bb84d97","mcp_get_code":{"code_sha256":"cea7a9f36bb84d97"}},{"arxiv_id":"2306.04116","paper":"/paper/unbalanced-optimal-transport-for-unbalanced","title":"Unbalanced Optimal Transport for Unbalanced Word Alignment","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukiar/OTAlign","path":"src/unsupervised_alignment.py","file_url":"https://github.com/yukiar/OTAlign/blob/HEAD/src/unsupervised_alignment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75743674e5649573","mcp_get_code":{"code_sha256":"75743674e5649573"}},{"arxiv_id":"2306.02224","paper":"/paper/auto-gpt-for-online-decision-making","title":"Auto-GPT for Online Decision Making: Benchmarks and Additional Opinions","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"younghuman/llmagent","path":"webshop/baseline_models/train_rl.py","file_url":"https://github.com/younghuman/llmagent/blob/HEAD/webshop/baseline_models/train_rl.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":"a056cea109da9605","mcp_get_code":{"code_sha256":"a056cea109da9605"}},{"arxiv_id":"2306.00323","paper":"/paper/thought-cloning-learning-to-think-while-1","title":"Thought Cloning: Learning to Think while Acting by Imitating Human Thinking","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShengranHu/Thought-Cloning","path":"babyai/evaluate.py","file_url":"https://github.com/ShengranHu/Thought-Cloning/blob/HEAD/babyai/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ddbfe9ab59cd4a4","mcp_get_code":{"code_sha256":"5ddbfe9ab59cd4a4"}},{"arxiv_id":"2305.19534","paper":"/paper/recasting-self-attention-with-holographic","title":"Recasting Self-Attention with Holographic Reduced Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuromorphiccomputationresearchprogram/hrrformer","path":"image/hrrformer_mgpu.py","file_url":"https://github.com/neuromorphiccomputationresearchprogram/hrrformer/blob/HEAD/image/hrrformer_mgpu.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":"f0b8db0a03177b1a","mcp_get_code":{"code_sha256":"f0b8db0a03177b1a"}},{"arxiv_id":"2305.18279","paper":"/paper/contextual-object-detection-with-multimodal","title":"Contextual Object Detection with Multimodal Large Language Models","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuhangzang/contextdet","path":"evaluation/Eval/coco_eval.py","file_url":"https://github.com/yuhangzang/contextdet/blob/HEAD/evaluation/Eval/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2305.17626","paper":"/paper/in-context-analogical-reasoning-with-pre","title":"In-Context Analogical Reasoning with Pre-Trained Language Models","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hxiaoyang/lm-raven","path":"evaluation.py","file_url":"https://github.com/hxiaoyang/lm-raven/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8c7dd9a3bb2f9b0f","mcp_get_code":{"code_sha256":"8c7dd9a3bb2f9b0f"}},{"arxiv_id":"2305.17506","paper":"/paper/backdooring-neural-code-search","title":"Backdooring Neural Code Search","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wssun/BADCODE","path":"src/CodeT5/run_search.py","file_url":"https://github.com/wssun/BADCODE/blob/HEAD/src/CodeT5/run_search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"35b5e5a753270a1e","mcp_get_code":{"code_sha256":"35b5e5a753270a1e"}},{"arxiv_id":"2305.16615","paper":"/paper/aibughunter-a-practical-tool-for-predicting","title":"AIBugHunter: A Practical Tool for Predicting, Classifying and Repairing Software Vulnerabilities","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":"archive","repo":"awsm-research/aibughunter","path":"rq3_cvss_score_reg/bert/bert_base_main.py","file_url":"https://github.com/awsm-research/aibughunter/blob/HEAD/rq3_cvss_score_reg/bert/bert_base_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3131dc6682c16cc0","mcp_get_code":{"code_sha256":"3131dc6682c16cc0"}},{"arxiv_id":"2305.16615","paper":"/paper/aibughunter-a-practical-tool-for-predicting","title":"AIBugHunter: A Practical Tool for Predicting, Classifying and Repairing Software Vulnerabilities","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":"archive","repo":"awsm-research/aibughunter","path":"rq1_cwe_id_cls/bert_base/bert_base_main.py","file_url":"https://github.com/awsm-research/aibughunter/blob/HEAD/rq1_cwe_id_cls/bert_base/bert_base_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77ddbc18c8883859","mcp_get_code":{"code_sha256":"77ddbc18c8883859"}},{"arxiv_id":"2305.15215","paper":"/paper/shadow-cones-unveiling-partial-orders-in","title":"Shadow Cones: A Generalized Framework for Partial Order Embeddings","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ydtydr/shadowcones","path":"train_hogwild_lazy.py","file_url":"https://github.com/ydtydr/shadowcones/blob/HEAD/train_hogwild_lazy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f885c10bfb4eebf","mcp_get_code":{"code_sha256":"3f885c10bfb4eebf"}},{"arxiv_id":"2305.13084","paper":"/paper/a-fractional-graph-laplacian-approach-to-1","title":"A Fractional Graph Laplacian Approach to Oversmoothing","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpaolino/flode","path":"node_classification.py","file_url":"https://github.com/rpaolino/flode/blob/HEAD/node_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"107864f8b3450e37","mcp_get_code":{"code_sha256":"107864f8b3450e37"}},{"arxiv_id":"2305.10758","paper":"/paper/extracting-low-high-frequency-knowledge-from","title":"Extracting Low-/High- Frequency Knowledge from Graph Neural Networks and Injecting it into MLPs: An Effective GNN-to-MLP Distillation Framework","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/ff-g2m","path":"src/train_and_eval.py","file_url":"https://github.com/lirongwu/ff-g2m/blob/HEAD/src/train_and_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75f260b69a684ed5","mcp_get_code":{"code_sha256":"75f260b69a684ed5"}},{"arxiv_id":"2305.10355","paper":"/paper/evaluating-object-hallucination-in-large","title":"Evaluating Object Hallucination in Large Vision-Language Models","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yellow-binary-tree/pfram","path":"POPE/evaluate.py","file_url":"https://github.com/yellow-binary-tree/pfram/blob/HEAD/POPE/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee83049b41f8c7d","mcp_get_code":{"code_sha256":"dee83049b41f8c7d"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/flow.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/flow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"daa7ab27ed6a2874","mcp_get_code":{"code_sha256":"daa7ab27ed6a2874"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/gnn.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/gnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c51f0221b1060a1","mcp_get_code":{"code_sha256":"4c51f0221b1060a1"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/matching.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/matching.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e3ef6dfd5527c2c2","mcp_get_code":{"code_sha256":"e3ef6dfd5527c2c2"}},{"arxiv_id":"2305.10037","paper":"/paper/can-language-models-solve-graph-problems-in","title":"Can Language Models Solve Graph Problems in Natural Language?","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arthur-Heng/NLGraph","path":"evaluation/shortest_path.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/shortest_path.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87574d66dd58d6c4","mcp_get_code":{"code_sha256":"87574d66dd58d6c4"}},{"arxiv_id":"2305.09137","paper":"/paper/pre-training-to-learn-in-context","title":"Pre-Training to Learn in Context","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/picl","path":"retriever.py","file_url":"https://github.com/thu-coai/picl/blob/HEAD/retriever.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"544c348e808ef820","mcp_get_code":{"code_sha256":"544c348e808ef820"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f6edd20b524ee65","mcp_get_code":{"code_sha256":"2f6edd20b524ee65"}},{"arxiv_id":"2305.05368","paper":"/paper/gnns-you-can-be-stronger-deeper-and-faster","title":"Deep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module","date":"2023-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingbo02/psnr-gnn","path":"psnrgnn/utils.py","file_url":"https://github.com/jingbo02/psnr-gnn/blob/HEAD/psnrgnn/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9578c9a2fccba133","mcp_get_code":{"code_sha256":"9578c9a2fccba133"}},{"arxiv_id":"2305.03807","paper":"/paper/evading-watermark-based-detection-of-ai","title":"Evading Watermark based Detection of AI-Generated Content","date":"2023-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengyuan-jiang/WEvade","path":"main_WEvade_B_Q.py","file_url":"https://github.com/zhengyuan-jiang/WEvade/blob/HEAD/main_WEvade_B_Q.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"53aa51dab0db5bce","mcp_get_code":{"code_sha256":"53aa51dab0db5bce"}},{"arxiv_id":"2305.00303","paper":"/paper/a-coupled-flow-approach-to-imitation-learning","title":"A Coupled Flow Approach to Imitation Learning","date":"2023-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamenbliznashki/normalizing_flows","path":"maf.py","file_url":"https://github.com/kamenbliznashki/normalizing_flows/blob/HEAD/maf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ded486bf24035d1","mcp_get_code":{"code_sha256":"4ded486bf24035d1"}},{"arxiv_id":"2305.00303","paper":"/paper/a-coupled-flow-approach-to-imitation-learning","title":"A Coupled Flow Approach to Imitation Learning","date":"2023-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamenbliznashki/normalizing_flows","path":"glow.py","file_url":"https://github.com/kamenbliznashki/normalizing_flows/blob/HEAD/glow.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e85f2bdae1682196","mcp_get_code":{"code_sha256":"e85f2bdae1682196"}},{"arxiv_id":"2304.14317","paper":"/paper/large-language-models-are-state-of-the-art-1","title":"ICE-Score: Instructing Large Language Models to Evaluate Code","date":"2023-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terryyz/llm-code-eval","path":"llm_code_eval/evaluator.py","file_url":"https://github.com/terryyz/llm-code-eval/blob/HEAD/llm_code_eval/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e81b4154ee3d021","mcp_get_code":{"code_sha256":"1e81b4154ee3d021"}},{"arxiv_id":"2304.10466","paper":"/paper/efficient-deep-reinforcement-learning","title":"Efficient Deep Reinforcement Learning Requires Regulating Overfitting","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evgenii-nikishin/rl_with_resets","path":"continuous_control/evaluation.py","file_url":"https://github.com/evgenii-nikishin/rl_with_resets/blob/HEAD/continuous_control/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a34f6a7ad7ae7710","mcp_get_code":{"code_sha256":"a34f6a7ad7ae7710"}},{"arxiv_id":"2304.10466","paper":"/paper/efficient-deep-reinforcement-learning","title":"Efficient Deep Reinforcement Learning Requires Regulating Overfitting","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/walk_in_the_park","path":"rl/evaluation.py","file_url":"https://github.com/ikostrikov/walk_in_the_park/blob/HEAD/rl/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fed35e39e159f251","mcp_get_code":{"code_sha256":"fed35e39e159f251"}},{"arxiv_id":"2304.10440","paper":"/paper/openlane-v2-a-topology-reasoning-benchmark-1","title":"OpenLane-V2: A Topology Reasoning Benchmark for Unified 3D HD Mapping","date":"2023-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenDriveLab/OpenLane-V2","path":"openlanev2/centerline/evaluation/evaluate.py","file_url":"https://github.com/OpenDriveLab/OpenLane-V2/blob/HEAD/openlanev2/centerline/evaluation/evaluate.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":"638bbc8622b34274","mcp_get_code":{"code_sha256":"638bbc8622b34274"}},{"arxiv_id":"2304.09048","paper":"/paper/codekgc-code-language-model-for-generative","title":"CodeKGC: Code Language Model for Generative Knowledge Graph Construction","date":"2023-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/DeepKE","path":"src/deepke/triple_extraction/PRGC/evaluate.py","file_url":"https://github.com/zjunlp/DeepKE/blob/HEAD/src/deepke/triple_extraction/PRGC/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b0a68af7010382a","mcp_get_code":{"code_sha256":"7b0a68af7010382a"}},{"arxiv_id":"2304.03728","paper":"/paper/interpretable-unified-language-checking","title":"Interpretable Unified Language Checking","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luohongyin/unilc","path":"analysis.py","file_url":"https://github.com/luohongyin/unilc/blob/HEAD/analysis.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"325eaa5afe81ed34","mcp_get_code":{"code_sha256":"325eaa5afe81ed34"}},{"arxiv_id":"2304.02330","paper":"/paper/smpconv-self-moving-point-representations-for","title":"SMPConv: Self-moving Point Representations for Continuous Convolution","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangnekim/SMPConv","path":"smp_imagenet/engine.py","file_url":"https://github.com/sangnekim/SMPConv/blob/HEAD/smp_imagenet/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6fcb986ae6d99a7d","mcp_get_code":{"code_sha256":"6fcb986ae6d99a7d"}},{"arxiv_id":"2303.11906","paper":"/paper/solving-oscillation-problem-in-post-training","title":"Solving Oscillation Problem in Post-Training Quantization Through a Theoretical Perspective","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/mrecg","path":"utils/evaluate.py","file_url":"https://github.com/bytedance/mrecg/blob/HEAD/utils/evaluate.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":"088c8a23c164541f","mcp_get_code":{"code_sha256":"088c8a23c164541f"}},{"arxiv_id":"2303.09778","paper":"/paper/se-gsl-a-general-and-effective-graph","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/se-gsl","path":"src/appnp_main.py","file_url":"https://github.com/ringbdstack/se-gsl/blob/HEAD/src/appnp_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6bada284911d7c00","mcp_get_code":{"code_sha256":"6bada284911d7c00"}},{"arxiv_id":"2303.09165","paper":"/paper/a-new-benchmark-on-the-utility-of-synthetic","title":"A New Benchmark: On the Utility of Synthetic Data with Blender for Bare Supervised Learning and Downstream Domain Adaptation","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huitangtang/on_the_utility_of_synthetic_data","path":"domain_adaptation/DisClusterDA/trainer.py","file_url":"https://github.com/huitangtang/on_the_utility_of_synthetic_data/blob/HEAD/domain_adaptation/DisClusterDA/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"662f238409af534f","mcp_get_code":{"code_sha256":"662f238409af534f"}},{"arxiv_id":"2303.09093","paper":"/paper/glen-general-purpose-event-detection-for","title":"GLEN: General-Purpose Event Detection for Thousands of Types","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZQS1943/GLEN","path":"model/predict_type_classifier.py","file_url":"https://github.com/ZQS1943/GLEN/blob/HEAD/model/predict_type_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1211212d3a27669","mcp_get_code":{"code_sha256":"e1211212d3a27669"}},{"arxiv_id":"2303.05470","paper":"/paper/spawrious-a-benchmark-for-fine-control-of","title":"Spawrious: A Benchmark for Fine Control of Spurious Correlation Biases","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aengusl/spawrious","path":"example.py","file_url":"https://github.com/aengusl/spawrious/blob/HEAD/example.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":"3219784454724dde","mcp_get_code":{"code_sha256":"3219784454724dde"}},{"arxiv_id":"2303.05148","paper":"/paper/weakly-supervised-knowledge-transfer-with","title":"Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"molden/ProbKT","path":"robust_detection/engine.py","file_url":"https://github.com/molden/ProbKT/blob/HEAD/robust_detection/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd1489fc7bc435dd","mcp_get_code":{"code_sha256":"cd1489fc7bc435dd"}},{"arxiv_id":"2303.01932","paper":"/paper/mobilebrick-building-lego-for-3d","title":"MobileBrick: Building LEGO for 3D Reconstruction on Mobile Devices","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/MobileBrick","path":"evaluations/evaluate_3d.py","file_url":"https://github.com/ActiveVisionLab/MobileBrick/blob/HEAD/evaluations/evaluate_3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b033dc7f87386a5","mcp_get_code":{"code_sha256":"0b033dc7f87386a5"}},{"arxiv_id":"2303.00957","paper":"/paper/preference-transformer-modeling-human","title":"Preference Transformer: Modeling Human Preferences using Transformers for RL","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmile-1006/preferencetransformer","path":"evaluation.py","file_url":"https://github.com/csmile-1006/preferencetransformer/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"46f37a79cc320105","mcp_get_code":{"code_sha256":"46f37a79cc320105"}},{"arxiv_id":"2302.11984","paper":"/paper/unsupervised-domain-adaptation-via-distilled","title":"Unsupervised Domain Adaptation via Distilled Discriminative Clustering","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huitangtang/disclusterda","path":"trainer.py","file_url":"https://github.com/huitangtang/disclusterda/blob/HEAD/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"410030cf052c79b8","mcp_get_code":{"code_sha256":"410030cf052c79b8"}},{"arxiv_id":"2302.08635","paper":"/paper/generative-causal-representation-learning-for","title":"Generative Causal Representation Learning for Out-of-Distribution Motion Forecasting","date":"2023-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sshirahmad/GCRL","path":"evaluate_model.py","file_url":"https://github.com/sshirahmad/GCRL/blob/HEAD/evaluate_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db7aa558200112ab","mcp_get_code":{"code_sha256":"db7aa558200112ab"}},{"arxiv_id":"2302.05783","paper":"/paper/concernet-a-contrastive-learning-based","title":"ConCerNet: A Contrastive Learning Based Framework for Automated Conservation Law Discovery and Trustworthy Dynamical System Prediction","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wz16/concernet","path":"simple_projection_layer_demo.py","file_url":"https://github.com/wz16/concernet/blob/HEAD/simple_projection_layer_demo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0610fd33a23e90cc","mcp_get_code":{"code_sha256":"0610fd33a23e90cc"}},{"arxiv_id":"2302.04246","paper":"/paper/shortcut-detection-with-variational","title":"Shortcut Detection with Variational Autoencoders","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fraunhofer-aisec/shortcut-detection-vae","path":"scripts/train_vae.py","file_url":"https://github.com/fraunhofer-aisec/shortcut-detection-vae/blob/HEAD/scripts/train_vae.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":"a9867ecc032baa97","mcp_get_code":{"code_sha256":"a9867ecc032baa97"}},{"arxiv_id":"2302.02962","paper":"/paper/loft-enhancing-faithfulness-and-diversity-for","title":"LoFT: Enhancing Faithfulness and Diversity for Table-to-Text Generation via Logic Form Control","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-lily/loft","path":"LoFT_framework/tapex/model_eval.py","file_url":"https://github.com/yale-lily/loft/blob/HEAD/LoFT_framework/tapex/model_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b98d89684c0bb11","mcp_get_code":{"code_sha256":"1b98d89684c0bb11"}},{"arxiv_id":"2301.12842","paper":"/paper/direct-preference-based-policy-optimization-1","title":"Direct Preference-based Policy Optimization without Reward Modeling","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/DPPO","path":"evaluation.py","file_url":"https://github.com/snu-mllab/DPPO/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"566d9b710e08c1ee","mcp_get_code":{"code_sha256":"566d9b710e08c1ee"}},{"arxiv_id":"2301.12780","paper":"/paper/equivariant-architectures-for-learning-in","title":"Equivariant Architectures for Learning in Deep Weight Spaces","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avivnavon/dwsnets","path":"experiments/mnist/trainer.py","file_url":"https://github.com/avivnavon/dwsnets/blob/HEAD/experiments/mnist/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4d48f663c05399f4","mcp_get_code":{"code_sha256":"4d48f663c05399f4"}},{"arxiv_id":"2301.10814","paper":"/paper/unsupervised-protein-ligand-binding-energy","title":"Unsupervised Protein-Ligand Binding Energy Prediction via Neural Euler's Rotation Equation","date":"2023-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wengong-jin/dsmbind","path":"bindenergy/apps/antibody/cross_val.py","file_url":"https://github.com/wengong-jin/dsmbind/blob/HEAD/bindenergy/apps/antibody/cross_val.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c55feb4216be4f0d","mcp_get_code":{"code_sha256":"c55feb4216be4f0d"}},{"arxiv_id":"2301.03831","paper":"/paper/dynamic-grained-encoder-for-vision-1","title":"Dynamic Grained Encoder for Vision Transformers","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevengrove/vtpack","path":"vtpack/engine/engine.py","file_url":"https://github.com/stevengrove/vtpack/blob/HEAD/vtpack/engine/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"2a5305120e29e949","mcp_get_code":{"code_sha256":"2a5305120e29e949"}},{"arxiv_id":"2212.10375","paper":"/paper/self-adaptive-in-context-learning","title":"Self-Adaptive In-Context Learning: An Information Compression Perspective for In-Context Example Selection and Ordering","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shark-nlp/self-adaptive-icl","path":"src/models/model.py","file_url":"https://github.com/shark-nlp/self-adaptive-icl/blob/HEAD/src/models/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b45f36adadad5aff","mcp_get_code":{"code_sha256":"b45f36adadad5aff"}},{"arxiv_id":"2212.09840","paper":"/paper/dynamic-sparse-network-for-time-series","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QiaoXiao7282/DSN","path":"trainer_DSN.py","file_url":"https://github.com/QiaoXiao7282/DSN/blob/HEAD/trainer_DSN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5f4c146a35d7c18c","mcp_get_code":{"code_sha256":"5f4c146a35d7c18c"}},{"arxiv_id":"2212.08108","paper":"/paper/deepdfa-dataflow-analysis-guided-efficient","title":"Dataflow Analysis-Inspired Deep Learning for Efficient Vulnerability Detection","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ISU-PAAL/DeepDFA","path":"LineVul/linevul/linevul_main.py","file_url":"https://github.com/ISU-PAAL/DeepDFA/blob/HEAD/LineVul/linevul/linevul_main.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44312da6e0a58c0a","mcp_get_code":{"code_sha256":"44312da6e0a58c0a"}},{"arxiv_id":"2211.11953","paper":"/paper/teach-detr-better-training-detr-with-teachers","title":"Teach-DETR: Better Training DETR with Teachers","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonhlj/teach-detr","path":"H-Deformable-DETR/datasets/coco_eval.py","file_url":"https://github.com/leonhlj/teach-detr/blob/HEAD/H-Deformable-DETR/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2211.11567","paper":"/paper/neural-networks-trained-with-sgd-learn","title":"Neural networks trained with SGD learn distributions of increasing complexity","date":"2022-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sgoldt/dist_inc_comp","path":"dist_inc_comp.py","file_url":"https://github.com/sgoldt/dist_inc_comp/blob/HEAD/dist_inc_comp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"32d6b047b7abf16c","mcp_get_code":{"code_sha256":"32d6b047b7abf16c"}},{"arxiv_id":"2210.13005","paper":"/paper/towards-out-of-distribution-sequential-event","title":"Towards Out-of-Distribution Sequential Event Prediction: A Causal Treatment","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chr26195/caseq","path":"utils.py","file_url":"https://github.com/chr26195/caseq/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b3579b226e83a1db","mcp_get_code":{"code_sha256":"b3579b226e83a1db"}},{"arxiv_id":"2210.10039","paper":"/paper/how-would-the-viewer-feel-estimating","title":"How Would The Viewer Feel? Estimating Wellbeing From Video Scenarios","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/emodiversity","path":"STAM/train_model.py","file_url":"https://github.com/hendrycks/emodiversity/blob/HEAD/STAM/train_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"66db9456e164e06b","mcp_get_code":{"code_sha256":"66db9456e164e06b"}},{"arxiv_id":"2210.10039","paper":"/paper/how-would-the-viewer-feel-estimating","title":"How Would The Viewer Feel? Estimating Wellbeing From Video Scenarios","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/emodiversity","path":"STAM/train_wellbeing_model.py","file_url":"https://github.com/hendrycks/emodiversity/blob/HEAD/STAM/train_wellbeing_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"642c8700f4a9684e","mcp_get_code":{"code_sha256":"642c8700f4a9684e"}},{"arxiv_id":"2210.08196","paper":"/paper/deep-regression-unlearning","title":"Deep Regression Unlearning","date":"2022-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayu987/deep-regression-unlearning","path":"unlearn.py","file_url":"https://github.com/ayu987/deep-regression-unlearning/blob/HEAD/unlearn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39ab71f99f903d6c","mcp_get_code":{"code_sha256":"39ab71f99f903d6c"}},{"arxiv_id":"2210.06823","paper":"/paper/scalable-neural-video-representations-with","title":"Scalable Neural Video Representations with Learnable Positional Features","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"4bcdec64794c3fab","mcp_get_code":{"code_sha256":"4bcdec64794c3fab"}},{"arxiv_id":"2210.06718","paper":"/paper/hybrid-rl-using-both-offline-and-online-data","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yudasong/HyQ","path":"CLock/online_main_lock.py","file_url":"https://github.com/yudasong/HyQ/blob/HEAD/CLock/online_main_lock.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ea623cc39c0fd92d","mcp_get_code":{"code_sha256":"ea623cc39c0fd92d"}},{"arxiv_id":"2210.02952","paper":"/paper/improving-the-sample-efficiency-of-prompt","title":"Improving the Sample Efficiency of Prompt Tuning with Domain Adaptation","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoxuxu/soft-prompt-transfer","path":"optima/evaluation.py","file_url":"https://github.com/guoxuxu/soft-prompt-transfer/blob/HEAD/optima/evaluation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4598d285dfa9997c","mcp_get_code":{"code_sha256":"4598d285dfa9997c"}},{"arxiv_id":"2210.01753","paper":"/paper/hypro-a-hybridly-normalized-probabilistic","title":"HYPRO: A Hybridly Normalized Probabilistic Model for Long-Horizon Prediction of Event Sequences","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivan-chai/hotpp-benchmark","path":"hotpp/evaluate.py","file_url":"https://github.com/ivan-chai/hotpp-benchmark/blob/HEAD/hotpp/evaluate.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":"183f293f3497c300","mcp_get_code":{"code_sha256":"183f293f3497c300"}},{"arxiv_id":"2209.03473","paper":"/paper/higher-order-clustering-and-pooling-for-graph","title":"Higher-order Clustering and Pooling for Graph Neural Networks","date":"2022-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexduvalinho/hoscpool","path":"example.py","file_url":"https://github.com/alexduvalinho/hoscpool/blob/HEAD/example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c08e1f7696006e20","mcp_get_code":{"code_sha256":"c08e1f7696006e20"}},{"arxiv_id":"2207.13080","paper":"/paper/detrs-with-hybrid-matching","title":"DETRs with Hybrid Matching","date":"2022-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HDETR/H-Deformable-DETR","path":"datasets/coco_eval.py","file_url":"https://github.com/HDETR/H-Deformable-DETR/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2207.11680","paper":"/paper/no-more-fine-tuning-an-experimental","title":"No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adf1178/pt4code","path":"CodeT5-main/run_clone.py","file_url":"https://github.com/adf1178/pt4code/blob/HEAD/CodeT5-main/run_clone.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a8459dd6372165af","mcp_get_code":{"code_sha256":"a8459dd6372165af"}},{"arxiv_id":"2207.11680","paper":"/paper/no-more-fine-tuning-an-experimental","title":"No More Fine-Tuning? An Experimental Evaluation of Prompt Tuning in Code Intelligence","date":"2022-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adf1178/pt4code","path":"CodeT5-main/run_defect.py","file_url":"https://github.com/adf1178/pt4code/blob/HEAD/CodeT5-main/run_defect.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7162c6b07c0d21f6","mcp_get_code":{"code_sha256":"7162c6b07c0d21f6"}},{"arxiv_id":"2207.11103","paper":"/paper/devis-making-deformable-transformers-work-for","title":"DeVIS: Making Deformable Transformers Work for Video Instance Segmentation","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acaelles97/devis","path":"src/datasets/coco_eval.py","file_url":"https://github.com/acaelles97/devis/blob/HEAD/src/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2207.03574","paper":"/paper/demystifying-the-adversarial-robustness-of-1","title":"Demystifying the Adversarial Robustness of Random Transformation Defenses","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wagner-group/demystify-random-transform","path":"train_bpda.py","file_url":"https://github.com/wagner-group/demystify-random-transform/blob/HEAD/train_bpda.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"479519ca1a08f97e","mcp_get_code":{"code_sha256":"479519ca1a08f97e"}},{"arxiv_id":"2206.13176","paper":"/paper/a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-h/pge","path":"pge/unsup_property_train.py","file_url":"https://github.com/yifan-h/pge/blob/HEAD/pge/unsup_property_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a842f5654d7a218","mcp_get_code":{"code_sha256":"3a842f5654d7a218"}},{"arxiv_id":"2206.06602","paper":"/paper/deep-isolation-forest-for-anomaly-detection","title":"Deep Isolation Forest for Anomaly Detection","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/deep-iforest","path":"utils.py","file_url":"https://github.com/xuhongzuo/deep-iforest/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5e5c9ce7f22f88db","mcp_get_code":{"code_sha256":"5e5c9ce7f22f88db"}},{"arxiv_id":"2206.04976","paper":"/paper/refining-neural-network-predictions-using","title":"Refining neural network predictions using background knowledge","date":"2022-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielealessandro/iterativelocalrefinement","path":"SAT.py","file_url":"https://github.com/danielealessandro/iterativelocalrefinement/blob/HEAD/SAT.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"640d436469f085e6","mcp_get_code":{"code_sha256":"640d436469f085e6"}},{"arxiv_id":"2206.01535","paper":"/paper/rethinking-and-scaling-up-graph-contrastive","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ff48cfbf50b51f67","mcp_get_code":{"code_sha256":"ff48cfbf50b51f67"}},{"arxiv_id":"2206.01535","paper":"/paper/rethinking-and-scaling-up-graph-contrastive","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyzisastudyreallyhardguy/Graph-Group-Discrimination","path":"GGD-amco/train_coauthor.py","file_url":"https://github.com/zyzisastudyreallyhardguy/Graph-Group-Discrimination/blob/HEAD/GGD-amco/train_coauthor.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":"55e2853f190fe060","mcp_get_code":{"code_sha256":"55e2853f190fe060"}},{"arxiv_id":"2206.01295","paper":"/paper/rashomon-capacity-a-metric-for-predictive","title":"Rashomon Capacity: A Metric for Predictive Multiplicity in Classification","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsianghsu/rashomon-capacity","path":"awp/utils/training.py","file_url":"https://github.com/hsianghsu/rashomon-capacity/blob/HEAD/awp/utils/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d36fe6945bd1e95","mcp_get_code":{"code_sha256":"0d36fe6945bd1e95"}},{"arxiv_id":"2206.01079","paper":"/paper/when-does-return-conditioned-supervised","title":"When does return-conditioned supervised learning work for offline reinforcement learning?","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidbrandfonbrener/rcsl-paper","path":"jax_continuous_rl/jaxrl/evaluation.py","file_url":"https://github.com/davidbrandfonbrener/rcsl-paper/blob/HEAD/jax_continuous_rl/jaxrl/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79152be87460ca81","mcp_get_code":{"code_sha256":"79152be87460ca81"}},{"arxiv_id":"2206.01079","paper":"/paper/when-does-return-conditioned-supervised","title":"When does return-conditioned supervised learning work for offline reinforcement learning?","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidbrandfonbrener/rcsl-paper","path":"jax_continuous_rl/jaxrl/rvs_evaluation.py","file_url":"https://github.com/davidbrandfonbrener/rcsl-paper/blob/HEAD/jax_continuous_rl/jaxrl/rvs_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"95424c4d978c1af3","mcp_get_code":{"code_sha256":"95424c4d978c1af3"}},{"arxiv_id":"2205.15124","paper":"/paper/generalizing-hierarchical-bayesian-bandits","title":"Mixed-Effect Thompson Sampling","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imadaouali/mixed-effect-thompson-sampling","path":"bandits/evaluation.py","file_url":"https://github.com/imadaouali/mixed-effect-thompson-sampling/blob/HEAD/bandits/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"52eab66d3ed18c96","mcp_get_code":{"code_sha256":"52eab66d3ed18c96"}},{"arxiv_id":"2205.14900","paper":"/paper/fraug-tackling-federated-learning-with-non","title":"FRAug: Tackling Federated Learning with Non-IID Features via Representation Augmentation","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokunChen245/FRAug","path":"ray_baselines.py","file_url":"https://github.com/HaokunChen245/FRAug/blob/HEAD/ray_baselines.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":"a2078e0142acb000","mcp_get_code":{"code_sha256":"a2078e0142acb000"}},{"arxiv_id":"2205.14368","paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_synthetic.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_synthetic.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39a3193be1fde526","mcp_get_code":{"code_sha256":"39a3193be1fde526"}},{"arxiv_id":"2205.14368","paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_tu.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_tu.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9cc50aedc9f2d22d","mcp_get_code":{"code_sha256":"9cc50aedc9f2d22d"}},{"arxiv_id":"2205.14368","paper":"/paper/going-deeper-into-permutation-sensitive-graph","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyu1998/pg-gnn","path":"main_benchmark.py","file_url":"https://github.com/zhongyu1998/pg-gnn/blob/HEAD/main_benchmark.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"48c872a66853c858","mcp_get_code":{"code_sha256":"48c872a66853c858"}},{"arxiv_id":"2205.12144","paper":"/paper/optimizing-performance-of-federated-person-re","title":"Optimizing Performance of Federated Person Re-identification: Benchmarking and Analysis","date":"2022-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cap-ntu/FedReID","path":"evaluate.py","file_url":"https://github.com/cap-ntu/FedReID/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa35d5d95fb54d49","mcp_get_code":{"code_sha256":"aa35d5d95fb54d49"}},{"arxiv_id":"2205.11502","paper":"/paper/on-the-paradox-of-learning-to-reason-from","title":"On the Paradox of Learning to Reason from Data","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshuacnf/paradox-learning2reason","path":"finetune_simplified.py","file_url":"https://github.com/joshuacnf/paradox-learning2reason/blob/HEAD/finetune_simplified.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1fc9bf9a870979fe","mcp_get_code":{"code_sha256":"1fc9bf9a870979fe"}},{"arxiv_id":"2205.05849","paper":"/paper/e-care-a-new-dataset-for-exploring-1","title":"e-CARE: a New Dataset for Exploring Explainable Causal Reasoning","date":"2022-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waste-Wood/e-CARE","path":"code/gpt2_discriminate.py","file_url":"https://github.com/Waste-Wood/e-CARE/blob/HEAD/code/gpt2_discriminate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"926350da5c986279","mcp_get_code":{"code_sha256":"926350da5c986279"}},{"arxiv_id":"2205.01927","paper":"/paper/probabilistic-symmetry-for-improved","title":"Probabilistic Symmetry for Multi-Agent Dynamics","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/pecco","path":"scripts/train_pecco_argoverse.py","file_url":"https://github.com/rose-stl-lab/pecco/blob/HEAD/scripts/train_pecco_argoverse.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65b4e1f791421fdb","mcp_get_code":{"code_sha256":"65b4e1f791421fdb"}},{"arxiv_id":"2205.01927","paper":"/paper/probabilistic-symmetry-for-improved","title":"Probabilistic Symmetry for Multi-Agent Dynamics","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/pecco","path":"scripts/train_pecco_pedestrian.py","file_url":"https://github.com/rose-stl-lab/pecco/blob/HEAD/scripts/train_pecco_pedestrian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1e3d4ddc23f1f3f","mcp_get_code":{"code_sha256":"d1e3d4ddc23f1f3f"}},{"arxiv_id":"2205.00363","paper":"/paper/visual-spatial-reasoning","title":"Visual Spatial Reasoning","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sohojoe/clip_visual-spatial-reasoning","path":"src/eval000.py","file_url":"https://github.com/sohojoe/clip_visual-spatial-reasoning/blob/HEAD/src/eval000.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":"eff2ebc2698c82dd","mcp_get_code":{"code_sha256":"eff2ebc2698c82dd"}},{"arxiv_id":"2205.00363","paper":"/paper/visual-spatial-reasoning","title":"Visual Spatial Reasoning","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sohojoe/clip_visual-spatial-reasoning","path":"src/eval001.py","file_url":"https://github.com/sohojoe/clip_visual-spatial-reasoning/blob/HEAD/src/eval001.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":"70d7553e03069ad3","mcp_get_code":{"code_sha256":"70d7553e03069ad3"}},{"arxiv_id":"2204.12063","paper":"/paper/a-review-aware-graph-contrastive-learning","title":"A Review-aware Graph Contrastive Learning Framework for Recommendation","date":"2022-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JarenceSJ/ReviewGraph","path":"RGCL/rgc_nd_ed.py","file_url":"https://github.com/JarenceSJ/ReviewGraph/blob/HEAD/RGCL/rgc_nd_ed.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":"45d83d30c99ddd44","mcp_get_code":{"code_sha256":"45d83d30c99ddd44"}},{"arxiv_id":"2204.10704","paper":"/paper/sues-200-a-multi-height-multi-scene-cross","title":"SUES-200: A Multi-height Multi-scene Cross-view Image Benchmark Across Drone and Satellite","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Reza-Zhu/SUES-200-Benchmark","path":"test_and_evaluate.py","file_url":"https://github.com/Reza-Zhu/SUES-200-Benchmark/blob/HEAD/test_and_evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ebe7889296f10b3","mcp_get_code":{"code_sha256":"8ebe7889296f10b3"}},{"arxiv_id":"2204.08381","paper":"/paper/multiple-environment-self-adaptive-network","title":"Multiple-environment Self-adaptive Network for Aerial-view Geo-localization","date":"2022-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wtyhub/MuseNet","path":"evaluate_gpu.py","file_url":"https://github.com/wtyhub/MuseNet/blob/HEAD/evaluate_gpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89cbd25ccde3f43c","mcp_get_code":{"code_sha256":"89cbd25ccde3f43c"}},{"arxiv_id":"2204.02937","paper":"/paper/last-layer-re-training-is-sufficient-for","title":"Last Layer Re-Training is Sufficient for Robustness to Spurious Correlations","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PolinaKirichenko/deep_feature_reweighting","path":"utils.py","file_url":"https://github.com/PolinaKirichenko/deep_feature_reweighting/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"e19d0c3f75393ec1","mcp_get_code":{"code_sha256":"e19d0c3f75393ec1"}},{"arxiv_id":"2204.01227","paper":"/paper/diverse-text-generation-via-variational","title":"Diverse Text Generation via Variational Encoder-Decoder Models with Gaussian Process Priors","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyu-du/gp-vae","path":"models/pg/training.py","file_url":"https://github.com/wyu-du/gp-vae/blob/HEAD/models/pg/training.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":"f145cea183a02846","mcp_get_code":{"code_sha256":"f145cea183a02846"}},{"arxiv_id":"2204.00185","paper":"/paper/distill-vq-learning-retrieval-oriented-vector","title":"Distill-VQ: Learning Retrieval Oriented Vector Quantization By Distilling Knowledge from Dense Embeddings","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"staoxiao/libvq","path":"LibVQ/utils.py","file_url":"https://github.com/staoxiao/libvq/blob/HEAD/LibVQ/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e846bd1884ce044","mcp_get_code":{"code_sha256":"1e846bd1884ce044"}},{"arxiv_id":"2203.03890","paper":"/paper/clearpose-large-scale-transparent-object","title":"ClearPose: Large-scale Transparent Object Dataset and Benchmark","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opipari/ClearPose","path":"clearpose/xu_6dof/networks/references/detection/coco_eval.py","file_url":"https://github.com/opipari/ClearPose/blob/HEAD/clearpose/xu_6dof/networks/references/detection/coco_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c020cdba64094eae","mcp_get_code":{"code_sha256":"c020cdba64094eae"}},{"arxiv_id":"2203.00259","paper":"/paper/omni-frequency-channel-selection","title":"Omni-frequency Channel-selection Representations for Unsupervised Anomaly Detection","date":"2022-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangzjn/ocr-gan","path":"lib/evaluate.py","file_url":"https://github.com/zhangzjn/ocr-gan/blob/HEAD/lib/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cbd017ec2e291937","mcp_get_code":{"code_sha256":"cbd017ec2e291937"}},{"arxiv_id":"2202.12002","paper":"/paper/rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ksreenivasan/pruning_is_enough","path":"ddp_poc.py","file_url":"https://github.com/ksreenivasan/pruning_is_enough/blob/HEAD/ddp_poc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e83bd2013f6f15f","mcp_get_code":{"code_sha256":"0e83bd2013f6f15f"}},{"arxiv_id":"2202.09792","paper":"/paper/hierarchical-interpretation-of-neural-text","title":"Hierarchical Interpretation of Neural Text Classification","date":"2022-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanqi-qi/sine","path":"sine_abalation.py","file_url":"https://github.com/hanqi-qi/sine/blob/HEAD/sine_abalation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0fac14e8718a1839","mcp_get_code":{"code_sha256":"0fac14e8718a1839"}},{"arxiv_id":"2202.09792","paper":"/paper/hierarchical-interpretation-of-neural-text","title":"Hierarchical Interpretation of Neural Text Classification","date":"2022-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanqi-qi/sine","path":"sine_dec.py","file_url":"https://github.com/hanqi-qi/sine/blob/HEAD/sine_dec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1a24b383db4c486a","mcp_get_code":{"code_sha256":"1a24b383db4c486a"}},{"arxiv_id":"2202.09792","paper":"/paper/hierarchical-interpretation-of-neural-text","title":"Hierarchical Interpretation of Neural Text Classification","date":"2022-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanqi-qi/sine","path":"sine_explain.py","file_url":"https://github.com/hanqi-qi/sine/blob/HEAD/sine_explain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8839e9ada8b42b1b","mcp_get_code":{"code_sha256":"8839e9ada8b42b1b"}},{"arxiv_id":"2202.08408","paper":"/paper/multivariate-time-series-forecasting-with-1","title":"Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustagi-lab/mtgode","path":"run_single_step.py","file_url":"https://github.com/trustagi-lab/mtgode/blob/HEAD/run_single_step.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0320dc4eae4b7df0","mcp_get_code":{"code_sha256":"0320dc4eae4b7df0"}},{"arxiv_id":"2202.03814","paper":"/paper/optimal-transport-of-binary-classifiers-to","title":"Optimal Transport of Classifiers to Fairness","date":"2022-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aida-ugent/OTF","path":"otf/evaluation.py","file_url":"https://github.com/aida-ugent/OTF/blob/HEAD/otf/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6555826b9b6ae554","mcp_get_code":{"code_sha256":"6555826b9b6ae554"}},{"arxiv_id":"2202.03397","paper":"/paper/bilevel-optimization-with-a-lower-level","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csml-iit-ucl/bioptexps","path":"source/meta_learning_parallel.py","file_url":"https://github.com/csml-iit-ucl/bioptexps/blob/HEAD/source/meta_learning_parallel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87426479819d1248","mcp_get_code":{"code_sha256":"87426479819d1248"}},{"arxiv_id":"2202.00089","paper":"/paper/understanding-adamw-through-proximal-methods-1","title":"Understanding AdamW through Proximal Methods and Scale-Freeness","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenxun-zhuang/adamw-scale-free","path":"src/evaluate.py","file_url":"https://github.com/zhenxun-zhuang/adamw-scale-free/blob/HEAD/src/evaluate.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":"964c741bcbbd1927","mcp_get_code":{"code_sha256":"964c741bcbbd1927"}},{"arxiv_id":"2201.12787","paper":"/paper/graph-self-attention-for-learning-graph","title":"GRPE: Relative Positional Encoding for Graph Transformer","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lenscloth/grpe","path":"zinc.py","file_url":"https://github.com/lenscloth/grpe/blob/HEAD/zinc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9266294d3f2bade7","mcp_get_code":{"code_sha256":"9266294d3f2bade7"}},{"arxiv_id":"2201.05966","paper":"/paper/unifiedskg-unifying-and-multi-tasking","title":"UnifiedSKG: Unifying and Multi-Tasking Structured Knowledge Grounding with Text-to-Text Language Models","date":"2022-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/unifiedskg","path":"metrics/sparc/interaction_scores.py","file_url":"https://github.com/hkunlp/unifiedskg/blob/HEAD/metrics/sparc/interaction_scores.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":"e8a3b4f10de70271","mcp_get_code":{"code_sha256":"e8a3b4f10de70271"}},{"arxiv_id":"2112.13734","paper":"/paper/multi-domain-balanced-sampling-improves-out","title":"Multi-Domain Balanced Sampling Improves Out-of-Distribution Generalization of Chest X-ray Pathology Prediction Models","date":"2021-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"etetteh/ood_gen-chest_xray","path":"chest.py","file_url":"https://github.com/etetteh/ood_gen-chest_xray/blob/HEAD/chest.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ace7633e4ea30b2","mcp_get_code":{"code_sha256":"8ace7633e4ea30b2"}},{"arxiv_id":"2112.03939","paper":"/paper/photometric-redshifts-from-sdss-images-with","title":"Photometric Redshifts from SDSS Images with an Interpretable Deep Capsule Network","date":null,"month_inferred_from_arxiv_id":"2021-12","title_source":"archive","repo":"biprateep/encapZulate-1","path":"src/encapzulate/base/run_model.py","file_url":"https://github.com/biprateep/encapZulate-1/blob/HEAD/src/encapzulate/base/run_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bcc255c29c35ada2","mcp_get_code":{"code_sha256":"bcc255c29c35ada2"}},{"arxiv_id":"2112.02268","paper":"/paper/bridging-pre-trained-models-and-downstream","title":"Bridging Pre-trained Models and Downstream Tasks for Source Code Understanding","date":"2021-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangdeze18/DACL","path":"algorithm_classification/code/bagging.py","file_url":"https://github.com/wangdeze18/DACL/blob/HEAD/algorithm_classification/code/bagging.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4cfead0734041166","mcp_get_code":{"code_sha256":"4cfead0734041166"}},{"arxiv_id":"2112.01753","paper":"/paper/probing-linguistic-information-for-logical","title":"Probing Linguistic Information For Logical Inference In Pre-trained Language Models","date":"2021-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric11eca/inference-information-probing","path":"inform_prob/trainer.py","file_url":"https://github.com/eric11eca/inference-information-probing/blob/HEAD/inform_prob/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"349a73ed4ded5853","mcp_get_code":{"code_sha256":"349a73ed4ded5853"}},{"arxiv_id":"2111.14820","paper":"/paper/towards-robust-and-adaptive-motion","title":"Towards Robust and Adaptive Motion Forecasting: A Causal Representation Perspective","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/causalmotion","path":"spurious/evaluate_model.py","file_url":"https://github.com/vita-epfl/causalmotion/blob/HEAD/spurious/evaluate_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef311928245f72a3","mcp_get_code":{"code_sha256":"ef311928245f72a3"}},{"arxiv_id":"2111.14522","paper":"/paper/understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jctops/understanding-oversquashing","path":"gdl/src/gdl/experiment/node_classification.py","file_url":"https://github.com/jctops/understanding-oversquashing/blob/HEAD/gdl/src/gdl/experiment/node_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8e261bcbef0de223","mcp_get_code":{"code_sha256":"8e261bcbef0de223"}},{"arxiv_id":"2111.12085","paper":"/paper/crossing-the-format-boundary-of-text-and","title":"UniTAB: Unifying Text and Box Outputs for Grounded Vision-Language Modeling","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/UniTAB","path":"datasets/coco_eval.py","file_url":"https://github.com/microsoft/UniTAB/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2111.10367","paper":"/paper/slue-new-benchmark-tasks-for-spoken-language","title":"SLUE: New Benchmark Tasks for Spoken Language Understanding Evaluation on Natural Speech","date":"2021-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asappresearch/slue-toolkit","path":"slue_toolkit/eval/eval_utils_nel.py","file_url":"https://github.com/asappresearch/slue-toolkit/blob/HEAD/slue_toolkit/eval/eval_utils_nel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c8831cc7145df3ab","mcp_get_code":{"code_sha256":"c8831cc7145df3ab"}},{"arxiv_id":"2111.05407","paper":"/paper/learning-logic-rules-for-document-level-1","title":"Learning Logic Rules for Document-level Relation Extraction","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rudongyu/logire","path":"logire.py","file_url":"https://github.com/rudongyu/logire/blob/HEAD/logire.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50f5d22519059b77","mcp_get_code":{"code_sha256":"50f5d22519059b77"}},{"arxiv_id":"2111.01026","paper":"/paper/introspective-distillation-for-robust","title":"Introspective Distillation for Robust Question Answering","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuleiniu/introd","path":"css/train_introd.py","file_url":"https://github.com/yuleiniu/introd/blob/HEAD/css/train_introd.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":"0a0886422bf580b6","mcp_get_code":{"code_sha256":"0a0886422bf580b6"}},{"arxiv_id":"2110.13903","paper":"/paper/nerv-neural-representations-for-videos","title":"NeRV: Neural Representations for Videos","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haochen-rye/NeRV","path":"train_nerv.py","file_url":"https://github.com/haochen-rye/NeRV/blob/HEAD/train_nerv.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4bcdec64794c3fab","mcp_get_code":{"code_sha256":"4bcdec64794c3fab"}},{"arxiv_id":"2110.13522","paper":"/paper/probabilistic-entity-representation-model-for","title":"Probabilistic Entity Representation Model for Reasoning over Knowledge Graphs","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akirato/perm-gaussiankg","path":"main_gaussian.py","file_url":"https://github.com/akirato/perm-gaussiankg/blob/HEAD/main_gaussian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"21ca980216745d48","mcp_get_code":{"code_sha256":"21ca980216745d48"}},{"arxiv_id":"2110.13223","paper":"/paper/identifying-and-benchmarking-natural-out-of","title":"Identifying and Benchmarking Natural Out-of-Context Prediction Problems","date":"2021-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmadras/nooch","path":"src/nooch.py","file_url":"https://github.com/dmadras/nooch/blob/HEAD/src/nooch.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":"773a53ce9d82db41","mcp_get_code":{"code_sha256":"773a53ce9d82db41"}},{"arxiv_id":"2110.08466","paper":"/paper/on-the-safety-of-conversational-models","title":"On the Safety of Conversational Models: Taxonomy, Dataset, and Benchmark","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/diasafety","path":"codes/mix_train.py","file_url":"https://github.com/thu-coai/diasafety/blob/HEAD/codes/mix_train.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":"c2357b08a012370c","mcp_get_code":{"code_sha256":"c2357b08a012370c"}},{"arxiv_id":"2110.07749","paper":"/paper/attention-free-keyword-spotting","title":"Attention-Free Keyword Spotting","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-Research-BD/Keyword-MLP","path":"utils/trainer.py","file_url":"https://github.com/AI-Research-BD/Keyword-MLP/blob/HEAD/utils/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40175e67a61190d6","mcp_get_code":{"code_sha256":"40175e67a61190d6"}},{"arxiv_id":"2110.07402","paper":"/paper/self-supervised-learning-by-estimating-twin-1","title":"Self-Supervised Learning by Estimating Twin Class Distributions","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/TWIST","path":"evaluate_cluster.py","file_url":"https://github.com/bytedance/TWIST/blob/HEAD/evaluate_cluster.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":"e3880dee498de475","mcp_get_code":{"code_sha256":"e3880dee498de475"}},{"arxiv_id":"2110.06884","paper":"/paper/conditionalqa-a-complex-reading-comprehension","title":"ConditionalQA: A Complex Reading Comprehension Dataset with Conditional Answers","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haitian-sun/conditionalqa","path":"evaluate.py","file_url":"https://github.com/haitian-sun/conditionalqa/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1d52d2caf114bd51","mcp_get_code":{"code_sha256":"1d52d2caf114bd51"}},{"arxiv_id":"2110.06500","paper":"/paper/differentially-private-fine-tuning-of-1","title":"Differentially Private Fine-tuning of Language Models","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huseyinatahaninan/differentially-private-fine-tuning-of-language-models","path":"Language-Generation-GPT-2/src/gpt2_ft.py","file_url":"https://github.com/huseyinatahaninan/differentially-private-fine-tuning-of-language-models/blob/HEAD/Language-Generation-GPT-2/src/gpt2_ft.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"695cf8807f968acc","mcp_get_code":{"code_sha256":"695cf8807f968acc"}},{"arxiv_id":"2110.05329","paper":"/paper/addressing-the-stability-plasticity-dilemma-1","title":"Avoiding Forgetting and Allowing Forward Transfer in Continual Learning via Sparse Networks","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GhadaSokar/AFAF","path":"main_CNN.py","file_url":"https://github.com/GhadaSokar/AFAF/blob/HEAD/main_CNN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"985e714b6e302057","mcp_get_code":{"code_sha256":"985e714b6e302057"}},{"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":"elegan23/hypernets","path":"sound-event-detection/train_baseline_task2.py","file_url":"https://github.com/elegan23/hypernets/blob/HEAD/sound-event-detection/train_baseline_task2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e94054b554510ce","mcp_get_code":{"code_sha256":"3e94054b554510ce"}},{"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/utils.py","file_url":"https://github.com/milutter/value_iteration/blob/HEAD/value_iteration/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1d1c9c9a8a751af","mcp_get_code":{"code_sha256":"a1d1c9c9a8a751af"}},{"arxiv_id":"2109.10852","paper":"/paper/pix2seq-a-language-modeling-framework-for","title":"Pix2seq: A Language Modeling Framework for Object Detection","date":"2021-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaopengcuhk/Unofficial-Pix2Seq","path":"datasets/coco_eval.py","file_url":"https://github.com/gaopengcuhk/Unofficial-Pix2Seq/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2109.05675","paper":"/paper/online-unsupervised-learning-of-visual","title":"Online Unsupervised Learning of Visual Representations and Categories","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengye/online-unsup-proto-net","path":"fewshot/experiments/oc_fewshot.py","file_url":"https://github.com/renmengye/online-unsup-proto-net/blob/HEAD/fewshot/experiments/oc_fewshot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"828901ad9dadb944","mcp_get_code":{"code_sha256":"828901ad9dadb944"}},{"arxiv_id":"2109.05257","paper":"/paper/towards-a-rigorous-evaluation-of-time-series","title":"Towards a Rigorous Evaluation of Time-series Anomaly Detection","date":"2021-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuslkkk/tadpak","path":"tadpak/evaluate.py","file_url":"https://github.com/tuslkkk/tadpak/blob/HEAD/tadpak/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6eef681edca786aa","mcp_get_code":{"code_sha256":"6eef681edca786aa"}},{"arxiv_id":"2109.04463","paper":"/paper/neural-latents-benchmark-21-evaluating-latent","title":"Neural Latents Benchmark '21: Evaluating latent variable models of neural population activity","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurallatents/nlb_tools","path":"nlb_tools/evaluation.py","file_url":"https://github.com/neurallatents/nlb_tools/blob/HEAD/nlb_tools/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd7c0d0bf0c8c24c","mcp_get_code":{"code_sha256":"bd7c0d0bf0c8c24c"}},{"arxiv_id":"2109.04463","paper":"/paper/neural-latents-benchmark-21-evaluating-latent","title":"Neural Latents Benchmark '21: Evaluating latent variable models of neural population activity","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kabirdabholkar/nlb_tools_fewshot","path":"nlb_tools/evaluation.py","file_url":"https://github.com/kabirdabholkar/nlb_tools_fewshot/blob/HEAD/nlb_tools/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14fc654bea6d290a","mcp_get_code":{"code_sha256":"14fc654bea6d290a"}},{"arxiv_id":"2109.00859","paper":"/paper/codet5-identifier-aware-unified-pre-trained","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","date":"2021-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awsm-research/vulrepair","path":"M1_VulRepair_PL-NL/vulrepair_main.py","file_url":"https://github.com/awsm-research/vulrepair/blob/HEAD/M1_VulRepair_PL-NL/vulrepair_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0b0dc8f9dc8cb6b8","mcp_get_code":{"code_sha256":"0b0dc8f9dc8cb6b8"}},{"arxiv_id":"2108.13073","paper":"/paper/knowledge-base-completion-meets-transfer","title":"Knowledge Base Completion Meets Transfer Learning","date":"2021-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vid-koci/KBCtransferlearning","path":"scoring.py","file_url":"https://github.com/vid-koci/KBCtransferlearning/blob/HEAD/scoring.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d6b5d77a7df7cc89","mcp_get_code":{"code_sha256":"d6b5d77a7df7cc89"}},{"arxiv_id":"2108.06152","paper":"/paper/conditional-detr-for-fast-training","title":"Conditional DETR for Fast Training Convergence","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atten4vis/conditionaldetr","path":"datasets/coco_eval.py","file_url":"https://github.com/atten4vis/conditionaldetr/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2108.04763","paper":"/paper/imitation-learning-by-reinforcement-learning","title":"Imitation Learning by Reinforcement Learning","date":"2021-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spotify-research/il-by-rl","path":"d4rl_train.py","file_url":"https://github.com/spotify-research/il-by-rl/blob/HEAD/d4rl_train.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":"16e011ab8b9dc3a6","mcp_get_code":{"code_sha256":"16e011ab8b9dc3a6"}},{"arxiv_id":"2107.07432","paper":"/paper/hierarchical-graph-neural-nets-can-capture","title":"Hierarchical graph neural nets can capture long-range interactions","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rampasek/HGNet","path":"models/ops.py","file_url":"https://github.com/rampasek/HGNet/blob/HEAD/models/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb6a59d39c3291cc","mcp_get_code":{"code_sha256":"cb6a59d39c3291cc"}},{"arxiv_id":"2106.14568","paper":"/paper/freetickets-accurate-robust-and-efficient","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/FreeTickets","path":"main_DST.py","file_url":"https://github.com/VITA-Group/FreeTickets/blob/HEAD/main_DST.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b4b09ad38c701730","mcp_get_code":{"code_sha256":"b4b09ad38c701730"}},{"arxiv_id":"2106.06361","paper":"/paper/turn-the-combination-lock-learnable-textual","title":"Turn the Combination Lock: Learnable Textual Backdoor Attacks via Word Substitution","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/BkdAtk-LWS","path":"src/models/bert_biclassifier.py","file_url":"https://github.com/thunlp/BkdAtk-LWS/blob/HEAD/src/models/bert_biclassifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4efdada25be8589","mcp_get_code":{"code_sha256":"d4efdada25be8589"}},{"arxiv_id":"2106.03273","paper":"/paper/control-oriented-model-based-reinforcement","title":"Control-Oriented Model-Based Reinforcement Learning with Implicit Differentiation","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evgenii-nikishin/omd","path":"cartpole/utils.py","file_url":"https://github.com/evgenii-nikishin/omd/blob/HEAD/cartpole/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"580e68a39efc066b","mcp_get_code":{"code_sha256":"580e68a39efc066b"}},{"arxiv_id":"2106.03273","paper":"/paper/control-oriented-model-based-reinforcement","title":"Control-Oriented Model-Based Reinforcement Learning with Implicit Differentiation","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evgenii-nikishin/omd","path":"mujoco/jax_rl/evaluation.py","file_url":"https://github.com/evgenii-nikishin/omd/blob/HEAD/mujoco/jax_rl/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09dd14441f8afd51","mcp_get_code":{"code_sha256":"09dd14441f8afd51"}},{"arxiv_id":"2106.03097","paper":"/paper/preservation-of-the-global-knowledge-by-not","title":"Preservation of the Global Knowledge by Not-True Distillation in Federated Learning","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thejungwon/gc-fed","path":"algorithms/fedntd.py","file_url":"https://github.com/thejungwon/gc-fed/blob/HEAD/algorithms/fedntd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1a0a0b3bfb388c6e","mcp_get_code":{"code_sha256":"1a0a0b3bfb388c6e"}},{"arxiv_id":"2106.03027","paper":"/paper/boosting-a-model-zoo-for-multi-task-and","title":"Model Zoo: A Growing \"Brain\" That Learns Continually","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grasp-lyrl/modelzoo_continual","path":"utils/run_net.py","file_url":"https://github.com/grasp-lyrl/modelzoo_continual/blob/HEAD/utils/run_net.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c8a33e8446cb2845","mcp_get_code":{"code_sha256":"c8a33e8446cb2845"}},{"arxiv_id":"2106.00666","paper":"/paper/you-only-look-at-one-sequence-rethinking","title":"You Only Look at One Sequence: Rethinking Transformer in Vision through Object Detection","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hustvl/YOLOS","path":"datasets/coco_eval.py","file_url":"https://github.com/hustvl/YOLOS/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2105.14796","paper":"/paper/improving-tree-structured-decoder-training","title":"Improving Tree-Structured Decoder Training for Code Generation via Mutual Learning","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepLearnXMU/CGML","path":"evaluation.py","file_url":"https://github.com/DeepLearnXMU/CGML/blob/HEAD/evaluation.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":"5d62737e101413fe","mcp_get_code":{"code_sha256":"5d62737e101413fe"}},{"arxiv_id":"2105.14682","paper":"/paper/zero-shot-fact-verification-by-claim","title":"Zero-shot Fact Verification by Claim Generation","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/Zero-shot-Fact-Verification","path":"Fact_Verification/run_hover.py","file_url":"https://github.com/teacherpeterpan/Zero-shot-Fact-Verification/blob/HEAD/Fact_Verification/run_hover.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d7e80115238ef3d","mcp_get_code":{"code_sha256":"9d7e80115238ef3d"}},{"arxiv_id":"2105.09821","paper":"/paper/dehb-evolutionary-hyberband-for-scalable","title":"DEHB: Evolutionary Hyperband for Scalable, Robust and Efficient Hyperparameter Optimization","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/DEHB","path":"examples/03_pytorch_mnist_hpo.py","file_url":"https://github.com/automl/DEHB/blob/HEAD/examples/03_pytorch_mnist_hpo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"427f77a89590b11a","mcp_get_code":{"code_sha256":"427f77a89590b11a"}},{"arxiv_id":"2105.09452","paper":"/paper/minimum-delay-adaptation-in-non-stationary","title":"Minimum-Delay Adaptation in Non-Stationary Reinforcement Learning via Online High-Confidence Change-Point Detection","date":"2021-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LucasAlegre/mbcd","path":"mbcd/utils/util.py","file_url":"https://github.com/LucasAlegre/mbcd/blob/HEAD/mbcd/utils/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7829b5452293cc7c","mcp_get_code":{"code_sha256":"7829b5452293cc7c"}},{"arxiv_id":"2105.07381","paper":"/paper/undistillable-making-a-nasty-teacher-that-1","title":"Undistillable: Making A Nasty Teacher That CANNOT teach students","date":"2021-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/nasty-teacher","path":"train_scratch.py","file_url":"https://github.com/vita-group/nasty-teacher/blob/HEAD/train_scratch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c49dac5735131bf","mcp_get_code":{"code_sha256":"3c49dac5735131bf"}},{"arxiv_id":"2105.04444","paper":"/paper/continual-learning-via-bit-level-information","title":"Continual Learning via Bit-Level Information Preserving","date":"2021-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yujun-Shi/BLIP","path":"RL/rl_module/evaluation.py","file_url":"https://github.com/Yujun-Shi/BLIP/blob/HEAD/RL/rl_module/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5c7a3f9d950dfbfe","mcp_get_code":{"code_sha256":"5c7a3f9d950dfbfe"}},{"arxiv_id":"2105.03824","paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","title":"FNet: Mixing Tokens with Fourier Transforms","date":"2021-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amoramine/FNet_with_BART_classification","path":"fnet.py","file_url":"https://github.com/amoramine/FNet_with_BART_classification/blob/HEAD/fnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c92b7a737063ef80","mcp_get_code":{"code_sha256":"c92b7a737063ef80"}},{"arxiv_id":"2105.09284","paper":"/paper/semeval-2021-task-6-detection-of-persuasion","title":"SemEval-2021 Task 6: Detection of Persuasion Techniques in Texts and Images","date":"2021-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"di-dimitrov/SEMEVAL-2021-task6-corpus","path":"scorer/task1_3.py","file_url":"https://github.com/di-dimitrov/SEMEVAL-2021-task6-corpus/blob/HEAD/scorer/task1_3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7c09e8b2b1bf0d9b","mcp_get_code":{"code_sha256":"7c09e8b2b1bf0d9b"}},{"arxiv_id":"2104.14690","paper":"/paper/entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunyilgdx/prompts4keras","path":"baselines/efl_classification_bert.py","file_url":"https://github.com/sunyilgdx/prompts4keras/blob/HEAD/baselines/efl_classification_bert.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":"331fd9bebe591b2f","mcp_get_code":{"code_sha256":"331fd9bebe591b2f"}},{"arxiv_id":"2104.14690","paper":"/paper/entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunyilgdx/prompts4keras","path":"baselines/efl_classification_roberta.py","file_url":"https://github.com/sunyilgdx/prompts4keras/blob/HEAD/baselines/efl_classification_roberta.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":"95f4bc09fa08c171","mcp_get_code":{"code_sha256":"95f4bc09fa08c171"}},{"arxiv_id":"2104.14403","paper":"/paper/do-feature-attribution-methods-correctly","title":"Do Feature Attribution Methods Correctly Attribute Features?","date":"2021-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YilunZhou/feature-attribution-evaluation","path":"text_rationale_attention/attention_model.py","file_url":"https://github.com/YilunZhou/feature-attribution-evaluation/blob/HEAD/text_rationale_attention/attention_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11d8c820078320f3","mcp_get_code":{"code_sha256":"11d8c820078320f3"}},{"arxiv_id":"2104.12518","paper":"/paper/unified-spatio-temporal-modeling-for-traffic","title":"Unified Spatio-Temporal Modeling for Traffic Forecasting using Graph Neural Network","date":"2021-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AmitRoy7781/USTGCN","path":"USTGCN.py","file_url":"https://github.com/AmitRoy7781/USTGCN/blob/HEAD/USTGCN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b8ae93848f0f517e","mcp_get_code":{"code_sha256":"b8ae93848f0f517e"}},{"arxiv_id":"2104.09715","paper":"/paper/adaspeech-2-adaptive-text-to-speech-with","title":"AdaSpeech 2: Adaptive Text to Speech with Untranscribed Data","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/AdaSpeech2","path":"evaluation.py","file_url":"https://github.com/rishikksh20/AdaSpeech2/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"644e4bb8a34cbee8","mcp_get_code":{"code_sha256":"644e4bb8a34cbee8"}},{"arxiv_id":"2104.06245","paper":"/paper/understanding-hard-negatives-in-noise","title":"Understanding Hard Negatives in Noise Contrastive Estimation","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WenzhengZhang/hard-nce-el","path":"main_retriever.py","file_url":"https://github.com/WenzhengZhang/hard-nce-el/blob/HEAD/main_retriever.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9345bf90bc76e4e","mcp_get_code":{"code_sha256":"f9345bf90bc76e4e"}},{"arxiv_id":"2104.00808","paper":"/paper/curriculum-graph-co-teaching-for-multi-target","title":"Curriculum Graph Co-Teaching for Multi-Target Domain Adaptation","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Evgeneus/Graph-Domain-Adaptaion","path":"src/trainer.py","file_url":"https://github.com/Evgeneus/Graph-Domain-Adaptaion/blob/HEAD/src/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ad75e8fd7de2f8b","mcp_get_code":{"code_sha256":"8ad75e8fd7de2f8b"}},{"arxiv_id":"2104.00769","paper":"/paper/keyword-transformer-a-self-attention-model","title":"Keyword Transformer: A Self-Attention Model for Keyword Spotting","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ID56/Torch-KWT","path":"utils/trainer.py","file_url":"https://github.com/ID56/Torch-KWT/blob/HEAD/utils/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"40175e67a61190d6","mcp_get_code":{"code_sha256":"40175e67a61190d6"}},{"arxiv_id":"2103.13027","paper":"/paper/automix-unveiling-the-power-of-mixup","title":"AutoMix: Unveiling the Power of Mixup for Stronger Classifiers","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Westlake-AI/AutoMix","path":"engine.py","file_url":"https://github.com/Westlake-AI/AutoMix/blob/HEAD/engine.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":"30d82c52aa52dbd7","mcp_get_code":{"code_sha256":"30d82c52aa52dbd7"}},{"arxiv_id":"2103.12115","paper":"/paper/end-to-end-trainable-multi-instance-pose","title":"End-to-End Trainable Multi-Instance Pose Estimation with Transformers","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amathislab/poet","path":"datasets/coco_eval.py","file_url":"https://github.com/amathislab/poet/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2103.11731","paper":"/paper/meta-detr-few-shot-object-detection-via","title":"Meta-DETR: Image-Level Few-Shot Object Detection with Inter-Class Correlation Exploitation","date":"2021-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhangGongjie/Meta-DETR","path":"datasets/eval_detection.py","file_url":"https://github.com/ZhangGongjie/Meta-DETR/blob/HEAD/datasets/eval_detection.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2103.03344","paper":"/paper/waveguard-understanding-and-mitigating-audio","title":"WaveGuard: Understanding and Mitigating Audio Adversarial Examples","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shehzeen/waveguard_defense","path":"evaluate_detector.py","file_url":"https://github.com/shehzeen/waveguard_defense/blob/HEAD/evaluate_detector.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50dc849dc104f3e8","mcp_get_code":{"code_sha256":"50dc849dc104f3e8"}},{"arxiv_id":"2102.10424","paper":"/paper/gist-distributed-training-for-large-scale","title":"GIST: Distributed Training for Large-Scale Graph Convolutional Networks","date":"2021-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ff48cfbf50b51f67","mcp_get_code":{"code_sha256":"ff48cfbf50b51f67"}},{"arxiv_id":"2012.15471","paper":"/paper/good-practices-for-bayesian-optimization-of","title":"Good practices for Bayesian Optimization of high dimensional structured spaces","date":"2020-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esiivola/hdssbo","path":"run_BO.py","file_url":"https://github.com/esiivola/hdssbo/blob/HEAD/run_BO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"17bb180355aeba50","mcp_get_code":{"code_sha256":"17bb180355aeba50"}},{"arxiv_id":"2011.04218","paper":"/paper/graph-neural-network-with-automorphic","title":"Automorphic Equivalence-aware Graph Neural Network","date":"2020-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsinghua-fib-lab/grape","path":"grape_model.py","file_url":"https://github.com/tsinghua-fib-lab/grape/blob/HEAD/grape_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"567074f849120cb7","mcp_get_code":{"code_sha256":"567074f849120cb7"}},{"arxiv_id":"2010.13663","paper":"/paper/contrastive-graph-neural-network-explanation","title":"Contrastive Graph Neural Network Explanation","date":"2020-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukasjf/contrastive-gnn-explanation","path":"gnnexplainer_train.py","file_url":"https://github.com/lukasjf/contrastive-gnn-explanation/blob/HEAD/gnnexplainer_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"af987a98d769f865","mcp_get_code":{"code_sha256":"af987a98d769f865"}},{"arxiv_id":"2010.12812","paper":"/paper/a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/PURE","path":"run_entity.py","file_url":"https://github.com/princeton-nlp/PURE/blob/HEAD/run_entity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"136782e0f93a2faa","mcp_get_code":{"code_sha256":"136782e0f93a2faa"}},{"arxiv_id":"2010.11731","paper":"/paper/improving-bert-performance-for-aspect-based","title":"Improving BERT Performance for Aspect-Based Sentiment Analysis","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IMPLabUniPr/BERT-for-ABSA","path":"eval/evaluate_ae.py","file_url":"https://github.com/IMPLabUniPr/BERT-for-ABSA/blob/HEAD/eval/evaluate_ae.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":"aeb20ed962ccdd7f","mcp_get_code":{"code_sha256":"aeb20ed962ccdd7f"}},{"arxiv_id":"2010.08895","paper":"/paper/fourier-neural-operator-for-parametric-1","title":"Fourier Neural Operator for Parametric Partial Differential Equations","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sala-group/autows-bench-101","path":"datasets/domainnet/generate_dataset.py","file_url":"https://github.com/sala-group/autows-bench-101/blob/HEAD/datasets/domainnet/generate_dataset.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":"921658703d7b0dea","mcp_get_code":{"code_sha256":"921658703d7b0dea"}},{"arxiv_id":"2010.07565","paper":"/paper/bi-gcn-binary-graph-convolutional-network","title":"Bi-GCN: Binary Graph Convolutional Network","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bywmm/Bi-GCN","path":"transductive-bigcn.py","file_url":"https://github.com/bywmm/Bi-GCN/blob/HEAD/transductive-bigcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ac4a1493301e71a","mcp_get_code":{"code_sha256":"4ac4a1493301e71a"}},{"arxiv_id":"2010.05700","paper":"/paper/reformulating-unsupervised-style-transfer-as","title":"Reformulating Unsupervised Style Transfer as Paraphrase Generation","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martiansideofthemoon/style-transfer-paraphrase","path":"style_paraphrase/run_lm_finetuning.py","file_url":"https://github.com/martiansideofthemoon/style-transfer-paraphrase/blob/HEAD/style_paraphrase/run_lm_finetuning.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac6daf9ad34bb23b","mcp_get_code":{"code_sha256":"ac6daf9ad34bb23b"}},{"arxiv_id":"2010.04159","paper":"/paper/deformable-detr-deformable-transformers-for-1","title":"Deformable DETR: Deformable Transformers for End-to-End Object Detection","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cedric-Perauer/Deformable_Detr_PIL","path":"datasets/coco_eval.py","file_url":"https://github.com/Cedric-Perauer/Deformable_Detr_PIL/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"2010.04104","paper":"/paper/learning-the-pareto-front-with-hypernetworks-1","title":"Learning the Pareto Front with Hypernetworks","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvivNavon/pareto-hypernetworks","path":"experiments/multimnist/trainer.py","file_url":"https://github.com/AvivNavon/pareto-hypernetworks/blob/HEAD/experiments/multimnist/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42e224ceb49416b5","mcp_get_code":{"code_sha256":"42e224ceb49416b5"}},{"arxiv_id":"2010.01440","paper":"/paper/uncertainty-aware-multi-modal-ensembling-for","title":"Uncertainty-Aware Multi-Modal Ensembling for Severity Prediction of Alzheimer's Dementia","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wazeerzulfikar/alzheimers-dementia","path":"evaluator.py","file_url":"https://github.com/wazeerzulfikar/alzheimers-dementia/blob/HEAD/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"90a5493ae934738a","mcp_get_code":{"code_sha256":"90a5493ae934738a"}},{"arxiv_id":"2010.00633","paper":"/paper/discontinuous-constituent-parsing-as-sequence","title":"Discontinuous Constituent Parsing as Sequence Labeling","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aghie/disco2labels","path":"run_token_classifier.py","file_url":"https://github.com/aghie/disco2labels/blob/HEAD/run_token_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2def652050ab186","mcp_get_code":{"code_sha256":"a2def652050ab186"}},{"arxiv_id":"2009.05204","paper":"/paper/transfer-learning-of-graph-neural-networks","title":"Transfer Learning of Graph Neural Networks with Ego-graph Information Maximization","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GentleZhu/EGI","path":"run_airport.py","file_url":"https://github.com/GentleZhu/EGI/blob/HEAD/run_airport.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":"ff48cfbf50b51f67","mcp_get_code":{"code_sha256":"ff48cfbf50b51f67"}},{"arxiv_id":"2009.03488","paper":"/paper/adversarial-attack-on-large-scale-graph","title":"Adversarial Attack on Large Scale Graph","date":"2020-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EdisonLeeeee/SGAttack","path":"src/classifier/gcn.py","file_url":"https://github.com/EdisonLeeeee/SGAttack/blob/HEAD/src/classifier/gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c4323683a7d35f4","mcp_get_code":{"code_sha256":"2c4323683a7d35f4"}},{"arxiv_id":"2008.13751","paper":"/paper/plug-and-play-image-restoration-with-deep","title":"Plug-and-Play Image Restoration with Deep Denoiser Prior","date":"2020-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HedgehogCode/denoising-gan","path":"dngan/training.py","file_url":"https://github.com/HedgehogCode/denoising-gan/blob/HEAD/dngan/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"164ed0ee1bf2880d","mcp_get_code":{"code_sha256":"164ed0ee1bf2880d"}},{"arxiv_id":"2008.03781","paper":"/paper/semeval-2020-task-8-memotion-analysis-the","title":"SemEval-2020 Task 8: Memotion Analysis -- The Visuo-Lingual Metaphor!","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terenceylchow124/Meme-MultiModal","path":"utils/util_train.py","file_url":"https://github.com/terenceylchow124/Meme-MultiModal/blob/HEAD/utils/util_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cac98d7828027619","mcp_get_code":{"code_sha256":"cac98d7828027619"}},{"arxiv_id":"2008.03781","paper":"/paper/semeval-2020-task-8-memotion-analysis-the","title":"SemEval-2020 Task 8: Memotion Analysis -- The Visuo-Lingual Metaphor!","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terenceylchow124/Meme-MultiModal","path":"utils/util_train_reddit.py","file_url":"https://github.com/terenceylchow124/Meme-MultiModal/blob/HEAD/utils/util_train_reddit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"53c1a73f8e087319","mcp_get_code":{"code_sha256":"53c1a73f8e087319"}},{"arxiv_id":"2008.02275","paper":"/paper/aligning-ai-with-shared-human-values","title":"Aligning AI With Shared Human Values","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/ethics","path":"commonsense/tune.py","file_url":"https://github.com/hendrycks/ethics/blob/HEAD/commonsense/tune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fadb6a8d686441d3","mcp_get_code":{"code_sha256":"fadb6a8d686441d3"}},{"arxiv_id":"2008.00077","paper":"/paper/neural-architecture-search-in-graph-neural","title":"Neural Architecture Search in Graph Neural Networks","date":"2020-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mhnnunes/nas_gnn","path":"graphnas/gnn_model_manager.py","file_url":"https://github.com/mhnnunes/nas_gnn/blob/HEAD/graphnas/gnn_model_manager.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":"20568d7a0cb74f25","mcp_get_code":{"code_sha256":"20568d7a0cb74f25"}},{"arxiv_id":"2007.12770","paper":"/paper/babyai-1-1","title":"BabyAI 1.1","date":"2020-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mila-udem/babyai","path":"babyai/evaluate.py","file_url":"https://github.com/mila-udem/babyai/blob/HEAD/babyai/evaluate.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":"5ddbfe9ab59cd4a4","mcp_get_code":{"code_sha256":"5ddbfe9ab59cd4a4"}},{"arxiv_id":"2007.07247","paper":"/paper/multiview-detection-with-feature-perspective","title":"Multiview Detection with Feature Perspective Transformation","date":"2020-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hou-yz/MVDet","path":"multiview_detector/evaluation/evaluate.py","file_url":"https://github.com/hou-yz/MVDet/blob/HEAD/multiview_detector/evaluation/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"efc084e3bd24f19b","mcp_get_code":{"code_sha256":"efc084e3bd24f19b"}},{"arxiv_id":"2007.05721","paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/trees.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e4dfc5307cff9624","mcp_get_code":{"code_sha256":"e4dfc5307cff9624"}},{"arxiv_id":"2007.03179","paper":"/paper/ge-spmm-general-purpose-sparse-matrix-matrix","title":"GE-SpMM: General-purpose Sparse Matrix-Matrix Multiplication on GPUs for Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2020-07","title_source":"archive","repo":"hgyhungry/ge-spmm","path":"dgl-custom/benchmark/gcn/gcn_dgl.py","file_url":"https://github.com/hgyhungry/ge-spmm/blob/HEAD/dgl-custom/benchmark/gcn/gcn_dgl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff48cfbf50b51f67","mcp_get_code":{"code_sha256":"ff48cfbf50b51f67"}},{"arxiv_id":"2007.02419","paper":"/paper/attention-based-joint-detection-of-object-and","title":"Attention-based Joint Detection of Object and Semantic Part","date":"2020-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevalmorabia97/Object-and-Semantic-Part-Detection-pyTorch","path":"references/detection/engine.py","file_url":"https://github.com/kevalmorabia97/Object-and-Semantic-Part-Detection-pyTorch/blob/HEAD/references/detection/engine.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":"8759b128e38116fd","mcp_get_code":{"code_sha256":"8759b128e38116fd"}},{"arxiv_id":"2006.14806","paper":"/paper/turl-table-understanding-through","title":"TURL: Table Understanding through Representation Learning","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunlab-osu/TURL","path":"run_BERT_RE_finetuning.py","file_url":"https://github.com/sunlab-osu/TURL/blob/HEAD/run_BERT_RE_finetuning.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":"9ad8fa09f0972efd","mcp_get_code":{"code_sha256":"9ad8fa09f0972efd"}},{"arxiv_id":"2006.14744","paper":"/paper/graph-optimal-transport-for-cross-domain","title":"Graph Optimal Transport for Cross-Domain Alignment","date":"2020-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiqunChen0606/Graph-Optimal-Transport","path":"BAN_vqa/train_flickr.py","file_url":"https://github.com/LiqunChen0606/Graph-Optimal-Transport/blob/HEAD/BAN_vqa/train_flickr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ebb43b4af422c670","mcp_get_code":{"code_sha256":"ebb43b4af422c670"}},{"arxiv_id":"2006.14422","paper":"/paper/incremental-training-of-graph-neural-networks","title":"Lifelong Learning of Graph Neural Networks for Open-World Node Classification","date":"2020-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgalke/lifelong-learning","path":"run_experiment.py","file_url":"https://github.com/lgalke/lifelong-learning/blob/HEAD/run_experiment.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":"9c6d4b01c4c06fb3","mcp_get_code":{"code_sha256":"9c6d4b01c4c06fb3"}},{"arxiv_id":"2006.12719","paper":"/paper/unsupervised-evaluation-of-interactive-dialog","title":"Unsupervised Evaluation of Interactive Dialog with DialoGPT","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shikib/fed","path":"fed.py","file_url":"https://github.com/shikib/fed/blob/HEAD/fed.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"29e40aee83453db3","mcp_get_code":{"code_sha256":"29e40aee83453db3"}},{"arxiv_id":"2006.10222","paper":"/paper/class-attentive-diffusion-network-for-semi","title":"Class-Attentive Diffusion Network for Semi-Supervised Classification","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljin0429/CAD-Net","path":"src/demo_citeseer.py","file_url":"https://github.com/ljin0429/CAD-Net/blob/HEAD/src/demo_citeseer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b5d6d435f44063d","mcp_get_code":{"code_sha256":"1b5d6d435f44063d"}},{"arxiv_id":"2006.08852","paper":"/paper/counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AishwaryaSivaraman/COMET","path":"src/Models/DeepModel_AutoMPG.py","file_url":"https://github.com/AishwaryaSivaraman/COMET/blob/HEAD/src/Models/DeepModel_AutoMPG.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"549807c7945a40a1","mcp_get_code":{"code_sha256":"549807c7945a40a1"}},{"arxiv_id":"2006.06195","paper":"/paper/large-scale-adversarial-training-for-vision","title":"Large-Scale Adversarial Training for Vision-and-Language Representation Learning","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhegan27/VILLA","path":"inf_nlvr2.py","file_url":"https://github.com/zhegan27/VILLA/blob/HEAD/inf_nlvr2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"28e194bd5c984ae7","mcp_get_code":{"code_sha256":"28e194bd5c984ae7"}},{"arxiv_id":"2006.04558","paper":"/paper/fastspeech-2-fast-and-high-quality-end-to-end","title":"FastSpeech 2: Fast and High-Quality End-to-End Text to Speech","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishikksh20/FastSpeech2","path":"evaluation.py","file_url":"https://github.com/rishikksh20/FastSpeech2/blob/HEAD/evaluation.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":"644e4bb8a34cbee8","mcp_get_code":{"code_sha256":"644e4bb8a34cbee8"}},{"arxiv_id":"2006.01563","paper":"/paper/exploring-cross-sentence-contexts-for-named","title":"Exploring Cross-sentence Contexts for Named Entity Recognition with BERT","date":"2020-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jouniluoma/bert-ner-cmv","path":"conlleval.py","file_url":"https://github.com/jouniluoma/bert-ner-cmv/blob/HEAD/conlleval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"772a429073a9ffad","mcp_get_code":{"code_sha256":"772a429073a9ffad"}},{"arxiv_id":"2005.11650","paper":"/paper/connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnzhan/MTGNN","path":"train_single_step.py","file_url":"https://github.com/nnzhan/MTGNN/blob/HEAD/train_single_step.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"340b28ace9a170ef","mcp_get_code":{"code_sha256":"340b28ace9a170ef"}},{"arxiv_id":"2005.07877","paper":"/paper/micronet-for-efficient-language-modeling","title":"MicroNet for Efficient Language Modeling","date":"2020-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/neurips-micronet","path":"data.py","file_url":"https://github.com/mit-han-lab/neurips-micronet/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef9ad24f968b2da4","mcp_get_code":{"code_sha256":"ef9ad24f968b2da4"}},{"arxiv_id":"2005.00770","paper":"/paper/exploring-and-predicting-transferability","title":"Exploring and Predicting Transferability across NLP Tasks","date":"2020-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuvuumass/task-transferability","path":"run_finetuning_CR.py","file_url":"https://github.com/tuvuumass/task-transferability/blob/HEAD/run_finetuning_CR.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":"e638def88775edeb","mcp_get_code":{"code_sha256":"e638def88775edeb"}},{"arxiv_id":"2004.11727","paper":"/paper/coach-a-coarse-to-fine-approach-for-cross","title":"Coach: A Coarse-to-Fine Approach for Cross-domain Slot Filling","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zliucr/coach","path":"src/conll2002_metrics.py","file_url":"https://github.com/zliucr/coach/blob/HEAD/src/conll2002_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed7ede0eaeef935b","mcp_get_code":{"code_sha256":"ed7ede0eaeef935b"}},{"arxiv_id":"2004.09015","paper":"/paper/incorporating-external-knowledge-through-pre","title":"Incorporating External Knowledge through Pre-training for Natural Language to Code Generation","date":"2020-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neulab/external-knowledge-codegen","path":"evaluation.py","file_url":"https://github.com/neulab/external-knowledge-codegen/blob/HEAD/evaluation.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":"3115c02671dad0f4","mcp_get_code":{"code_sha256":"3115c02671dad0f4"}},{"arxiv_id":"2004.03116","paper":"/paper/a-sentence-cloze-dataset-for-chinese-machine","title":"A Sentence Cloze Dataset for Chinese Machine Reading Comprehension","date":"2020-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymcui/cmrc2019","path":"eval/cmrc2019_evaluate.py","file_url":"https://github.com/ymcui/cmrc2019/blob/HEAD/eval/cmrc2019_evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"code_sha256_prefix":"ba35d63536a11237","mcp_get_code":{"code_sha256":"ba35d63536a11237"}},{"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/models/tf_utils.py","file_url":"https://github.com/skx300/DyHATR/blob/HEAD/src/models/tf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a842f5654d7a218","mcp_get_code":{"code_sha256":"3a842f5654d7a218"}},{"arxiv_id":"2003.10477","paper":"/paper/distillating-knowledge-from-graph","title":"Distilling Knowledge from Graph Convolutional Networks","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihollywhy/DistillGCN.PyTorch","path":"utils.py","file_url":"https://github.com/ihollywhy/DistillGCN.PyTorch/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":"adade861c08470cb","mcp_get_code":{"code_sha256":"adade861c08470cb"}},{"arxiv_id":"2003.03564","paper":"/paper/ternary-compression-for-communication","title":"Ternary Compression for Communication-Efficient Federated Learning","date":"2020-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VeritasXu/Ternary-Federated","path":"utils/Evaluate.py","file_url":"https://github.com/VeritasXu/Ternary-Federated/blob/HEAD/utils/Evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4c9d08b2b9135f96","mcp_get_code":{"code_sha256":"4c9d08b2b9135f96"}},{"arxiv_id":"2003.02245","paper":"/paper/data-augmentation-using-pre-trained","title":"Data Augmentation using Pre-trained Transformer Models","date":"2020-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megagonlabs/rotom","path":"ditto/dm.py","file_url":"https://github.com/megagonlabs/rotom/blob/HEAD/ditto/dm.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":"b75fcb376dd932d9","mcp_get_code":{"code_sha256":"b75fcb376dd932d9"}},{"arxiv_id":"2002.12186","paper":"/paper/university-1652-a-multi-view-multi-source","title":"University-1652: A Multi-view Multi-source Benchmark for Drone-based Geo-localization","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wtyhub/LPN","path":"evaluate_gpu.py","file_url":"https://github.com/wtyhub/LPN/blob/HEAD/evaluate_gpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89cbd25ccde3f43c","mcp_get_code":{"code_sha256":"89cbd25ccde3f43c"}},{"arxiv_id":"2002.12186","paper":"/paper/university-1652-a-multi-view-multi-source","title":"University-1652: A Multi-view Multi-source Benchmark for Drone-based Geo-localization","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layumi/AICIty-reID-2020","path":"pytorch/evaluate_gpu.py","file_url":"https://github.com/layumi/AICIty-reID-2020/blob/HEAD/pytorch/evaluate_gpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0d6e985c6341bc25","mcp_get_code":{"code_sha256":"0d6e985c6341bc25"}},{"arxiv_id":"2002.12186","paper":"/paper/university-1652-a-multi-view-multi-source","title":"University-1652: A Multi-view Multi-source Benchmark for Drone-based Geo-localization","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layumi/AICIty-reID-2020","path":"pytorch/evaluate_rerank.py","file_url":"https://github.com/layumi/AICIty-reID-2020/blob/HEAD/pytorch/evaluate_rerank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ae6281b1a572dfc8","mcp_get_code":{"code_sha256":"ae6281b1a572dfc8"}},{"arxiv_id":"2002.08274","paper":"/paper/outcome-correlation-in-graph-neural-network","title":"Residual Correlation in Graph Neural Network Regression","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junwenbai/correlation-gnn","path":"gat/train_cgnn.py","file_url":"https://github.com/junwenbai/correlation-gnn/blob/HEAD/gat/train_cgnn.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":"4c3c37173031e7f8","mcp_get_code":{"code_sha256":"4c3c37173031e7f8"}},{"arxiv_id":"2002.06440","paper":"/paper/federated-learning-with-matched-averaging-1","title":"Federated Learning with Matched Averaging","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/FedMA","path":"language_modeling/language_main.py","file_url":"https://github.com/IBM/FedMA/blob/HEAD/language_modeling/language_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4f89ab2ff25bf83","mcp_get_code":{"code_sha256":"a4f89ab2ff25bf83"}},{"arxiv_id":"2002.02925","paper":"/paper/bert-of-theseus-compressing-bert-by","title":"BERT-of-Theseus: Compressing BERT by Progressive Module Replacing","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetRunner/BERT-of-Theseus","path":"run_glue.py","file_url":"https://github.com/JetRunner/BERT-of-Theseus/blob/HEAD/run_glue.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":"f19fe05d830bc91a","mcp_get_code":{"code_sha256":"f19fe05d830bc91a"}},{"arxiv_id":"2002.02925","paper":"/paper/bert-of-theseus-compressing-bert-by","title":"BERT-of-Theseus: Compressing BERT by Progressive Module Replacing","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JetRunner/BERT-of-Theseus","path":"glue_script/run_prediction.py","file_url":"https://github.com/JetRunner/BERT-of-Theseus/blob/HEAD/glue_script/run_prediction.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":"e39ee757d6852410","mcp_get_code":{"code_sha256":"e39ee757d6852410"}},{"arxiv_id":"2002.01808","paper":"/paper/k-adapter-infusing-knowledge-into-pre-trained","title":"K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapters","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/K-Adapter","path":"fac-adapter.py","file_url":"https://github.com/microsoft/K-Adapter/blob/HEAD/fac-adapter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"264258aac6e8741c","mcp_get_code":{"code_sha256":"264258aac6e8741c"}},{"arxiv_id":"2002.01808","paper":"/paper/k-adapter-infusing-knowledge-into-pre-trained","title":"K-Adapter: Infusing Knowledge into Pre-Trained Models with Adapters","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/K-Adapter","path":"lin-adapter.py","file_url":"https://github.com/microsoft/K-Adapter/blob/HEAD/lin-adapter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e86198a445a228c","mcp_get_code":{"code_sha256":"0e86198a445a228c"}},{"arxiv_id":"2002.01685","paper":"/paper/parsing-as-pretraining","title":"Parsing as Pretraining","date":"2020-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aghie/parsing-as-pretraining","path":"dep2labels/conll17_ud_eval.py","file_url":"https://github.com/aghie/parsing-as-pretraining/blob/HEAD/dep2labels/conll17_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb5ea19799e31ba8","mcp_get_code":{"code_sha256":"cb5ea19799e31ba8"}},{"arxiv_id":"2001.04193","paper":"/paper/deep-learning-for-person-re-identification-a","title":"Deep Learning for Person Re-identification: A Survey and Outlook","date":"2020-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"3713e246e333c32a","mcp_get_code":{"code_sha256":"3713e246e333c32a"}},{"arxiv_id":"1912.02315","paper":"/paper/12-in-1-multi-task-vision-and-language","title":"12-in-1: Multi-Task Vision and Language Representation Learning","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johntiger1/multitask_multimodal","path":"evaluation/eval_coco_retrieval.py","file_url":"https://github.com/johntiger1/multitask_multimodal/blob/HEAD/evaluation/eval_coco_retrieval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"2454efa3ee5d7949","mcp_get_code":{"code_sha256":"2454efa3ee5d7949"}},{"arxiv_id":"1912.02315","paper":"/paper/12-in-1-multi-task-vision-and-language","title":"12-in-1: Multi-Task Vision and Language Representation Learning","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johntiger1/multitask_multimodal","path":"evaluation/eval_concap_retrieval.py","file_url":"https://github.com/johntiger1/multitask_multimodal/blob/HEAD/evaluation/eval_concap_retrieval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"cee4c7bd2fc134c9","mcp_get_code":{"code_sha256":"cee4c7bd2fc134c9"}},{"arxiv_id":"1912.02315","paper":"/paper/12-in-1-multi-task-vision-and-language","title":"12-in-1: Multi-Task Vision and Language Representation Learning","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johntiger1/multitask_multimodal","path":"evaluation/eval_refer_expression.py","file_url":"https://github.com/johntiger1/multitask_multimodal/blob/HEAD/evaluation/eval_refer_expression.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"701dca7f22198e4f","mcp_get_code":{"code_sha256":"701dca7f22198e4f"}},{"arxiv_id":"1911.04738","paper":"/paper/smiles-transformer-pre-trained-molecular","title":"SMILES Transformer: Pre-trained Molecular Fingerprint for Low Data Drug Discovery","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSPsleeporg/smiles-transformer","path":"smiles_transformer/pretrain_rnn.py","file_url":"https://github.com/DSPsleeporg/smiles-transformer/blob/HEAD/smiles_transformer/pretrain_rnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b590b0909ace188","mcp_get_code":{"code_sha256":"1b590b0909ace188"}},{"arxiv_id":"1911.04738","paper":"/paper/smiles-transformer-pre-trained-molecular","title":"SMILES Transformer: Pre-trained Molecular Fingerprint for Low Data Drug Discovery","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSPsleeporg/smiles-transformer","path":"smiles_transformer/pretrain_trfm.py","file_url":"https://github.com/DSPsleeporg/smiles-transformer/blob/HEAD/smiles_transformer/pretrain_trfm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"81f257af8c649750","mcp_get_code":{"code_sha256":"81f257af8c649750"}},{"arxiv_id":"1910.14192","paper":"/paper/transferable-end-to-end-aspect-based","title":"Transferable End-to-End Aspect-based Sentiment Analysis with Selective Adversarial Learning","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsqmlzno1/Transferable-E2E-ABSA","path":"evals.py","file_url":"https://github.com/hsqmlzno1/Transferable-E2E-ABSA/blob/HEAD/evals.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"accee1a31b1be09b","mcp_get_code":{"code_sha256":"accee1a31b1be09b"}},{"arxiv_id":"1910.13466","paper":"/paper/ordered-memory","title":"Ordered Memory","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/Ordered-Memory","path":"sentiment.py","file_url":"https://github.com/yikangshen/Ordered-Memory/blob/HEAD/sentiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57cbf02adf8b391c","mcp_get_code":{"code_sha256":"57cbf02adf8b391c"}},{"arxiv_id":"1910.11006","paper":"/paper/word-level-deep-sign-language-recognition","title":"Word-level Deep Sign Language Recognition from Video: A New Large-scale Dataset and Methods Comparison","date":"2019-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matyasbohacek/spoter","path":"spoter/utils.py","file_url":"https://github.com/matyasbohacek/spoter/blob/HEAD/spoter/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":"238be43301fa3e76","mcp_get_code":{"code_sha256":"238be43301fa3e76"}},{"arxiv_id":"1910.09658","paper":"/paper/optimal-power-flow-using-graph-neural","title":"Optimal Power Flow Using Graph Neural Networks","date":"2019-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomyvazquez/doraa-uy","path":"no-supervisado/IEEE/entrenamiento/src/train_eval.py","file_url":"https://github.com/tomyvazquez/doraa-uy/blob/HEAD/no-supervisado/IEEE/entrenamiento/src/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"348e4f04f679cb34","mcp_get_code":{"code_sha256":"348e4f04f679cb34"}},{"arxiv_id":"1910.05453","paper":"/paper/vq-wav2vec-self-supervised-learning-of-1","title":"vq-wav2vec: Self-Supervised Learning of Discrete Speech Representations","date":"2019-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/textual-kd-slu","path":"am_pretraining.py","file_url":"https://github.com/clovaai/textual-kd-slu/blob/HEAD/am_pretraining.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":"5c5c31e93ff15b46","mcp_get_code":{"code_sha256":"5c5c31e93ff15b46"}},{"arxiv_id":"1910.04928","paper":"/paper/old-dog-learns-new-tricks-randomized-ucb-for","title":"Old Dog Learns New Tricks: Randomized UCB for Bandit Problems","date":"2019-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vaswanis/randucb","path":"MAB.py","file_url":"https://github.com/vaswanis/randucb/blob/HEAD/MAB.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e52fdb9893d7108","mcp_get_code":{"code_sha256":"8e52fdb9893d7108"}},{"arxiv_id":"1910.04928","paper":"/paper/old-dog-learns-new-tricks-randomized-ucb-for","title":"Old Dog Learns New Tricks: Randomized UCB for Bandit Problems","date":"2019-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vaswanis/randucb","path":"Lin-Bandit.py","file_url":"https://github.com/vaswanis/randucb/blob/HEAD/Lin-Bandit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ee1db4340aaa0804","mcp_get_code":{"code_sha256":"ee1db4340aaa0804"}},{"arxiv_id":"1910.00760","paper":"/paper/efficient-graph-generation-with-graph","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrjconan/GRAN","path":"runner/gran_runner.py","file_url":"https://github.com/lrjconan/GRAN/blob/HEAD/runner/gran_runner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79386155a1b3f4d1","mcp_get_code":{"code_sha256":"79386155a1b3f4d1"}},{"arxiv_id":"1909.11740","paper":"/paper/uniter-learning-universal-image-text-1","title":"UNITER: UNiversal Image-TExt Representation Learning","date":"2019-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SDLZY/VCR_Align","path":"inf_nlvr2.py","file_url":"https://github.com/SDLZY/VCR_Align/blob/HEAD/inf_nlvr2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"347953d8bd5d46e8","mcp_get_code":{"code_sha256":"347953d8bd5d46e8"}},{"arxiv_id":"1909.01377","paper":"/paper/deep-equilibrium-models","title":"Deep Equilibrium Models","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ee0aeb0dbfe062f7","mcp_get_code":{"code_sha256":"ee0aeb0dbfe062f7"}},{"arxiv_id":"1908.11515","paper":"/paper/practical-and-robust-privacy-amplification","title":"Improving Utility and Security of the Shuffler-based Differential Privacy","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vvv214/LDP_Protocols","path":"pem/exp.py","file_url":"https://github.com/vvv214/LDP_Protocols/blob/HEAD/pem/exp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"deb84a6ea4773da4","mcp_get_code":{"code_sha256":"deb84a6ea4773da4"}},{"arxiv_id":"1907.10719","paper":"/paper/layoutvae-stochastic-scene-layout-generation","title":"LayoutVAE: Stochastic Scene Layout Generation From a Label Set","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kampta/DeepLayout","path":"layout_vae/train_counts.py","file_url":"https://github.com/kampta/DeepLayout/blob/HEAD/layout_vae/train_counts.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":"cd7868cef4499a46","mcp_get_code":{"code_sha256":"cd7868cef4499a46"}},{"arxiv_id":"1906.09777","paper":"/paper/a-tensorized-transformer-for-language","title":"A Tensorized Transformer for Language Modeling","date":"2019-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szhangtju/The-compression-of-Transformer","path":"BTD-Transformer/train_upload.py","file_url":"https://github.com/szhangtju/The-compression-of-Transformer/blob/HEAD/BTD-Transformer/train_upload.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50a00e6cae0509fb","mcp_get_code":{"code_sha256":"50a00e6cae0509fb"}},{"arxiv_id":"1906.09525","paper":"/paper/defending-against-adversarial-examples-with-k","title":"Defending Against Adversarial Examples with K-Nearest Neighbor","date":"2019-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chawins/knn-defense","path":"train_scripts/train_mnist.py","file_url":"https://github.com/chawins/knn-defense/blob/HEAD/train_scripts/train_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f6237be378b4e1b","mcp_get_code":{"code_sha256":"2f6237be378b4e1b"}},{"arxiv_id":"1906.03563","paper":"/paper/beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjksjtu/minmax-adv","path":"neurips21/ens_attack.py","file_url":"https://github.com/wangjksjtu/minmax-adv/blob/HEAD/neurips21/ens_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"213267d02b7820b8","mcp_get_code":{"code_sha256":"213267d02b7820b8"}},{"arxiv_id":"1906.03563","paper":"/paper/beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjksjtu/minmax-adv","path":"neurips21/trans_attack.py","file_url":"https://github.com/wangjksjtu/minmax-adv/blob/HEAD/neurips21/trans_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e607dfc06f869a5d","mcp_get_code":{"code_sha256":"e607dfc06f869a5d"}},{"arxiv_id":"1906.03563","paper":"/paper/beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjksjtu/minmax-adv","path":"neurips21/uni_attack.py","file_url":"https://github.com/wangjksjtu/minmax-adv/blob/HEAD/neurips21/uni_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"247982bef8192964","mcp_get_code":{"code_sha256":"247982bef8192964"}},{"arxiv_id":"1906.00642","paper":"/paper/190600642","title":"A Variational Approach for Learning from Positive and Unlabeled Data","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HC-Feynman/vpu","path":"vpu.py","file_url":"https://github.com/HC-Feynman/vpu/blob/HEAD/vpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5102a80d13d571ab","mcp_get_code":{"code_sha256":"5102a80d13d571ab"}},{"arxiv_id":"1905.11946","paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"narumiruna/efficientnet-pytorch","path":"evaluate.py","file_url":"https://github.com/narumiruna/efficientnet-pytorch/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6788a36cc98e859a","mcp_get_code":{"code_sha256":"6788a36cc98e859a"}},{"arxiv_id":"1905.11455","paper":"/paper/capsule-routing-via-variational-bayes","title":"Capsule Routing via Variational Bayes","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabio-deep/Variational-Capsule-Routing","path":"src/evaluate.py","file_url":"https://github.com/fabio-deep/Variational-Capsule-Routing/blob/HEAD/src/evaluate.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":"077ff9d535eedac5","mcp_get_code":{"code_sha256":"077ff9d535eedac5"}},{"arxiv_id":"1905.07854","paper":"/paper/kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LunaBlack/KGAT-pytorch","path":"main_kgat.py","file_url":"https://github.com/LunaBlack/KGAT-pytorch/blob/HEAD/main_kgat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a27969aaabab082","mcp_get_code":{"code_sha256":"9a27969aaabab082"}},{"arxiv_id":"1905.07830","paper":"/paper/hellaswag-can-a-machine-really-finish-your","title":"HellaSwag: Can a Machine Really Finish Your Sentence?","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PlusLabNLP/Plot-guided-Coherence-Evaluation","path":"run_glue.py","file_url":"https://github.com/PlusLabNLP/Plot-guided-Coherence-Evaluation/blob/HEAD/run_glue.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":"ca9c20fdb4d8828a","mcp_get_code":{"code_sha256":"ca9c20fdb4d8828a"}},{"arxiv_id":"1905.00953","paper":"/paper/omni-scale-feature-learning-for-person-re","title":"Omni-Scale Feature Learning for Person Re-Identification","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"InnovArul/vidreid_cosegmentation","path":"src/eval_metrics.py","file_url":"https://github.com/InnovArul/vidreid_cosegmentation/blob/HEAD/src/eval_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":"2267200bffdf674d","mcp_get_code":{"code_sha256":"2267200bffdf674d"}},{"arxiv_id":"1904.09981","paper":"/paper/graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphNAS/GraphNAS-simple","path":"graphnas/gnn_model_manager.py","file_url":"https://github.com/GraphNAS/GraphNAS-simple/blob/HEAD/graphnas/gnn_model_manager.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":"20568d7a0cb74f25","mcp_get_code":{"code_sha256":"20568d7a0cb74f25"}},{"arxiv_id":"1904.07223","paper":"/paper/joint-discriminative-and-generative-learning","title":"Joint Discriminative and Generative Learning for Person Re-identification","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangsikai/Person_reID_baseline_pytorch","path":"evaluate.py","file_url":"https://github.com/jiangsikai/Person_reID_baseline_pytorch/blob/HEAD/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3713e246e333c32a","mcp_get_code":{"code_sha256":"3713e246e333c32a"}},{"arxiv_id":"1904.07223","paper":"/paper/joint-discriminative-and-generative-learning","title":"Joint Discriminative and Generative Learning for Person Re-identification","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lsh110600/person_re_id","path":"evaluate_gpu.py","file_url":"https://github.com/lsh110600/person_re_id/blob/HEAD/evaluate_gpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa35d5d95fb54d49","mcp_get_code":{"code_sha256":"aa35d5d95fb54d49"}},{"arxiv_id":"1904.07223","paper":"/paper/joint-discriminative-and-generative-learning","title":"Joint Discriminative and Generative Learning for Person Re-identification","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Proxim123/person-reID-No1-","path":"evaluate_rerank.py","file_url":"https://github.com/Proxim123/person-reID-No1-/blob/HEAD/evaluate_rerank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3d73c7bc76855c8","mcp_get_code":{"code_sha256":"c3d73c7bc76855c8"}},{"arxiv_id":"1904.07223","paper":"/paper/joint-discriminative-and-generative-learning","title":"Joint Discriminative and Generative Learning for Person Re-identification","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taroogura/Person_reID_baseline_pytorch","path":"evaluate_gpu.py","file_url":"https://github.com/taroogura/Person_reID_baseline_pytorch/blob/HEAD/evaluate_gpu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a87e51760037d9e3","mcp_get_code":{"code_sha256":"a87e51760037d9e3"}},{"arxiv_id":"1904.02232","paper":"/paper/bert-post-training-for-review-reading","title":"BERT Post-Training for Review Reading Comprehension and Aspect-based Sentiment Analysis","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"howardhsu/BERT-for-RRC-ABSA","path":"pytorch-pretrained-bert/eval/evaluate_ae.py","file_url":"https://github.com/howardhsu/BERT-for-RRC-ABSA/blob/HEAD/pytorch-pretrained-bert/eval/evaluate_ae.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":"aeb20ed962ccdd7f","mcp_get_code":{"code_sha256":"aeb20ed962ccdd7f"}},{"arxiv_id":"1904.02099","paper":"/paper/75-languages-1-model-parsing-universal","title":"75 Languages, 1 Model: Parsing Universal Dependencies Universally","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyperparticle/udify","path":"udify/dataset_readers/conll18_ud_eval.py","file_url":"https://github.com/hyperparticle/udify/blob/HEAD/udify/dataset_readers/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"245d8f594031798b","mcp_get_code":{"code_sha256":"245d8f594031798b"}},{"arxiv_id":"1903.12136","paper":"/paper/distilling-task-specific-knowledge-from-bert","title":"Distilling Task-Specific Knowledge from BERT into Simple Neural Networks","date":"2019-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/d-bert","path":"dbert/distill/run/distill_birnn.py","file_url":"https://github.com/castorini/d-bert/blob/HEAD/dbert/distill/run/distill_birnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"502edb147c17e8f6","mcp_get_code":{"code_sha256":"502edb147c17e8f6"}},{"arxiv_id":"1903.08094","paper":"/paper/corners-for-layout-end-to-end-layout-recovery","title":"Corners for Layout: End-to-End Layout Recovery from 360 Images","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"palver7/CFLPytorch","path":"train_CFL.py","file_url":"https://github.com/palver7/CFLPytorch/blob/HEAD/train_CFL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dc00c21173035bf4","mcp_get_code":{"code_sha256":"dc00c21173035bf4"}},{"arxiv_id":"1903.08094","paper":"/paper/corners-for-layout-end-to-end-layout-recovery","title":"Corners for Layout: End-to-End Layout Recovery from 360 Images","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"palver7/CFLPytorch","path":"test_CFL.py","file_url":"https://github.com/palver7/CFLPytorch/blob/HEAD/test_CFL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"34e4a00890d36d76","mcp_get_code":{"code_sha256":"34e4a00890d36d76"}},{"arxiv_id":"1903.08094","paper":"/paper/corners-for-layout-end-to-end-layout-recovery","title":"Corners for Layout: End-to-End Layout Recovery from 360 Images","date":"2019-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cfernandezlab/CFL","path":"test_CFL.py","file_url":"https://github.com/cfernandezlab/CFL/blob/HEAD/test_CFL.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":"80caa8a5692f45a6","mcp_get_code":{"code_sha256":"80caa8a5692f45a6"}},{"arxiv_id":"1902.08605","paper":"/paper/centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabrielhuang/centroid-networks","path":"protonets/utils/model.py","file_url":"https://github.com/gabrielhuang/centroid-networks/blob/HEAD/protonets/utils/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22d34c26400fab75","mcp_get_code":{"code_sha256":"22d34c26400fab75"}},{"arxiv_id":"1902.04057","paper":"/paper/deep-autoregressive-models-for-the-efficient","title":"Deep autoregressive models for the efficient variational simulation of many-body quantum systems","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HUJI-Deep/FlowKet","path":"src/flowket/evaluation/evaluate.py","file_url":"https://github.com/HUJI-Deep/FlowKet/blob/HEAD/src/flowket/evaluation/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd87d86fe6e4f1c6","mcp_get_code":{"code_sha256":"bd87d86fe6e4f1c6"}},{"arxiv_id":"1901.08954","paper":"/paper/skip-ganomaly-skip-connected-and","title":"Skip-GANomaly: Skip Connected and Adversarially Trained Encoder-Decoder Anomaly Detection","date":"2019-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samet-akcay/skip-ganomaly","path":"lib/evaluate.py","file_url":"https://github.com/samet-akcay/skip-ganomaly/blob/HEAD/lib/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"345038078079cc36","mcp_get_code":{"code_sha256":"345038078079cc36"}},{"arxiv_id":"1812.00151","paper":"/paper/discrete-attacks-and-submodular-optimization","title":"Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification","date":"2018-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cecilialeiqi/adversarial_text","path":"src/train_LSTM.py","file_url":"https://github.com/cecilialeiqi/adversarial_text/blob/HEAD/src/train_LSTM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7939a30bf54f135","mcp_get_code":{"code_sha256":"d7939a30bf54f135"}},{"arxiv_id":"1811.11742","paper":"/paper/3d-human-pose-estimation-in-video-with","title":"3D human pose estimation in video with temporal convolutions and semi-supervised training","date":"2018-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipNoonan/OPVP3D","path":"run_wild.py","file_url":"https://github.com/philipNoonan/OPVP3D/blob/HEAD/run_wild.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"507ee77c01d06e70","mcp_get_code":{"code_sha256":"507ee77c01d06e70"}},{"arxiv_id":"1810.10191","paper":"/paper/making-sense-of-vision-and-touch-self","title":"Making Sense of Vision and Touch: Self-Supervised Learning of Multimodal Representations for Contact-Rich Tasks","date":"2018-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Henry1iu/ierg5350_rl_course_project","path":"multimodal/train_my_fusion_model.py","file_url":"https://github.com/Henry1iu/ierg5350_rl_course_project/blob/HEAD/multimodal/train_my_fusion_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e98d143c6058ff0d","mcp_get_code":{"code_sha256":"e98d143c6058ff0d"}},{"arxiv_id":"1810.08272","paper":"/paper/babyai-first-steps-towards-grounded-language","title":"BabyAI: A Platform to Study the Sample Efficiency of Grounded Language Learning","date":"2018-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MathijsMul/babyai-emergent-guidance","path":"babyai/evaluate.py","file_url":"https://github.com/MathijsMul/babyai-emergent-guidance/blob/HEAD/babyai/evaluate.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":"5ddbfe9ab59cd4a4","mcp_get_code":{"code_sha256":"5ddbfe9ab59cd4a4"}},{"arxiv_id":"1810.06394","paper":"/paper/parametrized-deep-q-networks-learning","title":"Parametrized Deep Q-Networks Learning: Reinforcement Learning with Discrete-Continuous Hybrid Action Space","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cycraig/MP-DQN","path":"run_platform_pdqn.py","file_url":"https://github.com/cycraig/MP-DQN/blob/HEAD/run_platform_pdqn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42cfe92e5593c56f","mcp_get_code":{"code_sha256":"42cfe92e5593c56f"}},{"arxiv_id":"1810.02720","paper":"/paper/tranx-a-transition-based-neural-abstract","title":"TRANX: A Transition-based Neural Abstract Syntax Parser for Semantic Parsing and Code Generation","date":"2018-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcyin/tranX","path":"evaluation.py","file_url":"https://github.com/pcyin/tranX/blob/HEAD/evaluation.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":"59e007a728de1c57","mcp_get_code":{"code_sha256":"59e007a728de1c57"}},{"arxiv_id":"1810.01222","paper":"/paper/cem-rl-combining-evolutionary-and-gradient-1","title":"CEM-RL: Combining evolutionary and gradient-based methods for policy search","date":"2018-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apourchot/CEM-RL","path":"es_grad.py","file_url":"https://github.com/apourchot/CEM-RL/blob/HEAD/es_grad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a3d26709949c0939","mcp_get_code":{"code_sha256":"a3d26709949c0939"}},{"arxiv_id":"1810.01222","paper":"/paper/cem-rl-combining-evolutionary-and-gradient-1","title":"CEM-RL: Combining evolutionary and gradient-based methods for policy search","date":"2018-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apourchot/CEM-RL","path":"distributed.py","file_url":"https://github.com/apourchot/CEM-RL/blob/HEAD/distributed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c53cbfe5f3c8aa9d","mcp_get_code":{"code_sha256":"c53cbfe5f3c8aa9d"}},{"arxiv_id":"1809.05255","paper":"/paper/sql-to-text-generation-with-graph-to-sequence","title":"SQL-to-Text Generation with Graph-to-Sequence Model","date":"2018-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/SQL-to-Text","path":"Graph2Seq-master/main/evaluator.py","file_url":"https://github.com/IBM/SQL-to-Text/blob/HEAD/Graph2Seq-master/main/evaluator.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":"4dde04be7ce0578e","mcp_get_code":{"code_sha256":"4dde04be7ce0578e"}},{"arxiv_id":"1809.04379","paper":"/paper/bayesian-semi-supervised-learning-with-graph","title":"Bayesian Semi-supervised Learning with Graph Gaussian Processes","date":"2018-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felixopolka/ggp-tf2","path":"ggp.py","file_url":"https://github.com/felixopolka/ggp-tf2/blob/HEAD/ggp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a04562f3f94fd90","mcp_get_code":{"code_sha256":"3a04562f3f94fd90"}},{"arxiv_id":"1808.08718","paper":"/paper/wide-activation-for-efficient-and-accurate","title":"Wide Activation for Efficient and Accurate Image Super-Resolution","date":"2018-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krasserm/super-resolution","path":"model/common.py","file_url":"https://github.com/krasserm/super-resolution/blob/HEAD/model/common.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":"e0f9b50298061760","mcp_get_code":{"code_sha256":"e0f9b50298061760"}},{"arxiv_id":"1808.07624","paper":"/paper/exploiting-rich-syntactic-information-for","title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model","date":"2018-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Text-to-LogicForm","path":"Graph2Seq-master/main/evaluator.py","file_url":"https://github.com/IBM/Text-to-LogicForm/blob/HEAD/Graph2Seq-master/main/evaluator.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":"4dde04be7ce0578e","mcp_get_code":{"code_sha256":"4dde04be7ce0578e"}},{"arxiv_id":"1807.09192","paper":"/paper/multicolumn-networks-for-face-recognition","title":"Multicolumn Networks for Face Recognition","date":"2018-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibendrup/MulticolumnNetwork","path":"evaluation.py","file_url":"https://github.com/ibendrup/MulticolumnNetwork/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f056a5748e3f7024","mcp_get_code":{"code_sha256":"f056a5748e3f7024"}},{"arxiv_id":"1806.08804","paper":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/reproduciblefedgnn","path":"federated_reproducibility/main_diffpool.py","file_url":"https://github.com/basiralab/reproduciblefedgnn/blob/HEAD/federated_reproducibility/main_diffpool.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e9d378dbb12714b","mcp_get_code":{"code_sha256":"1e9d378dbb12714b"}},{"arxiv_id":"1806.08804","paper":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/reproduciblefedgnn","path":"federated_reproducibility/main_gcn.py","file_url":"https://github.com/basiralab/reproduciblefedgnn/blob/HEAD/federated_reproducibility/main_gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96903513f7177254","mcp_get_code":{"code_sha256":"96903513f7177254"}},{"arxiv_id":"1806.03536","paper":"/paper/representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mori97/JKNet-dgl","path":"train_cora.py","file_url":"https://github.com/mori97/JKNet-dgl/blob/HEAD/train_cora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab0a016fefeb5192","mcp_get_code":{"code_sha256":"ab0a016fefeb5192"}},{"arxiv_id":"1805.11328","paper":"/paper/hamiltonian-variational-auto-encoder","title":"Hamiltonian Variational Auto-Encoder","date":"2018-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anthonycaterini/hvae-nips","path":"mnist/training.py","file_url":"https://github.com/anthonycaterini/hvae-nips/blob/HEAD/mnist/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f54cda60488d27a","mcp_get_code":{"code_sha256":"8f54cda60488d27a"}},{"arxiv_id":"1805.10190","paper":"/paper/snips-voice-platform-an-embedded-spoken","title":"Snips Voice Platform: an embedded Spoken Language Understanding system for private-by-design voice interfaces","date":"2018-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-agi/hicl","path":"src/conll2002_metrics.py","file_url":"https://github.com/ai-agi/hicl/blob/HEAD/src/conll2002_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed7ede0eaeef935b","mcp_get_code":{"code_sha256":"ed7ede0eaeef935b"}},{"arxiv_id":"1805.07932","paper":"/paper/bilinear-attention-networks","title":"Bilinear Attention Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jnhwkim/ban-vqa","path":"train_flickr.py","file_url":"https://github.com/jnhwkim/ban-vqa/blob/HEAD/train_flickr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"728c76c97b1bb97a","mcp_get_code":{"code_sha256":"728c76c97b1bb97a"}},{"arxiv_id":"1805.07917","paper":"/paper/evolution-guided-policy-gradient-in","title":"Evolution-Guided Policy Gradient in Reinforcement Learning","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apourchot/ERL-pytorch","path":"ERL.py","file_url":"https://github.com/apourchot/ERL-pytorch/blob/HEAD/ERL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c788860ce99c0fc9","mcp_get_code":{"code_sha256":"c788860ce99c0fc9"}},{"arxiv_id":"1805.06725","paper":"/paper/ganomaly-semi-supervised-anomaly-detection","title":"GANomaly: Semi-Supervised Anomaly Detection via Adversarial Training","date":"2018-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyHong/GANomaly-repl","path":"lib/evaluate.py","file_url":"https://github.com/rickyHong/GANomaly-repl/blob/HEAD/lib/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a32f5b6f251d152b","mcp_get_code":{"code_sha256":"a32f5b6f251d152b"}},{"arxiv_id":"1805.06725","paper":"/paper/ganomaly-semi-supervised-anomaly-detection","title":"GANomaly: Semi-Supervised Anomaly Detection via Adversarial Training","date":"2018-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samet-akcay/ganomaly","path":"lib/evaluate.py","file_url":"https://github.com/samet-akcay/ganomaly/blob/HEAD/lib/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"15c45ecba2721176","mcp_get_code":{"code_sha256":"15c45ecba2721176"}},{"arxiv_id":"1804.01438","paper":"/paper/learning-discriminative-features-with","title":"Learning Discriminative Features with Multiple Granularities for Person Re-Identification","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CoinCheung/SphereReID","path":"evaluate.py","file_url":"https://github.com/CoinCheung/SphereReID/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14ce86adfcabf648","mcp_get_code":{"code_sha256":"14ce86adfcabf648"}},{"arxiv_id":"1804.00823","paper":"/paper/graph2seq-graph-to-sequence-learning-with","title":"Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Graph2Seq","path":"main/evaluator.py","file_url":"https://github.com/IBM/Graph2Seq/blob/HEAD/main/evaluator.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":"4dde04be7ce0578e","mcp_get_code":{"code_sha256":"4dde04be7ce0578e"}},{"arxiv_id":"1803.10122","paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"doty-k/world_models","path":"05_cmaes.py","file_url":"https://github.com/doty-k/world_models/blob/HEAD/05_cmaes.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"704c9042ecbb6026","mcp_get_code":{"code_sha256":"704c9042ecbb6026"}},{"arxiv_id":"1803.10122","paper":"/paper/world-models","title":"World Models","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctallec/world-models","path":"traincontroller.py","file_url":"https://github.com/ctallec/world-models/blob/HEAD/traincontroller.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed841132809e417a","mcp_get_code":{"code_sha256":"ed841132809e417a"}},{"arxiv_id":"1803.08475","paper":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eharmonicminorperfect5thbelow/pytorch-attention-model-tsp","path":"tsp.py","file_url":"https://github.com/eharmonicminorperfect5thbelow/pytorch-attention-model-tsp/blob/HEAD/tsp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"92bf6e766294e2b3","mcp_get_code":{"code_sha256":"92bf6e766294e2b3"}},{"arxiv_id":"1802.03471","paper":"/paper/certified-robustness-to-adversarial-examples","title":"Certified Robustness to Adversarial Examples with Differential Privacy","date":"2018-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XintongHao/Robust-CNN-with-Differential-Privacy","path":"cw_attack/cw2_mnist/robust/robust_cw2_mnist.py","file_url":"https://github.com/XintongHao/Robust-CNN-with-Differential-Privacy/blob/HEAD/cw_attack/cw2_mnist/robust/robust_cw2_mnist.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":"add8d07b691ad9db","mcp_get_code":{"code_sha256":"add8d07b691ad9db"}},{"arxiv_id":"1711.10295","paper":"/paper/camera-style-adaptation-for-person-re","title":"Camera Style Adaptation for Person Re-identification","date":"2017-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"3713e246e333c32a","mcp_get_code":{"code_sha256":"3713e246e333c32a"}},{"arxiv_id":"1711.10295","paper":"/paper/camera-style-adaptation-for-person-re","title":"Camera Style Adaptation for Person Re-identification","date":"2017-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"aa35d5d95fb54d49","mcp_get_code":{"code_sha256":"aa35d5d95fb54d49"}},{"arxiv_id":"1711.05411","paper":"/paper/z-forcing-training-stochastic-recurrent","title":"Z-Forcing: Training Stochastic Recurrent Networks","date":"2017-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anirudh9119/zforcing_nips17","path":"train_timit.py","file_url":"https://github.com/anirudh9119/zforcing_nips17/blob/HEAD/train_timit.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aece41ebf23011df","mcp_get_code":{"code_sha256":"aece41ebf23011df"}},{"arxiv_id":"1711.05411","paper":"/paper/z-forcing-training-stochastic-recurrent","title":"Z-Forcing: Training Stochastic Recurrent Networks","date":"2017-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anirudh9119/zforcing_nips17","path":"train_blizzard.py","file_url":"https://github.com/anirudh9119/zforcing_nips17/blob/HEAD/train_blizzard.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d5dcce002c7d0e7","mcp_get_code":{"code_sha256":"0d5dcce002c7d0e7"}},{"arxiv_id":"1708.02182","paper":"/paper/regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vganesh46/awd-lstm-pytorch-implementation","path":"evaluate.py","file_url":"https://github.com/vganesh46/awd-lstm-pytorch-implementation/blob/HEAD/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"785b28e30c24782a","mcp_get_code":{"code_sha256":"785b28e30c24782a"}},{"arxiv_id":"1707.04585","paper":"/paper/the-reversible-residual-network","title":"The Reversible Residual Network: Backpropagation Without Storing Activations","date":"2017-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengye/revnet-public","path":"run_cifar_train.py","file_url":"https://github.com/renmengye/revnet-public/blob/HEAD/run_cifar_train.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"90df0fb80b7e2878","mcp_get_code":{"code_sha256":"90df0fb80b7e2878"}},{"arxiv_id":"1705.02304","paper":"/paper/deep-speaker-an-end-to-end-neural-speaker","title":"Deep Speaker: an End-to-End Neural Speaker Embedding System","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qqueing/DeepSpeaker-pytorch","path":"eval_metrics.py","file_url":"https://github.com/qqueing/DeepSpeaker-pytorch/blob/HEAD/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1283b5c46e6830d4","mcp_get_code":{"code_sha256":"1283b5c46e6830d4"}},{"arxiv_id":"1703.07737","paper":"/paper/in-defense-of-the-triplet-loss-for-person-re","title":"In Defense of the Triplet Loss for Person Re-Identification","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tbmoon/facenet","path":"eval_metrics.py","file_url":"https://github.com/tbmoon/facenet/blob/HEAD/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6bdfe104037e7f5","mcp_get_code":{"code_sha256":"a6bdfe104037e7f5"}},{"arxiv_id":"1703.04826","paper":"/paper/encoding-sentences-with-graph-convolutional","title":"Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling","date":"2017-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diegma/neural-dep-srl","path":"nnet/run/srl/util.py","file_url":"https://github.com/diegma/neural-dep-srl/blob/HEAD/nnet/run/srl/util.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":"4c479ebba02233aa","mcp_get_code":{"code_sha256":"4c479ebba02233aa"}},{"arxiv_id":"1611.08402","paper":"/paper/geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theswgong/MoNet","path":"graph/train_eval.py","file_url":"https://github.com/theswgong/MoNet/blob/HEAD/graph/train_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4ac4a1493301e71a","mcp_get_code":{"code_sha256":"4ac4a1493301e71a"}},{"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":"chantera/biaffineparser","path":"src/utils/conll.py","file_url":"https://github.com/chantera/biaffineparser/blob/HEAD/src/utils/conll.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":"75843fe2dd997b53","mcp_get_code":{"code_sha256":"75843fe2dd997b53"}},{"arxiv_id":"1610.04794","paper":"/paper/towards-k-means-friendly-spaces-simultaneous","title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering","date":"2016-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astorfi/deep-clustering-kmeans","path":"mnist.py","file_url":"https://github.com/astorfi/deep-clustering-kmeans/blob/HEAD/mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"756bcc3c5f2e18a4","mcp_get_code":{"code_sha256":"756bcc3c5f2e18a4"}},{"arxiv_id":"1609.07053","paper":"/paper/semantic-tagging-with-deep-residual-networks","title":"Semantic Tagging with Deep Residual Networks","date":"2016-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bjerva/semantic-tagging","path":"src/semtagger.py","file_url":"https://github.com/bjerva/semantic-tagging/blob/HEAD/src/semtagger.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":"d10a25997ca84219","mcp_get_code":{"code_sha256":"d10a25997ca84219"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KimMeen/GCN","path":"train_citeseer.py","file_url":"https://github.com/KimMeen/GCN/blob/HEAD/train_citeseer.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":"e16659d9314db70e","mcp_get_code":{"code_sha256":"e16659d9314db70e"}},{"arxiv_id":"1608.07017","paper":"/paper/ambient-sound-provides-supervision-for-visual","title":"Ambient Sound Provides Supervision for Visual Learning","date":"2016-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rowhanm/ambient-sound-self-supervision","path":"pretext_training/pretext_train_5_alexnet.py","file_url":"https://github.com/rowhanm/ambient-sound-self-supervision/blob/HEAD/pretext_training/pretext_train_5_alexnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"84d949f774e2ca7b","mcp_get_code":{"code_sha256":"84d949f774e2ca7b"}},{"arxiv_id":"1605.07148","paper":"/paper/backprop-kf-learning-discriminative","title":"Backprop KF: Learning Discriminative Deterministic State Estimators","date":"2016-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiboat/BackpropKF_Reproduction","path":"Position_FF.py","file_url":"https://github.com/tiboat/BackpropKF_Reproduction/blob/HEAD/Position_FF.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":"b5a832ef7260e48e","mcp_get_code":{"code_sha256":"b5a832ef7260e48e"}},{"arxiv_id":"1604.03901","paper":"/paper/single-image-depth-perception-in-the-wild","title":"Single-Image Depth Perception in the Wild","date":"2016-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Turmac/DIW_TF_Implementation","path":"evaluate.py","file_url":"https://github.com/Turmac/DIW_TF_Implementation/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4df26a74ab352e49","mcp_get_code":{"code_sha256":"4df26a74ab352e49"}},{"arxiv_id":"1603.07285","paper":"/paper/a-guide-to-convolution-arithmetic-for-deep","title":"A guide to convolution arithmetic for deep learning","date":"2016-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marbleton/FPGA_MNIST","path":"net/train_torch.py","file_url":"https://github.com/marbleton/FPGA_MNIST/blob/HEAD/net/train_torch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a4f2e9be92b2cff9","mcp_get_code":{"code_sha256":"a4f2e9be92b2cff9"}},{"arxiv_id":"1603.04351","paper":"/paper/simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elikip/bist-parser","path":"barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/elikip/bist-parser/blob/HEAD/barchybrid/src/utils/evaluation_script/conll17_ud_eval.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":"cb5ea19799e31ba8","mcp_get_code":{"code_sha256":"cb5ea19799e31ba8"}},{"arxiv_id":"1602.07868","paper":"/paper/weight-normalization-a-simple","title":"Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networks","date":"2016-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krasserm/wdsr","path":"model/common.py","file_url":"https://github.com/krasserm/wdsr/blob/HEAD/model/common.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":"e0f9b50298061760","mcp_get_code":{"code_sha256":"e0f9b50298061760"}},{"arxiv_id":"1512.02325","paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Guillem96/ssd-pytorch","path":"ssd/engine.py","file_url":"https://github.com/Guillem96/ssd-pytorch/blob/HEAD/ssd/engine.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a45aba9d5792ec4","mcp_get_code":{"code_sha256":"2a45aba9d5792ec4"}},{"arxiv_id":"1512.02325","paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Guillem96/ssd-pytorch","path":"ssd/coco/coco_eval.py","file_url":"https://github.com/Guillem96/ssd-pytorch/blob/HEAD/ssd/coco/coco_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c1eb870ebf9fea8","mcp_get_code":{"code_sha256":"7c1eb870ebf9fea8"}},{"arxiv_id":"1511.07247","paper":"/paper/netvlad-cnn-architecture-for-weakly","title":"NetVLAD: CNN architecture for weakly supervised place recognition","date":"2015-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uzh-rpg/netvlad_tf_open","path":"python/netvlad_tf/precision_recall.py","file_url":"https://github.com/uzh-rpg/netvlad_tf_open/blob/HEAD/python/netvlad_tf/precision_recall.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e2532b6c170f972","mcp_get_code":{"code_sha256":"3e2532b6c170f972"}},{"arxiv_id":"1511.04143","paper":"/paper/deep-reinforcement-learning-in-parameterized","title":"Deep Reinforcement Learning in Parameterized Action Space","date":"2015-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cycraig/MP-DQN","path":"run_soccer_pdqn.py","file_url":"https://github.com/cycraig/MP-DQN/blob/HEAD/run_soccer_pdqn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4acf2a2c58e59260","mcp_get_code":{"code_sha256":"4acf2a2c58e59260"}},{"arxiv_id":"1509.01644","paper":"/paper/reinforcement-learning-with-parameterized","title":"Reinforcement Learning with Parameterized Actions","date":"2015-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cycraig/MP-DQN","path":"run_goal_pdqn.py","file_url":"https://github.com/cycraig/MP-DQN/blob/HEAD/run_goal_pdqn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a07358c3feddc64a","mcp_get_code":{"code_sha256":"a07358c3feddc64a"}},{"arxiv_id":"1508.01745","paper":"/paper/semantically-conditioned-lstm-based-natural","title":"Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systems","date":"2015-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrcmoresi/sc-lstm","path":"run_woz3.py","file_url":"https://github.com/mrcmoresi/sc-lstm/blob/HEAD/run_woz3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c12514be986c9428","mcp_get_code":{"code_sha256":"c12514be986c9428"}},{"arxiv_id":"1508.01745","paper":"/paper/semantically-conditioned-lstm-based-natural","title":"Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systems","date":"2015-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andy194673/nlg-sclstm-multiwoz","path":"run_woz3.py","file_url":"https://github.com/andy194673/nlg-sclstm-multiwoz/blob/HEAD/run_woz3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"225f381678eb983a","mcp_get_code":{"code_sha256":"225f381678eb983a"}},{"arxiv_id":"1505.08075","paper":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yusics/bist-parser","path":"barchybrid/src/utils/evaluation_script/conll17_ud_eval.py","file_url":"https://github.com/Yusics/bist-parser/blob/HEAD/barchybrid/src/utils/evaluation_script/conll17_ud_eval.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":"cb5ea19799e31ba8","mcp_get_code":{"code_sha256":"cb5ea19799e31ba8"}},{"arxiv_id":"1505.08075","paper":"/paper/transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mstrise/dep2label","path":"dep2label/eval_dep/conll18_ud_eval.py","file_url":"https://github.com/mstrise/dep2label/blob/HEAD/dep2label/eval_dep/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"245d8f594031798b","mcp_get_code":{"code_sha256":"245d8f594031798b"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divamgupta/image-segmentation-keras","path":"keras_segmentation/models/unet.py","file_url":"https://github.com/divamgupta/image-segmentation-keras/blob/HEAD/keras_segmentation/models/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19c042c24d85b6fc","mcp_get_code":{"code_sha256":"19c042c24d85b6fc"}},{"arxiv_id":"1505.04597","paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maveric4/pr19aaw01","path":"SRC/keras_segmentation/models/unet.py","file_url":"https://github.com/Maveric4/pr19aaw01/blob/HEAD/SRC/keras_segmentation/models/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d5d22407d651c37","mcp_get_code":{"code_sha256":"5d5d22407d651c37"}},{"arxiv_id":"1504.00548","paper":"/paper/learning-to-understand-phrases-by-embedding","title":"Learning to Understand Phrases by Embedding the Dictionary","date":"2015-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/MultiRD","path":"ChineseReverseDictionary/code/evaluate.py","file_url":"https://github.com/thunlp/MultiRD/blob/HEAD/ChineseReverseDictionary/code/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"097ad2cea688e3d9","mcp_get_code":{"code_sha256":"097ad2cea688e3d9"}},{"arxiv_id":"1503.03832","paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LKLQQ/FaceNet","path":"src/eval_metrics.py","file_url":"https://github.com/LKLQQ/FaceNet/blob/HEAD/src/eval_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":"dd632e97794dba3d","mcp_get_code":{"code_sha256":"dd632e97794dba3d"}},{"arxiv_id":"1408.5882","paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wy-ei/Text-CNN","path":"trainer.py","file_url":"https://github.com/wy-ei/Text-CNN/blob/HEAD/trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a0485a6887c7747","mcp_get_code":{"code_sha256":"9a0485a6887c7747"}},{"arxiv_id":"1102.0075","paper":"/paper/vector-diffusion-maps-and-the-connection","title":"Vector Diffusion Maps and the Connection Laplacian","date":"2011-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clabat9/tangent-bundle-neural-networks","path":"Repo/Tangent_Bundle_NN/alegnnss/modules/evaluation.py","file_url":"https://github.com/clabat9/tangent-bundle-neural-networks/blob/HEAD/Repo/Tangent_Bundle_NN/alegnnss/modules/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":"72aff3af121b6f9a","mcp_get_code":{"code_sha256":"72aff3af121b6f9a"}},{"arxiv_id":"ijcai2025_0850","paper":null,"title":"arXiv:ijcai2025_0850","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hongyi-Lyu-MQ/SULI","path":"utils/eval_utils.py","file_url":"https://github.com/Hongyi-Lyu-MQ/SULI/blob/HEAD/utils/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"add2b780b8453438","mcp_get_code":{"code_sha256":"add2b780b8453438"}},{"arxiv_id":"ijcai2024_0084","paper":null,"title":"arXiv:ijcai2024_0084","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"116508/CF-Deformable-DETR","path":"datasets/coco_eval.py","file_url":"https://github.com/116508/CF-Deformable-DETR/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"ijcai2020_0541","paper":null,"title":"arXiv:ijcai2020_0541","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AntoineGourru/DNEmbedding","path":"models.py","file_url":"https://github.com/AntoineGourru/DNEmbedding/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14e3c294301c299d","mcp_get_code":{"code_sha256":"14e3c294301c299d"}},{"arxiv_id":"aaai_25976","paper":null,"title":"arXiv:aaai_25976","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"deepkashiwa20/MegaCRN","path":"model/metrics.py","file_url":"https://github.com/deepkashiwa20/MegaCRN/blob/HEAD/model/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ff1a78719215bef","mcp_get_code":{"code_sha256":"1ff1a78719215bef"}},{"arxiv_id":"aaai_25976","paper":null,"title":"arXiv:aaai_25976","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"deepkashiwa20/MegaCRN","path":"model_EXPYTKY/metrics.py","file_url":"https://github.com/deepkashiwa20/MegaCRN/blob/HEAD/model_EXPYTKY/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62b92919279383bc","mcp_get_code":{"code_sha256":"62b92919279383bc"}},{"arxiv_id":"aaai_16110","paper":null,"title":"arXiv:aaai_16110","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IIT-ML/AAAI21-relational-cell-classification","path":"CRC/pytorch_func.py","file_url":"https://github.com/IIT-ML/AAAI21-relational-cell-classification/blob/HEAD/CRC/pytorch_func.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":"8e02974135ecb550","mcp_get_code":{"code_sha256":"8e02974135ecb550"}},{"arxiv_id":"Zohar_PROB_Probabilistic_Objectness_for_Open_World_Object_Detection_CVPR_2023_paper","paper":null,"title":"arXiv:Zohar_PROB_Probabilistic_Objectness_for_Open_World_Object_Detection_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"orrzohar/PROB","path":"datasets/coco_eval.py","file_url":"https://github.com/orrzohar/PROB/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"He_Bidirectional_Alignment_for_Domain_Adaptive_Detection_with_Transformers_ICCV_2023_paper","paper":null,"title":"arXiv:He_Bidirectional_Alignment_for_Domain_Adaptive_Detection_with_Transformers_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"helq2612/biADT","path":"datasets/coco_eval.py","file_url":"https://github.com/helq2612/biADT/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"Chu_RaCFormer_Towards_High-Quality_3D_Object_Detection_via_Query-based_Radar-Camera_Fusion_CVPR_2025_paper","paper":null,"title":"arXiv:Chu_RaCFormer_Towards_High-Quality_3D_Object_Detection_via_Query-based_Radar-Camera_Fusion_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cxmomo/RaCFormer","path":"val.py","file_url":"https://github.com/cxmomo/RaCFormer/blob/HEAD/val.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97c6373ac9809717","mcp_get_code":{"code_sha256":"97c6373ac9809717"}},{"arxiv_id":"Chen_Recurrent_Glimpse-Based_Decoder_for_Detection_With_Transformer_CVPR_2022_paper","paper":null,"title":"arXiv:Chen_Recurrent_Glimpse-Based_Decoder_for_Detection_With_Transformer_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhechen/Deformable-DETR-REGO","path":"datasets/coco_eval.py","file_url":"https://github.com/zhechen/Deformable-DETR-REGO/blob/HEAD/datasets/coco_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fe0ddcc2d420c9a0","mcp_get_code":{"code_sha256":"fe0ddcc2d420c9a0"}},{"arxiv_id":"Cao_Event-Guided_Person_Re-Identification_via_Sparse-Dense_Complementary_Learning_CVPR_2023_paper","paper":null,"title":"arXiv:Cao_Event-Guided_Person_Re-Identification_via_Sparse-Dense_Complementary_Learning_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Chengzhi-Cao/SDCL","path":"eval_metrics.py","file_url":"https://github.com/Chengzhi-Cao/SDCL/blob/HEAD/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2267200bffdf674d","mcp_get_code":{"code_sha256":"2267200bffdf674d"}},{"arxiv_id":"Bai_Salient-to-Broad_Transition_for_Video_Person_Re-Identification_CVPR_2022_paper","paper":null,"title":"arXiv:Bai_Salient-to-Broad_Transition_for_Video_Person_Re-Identification_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"baist/SINet","path":"utils/eval_metrics.py","file_url":"https://github.com/baist/SINet/blob/HEAD/utils/eval_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d728b5435bc983be","mcp_get_code":{"code_sha256":"d728b5435bc983be"}},{"arxiv_id":"2025.acl-long.927","paper":null,"title":"arXiv:2025.acl-long.927","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"npnkhoi/memeqa","path":"src/evaluate.py","file_url":"https://github.com/npnkhoi/memeqa/blob/HEAD/src/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d3c2d1db46aa0a19","mcp_get_code":{"code_sha256":"d3c2d1db46aa0a19"}},{"arxiv_id":"2024.naacl-long.64","paper":null,"title":"arXiv:2024.naacl-long.64","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UCF-ML-Research/TrojFSP","path":"train/utils.py","file_url":"https://github.com/UCF-ML-Research/TrojFSP/blob/HEAD/train/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ab557742c7397268","mcp_get_code":{"code_sha256":"ab557742c7397268"}},{"arxiv_id":"2024.emnlp-main.758","paper":null,"title":"arXiv:2024.emnlp-main.758","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HuangOwen/CoT-Influx","path":"example_retrieval_pruner.py","file_url":"https://github.com/HuangOwen/CoT-Influx/blob/HEAD/example_retrieval_pruner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"49396419bb86c908","mcp_get_code":{"code_sha256":"49396419bb86c908"}},{"arxiv_id":"2023.findings-emnlp.469","paper":null,"title":"arXiv:2023.findings-emnlp.469","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ky-ah/selective-lilac","path":"utils/evaluate.py","file_url":"https://github.com/ky-ah/selective-lilac/blob/HEAD/utils/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77ad838ee2864ef8","mcp_get_code":{"code_sha256":"77ad838ee2864ef8"}},{"arxiv_id":"2023.findings-emnlp.269","paper":null,"title":"arXiv:2023.findings-emnlp.269","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"PhoebusSi/Alpaca-CoT","path":"generate.py","file_url":"https://github.com/PhoebusSi/Alpaca-CoT/blob/HEAD/generate.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":"0667af5533b18f7b","mcp_get_code":{"code_sha256":"0667af5533b18f7b"}},{"arxiv_id":"2023.acl-long.119","paper":null,"title":"arXiv:2023.acl-long.119","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lsvih/AtTGen","path":"evaluation.py","file_url":"https://github.com/lsvih/AtTGen/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02f8d2f4cbdefd7b","mcp_get_code":{"code_sha256":"02f8d2f4cbdefd7b"}},{"arxiv_id":"2023.acl-demo.52","paper":null,"title":"arXiv:2023.acl-demo.52","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ku-nlp/kwja","path":"src/kwja/metrics/conll18_ud_eval.py","file_url":"https://github.com/ku-nlp/kwja/blob/HEAD/src/kwja/metrics/conll18_ud_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e587d303824c5583","mcp_get_code":{"code_sha256":"e587d303824c5583"}},{"arxiv_id":"2023.acl-demo.52","paper":null,"title":"arXiv:2023.acl-demo.52","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"megagonlabs/ginza","path":"ginza_util/evaluate_model.py","file_url":"https://github.com/megagonlabs/ginza/blob/HEAD/ginza_util/evaluate_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"41153912b4de51f7","mcp_get_code":{"code_sha256":"41153912b4de51f7"}},{"arxiv_id":"2023.acl-demo.52","paper":null,"title":"arXiv:2023.acl-demo.52","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"megagonlabs/ginza","path":"ginza_util/evaluate_conllu.py","file_url":"https://github.com/megagonlabs/ginza/blob/HEAD/ginza_util/evaluate_conllu.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89c905e1fde0e1f5","mcp_get_code":{"code_sha256":"89c905e1fde0e1f5"}},{"arxiv_id":"2022.findings-emnlp.193","paper":null,"title":"arXiv:2022.findings-emnlp.193","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yushi-Hu/IC-DST","path":"evaluate_metrics.py","file_url":"https://github.com/Yushi-Hu/IC-DST/blob/HEAD/evaluate_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6a3da732f281d1b","mcp_get_code":{"code_sha256":"c6a3da732f281d1b"}},{"arxiv_id":"2021.naacl-main.237","paper":null,"title":"arXiv:2021.naacl-main.237","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"alexa/DialoGLUE","path":"evaluate.py","file_url":"https://github.com/alexa/DialoGLUE/blob/HEAD/evaluate.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":"0634efaba1b4c66d","mcp_get_code":{"code_sha256":"0634efaba1b4c66d"}},{"arxiv_id":"2020.findings-emnlp.289","paper":null,"title":"arXiv:2020.findings-emnlp.289","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"h4ste/mtft_zsl","path":"fslks/eval/eval_utils.py","file_url":"https://github.com/h4ste/mtft_zsl/blob/HEAD/fslks/eval/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0832547bb9852f98","mcp_get_code":{"code_sha256":"0832547bb9852f98"}},{"arxiv_id":"2020.emnlp-main.511","paper":null,"title":"arXiv:2020.emnlp-main.511","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shrimai/Topological-Sort-for-Sentence-Ordering","path":"bert_classifier/model.py","file_url":"https://github.com/shrimai/Topological-Sort-for-Sentence-Ordering/blob/HEAD/bert_classifier/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3358e7b9feb7611","mcp_get_code":{"code_sha256":"f3358e7b9feb7611"}}]}