{"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/prepare-dataset","entry":"prepare_dataset","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":32,"n_papers_ran":5,"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":30,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":33,"n_places_pointer_only":11,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":24},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2609.12791","paper":"/paper/arxiv-2609-12791","title":"Cognition on Graph: Navigating Massive Knowledge Space via Cognitive Cycles and Bidirectional Graph-Text Synergy","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"zhougengxian/CoG","path":"CoG/utils.py","file_url":"https://github.com/zhougengxian/CoG/blob/HEAD/CoG/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":"7d304feda300ff3f","mcp_get_code":{"code_sha256":"7d304feda300ff3f"}},{"arxiv_id":"2605.13981","paper":"/paper/arxiv-2605-13981","title":"Towards Resource-Efficient LLMs: End-to-End Energy Accounting of Distillation Pipelines","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"StellarLuminosity/Energy","path":"distill_bench/core/utils.py","file_url":"https://github.com/StellarLuminosity/Energy/blob/HEAD/distill_bench/core/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7aca9ebb37ee1d3e","mcp_get_code":{"code_sha256":"7aca9ebb37ee1d3e"}},{"arxiv_id":"2605.01065","paper":"/paper/arxiv-2605-01065","title":"A Systematic Exploration of Text Decomposition and Budget Distribution in Differentially Private Text Obfuscation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"sjmeis/DP-Decompose-Distribute","path":"eval_scripts/adaptive_attacker.py","file_url":"https://github.com/sjmeis/DP-Decompose-Distribute/blob/HEAD/eval_scripts/adaptive_attacker.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"87cd9dd4f015d968","mcp_get_code":{"code_sha256":"87cd9dd4f015d968"}},{"arxiv_id":"2605.01065","paper":"/paper/arxiv-2605-01065","title":"A Systematic Exploration of Text Decomposition and Budget Distribution in Differentially Private Text Obfuscation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"sjmeis/DP-Decompose-Distribute","path":"eval_scripts/baseline_attacker.py","file_url":"https://github.com/sjmeis/DP-Decompose-Distribute/blob/HEAD/eval_scripts/baseline_attacker.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2927da7397153f77","mcp_get_code":{"code_sha256":"2927da7397153f77"}},{"arxiv_id":"2601.19686","paper":"/paper/arxiv-2601-19686","title":"2 RELATED WORK Reinforcement learning has emerged as a powerful paradigm for enhancing the reasoning abilities of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"zywang0104/Video-KTR","path":"src/r1-v/src/open_r1/sft_video.py","file_url":"https://github.com/zywang0104/Video-KTR/blob/HEAD/src/r1-v/src/open_r1/sft_video.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69e027783b4d6f9f","mcp_get_code":{"code_sha256":"69e027783b4d6f9f"}},{"arxiv_id":"2601.01062","paper":"/paper/arxiv-2601-01062","title":"SPoRC-VIST: A Benchmark for Evaluating Generative Natural Narrative in Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Yunlin-Zeng/visual-podcast-VLM","path":"scripts_235B/finetune_235B.py","file_url":"https://github.com/Yunlin-Zeng/visual-podcast-VLM/blob/HEAD/scripts_235B/finetune_235B.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a5c5ad9dfba730d2","mcp_get_code":{"code_sha256":"a5c5ad9dfba730d2"}},{"arxiv_id":"2507.01299","paper":null,"title":"arXiv:2507.01299","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"alibaba/EfficientAI","path":"masquant/custom_dataset.py","file_url":"https://github.com/alibaba/EfficientAI/blob/HEAD/masquant/custom_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":"d8f401d3be5d49f4","mcp_get_code":{"code_sha256":"d8f401d3be5d49f4"}},{"arxiv_id":"2506.08762","paper":"/paper/2506-08762","title":"EDINET-Bench: Evaluating LLMs on Complex Financial Tasks using Japanese Financial Statements","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sakanaai/edinet-bench","path":"src/edinet_bench/logistic.py","file_url":"https://github.com/sakanaai/edinet-bench/blob/HEAD/src/edinet_bench/logistic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"67b49b0983888fd3","mcp_get_code":{"code_sha256":"67b49b0983888fd3"}},{"arxiv_id":"2505.12434","paper":"/paper/videorft-incentivizing-video-reasoning","title":"VideoRFT: Incentivizing Video Reasoning Capability in MLLMs via Reinforced Fine-Tuning","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang98/videorft","path":"src/r1-v/src/open_r1/sft_video.py","file_url":"https://github.com/qiwang98/videorft/blob/HEAD/src/r1-v/src/open_r1/sft_video.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":"40640dbb4bed6b2c","mcp_get_code":{"code_sha256":"40640dbb4bed6b2c"}},{"arxiv_id":"2504.02199","paper":"/paper/esc-erasing-space-concept-for-knowledge","title":"ESC: Erasing Space Concept for Knowledge Deletion","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-VGI/ESC","path":"unlearn.py","file_url":"https://github.com/KU-VGI/ESC/blob/HEAD/unlearn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e98c82942ca364b2","mcp_get_code":{"code_sha256":"e98c82942ca364b2"}},{"arxiv_id":"2503.18929","paper":"/paper/trajectory-balance-with-asynchrony-decoupling","title":"Trajectory Balance with Asynchrony: Decoupling Exploration and Learning for Fast, Scalable LLM Post-Training","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbartoldson/TBA","path":"tba_tldr.py","file_url":"https://github.com/bbartoldson/TBA/blob/HEAD/tba_tldr.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":"a2e246bb45f45630","mcp_get_code":{"code_sha256":"a2e246bb45f45630"}},{"arxiv_id":"2412.01129","paper":"/paper/rilq-rank-insensitive-lora-based-quantization","title":"RILQ: Rank-Insensitive LoRA-based Quantization Error Compensation for Boosting 2-bit Large Language Model Accuracy","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiha-lab/rilq","path":"rilq_utils/data.py","file_url":"https://github.com/aiha-lab/rilq/blob/HEAD/rilq_utils/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":"2379dffb2ba023d0","mcp_get_code":{"code_sha256":"2379dffb2ba023d0"}},{"arxiv_id":"2410.18252","paper":"/paper/asynchronous-rlhf-faster-and-more-efficient","title":"Asynchronous RLHF: Faster and More Efficient Off-Policy RL for Language Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mnoukhov/async_rlhf","path":"online_dpo.py","file_url":"https://github.com/mnoukhov/async_rlhf/blob/HEAD/online_dpo.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":"a2e246bb45f45630","mcp_get_code":{"code_sha256":"a2e246bb45f45630"}},{"arxiv_id":"2410.14211","paper":"/paper/paths-over-graph-knowledge-graph-enpowered","title":"Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SteveTANTAN/PoG","path":"PoG/utils.py","file_url":"https://github.com/SteveTANTAN/PoG/blob/HEAD/PoG/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":"68fca283c8ee65c1","mcp_get_code":{"code_sha256":"68fca283c8ee65c1"}},{"arxiv_id":"2410.09693","paper":"/paper/neural-solver-selection-for-combinatorial","title":"Neural Solver Selection for Combinatorial Optimization","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/neural-solver-selection","path":"utils.py","file_url":"https://github.com/lamda-bbo/neural-solver-selection/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2eeabea8e2f0857a","mcp_get_code":{"code_sha256":"2eeabea8e2f0857a"}},{"arxiv_id":"2408.04284","paper":"/paper/llm-detectaive-a-tool-for-fine-grained","title":"LLM-DetectAIve: a Tool for Fine-Grained Machine-Generated Text Detection","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/llm-detectaive","path":"pipeline/dataset.py","file_url":"https://github.com/mbzuai-nlp/llm-detectaive/blob/HEAD/pipeline/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7175d9e4888d2f7","mcp_get_code":{"code_sha256":"d7175d9e4888d2f7"}},{"arxiv_id":"2404.14741","paper":"/paper/generate-on-graph-treat-llm-as-both-agent-and","title":"Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YaooXu/GoG","path":"CoT/utils.py","file_url":"https://github.com/YaooXu/GoG/blob/HEAD/CoT/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"00b2e6d240c0d36b","mcp_get_code":{"code_sha256":"00b2e6d240c0d36b"}},{"arxiv_id":"2402.05453","paper":"/paper/mitigating-privacy-risk-in-membership","title":"Mitigating Privacy Risk in Membership Inference by Convex-Concave Loss","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-stat-Sustech/ConvexConcaveLoss","path":"source/data_preprocessing/dataset_preprocessing.py","file_url":"https://github.com/ml-stat-Sustech/ConvexConcaveLoss/blob/HEAD/source/data_preprocessing/dataset_preprocessing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0f643892107414ea","mcp_get_code":{"code_sha256":"0f643892107414ea"}},{"arxiv_id":"2401.09953","paper":"/paper/through-the-dual-prism-a-spectral-perspective","title":"Through the Dual-Prism: A Spectral Perspective on Graph Data Augmentation for Graph Classification","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/dualprism","path":"src/utils.py","file_url":"https://github.com/yu-rp/dualprism/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cbf4d0892481c707","mcp_get_code":{"code_sha256":"cbf4d0892481c707"}},{"arxiv_id":"2310.04799","paper":"/paper/chat-vector-a-simple-approach-to-equip-llms","title":"Chat Vector: A Simple Approach to Equip LLMs with Instruction Following and Model Alignment in New Languages","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"augmxnt/deccp","path":"abliterator.py","file_url":"https://github.com/augmxnt/deccp/blob/HEAD/abliterator.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":"d53507b37cb81222","mcp_get_code":{"code_sha256":"d53507b37cb81222"}},{"arxiv_id":"2308.10487","paper":"/paper/deciphering-raw-data-in-neuro-symbolic","title":"Deciphering Raw Data in Neuro-Symbolic Learning with Provable Guarantees","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abductivelearning/abl-tl","path":"data.py","file_url":"https://github.com/abductivelearning/abl-tl/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3cd8f7c384d495a9","mcp_get_code":{"code_sha256":"3cd8f7c384d495a9"}},{"arxiv_id":"2307.07697","paper":"/paper/think-on-graph-deep-and-responsible-reasoning","title":"Think-on-Graph: Deep and Responsible Reasoning of Large Language Model on Knowledge Graph","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IDEA-FinAI/ToG","path":"CoT/utils.py","file_url":"https://github.com/IDEA-FinAI/ToG/blob/HEAD/CoT/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"00b2e6d240c0d36b","mcp_get_code":{"code_sha256":"00b2e6d240c0d36b"}},{"arxiv_id":"2305.18290","paper":"/paper/direct-preference-optimization-your-language","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kidist-amde/ddro-direct-document-relevance-optimization","path":"src/pretrain/finetune_docTTTTTquery_NQ.py","file_url":"https://github.com/kidist-amde/ddro-direct-document-relevance-optimization/blob/HEAD/src/pretrain/finetune_docTTTTTquery_NQ.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":"19b1210f13924026","mcp_get_code":{"code_sha256":"19b1210f13924026"}},{"arxiv_id":"2303.16750","paper":"/paper/a-gold-standard-dataset-for-the-reviewer","title":"A Gold Standard Dataset for the Reviewer Assignment Problem","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niharshah/goldstandard-reviewer-paper-match","path":"scripts/prepare_dataset.py","file_url":"https://github.com/niharshah/goldstandard-reviewer-paper-match/blob/HEAD/scripts/prepare_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"05393c48abdec847","mcp_get_code":{"code_sha256":"05393c48abdec847"}},{"arxiv_id":"2212.06515","paper":"/paper/advmil-adversarial-multiple-instance-learning","title":"AdvMIL: Adversarial Multiple Instance Learning for the Survival Analysis on Whole-Slide Images","date":"2022-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liupei101/advmil","path":"dataset/utils.py","file_url":"https://github.com/liupei101/advmil/blob/HEAD/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":"6c12bc9946ecffcb","mcp_get_code":{"code_sha256":"6c12bc9946ecffcb"}},{"arxiv_id":"2203.13573","paper":"/paper/unsupervised-learning-of-temporal","title":"Unsupervised Learning of Temporal Abstractions with Slot-based Transformers","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agopal42/slottar","path":"preprocess.py","file_url":"https://github.com/agopal42/slottar/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":"ca4ef00b5db7d896","mcp_get_code":{"code_sha256":"ca4ef00b5db7d896"}},{"arxiv_id":"2111.13792","paper":"/paper/lafite-towards-language-free-training-for","title":"LAFITE: Towards Language-Free Training for Text-to-Image Generation","date":"2021-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxygenlu/ratlip","path":"code/lib/perpare.py","file_url":"https://github.com/oxygenlu/ratlip/blob/HEAD/code/lib/perpare.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d4c40e264c45657c","mcp_get_code":{"code_sha256":"d4c40e264c45657c"}},{"arxiv_id":"2111.02194","paper":"/paper/learning-implicit-sentiment-in-aspect-based","title":"Learning Implicit Sentiment in Aspect-based Sentiment Analysis with Supervised Contrastive Pre-Training","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tribleave/SCAPT-ABSA","path":"train/misc.py","file_url":"https://github.com/Tribleave/SCAPT-ABSA/blob/HEAD/train/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b9a0638f8e3d830b","mcp_get_code":{"code_sha256":"b9a0638f8e3d830b"}},{"arxiv_id":"2110.13601","paper":"/paper/dag-card-is-the-new-model-card","title":"DAG Card is the new Model Card","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacopotagliabue/metaflow-intent-prediction","path":"local_flow/intent/src/prepare_dataset.py","file_url":"https://github.com/jacopotagliabue/metaflow-intent-prediction/blob/HEAD/local_flow/intent/src/prepare_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec5dcfa1a6b0f7af","mcp_get_code":{"code_sha256":"ec5dcfa1a6b0f7af"}},{"arxiv_id":"2107.07346","paper":"/paper/you-do-not-need-a-bigger-boat-recommendations","title":"You Do Not Need a Bigger Boat: Recommendations at Reasonable Scale in a (Mostly) Serverless and Open Stack","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacopotagliabue/you-dont-need-a-bigger-boat","path":"local_flow/intent/src/prepare_dataset.py","file_url":"https://github.com/jacopotagliabue/you-dont-need-a-bigger-boat/blob/HEAD/local_flow/intent/src/prepare_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec5dcfa1a6b0f7af","mcp_get_code":{"code_sha256":"ec5dcfa1a6b0f7af"}},{"arxiv_id":"2004.00070","paper":"/paper/conditional-channel-gated-networks-for-task","title":"Conditional Channel Gated Networks for Task-Aware Continual Learning","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lit-leo/cgate","path":"src/data.py","file_url":"https://github.com/lit-leo/cgate/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9dce6d4bf3b88343","mcp_get_code":{"code_sha256":"9dce6d4bf3b88343"}},{"arxiv_id":"1711.02512","paper":"/paper/fine-tuning-cnn-image-retrieval-with-no-human","title":"Fine-tuning CNN Image Retrieval with No Human Annotation","date":"2017-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nikosefth/freedom","path":"utils_retrieval.py","file_url":"https://github.com/nikosefth/freedom/blob/HEAD/utils_retrieval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4da573acef3a31a2","mcp_get_code":{"code_sha256":"4da573acef3a31a2"}},{"arxiv_id":"2025.findings-emnlp.538","paper":null,"title":"arXiv:2025.findings-emnlp.538","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SOLAR2025ARR/SOLAR","path":"datagen/llm_rerank.py","file_url":"https://github.com/SOLAR2025ARR/SOLAR/blob/HEAD/datagen/llm_rerank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0588343b65e27435","mcp_get_code":{"code_sha256":"0588343b65e27435"}}]}