{"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/preprocess-data","entry":"preprocess_data","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":44,"n_papers_ran":16,"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":51,"n_samples_ran":18,"n_samples_fingerprinted":3,"n_places":54,"n_places_pointer_only":15,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":6,"ran_fixture":0,"ran":11,"unverified":33},"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":"2606.09124","paper":"/paper/arxiv-2606-09124","title":"A Regret Minimization Framework on Preference Learning in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YSLIU627/Regularized-Preference-Optimization","path":"OpenRLHF/openrlhf/datasets/unpaired_preference_dataset.py","file_url":"https://github.com/YSLIU627/Regularized-Preference-Optimization/blob/HEAD/OpenRLHF/openrlhf/datasets/unpaired_preference_dataset.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":"f4db4c93fe22b070","mcp_get_code":{"code_sha256":"f4db4c93fe22b070"}},{"arxiv_id":"2602.03411","paper":"/paper/arxiv-2602-03411","title":"SWE-Master: Unleashing the Potential of Software Engineering Agents via Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RUCAIBox/SWE-Master","path":"OpenRLHF_SFT/scripts_swe_master/sft_data_pre_tokenize.py","file_url":"https://github.com/RUCAIBox/SWE-Master/blob/HEAD/OpenRLHF_SFT/scripts_swe_master/sft_data_pre_tokenize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a48d5458f99a6b87","mcp_get_code":{"code_sha256":"a48d5458f99a6b87"}},{"arxiv_id":"2602.03411","paper":"/paper/arxiv-2602-03411","title":"SWE-Master: Unleashing the Potential of Software Engineering Agents via Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RUCAIBox/SWE-Master","path":"OpenRLHF_SFT/scripts_swe_master/sft_data_pre_tokenize_toolcall.py","file_url":"https://github.com/RUCAIBox/SWE-Master/blob/HEAD/OpenRLHF_SFT/scripts_swe_master/sft_data_pre_tokenize_toolcall.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31b049c55ece2f82","mcp_get_code":{"code_sha256":"31b049c55ece2f82"}},{"arxiv_id":"2602.03411","paper":"/paper/arxiv-2602-03411","title":"SWE-Master: Unleashing the Potential of Software Engineering Agents via Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"RUCAIBox/SWE-Master","path":"OpenRLHF_SFT/scripts_swe_master/sft_dataset.py","file_url":"https://github.com/RUCAIBox/SWE-Master/blob/HEAD/OpenRLHF_SFT/scripts_swe_master/sft_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e9101bb92d47eb7","mcp_get_code":{"code_sha256":"3e9101bb92d47eb7"}},{"arxiv_id":"2601.17907","paper":"/paper/arxiv-2601-17907","title":"FARM: Few-shot Adaptive Malware Family Classification under Concept Drift","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"numanhg/farm","path":"farm/preprocessing.py","file_url":"https://github.com/numanhg/farm/blob/HEAD/farm/preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"264b4f8629fb2589","mcp_get_code":{"code_sha256":"264b4f8629fb2589"}},{"arxiv_id":"2506.18931","paper":"/paper/safe-pruning-lora-robust-distance-guided","title":"Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs","date":"2025-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aoshuang92/splora","path":"llama2_alpaca_pd_lora.py","file_url":"https://github.com/aoshuang92/splora/blob/HEAD/llama2_alpaca_pd_lora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6caafdd232227d6c","mcp_get_code":{"code_sha256":"6caafdd232227d6c"}},{"arxiv_id":"2506.18931","paper":"/paper/safe-pruning-lora-robust-distance-guided","title":"Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs","date":"2025-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aoshuang92/splora","path":"llama2_diagsum_pd_lora.py","file_url":"https://github.com/aoshuang92/splora/blob/HEAD/llama2_diagsum_pd_lora.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c232d8c347b3b6fa","mcp_get_code":{"code_sha256":"c232d8c347b3b6fa"}},{"arxiv_id":"2506.08762","paper":"/paper/2506-08762","title":"EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sakanaai/edinet-bench","path":"src/edinet_bench/logistic.py","file_url":"https://github.com/sakanaai/edinet-bench/blob/HEAD/src/edinet_bench/logistic.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":"f738811c8a5b14ff","mcp_get_code":{"code_sha256":"f738811c8a5b14ff"}},{"arxiv_id":"2505.02835","paper":"/paper/r1-reward-training-multimodal-reward-model","title":"R1-Reward: Training Multimodal Reward Model Through Stable Reinforcement Learning","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfzhang114/r1_reward","path":"openrlhf/datasets/reward_dataset.py","file_url":"https://github.com/yfzhang114/r1_reward/blob/HEAD/openrlhf/datasets/reward_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"186719542da38f30","mcp_get_code":{"code_sha256":"186719542da38f30"}},{"arxiv_id":"2504.10160","paper":"/paper/mt-r1-zero-advancing-llm-based-machine","title":"MT-R1-Zero: Advancing LLM-based Machine Translation via R1-Zero-like Reinforcement Learning","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzp0424/mt-r1-zero","path":"data/process_data.py","file_url":"https://github.com/fzp0424/mt-r1-zero/blob/HEAD/data/process_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7fdb1a0328cc9d4a","mcp_get_code":{"code_sha256":"7fdb1a0328cc9d4a"}},{"arxiv_id":"2504.08837","paper":"/paper/vl-rethinker-incentivizing-self-reflection-of","title":"VL-Rethinker: Incentivizing Self-Reflection of Vision-Language Models with Reinforcement Learning","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiger-ai-lab/vl-rethinker","path":"openrlhf/datasets/prompts_dataset.py","file_url":"https://github.com/tiger-ai-lab/vl-rethinker/blob/HEAD/openrlhf/datasets/prompts_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8368fe60f5326faa","mcp_get_code":{"code_sha256":"8368fe60f5326faa"}},{"arxiv_id":"2503.12811","paper":"/paper/a-multi-power-law-for-loss-curve-prediction","title":"A Multi-Power Law for Loss Curve Prediction Across Learning Rate Schedules","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-yao-01-luo/multipowerlaw","path":"src/utils.py","file_url":"https://github.com/thu-yao-01-luo/multipowerlaw/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e1fc14a90913b68","mcp_get_code":{"code_sha256":"2e1fc14a90913b68"}},{"arxiv_id":"2503.03862","paper":"/paper/not-just-scaling-laws-towards-a-better","title":"Not-Just-Scaling Laws: Towards a Better Understanding of the Downstream Impact of Language Model Design Decisions","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nightingal3/llm-pretraining-behaviours","path":"performance_prediction/performance_predict_from_db.py","file_url":"https://github.com/nightingal3/llm-pretraining-behaviours/blob/HEAD/performance_prediction/performance_predict_from_db.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":"c2e9a027226aca3d","mcp_get_code":{"code_sha256":"c2e9a027226aca3d"}},{"arxiv_id":"2502.09597","paper":"/paper/do-llms-recognize-your-preferences-evaluating","title":"Do LLMs Recognize Your Preferences? Evaluating Personalized Preference Following in LLMs","date":"2025-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/PrefEval","path":"SFT/train_sft.py","file_url":"https://github.com/amazon-science/PrefEval/blob/HEAD/SFT/train_sft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"fa9be43aab6cf2aa","mcp_get_code":{"code_sha256":"fa9be43aab6cf2aa"}},{"arxiv_id":"2407.16893","paper":"/paper/the-price-of-prompting-profiling-energy-use","title":"The Price of Prompting: Profiling Energy Use in Large Language Models Inference","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejhusom/melodi","path":"src/train_forecasting_model.py","file_url":"https://github.com/ejhusom/melodi/blob/HEAD/src/train_forecasting_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dceaa34a68276fe1","mcp_get_code":{"code_sha256":"dceaa34a68276fe1"}},{"arxiv_id":"2406.13807","paper":"/paper/alanavlm-a-multimodal-embodied-ai-foundation","title":"AlanaVLM: A Multimodal Embodied AI Foundation Model for Egocentric Video Understanding","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alanaai/evud","path":"gemini/prepare_ego4d_vqa_gemini_dataset.py","file_url":"https://github.com/alanaai/evud/blob/HEAD/gemini/prepare_ego4d_vqa_gemini_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd7e60a6f8674afa","mcp_get_code":{"code_sha256":"cd7e60a6f8674afa"}},{"arxiv_id":"2406.01806","paper":"/paper/contextualized-sequence-likelihood-enhanced","title":"Contextualized Sequence Likelihood: Enhanced Confidence Scores for Natural Language Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlin7/contextsl","path":"dataeval/nq_open_new.py","file_url":"https://github.com/zlin7/contextsl/blob/HEAD/dataeval/nq_open_new.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0251f96f3be99807","mcp_get_code":{"code_sha256":"0251f96f3be99807"}},{"arxiv_id":"2406.01806","paper":"/paper/contextualized-sequence-likelihood-enhanced","title":"Contextualized Sequence Likelihood: Enhanced Confidence Scores for Natural Language Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlin7/contextsl","path":"dataeval/triviaqa_new.py","file_url":"https://github.com/zlin7/contextsl/blob/HEAD/dataeval/triviaqa_new.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"874d540a196bc77b","mcp_get_code":{"code_sha256":"874d540a196bc77b"}},{"arxiv_id":"2406.00215","paper":"/paper/benchmarking-the-communication-competence-of","title":"HumanEvalComm: Benchmarking the Communication Competence of Code Generation for LLMs and LLM Agent","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"jie-jw-wu/human-eval-comm","path":"AgentFramework/designer.py","file_url":"https://github.com/jie-jw-wu/human-eval-comm/blob/HEAD/AgentFramework/designer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"491a124a37148dfd","mcp_get_code":{"code_sha256":"491a124a37148dfd"}},{"arxiv_id":"2406.00215","paper":"/paper/benchmarking-the-communication-competence-of","title":"HumanEvalComm: Benchmarking the Communication Competence of Code Generation for LLMs and LLM Agent","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"jie-jw-wu/human-eval-comm","path":"AgentFramework/executor.py","file_url":"https://github.com/jie-jw-wu/human-eval-comm/blob/HEAD/AgentFramework/executor.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b231819920453b1d","mcp_get_code":{"code_sha256":"b231819920453b1d"}},{"arxiv_id":"2406.00215","paper":"/paper/benchmarking-the-communication-competence-of","title":"HumanEvalComm: Benchmarking the Communication Competence of Code Generation for LLMs and LLM Agent","date":null,"month_inferred_from_arxiv_id":"2024-06","title_source":"archive","repo":"jie-jw-wu/human-eval-comm","path":"AgentFramework/programmer.py","file_url":"https://github.com/jie-jw-wu/human-eval-comm/blob/HEAD/AgentFramework/programmer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"854e64377cfc300a","mcp_get_code":{"code_sha256":"854e64377cfc300a"}},{"arxiv_id":"2405.07667","paper":"/paper/backdoor-removal-for-generative-large","title":"Simulate and Eliminate: Revoke Backdoors for Generative Large Language Models","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/SANDE","path":"dataset.py","file_url":"https://github.com/HKUST-KnowComp/SANDE/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"775a2e3aee27b5c8","mcp_get_code":{"code_sha256":"775a2e3aee27b5c8"}},{"arxiv_id":"2405.02678","paper":"/paper/position-paper-quo-vadis-unsupervised-time","title":"Position: Quo Vadis, Unsupervised Time Series Anomaly Detection?","date":"2024-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssarfraz/QuoVadisTAD","path":"quovadis_tad/dataset_utils/data_utils.py","file_url":"https://github.com/ssarfraz/QuoVadisTAD/blob/HEAD/quovadis_tad/dataset_utils/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"baeee7bf45f131bd","mcp_get_code":{"code_sha256":"baeee7bf45f131bd"}},{"arxiv_id":"2402.19085","paper":"/paper/controllable-preference-optimization-toward","title":"Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenBMB/CPO","path":"src/CDPO/cdpo/cdpo_ultrafeedback.py","file_url":"https://github.com/OpenBMB/CPO/blob/HEAD/src/CDPO/cdpo/cdpo_ultrafeedback.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fba000175d7bcb8e","mcp_get_code":{"code_sha256":"fba000175d7bcb8e"}},{"arxiv_id":"2402.19085","paper":"/paper/controllable-preference-optimization-toward","title":"Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenBMB/CPO","path":"src/CDPO/cdpo/cdpo_ultrasafety.py","file_url":"https://github.com/OpenBMB/CPO/blob/HEAD/src/CDPO/cdpo/cdpo_ultrasafety.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97785ad2ada07093","mcp_get_code":{"code_sha256":"97785ad2ada07093"}},{"arxiv_id":"2402.09205","paper":"/paper/tell-me-more-towards-implicit-user-intention","title":"Tell Me More! Towards Implicit User Intention Understanding of Language Model Driven Agents","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hbx-hbx/mistral-interact","path":"src/sft.py","file_url":"https://github.com/hbx-hbx/mistral-interact/blob/HEAD/src/sft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3c0273dded3c124d","mcp_get_code":{"code_sha256":"3c0273dded3c124d"}},{"arxiv_id":"2312.13010","paper":"/paper/agentcoder-multi-agent-based-code-generation","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangd1999/AgentCoder","path":"src/programmer_humaneval.py","file_url":"https://github.com/huangd1999/AgentCoder/blob/HEAD/src/programmer_humaneval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5eeb9ec29247e67","mcp_get_code":{"code_sha256":"e5eeb9ec29247e67"}},{"arxiv_id":"2309.16157","paper":"/paper/sampling-methods-for-inner-product-sketching","title":"Sampling Methods for Inner Product Sketching","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":"archive","repo":"vida-nyu/samplingmethodsforinnerproductsketching","path":"script/experiment_20news.py","file_url":"https://github.com/vida-nyu/samplingmethodsforinnerproductsketching/blob/HEAD/script/experiment_20news.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b82b89ccee261003","mcp_get_code":{"code_sha256":"b82b89ccee261003"}},{"arxiv_id":"2309.14972","paper":"/paper/improving-unsupervised-visual-program","title":"Improving Unsupervised Visual Program Inference with Code Rewriting Families","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BardOfCodes/coref","path":"coref/dataloader/shapes_data.py","file_url":"https://github.com/BardOfCodes/coref/blob/HEAD/coref/dataloader/shapes_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c2b11afcdad50d08","mcp_get_code":{"code_sha256":"c2b11afcdad50d08"}},{"arxiv_id":"2307.08922","paper":"/paper/large-language-models-perform-diagnostic","title":"Large Language Models Perform Diagnostic Reasoning","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlplab-best-team/diagnostic-reasoning","path":"eda/utils.py","file_url":"https://github.com/nlplab-best-team/diagnostic-reasoning/blob/HEAD/eda/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a544b157dd386e5e","mcp_get_code":{"code_sha256":"a544b157dd386e5e"}},{"arxiv_id":"2306.03423","paper":"/paper/i-m-afraid-i-can-t-do-that-predicting-prompt","title":"I'm Afraid I Can't Do That: Predicting Prompt Refusal in Black-Box Generative Language Models","date":"2023-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxwellreuter/chatgpt-refusals","path":"data_processing.py","file_url":"https://github.com/maxwellreuter/chatgpt-refusals/blob/HEAD/data_processing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"33ca67b23dd794c6","mcp_get_code":{"code_sha256":"33ca67b23dd794c6"}},{"arxiv_id":"2305.13788","paper":"/paper/can-large-language-models-infer-and-disagree","title":"Can Large Language Models Capture Dissenting Human Voices?","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xfactlab/emnlp2023-LLM-Disagreement","path":"utils/visualize.py","file_url":"https://github.com/xfactlab/emnlp2023-LLM-Disagreement/blob/HEAD/utils/visualize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c501787fde562c3c","mcp_get_code":{"code_sha256":"c501787fde562c3c"}},{"arxiv_id":"2303.10087","paper":"/paper/refinement-for-absolute-pose-regression-with","title":"Neural Refinement for Absolute Pose Regression with Feature Synthesis","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/NeFeS","path":"script/dm/pose_model.py","file_url":"https://github.com/ActiveVisionLab/NeFeS/blob/HEAD/script/dm/pose_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d4f466dd0b12111","mcp_get_code":{"code_sha256":"1d4f466dd0b12111"}},{"arxiv_id":"2212.08641","paper":"/paper/gfpose-learning-3d-human-pose-prior-with","title":"GFPose: Learning 3D Human Pose Prior with Gradient Fields","date":"2022-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Embracing/GFPose","path":"run/visualize.py","file_url":"https://github.com/Embracing/GFPose/blob/HEAD/run/visualize.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":"2f4ab069f8c74953","mcp_get_code":{"code_sha256":"2f4ab069f8c74953"}},{"arxiv_id":"2211.02744","paper":"/paper/kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibpa/kglm","path":"src/utils/preprocess_data.py","file_url":"https://github.com/ibpa/kglm/blob/HEAD/src/utils/preprocess_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"18b9c7deeedbe427","mcp_get_code":{"code_sha256":"18b9c7deeedbe427"}},{"arxiv_id":"2210.03466","paper":"/paper/latent-neural-odes-with-sparse-bayesian","title":"Latent Neural ODEs with Sparse Bayesian Multiple Shooting","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yakovlev31/msvi","path":"msvi/utils/bballs.py","file_url":"https://github.com/yakovlev31/msvi/blob/HEAD/msvi/utils/bballs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fdd634b9d9124a80","mcp_get_code":{"code_sha256":"fdd634b9d9124a80"}},{"arxiv_id":"2208.14111","paper":"/paper/transformers-with-learnable-activation","title":"Transformers with Learnable Activation Functions","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/2022-raft","path":"run_mlm.py","file_url":"https://github.com/ukplab/2022-raft/blob/HEAD/run_mlm.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":"1283d0e322799e75","mcp_get_code":{"code_sha256":"1283d0e322799e75"}},{"arxiv_id":"2204.00559","paper":"/paper/dfnet-enhance-aboslute-pose-regression-with","title":"DFNet: Enhance Absolute Pose Regression with Direct Feature Matching","date":"2022-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activevisionlab/dfnet","path":"script/dm/pose_model.py","file_url":"https://github.com/activevisionlab/dfnet/blob/HEAD/script/dm/pose_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d4f466dd0b12111","mcp_get_code":{"code_sha256":"1d4f466dd0b12111"}},{"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":"4199f8e7c0c6ab7e","mcp_get_code":{"code_sha256":"4199f8e7c0c6ab7e"}},{"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_ovr.py","file_url":"https://github.com/KimGroup/QGasML/blob/HEAD/lassopath_ovr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"727f94645379b981","mcp_get_code":{"code_sha256":"727f94645379b981"}},{"arxiv_id":"2104.04073","paper":"/paper/direct-posenet-absolute-pose-regression-with","title":"Direct-PoseNet: Absolute Pose Regression with Photometric Consistency","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/direct-posenet","path":"script/pose_model.py","file_url":"https://github.com/ActiveVisionLab/direct-posenet/blob/HEAD/script/pose_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d4f466dd0b12111","mcp_get_code":{"code_sha256":"1d4f466dd0b12111"}},{"arxiv_id":"2101.03238","paper":"/paper/neurosymbolic-transformers-for-multi-agent-1","title":"Neurosymbolic Transformers for Multi-Agent Communication","date":"2021-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinala/multi-agent-neurosym-transformers","path":"main/train_dt.py","file_url":"https://github.com/jinala/multi-agent-neurosym-transformers/blob/HEAD/main/train_dt.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":"4a8ac0850c83446e","mcp_get_code":{"code_sha256":"4a8ac0850c83446e"}},{"arxiv_id":"2011.01404","paper":"/paper/faraway-frustum-dealing-with-lidar-sparsity","title":"Faraway-Frustum: Dealing with Lidar Sparsity for 3D Object Detection using Fusion","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongfang-steven-yang/faraway-frustum","path":"step2_get_kitti_results.py","file_url":"https://github.com/dongfang-steven-yang/faraway-frustum/blob/HEAD/step2_get_kitti_results.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":"81fda250de9b50a3","mcp_get_code":{"code_sha256":"81fda250de9b50a3"}},{"arxiv_id":"2006.12138","paper":"/paper/graph-neural-networks-in-tensorflow-and-keras","title":"Graph Neural Networks in TensorFlow and Keras with Spektral","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielegrattarola/spektral","path":"spektral/datasets/graphsage.py","file_url":"https://github.com/danielegrattarola/spektral/blob/HEAD/spektral/datasets/graphsage.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5dd02dc57931ba2f","mcp_get_code":{"code_sha256":"5dd02dc57931ba2f"}},{"arxiv_id":"1910.10683","paper":"/paper/exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shivamraval98/multitask-t5_ae","path":"src/models/T5Model/t5_utils.py","file_url":"https://github.com/shivamraval98/multitask-t5_ae/blob/HEAD/src/models/T5Model/t5_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2366fa00a16ea6b4","mcp_get_code":{"code_sha256":"2366fa00a16ea6b4"}},{"arxiv_id":"1903.05711","paper":"/paper/pointnetlk-robust-efficient-point-cloud","title":"PointNetLK: Robust & Efficient Point Cloud Registration using PointNet","date":"2019-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinits5/PointNetLK","path":"utils/data_utils.py","file_url":"https://github.com/vinits5/PointNetLK/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b7f8841b68729bda","mcp_get_code":{"code_sha256":"b7f8841b68729bda"}},{"arxiv_id":"1903.01015","paper":"/paper/a-kernelized-manifold-mapping-to-diminish-the","title":"A Kernelized Manifold Mapping to Diminish the Effect of Adversarial Perturbations","date":"2019-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asgsaeid/KernelizedManifoldMapping","path":"data.py","file_url":"https://github.com/asgsaeid/KernelizedManifoldMapping/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39dc1f035e3f9c9d","mcp_get_code":{"code_sha256":"39dc1f035e3f9c9d"}},{"arxiv_id":"1901.09948","paper":"/paper/surrogate-gradient-learning-in-spiking-neural","title":"Surrogate Gradient Learning in Spiking Neural Networks","date":"2019-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"honzikv/use-of-snn","path":"experiments/bnci_horizon_experiment/data_preprocessing.py","file_url":"https://github.com/honzikv/use-of-snn/blob/HEAD/experiments/bnci_horizon_experiment/data_preprocessing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"380b232e5ab07df5","mcp_get_code":{"code_sha256":"380b232e5ab07df5"}},{"arxiv_id":"1901.07441","paper":"/paper/padchest-a-large-chest-x-ray-image-dataset","title":"PadChest: A large chest x-ray image dataset with multi-label annotated reports","date":"2019-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajpurkarlab/chexzero","path":"preprocess_padchest.py","file_url":"https://github.com/rajpurkarlab/chexzero/blob/HEAD/preprocess_padchest.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c2197559c73f7c3","mcp_get_code":{"code_sha256":"7c2197559c73f7c3"}},{"arxiv_id":"1811.04017","paper":"/paper/a-generic-framework-for-privacy-preserving","title":"A generic framework for privacy preserving deep learning","date":"2018-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SanaAwan5/transfer_learning_on_mnist_spdz","path":"dataset.py","file_url":"https://github.com/SanaAwan5/transfer_learning_on_mnist_spdz/blob/HEAD/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ad5eca2af374293a","mcp_get_code":{"code_sha256":"ad5eca2af374293a"}},{"arxiv_id":"1811.04017","paper":"/paper/a-generic-framework-for-privacy-preserving","title":"A generic framework for privacy preserving deep learning","date":"2018-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SanaAwan5/transfer_learning_on_mnist_spdz","path":"dataset_emnist.py","file_url":"https://github.com/SanaAwan5/transfer_learning_on_mnist_spdz/blob/HEAD/dataset_emnist.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":"cf1ca8eb225f00e9","mcp_get_code":{"code_sha256":"cf1ca8eb225f00e9"}},{"arxiv_id":"1806.10701","paper":"/paper/empirical-risk-minimization-and-stochastic","title":"Empirical Risk Minimization and Stochastic Gradient Descent for Relational Data","date":"2018-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wooden-spoon/relational-ERM","path":"src/relational_erm/data_processing/pokec.py","file_url":"https://github.com/wooden-spoon/relational-ERM/blob/HEAD/src/relational_erm/data_processing/pokec.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4e29a9d525179a1","mcp_get_code":{"code_sha256":"f4e29a9d525179a1"}},{"arxiv_id":"1806.10701","paper":"/paper/empirical-risk-minimization-and-stochastic","title":"Empirical Risk Minimization and Stochastic Gradient Descent for Relational Data","date":"2018-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wooden-spoon/relational-ERM","path":"src/relational_erm/data_processing/wikipedia_hyperlink.py","file_url":"https://github.com/wooden-spoon/relational-ERM/blob/HEAD/src/relational_erm/data_processing/wikipedia_hyperlink.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c26027e156fcba64","mcp_get_code":{"code_sha256":"c26027e156fcba64"}},{"arxiv_id":"2024.findings-emnlp.649","paper":null,"title":"arXiv:2024.findings-emnlp.649","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"alanaai/EVUD","path":"gemini/prepare_ego4d_vqa_gemini_dataset.py","file_url":"https://github.com/alanaai/EVUD/blob/HEAD/gemini/prepare_ego4d_vqa_gemini_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd7e60a6f8674afa","mcp_get_code":{"code_sha256":"cd7e60a6f8674afa"}}]}