{"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/train-val-split","entry":"train_val_split","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":2,"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":16,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":16,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":12,"unverified":1},"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":"2603.00087","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00087","title":"High-Resolution Range Profile Classifiers Require Aspect-Angle Awareness","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"EdwynBrient/HRRPclf-req-angles","path":"src/clf_req_asp/utils.py","file_url":"https://github.com/EdwynBrient/HRRPclf-req-angles/blob/HEAD/src/clf_req_asp/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":"01d465a2ac096f9d","code_sha256_prefix":"01d465a2ac096f9d","mcp_get_code":{"code_sha256":"01d465a2ac096f9d"}},{"arxiv_id":"2410.13787","arxiv_id_is_arxiv":true,"paper":"/paper/looking-inward-language-models-can-learn","title":"Looking Inward: Language Models Can Learn About Themselves by Introspection","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felixbinder/introspection_self_prediction","path":"evals/extract_strings_from_dataframe.py","file_url":"https://github.com/felixbinder/introspection_self_prediction/blob/HEAD/evals/extract_strings_from_dataframe.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, felixbinder/introspection_self_prediction when it was checked","code_sha256":"43066566684c556a","code_sha256_prefix":"43066566684c556a","mcp_get_code":{"code_sha256":"43066566684c556a"}},{"arxiv_id":"2410.12261","arxiv_id_is_arxiv":true,"paper":"/paper/catch-channel-aware-multivariate-time-series","title":"CATCH: Channel-Aware multivariate Time Series Anomaly Detection via Frequency Patching","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/catch","path":"ts_benchmark/baselines/catch/CATCH.py","file_url":"https://github.com/decisionintelligence/catch/blob/HEAD/ts_benchmark/baselines/catch/CATCH.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, decisionintelligence/catch when it was checked","code_sha256":"a59a0451698b9bad","code_sha256_prefix":"a59a0451698b9bad","mcp_get_code":{"code_sha256":"a59a0451698b9bad"}},{"arxiv_id":"2404.13815","arxiv_id_is_arxiv":true,"paper":"/paper/improving-group-robustness-on-spurious","title":"Improving Group Robustness on Spurious Correlation Requires Preciser Group Inference","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujinhanml/gic","path":"utils/load_data.py","file_url":"https://github.com/yujinhanml/gic/blob/HEAD/utils/load_data.py","status":"ran","verification_level":1,"contract_check":null,"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, yujinhanml/gic when it was checked","code_sha256":"338f487e5aaa1dbe","code_sha256_prefix":"338f487e5aaa1dbe","mcp_get_code":{"code_sha256":"338f487e5aaa1dbe"}},{"arxiv_id":"2310.15290","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-reliable-generation-of-ehr-time","title":"Reliable Generation of Privacy-preserving Synthetic Electronic Health Record Time Series via Diffusion Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhangtian/timediff","path":"baselines/halo_train.py","file_url":"https://github.com/muhangtian/timediff/blob/HEAD/baselines/halo_train.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, muhangtian/timediff when it was checked","code_sha256":"19841fc582fd6a91","code_sha256_prefix":"19841fc582fd6a91","mcp_get_code":{"code_sha256":"19841fc582fd6a91"}},{"arxiv_id":"2206.02909","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-human-activity","title":"Self-supervised Learning for Human Activity Recognition Using 700,000 Person-days of Wearable Data","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OxWearables/ssl-wearables","path":"downstream_task_evaluation.py","file_url":"https://github.com/OxWearables/ssl-wearables/blob/HEAD/downstream_task_evaluation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, OxWearables/ssl-wearables (NOASSERTION)","code_sha256":"e79a7e27f77244d5","code_sha256_prefix":"e79a7e27f77244d5","mcp_get_code":{"code_sha256":"e79a7e27f77244d5"}},{"arxiv_id":"2112.00059","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-gradient-inversion-attacks-and-1","title":"Evaluating Gradient Inversion Attacks and Defenses in Federated Learning","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Princeton-SysML/GradAttack","path":"gradattack/datamodules.py","file_url":"https://github.com/Princeton-SysML/GradAttack/blob/HEAD/gradattack/datamodules.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":"491cc519cd049dad","code_sha256_prefix":"491cc519cd049dad","mcp_get_code":{"code_sha256":"491cc519cd049dad"}},{"arxiv_id":"2110.05428","arxiv_id_is_arxiv":true,"paper":"/paper/learning-temporally-causal-latent-processes","title":"Learning Temporally Causal Latent Processes from General Temporal Data","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talmo/leap","path":"leap/training.py","file_url":"https://github.com/talmo/leap/blob/HEAD/leap/training.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30ad80c64b2a2dc6","code_sha256_prefix":"30ad80c64b2a2dc6","mcp_get_code":{"code_sha256":"30ad80c64b2a2dc6"}},{"arxiv_id":"2106.04802","arxiv_id_is_arxiv":true,"paper":"/paper/probabilistic-task-modelling-for-meta","title":"Probabilistic task modelling for meta-learning","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cnguyen10/probabilistic_task_modelling","path":"utils.py","file_url":"https://github.com/cnguyen10/probabilistic_task_modelling/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fefff9ac7d01b12a","code_sha256_prefix":"fefff9ac7d01b12a","mcp_get_code":{"code_sha256":"fefff9ac7d01b12a"}},{"arxiv_id":"2003.14297","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-small-data-through-sampling-an","title":"Generative Latent Implicit Conditional Optimization when Learning from Small Sample","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAzuri/glico-learning-small-sample","path":"glico_model/cifar10.py","file_url":"https://github.com/IdanAzuri/glico-learning-small-sample/blob/HEAD/glico_model/cifar10.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":"a727540bc318bdd2","code_sha256_prefix":"a727540bc318bdd2","mcp_get_code":{"code_sha256":"a727540bc318bdd2"}},{"arxiv_id":"2003.14297","arxiv_id_is_arxiv":true,"paper":"/paper/learning-from-small-data-through-sampling-an","title":"Generative Latent Implicit Conditional Optimization when Learning from Small Sample","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAzuri/glico-learning-small-sample","path":"glico_model/cifar100.py","file_url":"https://github.com/IdanAzuri/glico-learning-small-sample/blob/HEAD/glico_model/cifar100.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":"3fb532813fcf4bb5","code_sha256_prefix":"3fb532813fcf4bb5","mcp_get_code":{"code_sha256":"3fb532813fcf4bb5"}},{"arxiv_id":"1908.02983","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-labeling-and-confirmation-bias-in-deep","title":"Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learning","date":"2019-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EricArazo/PseudoLabeling","path":"cifar10/dataset/cifar10.py","file_url":"https://github.com/EricArazo/PseudoLabeling/blob/HEAD/cifar10/dataset/cifar10.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":"9ff47a9283dff48c","code_sha256_prefix":"9ff47a9283dff48c","mcp_get_code":{"code_sha256":"9ff47a9283dff48c"}},{"arxiv_id":"1905.02249","arxiv_id_is_arxiv":true,"paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevinghst/mixmatch","path":"dataset/cifar10.py","file_url":"https://github.com/kevinghst/mixmatch/blob/HEAD/dataset/cifar10.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":"035b6b2199fe55d1","code_sha256_prefix":"035b6b2199fe55d1","mcp_get_code":{"code_sha256":"035b6b2199fe55d1"}},{"arxiv_id":"1905.02249","arxiv_id_is_arxiv":true,"paper":"/paper/mixmatch-a-holistic-approach-to-semi","title":"MixMatch: A Holistic Approach to Semi-Supervised Learning","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"narendoraiswamy/MixMatch-pytorch-demo","path":"dataset/_cifar10.py","file_url":"https://github.com/narendoraiswamy/MixMatch-pytorch-demo/blob/HEAD/dataset/_cifar10.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":"41670d21181a8756","code_sha256_prefix":"41670d21181a8756","mcp_get_code":{"code_sha256":"41670d21181a8756"}},{"arxiv_id":"1812.01504","arxiv_id_is_arxiv":true,"paper":"/paper/fighting-fire-with-fire-using-antidote-data","title":"Fighting Fire with Fire: Using Antidote Data to Improve Polarization and Fairness of Recommender Systems","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rastegarpanah/antidote-data-framework","path":"MF.py","file_url":"https://github.com/rastegarpanah/antidote-data-framework/blob/HEAD/MF.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, rastegarpanah/antidote-data-framework when it was checked","code_sha256":"a37b461d017fb3c9","code_sha256_prefix":"a37b461d017fb3c9","mcp_get_code":{"code_sha256":"a37b461d017fb3c9"}},{"arxiv_id":"1805.02410","arxiv_id_is_arxiv":true,"paper":"/paper/mmdenselstm-an-efficient-combination-of","title":"MMDenseLSTM: An efficient combination of convolutional and recurrent neural networks for audio source separation","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"tsurumeso/vocal-remover","path":"lib/dataset.py","file_url":"https://github.com/tsurumeso/vocal-remover/blob/HEAD/lib/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f3394212ec277e8","code_sha256_prefix":"8f3394212ec277e8","mcp_get_code":{"code_sha256":"8f3394212ec277e8"}}],"record_sha256":"20a7044a5aecc7ca27d8c1865ab5f6da9f983bec581a77017c36c3f1a111cabc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}