{"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","entry":"median","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":6,"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":"2410.05255","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","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, dwanzhang-ai/seppo when it was checked","code_sha256":"bec2d52afe80356a","code_sha256_prefix":"bec2d52afe80356a","mcp_get_code":{"code_sha256":"bec2d52afe80356a"}},{"arxiv_id":"2404.07448","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","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, Xujxyang/OpenTrans (NOASSERTION)","code_sha256":"35fe0192a58f9bea","code_sha256_prefix":"35fe0192a58f9bea","mcp_get_code":{"code_sha256":"35fe0192a58f9bea"}},{"arxiv_id":"2210.12438","arxiv_id_is_arxiv":true,"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":"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":"44abf67f662415da","code_sha256_prefix":"44abf67f662415da","mcp_get_code":{"code_sha256":"44abf67f662415da"}},{"arxiv_id":"2204.10356","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cy-xu/cosmic-conn, is not in the permissive set Syntology serves inline","code_sha256":"1ef414e61e451cad","code_sha256_prefix":"1ef414e61e451cad","mcp_get_code":{"code_sha256":"1ef414e61e451cad"}},{"arxiv_id":"2110.04374","arxiv_id_is_arxiv":true,"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":"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":"79a89132ce3f75f1","code_sha256_prefix":"79a89132ce3f75f1","mcp_get_code":{"code_sha256":"79a89132ce3f75f1"}},{"arxiv_id":"2006.02286","arxiv_id_is_arxiv":true,"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":"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":"12f03b12b67e85ec","code_sha256_prefix":"12f03b12b67e85ec","mcp_get_code":{"code_sha256":"12f03b12b67e85ec"}},{"arxiv_id":"1905.02244","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cbeebb0d2fd1171","code_sha256_prefix":"4cbeebb0d2fd1171","mcp_get_code":{"code_sha256":"4cbeebb0d2fd1171"}},{"arxiv_id":"1806.03836","arxiv_id_is_arxiv":true,"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":"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":"6bb2dcdf99da263f","code_sha256_prefix":"6bb2dcdf99da263f","mcp_get_code":{"code_sha256":"6bb2dcdf99da263f"}},{"arxiv_id":"2021.emnlp-main.482","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb9327d221dd87b2","code_sha256_prefix":"bb9327d221dd87b2","mcp_get_code":{"code_sha256":"bb9327d221dd87b2"}}],"record_sha256":"e08110f41d0bc96e0b694aedff56852c29acceb0c2d10c3b0e467431a6a2667e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}