{"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/predict","entry":"predict","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":126,"n_papers_ran":28,"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":151,"n_samples_ran":32,"n_samples_fingerprinted":2,"n_places":154,"n_places_pointer_only":33,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":4,"ran":19,"unverified":119},"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.15503","paper":"/paper/arxiv-2609-15503","title":"SyntheticDoc: A Large Synthetic Dataset for Document Unwarping and Illumination Correction","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"tanguymagne/SyntheticDoc","path":"training/inference.py","file_url":"https://github.com/tanguymagne/SyntheticDoc/blob/HEAD/training/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b02c33e4522cb254","mcp_get_code":{"code_sha256":"b02c33e4522cb254"}},{"arxiv_id":"2609.13237","paper":"/paper/arxiv-2609-13237","title":"Occlusal Geometry in Closed Form for Orthodontic Report Generation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"GIND123/ODIN_toothfairy4","path":"src/bite2text/baseline.py","file_url":"https://github.com/GIND123/ODIN_toothfairy4/blob/HEAD/src/bite2text/baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"49108c191d7d8d1a","mcp_get_code":{"code_sha256":"49108c191d7d8d1a"}},{"arxiv_id":"2607.29241","paper":"/paper/arxiv-2607-29241","title":"RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"6lyc/RecHarness","path":"gagc/templates/nextitnet_perdataset/predict.py","file_url":"https://github.com/6lyc/RecHarness/blob/HEAD/gagc/templates/nextitnet_perdataset/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e98eecef412ae592","mcp_get_code":{"code_sha256":"e98eecef412ae592"}},{"arxiv_id":"2606.30037","paper":"/paper/arxiv-2606-30037","title":"Heads, Not Backbones: Output Heads Dominate Architectures on Fat-Tailed Returns","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Routhleck/heads-not-backbones","path":"experiments/06_ablation.py","file_url":"https://github.com/Routhleck/heads-not-backbones/blob/HEAD/experiments/06_ablation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb8d3f2591bb27eb","mcp_get_code":{"code_sha256":"bb8d3f2591bb27eb"}},{"arxiv_id":"2606.30037","paper":"/paper/arxiv-2606-30037","title":"Heads, Not Backbones: Output Heads Dominate Architectures on Fat-Tailed Returns","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Routhleck/heads-not-backbones","path":"experiments/07_multiasset.py","file_url":"https://github.com/Routhleck/heads-not-backbones/blob/HEAD/experiments/07_multiasset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b01d9b83475ddf41","mcp_get_code":{"code_sha256":"b01d9b83475ddf41"}},{"arxiv_id":"2606.29836","paper":"/paper/arxiv-2606-29836","title":"Revealing the Technology Development of Natural Language Processing: A Scientific Entity-Centric Perspective","date":"2026-06-29","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"ZH-heng/technology_development","path":"Code/ner-base.py","file_url":"https://github.com/ZH-heng/technology_development/blob/HEAD/Code/ner-base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"89a2950271f242bf","mcp_get_code":{"code_sha256":"89a2950271f242bf"}},{"arxiv_id":"2606.29836","paper":"/paper/arxiv-2606-29836","title":"Revealing the Technology Development of Natural Language Processing: A Scientific Entity-Centric Perspective","date":"2026-06-29","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"ZH-heng/technology_development","path":"Code/ner-cascade.py","file_url":"https://github.com/ZH-heng/technology_development/blob/HEAD/Code/ner-cascade.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b4eea0481a28148a","mcp_get_code":{"code_sha256":"b4eea0481a28148a"}},{"arxiv_id":"2606.17113","paper":"/paper/arxiv-2606-17113","title":"The Critical Role of Model Selection in Causal Inference: A Comparative Analysis of Classification Models within the InferBERT Framework for Pharmacovigilance","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"hsdslab/biomedical-causal-inference","path":"src/Analgesics-induced_acute_liver_failure/albert_train_src.py","file_url":"https://github.com/hsdslab/biomedical-causal-inference/blob/HEAD/src/Analgesics-induced_acute_liver_failure/albert_train_src.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6950177e3bce1ac1","mcp_get_code":{"code_sha256":"6950177e3bce1ac1"}},{"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/0-basic_prompt/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/0-basic_prompt/best_solution.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":"77015b3c2e477467","mcp_get_code":{"code_sha256":"77015b3c2e477467"}},{"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/1-basic_prompt/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/1-basic_prompt/best_solution.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":"5ca075c484864780","mcp_get_code":{"code_sha256":"5ca075c484864780"}},{"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/10-addition_1/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/10-addition_1/best_solution.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":"fa085b6047220cd3","mcp_get_code":{"code_sha256":"fa085b6047220cd3"}},{"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/12-addition_1/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/12-addition_1/best_solution.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":"459b29550408e9a1","mcp_get_code":{"code_sha256":"459b29550408e9a1"}},{"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/13-addition_1/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/13-addition_1/best_solution.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":"faddff6f65bef273","mcp_get_code":{"code_sha256":"faddff6f65bef273"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6d34b6134a5ded38","mcp_get_code":{"code_sha256":"6d34b6134a5ded38"}},{"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/16-addition_2/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/16-addition_2/best_solution.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":"faca36361f0decf5","mcp_get_code":{"code_sha256":"faca36361f0decf5"}},{"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/17-addition_2/best_solution.py","file_url":"https://github.com/anna-richter/be-fair/blob/HEAD/aide/logs/17-addition_2/best_solution.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":"b737b70004207f2e","mcp_get_code":{"code_sha256":"b737b70004207f2e"}},{"arxiv_id":"2605.11764","paper":"/paper/arxiv-2605-11764","title":"Decomposing the Generalization Gap in PROTAC Activity Prediction: Variance Attribution and the Inter-Laboratory Ceiling","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ThorKlm/PROTAC-Bench","path":"baselines/rs_per_target_gnn.py","file_url":"https://github.com/ThorKlm/PROTAC-Bench/blob/HEAD/baselines/rs_per_target_gnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50668a29b064f865","mcp_get_code":{"code_sha256":"50668a29b064f865"}},{"arxiv_id":"2604.20825","paper":"/paper/arxiv-2604-20825","title":"FedSIR: Spectral Client Identification and Relabeling for Federated Learning with Noisy Labels","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"sinagh72/FedSIR","path":"model/trainer.py","file_url":"https://github.com/sinagh72/FedSIR/blob/HEAD/model/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"287b5195bd695d28","mcp_get_code":{"code_sha256":"287b5195bd695d28"}},{"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/predict.py","file_url":"https://github.com/ai4protein/VenusFactory2/blob/HEAD/src/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a5daec976bec9f3e","mcp_get_code":{"code_sha256":"a5daec976bec9f3e"}},{"arxiv_id":"2602.07915","paper":"/paper/arxiv-2602-07915","title":"CausalCompass: Evaluating the Robustness of Time-Series Causal Discovery in Misspecified Scenarios","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ckassaad/causal_discovery_for_time_series","path":"baselines/scripts_python/kitmi.py","file_url":"https://github.com/ckassaad/causal_discovery_for_time_series/blob/HEAD/baselines/scripts_python/kitmi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a50bd03edb6f3900","mcp_get_code":{"code_sha256":"a50bd03edb6f3900"}},{"arxiv_id":"2510.20154","paper":"/paper/arxiv-2510-20154","title":"Are Stereotypes Leading LLMs' Zero-Shot Stance Detection ?","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"slanglab/twitteraae","path":"code/predict.py","file_url":"https://github.com/slanglab/twitteraae/blob/HEAD/code/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5eab7b543c6a73d1","mcp_get_code":{"code_sha256":"5eab7b543c6a73d1"}},{"arxiv_id":"2510.13183","paper":"/paper/arxiv-2510-13183","title":"DSCD: Large Language Model Detoxification with Self-Constrained Decoding","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZHANGJINKUI/DSCD","path":"run_dscd.py","file_url":"https://github.com/ZHANGJINKUI/DSCD/blob/HEAD/run_dscd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e345e36e3994af05","mcp_get_code":{"code_sha256":"e345e36e3994af05"}},{"arxiv_id":"2510.11752","paper":"/paper/arxiv-2510-11752","title":"Fast and Interpretable Protein Substructure Alignment via Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"tyang816/ProtSSN","path":"get_embedding.py","file_url":"https://github.com/tyang816/ProtSSN/blob/HEAD/get_embedding.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"0b041c3e79ca4d8f","mcp_get_code":{"code_sha256":"0b041c3e79ca4d8f"}},{"arxiv_id":"2508.16867","paper":"/paper/arxiv-2508-16867","title":"QFrCoLA: a Quebec-French Corpus of Linguistic Acceptability Judgments","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"GRAAL-Research/QFrCoLA","path":"article_src/baseline.py","file_url":"https://github.com/GRAAL-Research/QFrCoLA/blob/HEAD/article_src/baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"36eefba97bccf95a","mcp_get_code":{"code_sha256":"36eefba97bccf95a"}},{"arxiv_id":"2505.20162","paper":"/paper/capability-based-scaling-laws-for-llm-red","title":"Capability-Based Scaling Laws for LLM Red-Teaming","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kotekjedi/capability-based-scaling","path":"uncertainty/models/linear_model.py","file_url":"https://github.com/kotekjedi/capability-based-scaling/blob/HEAD/uncertainty/models/linear_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8d23715a233eff12","mcp_get_code":{"code_sha256":"8d23715a233eff12"}},{"arxiv_id":"2505.05049","paper":"/paper/uncertainsam-fast-and-efficient-uncertainty","title":"UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greenautoml4fas/uncertainsam","path":"usam/patch_sam2.py","file_url":"https://github.com/greenautoml4fas/uncertainsam/blob/HEAD/usam/patch_sam2.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":"118a427d81acde1e","mcp_get_code":{"code_sha256":"118a427d81acde1e"}},{"arxiv_id":"2412.20017","paper":"/paper/a-nearly-optimal-single-loop-algorithm-for","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness","path":"hyper-representation/methods/slip.py","file_url":"https://github.com/MingruiLiu-ML-Lab/Single-Loop-bilevel-Optimizer-under-Unbounded-Smoothness/blob/HEAD/hyper-representation/methods/slip.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":"36f4612ed1f10250","mcp_get_code":{"code_sha256":"36f4612ed1f10250"}},{"arxiv_id":"2411.17945","paper":"/paper/marvel-40m-multi-level-visual-elaboration-for","title":"MARVEL-40M+: Multi-Level Visual Elaboration for High-Fidelity Text-to-3D Content Creation","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SadilKhan/MARVEL-FX3D","path":"pipeline/dis_image_background_removal.py","file_url":"https://github.com/SadilKhan/MARVEL-FX3D/blob/HEAD/pipeline/dis_image_background_removal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39a8366aae87acec","mcp_get_code":{"code_sha256":"39a8366aae87acec"}},{"arxiv_id":"2411.12431","paper":"/paper/cv-cities-advancing-cross-view-geo","title":"CV-Cities: Advancing Cross-View Geo-Localization in Global Cities","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaoshuang98/cvcities","path":"cvcities_base/trainer.py","file_url":"https://github.com/gaoshuang98/cvcities/blob/HEAD/cvcities_base/trainer.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":"fcb77e21c648f7fa","mcp_get_code":{"code_sha256":"fcb77e21c648f7fa"}},{"arxiv_id":"2410.14787","paper":"/paper/privacy-for-free-in-the-over-parameterized","title":"Privacy for Free in the Overparameterized Regime","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simone-bombari/privacy-for-free","path":"utils_NN_JAX.py","file_url":"https://github.com/simone-bombari/privacy-for-free/blob/HEAD/utils_NN_JAX.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e978ea7779d34d73","mcp_get_code":{"code_sha256":"e978ea7779d34d73"}},{"arxiv_id":"2409.20550","paper":"/paper/llm-hallucinations-in-practical-code","title":"LLM Hallucinations in Practical Code Generation: Phenomena, Mechanism, and Mitigation","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepsoftwareanalytics/llmcodinghallucination","path":"eval_original.py","file_url":"https://github.com/deepsoftwareanalytics/llmcodinghallucination/blob/HEAD/eval_original.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"297de4419cd21f7b","mcp_get_code":{"code_sha256":"297de4419cd21f7b"}},{"arxiv_id":"2409.19212","paper":"/paper/an-accelerated-algorithm-for-stochastic","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingruiliu-ml-lab/accelerated-bilevel-optimization-unbounded-smoothness","path":"auc_maximization/methods/accbo.py","file_url":"https://github.com/mingruiliu-ml-lab/accelerated-bilevel-optimization-unbounded-smoothness/blob/HEAD/auc_maximization/methods/accbo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5f52970528f0f54","mcp_get_code":{"code_sha256":"b5f52970528f0f54"}},{"arxiv_id":"2409.14981","paper":"/paper/on-the-specialization-of-neural-modules","title":"On The Specialization of Neural Modules","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raillab/specialization_of_neural_modules","path":"empirical_motivation/dense.py","file_url":"https://github.com/raillab/specialization_of_neural_modules/blob/HEAD/empirical_motivation/dense.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"23ffd7275ed2fef4","mcp_get_code":{"code_sha256":"23ffd7275ed2fef4"}},{"arxiv_id":"2409.12293","paper":"/paper/provable-in-context-learning-of-linear","title":"In-Context Learning of Linear Systems: Generalization Theory and Applications to Operator Learning","date":"2024-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lugroupumn/icl-ellipticpdes","path":"src/models.py","file_url":"https://github.com/lugroupumn/icl-ellipticpdes/blob/HEAD/src/models.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":"ba4884ea529a30e5","mcp_get_code":{"code_sha256":"ba4884ea529a30e5"}},{"arxiv_id":"2407.12710","paper":"/paper/a-unifying-post-processing-framework-for","title":"A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aminchrs/postprocess","path":"datasetsdefer/predict.py","file_url":"https://github.com/aminchrs/postprocess/blob/HEAD/datasetsdefer/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00376349de1fb60d","mcp_get_code":{"code_sha256":"00376349de1fb60d"}},{"arxiv_id":"2407.07799","paper":"/paper/attribute-or-abstain-large-language-models-as","title":"Attribute or Abstain: Large Language Models as Long Document Assistants","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/arxiv2024-attribute-or-abstain","path":"evaluate_attribution.py","file_url":"https://github.com/ukplab/arxiv2024-attribute-or-abstain/blob/HEAD/evaluate_attribution.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":"f8a5acc6d64b44c2","mcp_get_code":{"code_sha256":"f8a5acc6d64b44c2"}},{"arxiv_id":"2406.19300","paper":"/paper/sctree-discovering-cellular-hierarchies-in","title":"scTree: Discovering Cellular Hierarchies in the Presence of Batch Effects in scRNA-seq Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvandenhi/sctree-public","path":"src/sctree/utils/training_utils.py","file_url":"https://github.com/mvandenhi/sctree-public/blob/HEAD/src/sctree/utils/training_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":"e018da21b0bd6354","mcp_get_code":{"code_sha256":"e018da21b0bd6354"}},{"arxiv_id":"2406.17956","paper":"/paper/impact-of-data-bias-on-machine-learning-for","title":"Impact of Data Bias on Machine Learning for Crystal Compound Synthesizability Predictions","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"kadkhodaei-research-group/XIE-SPP","path":"xiespp/CVR/keras_tools.py","file_url":"https://github.com/kadkhodaei-research-group/XIE-SPP/blob/HEAD/xiespp/CVR/keras_tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b2eae37ff88d8ed1","mcp_get_code":{"code_sha256":"b2eae37ff88d8ed1"}},{"arxiv_id":"2406.16749","paper":"/paper/inferring-stochastic-low-rank-recurrent","title":"Inferring stochastic low-rank recurrent neural networks from neural data","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/smc_rnns","path":"py_rnn/model.py","file_url":"https://github.com/mackelab/smc_rnns/blob/HEAD/py_rnn/model.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":"69ff95878cf21a72","mcp_get_code":{"code_sha256":"69ff95878cf21a72"}},{"arxiv_id":"2406.04197","paper":"/paper/dice-detecting-in-distribution-contamination","title":"DICE: Detecting In-distribution Contamination in LLM's Fine-tuning Phase for Math Reasoning","date":"2024-06-06","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":"8f12c20fe27a3248","mcp_get_code":{"code_sha256":"8f12c20fe27a3248"}},{"arxiv_id":"2405.18351","paper":"/paper/evaluating-bayesian-deep-learning-for-radio","title":"Evaluating Bayesian deep learning for radio galaxy classification","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devinamhn/radiogalaxies-bnns","path":"radiogalaxies_bnns/inference/lla/laplace_approx.py","file_url":"https://github.com/devinamhn/radiogalaxies-bnns/blob/HEAD/radiogalaxies_bnns/inference/lla/laplace_approx.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"adb91c0c1f38a52b","mcp_get_code":{"code_sha256":"adb91c0c1f38a52b"}},{"arxiv_id":"2404.06474","paper":"/paper/autonomous-evaluation-and-refinement-of","title":"Autonomous Evaluation and Refinement of Digital Agents","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berkeley-nlp/agent-eval-refine","path":"agent_eval/agent_eval/captioner/prepare_caps_sub.py","file_url":"https://github.com/berkeley-nlp/agent-eval-refine/blob/HEAD/agent_eval/agent_eval/captioner/prepare_caps_sub.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"c4f6c62dbdbdbb23","mcp_get_code":{"code_sha256":"c4f6c62dbdbdbb23"}},{"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":"ffa2f538dc99e6b8","mcp_get_code":{"code_sha256":"ffa2f538dc99e6b8"}},{"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":"b662bcd70e07850c","mcp_get_code":{"code_sha256":"b662bcd70e07850c"}},{"arxiv_id":"2402.17453","paper":"/paper/ds-agent-automated-data-science-by-empowering","title":"DS-Agent: Automated Data Science by Empowering Large Language Models with Case-Based Reasoning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guosyjlu/DS-Agent","path":"deployment/experience_replay/airline-reviews.py","file_url":"https://github.com/guosyjlu/DS-Agent/blob/HEAD/deployment/experience_replay/airline-reviews.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6419d62b28f3cfc1","mcp_get_code":{"code_sha256":"6419d62b28f3cfc1"}},{"arxiv_id":"2402.17453","paper":"/paper/ds-agent-automated-data-science-by-empowering","title":"DS-Agent: Automated Data Science by Empowering Large Language Models with Case-Based Reasoning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guosyjlu/DS-Agent","path":"deployment/experience_replay/chatgpt-prompt.py","file_url":"https://github.com/guosyjlu/DS-Agent/blob/HEAD/deployment/experience_replay/chatgpt-prompt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d168412c0d94b909","mcp_get_code":{"code_sha256":"d168412c0d94b909"}},{"arxiv_id":"2402.17453","paper":"/paper/ds-agent-automated-data-science-by-empowering","title":"DS-Agent: Automated Data Science by Empowering Large Language Models with Case-Based Reasoning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guosyjlu/DS-Agent","path":"deployment/experience_replay/enzyme-substrate.py","file_url":"https://github.com/guosyjlu/DS-Agent/blob/HEAD/deployment/experience_replay/enzyme-substrate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a43e675ac4b0fed0","mcp_get_code":{"code_sha256":"a43e675ac4b0fed0"}},{"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":"attack_prompt_data/uncensored_vicuna/uncensor.py","file_url":"https://github.com/xirui-li/drattack/blob/HEAD/attack_prompt_data/uncensored_vicuna/uncensor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"814a87fca12a52fe","mcp_get_code":{"code_sha256":"814a87fca12a52fe"}},{"arxiv_id":"2402.03495","paper":"/paper/partially-stochastic-infinitely-deep-bayesian","title":"Partially Stochastic Infinitely Deep Bayesian Neural Networks","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sergio20f/part_stoch_inf_deep","path":"sdebnn_classification.py","file_url":"https://github.com/sergio20f/part_stoch_inf_deep/blob/HEAD/sdebnn_classification.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2d96f5e14250dac3","mcp_get_code":{"code_sha256":"2d96f5e14250dac3"}},{"arxiv_id":"2402.02823","paper":"/paper/evading-data-contamination-detection-for","title":"Evading Data Contamination Detection for Language Models is (too) Easy","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/dice","path":"Locate/DICE_locate.py","file_url":"https://github.com/thu-keg/dice/blob/HEAD/Locate/DICE_locate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f12c20fe27a3248","mcp_get_code":{"code_sha256":"8f12c20fe27a3248"}},{"arxiv_id":"2401.10727","paper":"/paper/tool-lmm-a-large-multi-modal-model-for-tool","title":"MLLM-Tool: A Multimodal Large Language Model For Tool Agent Learning","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mllm-tool/mllm-tool","path":"code/inference.py","file_url":"https://github.com/mllm-tool/mllm-tool/blob/HEAD/code/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5ae1f5220848590","mcp_get_code":{"code_sha256":"a5ae1f5220848590"}},{"arxiv_id":"2401.09587","paper":"/paper/bilevel-optimization-under-unbounded","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingruiliu-ml-lab/bilevel-optimization-under-unbounded-smoothness","path":"meta_learning/bo_rep.py","file_url":"https://github.com/mingruiliu-ml-lab/bilevel-optimization-under-unbounded-smoothness/blob/HEAD/meta_learning/bo_rep.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8640c30e03b9b8b4","mcp_get_code":{"code_sha256":"8640c30e03b9b8b4"}},{"arxiv_id":"2401.06766","paper":"/paper/mind-your-format-towards-consistent","title":"Mind Your Format: Towards Consistent Evaluation of In-Context Learning Improvements","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yandex-research/mind-your-format","path":"evaluate.py","file_url":"https://github.com/yandex-research/mind-your-format/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":"5b3e1a3d02d90a79","mcp_get_code":{"code_sha256":"5b3e1a3d02d90a79"}},{"arxiv_id":"2310.09219","paper":"/paper/kelly-is-a-warm-person-joseph-is-a-role-model","title":"\"Kelly is a Warm Person, Joseph is a Role Model\": Gender Biases in LLM-Generated Reference Letters","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclanlp/biases-llm-reference-letters","path":"classifier.py","file_url":"https://github.com/uclanlp/biases-llm-reference-letters/blob/HEAD/classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"abf1dc7ccaae0104","mcp_get_code":{"code_sha256":"abf1dc7ccaae0104"}},{"arxiv_id":"2310.05863","paper":"/paper/fine-grained-audio-visual-joint","title":"Fine-grained Audio-Visual Joint Representations for Multimodal Large Language Models","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"briansidp/audiovisualllm","path":"inference.py","file_url":"https://github.com/briansidp/audiovisualllm/blob/HEAD/inference.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":"3310bb33a7fee07b","mcp_get_code":{"code_sha256":"3310bb33a7fee07b"}},{"arxiv_id":"2310.00526","paper":"/paper/are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"penlu/bespoke-gnn4do","path":"model/training.py","file_url":"https://github.com/penlu/bespoke-gnn4do/blob/HEAD/model/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c645b2295bbb309","mcp_get_code":{"code_sha256":"0c645b2295bbb309"}},{"arxiv_id":"2309.01809","paper":"/paper/are-emergent-abilities-in-large-language","title":"Are Emergent Abilities in Large Language Models just In-Context Learning?","date":"2023-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/on-emergence","path":"utils.py","file_url":"https://github.com/ukplab/on-emergence/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-SA-4.0","inline_ok":false,"code_sha256_prefix":"2e0ff18c16875bd8","mcp_get_code":{"code_sha256":"2e0ff18c16875bd8"}},{"arxiv_id":"2306.05671","paper":"/paper/topology-aware-uncertainty-for-image-1","title":"Topology-Aware Uncertainty for Image Segmentation","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johschmidt42/PyTorch-2D-3D-UNet-Tutorial","path":"inference.py","file_url":"https://github.com/johschmidt42/PyTorch-2D-3D-UNet-Tutorial/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"02c8d4823f0bd036","mcp_get_code":{"code_sha256":"02c8d4823f0bd036"}},{"arxiv_id":"2305.19894","paper":"/paper/med-unic-unifying-cross-lingual-medical-1","title":"Med-UniC: Unifying Cross-Lingual Medical Vision-Language Pre-Training by Diminishing Bias","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sustechbruce/med-unic","path":"zero-shot/zero_shot.py","file_url":"https://github.com/sustechbruce/med-unic/blob/HEAD/zero-shot/zero_shot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc60f10026a470a1","mcp_get_code":{"code_sha256":"bc60f10026a470a1"}},{"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":"FutureComputing4AI/Hrrformer","path":"malware/hrrformer_mgpu.py","file_url":"https://github.com/FutureComputing4AI/Hrrformer/blob/HEAD/malware/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":"a8de53c24dc4ea75","mcp_get_code":{"code_sha256":"a8de53c24dc4ea75"}},{"arxiv_id":"2305.19164","paper":"/paper/lance-stress-testing-visual-models-by-1","title":"LANCE: Stress-testing Visual Models by Generating Language-guided Counterfactual Images","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"virajprabhu/lance","path":"lance/utils/inference_utils.py","file_url":"https://github.com/virajprabhu/lance/blob/HEAD/lance/utils/inference_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":"b4c696f803c68a65","mcp_get_code":{"code_sha256":"b4c696f803c68a65"}},{"arxiv_id":"2305.16307","paper":"/paper/indictrans2-towards-high-quality-and","title":"IndicTrans2: Towards High-Quality and Accessible Machine Translation Models for all 22 Scheduled Indian Languages","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4bharat/indictrans2","path":"baseline_eval/m2m100_inference.py","file_url":"https://github.com/ai4bharat/indictrans2/blob/HEAD/baseline_eval/m2m100_inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71b64e8cc27d0701","mcp_get_code":{"code_sha256":"71b64e8cc27d0701"}},{"arxiv_id":"2305.12524","paper":"/paper/theoremqa-a-theorem-driven-question-answering","title":"TheoremQA: A Theorem-driven Question Answering dataset","date":"2023-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/VisualGLM-6B","path":"web_demo_hf.py","file_url":"https://github.com/THUDM/VisualGLM-6B/blob/HEAD/web_demo_hf.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":"922434407b7b0339","mcp_get_code":{"code_sha256":"922434407b7b0339"}},{"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/connectivity.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/connectivity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cbe4067d5b14ce7d","mcp_get_code":{"code_sha256":"cbe4067d5b14ce7d"}},{"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/cycle.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/cycle.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dad997d21261794f","mcp_get_code":{"code_sha256":"dad997d21261794f"}},{"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":"4d787eb13e705643","mcp_get_code":{"code_sha256":"4d787eb13e705643"}},{"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":"d1eee01b3266712e","mcp_get_code":{"code_sha256":"d1eee01b3266712e"}},{"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/hamilton.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/hamilton.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50e688855b366fbc","mcp_get_code":{"code_sha256":"50e688855b366fbc"}},{"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":"755ec6742596b4eb","mcp_get_code":{"code_sha256":"755ec6742596b4eb"}},{"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":"415f590e6388b0be","mcp_get_code":{"code_sha256":"415f590e6388b0be"}},{"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/topology.py","file_url":"https://github.com/Arthur-Heng/NLGraph/blob/HEAD/evaluation/topology.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f317ee318e2fe255","mcp_get_code":{"code_sha256":"f317ee318e2fe255"}},{"arxiv_id":"2304.04726","paper":"/paper/uncertainty-aware-natural-language-inference","title":"Uncertainty-Aware Natural Language Inference with Stochastic Weight Averaging","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"helsinki-nlp/uncertainty-aware-nli","path":"swag_utils.py","file_url":"https://github.com/helsinki-nlp/uncertainty-aware-nli/blob/HEAD/swag_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75743d56a744d398","mcp_get_code":{"code_sha256":"75743d56a744d398"}},{"arxiv_id":"2303.14535","paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Eacient/EfficientAD","path":"efficientad.py","file_url":"https://github.com/Eacient/EfficientAD/blob/HEAD/efficientad.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":"27ada34ea43ef9cb","mcp_get_code":{"code_sha256":"27ada34ea43ef9cb"}},{"arxiv_id":"2303.11916","paper":"/paper/compodiff-versatile-composed-image-retrieval","title":"CompoDiff: Versatile Composed Image Retrieval With Latent Diffusion","date":"2023-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navervision/compodiff","path":"demo_search.py","file_url":"https://github.com/navervision/compodiff/blob/HEAD/demo_search.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":"63a099788570229c","mcp_get_code":{"code_sha256":"63a099788570229c"}},{"arxiv_id":"2303.11329","paper":"/paper/sound-localization-from-motion-jointly","title":"Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/SLfM","path":"slfm/main_audio.py","file_url":"https://github.com/IFICL/SLfM/blob/HEAD/slfm/main_audio.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2c10d8abac5a4d3","mcp_get_code":{"code_sha256":"e2c10d8abac5a4d3"}},{"arxiv_id":"2303.11329","paper":"/paper/sound-localization-from-motion-jointly","title":"Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/SLfM","path":"slfm/main_camera.py","file_url":"https://github.com/IFICL/SLfM/blob/HEAD/slfm/main_camera.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8c280d3682a41f71","mcp_get_code":{"code_sha256":"8c280d3682a41f71"}},{"arxiv_id":"2303.11329","paper":"/paper/sound-localization-from-motion-jointly","title":"Sound Localization from Motion: Jointly Learning Sound Direction and Camera Rotation","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/SLfM","path":"slfm/evaluation/functs.py","file_url":"https://github.com/IFICL/SLfM/blob/HEAD/slfm/evaluation/functs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8831db672f635424","mcp_get_code":{"code_sha256":"8831db672f635424"}},{"arxiv_id":"2303.02242","paper":"/paper/trojtext-test-time-invisible-textual-trojan","title":"TrojText: Test-time Invisible Textual Trojan Insertion","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhliu79/TWP","path":"Tox21/LifeModel/twp_model.py","file_url":"https://github.com/hhliu79/TWP/blob/HEAD/Tox21/LifeModel/twp_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5c74353b660eadb","mcp_get_code":{"code_sha256":"e5c74353b660eadb"}},{"arxiv_id":"2212.13629","paper":"/paper/quantile-risk-control-a-flexible-framework","title":"Quantile Risk Control: A Flexible Framework for Bounding the Probability of High-Loss Predictions","date":"2022-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jakesnell/quantile-risk-control","path":"var_control/utils.py","file_url":"https://github.com/jakesnell/quantile-risk-control/blob/HEAD/var_control/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9569954144cbd933","mcp_get_code":{"code_sha256":"9569954144cbd933"}},{"arxiv_id":"2211.04279","paper":"/paper/detecting-shortcuts-in-medical-images-a-case","title":"Detecting Shortcuts in Medical Images -- A Case Study in Chest X-rays","date":"2022-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"volesen/slicing-through-bias","path":"embed.py","file_url":"https://github.com/volesen/slicing-through-bias/blob/HEAD/embed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"98beba4417329e63","mcp_get_code":{"code_sha256":"98beba4417329e63"}},{"arxiv_id":"2210.06284","paper":"/paper/visual-prompting-for-adversarial-robustness","title":"Visual Prompting for Adversarial Robustness","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Phoveran/vp-for-adversarial-robustness","path":"evaluate_diff_pgd_steps.py","file_url":"https://github.com/Phoveran/vp-for-adversarial-robustness/blob/HEAD/evaluate_diff_pgd_steps.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":"0be89ad4cb91ad4a","mcp_get_code":{"code_sha256":"0be89ad4cb91ad4a"}},{"arxiv_id":"2203.14360","paper":"/paper/observation-centric-sort-rethinking-sort-for","title":"Observation-Centric SORT: Rethinking SORT for Robust Multi-Object Tracking","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BingfengYan/DS_OCSORT","path":"trackers/ocsort_tracker/kalmanfilter.py","file_url":"https://github.com/BingfengYan/DS_OCSORT/blob/HEAD/trackers/ocsort_tracker/kalmanfilter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ada6d867045a7b1","mcp_get_code":{"code_sha256":"1ada6d867045a7b1"}},{"arxiv_id":"2203.14360","paper":"/paper/observation-centric-sort-rethinking-sort-for","title":"Observation-Centric SORT: Rethinking SORT for Robust Multi-Object Tracking","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadirnar/ocsort-pip","path":"ocsort/kalmanfilter.py","file_url":"https://github.com/kadirnar/ocsort-pip/blob/HEAD/ocsort/kalmanfilter.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11a2969e11993458","mcp_get_code":{"code_sha256":"11a2969e11993458"}},{"arxiv_id":"2203.03597","paper":"/paper/fast-rates-for-noisy-interpolation-require","title":"Fast Rates for Noisy Interpolation Require Rethinking the Effects of Inductive Bias","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nickruggeri/fast-rates-for-noisy-interpolation","path":"src/lp_svc.py","file_url":"https://github.com/nickruggeri/fast-rates-for-noisy-interpolation/blob/HEAD/src/lp_svc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7fac8667528373f2","mcp_get_code":{"code_sha256":"7fac8667528373f2"}},{"arxiv_id":"2112.10789","paper":"/paper/machine-learning-discovery-of-new-phases-in","title":"Machine learning discovery of new phases in programmable quantum simulator snapshots","date":"2021-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KimGroup/QGasML","path":"lassopath.py","file_url":"https://github.com/KimGroup/QGasML/blob/HEAD/lassopath.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d52245025de86209","mcp_get_code":{"code_sha256":"d52245025de86209"}},{"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":"294b452ea4501cb9","mcp_get_code":{"code_sha256":"294b452ea4501cb9"}},{"arxiv_id":"2111.05846","paper":"/paper/structure-from-silence-learning-scene","title":"Structure from Silence: Learning Scene Structure from Ambient Sound","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IFICL/structure-from-silence","path":"main_lincls.py","file_url":"https://github.com/IFICL/structure-from-silence/blob/HEAD/main_lincls.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4aaddcd2e48ed7cc","mcp_get_code":{"code_sha256":"4aaddcd2e48ed7cc"}},{"arxiv_id":"2109.14509","paper":"/paper/pac-bayes-information-bottleneck","title":"PAC-Bayes Information Bottleneck","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryanwangzf/pac-bayes-ib","path":"src/pib_utils.py","file_url":"https://github.com/ryanwangzf/pac-bayes-ib/blob/HEAD/src/pib_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05619bf46a5078e5","mcp_get_code":{"code_sha256":"05619bf46a5078e5"}},{"arxiv_id":"2108.13654","paper":"/paper/discretized-integrated-gradients-for","title":"Discretized Integrated Gradients for Explaining Language Models","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/dig","path":"bert_helper.py","file_url":"https://github.com/ink-usc/dig/blob/HEAD/bert_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4c1f89220f52256","mcp_get_code":{"code_sha256":"f4c1f89220f52256"}},{"arxiv_id":"2107.11876","paper":"/paper/a-study-on-speech-enhancement-based-on","title":"A Study on Speech Enhancement Based on Diffusion Probabilistic Model","date":"2021-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neillu23/cdiffuse","path":"src/cdiffuse/inference.py","file_url":"https://github.com/neillu23/cdiffuse/blob/HEAD/src/cdiffuse/inference.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":"be664af39d56b6a8","mcp_get_code":{"code_sha256":"be664af39d56b6a8"}},{"arxiv_id":"2107.05916","paper":"/paper/towards-automatic-instrumentation-by-learning","title":"Towards Automatic Instrumentation by Learning to Separate Parts in Symbolic Multitrack Music","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salu133445/arranger","path":"arranger/closest/infer.py","file_url":"https://github.com/salu133445/arranger/blob/HEAD/arranger/closest/infer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6ad16c2da171c819","mcp_get_code":{"code_sha256":"6ad16c2da171c819"}},{"arxiv_id":"2106.14616","paper":"/paper/icdar-2021-competition-on-scientific","title":"ICDAR 2021 Competition on Scientific Literature Parsing","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenwenyu/MASTER-pytorch","path":"model/master.py","file_url":"https://github.com/wenwenyu/MASTER-pytorch/blob/HEAD/model/master.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"353e3f0c62275e10","mcp_get_code":{"code_sha256":"353e3f0c62275e10"}},{"arxiv_id":"2106.08161","paper":"/paper/contrastive-mixture-of-posteriors-for","title":"Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BenevolentAI/CoMP","path":"comp/metric_handlers.py","file_url":"https://github.com/BenevolentAI/CoMP/blob/HEAD/comp/metric_handlers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"90dbb0df2db2c052","mcp_get_code":{"code_sha256":"90dbb0df2db2c052"}},{"arxiv_id":"2106.07597","paper":"/paper/mlperf-tiny-benchmark","title":"MLPerf Tiny Benchmark","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlcommons/tiny_results_v0.5","path":"closed/PengChengLaboratory/code/ad/tiny/v0.1/training/keyword_spotting/eval_quantized_model.py","file_url":"https://github.com/mlcommons/tiny_results_v0.5/blob/HEAD/closed/PengChengLaboratory/code/ad/tiny/v0.1/training/keyword_spotting/eval_quantized_model.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":"fb79e3cbc6774c55","mcp_get_code":{"code_sha256":"fb79e3cbc6774c55"}},{"arxiv_id":"2105.14159","paper":"/paper/enhancing-environmental-enforcement-with-near","title":"Enhancing Environmental Enforcement with Near Real-Time Monitoring: Likelihood-Based Detection of Structural Expansion of Intensive Livestock Farms","date":"2021-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reglab/building_expansion","path":"methods/ddm.py","file_url":"https://github.com/reglab/building_expansion/blob/HEAD/methods/ddm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e20462c5f676591c","mcp_get_code":{"code_sha256":"e20462c5f676591c"}},{"arxiv_id":"2104.04480","paper":"/paper/improving-the-efficiency-and-robustness-of-1","title":"Improving the Efficiency and Robustness of Deepfakes Detection through Precise Geometric Features","date":"2021-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frederickszk/LRNet","path":"demo/classify.py","file_url":"https://github.com/frederickszk/LRNet/blob/HEAD/demo/classify.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac93c18af42c2c35","mcp_get_code":{"code_sha256":"ac93c18af42c2c35"}},{"arxiv_id":"2012.06002","paper":"/paper/overcoming-catastrophic-forgetting-in-graph","title":"Overcoming Catastrophic Forgetting in Graph Neural Networks","date":"2020-12-10","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":"e5c74353b660eadb","mcp_get_code":{"code_sha256":"e5c74353b660eadb"}},{"arxiv_id":"2011.07995","paper":"/paper/detection-of-masses-and-architectural","title":"Detection of masses and architectural distortions in digital breast tomosynthesis: a publicly available dataset of 5,060 patients and a deep learning model","date":"2020-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateuszbuda/duke-dbt-detection","path":"inference.py","file_url":"https://github.com/mateuszbuda/duke-dbt-detection/blob/HEAD/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"040b3856be8d1736","mcp_get_code":{"code_sha256":"040b3856be8d1736"}},{"arxiv_id":"2010.09080","paper":"/paper/poisoned-classifiers-are-not-only-backdoored-1","title":"Poisoned classifiers are not only backdoored, they are fundamentally broken","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/breaking-poisoned-classifier","path":"code/badnet/utils.py","file_url":"https://github.com/locuslab/breaking-poisoned-classifier/blob/HEAD/code/badnet/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bfde3a501871df7","mcp_get_code":{"code_sha256":"3bfde3a501871df7"}},{"arxiv_id":"2009.06978","paper":"/paper/dialogue-response-ranking-training-with-large","title":"Dialogue Response Ranking Training with Large-Scale Human Feedback Data","date":"2020-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"golsun/dialogrpt","path":"src/score.py","file_url":"https://github.com/golsun/dialogrpt/blob/HEAD/src/score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dcdae0bf5017c9c5","mcp_get_code":{"code_sha256":"dcdae0bf5017c9c5"}},{"arxiv_id":"2009.05387","paper":"/paper/indonlu-benchmark-and-resources-for","title":"IndoNLU: Benchmark and Resources for Evaluating Indonesian Natural Language Understanding","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"indobenchmark/indonlu","path":"predict.py","file_url":"https://github.com/indobenchmark/indonlu/blob/HEAD/predict.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":"da384f25986bd37e","mcp_get_code":{"code_sha256":"da384f25986bd37e"}},{"arxiv_id":"2009.00325","paper":"/paper/uncovering-hidden-challenges-in-query-based","title":"Uncovering Hidden Challenges in Query-Based Video Moment Retrieval","date":"2020-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayu-ot/hidden-challenges-MR","path":"src/toolbox/baseline.py","file_url":"https://github.com/mayu-ot/hidden-challenges-MR/blob/HEAD/src/toolbox/baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6c74cb414063c07d","mcp_get_code":{"code_sha256":"6c74cb414063c07d"}},{"arxiv_id":"2007.15745","paper":"/paper/on-hyperparameter-optimization-of-machine","title":"On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practice","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MohammadFebriyanto/ahuahu_app","path":"api/predict.py","file_url":"https://github.com/MohammadFebriyanto/ahuahu_app/blob/HEAD/api/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b9956b47330f295a","mcp_get_code":{"code_sha256":"b9956b47330f295a"}},{"arxiv_id":"2006.00724","paper":"/paper/learning-irreducible-representations-of","title":"Computing Representations for Lie Algebraic Networks","date":"2020-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noajshu/learning_irreps","path":"spacetime_nn.py","file_url":"https://github.com/noajshu/learning_irreps/blob/HEAD/spacetime_nn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e79b6af94446b79","mcp_get_code":{"code_sha256":"1e79b6af94446b79"}},{"arxiv_id":"2004.06063","paper":"/paper/bleu-might-be-guilty-but-references-are-not","title":"BLEU might be Guilty but References are not Innocent","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atreyasha/semantic-isometry-nmt","path":"src/evaluate_paraphrase_detection_wmt19_paraphrases_de_en.py","file_url":"https://github.com/atreyasha/semantic-isometry-nmt/blob/HEAD/src/evaluate_paraphrase_detection_wmt19_paraphrases_de_en.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d53e554e14d6d79b","mcp_get_code":{"code_sha256":"d53e554e14d6d79b"}},{"arxiv_id":"2004.05150","paper":"/paper/longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/pytorch-malware-detection","path":"src/deep_malware_detection/utils.py","file_url":"https://github.com/jaketae/pytorch-malware-detection/blob/HEAD/src/deep_malware_detection/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e566c3f105753aa6","mcp_get_code":{"code_sha256":"e566c3f105753aa6"}},{"arxiv_id":"2002.10118","paper":"/paper/being-bayesian-even-just-a-bit-fixes","title":"Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networks","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wiseodd/last_layer_laplace","path":"paper/laplace/util.py","file_url":"https://github.com/wiseodd/last_layer_laplace/blob/HEAD/paper/laplace/util.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":"00e88cac1828a093","mcp_get_code":{"code_sha256":"00e88cac1828a093"}},{"arxiv_id":"2002.10099","paper":"/paper/implicit-geometric-regularization-for","title":"Implicit Geometric Regularization for Learning Shapes","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peisuke/ImplicitGeometricRegularization.pytorch","path":"predict.py","file_url":"https://github.com/peisuke/ImplicitGeometricRegularization.pytorch/blob/HEAD/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e1ecd97ae5522ad","mcp_get_code":{"code_sha256":"6e1ecd97ae5522ad"}},{"arxiv_id":"2001.01215","paper":"/paper/a-system-for-real-time-interactive-analysis","title":"A System for Real-Time Interactive Analysis of Deep Learning Training","date":"2020-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/tensorwatch","path":"tensorwatch/imagenet_utils.py","file_url":"https://github.com/microsoft/tensorwatch/blob/HEAD/tensorwatch/imagenet_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d72c228526cca499","mcp_get_code":{"code_sha256":"d72c228526cca499"}},{"arxiv_id":"1912.10481","paper":"/paper/a-systematic-comparison-of-bayesian-deep","title":"A Systematic Comparison of Bayesian Deep Learning Robustness in Diabetic Retinopathy Tasks","date":"2019-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/bdl-benchmarks","path":"baselines/diabetic_retinopathy_diagnosis/deep_ensembles/model.py","file_url":"https://github.com/OATML/bdl-benchmarks/blob/HEAD/baselines/diabetic_retinopathy_diagnosis/deep_ensembles/model.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":"28aaca022159c9f5","mcp_get_code":{"code_sha256":"28aaca022159c9f5"}},{"arxiv_id":"1912.10481","paper":"/paper/a-systematic-comparison-of-bayesian-deep","title":"A Systematic Comparison of Bayesian Deep Learning Robustness in Diabetic Retinopathy Tasks","date":"2019-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/bdl-benchmarks","path":"baselines/diabetic_retinopathy_diagnosis/deterministic/model.py","file_url":"https://github.com/OATML/bdl-benchmarks/blob/HEAD/baselines/diabetic_retinopathy_diagnosis/deterministic/model.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":"7f22697a838a0388","mcp_get_code":{"code_sha256":"7f22697a838a0388"}},{"arxiv_id":"1912.10481","paper":"/paper/a-systematic-comparison-of-bayesian-deep","title":"A Systematic Comparison of Bayesian Deep Learning Robustness in Diabetic Retinopathy Tasks","date":"2019-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/bdl-benchmarks","path":"baselines/diabetic_retinopathy_diagnosis/ensemble_mc_dropout/model.py","file_url":"https://github.com/OATML/bdl-benchmarks/blob/HEAD/baselines/diabetic_retinopathy_diagnosis/ensemble_mc_dropout/model.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":"c4bfcb312c170974","mcp_get_code":{"code_sha256":"c4bfcb312c170974"}},{"arxiv_id":"1912.10481","paper":"/paper/a-systematic-comparison-of-bayesian-deep","title":"A Systematic Comparison of Bayesian Deep Learning Robustness in Diabetic Retinopathy Tasks","date":"2019-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/bdl-benchmarks","path":"baselines/diabetic_retinopathy_diagnosis/mc_dropout/model.py","file_url":"https://github.com/OATML/bdl-benchmarks/blob/HEAD/baselines/diabetic_retinopathy_diagnosis/mc_dropout/model.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":"da7fb6e77030b6c7","mcp_get_code":{"code_sha256":"da7fb6e77030b6c7"}},{"arxiv_id":"1912.10481","paper":"/paper/a-systematic-comparison-of-bayesian-deep","title":"A Systematic Comparison of Bayesian Deep Learning Robustness in Diabetic Retinopathy Tasks","date":"2019-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML/bdl-benchmarks","path":"baselines/diabetic_retinopathy_diagnosis/mfvi/model.py","file_url":"https://github.com/OATML/bdl-benchmarks/blob/HEAD/baselines/diabetic_retinopathy_diagnosis/mfvi/model.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":"026cbf4b9aa2c622","mcp_get_code":{"code_sha256":"026cbf4b9aa2c622"}},{"arxiv_id":"1911.04933","paper":"/paper/eternal-sunshine-of-the-spotless-net","title":"Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networks","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zero-or-one/URP","path":"learning/learn.py","file_url":"https://github.com/zero-or-one/URP/blob/HEAD/learning/learn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b7421427efd627f6","mcp_get_code":{"code_sha256":"b7421427efd627f6"}},{"arxiv_id":"1911.02116","paper":"/paper/unsupervised-cross-lingual-representation-1","title":"Unsupervised Cross-lingual Representation Learning at Scale","date":"2019-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/cc_net","path":"cc_net/split_by_lang.py","file_url":"https://github.com/facebookresearch/cc_net/blob/HEAD/cc_net/split_by_lang.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"0d75948d09185811","mcp_get_code":{"code_sha256":"0d75948d09185811"}},{"arxiv_id":"1910.09457","paper":"/paper/aleatoric-and-epistemic-uncertainty-in","title":"Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methods","date":"2019-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tfmortie/uaml","path":"uaml/process.py","file_url":"https://github.com/tfmortie/uaml/blob/HEAD/uaml/process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fdcae1baf1b3b40f","mcp_get_code":{"code_sha256":"fdcae1baf1b3b40f"}},{"arxiv_id":"1909.13334","paper":"/paper/symplectic-recurrent-neural-networks","title":"Symplectic Recurrent Neural Networks","date":"2019-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengdao-chen/SRNN","path":"src/run_experiments.py","file_url":"https://github.com/zhengdao-chen/SRNN/blob/HEAD/src/run_experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a517fbd4327a5dde","mcp_get_code":{"code_sha256":"a517fbd4327a5dde"}},{"arxiv_id":"1909.01520","paper":"/paper/lifelong-machine-learning-with-deep-streaming","title":"Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysis","date":"2019-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyler-hayes/Deep_SLDA","path":"experiment.py","file_url":"https://github.com/tyler-hayes/Deep_SLDA/blob/HEAD/experiment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11231b54f7020f14","mcp_get_code":{"code_sha256":"11231b54f7020f14"}},{"arxiv_id":"1906.10827","paper":"/paper/hierarchical-optimal-transport-for-document","title":"Hierarchical Optimal Transport for Document Representation","date":"2019-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/HOTT","path":"knn_classifier.py","file_url":"https://github.com/IBM/HOTT/blob/HEAD/knn_classifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0770218dc3b86c76","mcp_get_code":{"code_sha256":"0770218dc3b86c76"}},{"arxiv_id":"1906.01549","paper":"/paper/streaming-variational-monte-carlo","title":"Streaming Variational Monte Carlo","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catniplab/svmc","path":"svmc/gp.py","file_url":"https://github.com/catniplab/svmc/blob/HEAD/svmc/gp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af3fade212a88833","mcp_get_code":{"code_sha256":"af3fade212a88833"}},{"arxiv_id":"1906.00651","paper":"/paper/190600651","title":"Probabilistic Noise2Void: Unsupervised Content-Aware Denoising","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juglab/pn2v","path":"src/pn2v/core/prediction.py","file_url":"https://github.com/juglab/pn2v/blob/HEAD/src/pn2v/core/prediction.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":"4c5f0a3f4972f81e","mcp_get_code":{"code_sha256":"4c5f0a3f4972f81e"}},{"arxiv_id":"1904.01561","paper":"/paper/are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous20201002/chemprop","path":"chemprop/sklearn_train.py","file_url":"https://github.com/anonymous20201002/chemprop/blob/HEAD/chemprop/sklearn_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c9a8d90e903cc480","mcp_get_code":{"code_sha256":"c9a8d90e903cc480"}},{"arxiv_id":"1812.11941","paper":"/paper/high-quality-monocular-depth-estimation-via","title":"High Quality Monocular Depth Estimation via Transfer Learning","date":"2018-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rramjee/DenseDepth","path":"Tensorflow/evaluate.py","file_url":"https://github.com/rramjee/DenseDepth/blob/HEAD/Tensorflow/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"6ce438ff124a45a8","mcp_get_code":{"code_sha256":"6ce438ff124a45a8"}},{"arxiv_id":"1812.11941","paper":"/paper/high-quality-monocular-depth-estimation-via","title":"High Quality Monocular Depth Estimation via Transfer Learning","date":"2018-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsshim0125/grmc","path":"utils.py","file_url":"https://github.com/dsshim0125/grmc/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":"9637ab8ac25f366c","mcp_get_code":{"code_sha256":"9637ab8ac25f366c"}},{"arxiv_id":"1812.02288","paper":"/paper/adversarially-learned-anomaly-detection","title":"Adversarially Learned Anomaly Detection","date":"2018-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zahradehghanian97/rcalad","path":"utils/evaluations.py","file_url":"https://github.com/zahradehghanian97/rcalad/blob/HEAD/utils/evaluations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3edf8bb21f5c9b3f","mcp_get_code":{"code_sha256":"3edf8bb21f5c9b3f"}},{"arxiv_id":"1811.12254","paper":"/paper/the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ychnlgy/Chebyshev-Lagrange","path":"db_adhc.py","file_url":"https://github.com/ychnlgy/Chebyshev-Lagrange/blob/HEAD/db_adhc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f11794f4c1b7ca5","mcp_get_code":{"code_sha256":"1f11794f4c1b7ca5"}},{"arxiv_id":"1811.11141","paper":"/paper/mg-wfbp-efficient-data-communication-for","title":"MG-WFBP: Efficient Data Communication for Distributed Synchronous SGD Algorithms","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"shyhuai/B-Caffe","path":"scripts/gmwfbp.py","file_url":"https://github.com/shyhuai/B-Caffe/blob/HEAD/scripts/gmwfbp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"798189972848baa3","mcp_get_code":{"code_sha256":"798189972848baa3"}},{"arxiv_id":"1810.03440","paper":"/paper/probabilistic-solutions-to-ordinary","title":"Probabilistic Solutions To Ordinary Differential Equations As Non-Linear Bayesian Filtering: A New Perspective","date":"2018-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlysy/rodeo","path":"src/rodeo/kalmantv/standard.py","file_url":"https://github.com/mlysy/rodeo/blob/HEAD/src/rodeo/kalmantv/standard.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38225b69bc66f85b","mcp_get_code":{"code_sha256":"38225b69bc66f85b"}},{"arxiv_id":"1809.03672","paper":"/paper/deep-interest-evolution-network-for-click","title":"Deep Interest Evolution Network for Click-Through Rate Prediction","date":"2018-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GitHub-HongweiZhang/prediction-flow","path":"prediction_flow/pytorch/functions.py","file_url":"https://github.com/GitHub-HongweiZhang/prediction-flow/blob/HEAD/prediction_flow/pytorch/functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3d04f508c82a301","mcp_get_code":{"code_sha256":"c3d04f508c82a301"}},{"arxiv_id":"1805.01934","paper":"/paper/learning-to-see-in-the-dark","title":"Learning to See in the Dark","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashikshafi08/learning_to_see_in_the_dark_Fastai","path":"libs/functionality.py","file_url":"https://github.com/ashikshafi08/learning_to_see_in_the_dark_Fastai/blob/HEAD/libs/functionality.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c44e194c35a67b4c","mcp_get_code":{"code_sha256":"c44e194c35a67b4c"}},{"arxiv_id":"1711.11053","paper":"/paper/a-multi-horizon-quantile-recurrent-forecaster","title":"A Multi-Horizon Quantile Recurrent Forecaster","date":"2017-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ErezSC42/qr_forcaster","path":"test_pred.py","file_url":"https://github.com/ErezSC42/qr_forcaster/blob/HEAD/test_pred.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":"452926faea7b3edc","mcp_get_code":{"code_sha256":"452926faea7b3edc"}},{"arxiv_id":"1711.10098","paper":"/paper/attentive-generative-adversarial-network-for","title":"Attentive Generative Adversarial Network for Raindrop Removal from a Single Image","date":"2017-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui1996/DeRaindrop","path":"predict.py","file_url":"https://github.com/rui1996/DeRaindrop/blob/HEAD/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05d7486897e98abd","mcp_get_code":{"code_sha256":"05d7486897e98abd"}},{"arxiv_id":"1711.05225","paper":"/paper/chexnet-radiologist-level-pneumonia-detection","title":"CheXNet: Radiologist-Level Pneumonia Detection on Chest X-Rays with Deep Learning","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dstrick17/Deep-Learning-Project","path":"XRay_app/utils/model_utils.py","file_url":"https://github.com/dstrick17/Deep-Learning-Project/blob/HEAD/XRay_app/utils/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1de89e0659407359","mcp_get_code":{"code_sha256":"1de89e0659407359"}},{"arxiv_id":"1710.10628","paper":"/paper/variational-continual-learning","title":"Variational Continual Learning","date":"2017-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Piyush-555/VCL-in-PyTorch","path":"vcl.py","file_url":"https://github.com/Piyush-555/VCL-in-PyTorch/blob/HEAD/vcl.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":"4983e8a74d84d9c6","mcp_get_code":{"code_sha256":"4983e8a74d84d9c6"}},{"arxiv_id":"1710.09435","paper":"/paper/malware-detection-by-eating-a-whole-exe","title":"Malware Detection by Eating a Whole EXE","date":"2017-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/deep-malware-detection","path":"src/deep_malware_detection/utils.py","file_url":"https://github.com/jaketae/deep-malware-detection/blob/HEAD/src/deep_malware_detection/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e566c3f105753aa6","mcp_get_code":{"code_sha256":"e566c3f105753aa6"}},{"arxiv_id":"1703.01488","paper":"/paper/autoencoding-variational-inference-for-topic","title":"Autoencoding Variational Inference For Topic Models","date":"2017-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vlukiyanov/pt-avitm","path":"ptavitm/model.py","file_url":"https://github.com/vlukiyanov/pt-avitm/blob/HEAD/ptavitm/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c07b9b907915c094","mcp_get_code":{"code_sha256":"c07b9b907915c094"}},{"arxiv_id":"1609.09552","paper":"/paper/controlling-output-length-in-neural-encoder","title":"Controlling Output Length in Neural Encoder-Decoders","date":"2016-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiyukuta/lencon","path":"code/predict.py","file_url":"https://github.com/kiyukuta/lencon/blob/HEAD/code/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"301fa2a9436c4020","mcp_get_code":{"code_sha256":"301fa2a9436c4020"}},{"arxiv_id":"1608.04644","paper":"/paper/towards-evaluating-the-robustness-of-neural","title":"Towards Evaluating the Robustness of Neural Networks","date":"2016-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkew3/pytorch-cw2","path":"runutils.py","file_url":"https://github.com/kkew3/pytorch-cw2/blob/HEAD/runutils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6189cef972a4615e","mcp_get_code":{"code_sha256":"6189cef972a4615e"}},{"arxiv_id":"1606.04797","paper":"/paper/v-net-fully-convolutional-neural-networks-for","title":"V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentation","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salem-devloper/COVID-Lung-Segment","path":"predict.py","file_url":"https://github.com/salem-devloper/COVID-Lung-Segment/blob/HEAD/predict.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9711482ce4405f41","mcp_get_code":{"code_sha256":"9711482ce4405f41"}},{"arxiv_id":"1602.00763","paper":"/paper/simple-online-and-realtime-tracking","title":"Simple Online and Realtime Tracking","date":"2016-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nakul-shahdadpuri/narknet","path":"classify/image.py","file_url":"https://github.com/nakul-shahdadpuri/narknet/blob/HEAD/classify/image.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c3a20ca1df7ba229","mcp_get_code":{"code_sha256":"c3a20ca1df7ba229"}},{"arxiv_id":"1511.07122","paper":"/paper/multi-scale-context-aggregation-by-dilated","title":"Multi-Scale Context Aggregation by Dilated Convolutions","date":"2015-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Entodi/meshnet-pytorch","path":"utils.py","file_url":"https://github.com/Entodi/meshnet-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":"dda04da9efb51fa5","mcp_get_code":{"code_sha256":"dda04da9efb51fa5"}},{"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":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bb4a33fd80fc63c6","mcp_get_code":{"code_sha256":"bb4a33fd80fc63c6"}},{"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":"68ca7aff4be5a972","mcp_get_code":{"code_sha256":"68ca7aff4be5a972"}},{"arxiv_id":"1412.3555","paper":"/paper/empirical-evaluation-of-gated-recurrent","title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling","date":"2014-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lugq1990/neural-nets","path":"utils/neuralEval.py","file_url":"https://github.com/lugq1990/neural-nets/blob/HEAD/utils/neuralEval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5975583f9b79ee63","mcp_get_code":{"code_sha256":"5975583f9b79ee63"}},{"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":"delldu/TextCNN","path":"model.py","file_url":"https://github.com/delldu/TextCNN/blob/HEAD/model.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":"60169e8e6c263250","mcp_get_code":{"code_sha256":"60169e8e6c263250"}},{"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":"c5beea5bfbce4121","mcp_get_code":{"code_sha256":"c5beea5bfbce4121"}},{"arxiv_id":"aaai_32078","paper":null,"title":"arXiv:aaai_32078","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YifanZhang-git/SKAPP","path":"src/data.py","file_url":"https://github.com/YifanZhang-git/SKAPP/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e84fd050cfefe633","mcp_get_code":{"code_sha256":"e84fd050cfefe633"}},{"arxiv_id":"aaai_29784","paper":null,"title":"arXiv:aaai_29784","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HITsz-TMG/Ext-Sub","path":"eval/toxic_eval_generation.py","file_url":"https://github.com/HITsz-TMG/Ext-Sub/blob/HEAD/eval/toxic_eval_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a911824709b51f8","mcp_get_code":{"code_sha256":"3a911824709b51f8"}},{"arxiv_id":"aaai_27944","paper":null,"title":"arXiv:aaai_27944","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"FengZicai/Interpretable3D","path":"PointNet2/train_modelnet_ip3d.py","file_url":"https://github.com/FengZicai/Interpretable3D/blob/HEAD/PointNet2/train_modelnet_ip3d.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c8b7fa61d622495","mcp_get_code":{"code_sha256":"2c8b7fa61d622495"}},{"arxiv_id":"aaai_26111","paper":null,"title":"arXiv:aaai_26111","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"azencot-group/KANN","path":"kann/ecg_task/ecg_task_utils.py","file_url":"https://github.com/azencot-group/KANN/blob/HEAD/kann/ecg_task/ecg_task_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a8c1dcab7cad83fd","mcp_get_code":{"code_sha256":"a8c1dcab7cad83fd"}},{"arxiv_id":"Phoo_Coarsely-Labeled_Data_for_Better_Few-Shot_Transfer_ICCV_2021_paper","paper":null,"title":"arXiv:Phoo_Coarsely-Labeled_Data_for_Better_Few-Shot_Transfer_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cpphoo/PAS","path":"models/metric.py","file_url":"https://github.com/cpphoo/PAS/blob/HEAD/models/metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"acfb720c9b415cc3","mcp_get_code":{"code_sha256":"acfb720c9b415cc3"}},{"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":"e1a7af16583e5435","mcp_get_code":{"code_sha256":"e1a7af16583e5435"}},{"arxiv_id":"2023.findings-acl.428","paper":null,"title":"arXiv:2023.findings-acl.428","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"salesforce/QAFactEval","path":"lerc_quip.py","file_url":"https://github.com/salesforce/QAFactEval/blob/HEAD/lerc_quip.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":"5d9038c86d526249","mcp_get_code":{"code_sha256":"5d9038c86d526249"}}]}