{"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-std","entry":"mean_std","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":3,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":9,"n_places":13,"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":4,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"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":"2608.13711","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-13711","title":"TRUE-Colon: Exposing a Consistent Transfer Asymmetry in Real-Time Polyp Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"sdoerrich97/true-colon","path":"true_colon/_aggregate.py","file_url":"https://github.com/sdoerrich97/true-colon/blob/HEAD/true_colon/_aggregate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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, sdoerrich97/true-colon (NOASSERTION)","code_sha256":"0428064eb6ef2f69","code_sha256_prefix":"0428064eb6ef2f69","mcp_get_code":{"code_sha256":"0428064eb6ef2f69"}},{"arxiv_id":"2608.10145","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10145","title":"The Evaluation Protocol Determines the Result: An Independent Reproduction of LeWorldModel on TwoRoom","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"joyjeet-singh/tinylab","path":"analyze_reach.py","file_url":"https://github.com/joyjeet-singh/tinylab/blob/HEAD/analyze_reach.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joyjeet-singh/tinylab when it was checked","code_sha256":"59c745351e159725","code_sha256_prefix":"59c745351e159725","mcp_get_code":{"code_sha256":"59c745351e159725"}},{"arxiv_id":"2607.09893","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09893","title":"An End-to-End Hybrid Quantum-Classical Sampling Workflow for Discrete Markov Random Fields: A Reproducible Case Study","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"arulrhikm/QuantumDGM","path":"experiments/plotting.py","file_url":"https://github.com/arulrhikm/QuantumDGM/blob/HEAD/experiments/plotting.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d63a0e4a54beeeeb","code_sha256_prefix":"d63a0e4a54beeeeb","mcp_get_code":{"code_sha256":"d63a0e4a54beeeeb"}},{"arxiv_id":"2605.00604","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00604","title":"Affinity Is Not Enough: Recovering the Free Energy Principle in Mixture-of-Experts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"russellwmy/affinity-is-not-enough","path":"prototype/ablation.py","file_url":"https://github.com/russellwmy/affinity-is-not-enough/blob/HEAD/prototype/ablation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2a4256fd27b02e6","code_sha256_prefix":"b2a4256fd27b02e6","mcp_get_code":{"code_sha256":"b2a4256fd27b02e6"}},{"arxiv_id":"2603.07567","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07567","title":"Revisiting the LiRA Membership Inference Attack Under Realistic Assumptions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"najeebjebreel/lira_analysis","path":"comprehensive_analysis/rank_stability_utils.py","file_url":"https://github.com/najeebjebreel/lira_analysis/blob/HEAD/comprehensive_analysis/rank_stability_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2aa1b93743d08c9d","code_sha256_prefix":"2aa1b93743d08c9d","mcp_get_code":{"code_sha256":"2aa1b93743d08c9d"}},{"arxiv_id":"2406.17815","arxiv_id_is_arxiv":true,"paper":"/paper/sum-saliency-unification-through-mamba-for","title":"SUM: Saliency Unification through Mamba for Visual Attention Modeling","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arhosseini77/SUM","path":"optuna_network.py","file_url":"https://github.com/Arhosseini77/SUM/blob/HEAD/optuna_network.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f0c787b1471d4421","code_sha256_prefix":"f0c787b1471d4421","mcp_get_code":{"code_sha256":"f0c787b1471d4421"}},{"arxiv_id":"2405.20690","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-diffusion-models","title":"Unleashing the Potential of Diffusion Models for Incomplete Data Imputation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hengruizhang98/DiffPuter","path":"dataset.py","file_url":"https://github.com/hengruizhang98/DiffPuter/blob/HEAD/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b562880458cb56e8","code_sha256_prefix":"b562880458cb56e8","mcp_get_code":{"code_sha256":"b562880458cb56e8"}},{"arxiv_id":"2311.06295","arxiv_id_is_arxiv":true,"paper":"/paper/gradual-optimization-learning-for","title":"Gradual Optimization Learning for Conformational Energy Minimization","date":"2023-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"airi-institute/golf","path":"read_evaluation_metrics.py","file_url":"https://github.com/airi-institute/golf/blob/HEAD/read_evaluation_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":"d7a78068f73dfc9f","code_sha256_prefix":"d7a78068f73dfc9f","mcp_get_code":{"code_sha256":"d7a78068f73dfc9f"}},{"arxiv_id":"2302.07867","arxiv_id_is_arxiv":true,"paper":"/paper/learning-performance-improving-code-edits","title":"Learning Performance-Improving Code Edits","date":"2023-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"madaan/pie-perf","path":"src/codenet_eval/run_eval.py","file_url":"https://github.com/madaan/pie-perf/blob/HEAD/src/codenet_eval/run_eval.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, madaan/pie-perf when it was checked","code_sha256":"c101803bbb9b31c7","code_sha256_prefix":"c101803bbb9b31c7","mcp_get_code":{"code_sha256":"c101803bbb9b31c7"}},{"arxiv_id":"2210.17213","arxiv_id_is_arxiv":true,"paper":"/paper/deep-gaussian-process-based-multi-fidelity","title":"Deep Gaussian Process-based Multi-fidelity Bayesian Optimization for Simulated Chemical Reactors","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optimal-pse-lab/pulsed-reactor-optimisation","path":"utils.py","file_url":"https://github.com/optimal-pse-lab/pulsed-reactor-optimisation/blob/HEAD/utils.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":"721211fed75787ee","code_sha256_prefix":"721211fed75787ee","mcp_get_code":{"code_sha256":"721211fed75787ee"}},{"arxiv_id":"1905.10841","arxiv_id_is_arxiv":true,"paper":"/paper/utilizing-automated-breast-cancer-detection","title":"Utilizing Automated Breast Cancer Detection to Identify Spatial Distributions of Tumor Infiltrating Lymphocytes in Invasive Breast Cancer","date":"2019-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SBU-BMI/quip_cancer_segmentation","path":"training/train_cancer_cnn_Resnet_pretrained.py","file_url":"https://github.com/SBU-BMI/quip_cancer_segmentation/blob/HEAD/training/train_cancer_cnn_Resnet_pretrained.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0af87439d7fc1b7c","code_sha256_prefix":"0af87439d7fc1b7c","mcp_get_code":{"code_sha256":"0af87439d7fc1b7c"}},{"arxiv_id":"1905.10841","arxiv_id_is_arxiv":true,"paper":"/paper/utilizing-automated-breast-cancer-detection","title":"Utilizing Automated Breast Cancer Detection to Identify Spatial Distributions of Tumor Infiltrating Lymphocytes in Invasive Breast Cancer","date":"2019-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SBU-BMI/quip_cancer_segmentation","path":"prediction/tumor_pred/pred.py","file_url":"https://github.com/SBU-BMI/quip_cancer_segmentation/blob/HEAD/prediction/tumor_pred/pred.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a747d54887b41cbe","code_sha256_prefix":"a747d54887b41cbe","mcp_get_code":{"code_sha256":"a747d54887b41cbe"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"knotgrass/Knowledge-Distillation","path":"distiller/pseudo_label.py","file_url":"https://github.com/knotgrass/Knowledge-Distillation/blob/HEAD/distiller/pseudo_label.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":"9f00b79fbcd75706","code_sha256_prefix":"9f00b79fbcd75706","mcp_get_code":{"code_sha256":"9f00b79fbcd75706"}}],"record_sha256":"768647e4a20fa7ab06ea78084528dd06220de0cf637f8ab4d9e87afa6f379bf9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}