{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","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.0007217328,0.0004495102,0.0004735442,0.000345653,0.001232133,0.0005725051,0.002814988,0.0001293053,0.0003337088],"category_scores_gemma":[0.00009977603,0.0004808657,0.0002972925,0.001268943,0.0008910557,0.0007547776,0.0008608489,0.0006096874,0.0004271218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002545106,"about_ca_system_score_gemma":0.0002272249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002004641,"about_ca_topic_score_gemma":0.0001634976,"domain_scores_codex":[0.9962165,0.000408708,0.000669967,0.0009075195,0.001146125,0.0006511618],"domain_scores_gemma":[0.9968551,0.0004643177,0.0002786195,0.001603411,0.0004940961,0.0003044437],"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.00004270853,0.0006428002,0.0008195138,0.00001333632,0.00005067148,0.00002951287,0.0002915214,0.004361331,0.000007041414,0.9629222,0.002366434,0.02845296],"study_design_scores_gemma":[0.0006396559,0.0001828208,0.1259772,0.00003774135,0.000007147258,0.0001007718,0.00001450597,0.1948216,0.00001556448,0.6665706,0.01120031,0.0004321259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06267783,0.000181777,0.8619535,0.004733219,0.0008990005,0.0004649397,0.00004731732,0.0009271543,0.06811523],"genre_scores_gemma":[0.8867108,0.0000180495,0.110293,0.002355319,0.0001667368,0.00003213519,0.00019547,0.00002607075,0.0002024704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8240329,"threshold_uncertainty_score":0.9997643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1246287817561772,"score_gpt":0.3159649090989075,"score_spread":0.1913361273427303,"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."}}