{"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/remove-outliers","entry":"remove_outliers","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":4,"n_papers_ran_instrument_only":0,"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":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":6,"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":1,"ran_violates":1,"ran_draft_wrong":0,"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":"2506.00388","arxiv_id_is_arxiv":true,"paper":"/paper/clarify-contrastive-preference-reinforcement","title":"CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries","date":"2025-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moonoutcloudback/clarify_pbrl","path":"reward_model.py","file_url":"https://github.com/moonoutcloudback/clarify_pbrl/blob/HEAD/reward_model.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, moonoutcloudback/clarify_pbrl when it was checked","code_sha256":"b2f4aec40f7b3084","code_sha256_prefix":"b2f4aec40f7b3084","mcp_get_code":{"code_sha256":"b2f4aec40f7b3084"}},{"arxiv_id":"2410.09290","arxiv_id_is_arxiv":true,"paper":"/paper/ranking-over-regression-for-bayesian","title":"Ranking over Regression for Bayesian Optimization and Molecule Selection","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gkwt/rbo","path":"rbbo/utils.py","file_url":"https://github.com/gkwt/rbo/blob/HEAD/rbbo/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":"21a75c973c77e021","code_sha256_prefix":"21a75c973c77e021","mcp_get_code":{"code_sha256":"21a75c973c77e021"}},{"arxiv_id":"2402.13125","arxiv_id_is_arxiv":true,"paper":"/paper/treeeval-benchmark-free-evaluation-of-large","title":"TreeEval: Benchmark-Free Evaluation of Large Language Models through Tree Planning","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ashura5/treeeval","path":"score.py","file_url":"https://github.com/ashura5/treeeval/blob/HEAD/score.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, ashura5/treeeval when it was checked","code_sha256":"87f22e05dbadc88a","code_sha256_prefix":"87f22e05dbadc88a","mcp_get_code":{"code_sha256":"87f22e05dbadc88a"}},{"arxiv_id":"2307.09288","arxiv_id_is_arxiv":true,"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/squeezellm","path":"squeezellm/outliers.py","file_url":"https://github.com/squeezeailab/squeezellm/blob/HEAD/squeezellm/outliers.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":"303e2b878d149f4a","code_sha256_prefix":"303e2b878d149f4a","mcp_get_code":{"code_sha256":"303e2b878d149f4a"}},{"arxiv_id":"1910.00130","arxiv_id_is_arxiv":true,"paper":"/paper/track-to-reconstruct-and-reconstruct-to-track","title":"Track to Reconstruct and Reconstruct to Track","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiasfshr/MOTSFusion","path":"tracker/create_dynamic_transforms.py","file_url":"https://github.com/tobiasfshr/MOTSFusion/blob/HEAD/tracker/create_dynamic_transforms.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":"88ad30c2db8f1ac8","code_sha256_prefix":"88ad30c2db8f1ac8","mcp_get_code":{"code_sha256":"88ad30c2db8f1ac8"}},{"arxiv_id":"1903.11269","arxiv_id_is_arxiv":true,"paper":"/paper/css10-a-collection-of-single-speaker-speech","title":"CSS10: A Collection of Single Speaker Speech Datasets for 10 Languages","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kyubyong/css10","path":"MOS/utils.py","file_url":"https://github.com/Kyubyong/css10/blob/HEAD/MOS/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"718b8b4bba64f8d9","code_sha256_prefix":"718b8b4bba64f8d9","mcp_get_code":{"code_sha256":"718b8b4bba64f8d9"}}],"record_sha256":"700dcb21ad81c7dcb322d1b7eb32f86f3b5c471d474495b9c18540bcf293f263","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}