{"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/load-labels","entry":"load_labels","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":29,"n_papers_ran":27,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":16,"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":25,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":11,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":30,"n_places_pointer_only":15,"n_places_pointer_only_link_open":3,"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":4,"ran_violates":1,"ran_draft_wrong":11,"ran_fixture":0,"ran":6,"unverified":3},"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":"2608.20134","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-20134","title":"Feature Evolution and Migration during Vision Transformer Training *","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"joonasrooben/VIT-Feature-Evolution-and-Migration","path":"src/concept_type_classifier.py","file_url":"https://github.com/joonasrooben/VIT-Feature-Evolution-and-Migration/blob/HEAD/src/concept_type_classifier.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joonasrooben/VIT-Feature-Evolution-and-Migration when it was checked","code_sha256":"6e7bd8b39066c021","code_sha256_prefix":"6e7bd8b39066c021","mcp_get_code":{"code_sha256":"6e7bd8b39066c021"}},{"arxiv_id":"2606.31179","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-31179","title":"HealthAgentBench: A Unified Benchmark Suite of Realistic Agentic Healthcare Environments for Challenging Frontier AI Agents","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"microsoft/HealthAgentBench","path":"tasks/ehr_event_modelling_new_acutemi/environment/stage_data.py","file_url":"https://github.com/microsoft/HealthAgentBench/blob/HEAD/tasks/ehr_event_modelling_new_acutemi/environment/stage_data.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":"a932353e852af481","code_sha256_prefix":"a932353e852af481","mcp_get_code":{"code_sha256":"a932353e852af481"}},{"arxiv_id":"2605.27311","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-27311","title":"CHARTOGRAPHER: Counterfactual Chart Generation for Evaluating Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"vis-nlp/ChartQA","path":"Models/VL-T5/inference/utils.py","file_url":"https://github.com/vis-nlp/ChartQA/blob/HEAD/Models/VL-T5/inference/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, vis-nlp/ChartQA, is not in the permissive set Syntology serves inline","code_sha256":"8a78a755bda274a5","code_sha256_prefix":"8a78a755bda274a5","mcp_get_code":{"code_sha256":"8a78a755bda274a5"}},{"arxiv_id":"2605.09760","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09760","title":"ConFit v3: Improving Resume-Job Matching with LLM-based Re-Ranking","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"jasonyux/ConFit-v3","path":"confit_v3/trainer/load_data.py","file_url":"https://github.com/jasonyux/ConFit-v3/blob/HEAD/confit_v3/trainer/load_data.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, jasonyux/ConFit-v3 when it was checked","code_sha256":"2e92fbbbde4dcc16","code_sha256_prefix":"2e92fbbbde4dcc16","mcp_get_code":{"code_sha256":"2e92fbbbde4dcc16"}},{"arxiv_id":"2605.06309","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-06309","title":"MultiLinguahah : A New Unsupervised Multilingual Acoustic Laughter Segmentation Method","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"sofia-callejas/Multilinguahah","path":"laughter_detection/core/utils.py","file_url":"https://github.com/sofia-callejas/Multilinguahah/blob/HEAD/laughter_detection/core/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sofia-callejas/Multilinguahah (NOASSERTION)","code_sha256":"54985ed275475940","code_sha256_prefix":"54985ed275475940","mcp_get_code":{"code_sha256":"54985ed275475940"}},{"arxiv_id":"2409.14939","arxiv_id_is_arxiv":true,"paper":"/paper/fastgl-a-gpu-efficient-framework-for","title":"FastGL: A GPU-Efficient Framework for Accelerating Sampling-Based GNN Training at Large Scale","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a1bc2def6g/fastgl-ae","path":"train_fastgl.py","file_url":"https://github.com/a1bc2def6g/fastgl-ae/blob/HEAD/train_fastgl.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, a1bc2def6g/fastgl-ae when it was checked","code_sha256":"7c3b1447eaf6fdf7","code_sha256_prefix":"7c3b1447eaf6fdf7","mcp_get_code":{"code_sha256":"7c3b1447eaf6fdf7"}},{"arxiv_id":"2408.13373","arxiv_id_is_arxiv":true,"paper":"/paper/learning-unknowns-from-unknowns-diversified","title":"Learning Unknowns from Unknowns: Diversified Negative Prototypes Generator for Few-Shot Open-Set Recognition","date":"2024-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icgy96/dnpg","path":"dataloader/tiered_imagenet.py","file_url":"https://github.com/icgy96/dnpg/blob/HEAD/dataloader/tiered_imagenet.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":"66e6fec21aaadc97","code_sha256_prefix":"66e6fec21aaadc97","mcp_get_code":{"code_sha256":"66e6fec21aaadc97"}},{"arxiv_id":"2408.09343","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-pretraining-and-finetuning-for","title":"Large-Scale Pretraining and Finetuning for Efficient Jet Classification in Particle Physics","date":null,"month_inferred_from_arxiv_id":"2024-08","title_source":"archive","repo":"JavierZhao/JetCLR","path":"scripts/run_jetclr.py","file_url":"https://github.com/JavierZhao/JetCLR/blob/HEAD/scripts/run_jetclr.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, JavierZhao/JetCLR when it was checked","code_sha256":"bb4fe4736d20ceb6","code_sha256_prefix":"bb4fe4736d20ceb6","mcp_get_code":{"code_sha256":"bb4fe4736d20ceb6"}},{"arxiv_id":"2407.06192","arxiv_id_is_arxiv":true,"paper":"/paper/multi-object-hallucination-in-vision-language","title":"Multi-Object Hallucination in Vision-Language Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sled-group/moh","path":"data-annotation/panoptic_COCO.py","file_url":"https://github.com/sled-group/moh/blob/HEAD/data-annotation/panoptic_COCO.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, sled-group/moh when it was checked","code_sha256":"df2411b38622c0f9","code_sha256_prefix":"df2411b38622c0f9","mcp_get_code":{"code_sha256":"df2411b38622c0f9"}},{"arxiv_id":"2402.01375","arxiv_id_is_arxiv":true,"paper":"/paper/dive-into-the-chasm-probing-the-gap-between","title":"Dive into the Chasm: Probing the Gap between In- and Cross-Topic Generalization","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/eacl2024-cross-topic-probing","path":"src/amnesic_probing/debiased_finetuning/utils.py","file_url":"https://github.com/ukplab/eacl2024-cross-topic-probing/blob/HEAD/src/amnesic_probing/debiased_finetuning/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6686bf211e128ab1","code_sha256_prefix":"6686bf211e128ab1","mcp_get_code":{"code_sha256":"6686bf211e128ab1"}},{"arxiv_id":"2308.10299","arxiv_id_is_arxiv":true,"paper":"/paper/boosting-adversarial-transferability-by-block","title":"Boosting Adversarial Transferability by Block Shuffle and Rotation","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"db428026d8831b8e","code_sha256_prefix":"db428026d8831b8e","mcp_get_code":{"code_sha256":"db428026d8831b8e"}},{"arxiv_id":"2206.10550","arxiv_id_is_arxiv":true,"paper":"/paper/certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blaisedelattre/bridging_the_gap_rs","path":"code/certify_cpm_from_log.py","file_url":"https://github.com/blaisedelattre/bridging_the_gap_rs/blob/HEAD/code/certify_cpm_from_log.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":"b3199d231cdd7b96","code_sha256_prefix":"b3199d231cdd7b96","mcp_get_code":{"code_sha256":"b3199d231cdd7b96"}},{"arxiv_id":"2205.01068","arxiv_id_is_arxiv":true,"paper":"/paper/opt-open-pre-trained-transformer-language","title":"OPT: Open Pre-trained Transformer Language Models","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mthcom/hscore-dataset-pruning","path":"create_scores.py","file_url":"https://github.com/mthcom/hscore-dataset-pruning/blob/HEAD/create_scores.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":"559cff9b7463d528","code_sha256_prefix":"559cff9b7463d528","mcp_get_code":{"code_sha256":"559cff9b7463d528"}},{"arxiv_id":"2205.01068","arxiv_id_is_arxiv":true,"paper":"/paper/opt-open-pre-trained-transformer-language","title":"OPT: Open Pre-trained Transformer Language Models","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mthcom/hscore-dataset-pruning","path":"create_scores_race.py","file_url":"https://github.com/mthcom/hscore-dataset-pruning/blob/HEAD/create_scores_race.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":"9387fa891879e614","code_sha256_prefix":"9387fa891879e614","mcp_get_code":{"code_sha256":"9387fa891879e614"}},{"arxiv_id":"2205.00363","arxiv_id_is_arxiv":true,"paper":"/paper/visual-spatial-reasoning","title":"Visual Spatial Reasoning","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/visual-spatial-reasoning","path":"feature_extraction/lxmert/utils.py","file_url":"https://github.com/cambridgeltl/visual-spatial-reasoning/blob/HEAD/feature_extraction/lxmert/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":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 vis-nlp/ChartQA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"8a78a755bda274a5","code_sha256_prefix":"8a78a755bda274a5","mcp_get_code":{"code_sha256":"8a78a755bda274a5"}},{"arxiv_id":"2203.02013","arxiv_id_is_arxiv":true,"paper":"/paper/dime-fine-grained-interpretations-of","title":"DIME: Fine-grained Interpretations of Multimodal Models via Disentangled Local Explanations","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvyiwei1/dime","path":"lxmert/utils.py","file_url":"https://github.com/lvyiwei1/dime/blob/HEAD/lxmert/utils.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":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from vis-nlp/ChartQA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"8a78a755bda274a5","code_sha256_prefix":"8a78a755bda274a5","mcp_get_code":{"code_sha256":"8a78a755bda274a5"}},{"arxiv_id":"2112.07566","arxiv_id_is_arxiv":true,"paper":"/paper/valse-a-task-independent-benchmark-for-vision-1","title":"VALSE: A Task-Independent Benchmark for Vision and Language Models Centered on Linguistic Phenomena","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heidelberg-nlp/valse","path":"utils.py","file_url":"https://github.com/heidelberg-nlp/valse/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":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 vis-nlp/ChartQA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"8a78a755bda274a5","code_sha256_prefix":"8a78a755bda274a5","mcp_get_code":{"code_sha256":"8a78a755bda274a5"}},{"arxiv_id":"2108.11556","arxiv_id_is_arxiv":true,"paper":"/paper/latent-space-energy-based-model-of-symbol","title":"Latent Space Energy-Based Model of Symbol-Vector Coupling for Text Generation and Classification","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bpucla/ibebm","path":"semi_sup_classification.py","file_url":"https://github.com/bpucla/ibebm/blob/HEAD/semi_sup_classification.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, bpucla/ibebm when it was checked","code_sha256":"d641947579d91aa6","code_sha256_prefix":"d641947579d91aa6","mcp_get_code":{"code_sha256":"d641947579d91aa6"}},{"arxiv_id":"2106.14282","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-how-fine-tuning-changes-bert","title":"A Closer Look at How Fine-tuning Changes BERT","date":"2021-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/BERT-fine-tuning-analysis","path":"probing/utils.py","file_url":"https://github.com/utahnlp/BERT-fine-tuning-analysis/blob/HEAD/probing/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":"2d7199caf1f33be2","code_sha256_prefix":"2d7199caf1f33be2","mcp_get_code":{"code_sha256":"2d7199caf1f33be2"}},{"arxiv_id":"2106.09248","arxiv_id_is_arxiv":true,"paper":"/paper/x-fact-a-new-benchmark-dataset-for","title":"X-FACT: A New Benchmark Dataset for Multilingual Fact Checking","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/x-fact","path":"transformers/majority_class.py","file_url":"https://github.com/utahnlp/x-fact/blob/HEAD/transformers/majority_class.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":"90904728fb3e47a1","code_sha256_prefix":"90904728fb3e47a1","mcp_get_code":{"code_sha256":"90904728fb3e47a1"}},{"arxiv_id":"2104.05904","arxiv_id_is_arxiv":true,"paper":"/paper/directprobe-studying-representations-without","title":"DirectProbe: Studying Representations without Classifiers","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/DirectProbe","path":"directprobe/utils.py","file_url":"https://github.com/utahnlp/DirectProbe/blob/HEAD/directprobe/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":"d59d2007ad27229f","code_sha256_prefix":"d59d2007ad27229f","mcp_get_code":{"code_sha256":"d59d2007ad27229f"}},{"arxiv_id":"2002.08595","arxiv_id_is_arxiv":true,"paper":"/paper/kaokore-a-pre-modern-japanese-art-facial","title":"KaoKore: A Pre-modern Japanese Art Facial Expression Dataset","date":"2020-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rois-codh/kaokore","path":"code/dataloader_pytorch.py","file_url":"https://github.com/rois-codh/kaokore/blob/HEAD/code/dataloader_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rois-codh/kaokore when it was checked","code_sha256":"33a0ad4fd2fbce4b","code_sha256_prefix":"33a0ad4fd2fbce4b","mcp_get_code":{"code_sha256":"33a0ad4fd2fbce4b"}},{"arxiv_id":"1911.03070","arxiv_id_is_arxiv":true,"paper":"/paper/interactive-refinement-of-cross-lingual-word","title":"Interactive Refinement of Cross-Lingual Word Embeddings","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forest-snow/clime-ui","path":"utils.py","file_url":"https://github.com/forest-snow/clime-ui/blob/HEAD/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":"9ebcf96b972b7a4b","code_sha256_prefix":"9ebcf96b972b7a4b","mcp_get_code":{"code_sha256":"9ebcf96b972b7a4b"}},{"arxiv_id":"1908.06281","arxiv_id_is_arxiv":true,"paper":"/paper/nesterov-accelerated-gradient-and-scale","title":"Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks","date":"2019-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JHL-HUST/SI-NI-FGSM","path":"simple_eval.py","file_url":"https://github.com/JHL-HUST/SI-NI-FGSM/blob/HEAD/simple_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JHL-HUST/SI-NI-FGSM when it was checked","code_sha256":"db428026d8831b8e","code_sha256_prefix":"db428026d8831b8e","mcp_get_code":{"code_sha256":"db428026d8831b8e"}},{"arxiv_id":"1805.12462","arxiv_id_is_arxiv":true,"paper":"/paper/on-gans-and-gmms","title":"On GANs and GMMs","date":"2018-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eitanrich/gans-n-gmms","path":"ndb_mnist_demo.py","file_url":"https://github.com/eitanrich/gans-n-gmms/blob/HEAD/ndb_mnist_demo.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, eitanrich/gans-n-gmms when it was checked","code_sha256":"d47ee5d50b52acef","code_sha256_prefix":"d47ee5d50b52acef","mcp_get_code":{"code_sha256":"d47ee5d50b52acef"}},{"arxiv_id":"1711.09577","arxiv_id_is_arxiv":true,"paper":"/paper/can-spatiotemporal-3d-cnns-retrace-the","title":"Can Spatiotemporal 3D CNNs Retrace the History of 2D CNNs and ImageNet?","date":"2017-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"okankop/Efficient-3DCNNs","path":"utils/kinetics_json.py","file_url":"https://github.com/okankop/Efficient-3DCNNs/blob/HEAD/utils/kinetics_json.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":"90b941a8c18bcd57","code_sha256_prefix":"90b941a8c18bcd57","mcp_get_code":{"code_sha256":"90b941a8c18bcd57"}},{"arxiv_id":"1705.09296","arxiv_id_is_arxiv":true,"paper":"/paper/neural-models-for-documents-with-metadata","title":"Neural Models for Documents with Metadata","date":"2017-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dallascard/scholar","path":"run_scholar.py","file_url":"https://github.com/dallascard/scholar/blob/HEAD/run_scholar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6fe1b8e2e4cc2a38","code_sha256_prefix":"6fe1b8e2e4cc2a38","mcp_get_code":{"code_sha256":"6fe1b8e2e4cc2a38"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexsax/2D-3D-Semantics","path":"assets/utils.py","file_url":"https://github.com/alexsax/2D-3D-Semantics/blob/HEAD/assets/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40ff9df70f20a948","code_sha256_prefix":"40ff9df70f20a948","mcp_get_code":{"code_sha256":"40ff9df70f20a948"}},{"arxiv_id":"1606.02185","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-neural-statistician","title":"Towards a Neural Statistician","date":"2016-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cravingoxygen/neuralstat","path":"spatialcreate.py","file_url":"https://github.com/cravingoxygen/neuralstat/blob/HEAD/spatialcreate.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":"b1af56804ab57958","code_sha256_prefix":"b1af56804ab57958","mcp_get_code":{"code_sha256":"b1af56804ab57958"}},{"arxiv_id":"Huang_Task-Adaptive_Negative_Envision_for_Few-Shot_Open-Set_Recognition_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_Task-Adaptive_Negative_Envision_for_Few-Shot_Open-Set_Recognition_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shiyuanh/TANE","path":"dataloader/tiered_imagenet.py","file_url":"https://github.com/shiyuanh/TANE/blob/HEAD/dataloader/tiered_imagenet.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":"66e6fec21aaadc97","code_sha256_prefix":"66e6fec21aaadc97","mcp_get_code":{"code_sha256":"66e6fec21aaadc97"}}],"record_sha256":"c60454db95235278f7a8868dbc67ac224a30098761de9639a0da760d91cb738e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}