{"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/onehot","entry":"onehot","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":39,"n_papers_ran":34,"n_papers_ran_no_instrument_failure":22,"n_papers_ran_instrument_only":12,"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":27,"n_samples_constructed":0,"n_samples_ran_checked":17,"n_samples_instrument":10,"n_samples_unverified":5,"n_samples_fingerprinted":3,"n_places":40,"n_places_pointer_only":13,"n_places_pointer_only_link_open":2,"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":6,"ran_violates":0,"ran_draft_wrong":9,"ran_fixture":1,"ran":11,"unverified":5},"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":"2609.02133","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02133","title":"EmoStance: Response-Side Affective-Orientation Control for Empathetic Response Generation via Emoji Weak Supervision","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"18277390221/EmoStance","path":"src/latent_stance_control/counterfactual_cluster_controls.py","file_url":"https://github.com/18277390221/EmoStance/blob/HEAD/src/latent_stance_control/counterfactual_cluster_controls.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bab0cb1529f07ad7","code_sha256_prefix":"bab0cb1529f07ad7","mcp_get_code":{"code_sha256":"bab0cb1529f07ad7"}},{"arxiv_id":"2601.22359","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22359","title":"The Unseen Threat: Residual Knowledge in Machine Unlearning under Perturbed Samples","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Graph-COM/Langevin_unlearning","path":"utils.py","file_url":"https://github.com/Graph-COM/Langevin_unlearning/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Graph-COM/Langevin_unlearning when it was checked","code_sha256":"424a51b62f7dd524","code_sha256_prefix":"424a51b62f7dd524","mcp_get_code":{"code_sha256":"424a51b62f7dd524"}},{"arxiv_id":"2509.24100","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24100","title":"SpeedCP: Fast Kernel-Based Conditional Conformal Prediction","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"yeojin-jung/speedcp","path":"experiments/molecular/run_qm7b.py","file_url":"https://github.com/yeojin-jung/speedcp/blob/HEAD/experiments/molecular/run_qm7b.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29f2999901c7b6d6","code_sha256_prefix":"29f2999901c7b6d6","mcp_get_code":{"code_sha256":"29f2999901c7b6d6"}},{"arxiv_id":"2507.17402","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.17402","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"lijun2005/ICCV25-HLFormer","path":"src/Models/HLFormer/model_components.py","file_url":"https://github.com/lijun2005/ICCV25-HLFormer/blob/HEAD/src/Models/HLFormer/model_components.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23b5db90923f7386","code_sha256_prefix":"23b5db90923f7386","mcp_get_code":{"code_sha256":"23b5db90923f7386"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Skyorca/JHGDA","path":"pseudo_labeling.py","file_url":"https://github.com/Skyorca/JHGDA/blob/HEAD/pseudo_labeling.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, Skyorca/JHGDA when it was checked","code_sha256":"593c735f6dd0d219","code_sha256_prefix":"593c735f6dd0d219","mcp_get_code":{"code_sha256":"593c735f6dd0d219"}},{"arxiv_id":"2403.19600","arxiv_id_is_arxiv":true,"paper":"/paper/enhance-image-classification-via-inter-class","title":"Enhance Image Classification via Inter-Class Image Mixup with Diffusion Model","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhicaiwww/diff-mix","path":"dataset/base.py","file_url":"https://github.com/zhicaiwww/diff-mix/blob/HEAD/dataset/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2847ea5f23c1e07","code_sha256_prefix":"a2847ea5f23c1e07","mcp_get_code":{"code_sha256":"a2847ea5f23c1e07"}},{"arxiv_id":"2403.13349","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-gaussian-mixture-normalizing","title":"Hierarchical Gaussian Mixture Normalizing Flow Modeling for Unified Anomaly Detection","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xcyao00/HGAD","path":"utils.py","file_url":"https://github.com/xcyao00/HGAD/blob/HEAD/utils.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, xcyao00/HGAD when it was checked","code_sha256":"601a426815a800ff","code_sha256_prefix":"601a426815a800ff","mcp_get_code":{"code_sha256":"601a426815a800ff"}},{"arxiv_id":"2402.12192","arxiv_id_is_arxiv":true,"paper":"/paper/pan-mamba-effective-pan-sharpening-with-state","title":"Pan-Mamba: Effective pan-sharpening with State Space Model","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexhe101/pan-mamba","path":"pan-sharpening/model/thops.py","file_url":"https://github.com/alexhe101/pan-mamba/blob/HEAD/pan-sharpening/model/thops.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, alexhe101/pan-mamba when it was checked","code_sha256":"7e39df9fabd27462","code_sha256_prefix":"7e39df9fabd27462","mcp_get_code":{"code_sha256":"7e39df9fabd27462"}},{"arxiv_id":"2311.11202","arxiv_id_is_arxiv":true,"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/datasets/csv_loder.py","file_url":"https://github.com/Docta-ai/docta/blob/HEAD/docta/datasets/csv_loder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Docta-ai/docta (NOASSERTION)","code_sha256":"ef874310d3110242","code_sha256_prefix":"ef874310d3110242","mcp_get_code":{"code_sha256":"ef874310d3110242"}},{"arxiv_id":"2310.05195","arxiv_id_is_arxiv":true,"paper":"/paper/gmmformer-gaussian-mixture-model-based","title":"GMMFormer: Gaussian-Mixture-Model Based Transformer for Efficient Partially Relevant Video Retrieval","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangmozhi9527/GMMFormer","path":"src/Models/gmmformer/model_components.py","file_url":"https://github.com/huangmozhi9527/GMMFormer/blob/HEAD/src/Models/gmmformer/model_components.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, huangmozhi9527/GMMFormer when it was checked","code_sha256":"23b5db90923f7386","code_sha256_prefix":"23b5db90923f7386","mcp_get_code":{"code_sha256":"23b5db90923f7386"}},{"arxiv_id":"2303.08500","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-s-advocate-shattering-the-illusion","title":"The Devil's Advocate: Shattering the Illusion of Unexploitable Data using Diffusion Models","date":"2023-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmdolatabadi/avatar","path":"ISS_augs.py","file_url":"https://github.com/hmdolatabadi/avatar/blob/HEAD/ISS_augs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2847ea5f23c1e07","code_sha256_prefix":"a2847ea5f23c1e07","mcp_get_code":{"code_sha256":"a2847ea5f23c1e07"}},{"arxiv_id":"2302.05793","arxiv_id_is_arxiv":true,"paper":"/paper/distributional-gflownets-with-quantile-flows","title":"Distributional GFlowNets with Quantile Flows","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zdhnarsil/distributional-gflownets","path":"mols/utils/chem.py","file_url":"https://github.com/zdhnarsil/distributional-gflownets/blob/HEAD/mols/utils/chem.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":"a0579acf3f4c545c","code_sha256_prefix":"a0579acf3f4c545c","mcp_get_code":{"code_sha256":"a0579acf3f4c545c"}},{"arxiv_id":"2211.00454","arxiv_id_is_arxiv":true,"paper":"/paper/pelican-permutation-equivariant-and-lorentz","title":"PELICAN: Permutation Equivariant and Lorentz Invariant or Covariant Aggregator Network for Particle Physics","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abogatskiy/pelican","path":"src/models/pelican_cov.py","file_url":"https://github.com/abogatskiy/pelican/blob/HEAD/src/models/pelican_cov.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":"aac3499a7873a4b0","code_sha256_prefix":"aac3499a7873a4b0","mcp_get_code":{"code_sha256":"aac3499a7873a4b0"}},{"arxiv_id":"2205.01580","arxiv_id_is_arxiv":true,"paper":"/paper/better-plain-vit-baselines-for-imagenet-1k","title":"Better plain ViT baselines for ImageNet-1k","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyangshu/retinavit","path":"big_vision/utils.py","file_url":"https://github.com/yuyangshu/retinavit/blob/HEAD/big_vision/utils.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":"7b17682564107576","code_sha256_prefix":"7b17682564107576","mcp_get_code":{"code_sha256":"7b17682564107576"}},{"arxiv_id":"2203.03463","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-sketch-induction-for-paraphrase","title":"Hierarchical Sketch Induction for Paraphrase Generation","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomhosking/hrq-vae","path":"src/hrq_vae.py","file_url":"https://github.com/tomhosking/hrq-vae/blob/HEAD/src/hrq_vae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e275a2e8b64d8a0","code_sha256_prefix":"1e275a2e8b64d8a0","mcp_get_code":{"code_sha256":"1e275a2e8b64d8a0"}},{"arxiv_id":"2202.01273","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/beyondimages","path":"utils/dataloader.py","file_url":"https://github.com/ucsc-real/beyondimages/blob/HEAD/utils/dataloader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ea81c57e23ddc38","code_sha256_prefix":"8ea81c57e23ddc38","mcp_get_code":{"code_sha256":"8ea81c57e23ddc38"}},{"arxiv_id":"2202.01273","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-images-label-noise-transition-matrix","title":"Beyond Images: Label Noise Transition Matrix Estimation for Tasks with Lower-Quality Features","date":"2022-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/est-t-mi","path":"utils/dataloader.py","file_url":"https://github.com/ucsc-real/est-t-mi/blob/HEAD/utils/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Docta-ai/docta, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"ef874310d3110242","code_sha256_prefix":"ef874310d3110242","mcp_get_code":{"code_sha256":"ef874310d3110242"}},{"arxiv_id":"2201.08967","arxiv_id_is_arxiv":true,"paper":"/paper/a-robust-hot-subdwarfs-identification-method","title":"A Robust Hot Subdwarfs Identification Method Based on Deep Learning","date":null,"month_inferred_from_arxiv_id":"2022-01","title_source":"archive","repo":"astronomical-data-processing/cnn_spectra_classification","path":"cnn_spectra_classification.py","file_url":"https://github.com/astronomical-data-processing/cnn_spectra_classification/blob/HEAD/cnn_spectra_classification.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, astronomical-data-processing/cnn_spectra_classification when it was checked","code_sha256":"70d1db195b80d368","code_sha256_prefix":"70d1db195b80d368","mcp_get_code":{"code_sha256":"70d1db195b80d368"}},{"arxiv_id":"2109.06275","arxiv_id_is_arxiv":true,"paper":"/paper/mindcraft-theory-of-mind-modeling-for","title":"MindCraft: Theory of Mind Modeling for Situated Dialogue in Collaborative Tasks","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sled-group/MindCraft","path":"experiments/model.py","file_url":"https://github.com/sled-group/MindCraft/blob/HEAD/experiments/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sled-group/MindCraft when it was checked","code_sha256":"2527396303e8645a","code_sha256_prefix":"2527396303e8645a","mcp_get_code":{"code_sha256":"2527396303e8645a"}},{"arxiv_id":"2106.02859","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-with-gated","title":"Convolutional Neural Networks with Gated Recurrent Connections","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jianf-Wang/GRCNN","path":"imagenet_train.py","file_url":"https://github.com/Jianf-Wang/GRCNN/blob/HEAD/imagenet_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d0518506614f0121","code_sha256_prefix":"d0518506614f0121","mcp_get_code":{"code_sha256":"d0518506614f0121"}},{"arxiv_id":"2105.14083","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-noisy-label-models-labeler","title":"Rethinking Noisy Label Models: Labeler-Dependent Noise with Adversarial Awareness","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wohlert/semi-supervised-pytorch","path":"semi-supervised/utils.py","file_url":"https://github.com/wohlert/semi-supervised-pytorch/blob/HEAD/semi-supervised/utils.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":"b69dfc1eac0c46c4","code_sha256_prefix":"b69dfc1eac0c46c4","mcp_get_code":{"code_sha256":"b69dfc1eac0c46c4"}},{"arxiv_id":"2105.06247","arxiv_id_is_arxiv":true,"paper":"/paper/video-corpus-moment-retrieval-with","title":"Video Corpus Moment Retrieval with Contrastive Learning","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IsaacChanghau/ReLoCLNet","path":"method_tvr/model_components.py","file_url":"https://github.com/IsaacChanghau/ReLoCLNet/blob/HEAD/method_tvr/model_components.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23b5db90923f7386","code_sha256_prefix":"23b5db90923f7386","mcp_get_code":{"code_sha256":"23b5db90923f7386"}},{"arxiv_id":"2103.13646","arxiv_id_is_arxiv":true,"paper":"/paper/contrast-to-divide-self-supervised-pre-1","title":"Contrast to Divide: Self-Supervised Pre-Training for Learning with Noisy Labels","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ContrastToDivide/C2D","path":"cross_entropy.py","file_url":"https://github.com/ContrastToDivide/C2D/blob/HEAD/cross_entropy.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfcd370121d1305f","code_sha256_prefix":"cfcd370121d1305f","mcp_get_code":{"code_sha256":"cfcd370121d1305f"}},{"arxiv_id":"2102.12013","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-mitigating-accuracy-1","title":"Understanding and Mitigating Accuracy Disparity in Regression","date":"2021-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JFChi/Understanding-and-Mitigating-Accuracy-Disparity-in-Regression","path":"prep_adult.py","file_url":"https://github.com/JFChi/Understanding-and-Mitigating-Accuracy-Disparity-in-Regression/blob/HEAD/prep_adult.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e5a88f3e3a93645","code_sha256_prefix":"3e5a88f3e3a93645","mcp_get_code":{"code_sha256":"3e5a88f3e3a93645"}},{"arxiv_id":"2009.04009","arxiv_id_is_arxiv":true,"paper":"/paper/learning-joint-segmentation-of-tissues-and","title":"Learning joint segmentation of tissues and brain lesions from task-specific hetero-modal domain-shifted datasets","date":"2020-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ReubenDo/jSTABL","path":"jstabl/utilities/jaccard.py","file_url":"https://github.com/ReubenDo/jSTABL/blob/HEAD/jstabl/utilities/jaccard.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":"dac2b744c6b4459a","code_sha256_prefix":"dac2b744c6b4459a","mcp_get_code":{"code_sha256":"dac2b744c6b4459a"}},{"arxiv_id":"2009.00725","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-constrained-graph-variational","title":"Conditional Constrained Graph Variational Autoencoders for Molecule Design","date":"2020-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drigoni/ConditionalCGVAE","path":"utils/utils.py","file_url":"https://github.com/drigoni/ConditionalCGVAE/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16ab39e407b99e8c","code_sha256_prefix":"16ab39e407b99e8c","mcp_get_code":{"code_sha256":"16ab39e407b99e8c"}},{"arxiv_id":"2004.10076","arxiv_id_is_arxiv":true,"paper":"/paper/tensor-networks-for-medical-image","title":"Tensor Networks for Medical Image Classification","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raghavian/loTeNet_pytorch","path":"utils/utils.py","file_url":"https://github.com/raghavian/loTeNet_pytorch/blob/HEAD/utils/utils.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":"d22a951c7ff816cf","code_sha256_prefix":"d22a951c7ff816cf","mcp_get_code":{"code_sha256":"d22a951c7ff816cf"}},{"arxiv_id":"2003.05034","arxiv_id_is_arxiv":true,"paper":"/paper/supermix-supervising-the-mixing-data","title":"SuperMix: Supervising the Mixing Data Augmentation","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alldbi/SuperMix","path":"supermix.py","file_url":"https://github.com/alldbi/SuperMix/blob/HEAD/supermix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, alldbi/SuperMix when it was checked","code_sha256":"ad52cd26425cc549","code_sha256_prefix":"ad52cd26425cc549","mcp_get_code":{"code_sha256":"ad52cd26425cc549"}},{"arxiv_id":"1909.11515","arxiv_id_is_arxiv":true,"paper":"/paper/mixup-inference-better-exploiting-mixup-to","title":"Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attacks","date":"2019-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Mixup-Inference","path":"train_resnet_mixup.py","file_url":"https://github.com/P2333/Mixup-Inference/blob/HEAD/train_resnet_mixup.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":"089ad7abb07fff34","code_sha256_prefix":"089ad7abb07fff34","mcp_get_code":{"code_sha256":"089ad7abb07fff34"}},{"arxiv_id":"1908.04742","arxiv_id_is_arxiv":true,"paper":"/paper/online-continual-learning-with-maximally","title":"Online Continual Learning with Maximally Interfered Retrieval","date":"2019-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optimass/Maximally_Interfered_Retrieval","path":"utils.py","file_url":"https://github.com/optimass/Maximally_Interfered_Retrieval/blob/HEAD/utils.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":"651082fb231f9a1d","code_sha256_prefix":"651082fb231f9a1d","mcp_get_code":{"code_sha256":"651082fb231f9a1d"}},{"arxiv_id":"1906.09602","arxiv_id_is_arxiv":true,"paper":"/paper/ego-cnn-distributed-egocentric","title":"Ego-CNN: Distributed, Egocentric Representations of Graphs for Detecting Critical Structures","date":"2019-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rutzeng/EgoCNN","path":"run-visualization-model.py","file_url":"https://github.com/rutzeng/EgoCNN/blob/HEAD/run-visualization-model.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":"b3b322eaeebe7bee","code_sha256_prefix":"b3b322eaeebe7bee","mcp_get_code":{"code_sha256":"b3b322eaeebe7bee"}},{"arxiv_id":"1906.08935","arxiv_id_is_arxiv":true,"paper":"/paper/deep-leakage-from-gradients","title":"Deep Leakage from Gradients","date":"2019-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FaisalAhmed0/Deep-Leakage-from-Gradients","path":"src/utils.py","file_url":"https://github.com/FaisalAhmed0/Deep-Leakage-from-Gradients/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, FaisalAhmed0/Deep-Leakage-from-Gradients when it was checked","code_sha256":"076a7c8d2aedc9a6","code_sha256_prefix":"076a7c8d2aedc9a6","mcp_get_code":{"code_sha256":"076a7c8d2aedc9a6"}},{"arxiv_id":"1906.08862","arxiv_id_is_arxiv":true,"paper":"/paper/neural-stored-program-memory","title":"Neural Stored-program Memory","date":"2019-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thaihungle/NSM","path":"util.py","file_url":"https://github.com/thaihungle/NSM/blob/HEAD/util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0584c5b4ca70059","code_sha256_prefix":"b0584c5b4ca70059","mcp_get_code":{"code_sha256":"b0584c5b4ca70059"}},{"arxiv_id":"1905.04899","arxiv_id_is_arxiv":true,"paper":"/paper/cutmix-regularization-strategy-to-train","title":"CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Features","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ildoonet/cutmix","path":"cutmix/cutmix.py","file_url":"https://github.com/ildoonet/cutmix/blob/HEAD/cutmix/cutmix.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a2847ea5f23c1e07","code_sha256_prefix":"a2847ea5f23c1e07","mcp_get_code":{"code_sha256":"a2847ea5f23c1e07"}},{"arxiv_id":"1901.01347","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-remember-more-with-less","title":"Learning to Remember More with Less Memorization","date":"2019-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thaihungle/UW-DNC","path":"synthetic_task.py","file_url":"https://github.com/thaihungle/UW-DNC/blob/HEAD/synthetic_task.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0584c5b4ca70059","code_sha256_prefix":"b0584c5b4ca70059","mcp_get_code":{"code_sha256":"b0584c5b4ca70059"}},{"arxiv_id":"1806.06498","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-affordance-learning-for-driving","title":"Conditional Affordance Learning for Driving in Urban Environments","date":"2018-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl-sr/CAL","path":"training/dataloader.py","file_url":"https://github.com/xl-sr/CAL/blob/HEAD/training/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":"d78dd6853a27485d","code_sha256_prefix":"d78dd6853a27485d","mcp_get_code":{"code_sha256":"d78dd6853a27485d"}},{"arxiv_id":"1710.09412","arxiv_id_is_arxiv":true,"paper":"/paper/mixup-beyond-empirical-risk-minimization","title":"mixup: Beyond Empirical Risk Minimization","date":"2017-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tugstugi/pytorch-speech-commands","path":"mixup.py","file_url":"https://github.com/tugstugi/pytorch-speech-commands/blob/HEAD/mixup.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, tugstugi/pytorch-speech-commands when it was checked","code_sha256":"bc878657aee7b3c0","code_sha256_prefix":"bc878657aee7b3c0","mcp_get_code":{"code_sha256":"bc878657aee7b3c0"}},{"arxiv_id":"1605.05775","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-with-quantum-inspired","title":"Supervised Learning with Quantum-Inspired Tensor Networks","date":"2016-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jemisjoky/torchmps","path":"torchmps/utils.py","file_url":"https://github.com/jemisjoky/torchmps/blob/HEAD/torchmps/utils.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":"d22a951c7ff816cf","code_sha256_prefix":"d22a951c7ff816cf","mcp_get_code":{"code_sha256":"d22a951c7ff816cf"}},{"arxiv_id":"aaai_28395","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28395","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yanzq95/SGNet","path":"thops.py","file_url":"https://github.com/yanzq95/SGNet/blob/HEAD/thops.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from alexhe101/pan-mamba, and GitHub detected no licence in that repository when it was checked","code_sha256":"7e39df9fabd27462","code_sha256_prefix":"7e39df9fabd27462","mcp_get_code":{"code_sha256":"7e39df9fabd27462"}},{"arxiv_id":"aaai_19971","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_19971","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"adeline-cs/GTR","path":"GTR-plug/GTR-ABINet/utils.py","file_url":"https://github.com/adeline-cs/GTR/blob/HEAD/GTR-plug/GTR-ABINet/utils.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":"f77642c52ab7ea6c","code_sha256_prefix":"f77642c52ab7ea6c","mcp_get_code":{"code_sha256":"f77642c52ab7ea6c"}}],"record_sha256":"805df3322a392933f138635a0cb6c95fadf08499fbd692d1f651d974c7911383","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}