{"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/mean-confidence-interval","entry":"mean_confidence_interval","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":9,"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":11,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":10,"n_places":16,"n_places_pointer_only":5,"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":0,"ran_violates":1,"ran_draft_wrong":6,"ran_fixture":0,"ran":4,"unverified":0},"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":"2406.08619","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-speech-representations-are","title":"Self-Supervised Speech Representations are More Phonetic than Semantic","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juice500ml/phonetic_semantic_probing","path":"generate_layerwise_figures_seeds.py","file_url":"https://github.com/juice500ml/phonetic_semantic_probing/blob/HEAD/generate_layerwise_figures_seeds.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d6a1201c8371314","code_sha256_prefix":"5d6a1201c8371314","mcp_get_code":{"code_sha256":"5d6a1201c8371314"}},{"arxiv_id":"2405.14860","arxiv_id_is_arxiv":true,"paper":"/paper/not-all-language-model-features-are-linear","title":"Not All Language Model Features Are Linear","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joshengels/multidimensionalfeatures","path":"intervention/compare_circle_intervention_types.py","file_url":"https://github.com/joshengels/multidimensionalfeatures/blob/HEAD/intervention/compare_circle_intervention_types.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6661fded31c6734f","code_sha256_prefix":"6661fded31c6734f","mcp_get_code":{"code_sha256":"6661fded31c6734f"}},{"arxiv_id":"2402.05234","arxiv_id_is_arxiv":true,"paper":"/paper/qgfn-controllable-greediness-with-action","title":"QGFN: Controllable Greediness with Action Values","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunglau/QGFN","path":"utils/metrics.py","file_url":"https://github.com/yunglau/QGFN/blob/HEAD/utils/metrics.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":"40f2f8185e2b1e3f","code_sha256_prefix":"40f2f8185e2b1e3f","mcp_get_code":{"code_sha256":"40f2f8185e2b1e3f"}},{"arxiv_id":"2311.09807","arxiv_id_is_arxiv":true,"paper":"/paper/the-curious-decline-of-linguistic-diversity","title":"The Curious Decline of Linguistic Diversity: Training Language Models on Synthetic Text","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanzhuguo/linguistic-diversity","path":"semantic_diversity.py","file_url":"https://github.com/yanzhuguo/linguistic-diversity/blob/HEAD/semantic_diversity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"225f4d9f0906b5a9","code_sha256_prefix":"225f4d9f0906b5a9","mcp_get_code":{"code_sha256":"225f4d9f0906b5a9"}},{"arxiv_id":"2302.12604","arxiv_id_is_arxiv":true,"paper":"/paper/neural-laplace-control-for-continuous-time","title":"Neural Laplace Control for Continuous-time Delayed Systems","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samholt/neurallaplacecontrol","path":"process_results/process_logs.py","file_url":"https://github.com/samholt/neurallaplacecontrol/blob/HEAD/process_results/process_logs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c23c1dcf5ce07300","code_sha256_prefix":"c23c1dcf5ce07300","mcp_get_code":{"code_sha256":"c23c1dcf5ce07300"}},{"arxiv_id":"2212.11702","arxiv_id_is_arxiv":true,"paper":"/paper/robust-meta-representation-learning-via","title":"Robust Meta-Representation Learning via Global Label Inference and Classification","date":"2022-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isakfalk/mela","path":"eval_util.py","file_url":"https://github.com/isakfalk/mela/blob/HEAD/eval_util.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":"c5358d7283fb3dd6","code_sha256_prefix":"c5358d7283fb3dd6","mcp_get_code":{"code_sha256":"c5358d7283fb3dd6"}},{"arxiv_id":"2210.16834","arxiv_id_is_arxiv":true,"paper":"/paper/alleviating-the-sample-selection-bias-in-few","title":"Alleviating the Sample Selection Bias in Few-shot Learning by Removing Projection to the Centroid","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kikimormay/fsl-tcbr","path":"evaluate_DC_minusEffect.py","file_url":"https://github.com/kikimormay/fsl-tcbr/blob/HEAD/evaluate_DC_minusEffect.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kikimormay/fsl-tcbr when it was checked","code_sha256":"02885b711bbe655c","code_sha256_prefix":"02885b711bbe655c","mcp_get_code":{"code_sha256":"02885b711bbe655c"}},{"arxiv_id":"2105.08913","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-meta-model-quantifying-for-medical","title":"Multiple Meta-model Quantifying for Medical Visual Question Answering","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aioz-ai/MICCAI21_MMQ","path":"mmq_maml/VQA_RAD_fuse.py","file_url":"https://github.com/aioz-ai/MICCAI21_MMQ/blob/HEAD/mmq_maml/VQA_RAD_fuse.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 NamyeongK/USA_UFGSM, and GitHub detected no licence in that repository when it was checked","code_sha256":"ecf7ff30fb58c026","code_sha256_prefix":"ecf7ff30fb58c026","mcp_get_code":{"code_sha256":"ecf7ff30fb58c026"}},{"arxiv_id":"2103.09027","arxiv_id_is_arxiv":true,"paper":"/paper/repurposing-pretrained-models-for-robust-out-1","title":"Repurposing Pretrained Models for Robust Out-of-domain Few-Shot Learning","date":"2021-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NamyeongK/USA_UFGSM","path":"miniimagenet_train.py","file_url":"https://github.com/NamyeongK/USA_UFGSM/blob/HEAD/miniimagenet_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NamyeongK/USA_UFGSM when it was checked","code_sha256":"ecf7ff30fb58c026","code_sha256_prefix":"ecf7ff30fb58c026","mcp_get_code":{"code_sha256":"ecf7ff30fb58c026"}},{"arxiv_id":"2003.04390","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-meta-baseline-for-few-shot-learning","title":"Meta-Baseline: Exploring Simple Meta-Learning for Few-Shot Learning","date":"2020-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"3233bdb56ef8b4da","code_sha256_prefix":"3233bdb56ef8b4da","mcp_get_code":{"code_sha256":"3233bdb56ef8b4da"}},{"arxiv_id":"1904.04232","arxiv_id_is_arxiv":true,"paper":"/paper/a-closer-look-at-few-shot-classification-1","title":"A Closer Look at Few-shot Classification","date":"2019-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinboc/few-shot-meta-baseline","path":"test_few_shot.py","file_url":"https://github.com/yinboc/few-shot-meta-baseline/blob/HEAD/test_few_shot.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3233bdb56ef8b4da","code_sha256_prefix":"3233bdb56ef8b4da","mcp_get_code":{"code_sha256":"3233bdb56ef8b4da"}},{"arxiv_id":"1711.06025","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-compare-relation-network-for-few","title":"Learning to Compare: Relation Network for Few-Shot Learning","date":"2017-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khoiucd/LearningToCompare-Tensorflow","path":"miniimagenet/miniimagenet_test_few_shot.py","file_url":"https://github.com/khoiucd/LearningToCompare-Tensorflow/blob/HEAD/miniimagenet/miniimagenet_test_few_shot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbec209cee9a4df8","code_sha256_prefix":"fbec209cee9a4df8","mcp_get_code":{"code_sha256":"fbec209cee9a4df8"}},{"arxiv_id":"1606.04080","arxiv_id_is_arxiv":true,"paper":"/paper/matching-networks-for-one-shot-learning","title":"Matching Networks for One Shot Learning","date":"2016-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fujenchu/matchingNet","path":"utils.py","file_url":"https://github.com/fujenchu/matchingNet/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbec209cee9a4df8","code_sha256_prefix":"fbec209cee9a4df8","mcp_get_code":{"code_sha256":"fbec209cee9a4df8"}},{"arxiv_id":"ijcai2020_0377","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2020_0377","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"P1nzhuo/Consistent-MetaReg","path":"MAML/train_MAML_miniImagenet.py","file_url":"https://github.com/P1nzhuo/Consistent-MetaReg/blob/HEAD/MAML/train_MAML_miniImagenet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 NamyeongK/USA_UFGSM, and GitHub detected no licence in that repository when it was checked","code_sha256":"ecf7ff30fb58c026","code_sha256_prefix":"ecf7ff30fb58c026","mcp_get_code":{"code_sha256":"ecf7ff30fb58c026"}},{"arxiv_id":"aaai_6628","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_6628","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Yuxin-CV/DTN","path":"main_DTN.py","file_url":"https://github.com/Yuxin-CV/DTN/blob/HEAD/main_DTN.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":"4f3eb6bcf4836cfa","code_sha256_prefix":"4f3eb6bcf4836cfa","mcp_get_code":{"code_sha256":"4f3eb6bcf4836cfa"}},{"arxiv_id":"Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhou_Towards_Effective_Foundation_Model_Adaptation_for_Extreme_Cross-Domain_Few-Shot_Learning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NWPUZhoufei/FMA","path":"main_traditional_setting.py","file_url":"https://github.com/NWPUZhoufei/FMA/blob/HEAD/main_traditional_setting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f3eb6bcf4836cfa","code_sha256_prefix":"4f3eb6bcf4836cfa","mcp_get_code":{"code_sha256":"4f3eb6bcf4836cfa"}}],"record_sha256":"11aafd27516a9f76fb3cdd073aede3f010b4405b35ee031817ee5c6d26ed604c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}