{"id":"W6995946243","doi":"","title":"On the pseudo-deterministic query complexity of NP search problems","year":2021,"lang":"en","type":"other","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Randomized algorithm; Computational complexity theory; Contrast (vision); Time complexity; Upper and lower bounds; Query optimization; Average-case complexity; Resolution (logic)","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.01879418,0.001959902,0.00293955,0.00258128,0.003250929,0.009237358,0.004955621,0.003498217,0.008840366],"category_scores_gemma":[0.1279116,0.001690171,0.003517806,0.004461324,0.01018272,0.01874347,0.007146405,0.01181741,0.00162549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008855559,"about_ca_system_score_gemma":0.006564716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004572675,"about_ca_topic_score_gemma":0.003531524,"domain_scores_codex":[0.9701592,0.01460574,0.001420398,0.004140439,0.00666628,0.003007801],"domain_scores_gemma":[0.6864424,0.2829679,0.005744603,0.01810896,0.004427873,0.002308321],"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.001338952,0.0005284005,0.004457391,0.00100882,0.0003043617,0.0001897804,0.0007655091,0.3069159,0.004031367,0.6274197,0.01273859,0.04030119],"study_design_scores_gemma":[0.0001565553,0.000103557,0.0009498503,0.00009323913,0.00007864659,0.0001300047,0.0001111617,0.4848598,0.001510299,0.5094628,0.002483728,0.00006026289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1632958,0.00567202,0.7557571,0.02173399,0.0003993991,0.000562924,0.002516506,0.002148609,0.04791375],"genre_scores_gemma":[0.8113127,0.003136237,0.1676179,0.003022661,0.001015967,0.001356762,0.00224314,0.001607459,0.00868711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01879418,"threshold_uncertainty_score":0.09939432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07939784889433361,"score_gpt":0.2857925681241869,"score_spread":0.2063947192298533,"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."}}