{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03099902,0.007489764,0.008302894,0.006224038,0.006210523,0.01331569,0.01302777,0.007646901,0.01629174],"category_scores_gemma":[0.2093782,0.004102492,0.005689674,0.01089373,0.01358767,0.05976974,0.02054018,0.02637151,0.006588558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01229014,"about_ca_system_score_gemma":0.007844035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005553956,"about_ca_topic_score_gemma":0.004908612,"domain_scores_codex":[0.9492735,0.01715237,0.002686621,0.009688568,0.01469138,0.006507612],"domain_scores_gemma":[0.7156867,0.2302669,0.005699216,0.0358305,0.009340898,0.00317568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001954937,0.0006504579,0.002513504,0.001273178,0.000317988,0.0002783099,0.0008892411,0.1529536,0.003339205,0.6778862,0.03534849,0.1225948],"study_design_scores_gemma":[0.00009384321,0.0001019489,0.0003902124,0.0002847108,0.0001260255,0.0001443935,0.0001245601,0.2142783,0.001837582,0.7749161,0.007619394,0.00008295388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01860364,0.02166547,0.8969786,0.01726274,0.001149343,0.0003356912,0.001236601,0.002304185,0.04046373],"genre_scores_gemma":[0.4595001,0.0191028,0.4728319,0.01333789,0.006789527,0.002680244,0.003286029,0.005431857,0.01703951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03099902,"threshold_uncertainty_score":0.1639404,"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."}}