{"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/median-heuristic","entry":"median_heuristic","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":11,"n_places_pointer_only":2,"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":3,"ran_fixture":0,"ran":5,"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":"2602.11325","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11325","title":"Amortised and provably-robust simulation-based inference","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"bharti-ayush/nsm-bayes","path":"nsm-bayes/method.py","file_url":"https://github.com/bharti-ayush/nsm-bayes/blob/HEAD/nsm-bayes/method.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, bharti-ayush/nsm-bayes when it was checked","code_sha256":"bd07da937e3e9a0e","code_sha256_prefix":"bd07da937e3e9a0e","mcp_get_code":{"code_sha256":"bd07da937e3e9a0e"}},{"arxiv_id":"2510.25808","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-25808","title":"PRESTO: Preimage-Informed Instruction Optimization for Prompting Black-Box LLMs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mlvlab/PRESTO","path":"Induction/experiments/group_init.py","file_url":"https://github.com/mlvlab/PRESTO/blob/HEAD/Induction/experiments/group_init.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":"e5b1507763dcab0c","code_sha256_prefix":"e5b1507763dcab0c","mcp_get_code":{"code_sha256":"e5b1507763dcab0c"}},{"arxiv_id":"2411.17337","arxiv_id_is_arxiv":true,"paper":"/paper/sbi-reloaded-a-toolkit-for-simulation-based","title":"sbi reloaded: a toolkit for simulation-based inference workflows","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sbi-dev/sbi","path":"sbi/diagnostics/misspecification.py","file_url":"https://github.com/sbi-dev/sbi/blob/HEAD/sbi/diagnostics/misspecification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"982bf515ea600367","code_sha256_prefix":"982bf515ea600367","mcp_get_code":{"code_sha256":"982bf515ea600367"}},{"arxiv_id":"2306.01589","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-learning-for-atomistic-simulations","title":"Transfer learning for atomistic simulations using GNNs and kernel mean embeddings","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IsakFalk/atomistic_transfer_mekrr","path":"ocpmodels/transfer_learning/models/distribution_regression.py","file_url":"https://github.com/IsakFalk/atomistic_transfer_mekrr/blob/HEAD/ocpmodels/transfer_learning/models/distribution_regression.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":"6d77dd5f3c3a99b9","code_sha256_prefix":"6d77dd5f3c3a99b9","mcp_get_code":{"code_sha256":"6d77dd5f3c3a99b9"}},{"arxiv_id":"2305.15871","arxiv_id_is_arxiv":true,"paper":"/paper/learning-robust-statistics-for-simulation","title":"Learning Robust Statistics for Simulation-based Inference under Model Misspecification","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/sbi","path":"sbi/diagnostics/misspecification.py","file_url":"https://github.com/mackelab/sbi/blob/HEAD/sbi/diagnostics/misspecification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"982bf515ea600367","code_sha256_prefix":"982bf515ea600367","mcp_get_code":{"code_sha256":"982bf515ea600367"}},{"arxiv_id":"2202.03297","arxiv_id_is_arxiv":true,"paper":"/paper/grassmann-stein-variational-gradient-descent","title":"Grassmann Stein Variational Gradient Descent","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imperialcollegelondon/gsvgd","path":"src/kernel.py","file_url":"https://github.com/imperialcollegelondon/gsvgd/blob/HEAD/src/kernel.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":"fe42c147b4106cfe","code_sha256_prefix":"fe42c147b4106cfe","mcp_get_code":{"code_sha256":"fe42c147b4106cfe"}},{"arxiv_id":"2112.09327","arxiv_id_is_arxiv":true,"paper":"/paper/incentivizing-collaboration-in-machine","title":"Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards","date":"2021-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XinyiYS/CML-RewardDistribution","path":"core/kernel.py","file_url":"https://github.com/XinyiYS/CML-RewardDistribution/blob/HEAD/core/kernel.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":"4aa9d3cd501cca31","code_sha256_prefix":"4aa9d3cd501cca31","mcp_get_code":{"code_sha256":"4aa9d3cd501cca31"}},{"arxiv_id":"2111.10275","arxiv_id_is_arxiv":true,"paper":"/paper/composite-goodness-of-fit-tests-with-kernels","title":"Composite Goodness-of-fit Tests with Kernels","date":"2021-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oscarkey/composite-tests","path":"src/composite_tests/kernels.py","file_url":"https://github.com/oscarkey/composite-tests/blob/HEAD/src/composite_tests/kernels.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":"af940c702487b5b5","code_sha256_prefix":"af940c702487b5b5","mcp_get_code":{"code_sha256":"af940c702487b5b5"}},{"arxiv_id":"2005.10099","arxiv_id_is_arxiv":true,"paper":"/paper/nonparametric-score-estimators","title":"Nonparametric Score Estimators","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miskcoo/kscore","path":"kscore/estimators/tikhonov.py","file_url":"https://github.com/miskcoo/kscore/blob/HEAD/kscore/estimators/tikhonov.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":"0172bbfec8cc6de4","code_sha256_prefix":"0172bbfec8cc6de4","mcp_get_code":{"code_sha256":"0172bbfec8cc6de4"}},{"arxiv_id":"1901.06077","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-change-point-detection-with-auxiliary","title":"Kernel Change-point Detection with Auxiliary Deep Generative Models","date":"2019-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HolyBayes/klcpd","path":"klcpd/model.py","file_url":"https://github.com/HolyBayes/klcpd/blob/HEAD/klcpd/model.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, HolyBayes/klcpd when it was checked","code_sha256":"45329d20e3fac99d","code_sha256_prefix":"45329d20e3fac99d","mcp_get_code":{"code_sha256":"45329d20e3fac99d"}},{"arxiv_id":"1711.05363","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-conditional-exponential-family","title":"Kernel Conditional Exponential Family","date":"2017-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/KCEF","path":"KCEF/tools.py","file_url":"https://github.com/MichaelArbel/KCEF/blob/HEAD/KCEF/tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49299f8379dad594","code_sha256_prefix":"49299f8379dad594","mcp_get_code":{"code_sha256":"49299f8379dad594"}}],"record_sha256":"56679e462e6cdf2be67fa65219dfbf9c1afa6361a5ef78c567a99965415bf825","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}