{"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/ratio","entry":"ratio","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":6,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2402.04008","paper":"/paper/understanding-spectral-artefacts-in-ska-low","title":"Understanding spectral artefacts in SKA-LOW 21-cm cosmology experiments: the impact of cable reflections","date":null,"month_inferred_from_arxiv_id":"2024-02","title_source":"archive","repo":"ycliu23/Cambridge-SKA-SDC3-Foregrounds","path":"pipeline/cal_ps.py","file_url":"https://github.com/ycliu23/Cambridge-SKA-SDC3-Foregrounds/blob/HEAD/pipeline/cal_ps.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9a9729fbe4891041","mcp_get_code":{"code_sha256":"9a9729fbe4891041"}},{"arxiv_id":"2311.09793","paper":"/paper/fossil-2-0-formal-certificate-synthesis-for","title":"Fossil 2.0: Formal Certificate Synthesis for the Verification and Control of Dynamical Models","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxford-oxcav/fossil","path":"fossil/analysis.py","file_url":"https://github.com/oxford-oxcav/fossil/blob/HEAD/fossil/analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"8b42f915f1b1858f","mcp_get_code":{"code_sha256":"8b42f915f1b1858f"}},{"arxiv_id":"2211.11982","paper":"/paper/botsim-an-end-to-end-bot-simulation-framework","title":"BotSIM: An End-to-End Bot Simulation Framework for Commercial Task-Oriented Dialog Systems","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seatgeek/thefuzz","path":"thefuzz/fuzz.py","file_url":"https://github.com/seatgeek/thefuzz/blob/HEAD/thefuzz/fuzz.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5002bd6866601760","mcp_get_code":{"code_sha256":"5002bd6866601760"}},{"arxiv_id":"2210.03164","paper":"/paper/infoot-information-maximizing-optimal","title":"InfoOT: Information Maximizing Optimal Transport","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/infoot","path":"infoot.py","file_url":"https://github.com/chingyaoc/infoot/blob/HEAD/infoot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a2a73ea387860f3","mcp_get_code":{"code_sha256":"5a2a73ea387860f3"}},{"arxiv_id":"2001.06089","paper":"/paper/fairness-measures-for-regression-via","title":"Fairness Measures for Regression via Probabilistic Classification","date":"2020-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gradientinstitute/fastfair","path":"fastfair/measures.py","file_url":"https://github.com/gradientinstitute/fastfair/blob/HEAD/fastfair/measures.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":"10c87d68120960c1","mcp_get_code":{"code_sha256":"10c87d68120960c1"}},{"arxiv_id":"openreview_e2xQL4BWrY","paper":null,"title":"arXiv:openreview_e2xQL4BWrY","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AragornHorse/MRPO","path":"utils.py","file_url":"https://github.com/AragornHorse/MRPO/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69aa3b8a6de9a7c1","mcp_get_code":{"code_sha256":"69aa3b8a6de9a7c1"}}]}