{"id":"W2928599599","doi":"10.1007/s00037-021-00210-5","title":"Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity","year":2021,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nondeterministic algorithm; Hierarchy; Randomness; Theoretical computer science; Boolean function; Product term; Boolean expression; Computer science; Mathematics; Communication complexity; Discrete mathematics; Parity function; Standard Boolean model; And-inverter graph; Two-element Boolean algebra; Algebra over a field","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0007422192,0.0001822391,0.0005500379,0.0001087012,0.0002594299,0.0002903056,0.0005415565,0.00005172587,0.000022888],"category_scores_gemma":[0.0001933689,0.0001874339,0.00009215385,0.0004441915,0.0006293365,0.0003378831,0.0004672543,0.0002259942,0.00001799487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005454835,"about_ca_system_score_gemma":0.0001460452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000955202,"about_ca_topic_score_gemma":0.0001593901,"domain_scores_codex":[0.9976573,0.0007537387,0.0005665838,0.0004532688,0.0003250272,0.0002441043],"domain_scores_gemma":[0.9981287,0.0008419682,0.0001604228,0.0005192513,0.0002439247,0.000105766],"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.0002590223,0.0001288756,0.000774685,0.000046145,0.00002044518,0.00003479195,0.000630277,0.001947536,0.00001405671,0.9922927,0.0002448172,0.003606644],"study_design_scores_gemma":[0.01213792,0.00001148597,0.03887779,0.00005977343,0.000004185809,0.00007593848,0.00003487631,0.4607395,0.0000110355,0.487313,0.0005516874,0.0001828045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114709,0.001119937,0.8781033,0.003226183,0.0001930406,0.0004105409,0.00006512937,0.0001554021,0.005255595],"genre_scores_gemma":[0.9075318,0.00001785591,0.09174912,0.0003988302,0.00002216697,0.00002856488,0.0001808156,0.000006800817,0.00006405622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7960609,"threshold_uncertainty_score":0.7643333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04733840846881324,"score_gpt":0.2910149454861005,"score_spread":0.2436765370172872,"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."}}