{"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/mean-pooling","entry":"mean_pooling","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":71,"n_papers_ran":61,"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":32,"n_samples_ran":23,"n_samples_fingerprinted":13,"n_places":74,"n_places_pointer_only":30,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":9,"ran_fixture":1,"ran":12,"unverified":9},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2608.20991","paper":"/paper/arxiv-2608-20991","title":"Trojaning the Alignment: Stealthy Backdoor Attacks against Graph Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ventr1c/STAG","path":"dual_backdoor_trainer.py","file_url":"https://github.com/ventr1c/STAG/blob/HEAD/dual_backdoor_trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"975dab31afc23b51","mcp_get_code":{"code_sha256":"975dab31afc23b51"}},{"arxiv_id":"2608.20991","paper":"/paper/arxiv-2608-20991","title":"Trojaning the Alignment: Stealthy Backdoor Attacks against Graph Foundation Models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ventr1c/STAG","path":"text-graph-grounding/model_gt.py","file_url":"https://github.com/ventr1c/STAG/blob/HEAD/text-graph-grounding/model_gt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4ab6a5942ba98e27","mcp_get_code":{"code_sha256":"4ab6a5942ba98e27"}},{"arxiv_id":"2608.04488","paper":"/paper/arxiv-2608-04488","title":"Energy-and Memory-Efficient PEFT Methods for Personalized On-Device SLMs on Consumer GPUs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Rickserd/super-duper-computing-machine","path":"LaMP_benchmark/finetune_finalone.py","file_url":"https://github.com/Rickserd/super-duper-computing-machine/blob/HEAD/LaMP_benchmark/finetune_finalone.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4dfdc96cd46028d2","mcp_get_code":{"code_sha256":"4dfdc96cd46028d2"}},{"arxiv_id":"2606.00610","paper":"/paper/arxiv-2606-00610","title":"MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"XMUDeepLIT/MemGraphRAG","path":"code/src/embedding_model/Contriever.py","file_url":"https://github.com/XMUDeepLIT/MemGraphRAG/blob/HEAD/code/src/embedding_model/Contriever.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2606.00610","paper":"/paper/arxiv-2606-00610","title":"MemGraphRAG: Memory-based Multi-Agent System for Graph Retrieval-Augmented Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"XMUDeepLIT/MemGraphRAG","path":"code/src/embedding_model/BGE.py","file_url":"https://github.com/XMUDeepLIT/MemGraphRAG/blob/HEAD/code/src/embedding_model/BGE.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"482812b35d0ebc18","mcp_get_code":{"code_sha256":"482812b35d0ebc18"}},{"arxiv_id":"2605.23643","paper":"/paper/arxiv-2605-23643","title":"Less Effort, Shorter Proofs: Reinforcement Learning for Security Protocol Analysis in Tamarin","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MatCos/TamRL","path":"src/models/utils.py","file_url":"https://github.com/MatCos/TamRL/blob/HEAD/src/models/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"62a99b2d6369003d","mcp_get_code":{"code_sha256":"62a99b2d6369003d"}},{"arxiv_id":"2605.03824","paper":"/paper/arxiv-2605-03824","title":"Reproducing Complex Set-Compositional Information Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"informagi/Complex-Set-Compositional-IR","path":"code/baselines/contriever/contriever.py","file_url":"https://github.com/informagi/Complex-Set-Compositional-IR/blob/HEAD/code/baselines/contriever/contriever.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d99a1c56838fe7cc","mcp_get_code":{"code_sha256":"d99a1c56838fe7cc"}},{"arxiv_id":"2604.19070","paper":"/paper/arxiv-2604-19070","title":"TRN-R1-Zero: Text-rich Network Reasoning via LLMs with Reinforcement Learning Only","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"superallen13/TRN-R1-Zero","path":"trn_r1_zero/prompts/build_training_dataset.py","file_url":"https://github.com/superallen13/TRN-R1-Zero/blob/HEAD/trn_r1_zero/prompts/build_training_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f08ad274808dce0d","mcp_get_code":{"code_sha256":"f08ad274808dce0d"}},{"arxiv_id":"2604.05540","paper":"/paper/arxiv-2604-05540","title":"Learning to Edit Knowledge via Instruction-based Chain-of-Thought Prompting","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"FredJDean/CoT2Edit","path":"inference/edit_cot.py","file_url":"https://github.com/FredJDean/CoT2Edit/blob/HEAD/inference/edit_cot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2602.14492","paper":"/paper/arxiv-2602-14492","title":"Query as Anchor: Scenario-Adaptive User Representation via Large Language Model","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"JhCircle/Q-Anchor","path":"modeling.py","file_url":"https://github.com/JhCircle/Q-Anchor/blob/HEAD/modeling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"892a806e8ea0eea3","mcp_get_code":{"code_sha256":"892a806e8ea0eea3"}},{"arxiv_id":"2602.03253","paper":"/paper/arxiv-2602-03253","title":"LaVPR: Benchmarking Language and Vision for Place Recognition","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"oferidan1/LaVPR","path":"model/LaVPR.py","file_url":"https://github.com/oferidan1/LaVPR/blob/HEAD/model/LaVPR.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"9d586af2372f3979","mcp_get_code":{"code_sha256":"9d586af2372f3979"}},{"arxiv_id":"2602.01965","paper":"/paper/arxiv-2602-01965","title":"Breaking the Static Graph: Context-Aware Traversal for Robust Retrieval-Augmented Generation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"kwunhang/CatRAG","path":"src/catrag/embedding_model/Contriever.py","file_url":"https://github.com/kwunhang/CatRAG/blob/HEAD/src/catrag/embedding_model/Contriever.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2511.14096","paper":"/paper/arxiv-2511-14096","title":"NeuroPath: Neurobiology-Inspired Path Tracking and Reflection for Semantically Coherent Retrieval","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"KennyCaty/NeuroPath","path":"src/processing.py","file_url":"https://github.com/KennyCaty/NeuroPath/blob/HEAD/src/processing.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2509.24088","paper":"/paper/arxiv-2509-24088","title":"CORRECT: Condensed Error Recognition via Knowledge Transfer in Multi-agent Systems","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"UIUC-MLSys/CORRECT","path":"src/generate_trajectory_similarities.py","file_url":"https://github.com/UIUC-MLSys/CORRECT/blob/HEAD/src/generate_trajectory_similarities.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"972474c3a3186d59","mcp_get_code":{"code_sha256":"972474c3a3186d59"}},{"arxiv_id":"2505.18513","paper":"/paper/enhancing-training-data-attribution-with","title":"Enhancing Training Data Attribution with Representational Optimization","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnweiwei/airrep","path":"airrep/modeling_airrep.py","file_url":"https://github.com/sunnweiwei/airrep/blob/HEAD/airrep/modeling_airrep.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9b8a52fdc139850","mcp_get_code":{"code_sha256":"a9b8a52fdc139850"}},{"arxiv_id":"2504.08165","paper":"/paper/findings-of-the-babylm-challenge-sample","title":"Findings of the BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corpora","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"babylm/evaluation-pipeline","path":"transformers_modified/t5.py","file_url":"https://github.com/babylm/evaluation-pipeline/blob/HEAD/transformers_modified/t5.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99a9bbebcd3ca50f","mcp_get_code":{"code_sha256":"99a9bbebcd3ca50f"}},{"arxiv_id":"2503.16356","paper":"/paper/cake-circuit-aware-editing-enables","title":"CaKE: Circuit-aware Editing Enables Generalizable Knowledge Learners","date":"2025-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/CaKE","path":"edit_utils.py","file_url":"https://github.com/zjunlp/CaKE/blob/HEAD/edit_utils.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2502.14802","paper":"/paper/from-rag-to-memory-non-parametric-continual","title":"From RAG to Memory: Non-Parametric Continual Learning for Large Language Models","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-nlp-group/hipporag","path":"src/hipporag/embedding_model/Contriever.py","file_url":"https://github.com/osu-nlp-group/hipporag/blob/HEAD/src/hipporag/embedding_model/Contriever.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2502.08512","paper":"/paper/measuring-diversity-in-synthetic-datasets","title":"Measuring Diversity in Synthetic Datasets","date":"2025-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2501.15228","paper":"/paper/improving-retrieval-augmented-generation","title":"Improving Retrieval-Augmented Generation through Multi-Agent Reinforcement Learning","date":"2025-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyiqun/MMOA-RAG","path":"evaluate_qr_s_g.py","file_url":"https://github.com/chenyiqun/MMOA-RAG/blob/HEAD/evaluate_qr_s_g.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2410.14204","paper":"/paper/meditod-an-english-dialogue-dataset-for","title":"MediTOD: An English Dialogue Dataset for Medical History Taking with Comprehensive Annotations","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dair-iitd/MediTOD","path":"metrics/utils.py","file_url":"https://github.com/dair-iitd/MediTOD/blob/HEAD/metrics/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2410.02189","paper":"/paper/agent-oriented-planning-in-multi-agent","title":"Agent-Oriented Planning in Multi-Agent Systems","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lalaliat/Agent-Oriented-Planning","path":"embedding_model.py","file_url":"https://github.com/lalaliat/Agent-Oriented-Planning/blob/HEAD/embedding_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2408.12076","paper":"/paper/conflictbank-a-benchmark-for-evaluating-the","title":"ConflictBank: A Benchmark for Evaluating the Influence of Knowledge Conflicts in LLM","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaochen0110/conflictbank","path":"quality_control.py","file_url":"https://github.com/zhaochen0110/conflictbank/blob/HEAD/quality_control.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"badeb49663280ccc","mcp_get_code":{"code_sha256":"badeb49663280ccc"}},{"arxiv_id":"2406.16976","paper":"/paper/efficient-evolutionary-search-over-chemical","title":"Efficient Evolutionary Search Over Chemical Space with Large Language Models","date":"2024-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoom-wang112358/MOLLEO","path":"multi_objective/main/molleo_multi/mol_lm.py","file_url":"https://github.com/zoom-wang112358/MOLLEO/blob/HEAD/multi_objective/main/molleo_multi/mol_lm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3ca541ab8bce64d7","mcp_get_code":{"code_sha256":"3ca541ab8bce64d7"}},{"arxiv_id":"2406.10977","paper":"/paper/toward-optimal-llm-alignments-using-two","title":"Toward Optimal LLM Alignments Using Two-Player Games","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruizheng20/gpo","path":"gpo/sentence_embed.py","file_url":"https://github.com/ruizheng20/gpo/blob/HEAD/gpo/sentence_embed.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2406.02888","paper":"/paper/hydra-model-factorization-framework-for-black","title":"HYDRA: Model Factorization Framework for Black-Box LLM Personalization","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"night-chen/HYDRA","path":"prompts/contriever_retriever.py","file_url":"https://github.com/night-chen/HYDRA/blob/HEAD/prompts/contriever_retriever.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2405.17346","paper":"/paper/prompt-optimization-with-human-feedback","title":"Prompt Optimization with Human Feedback","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xqlin98/apohf","path":"Induction/experiments/run_dbandits_image_gen.py","file_url":"https://github.com/xqlin98/apohf/blob/HEAD/Induction/experiments/run_dbandits_image_gen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2405.14751","paper":"/paper/agile-a-novel-framework-of-llm-agents","title":"AGILE: A Novel Reinforcement Learning Framework of LLM Agents","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytarnish/AGILE","path":"agile/models.py","file_url":"https://github.com/bytarnish/AGILE/blob/HEAD/agile/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2405.11613","paper":"/paper/decoding-by-contrasting-knowledge-enhancing","title":"Decoding by Contrasting Knowledge: Enhancing LLMs' Confidence on Edited Facts","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronbbl/deck","path":"run_ice.py","file_url":"https://github.com/byronbbl/deck/blob/HEAD/run_ice.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2404.14951","paper":"/paper/streamlining-the-image-stitching-pipeline","title":"Reconstructing the Image Stitching Pipeline: Integrating Fusion and Rectangling into a Unified Inpainting Model","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yayoyo66/srstitcher","path":"metrics/ccs.py","file_url":"https://github.com/yayoyo66/srstitcher/blob/HEAD/metrics/ccs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2404.13968","paper":"/paper/protecting-your-llms-with-information","title":"Protecting Your LLMs with Information Bottleneck","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UCSB-NLP-Chang/SemanticSmooth","path":"lib/ensemble_policy.py","file_url":"https://github.com/UCSB-NLP-Chang/SemanticSmooth/blob/HEAD/lib/ensemble_policy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2404.11531","paper":"/paper/pack-of-llms-model-fusion-at-test-time-via","title":"Pack of LLMs: Model Fusion at Test-Time via Perplexity Optimization","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmavro/packllm","path":"downstream_tasks/utils.py","file_url":"https://github.com/cmavro/packllm/blob/HEAD/downstream_tasks/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2404.05970","paper":"/paper/optimization-methods-for-personalizing-large","title":"Optimization Methods for Personalizing Large Language Models through Retrieval Augmentation","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamp-benchmark/lamp","path":"LaMP/rank_profiles.py","file_url":"https://github.com/lamp-benchmark/lamp/blob/HEAD/LaMP/rank_profiles.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2404.00776","paper":"/paper/pytorch-frame-a-modular-framework-for-multi","title":"PyTorch Frame: A Modular Framework for Multi-Modal Tabular Learning","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pyg-team/pytorch-frame","path":"benchmark/data_frame_text_benchmark.py","file_url":"https://github.com/pyg-team/pytorch-frame/blob/HEAD/benchmark/data_frame_text_benchmark.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fcebd39e1e7bde51","mcp_get_code":{"code_sha256":"fcebd39e1e7bde51"}},{"arxiv_id":"2404.00415","paper":"/paper/coda-constrained-generation-based-data","title":"CoDa: Constrained Generation based Data Augmentation for Low-Resource NLP","date":"2024-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sreyan88/coda","path":"Lexical-Constraints/lexical_constraints_exemplars.py","file_url":"https://github.com/sreyan88/coda/blob/HEAD/Lexical-Constraints/lexical_constraints_exemplars.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2402.19464","paper":"/paper/curiosity-driven-red-teaming-for-large","title":"Curiosity-driven Red-teaming for Large Language Models","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Improbable-AI/curiosity_redteam","path":"sentence_embed.py","file_url":"https://github.com/Improbable-AI/curiosity_redteam/blob/HEAD/sentence_embed.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2402.16192","paper":"/paper/defending-large-language-models-against-1","title":"Defending Large Language Models against Jailbreak Attacks via Semantic Smoothing","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsb-nlp-chang/semanticsmooth","path":"lib/ensemble_policy.py","file_url":"https://github.com/ucsb-nlp-chang/semanticsmooth/blob/HEAD/lib/ensemble_policy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2402.15708","paper":"/paper/query-augmentation-by-decoding-semantics-from","title":"Query Augmentation by Decoding Semantics from Brain Signals","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeziyi1998/brain-query-augmentation","path":"language_generation/src/data_old.py","file_url":"https://github.com/yeziyi1998/brain-query-augmentation/blob/HEAD/language_generation/src/data_old.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07b0e4cab6c2d738","mcp_get_code":{"code_sha256":"07b0e4cab6c2d738"}},{"arxiv_id":"2402.14526","paper":"/paper/balanced-data-sampling-for-language-model","title":"Balanced Data Sampling for Language Model Training with Clustering","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"choosewhatulike/cluster-clip","path":"run_gen_emb.py","file_url":"https://github.com/choosewhatulike/cluster-clip/blob/HEAD/run_gen_emb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ee3e60cc57e00353","mcp_get_code":{"code_sha256":"ee3e60cc57e00353"}},{"arxiv_id":"2402.11626","paper":"/paper/metacognitive-retrieval-augmented-large","title":"Metacognitive Retrieval-Augmented Large Language Models","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignorejjj/metarag","path":"monitor.py","file_url":"https://github.com/ignorejjj/metarag/blob/HEAD/monitor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2402.11399","paper":"/paper/k-semstamp-a-clustering-based-semantic","title":"k-SemStamp: A Clustering-Based Semantic Watermark for Detection of Machine-Generated Text","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bohanhou14/semstamp","path":"contrastive_trainer.py","file_url":"https://github.com/bohanhou14/semstamp/blob/HEAD/contrastive_trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"58cb2caaccc3a3f8","mcp_get_code":{"code_sha256":"58cb2caaccc3a3f8"}},{"arxiv_id":"2402.08638","paper":"/paper/semrel2024-a-collection-of-semantic-textual","title":"SemRel2024: A Collection of Semantic Textual Relatedness Datasets for 13 Languages","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"semantic-textual-relatedness/semantic_relatedness_semeval2024","path":"semrel_baselines/src/evaluate_bert.py","file_url":"https://github.com/semantic-textual-relatedness/semantic_relatedness_semeval2024/blob/HEAD/semrel_baselines/src/evaluate_bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c3b1e4b6c6fa90e","mcp_get_code":{"code_sha256":"4c3b1e4b6c6fa90e"}},{"arxiv_id":"2401.06416","paper":"/paper/mission-impossible-language-models","title":"Mission: Impossible Language Models","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jkallini/mission-impossible-language-models","path":"edge_probing/edge_probing.py","file_url":"https://github.com/jkallini/mission-impossible-language-models/blob/HEAD/edge_probing/edge_probing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b8787922f993a93","mcp_get_code":{"code_sha256":"7b8787922f993a93"}},{"arxiv_id":"2311.11202","paper":"/paper/unmasking-and-improving-data-credibility-a","title":"Unmasking and Improving Data Credibility: A Study with Datasets for Training Harmless Language Models","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Docta-ai/docta","path":"docta/core/core_utils.py","file_url":"https://github.com/Docta-ai/docta/blob/HEAD/docta/core/core_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2311.09821","paper":"/paper/towards-robust-temporal-reasoning-of-large","title":"Towards Robust Temporal Reasoning of Large Language Models via a Multi-Hop QA Dataset and Pseudo-Instruction Tuning","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nusnlp/complex-tr","path":"custom_qa/get_local_ranking.py","file_url":"https://github.com/nusnlp/complex-tr/blob/HEAD/custom_qa/get_local_ranking.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2311.00262","paper":"/paper/plug-and-play-policy-planner-for-large","title":"Plug-and-Play Policy Planner for Large Language Model Powered Dialogue Agents","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dengyang17/llm-proactive","path":"topkg/chatgpt_self_play.py","file_url":"https://github.com/dengyang17/llm-proactive/blob/HEAD/topkg/chatgpt_self_play.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2310.07815","paper":"/paper/language-models-as-semantic-indexers","title":"Language Models As Semantic Indexers","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petergriffinjin/lmindexer","path":"SemanticID/src/IDGen/modeling.py","file_url":"https://github.com/petergriffinjin/lmindexer/blob/HEAD/SemanticID/src/IDGen/modeling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a32209dd55b92699","mcp_get_code":{"code_sha256":"a32209dd55b92699"}},{"arxiv_id":"2310.06684","paper":"/paper/learning-multiplex-embeddings-on-text-rich","title":"Learning Multiplex Representations on Text-Attributed Graphs with One Language Model Encoder","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petergriffinjin/metag","path":"src/OpenLP/modeling.py","file_url":"https://github.com/petergriffinjin/metag/blob/HEAD/src/OpenLP/modeling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a32209dd55b92699","mcp_get_code":{"code_sha256":"a32209dd55b92699"}},{"arxiv_id":"2310.04408","paper":"/paper/recomp-improving-retrieval-augmented-lms-with","title":"RECOMP: Improving Retrieval-Augmented LMs with Compression and Selective Augmentation","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carriex/recomp","path":"run_extractive_compressor.py","file_url":"https://github.com/carriex/recomp/blob/HEAD/run_extractive_compressor.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2310.01542","paper":"/paper/fusing-models-with-complementary-expertise","title":"Fusing Models with Complementary Expertise","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/FoE-ICLR2024","path":"lm_experiments/cnn_embedding_models.py","file_url":"https://github.com/hwang595/FoE-ICLR2024/blob/HEAD/lm_experiments/cnn_embedding_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2310.00149","paper":"/paper/one-for-all-towards-training-one-graph-model","title":"One for All: Towards Training One Graph Model for All Classification Tasks","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LechengKong/OneForAll","path":"models/model.py","file_url":"https://github.com/LechengKong/OneForAll/blob/HEAD/models/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43281e60ab9405f3","mcp_get_code":{"code_sha256":"43281e60ab9405f3"}},{"arxiv_id":"2309.04550","paper":"/paper/retrieving-evidence-from-ehrs-with-llms","title":"Retrieving Evidence from EHRs with LLMs: Possibilities and Challenges","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hibaahsan/chil_diagnosis_evidence","path":"src/utils.py","file_url":"https://github.com/hibaahsan/chil_diagnosis_evidence/blob/HEAD/src/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a32209dd55b92699","mcp_get_code":{"code_sha256":"a32209dd55b92699"}},{"arxiv_id":"2308.04275","paper":"/paper/in-context-alignment-chat-with-vanilla","title":"In-Context Alignment: Chat with Vanilla Language Models Before Fine-Tuning","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2306.15895","paper":"/paper/large-language-model-as-attributed-training-1","title":"Large Language Model as Attributed Training Data Generator: A Tale of Diversity and Bias","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yueyu1030/attrprompt","path":"train_classifier/probing_model/sentence_bert.py","file_url":"https://github.com/yueyu1030/attrprompt/blob/HEAD/train_classifier/probing_model/sentence_bert.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2305.18395","paper":"/paper/knowledge-augmented-reasoning-distillation-1","title":"Knowledge-Augmented Reasoning Distillation for Small Language Models in Knowledge-Intensive Tasks","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nardien/kard","path":"dense_retriever.py","file_url":"https://github.com/nardien/kard/blob/HEAD/dense_retriever.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":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2304.11406","paper":"/paper/lamp-when-large-language-models-meet","title":"LaMP: When Large Language Models Meet Personalization","date":"2023-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2302.05698","paper":"/paper/compositional-exemplars-for-in-context","title":"Compositional Exemplars for In-context Learning","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2212.09741","paper":"/paper/one-embedder-any-task-instruction-finetuned","title":"One Embedder, Any Task: Instruction-Finetuned Text Embeddings","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/instructor-embedding","path":"evaluation/prompt_retrieval/main_coda_title_gen.py","file_url":"https://github.com/HKUNLP/instructor-embedding/blob/HEAD/evaluation/prompt_retrieval/main_coda_title_gen.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":"597e15632d2a22fb","mcp_get_code":{"code_sha256":"597e15632d2a22fb"}},{"arxiv_id":"2210.11766","paper":"/paper/cefr-based-sentence-difficulty-annotation-and","title":"CEFR-Based Sentence Difficulty Annotation and Assessment","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukiar/CEFR-SP","path":"src/model.py","file_url":"https://github.com/yukiar/CEFR-SP/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7b7b061724169807","mcp_get_code":{"code_sha256":"7b7b061724169807"}},{"arxiv_id":"2210.11034","paper":"/paper/enhancing-out-of-distribution-detection-in","title":"Enhancing Out-of-Distribution Detection in Natural Language Understanding via Implicit Layer Ensemble","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyunsoocho77/lacl-official","path":"model.py","file_url":"https://github.com/hyunsoocho77/lacl-official/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e7ca6d67f5c378d","mcp_get_code":{"code_sha256":"7e7ca6d67f5c378d"}},{"arxiv_id":"2206.04624","paper":"/paper/factuality-enhanced-language-models-for-open","title":"Factuality Enhanced Language Models for Open-Ended Text Generation","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nayeon7lee/FactualityPrompt","path":"src/retriever.py","file_url":"https://github.com/nayeon7lee/FactualityPrompt/blob/HEAD/src/retriever.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}},{"arxiv_id":"2205.09357","paper":"/paper/continual-pre-training-mitigates-forgetting","title":"Continual Pre-Training Mitigates Forgetting in Language and Vision","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreacossu/continual-pretraining-nlp-vision","path":"senteval.py","file_url":"https://github.com/andreacossu/continual-pretraining-nlp-vision/blob/HEAD/senteval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"249e014939153c23","mcp_get_code":{"code_sha256":"249e014939153c23"}},{"arxiv_id":"2112.02721","paper":"/paper/nl-augmenter-a-framework-for-task-sensitive","title":"NL-Augmenter: A Framework for Task-Sensitive Natural Language Augmentation","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GEM-benchmark/NL-Augmenter","path":"nlaugmenter/evaluation/evaluate_paraphrase_detection.py","file_url":"https://github.com/GEM-benchmark/NL-Augmenter/blob/HEAD/nlaugmenter/evaluation/evaluate_paraphrase_detection.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"61025bc373daeec1","mcp_get_code":{"code_sha256":"61025bc373daeec1"}},{"arxiv_id":"2110.05789","paper":"/paper/learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingtaozhan/repconc","path":"src/repconc/models/dense/modeling_dense.py","file_url":"https://github.com/jingtaozhan/repconc/blob/HEAD/src/repconc/models/dense/modeling_dense.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07b0e4cab6c2d738","mcp_get_code":{"code_sha256":"07b0e4cab6c2d738"}},{"arxiv_id":"2108.01850","paper":"/paper/controlled-text-generation-as-continuous","title":"Controlled Text Generation as Continuous Optimization with Multiple Constraints","date":"2021-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sachin19/mucoco","path":"mucoco/losses/usim.py","file_url":"https://github.com/sachin19/mucoco/blob/HEAD/mucoco/losses/usim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee3e60cc57e00353","mcp_get_code":{"code_sha256":"ee3e60cc57e00353"}},{"arxiv_id":"2107.01105","paper":"/paper/memory-efficient-meta-learning-with-large","title":"Memory Efficient Meta-Learning with Large Images","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/LITE","path":"src/set_encoder.py","file_url":"https://github.com/cambridge-mlg/LITE/blob/HEAD/src/set_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"083d7c12137fe0b7","mcp_get_code":{"code_sha256":"083d7c12137fe0b7"}},{"arxiv_id":"2101.06804","paper":"/paper/what-makes-good-in-context-examples-for-gpt-3","title":"What Makes Good In-Context Examples for GPT-$3$?","date":"2021-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"ee3e60cc57e00353","mcp_get_code":{"code_sha256":"ee3e60cc57e00353"}},{"arxiv_id":"2010.09240","paper":"/paper/multi-hop-question-generation-with-graph","title":"Multi-hop Question Generation with Graph Convolutional Network","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/MulQG","path":"GPG/encoders/graphfusion_encoder.py","file_url":"https://github.com/HLTCHKUST/MulQG/blob/HEAD/GPG/encoders/graphfusion_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"567eab7347ce0c60","mcp_get_code":{"code_sha256":"567eab7347ce0c60"}},{"arxiv_id":"2006.12245","paper":"/paper/improving-few-shot-visual-classification-with","title":"Enhancing Few-Shot Image Classification with Unlabelled Examples","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/simple-cnaps","path":"simple-cnaps-src/set_encoder.py","file_url":"https://github.com/plai-group/simple-cnaps/blob/HEAD/simple-cnaps-src/set_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"083d7c12137fe0b7","mcp_get_code":{"code_sha256":"083d7c12137fe0b7"}},{"arxiv_id":"2003.03284","paper":"/paper/tasknorm-rethinking-batch-normalization-for","title":"TaskNorm: Rethinking Batch Normalization for Meta-Learning","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridge-mlg/cnaps","path":"src/set_encoder.py","file_url":"https://github.com/cambridge-mlg/cnaps/blob/HEAD/src/set_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"083d7c12137fe0b7","mcp_get_code":{"code_sha256":"083d7c12137fe0b7"}},{"arxiv_id":"1911.03631","paper":"/paper/hierarchical-graph-network-for-multi-hop","title":"Hierarchical Graph Network for Multi-hop Question Answering","date":"2019-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuwfan/HGN","path":"models/layers.py","file_url":"https://github.com/yuwfan/HGN/blob/HEAD/models/layers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"567eab7347ce0c60","mcp_get_code":{"code_sha256":"567eab7347ce0c60"}},{"arxiv_id":"2025.findings-acl.1365","paper":null,"title":"arXiv:2025.findings-acl.1365","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ldilab/ECoRAG","path":"compressor/run_compressor.py","file_url":"https://github.com/ldilab/ECoRAG/blob/HEAD/compressor/run_compressor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe0e2df4d9cb5edd","mcp_get_code":{"code_sha256":"fe0e2df4d9cb5edd"}},{"arxiv_id":"2025.findings-acl.1365","paper":null,"title":"arXiv:2025.findings-acl.1365","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ldilab/ECoRAG","path":"compressor/score_labeled_data.py","file_url":"https://github.com/ldilab/ECoRAG/blob/HEAD/compressor/score_labeled_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":"b2f10572621da4e5","mcp_get_code":{"code_sha256":"b2f10572621da4e5"}},{"arxiv_id":"2023.findings-emnlp.540","paper":null,"title":"arXiv:2023.findings-emnlp.540","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lingchen0331/KEEP","path":"sentence_similarity.py","file_url":"https://github.com/lingchen0331/KEEP/blob/HEAD/sentence_similarity.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"77f69af078e09830","mcp_get_code":{"code_sha256":"77f69af078e09830"}}]}