{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/median","entry":"median","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":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":9,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":6},"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":"2410.05255","paper":"/paper/seppo-semi-policy-preference-optimization-for","title":"SePPO: Semi-Policy Preference Optimization for Diffusion Alignment","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwanzhang-ai/seppo","path":"valid_scores.py","file_url":"https://github.com/dwanzhang-ai/seppo/blob/HEAD/valid_scores.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bec2d52afe80356a","mcp_get_code":{"code_sha256":"bec2d52afe80356a"}},{"arxiv_id":"2404.07448","paper":"/paper/transferable-and-principled-efficiency-for","title":"Transferable and Principled Efficiency for Open-Vocabulary Segmentation","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xujxyang/OpenTrans","path":"plain_train_net.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/plain_train_net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"35fe0192a58f9bea","mcp_get_code":{"code_sha256":"35fe0192a58f9bea"}},{"arxiv_id":"2210.12438","paper":"/paper/algorithms-with-prediction-portfolios","title":"Algorithms with Prediction Portfolios","date":"2022-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlavastida/PredictionPortfolios","path":"UtilityFunctions.py","file_url":"https://github.com/tlavastida/PredictionPortfolios/blob/HEAD/UtilityFunctions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44abf67f662415da","mcp_get_code":{"code_sha256":"44abf67f662415da"}},{"arxiv_id":"2204.10356","paper":"/paper/interactive-segmentation-and-visualization","title":"Interactive Segmentation and Visualization for Tiny Objects in Multi-megapixel Images","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cy-xu/cosmic-conn","path":"cosmic_conn/dl_framework/cosmic_conn.py","file_url":"https://github.com/cy-xu/cosmic-conn/blob/HEAD/cosmic_conn/dl_framework/cosmic_conn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"1ef414e61e451cad","mcp_get_code":{"code_sha256":"1ef414e61e451cad"}},{"arxiv_id":"2110.04374","paper":"/paper/a-few-more-examples-may-be-worth-billions-of","title":"A Few More Examples May Be Worth Billions of Parameters","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuvalkirstain/lm-evaluation-harness","path":"lm_eval/metrics.py","file_url":"https://github.com/yuvalkirstain/lm-evaluation-harness/blob/HEAD/lm_eval/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79a89132ce3f75f1","mcp_get_code":{"code_sha256":"79a89132ce3f75f1"}},{"arxiv_id":"2006.02286","paper":"/paper/learning-kernel-tests-without-data-splitting","title":"Learning Kernel Tests Without Data Splitting","date":"2020-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MPI-IS/tests-wo-splitting","path":"tests_wo_split/methods/median.py","file_url":"https://github.com/MPI-IS/tests-wo-splitting/blob/HEAD/tests_wo_split/methods/median.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"12f03b12b67e85ec","mcp_get_code":{"code_sha256":"12f03b12b67e85ec"}},{"arxiv_id":"1905.02244","paper":"/paper/searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emilianavt/OpenSeeFace","path":"remedian.py","file_url":"https://github.com/emilianavt/OpenSeeFace/blob/HEAD/remedian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"4cbeebb0d2fd1171","mcp_get_code":{"code_sha256":"4cbeebb0d2fd1171"}},{"arxiv_id":"1806.03836","paper":"/paper/bayesian-model-agnostic-meta-learning","title":"Bayesian Model-Agnostic Meta-Learning","date":"2018-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaesik817/bmaml","path":"tf_utils.py","file_url":"https://github.com/jaesik817/bmaml/blob/HEAD/tf_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6bb2dcdf99da263f","mcp_get_code":{"code_sha256":"6bb2dcdf99da263f"}},{"arxiv_id":"2021.emnlp-main.482","paper":null,"title":"arXiv:2021.emnlp-main.482","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"parasj/contracode","path":"nb/text_histogram.py","file_url":"https://github.com/parasj/contracode/blob/HEAD/nb/text_histogram.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bb9327d221dd87b2","mcp_get_code":{"code_sha256":"bb9327d221dd87b2"}}]}