{"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-and-preprocess-data","entry":"load_and_preprocess_data","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":2},"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.02954","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-02954","title":"EFGPP: Exploratory framework for genotype-phenotype prediction","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"MuhammadMuneeb007/EFGPP","path":"Step12-Combinations.py","file_url":"https://github.com/MuhammadMuneeb007/EFGPP/blob/HEAD/Step12-Combinations.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, MuhammadMuneeb007/EFGPP when it was checked","code_sha256":"036ed9fb720a189c","code_sha256_prefix":"036ed9fb720a189c","mcp_get_code":{"code_sha256":"036ed9fb720a189c"}},{"arxiv_id":"2501.16226","arxiv_id_is_arxiv":true,"paper":"/paper/the-effect-of-optimal-self-distillation-in","title":"The Effect of Optimal Self-Distillation in Noisy Gaussian Mixture Model","date":"2025-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taka255/self-distillation-analysis","path":"Experiments/linear_probe.py","file_url":"https://github.com/taka255/self-distillation-analysis/blob/HEAD/Experiments/linear_probe.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":"f4a73fc8ae705839","code_sha256_prefix":"f4a73fc8ae705839","mcp_get_code":{"code_sha256":"f4a73fc8ae705839"}},{"arxiv_id":"2411.02023","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-classification-under-performative","title":"Optimal Classification under Performative Distribution Shift","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"totilas/PerfOpti","path":"creditdatasetpreprocess.py","file_url":"https://github.com/totilas/PerfOpti/blob/HEAD/creditdatasetpreprocess.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, totilas/PerfOpti when it was checked","code_sha256":"0d0969caf164d114","code_sha256_prefix":"0d0969caf164d114","mcp_get_code":{"code_sha256":"0d0969caf164d114"}},{"arxiv_id":"2310.19727","arxiv_id_is_arxiv":true,"paper":"/paper/generating-medical-instructions-with","title":"Generating Medical Prescriptions with Conditional Transformer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HECTA-UoM/Label-To-Text-Transformer","path":"Modules/DataHelp.py","file_url":"https://github.com/HECTA-UoM/Label-To-Text-Transformer/blob/HEAD/Modules/DataHelp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HECTA-UoM/Label-To-Text-Transformer when it was checked","code_sha256":"84eaec28aee89722","code_sha256_prefix":"84eaec28aee89722","mcp_get_code":{"code_sha256":"84eaec28aee89722"}},{"arxiv_id":"2304.04507","arxiv_id_is_arxiv":true,"paper":"/paper/hist2rna-an-efficient-deep-learning","title":"hist2RNA: An efficient deep learning architecture to predict gene expression from breast cancer histopathology images","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raktim-mondol/hist2rna","path":"generate_box_plot_and_AUC-RCH.py","file_url":"https://github.com/raktim-mondol/hist2rna/blob/HEAD/generate_box_plot_and_AUC-RCH.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":"9a2383ddb66fe348","code_sha256_prefix":"9a2383ddb66fe348","mcp_get_code":{"code_sha256":"9a2383ddb66fe348"}},{"arxiv_id":"2006.09043","arxiv_id_is_arxiv":true,"paper":"/paper/improved-deep-point-cloud-geometry","title":"Improved Deep Point Cloud Geometry Compression","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmclSF/DeepCompress","path":"src/cli_train.py","file_url":"https://github.com/pmclSF/DeepCompress/blob/HEAD/src/cli_train.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":"29c977decc3bde78","code_sha256_prefix":"29c977decc3bde78","mcp_get_code":{"code_sha256":"29c977decc3bde78"}}],"record_sha256":"c77f4d60c9cd910fde799ad8c503682a441b7c297cb68ff0b9988a9ffed82777","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}