{"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/get-train-dataset","entry":"get_train_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":5,"n_papers_ran":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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.31317","paper":"/paper/arxiv-2605-31317","title":"Forgetting Has Neighbors: Localized Collateral Forgetting in Machine Unlearning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"polina-dolgova/local_teacher_distillation","path":"cifar/methods/distill/support_teachers.py","file_url":"https://github.com/polina-dolgova/local_teacher_distillation/blob/HEAD/cifar/methods/distill/support_teachers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c41a0a6a143b9295","mcp_get_code":{"code_sha256":"c41a0a6a143b9295"}},{"arxiv_id":"2603.29410","paper":"/paper/arxiv-2603-29410","title":"AGFT: Alignment-Guided Fine-Tuning for Zero-Shot Adversarial Robustness of Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"YuboCui/AGFT","path":"utils.py","file_url":"https://github.com/YuboCui/AGFT/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd82db2984e88662","mcp_get_code":{"code_sha256":"cd82db2984e88662"}},{"arxiv_id":"2403.07711","paper":"/paper/ssm-meets-video-diffusion-models-efficient","title":"SSM Meets Video Diffusion Models: Efficient Long-Term Video Generation with Structured State Spaces","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shim0114/SSM-Meets-Video-Diffusion-Models","path":"video_diffusion_pytorch/long_video_datasets.py","file_url":"https://github.com/shim0114/SSM-Meets-Video-Diffusion-Models/blob/HEAD/video_diffusion_pytorch/long_video_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7e3ecf1b3d3ff289","mcp_get_code":{"code_sha256":"7e3ecf1b3d3ff289"}},{"arxiv_id":"2401.09266","paper":"/paper/p-2-ot-progressive-partial-optimal-transport","title":"P$^2$OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering","date":"2024-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhfeiyang/ppot","path":"utils/common_config.py","file_url":"https://github.com/rhfeiyang/ppot/blob/HEAD/utils/common_config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"3dd636cbaa579436","mcp_get_code":{"code_sha256":"3dd636cbaa579436"}},{"arxiv_id":"2305.10722","paper":"/paper/discriminative-diffusion-models-as-few-shot","title":"Discffusion: Discriminative Diffusion Models as Few-shot Vision and Language Learners","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-ai-lab/dsd","path":"custom_datasets.py","file_url":"https://github.com/eric-ai-lab/dsd/blob/HEAD/custom_datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be7a240b9dcc2368","mcp_get_code":{"code_sha256":"be7a240b9dcc2368"}}]}