{"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/split-dataset","entry":"split_dataset","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":65,"n_papers_ran":58,"n_papers_ran_no_instrument_failure":38,"n_papers_ran_instrument_only":20,"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":55,"n_samples_ran":47,"n_samples_constructed":0,"n_samples_ran_checked":33,"n_samples_instrument":14,"n_samples_unverified":8,"n_samples_fingerprinted":3,"n_places":69,"n_places_pointer_only":15,"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":13,"ran_fixture":1,"ran":33,"unverified":8},"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":"2605.16372","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16372","title":"SWORDBENCH: Evaluating Orthogonality of Steering Image Representations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Weixin-Liang/MetaShift","path":"experiments/distribution_shift/misc.py","file_url":"https://github.com/Weixin-Liang/MetaShift/blob/HEAD/experiments/distribution_shift/misc.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":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2605.08863","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08863","title":"Max-pooling Network Revisited: Analyzing the Role of Semantic Probability in Multiple Instance Learning for Hallucination Detection","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FUJI1229/Hallucination_Detection","path":"gen/generation/uncertainty/utils/utils.py","file_url":"https://github.com/FUJI1229/Hallucination_Detection/blob/HEAD/gen/generation/uncertainty/utils/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":"eb7cd0b37505f35f","code_sha256_prefix":"eb7cd0b37505f35f","mcp_get_code":{"code_sha256":"eb7cd0b37505f35f"}},{"arxiv_id":"2604.09922","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-09922","title":"K-STEMIT: Knowledge-Informed Spatio-Temporal Efficient Multi-Branch Graph Neural Network for Subsurface Stratigraphy Thickness Estimation from Radar Data","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"BinaLab/K-STEMIT","path":"utils.py","file_url":"https://github.com/BinaLab/K-STEMIT/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":"16f5a086720fabd8","code_sha256_prefix":"16f5a086720fabd8","mcp_get_code":{"code_sha256":"16f5a086720fabd8"}},{"arxiv_id":"2602.16967","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16967","title":"Early-Warning Signals of Grokking via Loss-Landscape Geometry","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"skydancerosel/dyck_scan","path":"dyck/grok_sweep.py","file_url":"https://github.com/skydancerosel/dyck_scan/blob/HEAD/dyck/grok_sweep.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, skydancerosel/dyck_scan when it was checked","code_sha256":"afca75c828f1fb23","code_sha256_prefix":"afca75c828f1fb23","mcp_get_code":{"code_sha256":"afca75c828f1fb23"}},{"arxiv_id":"2602.05786","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05786","title":"Selecting Hyperparameters for Tree-Boosting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"fl0risk/HPOTreeBoosting","path":"utils_modelling.py","file_url":"https://github.com/fl0risk/HPOTreeBoosting/blob/HEAD/utils_modelling.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, fl0risk/HPOTreeBoosting when it was checked","code_sha256":"ceac6415cc77626f","code_sha256_prefix":"ceac6415cc77626f","mcp_get_code":{"code_sha256":"ceac6415cc77626f"}},{"arxiv_id":"2504.19110","arxiv_id_is_arxiv":true,"paper":"/paper/ape-bench-i-towards-file-level-automated","title":"APE-Bench I: Towards File-level Automated Proof Engineering of Formal Math Libraries","date":"2025-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinhjBrant/APE-Bench","path":"src/datasets/ape_bench/split.py","file_url":"https://github.com/xinhjBrant/APE-Bench/blob/HEAD/src/datasets/ape_bench/split.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":"e01c17926244a2ec","code_sha256_prefix":"e01c17926244a2ec","mcp_get_code":{"code_sha256":"e01c17926244a2ec"}},{"arxiv_id":"2503.03519","arxiv_id_is_arxiv":true,"paper":"/paper/do-imagenet-trained-models-learn-shortcuts","title":"Do ImageNet-trained models learn shortcuts? The impact of frequency shortcuts on generalization","date":"2025-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nis-research/hfss","path":"hfss/LSI.py","file_url":"https://github.com/nis-research/hfss/blob/HEAD/hfss/LSI.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":"5f913213824f631e","code_sha256_prefix":"5f913213824f631e","mcp_get_code":{"code_sha256":"5f913213824f631e"}},{"arxiv_id":"2502.19805","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-search-via-discrete-diffusion-a","title":"Implicit Search via Discrete Diffusion: A Study on Chess","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/DiffuSearch","path":"src/llmtuner/dsets/utils.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/dsets/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":"1c0a502523d29b60","code_sha256_prefix":"1c0a502523d29b60","mcp_get_code":{"code_sha256":"1c0a502523d29b60"}},{"arxiv_id":"2502.16894","arxiv_id_is_arxiv":true,"paper":"/paper/make-lora-great-again-boosting-lora-with","title":"Make LoRA Great Again: Boosting LoRA with Adaptive Singular Values and Mixture-of-Experts Optimization Alignment","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facico/goat-peft","path":"goat/train_nlg.py","file_url":"https://github.com/facico/goat-peft/blob/HEAD/goat/train_nlg.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":"7450a473b4f17f71","code_sha256_prefix":"7450a473b4f17f71","mcp_get_code":{"code_sha256":"7450a473b4f17f71"}},{"arxiv_id":"2502.16894","arxiv_id_is_arxiv":true,"paper":"/paper/make-lora-great-again-boosting-lora-with","title":"Make LoRA Great Again: Boosting LoRA with Adaptive Singular Values and Mixture-of-Experts Optimization Alignment","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facico/goat-peft","path":"goat/train_vit.py","file_url":"https://github.com/facico/goat-peft/blob/HEAD/goat/train_vit.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":"7d02e789de7329ec","code_sha256_prefix":"7d02e789de7329ec","mcp_get_code":{"code_sha256":"7d02e789de7329ec"}},{"arxiv_id":"2410.14157","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-autoregression-discrete-diffusion-for","title":"Beyond Autoregression: Discrete Diffusion for Complex Reasoning and Planning","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/diffusion-vs-ar","path":"src/llmtuner/dsets/utils.py","file_url":"https://github.com/HKUNLP/diffusion-vs-ar/blob/HEAD/src/llmtuner/dsets/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":"1c0a502523d29b60","code_sha256_prefix":"1c0a502523d29b60","mcp_get_code":{"code_sha256":"1c0a502523d29b60"}},{"arxiv_id":"2410.03968","arxiv_id_is_arxiv":true,"paper":"/paper/decoding-game-on-minimax-optimality-of","title":"Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omar-hagrass/decoding-game","path":"src/utils.py","file_url":"https://github.com/omar-hagrass/decoding-game/blob/HEAD/src/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, omar-hagrass/decoding-game when it was checked","code_sha256":"7a47a92a0aa77a70","code_sha256_prefix":"7a47a92a0aa77a70","mcp_get_code":{"code_sha256":"7a47a92a0aa77a70"}},{"arxiv_id":"2406.15927","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-entropy-probes-robust-and-cheap","title":"Semantic Entropy Probes: Robust and Cheap Hallucination Detection in LLMs","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oatml/semantic-entropy-probes","path":"semantic_uncertainty/uncertainty/utils/utils.py","file_url":"https://github.com/oatml/semantic-entropy-probes/blob/HEAD/semantic_uncertainty/uncertainty/utils/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":"eb7cd0b37505f35f","code_sha256_prefix":"eb7cd0b37505f35f","mcp_get_code":{"code_sha256":"eb7cd0b37505f35f"}},{"arxiv_id":"2406.14794","arxiv_id_is_arxiv":true,"paper":"/paper/imageflownet-forecasting-multiscale","title":"ImageFlowNet: Forecasting Multiscale Image-Level Trajectories of Disease Progression with Irregularly-Sampled Longitudinal Medical Images","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenLiu-1996/ImageFlowNet","path":"src/data_utils/split.py","file_url":"https://github.com/ChenLiu-1996/ImageFlowNet/blob/HEAD/src/data_utils/split.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, ChenLiu-1996/ImageFlowNet (NOASSERTION)","code_sha256":"7c531ebf9174deef","code_sha256_prefix":"7c531ebf9174deef","mcp_get_code":{"code_sha256":"7c531ebf9174deef"}},{"arxiv_id":"2406.09714","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-model-validity-via-enhanced","title":"Large language model validity via enhanced conformal prediction methods","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjcherian/conditional-conformal","path":"conditionalconformal/experiment_utils.py","file_url":"https://github.com/jjcherian/conditional-conformal/blob/HEAD/conditionalconformal/experiment_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":"4fe1f68fa8d32424","code_sha256_prefix":"4fe1f68fa8d32424","mcp_get_code":{"code_sha256":"4fe1f68fa8d32424"}},{"arxiv_id":"2406.04845","arxiv_id_is_arxiv":true,"paper":"/paper/fedllm-bench-realistic-benchmarks-for","title":"FedLLM-Bench: Realistic Benchmarks for Federated Learning of Large Language Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rui-ye/openfedllm","path":"federated_learning/split_dataset.py","file_url":"https://github.com/rui-ye/openfedllm/blob/HEAD/federated_learning/split_dataset.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":"60c6c78eb9667d17","code_sha256_prefix":"60c6c78eb9667d17","mcp_get_code":{"code_sha256":"60c6c78eb9667d17"}},{"arxiv_id":"2405.15243","arxiv_id_is_arxiv":true,"paper":"/paper/less-is-more-discovering-concise-network","title":"Less is More: Discovering Concise Network Explanations","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkondapa/discoveringconcisenetworkexplanations","path":"datasets/utils.py","file_url":"https://github.com/nkondapa/discoveringconcisenetworkexplanations/blob/HEAD/datasets/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, nkondapa/discoveringconcisenetworkexplanations when it was checked","code_sha256":"eea6a3838d6871ef","code_sha256_prefix":"eea6a3838d6871ef","mcp_get_code":{"code_sha256":"eea6a3838d6871ef"}},{"arxiv_id":"2405.05349","arxiv_id_is_arxiv":true,"paper":"/paper/offline-model-based-optimization-via-policy","title":"Offline Model-Based Optimization via Policy-Guided Gradient Search","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yassineCh/PGS","path":"surrogate.py","file_url":"https://github.com/yassineCh/PGS/blob/HEAD/surrogate.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, yassineCh/PGS when it was checked","code_sha256":"45a7574afd665891","code_sha256_prefix":"45a7574afd665891","mcp_get_code":{"code_sha256":"45a7574afd665891"}},{"arxiv_id":"2404.18905","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-critical-treatment-effect-bias-in","title":"Detecting critical treatment effect bias in small subgroups","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaabmar/kernel-test-bias","path":"src/datasets/hillstrom.py","file_url":"https://github.com/jaabmar/kernel-test-bias/blob/HEAD/src/datasets/hillstrom.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":"f7d83fb9da13d37e","code_sha256_prefix":"f7d83fb9da13d37e","mcp_get_code":{"code_sha256":"f7d83fb9da13d37e"}},{"arxiv_id":"2404.12545","arxiv_id_is_arxiv":true,"paper":"/paper/latent-concept-based-explanation-of-nlp","title":"Latent Concept-based Explanation of NLP Models","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuemin-yu/eraser_movie_latentconcept","path":"src/classifier_mapping/split_dataset.py","file_url":"https://github.com/xuemin-yu/eraser_movie_latentconcept/blob/HEAD/src/classifier_mapping/split_dataset.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, xuemin-yu/eraser_movie_latentconcept when it was checked","code_sha256":"eb96f8c05768ff87","code_sha256_prefix":"eb96f8c05768ff87","mcp_get_code":{"code_sha256":"eb96f8c05768ff87"}},{"arxiv_id":"2404.11536","arxiv_id_is_arxiv":true,"paper":"/paper/fedpft-federated-proxy-fine-tuning-of","title":"FedPFT: Federated Proxy Fine-Tuning of Foundation Models","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pzp-dzd/fedpft","path":"federated_proxy_finetuning/fedtune.py","file_url":"https://github.com/pzp-dzd/fedpft/blob/HEAD/federated_proxy_finetuning/fedtune.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, pzp-dzd/fedpft when it was checked","code_sha256":"76a78d956291b265","code_sha256_prefix":"76a78d956291b265","mcp_get_code":{"code_sha256":"76a78d956291b265"}},{"arxiv_id":"2312.02554","arxiv_id_is_arxiv":true,"paper":"/paper/ulma-unified-language-model-alignment-with","title":"ULMA: Unified Language Model Alignment with Human Demonstration and Point-wise Preference","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unified-language-model-alignment/src","path":"src/llmtuner/dsets/utils.py","file_url":"https://github.com/unified-language-model-alignment/src/blob/HEAD/src/llmtuner/dsets/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":"fa0e41311e2cae40","code_sha256_prefix":"fa0e41311e2cae40","mcp_get_code":{"code_sha256":"fa0e41311e2cae40"}},{"arxiv_id":"2311.13246","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-instruction-optimization-for-open","title":"CoachLM: Automatic Instruction Revisions Improve the Data Quality in LLM Instruction Tuning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lunyiliu/coachlm","path":"src/glmtuner/dsets/utils.py","file_url":"https://github.com/lunyiliu/coachlm/blob/HEAD/src/glmtuner/dsets/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":"7e79046cf1a9ca3f","code_sha256_prefix":"7e79046cf1a9ca3f","mcp_get_code":{"code_sha256":"7e79046cf1a9ca3f"}},{"arxiv_id":"2310.13026","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-semantic-segmentation-with-2","title":"Weakly-Supervised Semantic Segmentation with Image-Level Labels: from Traditional Models to Foundation Models","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaozhengchen/sam_wsss","path":"sam_text_input_coco.py","file_url":"https://github.com/zhaozhengchen/sam_wsss/blob/HEAD/sam_text_input_coco.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"198c3be080d6e91e","code_sha256_prefix":"198c3be080d6e91e","mcp_get_code":{"code_sha256":"198c3be080d6e91e"}},{"arxiv_id":"2308.04431","arxiv_id_is_arxiv":true,"paper":"/paper/when-more-is-less-incorporating-additional","title":"When More is Less: Incorporating Additional Datasets Can Hurt Performance By Introducing Spurious Correlations","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basedrhys/ood-generalization","path":"clinicaldg/lib/misc.py","file_url":"https://github.com/basedrhys/ood-generalization/blob/HEAD/clinicaldg/lib/misc.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, basedrhys/ood-generalization when it was checked","code_sha256":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2307.08187","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-investigation-of-pre-trained-1","title":"An Empirical Study of Pre-trained Model Selection for Out-of-Distribution Generalization and Calibration","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiroki11x/timm_ood_calibration","path":"domainbed/lib/misc.py","file_url":"https://github.com/hiroki11x/timm_ood_calibration/blob/HEAD/domainbed/lib/misc.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":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2306.06482","arxiv_id_is_arxiv":true,"paper":"/paper/tensornet-cartesian-tensor-representations","title":"TensorNet: Cartesian Tensor Representations for Efficient Learning of Molecular Potentials","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"materialsvirtuallab/matgl","path":"src/matgl/graph/data.py","file_url":"https://github.com/materialsvirtuallab/matgl/blob/HEAD/src/matgl/graph/data.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":"f8f4216e12bc9e70","code_sha256_prefix":"f8f4216e12bc9e70","mcp_get_code":{"code_sha256":"f8f4216e12bc9e70"}},{"arxiv_id":"2305.18290","arxiv_id_is_arxiv":true,"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":"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":"bdad0f787751d773","code_sha256_prefix":"bdad0f787751d773","mcp_get_code":{"code_sha256":"bdad0f787751d773"}},{"arxiv_id":"2304.08247","arxiv_id_is_arxiv":true,"paper":"/paper/medalpaca-an-open-source-collection-of","title":"MedAlpaca -- An Open-Source Collection of Medical Conversational AI Models and Training Data","date":"2023-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuneinsight/federated-llms","path":"OpenFedLLM/federated_learning/split_dataset.py","file_url":"https://github.com/tuneinsight/federated-llms/blob/HEAD/OpenFedLLM/federated_learning/split_dataset.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":"60c6c78eb9667d17","code_sha256_prefix":"60c6c78eb9667d17","mcp_get_code":{"code_sha256":"60c6c78eb9667d17"}},{"arxiv_id":"2304.04169","arxiv_id_is_arxiv":true,"paper":"/paper/slowcal-sgd-slow-query-points-improve-local","title":"SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization","date":"2023-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dahan198/slowcal-sgd","path":"slowcal_sgd/utils.py","file_url":"https://github.com/dahan198/slowcal-sgd/blob/HEAD/slowcal_sgd/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":"dd69f8e805a3016c","code_sha256_prefix":"dd69f8e805a3016c","mcp_get_code":{"code_sha256":"dd69f8e805a3016c"}},{"arxiv_id":"2303.14535","arxiv_id_is_arxiv":true,"paper":"/paper/efficientad-accurate-visual-anomaly-detection","title":"EfficientAD: Accurate Visual Anomaly Detection at Millisecond-Level Latencies","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeapMind/PUAD","path":"puad/dataset.py","file_url":"https://github.com/LeapMind/PUAD/blob/HEAD/puad/dataset.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":"079e540378c4e38e","code_sha256_prefix":"079e540378c4e38e","mcp_get_code":{"code_sha256":"079e540378c4e38e"}},{"arxiv_id":"2212.09506","arxiv_id_is_arxiv":true,"paper":"/paper/clip-is-also-an-efficient-segmenter-a-text","title":"CLIP is Also an Efficient Segmenter: A Text-Driven Approach for Weakly Supervised Semantic Segmentation","date":"2022-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linyq2117/clip-es","path":"generate_cams_voc12.py","file_url":"https://github.com/linyq2117/clip-es/blob/HEAD/generate_cams_voc12.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"198c3be080d6e91e","code_sha256_prefix":"198c3be080d6e91e","mcp_get_code":{"code_sha256":"198c3be080d6e91e"}},{"arxiv_id":"2212.04902","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-ppg-representation-learning","title":"Self-Supervised PPG Representation Learning Shows High Inter-Subject Variability","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Raminghorbanii/Self-Supervised-PPG-Representation-Learning-Shows-High-Inter-Subject-Variability","path":"Downstream_Task/Downstream_DataProcess.py","file_url":"https://github.com/Raminghorbanii/Self-Supervised-PPG-Representation-Learning-Shows-High-Inter-Subject-Variability/blob/HEAD/Downstream_Task/Downstream_DataProcess.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":"d3357ead0ebbce02","code_sha256_prefix":"d3357ead0ebbce02","mcp_get_code":{"code_sha256":"d3357ead0ebbce02"}},{"arxiv_id":"2212.04902","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-ppg-representation-learning","title":"Self-Supervised PPG Representation Learning Shows High Inter-Subject Variability","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Raminghorbanii/Self-Supervised-PPG-Representation-Learning-Shows-High-Inter-Subject-Variability","path":"Pretext_Task/Pretext_DataProcess.py","file_url":"https://github.com/Raminghorbanii/Self-Supervised-PPG-Representation-Learning-Shows-High-Inter-Subject-Variability/blob/HEAD/Pretext_Task/Pretext_DataProcess.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":"45ea7baa349b9cdb","code_sha256_prefix":"45ea7baa349b9cdb","mcp_get_code":{"code_sha256":"45ea7baa349b9cdb"}},{"arxiv_id":"2210.12651","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-non-transferable-text","title":"Unsupervised Non-transferable Text Classification","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoscodes/untl","path":"UNTL.py","file_url":"https://github.com/chaoscodes/untl/blob/HEAD/UNTL.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":"302c4a6e825f2744","code_sha256_prefix":"302c4a6e825f2744","mcp_get_code":{"code_sha256":"302c4a6e825f2744"}},{"arxiv_id":"2207.10792","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-via-self-training-with","title":"Test-Time Adaptation via Self-Training with Nearest Neighbor Information","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingukjang/tast","path":"domainbed/lib/misc.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/lib/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mingukjang/tast, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2207.09455","arxiv_id_is_arxiv":true,"paper":"/paper/to-update-or-not-to-update-neurons-at","title":"To update or not to update? Neurons at equilibrium in deep models","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eidoslab/neq","path":"src/general_utils.py","file_url":"https://github.com/eidoslab/neq/blob/HEAD/src/general_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":"57dd477e8805987e","code_sha256_prefix":"57dd477e8805987e","mcp_get_code":{"code_sha256":"57dd477e8805987e"}},{"arxiv_id":"2206.10540","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-symbolic-regression-datasets-and","title":"Rethinking Symbolic Regression Datasets and Benchmarks for Scientific Discovery","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omron-sinicx/srsd-benchmark","path":"dataset_generator.py","file_url":"https://github.com/omron-sinicx/srsd-benchmark/blob/HEAD/dataset_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3413352810b18638","code_sha256_prefix":"3413352810b18638","mcp_get_code":{"code_sha256":"3413352810b18638"}},{"arxiv_id":"2205.13094","arxiv_id_is_arxiv":true,"paper":"/paper/undersampling-is-a-minimax-optimal-robustness","title":"Undersampling is a Minimax Optimal Robustness Intervention in Nonparametric Classification","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niladri-chatterji/undersampling-minimax","path":"src/datasets/utils.py","file_url":"https://github.com/niladri-chatterji/undersampling-minimax/blob/HEAD/src/datasets/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":"47d36c87f2335145","code_sha256_prefix":"47d36c87f2335145","mcp_get_code":{"code_sha256":"47d36c87f2335145"}},{"arxiv_id":"2205.08619","arxiv_id_is_arxiv":true,"paper":"/paper/a-graph-representation-of-molecular-ensembles","title":"A graph representation of molecular ensembles for polymer property prediction","date":"2022-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coleygroup/polymer-chemprop-data","path":"results/vipea/data-efficiency/rf/run_all_evaluations.py","file_url":"https://github.com/coleygroup/polymer-chemprop-data/blob/HEAD/results/vipea/data-efficiency/rf/run_all_evaluations.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":"a5601195db12c53d","code_sha256_prefix":"a5601195db12c53d","mcp_get_code":{"code_sha256":"a5601195db12c53d"}},{"arxiv_id":"2203.00962","arxiv_id_is_arxiv":true,"paper":"/paper/class-re-activation-maps-for-weakly","title":"Class Re-Activation Maps for Weakly-Supervised Semantic Segmentation","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaozhengChen/ReCAM","path":"step/make_recam.py","file_url":"https://github.com/zhaozhengChen/ReCAM/blob/HEAD/step/make_recam.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, zhaozhengChen/ReCAM when it was checked","code_sha256":"b86a17571429fc45","code_sha256_prefix":"b86a17571429fc45","mcp_get_code":{"code_sha256":"b86a17571429fc45"}},{"arxiv_id":"2112.12986","arxiv_id_is_arxiv":true,"paper":"/paper/is-importance-weighting-incompatible-with-1","title":"Is Importance Weighting Incompatible with Interpolating Classifiers?","date":"2021-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keawang/importance-weighting-interpolating-classifiers","path":"src/datasets/utils.py","file_url":"https://github.com/keawang/importance-weighting-interpolating-classifiers/blob/HEAD/src/datasets/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":"47d36c87f2335145","code_sha256_prefix":"47d36c87f2335145","mcp_get_code":{"code_sha256":"47d36c87f2335145"}},{"arxiv_id":"2111.12853","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shogi880/DPLCLIP","path":"domainbed/lib/misc.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/lib/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, shogi880/DPLCLIP, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2110.08220","arxiv_id_is_arxiv":true,"paper":"/paper/combining-diverse-feature-priors-1","title":"Combining Diverse Feature Priors","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MadryLab/copriors","path":"datasets/datasets.py","file_url":"https://github.com/MadryLab/copriors/blob/HEAD/datasets/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":"fba38ca89627329d","code_sha256_prefix":"fba38ca89627329d","mcp_get_code":{"code_sha256":"fba38ca89627329d"}},{"arxiv_id":"2110.03804","arxiv_id_is_arxiv":true,"paper":"/paper/focus-familiar-objects-in-common-and-uncommon","title":"FOCUS: Familiar Objects in Common and Uncommon Settings","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"priyathamkat/focus","path":"src/experiments/dataset.py","file_url":"https://github.com/priyathamkat/focus/blob/HEAD/src/experiments/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, priyathamkat/focus (NOASSERTION)","code_sha256":"4ec8689e6e353fb4","code_sha256_prefix":"4ec8689e6e353fb4","mcp_get_code":{"code_sha256":"4ec8689e6e353fb4"}},{"arxiv_id":"2108.12510","arxiv_id_is_arxiv":true,"paper":"/paper/pulling-up-by-the-causal-bootstraps-causal","title":"Pulling Up by the Causal Bootstraps: Causal Data Augmentation for Pre-training Debiasing","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MLforHealth/CausalDA","path":"train_env.py","file_url":"https://github.com/MLforHealth/CausalDA/blob/HEAD/train_env.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":"5c0450ec429262a9","code_sha256_prefix":"5c0450ec429262a9","mcp_get_code":{"code_sha256":"5c0450ec429262a9"}},{"arxiv_id":"2108.03852","arxiv_id_is_arxiv":true,"paper":"/paper/complementary-patch-for-weakly-supervised","title":"Complementary Patch for Weakly Supervised Semantic Segmentation","date":"2021-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ferenas/CPN","path":"misc/torchutils.py","file_url":"https://github.com/Ferenas/CPN/blob/HEAD/misc/torchutils.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":"8129bde610e5350b","code_sha256_prefix":"8129bde610e5350b","mcp_get_code":{"code_sha256":"8129bde610e5350b"}},{"arxiv_id":"2108.00316","arxiv_id_is_arxiv":true,"paper":"/paper/chest-imagenome-dataset-for-clinical","title":"Chest ImaGenome Dataset for Clinical Reasoning","date":"2021-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LourentzouTBD/ChestImaGenomeChangeDetection","path":"data.py","file_url":"https://github.com/LourentzouTBD/ChestImaGenomeChangeDetection/blob/HEAD/data.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":"a0d52457fbfb9ccc","code_sha256_prefix":"a0d52457fbfb9ccc","mcp_get_code":{"code_sha256":"a0d52457fbfb9ccc"}},{"arxiv_id":"2107.07432","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-neural-nets-can-capture","title":"Hierarchical graph neural nets can capture long-range interactions","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rampasek/HGNet","path":"dataset.py","file_url":"https://github.com/rampasek/HGNet/blob/HEAD/dataset.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":"624a91da04cd5dce","code_sha256_prefix":"624a91da04cd5dce","mcp_get_code":{"code_sha256":"624a91da04cd5dce"}},{"arxiv_id":"2106.13219","arxiv_id_is_arxiv":true,"paper":"/paper/towards-understanding-and-mitigating-social","title":"Towards Understanding and Mitigating Social Biases in Language Models","date":"2021-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/LM_bias","path":"src/data_preprocess/context_nullspace_projection.py","file_url":"https://github.com/pliang279/LM_bias/blob/HEAD/src/data_preprocess/context_nullspace_projection.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":"992ba37e8f011975","code_sha256_prefix":"992ba37e8f011975","mcp_get_code":{"code_sha256":"992ba37e8f011975"}},{"arxiv_id":"2106.02266","arxiv_id_is_arxiv":true,"paper":"/paper/sand-mask-an-enhanced-gradient-masking","title":"SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalization","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahtalebi/SAND-mask","path":"domainbed/lib/misc.py","file_url":"https://github.com/shahtalebi/SAND-mask/blob/HEAD/domainbed/lib/misc.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":"18e820e42046bc45","code_sha256_prefix":"18e820e42046bc45","mcp_get_code":{"code_sha256":"18e820e42046bc45"}},{"arxiv_id":"2106.01440","arxiv_id_is_arxiv":true,"paper":"/paper/memory-wrap-a-data-efficient-and","title":"Memory Wrap: a Data-Efficient and Interpretable Extension to Image Classification Models","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KRLGroup/memory-wrap","path":"paper/VIT/train_memory_vit.py","file_url":"https://github.com/KRLGroup/memory-wrap/blob/HEAD/paper/VIT/train_memory_vit.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":"396cfa296f2b6833","code_sha256_prefix":"396cfa296f2b6833","mcp_get_code":{"code_sha256":"396cfa296f2b6833"}},{"arxiv_id":"2105.05537","arxiv_id_is_arxiv":true,"paper":"/paper/swin-unet-unet-like-pure-transformer-for","title":"Swin-Unet: Unet-like Pure Transformer for Medical Image Segmentation","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"L-A-Sandhu/Swin-Unet-","path":"src/swin_transformer/split_data.py","file_url":"https://github.com/L-A-Sandhu/Swin-Unet-/blob/HEAD/src/swin_transformer/split_data.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":"17f6210c3a9f9f5b","code_sha256_prefix":"17f6210c3a9f9f5b","mcp_get_code":{"code_sha256":"17f6210c3a9f9f5b"}},{"arxiv_id":"2104.03017","arxiv_id_is_arxiv":true,"paper":"/paper/utilizing-self-supervised-representations-for","title":"Utilizing Self-supervised Representations for MOS Prediction","date":"2021-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andi611/Self-Supervised-Speech-Pretraining-and-Representation-Learning","path":"s3prl/downstream/speech_commands/expert.py","file_url":"https://github.com/andi611/Self-Supervised-Speech-Pretraining-and-Representation-Learning/blob/HEAD/s3prl/downstream/speech_commands/expert.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":"9ea710404e13fb0a","code_sha256_prefix":"9ea710404e13fb0a","mcp_get_code":{"code_sha256":"9ea710404e13fb0a"}},{"arxiv_id":"2010.02803","arxiv_id_is_arxiv":true,"paper":"/paper/a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gzerveas/mvts_transformer","path":"src/datasets/datasplit.py","file_url":"https://github.com/gzerveas/mvts_transformer/blob/HEAD/src/datasets/datasplit.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":"761d7abb12b095eb","code_sha256_prefix":"761d7abb12b095eb","mcp_get_code":{"code_sha256":"761d7abb12b095eb"}},{"arxiv_id":"2010.02415","arxiv_id_is_arxiv":true,"paper":"/paper/data-driven-learning-of-geometric-scattering-1","title":"Data-Driven Learning of Geometric Scattering Networks","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KrishnaswamyLab/LearnableScattering","path":"models/LEGS.py","file_url":"https://github.com/KrishnaswamyLab/LearnableScattering/blob/HEAD/models/LEGS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, KrishnaswamyLab/LearnableScattering (NOASSERTION)","code_sha256":"80f9aa4f45b145ba","code_sha256_prefix":"80f9aa4f45b145ba","mcp_get_code":{"code_sha256":"80f9aa4f45b145ba"}},{"arxiv_id":"2007.09670","arxiv_id_is_arxiv":true,"paper":"/paper/prediction-intervals-split-normal-mixture","title":"Prediction Intervals: Split Normal Mixture from Quality-Driven Deep Ensembles","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tarik/pi-snm-qde","path":"neural_pi/data.py","file_url":"https://github.com/tarik/pi-snm-qde/blob/HEAD/neural_pi/data.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":"e8c91903039fbbbd","code_sha256_prefix":"e8c91903039fbbbd","mcp_get_code":{"code_sha256":"e8c91903039fbbbd"}},{"arxiv_id":"2006.10503","arxiv_id_is_arxiv":true,"paper":"/paper/se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trachote/predict_elastic_tensor","path":"utils/datamodule.py","file_url":"https://github.com/trachote/predict_elastic_tensor/blob/HEAD/utils/datamodule.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":"d7a94dcfe704c989","code_sha256_prefix":"d7a94dcfe704c989","mcp_get_code":{"code_sha256":"d7a94dcfe704c989"}},{"arxiv_id":"1906.02717","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-gradient-based-meta-learning-methods","title":"Adaptive Gradient-Based Meta-Learning Methods","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mkhodak/ARUBA","path":"reptile/supervised_reptile/omniglot.py","file_url":"https://github.com/mkhodak/ARUBA/blob/HEAD/reptile/supervised_reptile/omniglot.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":"60258f666e8cd77e","code_sha256_prefix":"60258f666e8cd77e","mcp_get_code":{"code_sha256":"60258f666e8cd77e"}},{"arxiv_id":"1906.02174","arxiv_id_is_arxiv":true,"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PwnerHarry/Stronger_GCN","path":"PyTorch/utils.py","file_url":"https://github.com/PwnerHarry/Stronger_GCN/blob/HEAD/PyTorch/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":"dc4505e1479e9db1","code_sha256_prefix":"dc4505e1479e9db1","mcp_get_code":{"code_sha256":"dc4505e1479e9db1"}},{"arxiv_id":"1906.02174","arxiv_id_is_arxiv":true,"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PwnerHarry/Stronger_GCN","path":"TF2/utils.py","file_url":"https://github.com/PwnerHarry/Stronger_GCN/blob/HEAD/TF2/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":"9d66a089d3b2d75a","code_sha256_prefix":"9d66a089d3b2d75a","mcp_get_code":{"code_sha256":"9d66a089d3b2d75a"}},{"arxiv_id":"1905.11874","arxiv_id_is_arxiv":true,"paper":"/paper/autonomous-skill-discovery-with-quality","title":"Autonomous skill discovery with Quality-Diversity and Unsupervised Descriptors","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyzarok/MScProject_AURORA_with_RNN","path":"BallisticMyVer/control.py","file_url":"https://github.com/Kyzarok/MScProject_AURORA_with_RNN/blob/HEAD/BallisticMyVer/control.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Kyzarok/MScProject_AURORA_with_RNN when it was checked","code_sha256":"f84dd3a020f59e2d","code_sha256_prefix":"f84dd3a020f59e2d","mcp_get_code":{"code_sha256":"f84dd3a020f59e2d"}},{"arxiv_id":"1904.05044","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-learning-of-instance","title":"Weakly Supervised Learning of Instance Segmentation with Inter-pixel Relations","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwoon-ahn/irn","path":"misc/torchutils.py","file_url":"https://github.com/jiwoon-ahn/irn/blob/HEAD/misc/torchutils.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":"8129bde610e5350b","code_sha256_prefix":"8129bde610e5350b","mcp_get_code":{"code_sha256":"8129bde610e5350b"}},{"arxiv_id":"ijcai2025_0850","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0850","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hongyi-Lyu-MQ/SULI","path":"utils/data_utils.py","file_url":"https://github.com/Hongyi-Lyu-MQ/SULI/blob/HEAD/utils/data_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":"682ebc14011b7dc8","code_sha256_prefix":"682ebc14011b7dc8","mcp_get_code":{"code_sha256":"682ebc14011b7dc8"}},{"arxiv_id":"aaai_28139","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28139","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linyq2117/TagCLIP","path":"CLIP-ES/generate_cams_coco.py","file_url":"https://github.com/linyq2117/TagCLIP/blob/HEAD/CLIP-ES/generate_cams_coco.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":"454b870026132c11","code_sha256_prefix":"454b870026132c11","mcp_get_code":{"code_sha256":"454b870026132c11"}},{"arxiv_id":"aaai_20108","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20108","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jieqin-ai/AMR","path":"misc/torchutils.py","file_url":"https://github.com/jieqin-ai/AMR/blob/HEAD/misc/torchutils.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":"8129bde610e5350b","code_sha256_prefix":"8129bde610e5350b","mcp_get_code":{"code_sha256":"8129bde610e5350b"}},{"arxiv_id":"Quetu_LaCoOT_Layer_Collapse_through_Optimal_Transport_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Quetu_LaCoOT_Layer_Collapse_through_Optimal_Transport_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VGCQ/LaCoOT","path":"dataloaders/utils.py","file_url":"https://github.com/VGCQ/LaCoOT/blob/HEAD/dataloaders/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":"bf8a250ffd6dbadb","code_sha256_prefix":"bf8a250ffd6dbadb","mcp_get_code":{"code_sha256":"bf8a250ffd6dbadb"}},{"arxiv_id":"Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linyq2117/CLIP-ES","path":"generate_cams_voc12.py","file_url":"https://github.com/linyq2117/CLIP-ES/blob/HEAD/generate_cams_voc12.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"198c3be080d6e91e","code_sha256_prefix":"198c3be080d6e91e","mcp_get_code":{"code_sha256":"198c3be080d6e91e"}},{"arxiv_id":"Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linyq2117/CLIP-ES","path":"generate_cams_coco14.py","file_url":"https://github.com/linyq2117/CLIP-ES/blob/HEAD/generate_cams_coco14.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":"454b870026132c11","code_sha256_prefix":"454b870026132c11","mcp_get_code":{"code_sha256":"454b870026132c11"}}],"record_sha256":"d8cc3bc17698a7f5511f778523d693b77cea7f03a989ef6ebb88753b2baa5ba0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}