{"id":"W4381713181","doi":"10.48550/arxiv.2306.11951","title":"On the Optimal Bounds for Noisy Computing","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada; University of Cambridge; National Science Foundation","keywords":"Upper and lower bounds; Matching (statistics); Mathematics; Bounded function; Function (biology); Constant (computer programming); sort; Pairwise comparison; Combinatorics; Computer science; Discrete mathematics; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852392,0.0002554228,0.0002309578,0.0001594026,0.0004860715,0.0002727855,0.002223106,0.0001577016,0.000009459119],"category_scores_gemma":[0.0001267855,0.0002214146,0.000253032,0.0004101119,0.00007491839,0.0000830768,0.001882438,0.000760399,0.0001492334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008753096,"about_ca_system_score_gemma":0.0001114081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000103338,"about_ca_topic_score_gemma":0.000006694417,"domain_scores_codex":[0.9983249,0.0001335823,0.0001430594,0.0009249634,0.00009717808,0.0003763726],"domain_scores_gemma":[0.9977672,0.0008382068,0.0001905198,0.001023309,0.00009326886,0.00008753026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008512383,0.0000248505,0.0001217764,0.00002636526,0.00004622278,0.0000482494,0.0001940108,0.629212,0.000001662661,0.3674092,0.001979518,0.0009275907],"study_design_scores_gemma":[0.000214789,0.00007406416,0.0003262352,0.00007269293,0.00001887524,0.000001567773,0.000038587,0.955806,0.00001301737,0.04186989,0.001307784,0.0002565298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1013177,0.000008301234,0.8945024,0.001117497,0.001151264,0.0002806083,0.00001110858,0.0005127577,0.001098434],"genre_scores_gemma":[0.9875553,0.00000924039,0.005806752,0.0002578345,0.0002252963,0.000001324951,0.00001369754,0.00002583366,0.006104729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8886957,"threshold_uncertainty_score":0.9029027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09702384811491163,"score_gpt":0.2136132954366225,"score_spread":0.1165894473217108,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}