{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009912644,0.0003643416,0.0005075,0.0002040423,0.000557465,0.0004481146,0.002056507,0.0001448472,0.00008220033],"category_scores_gemma":[0.0002180989,0.0002777542,0.0003770685,0.0007207628,0.0005739649,0.0007070515,0.001006752,0.0005974331,0.0000934885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007186403,"about_ca_system_score_gemma":0.0002086428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002358334,"about_ca_topic_score_gemma":0.00002849011,"domain_scores_codex":[0.9967985,0.0001406562,0.001105449,0.0003624256,0.0008459907,0.0007470468],"domain_scores_gemma":[0.9965779,0.0007649618,0.0003584363,0.001590994,0.0005331209,0.0001745895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004854476,0.0007660399,0.0006065108,0.0008827992,0.0001908804,0.00001946536,0.009345456,0.0003940591,0.000169387,0.973199,0.004331269,0.01004659],"study_design_scores_gemma":[0.004112328,0.001275254,0.002761684,0.0008769995,0.00006941397,0.0004834393,0.002227114,0.7246692,0.01079696,0.2179222,0.03331781,0.001487665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3198226,0.00009847357,0.6494095,0.005436332,0.002305384,0.00243007,0.001117065,0.0004285996,0.01895197],"genre_scores_gemma":[0.9472359,0.00003465745,0.04959088,0.0023591,0.0001162708,0.0001122261,0.0001616629,0.00003594403,0.0003533849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7552769,"threshold_uncertainty_score":0.9999675,"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."}}