{"id":"W3186369772","doi":"10.4230/lipics.ccc.2021.36","title":"On the Pseudo-Deterministic Query Complexity of NP Search Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Deterministic algorithm; Mathematics; Randomized algorithm; Computational complexity theory; Time complexity; Contrast (vision); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01920727,0.001797512,0.002791958,0.002423978,0.003005917,0.00858067,0.004955553,0.003590966,0.006680772],"category_scores_gemma":[0.123646,0.001581847,0.003323963,0.004137615,0.01059642,0.0194727,0.006566675,0.01091532,0.001095685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008284704,"about_ca_system_score_gemma":0.005433201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003156044,"about_ca_topic_score_gemma":0.002305351,"domain_scores_codex":[0.9719337,0.01374105,0.001450131,0.004014048,0.005918207,0.002942831],"domain_scores_gemma":[0.6900069,0.2819752,0.005601136,0.0163858,0.003992402,0.002038545],"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.001221212,0.0004980835,0.00500718,0.0008379976,0.0003045909,0.0001910221,0.0007744654,0.3284874,0.004432999,0.6173834,0.007115213,0.03374649],"study_design_scores_gemma":[0.0001282659,0.0001032715,0.000914901,0.00006457512,0.00007020916,0.0001275439,0.0001012914,0.5463002,0.001576219,0.4490506,0.001508767,0.00005402348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1849956,0.004163957,0.7658851,0.01545807,0.000283999,0.0004742898,0.001523774,0.00140811,0.02580715],"genre_scores_gemma":[0.8566585,0.002345732,0.1295312,0.002025887,0.0007937924,0.001164263,0.00136513,0.000960134,0.005155382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01920727,"threshold_uncertainty_score":0.101579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06558652675906523,"score_gpt":0.2789850136981461,"score_spread":0.2133984869390809,"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."}}