{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-train-loader","entry":"get_train_loader","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":12,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":7},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2412.12791","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-location-caption-alignment-via","title":"Implicit Location-Caption Alignment via Complementary Masking for Weakly-Supervised Dense Video Captioning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShipingGe/ILCACM","path":"src/util/dataloader.py","file_url":"https://github.com/ShipingGe/ILCACM/blob/HEAD/src/util/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"602593121cc1851f","code_sha256_prefix":"602593121cc1851f","mcp_get_code":{"code_sha256":"602593121cc1851f"}},{"arxiv_id":"2306.12230","arxiv_id_is_arxiv":true,"paper":"/paper/fantastic-weights-and-how-to-find-them-where-1","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alooow/fantastic_weights_paper","path":"imagenet_main.py","file_url":"https://github.com/alooow/fantastic_weights_paper/blob/HEAD/imagenet_main.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"04b0a36942f99acf","code_sha256_prefix":"04b0a36942f99acf","mcp_get_code":{"code_sha256":"04b0a36942f99acf"}},{"arxiv_id":"2303.14969","arxiv_id_is_arxiv":true,"paper":"/paper/universal-few-shot-learning-of-dense","title":"Universal Few-shot Learning of Dense Prediction Tasks with Visual Token Matching","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gitgyun/visual_token_matching","path":"dataset/dataloader_factory.py","file_url":"https://github.com/gitgyun/visual_token_matching/blob/HEAD/dataset/dataloader_factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a11b29bac73f5967","code_sha256_prefix":"a11b29bac73f5967","mcp_get_code":{"code_sha256":"a11b29bac73f5967"}},{"arxiv_id":"2205.06262","arxiv_id_is_arxiv":true,"paper":"/paper/feta-a-benchmark-for-few-sample-task-transfer","title":"FETA: A Benchmark for Few-Sample Task Transfer in Open-Domain Dialogue","date":"2022-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alon-albalak/tlidb","path":"tlidb/TLiDB/data_loaders/data_loaders.py","file_url":"https://github.com/alon-albalak/tlidb/blob/HEAD/tlidb/TLiDB/data_loaders/data_loaders.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed08ccd15847eb99","code_sha256_prefix":"ed08ccd15847eb99","mcp_get_code":{"code_sha256":"ed08ccd15847eb99"}},{"arxiv_id":"2201.05131","arxiv_id_is_arxiv":true,"paper":"/paper/simreg-regression-as-a-simple-yet-effective","title":"SimReg: Regression as a Simple Yet Effective Tool for Self-supervised Knowledge Distillation","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucdvision/simreg","path":"dataloader.py","file_url":"https://github.com/ucdvision/simreg/blob/HEAD/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f32e37ef9afef4a","code_sha256_prefix":"7f32e37ef9afef4a","mcp_get_code":{"code_sha256":"7f32e37ef9afef4a"}},{"arxiv_id":"2110.12033","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-low-budget-active","title":"A Simple Baseline for Low-Budget Active Learning","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucdvision/low-budget-al","path":"finetune.py","file_url":"https://github.com/ucdvision/low-budget-al/blob/HEAD/finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d99dc82b2c56aad","code_sha256_prefix":"2d99dc82b2c56aad","mcp_get_code":{"code_sha256":"2d99dc82b2c56aad"}},{"arxiv_id":"2110.12033","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-baseline-for-low-budget-active","title":"A Simple Baseline for Low-Budget Active Learning","date":"2021-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucdvision/low-budget-al","path":"active_sampler.py","file_url":"https://github.com/ucdvision/low-budget-al/blob/HEAD/active_sampler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10b4a8cb35b97aaa","code_sha256_prefix":"10b4a8cb35b97aaa","mcp_get_code":{"code_sha256":"10b4a8cb35b97aaa"}},{"arxiv_id":"2106.03310","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-knowledge-distillation-from-a","title":"Zero-Shot Knowledge Distillation from a Decision-Based Black-Box Model","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwang84/zsdb3kd","path":"get_soft_labels.py","file_url":"https://github.com/zwang84/zsdb3kd/blob/HEAD/get_soft_labels.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zwang84/zsdb3kd when it was checked","code_sha256":"a5817c4ad22df324","code_sha256_prefix":"a5817c4ad22df324","mcp_get_code":{"code_sha256":"a5817c4ad22df324"}},{"arxiv_id":"2106.01226","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-semantic-segmentation-with-3","title":"Semi-Supervised Semantic Segmentation with Cross Pseudo Supervision","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harshm121/m3l","path":"src/semi_supervised/cps.py","file_url":"https://github.com/harshm121/m3l/blob/HEAD/src/semi_supervised/cps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, harshm121/m3l when it was checked","code_sha256":"74ffeedbf2acc130","code_sha256_prefix":"74ffeedbf2acc130","mcp_get_code":{"code_sha256":"74ffeedbf2acc130"}},{"arxiv_id":"2104.02226","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-categorical-label-representations-for-1","title":"Beyond Categorical Label Representations for Image Classification","date":"2021-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BoyuanChen/label_representations","path":"cifar.py","file_url":"https://github.com/BoyuanChen/label_representations/blob/HEAD/cifar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48a09f848ac92a77","code_sha256_prefix":"48a09f848ac92a77","mcp_get_code":{"code_sha256":"48a09f848ac92a77"}},{"arxiv_id":"2001.01568","arxiv_id_is_arxiv":true,"paper":"/paper/learned-image-compression-with-discretized","title":"Learned Image Compression with Discretized Gaussian Mixture Likelihoods and Attention Modules","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiuLei95/PyTorch-Learned-Image-Compression-with-GMM-and-Attention","path":"datasets.py","file_url":"https://github.com/LiuLei95/PyTorch-Learned-Image-Compression-with-GMM-and-Attention/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e3ec336e202299e","code_sha256_prefix":"4e3ec336e202299e","mcp_get_code":{"code_sha256":"4e3ec336e202299e"}},{"arxiv_id":"1611.01704","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-optimized-image-compression","title":"End-to-end Optimized Image Compression","date":"2016-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liujiaheng/iclr_17_compression","path":"datasets.py","file_url":"https://github.com/liujiaheng/iclr_17_compression/blob/HEAD/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e3ec336e202299e","code_sha256_prefix":"4e3ec336e202299e","mcp_get_code":{"code_sha256":"4e3ec336e202299e"}},{"arxiv_id":"Park_LANIT_Language-Driven_Image-to-Image_Translation_for_Unlabeled_Data_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Park_LANIT_Language-Driven_Image-to-Image_Translation_for_Unlabeled_Data_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KU-CVLAB/LANIT","path":"core/data_loader.py","file_url":"https://github.com/KU-CVLAB/LANIT/blob/HEAD/core/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5588c411eb2736b5","code_sha256_prefix":"5588c411eb2736b5","mcp_get_code":{"code_sha256":"5588c411eb2736b5"}}],"record_sha256":"dd0e0b21a9b6a26fd38a7bbc349743e21ca0ca514c0a9749f52b12c11941c2a2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}