{"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/process-data","entry":"process_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":61,"n_papers_ran":26,"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":60,"n_samples_ran":24,"n_samples_fingerprinted":0,"n_places":64,"n_places_pointer_only":30,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":1,"ran":16,"unverified":36},"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":"2605.15491","paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Nota-NetsPresso/shortened-llm","path":"src/dataset.py","file_url":"https://github.com/Nota-NetsPresso/shortened-llm/blob/HEAD/src/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a69aa6e08dc65a9","mcp_get_code":{"code_sha256":"8a69aa6e08dc65a9"}},{"arxiv_id":"2605.12220","paper":"/paper/arxiv-2605-12220","title":"TriBand-BEV: Real-Time LiDAR-Only 3D Pedestrian Detection via Height-Aware BEV and High-Resolution Feature Fusion","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mohammadkhsh/TriBand-BEV","path":"result_final_inter.py","file_url":"https://github.com/mohammadkhsh/TriBand-BEV/blob/HEAD/result_final_inter.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f9dc34bfad77825b","mcp_get_code":{"code_sha256":"f9dc34bfad77825b"}},{"arxiv_id":"2602.04982","paper":"/paper/arxiv-2602-04982","title":"BioACE: An Automated Framework for Biomedical Answer and Citation Evaluations","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"deepaknlp/BioACE","path":"src/citation_eval.py","file_url":"https://github.com/deepaknlp/BioACE/blob/HEAD/src/citation_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5c354a76f4bfd947","mcp_get_code":{"code_sha256":"5c354a76f4bfd947"}},{"arxiv_id":"2601.01192","paper":"/paper/arxiv-2601-01192","title":"Crowded Video Individual Counting Informed by Social Grouping and Spatial-Temporal Displacement Priors","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"tiny-smart/OMAN","path":"datasets/Locator_dataset.py","file_url":"https://github.com/tiny-smart/OMAN/blob/HEAD/datasets/Locator_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3d064faa02210672","mcp_get_code":{"code_sha256":"3d064faa02210672"}},{"arxiv_id":"2507.11275","paper":null,"title":"arXiv:2507.11275","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"JadeXie1205/FMC","path":"autoformalization_pipeline/verifier_deepseek_fun.py","file_url":"https://github.com/JadeXie1205/FMC/blob/HEAD/autoformalization_pipeline/verifier_deepseek_fun.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":"d945bd1fe6a3e48d","mcp_get_code":{"code_sha256":"d945bd1fe6a3e48d"}},{"arxiv_id":"2506.10822","paper":"/paper/recut-balancing-reasoning-length-and-accuracy","title":"ReCUT: Balancing Reasoning Length and Accuracy in LLMs via Stepwise Trails and Preference Optimization","date":"2025-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuir/recut","path":"src/long2short_dpo.py","file_url":"https://github.com/neuir/recut/blob/HEAD/src/long2short_dpo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5565601a35e6f32a","mcp_get_code":{"code_sha256":"5565601a35e6f32a"}},{"arxiv_id":"2505.15210","paper":"/paper/deliberation-on-priors-trustworthy-reasoning","title":"Deliberation on Priors: Trustworthy Reasoning of Large Language Models on Knowledge Graphs","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mira-ai-lab/deliberation-on-priors","path":"reasoning/introspection.py","file_url":"https://github.com/mira-ai-lab/deliberation-on-priors/blob/HEAD/reasoning/introspection.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":"2fad8c014befa093","mcp_get_code":{"code_sha256":"2fad8c014befa093"}},{"arxiv_id":"2503.18596","paper":"/paper/linkalign-scalable-schema-linking-for-real","title":"LinkAlign: Scalable Schema Linking for Real-World Large-Scale Multi-Database Text-to-SQL","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Satissss/LinkAlign","path":"preprocess.py","file_url":"https://github.com/Satissss/LinkAlign/blob/HEAD/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"55f2b77cb9cceeab","mcp_get_code":{"code_sha256":"55f2b77cb9cceeab"}},{"arxiv_id":"2502.11133","paper":"/paper/masrouter-learning-to-route-llms-for-multi","title":"MasRouter: Learning to Route LLMs for Multi-Agent Systems","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanweiyue/masrouter","path":"Datasets/mbpp_dataset.py","file_url":"https://github.com/yanweiyue/masrouter/blob/HEAD/Datasets/mbpp_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":"bda9fabfb8bf5d44","mcp_get_code":{"code_sha256":"bda9fabfb8bf5d44"}},{"arxiv_id":"2502.07707","paper":"/paper/prvql-progressive-knowledge-guided-refinement","title":"PRVQL: Progressive Knowledge-guided Refinement for Robust Egocentric Visual Query Localization","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fb-reps/PRVQL","path":"dataset/dataset_utils.py","file_url":"https://github.com/fb-reps/PRVQL/blob/HEAD/dataset/dataset_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af0e3990e7f9effe","mcp_get_code":{"code_sha256":"af0e3990e7f9effe"}},{"arxiv_id":"2501.14275","paper":"/paper/leveraging-online-olympiad-level-math","title":"Leveraging Online Olympiad-Level Math Problems for LLMs Training and Contamination-Resistant Evaluation","date":"2025-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsl-lab/aops","path":"aops_crawler/clean_raw.py","file_url":"https://github.com/dsl-lab/aops/blob/HEAD/aops_crawler/clean_raw.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":"020f9cd4a09e546c","mcp_get_code":{"code_sha256":"020f9cd4a09e546c"}},{"arxiv_id":"2411.05990","paper":"/paper/game-theoretic-llm-agent-workflow-for","title":"Game-theoretic LLM: Agent Workflow for Negotiation Games","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenyueh/game_theory","path":"src/deal_no_deal/deal_no_deal_metrics.py","file_url":"https://github.com/wenyueh/game_theory/blob/HEAD/src/deal_no_deal/deal_no_deal_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5851698f9f78cda7","mcp_get_code":{"code_sha256":"5851698f9f78cda7"}},{"arxiv_id":"2410.18050","paper":"/paper/longrag-a-dual-perspective-retrieval","title":"LongRAG: A Dual-Perspective Retrieval-Augmented Generation Paradigm for Long-Context Question Answering","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QingFei1/LongRAG","path":"src/gen_index.py","file_url":"https://github.com/QingFei1/LongRAG/blob/HEAD/src/gen_index.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6811a69d3f3d6ccb","mcp_get_code":{"code_sha256":"6811a69d3f3d6ccb"}},{"arxiv_id":"2410.00983","paper":"/paper/robust-guided-diffusion-for-offline-black-box","title":"Robust Guided Diffusion for Offline Black-Box Optimization","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggchen1997/rgd","path":"utils.py","file_url":"https://github.com/ggchen1997/rgd/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6b1100fd2c8c76d4","mcp_get_code":{"code_sha256":"6b1100fd2c8c76d4"}},{"arxiv_id":"2409.19134","paper":"/paper/confidential-prompting-protecting-user","title":"Confidential Prompting: Protecting User Prompts from Cloud LLM Providers","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-sys/confidential-prompting","path":"logger.py","file_url":"https://github.com/yale-sys/confidential-prompting/blob/HEAD/logger.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"934dc72e49d36a18","mcp_get_code":{"code_sha256":"934dc72e49d36a18"}},{"arxiv_id":"2409.04057","paper":"/paper/self-harmonized-chain-of-thought","title":"Self-Harmonized Chain of Thought","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xalp/ECHO","path":"run_inference_parallel.py","file_url":"https://github.com/Xalp/ECHO/blob/HEAD/run_inference_parallel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d377eaf13ad271f4","mcp_get_code":{"code_sha256":"d377eaf13ad271f4"}},{"arxiv_id":"2407.15240","paper":"/paper/bigbench-a-unified-benchmark-for-social-bias","title":"BIGbench: A Unified Benchmark for Evaluating Multi-dimensional Social Biases in Text-to-Image Models","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigbench2024/bigbench2024","path":"benchmark/evaluate/explicit.py","file_url":"https://github.com/bigbench2024/bigbench2024/blob/HEAD/benchmark/evaluate/explicit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"048495666545e7a4","mcp_get_code":{"code_sha256":"048495666545e7a4"}},{"arxiv_id":"2407.11282","paper":"/paper/uncertainty-is-fragile-manipulating","title":"Uncertainty is Fragile: Manipulating Uncertainty in Large Language Models","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qcznlp/uncertainty","path":"get_probability_distribution.py","file_url":"https://github.com/qcznlp/uncertainty/blob/HEAD/get_probability_distribution.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"70cca1707a698eb2","mcp_get_code":{"code_sha256":"70cca1707a698eb2"}},{"arxiv_id":"2407.02472","paper":"/paper/valuescope-unveiling-implicit-norms-and","title":"ValueScope: Unveiling Implicit Norms and Values via Return Potential Model of Social Interactions","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stellali7/valueScope","path":"norm_prediction/label2winrate.py","file_url":"https://github.com/stellali7/valueScope/blob/HEAD/norm_prediction/label2winrate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2a077b2653ac83f2","mcp_get_code":{"code_sha256":"2a077b2653ac83f2"}},{"arxiv_id":"2407.02472","paper":"/paper/valuescope-unveiling-implicit-norms-and","title":"ValueScope: Unveiling Implicit Norms and Values via Return Potential Model of Social Interactions","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stellali7/valueScope","path":"norm_prediction/infer.py","file_url":"https://github.com/stellali7/valueScope/blob/HEAD/norm_prediction/infer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"acf2c73f696d7ac0","mcp_get_code":{"code_sha256":"acf2c73f696d7ac0"}},{"arxiv_id":"2405.19153","paper":"/paper/a-study-of-plasticity-loss-in-on-policy-deep","title":"A Study of Plasticity Loss in On-Policy Deep Reinforcement Learning","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awjuliani/deep-rl-plasticity","path":"analyze_helpers.py","file_url":"https://github.com/awjuliani/deep-rl-plasticity/blob/HEAD/analyze_helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c791bfb5e5f3a0d7","mcp_get_code":{"code_sha256":"c791bfb5e5f3a0d7"}},{"arxiv_id":"2405.18111","paper":"/paper/atm-adversarial-tuning-multi-agent-system","title":"ATM: Adversarial Tuning Multi-agent System Makes a Robust Retrieval-Augmented Generator","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuhac/ATM-RAG","path":"atm_train/generator_sft/generator_sft_data_prepare.py","file_url":"https://github.com/chuhac/ATM-RAG/blob/HEAD/atm_train/generator_sft/generator_sft_data_prepare.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"52fc805b3f39c687","mcp_get_code":{"code_sha256":"52fc805b3f39c687"}},{"arxiv_id":"2405.17814","paper":"/paper/faintbench-a-holistic-and-precise-benchmark","title":"FAIntbench: A Holistic and Precise Benchmark for Bias Evaluation in Text-to-Image Models","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astarojth/faintbench-v1","path":"eval/explicit/explicit.py","file_url":"https://github.com/astarojth/faintbench-v1/blob/HEAD/eval/explicit/explicit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"f890d8d7dc661176","mcp_get_code":{"code_sha256":"f890d8d7dc661176"}},{"arxiv_id":"2405.05466","paper":"/paper/poser-unmasking-alignment-faking-llms-by","title":"Poser: Unmasking Alignment Faking LLMs by Manipulating Their Internals","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sevdeawesome/POSER","path":"src/detection_strategies/s_five.py","file_url":"https://github.com/sevdeawesome/POSER/blob/HEAD/src/detection_strategies/s_five.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b2354b49a4f541c8","mcp_get_code":{"code_sha256":"b2354b49a4f541c8"}},{"arxiv_id":"2404.15247","paper":"/paper/xft-unlocking-the-power-of-code-instruction","title":"XFT: Unlocking the Power of Code Instruction Tuning by Simply Merging Upcycled Mixture-of-Experts","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ise-uiuc/xft","path":"experiments/train_comment_code_pairs.py","file_url":"https://github.com/ise-uiuc/xft/blob/HEAD/experiments/train_comment_code_pairs.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":"61194aba1f41bd36","mcp_get_code":{"code_sha256":"61194aba1f41bd36"}},{"arxiv_id":"2402.14123","paper":"/paper/deisam-segment-anything-with-deictic","title":"DeiSAM: Segment Anything with Deictic Prompting","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/deictic-segment-anything","path":"src/solve_deivg.py","file_url":"https://github.com/ml-research/deictic-segment-anything/blob/HEAD/src/solve_deivg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7f80a493d5a3ecfd","mcp_get_code":{"code_sha256":"7f80a493d5a3ecfd"}},{"arxiv_id":"2402.11845","paper":"/paper/modularized-networks-for-few-shot-hateful","title":"Modularized Networks for Few-shot Hateful Meme Detection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"social-ai-studio/mod_hate","path":"src/few_hm_dataset.py","file_url":"https://github.com/social-ai-studio/mod_hate/blob/HEAD/src/few_hm_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e345317f9c11363f","mcp_get_code":{"code_sha256":"e345317f9c11363f"}},{"arxiv_id":"2402.11845","paper":"/paper/modularized-networks-for-few-shot-hateful","title":"Modularized Networks for Few-shot Hateful Meme Detection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"social-ai-studio/mod_hate","path":"src/hm_dataset.py","file_url":"https://github.com/social-ai-studio/mod_hate/blob/HEAD/src/hm_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"004ad8da346b2949","mcp_get_code":{"code_sha256":"004ad8da346b2949"}},{"arxiv_id":"2402.11168","paper":"/paper/trust-regions-for-explanations-via-black-box","title":"Trust Regions for Explanations via Black-Box Probabilistic Certification","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Trusted-AI/AIX360","path":"aix360/algorithms/cofrnet/utils.py","file_url":"https://github.com/Trusted-AI/AIX360/blob/HEAD/aix360/algorithms/cofrnet/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":"d81355b81c3d33f8","mcp_get_code":{"code_sha256":"d81355b81c3d33f8"}},{"arxiv_id":"2402.09773","paper":"/paper/nuteprune-efficient-progressive-pruning-with","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucius-lsr/nuteprune","path":"eval_ppl.py","file_url":"https://github.com/lucius-lsr/nuteprune/blob/HEAD/eval_ppl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"662f0f3416b6f17e","mcp_get_code":{"code_sha256":"662f0f3416b6f17e"}},{"arxiv_id":"2402.08823","paper":"/paper/randumb-a-simple-approach-that-questions-the","title":"Random Representations Outperform Online Continually Learned Representations","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drimpossible/randumb","path":"feats/get_feats.py","file_url":"https://github.com/drimpossible/randumb/blob/HEAD/feats/get_feats.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"e219e1dff48369b1","mcp_get_code":{"code_sha256":"e219e1dff48369b1"}},{"arxiv_id":"2402.02834","paper":"/paper/shortened-llama-a-simple-depth-pruning-for","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nota-netspresso/shortened-llm","path":"src/dataset.py","file_url":"https://github.com/nota-netspresso/shortened-llm/blob/HEAD/src/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a69aa6e08dc65a9","mcp_get_code":{"code_sha256":"8a69aa6e08dc65a9"}},{"arxiv_id":"2402.02207","paper":"/paper/safety-fine-tuning-at-almost-no-cost-a","title":"Safety Fine-Tuning at (Almost) No Cost: A Baseline for Vision Large Language Models","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ys-zong/vlguard","path":"gpt4_evaluator.py","file_url":"https://github.com/ys-zong/vlguard/blob/HEAD/gpt4_evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2a330dfbb81232e4","mcp_get_code":{"code_sha256":"2a330dfbb81232e4"}},{"arxiv_id":"2401.03907","paper":"/paper/robofusion-towards-robust-multi-modal-3d","title":"RoboFusion: Towards Robust Multi-Modal 3D Object Detection via SAM","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adept-thu/RoboFusion","path":"focalconvsamfusion/gene_latex.py","file_url":"https://github.com/adept-thu/RoboFusion/blob/HEAD/focalconvsamfusion/gene_latex.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8291df6a8a8ee7d0","mcp_get_code":{"code_sha256":"8291df6a8a8ee7d0"}},{"arxiv_id":"2312.07000","paper":"/paper/alignment-for-honesty","title":"Alignment for Honesty","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GAIR-NLP/alignment-for-honesty","path":"evaluation/pkqa_evaluation.py","file_url":"https://github.com/GAIR-NLP/alignment-for-honesty/blob/HEAD/evaluation/pkqa_evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09750e72b3959dec","mcp_get_code":{"code_sha256":"09750e72b3959dec"}},{"arxiv_id":"2312.07000","paper":"/paper/alignment-for-honesty","title":"Alignment for Honesty","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gair-nlp/alignment-for-honesty","path":"evaluation/mmlu_evaluation.py","file_url":"https://github.com/gair-nlp/alignment-for-honesty/blob/HEAD/evaluation/mmlu_evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d8982e79978c4cc","mcp_get_code":{"code_sha256":"0d8982e79978c4cc"}},{"arxiv_id":"2312.02708","paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobustGraph/RoboGraph","path":"robograph/utils.py","file_url":"https://github.com/RobustGraph/RoboGraph/blob/HEAD/robograph/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"802848e9f51394d1","mcp_get_code":{"code_sha256":"802848e9f51394d1"}},{"arxiv_id":"2310.12490","paper":"/paper/co-2-pt-mitigating-bias-in-pre-trained","title":"Co$^2$PT: Mitigating Bias in Pre-trained Language Models through Counterfactual Contrastive Prompt Tuning","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongxiangjue/co2pt","path":"eval_bios.py","file_url":"https://github.com/dongxiangjue/co2pt/blob/HEAD/eval_bios.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e88f5ae373011d6c","mcp_get_code":{"code_sha256":"e88f5ae373011d6c"}},{"arxiv_id":"2307.15073","paper":"/paper/drug-discovery-under-covariate-shift-with","title":"Drug Discovery under Covariate Shift with Domain-Informed Prior Distributions over Functions","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leojklarner/Q-SAVI","path":"qsavi/data_loader.py","file_url":"https://github.com/leojklarner/Q-SAVI/blob/HEAD/qsavi/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cf3567fc9770b5ce","mcp_get_code":{"code_sha256":"cf3567fc9770b5ce"}},{"arxiv_id":"2307.02006","paper":"/paper/pulsar-at-mediqa-sum-2023-large-language","title":"PULSAR at MEDIQA-Sum 2023: Large Language Models Augmented by Synthetic Dialogue Convert Patient Dialogues to Medical Records","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuping-wu/pulsar","path":"fine-tune/bionlp2023_finetune_predict_only_v1.py","file_url":"https://github.com/yuping-wu/pulsar/blob/HEAD/fine-tune/bionlp2023_finetune_predict_only_v1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"068495d715fb4c08","mcp_get_code":{"code_sha256":"068495d715fb4c08"}},{"arxiv_id":"2306.04255","paper":"/paper/accounting-for-informative-sampling-when","title":"Accounting For Informative Sampling When Learning to Forecast Treatment Outcomes Over Time","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toonvds/tesar-cde","path":"src/utils/data_utils.py","file_url":"https://github.com/toonvds/tesar-cde/blob/HEAD/src/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16a1b88ddd38609a","mcp_get_code":{"code_sha256":"16a1b88ddd38609a"}},{"arxiv_id":"2306.00035","paper":"/paper/rosarl-reward-only-safe-reinforcement","title":"ROSARL: Reward-Only Safe Reinforcement Learning","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geraudnt/rosarl","path":"lavaworld/plots.py","file_url":"https://github.com/geraudnt/rosarl/blob/HEAD/lavaworld/plots.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fe9976fed2aaa536","mcp_get_code":{"code_sha256":"fe9976fed2aaa536"}},{"arxiv_id":"2303.10158","paper":"/paper/data-centric-artificial-intelligence-a-survey","title":"Data-centric Artificial Intelligence: A Survey","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daochenzha/autoshard","path":"gen_dlrm_data.py","file_url":"https://github.com/daochenzha/autoshard/blob/HEAD/gen_dlrm_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43f4e10ab0642572","mcp_get_code":{"code_sha256":"43f4e10ab0642572"}},{"arxiv_id":"2303.08134","paper":"/paper/parameter-is-not-all-you-need-starting-from","title":"Parameter is Not All You Need: Starting from Non-Parametric Networks for 3D Point Cloud Analysis","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asalarpour/Point_GN","path":"train_free_main.py","file_url":"https://github.com/asalarpour/Point_GN/blob/HEAD/train_free_main.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":"d035ce15cf041e94","mcp_get_code":{"code_sha256":"d035ce15cf041e94"}},{"arxiv_id":"2302.12238","paper":"/paper/improving-adaptive-conformal-prediction-using","title":"Improving Adaptive Conformal Prediction Using Self-Supervised Learning","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seedatnabeel/sscp","path":"src/datasets.py","file_url":"https://github.com/seedatnabeel/sscp/blob/HEAD/src/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1b636d4bc9cad39","mcp_get_code":{"code_sha256":"d1b636d4bc9cad39"}},{"arxiv_id":"2210.07907","paper":"/paper/expose-backdoors-on-the-way-a-feature-based","title":"Expose Backdoors on the Way: A Feature-Based Efficient Defense against Textual Backdoor Attacks","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lancopku/dan","path":"extract_embeddings.py","file_url":"https://github.com/lancopku/dan/blob/HEAD/extract_embeddings.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":"0b660841b60e2505","mcp_get_code":{"code_sha256":"0b660841b60e2505"}},{"arxiv_id":"2209.05434","paper":"/paper/explicitly-controllable-3d-aware-portrait","title":"3DFaceShop: Explicitly Controllable 3D-Aware Portrait Generation","date":"2022-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junshutang/3DFaceShop","path":"train_vae.py","file_url":"https://github.com/junshutang/3DFaceShop/blob/HEAD/train_vae.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4266a6438378042c","mcp_get_code":{"code_sha256":"4266a6438378042c"}},{"arxiv_id":"2206.08311","paper":"/paper/continuous-time-modeling-of-counterfactual","title":"Continuous-Time Modeling of Counterfactual Outcomes Using Neural Controlled Differential Equations","date":"2022-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seedatnabeel/te-cde","path":"src/utils/data_utils.py","file_url":"https://github.com/seedatnabeel/te-cde/blob/HEAD/src/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d8be4f367d27978","mcp_get_code":{"code_sha256":"2d8be4f367d27978"}},{"arxiv_id":"2110.07831","paper":"/paper/rap-robustness-aware-perturbations-for","title":"RAP: Robustness-Aware Perturbations for Defending against Backdoor Attacks on NLP Models","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0b660841b60e2505","mcp_get_code":{"code_sha256":"0b660841b60e2505"}},{"arxiv_id":"2108.02927","paper":"/paper/dolg-single-stage-image-retrieval-with-deep","title":"DOLG: Single-Stage Image Retrieval with Deep Orthogonal Fusion of Local and Global Features","date":"2021-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shiro-LK/python-DOLG","path":"dolg/utils/extraction.py","file_url":"https://github.com/Shiro-LK/python-DOLG/blob/HEAD/dolg/utils/extraction.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e2bad3f7809fe40b","mcp_get_code":{"code_sha256":"e2bad3f7809fe40b"}},{"arxiv_id":"2107.07511","paper":"/paper/a-gentle-introduction-to-conformal-prediction","title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/conformal-prediction","path":"generation-scripts/generate-meps.py","file_url":"https://github.com/aangelopoulos/conformal-prediction/blob/HEAD/generation-scripts/generate-meps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d8548445f52ae8b","mcp_get_code":{"code_sha256":"2d8548445f52ae8b"}},{"arxiv_id":"2010.02803","paper":"/paper/a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gzerveas/mvts_transformer","path":"src/datasets/utils.py","file_url":"https://github.com/gzerveas/mvts_transformer/blob/HEAD/src/datasets/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51e3a59616ee190e","mcp_get_code":{"code_sha256":"51e3a59616ee190e"}},{"arxiv_id":"2007.08454","paper":"/paper/shape-prior-deformation-for-categorical-6d","title":"Shape Prior Deformation for Categorical 6D Object Pose and Size Estimation","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mentian/object-deformnet","path":"preprocess/pose_data.py","file_url":"https://github.com/mentian/object-deformnet/blob/HEAD/preprocess/pose_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"965fc9f134ceab2a","mcp_get_code":{"code_sha256":"965fc9f134ceab2a"}},{"arxiv_id":"2004.06152","paper":"/paper/sparse-regression-at-scale-branch-and-bound","title":"Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alisaab/l0bnb","path":"l0bnb/regpath.py","file_url":"https://github.com/alisaab/l0bnb/blob/HEAD/l0bnb/regpath.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b621fc226310f0ff","mcp_get_code":{"code_sha256":"b621fc226310f0ff"}},{"arxiv_id":"2004.05273","paper":"/paper/safe-multi-agent-interaction-through-robust","title":"Safe Multi-Agent Interaction through Robust Control Barrier Functions with Learned Uncertainties","date":"2020-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rcheng805/robust_cbf","path":"GP_predict.py","file_url":"https://github.com/rcheng805/robust_cbf/blob/HEAD/GP_predict.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":"80abfed14936f0d9","mcp_get_code":{"code_sha256":"80abfed14936f0d9"}},{"arxiv_id":"1909.03012","paper":"/paper/one-explanation-does-not-fit-all-a-toolkit","title":"One Explanation Does Not Fit All: A Toolkit and Taxonomy of AI Explainability Techniques","date":"2019-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/AIX360","path":"aix360/algorithms/cofrnet/utils.py","file_url":"https://github.com/IBM/AIX360/blob/HEAD/aix360/algorithms/cofrnet/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":"d81355b81c3d33f8","mcp_get_code":{"code_sha256":"d81355b81c3d33f8"}},{"arxiv_id":"1909.00719","paper":"/paper/pathologies-of-factorised-gaussian-and-mc","title":"On the Expressiveness of Approximate Inference in Bayesian Neural Networks","date":"2019-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/expressiveness-approx-bnns","path":"inbetween/utils.py","file_url":"https://github.com/cambridge-mlg/expressiveness-approx-bnns/blob/HEAD/inbetween/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d9edc8b294e512ae","mcp_get_code":{"code_sha256":"d9edc8b294e512ae"}},{"arxiv_id":"1907.13528","paper":"/paper/what-bert-is-not-lessons-from-a-new-suite-of","title":"What BERT is not: Lessons from a new suite of psycholinguistic diagnostics for language models","date":"2019-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"text-machine-lab/extending_psycholinguistic_dataset","path":"src/evaluation.py","file_url":"https://github.com/text-machine-lab/extending_psycholinguistic_dataset/blob/HEAD/src/evaluation.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":"1049fad948492b30","mcp_get_code":{"code_sha256":"1049fad948492b30"}},{"arxiv_id":"1907.07792","paper":"/paper/grip-graph-based-interaction-aware-trajectory","title":"GRIP++: Enhanced Graph-based Interaction-aware Trajectory Prediction for Autonomous Driving","date":"2019-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZiyiLiubird/GRIP_Plus_Plus","path":"data_process.py","file_url":"https://github.com/ZiyiLiubird/GRIP_Plus_Plus/blob/HEAD/data_process.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":"53987e5b91a7a20f","mcp_get_code":{"code_sha256":"53987e5b91a7a20f"}},{"arxiv_id":"1905.07473","paper":"/paper/adaptively-truncating-backpropagation-through","title":"Adaptively Truncating Backpropagation Through Time to Control Gradient Bias","date":"2019-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aicherc/adaptive_tbptt","path":"experiments/temporal_pp_model.py","file_url":"https://github.com/aicherc/adaptive_tbptt/blob/HEAD/experiments/temporal_pp_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ef6d0018f789dd0","mcp_get_code":{"code_sha256":"5ef6d0018f789dd0"}},{"arxiv_id":"1603.08614","paper":"/paper/probabilistic-forecasting-of-the-masses-and","title":"Probabilistic Forecasting of the Masses and Radii of Other Worlds","date":null,"month_inferred_from_arxiv_id":"2016-03","title_source":"archive","repo":"wxu26/uniformity_dichotomy","path":"util.py","file_url":"https://github.com/wxu26/uniformity_dichotomy/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39d0a4450075a627","mcp_get_code":{"code_sha256":"39d0a4450075a627"}},{"arxiv_id":"aaai_21290","paper":null,"title":"arXiv:aaai_21290","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiangjiechen/EDUCAT","path":"src/eval_client/metrics.py","file_url":"https://github.com/jiangjiechen/EDUCAT/blob/HEAD/src/eval_client/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1eabebedb8997df0","mcp_get_code":{"code_sha256":"1eabebedb8997df0"}},{"arxiv_id":"2024.naacl-long.64","paper":null,"title":"arXiv:2024.naacl-long.64","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UCF-ML-Research/TrojFSP","path":"get_data.py","file_url":"https://github.com/UCF-ML-Research/TrojFSP/blob/HEAD/get_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cd2d375e45785eb3","mcp_get_code":{"code_sha256":"cd2d375e45785eb3"}},{"arxiv_id":"2022.findings-emnlp.47","paper":null,"title":"arXiv:2022.findings-emnlp.47","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lancopku/DAN","path":"extract_embeddings.py","file_url":"https://github.com/lancopku/DAN/blob/HEAD/extract_embeddings.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":"0b660841b60e2505","mcp_get_code":{"code_sha256":"0b660841b60e2505"}}]}