{"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/data-loader","entry":"data_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":25,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":3,"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":28,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":3,"n_samples_unverified":13,"n_samples_fingerprinted":0,"n_places":28,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":11,"unverified":13},"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":"2510.14623","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-14623","title":"LeapFactual: Reliable Visual Counterfactual Explanation Using Conditional Flow Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"caicairay/LeapFactual","path":"training_scripts/experiments/utils.py","file_url":"https://github.com/caicairay/LeapFactual/blob/HEAD/training_scripts/experiments/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"73a5cdcd89c29ee4","code_sha256_prefix":"73a5cdcd89c29ee4","mcp_get_code":{"code_sha256":"73a5cdcd89c29ee4"}},{"arxiv_id":"2404.11500","arxiv_id_is_arxiv":true,"paper":"/paper/paraphrase-and-solve-exploring-and-exploiting","title":"Paraphrase and Solve: Exploring and Exploiting the Impact of Surface Form on Mathematical Reasoning in Large Language Models","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yue-LLM-Pit/SCoP","path":"utils.py","file_url":"https://github.com/Yue-LLM-Pit/SCoP/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e619b59640b78cb3","code_sha256_prefix":"e619b59640b78cb3","mcp_get_code":{"code_sha256":"e619b59640b78cb3"}},{"arxiv_id":"2403.07134","arxiv_id_is_arxiv":true,"paper":"/paper/comq-a-backpropagation-free-algorithm-for","title":"COMQ: A Backpropagation-Free Algorithm for Post-Training Quantization","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aozhongzhang/comq","path":"datautils.py","file_url":"https://github.com/aozhongzhang/comq/blob/HEAD/datautils.py","status":"ran","verification_level":1,"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, aozhongzhang/comq when it was checked","code_sha256":"c330d1f7ea1cc699","code_sha256_prefix":"c330d1f7ea1cc699","mcp_get_code":{"code_sha256":"c330d1f7ea1cc699"}},{"arxiv_id":"2402.18059","arxiv_id_is_arxiv":true,"paper":"/paper/token-specific-watermarking-with-enhanced","title":"Token-Specific Watermarking with Enhanced Detectability and Semantic Coherence for Large Language Models","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mignonjia/ts_watermark","path":"utils/data_loader.py","file_url":"https://github.com/mignonjia/ts_watermark/blob/HEAD/utils/data_loader.py","status":"ran","verification_level":1,"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, mignonjia/ts_watermark when it was checked","code_sha256":"ee0a7309525621bf","code_sha256_prefix":"ee0a7309525621bf","mcp_get_code":{"code_sha256":"ee0a7309525621bf"}},{"arxiv_id":"2402.16788","arxiv_id_is_arxiv":true,"paper":"/paper/why-transformers-need-adam-a-hessian","title":"Why Transformers Need Adam: A Hessian Perspective","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyushun/hessian-spectrum","path":"vision_models/data_loader.py","file_url":"https://github.com/zyushun/hessian-spectrum/blob/HEAD/vision_models/data_loader.py","status":"ran","verification_level":1,"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, zyushun/hessian-spectrum when it was checked","code_sha256":"fafefcd33288b3e3","code_sha256_prefix":"fafefcd33288b3e3","mcp_get_code":{"code_sha256":"fafefcd33288b3e3"}},{"arxiv_id":"2402.02720","arxiv_id_is_arxiv":true,"paper":"/paper/discounted-adaptive-online-prediction","title":"Discounted Adaptive Online Learning: Towards Better Regularization","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ComputationalRobotics/discounted-adaptive","path":"cv_utils.py","file_url":"https://github.com/ComputationalRobotics/discounted-adaptive/blob/HEAD/cv_utils.py","status":"ran","verification_level":1,"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, ComputationalRobotics/discounted-adaptive when it was checked","code_sha256":"d8d95fb1a50469c8","code_sha256_prefix":"d8d95fb1a50469c8","mcp_get_code":{"code_sha256":"d8d95fb1a50469c8"}},{"arxiv_id":"2310.20211","arxiv_id_is_arxiv":true,"paper":"/paper/calibration-by-distribution-matching-1","title":"Calibration by Distribution Matching: Trainable Kernel Calibration Metrics","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kernel-calibration/kernel-calibration","path":"torchuq/dataset/imagenet.py","file_url":"https://github.com/kernel-calibration/kernel-calibration/blob/HEAD/torchuq/dataset/imagenet.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":"d8e925ee6db84c87","code_sha256_prefix":"d8e925ee6db84c87","mcp_get_code":{"code_sha256":"d8e925ee6db84c87"}},{"arxiv_id":"2305.06090","arxiv_id_is_arxiv":true,"paper":"/paper/xtab-cross-table-pretraining-for-tabular","title":"XTab: Cross-table Pretraining for Tabular Transformers","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bingzhaozhu/xtab","path":"runexample.py","file_url":"https://github.com/bingzhaozhu/xtab/blob/HEAD/runexample.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, bingzhaozhu/xtab when it was checked","code_sha256":"d293a4b897997532","code_sha256_prefix":"d293a4b897997532","mcp_get_code":{"code_sha256":"d293a4b897997532"}},{"arxiv_id":"2202.00089","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-adamw-through-proximal-methods-1","title":"Understanding AdamW through Proximal Methods and Scale-Freeness","date":"2022-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenxun-zhuang/adamw-scale-free","path":"src/data_loader.py","file_url":"https://github.com/zhenxun-zhuang/adamw-scale-free/blob/HEAD/src/data_loader.py","status":"unverified","verification_level":0,"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":"1509587e8398121b","code_sha256_prefix":"1509587e8398121b","mcp_get_code":{"code_sha256":"1509587e8398121b"}},{"arxiv_id":"2106.07411","arxiv_id_is_arxiv":true,"paper":"/paper/partial-success-in-closing-the-gap-between","title":"Partial success in closing the gap between human and machine vision","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kantharajucn/CLIP-imagenet-evaluation","path":"data_loader.py","file_url":"https://github.com/kantharajucn/CLIP-imagenet-evaluation/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"68a72b229739b428","code_sha256_prefix":"68a72b229739b428","mcp_get_code":{"code_sha256":"68a72b229739b428"}},{"arxiv_id":"2105.00636","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-drive-from-a-world-on-rails","title":"Learning to drive from a world on rails","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dotchen/WorldOnRails","path":"lbc/dataset.py","file_url":"https://github.com/dotchen/WorldOnRails/blob/HEAD/lbc/dataset.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":"c00521713304b207","code_sha256_prefix":"c00521713304b207","mcp_get_code":{"code_sha256":"c00521713304b207"}},{"arxiv_id":"2104.08984","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-improves-model","title":"Contrastive Learning Improves Model Robustness Under Label Noise","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arghosh/noisy_label_pretrain","path":"imagenet32.py","file_url":"https://github.com/arghosh/noisy_label_pretrain/blob/HEAD/imagenet32.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":"961e370efdf679f8","code_sha256_prefix":"961e370efdf679f8","mcp_get_code":{"code_sha256":"961e370efdf679f8"}},{"arxiv_id":"2008.03781","arxiv_id_is_arxiv":true,"paper":"/paper/semeval-2020-task-8-memotion-analysis-the","title":"SemEval-2020 Task 8: Memotion Analysis -- The Visuo-Lingual Metaphor!","date":"2020-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terenceylchow124/Meme-MultiModal","path":"utils/util_loader.py","file_url":"https://github.com/terenceylchow124/Meme-MultiModal/blob/HEAD/utils/util_loader.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":"0c88c542763a7b8a","code_sha256_prefix":"0c88c542763a7b8a","mcp_get_code":{"code_sha256":"0c88c542763a7b8a"}},{"arxiv_id":"1911.00068","arxiv_id_is_arxiv":true,"paper":"/paper/confident-learning-estimating-uncertainty-in","title":"Confident Learning: Estimating Uncertainty in Dataset Labels","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cleanlab/examples","path":"fasttext_amazon_reviews/fasttext_wrapper.py","file_url":"https://github.com/cleanlab/examples/blob/HEAD/fasttext_amazon_reviews/fasttext_wrapper.py","status":"unverified","verification_level":0,"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":"f452766c96419106","code_sha256_prefix":"f452766c96419106","mcp_get_code":{"code_sha256":"f452766c96419106"}},{"arxiv_id":"1910.08525","arxiv_id_is_arxiv":true,"paper":"/paper/scheduling-the-learning-rate-via-1","title":"MARTHE: Scheduling the Learning Rate Via Online Hypergradients","date":"2019-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/adatune","path":"adatune/data_loader.py","file_url":"https://github.com/awslabs/adatune/blob/HEAD/adatune/data_loader.py","status":"unverified","verification_level":0,"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":"784ddae11e176a3a","code_sha256_prefix":"784ddae11e176a3a","mcp_get_code":{"code_sha256":"784ddae11e176a3a"}},{"arxiv_id":"1907.00481","arxiv_id_is_arxiv":true,"paper":"/paper/mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hustwutao/Deep-Clustering","path":"DEC/utils.py","file_url":"https://github.com/hustwutao/Deep-Clustering/blob/HEAD/DEC/utils.py","status":"unverified","verification_level":0,"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":"b799b125efb60c2a","code_sha256_prefix":"b799b125efb60c2a","mcp_get_code":{"code_sha256":"b799b125efb60c2a"}},{"arxiv_id":"1902.10197","arxiv_id_is_arxiv":true,"paper":"/paper/rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davendw49/gakg","path":"code/baselines/transH/TransH.py","file_url":"https://github.com/davendw49/gakg/blob/HEAD/code/baselines/transH/TransH.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":"f103f76a05c11c85","code_sha256_prefix":"f103f76a05c11c85","mcp_get_code":{"code_sha256":"f103f76a05c11c85"}},{"arxiv_id":"1811.10792","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-gradient-push-for-distributed-deep","title":"Stochastic Gradient Push for Distributed Deep Learning","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adelnabli/acid","path":"utils/data_utils.py","file_url":"https://github.com/adelnabli/acid/blob/HEAD/utils/data_utils.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":"553014d88e2fdc2b","code_sha256_prefix":"553014d88e2fdc2b","mcp_get_code":{"code_sha256":"553014d88e2fdc2b"}},{"arxiv_id":"1807.08902","arxiv_id_is_arxiv":true,"paper":"/paper/self-produced-guidance-for-weakly-supervised","title":"Self-produced Guidance for Weakly-supervised Object Localization","date":"2018-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaomengyc/SPG","path":"utils/LoadData.py","file_url":"https://github.com/xiaomengyc/SPG/blob/HEAD/utils/LoadData.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":"52848ec151fe179a","code_sha256_prefix":"52848ec151fe179a","mcp_get_code":{"code_sha256":"52848ec151fe179a"}},{"arxiv_id":"1806.06422","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-evaluate-image-captioning","title":"Learning to Evaluate Image Captioning","date":"2018-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richardaecn/cvpr18-caption-eval","path":"score.py","file_url":"https://github.com/richardaecn/cvpr18-caption-eval/blob/HEAD/score.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":"125c42eb3ba458ac","code_sha256_prefix":"125c42eb3ba458ac","mcp_get_code":{"code_sha256":"125c42eb3ba458ac"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerlux/NLP-PTB","path":"Language_Modeling_DataRearange/Language_Modeling.py","file_url":"https://github.com/omerlux/NLP-PTB/blob/HEAD/Language_Modeling_DataRearange/Language_Modeling.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":"c75648e7493bfa87","code_sha256_prefix":"c75648e7493bfa87","mcp_get_code":{"code_sha256":"c75648e7493bfa87"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerlux/NLP-PTB","path":"Language_Modeling_Old/Language_Modeling.py","file_url":"https://github.com/omerlux/NLP-PTB/blob/HEAD/Language_Modeling_Old/Language_Modeling.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":"b47a3b26a9d39f5f","code_sha256_prefix":"b47a3b26a9d39f5f","mcp_get_code":{"code_sha256":"b47a3b26a9d39f5f"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omerlux/NLP-PTB","path":"Language_Modeling_Old/Language_Modeling_tfds.py","file_url":"https://github.com/omerlux/NLP-PTB/blob/HEAD/Language_Modeling_Old/Language_Modeling_tfds.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":"dd918220a90f8779","code_sha256_prefix":"dd918220a90f8779","mcp_get_code":{"code_sha256":"dd918220a90f8779"}},{"arxiv_id":"1710.10196","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-growing-of-gans-for-improved","title":"Progressive Growing of GANs for Improved Quality, Stability, and Variation","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aruie/Aru_StyleGAN","path":"data_loader.py","file_url":"https://github.com/Aruie/Aru_StyleGAN/blob/HEAD/data_loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Aruie/Aru_StyleGAN when it was checked","code_sha256":"a64567ed28beff99","code_sha256_prefix":"a64567ed28beff99","mcp_get_code":{"code_sha256":"a64567ed28beff99"}},{"arxiv_id":"1611.07004","arxiv_id_is_arxiv":true,"paper":"/paper/image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brade31919/SRGAN-tensorflow","path":"lib/model.py","file_url":"https://github.com/brade31919/SRGAN-tensorflow/blob/HEAD/lib/model.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":"60001f4ecac0d635","code_sha256_prefix":"60001f4ecac0d635","mcp_get_code":{"code_sha256":"60001f4ecac0d635"}},{"arxiv_id":"2025.acl-long.179","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.179","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUC-NLPIR/RAG-Critic","path":"rag_error_bench/predict_dev.py","file_url":"https://github.com/RUC-NLPIR/RAG-Critic/blob/HEAD/rag_error_bench/predict_dev.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":"ee98fa23ded71ec2","code_sha256_prefix":"ee98fa23ded71ec2","mcp_get_code":{"code_sha256":"ee98fa23ded71ec2"}},{"arxiv_id":"2025.acl-long.179","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.179","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUC-NLPIR/RAG-Critic","path":"error_system_construction/error_type_tagger.py","file_url":"https://github.com/RUC-NLPIR/RAG-Critic/blob/HEAD/error_system_construction/error_type_tagger.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":"d7c949a208914b94","code_sha256_prefix":"d7c949a208914b94","mcp_get_code":{"code_sha256":"d7c949a208914b94"}},{"arxiv_id":"2021.findings-acl.208","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-acl.208","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"chuchun8/PStance","path":"source/utils/data_helper.py","file_url":"https://github.com/chuchun8/PStance/blob/HEAD/source/utils/data_helper.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":"347aea8f703cd9c4","code_sha256_prefix":"347aea8f703cd9c4","mcp_get_code":{"code_sha256":"347aea8f703cd9c4"}}],"record_sha256":"f74b66270094c59fb2484bf7e6c835d634506f38f8a5c477325051272cb26491","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}