{"id":"W7548172","doi":"10.4086/toc.2010.v006a009","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Communication complexity; Combinatorics; Mathematics; Nondeterministic algorithm; Function (biology); Logarithm; Discrete mathematics; Upper and lower bounds; Binary logarithm","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.003320808,0.0002169364,0.0003579607,0.0002375641,0.0004028995,0.0001201405,0.003067162,0.00007923182,0.000008583661],"category_scores_gemma":[0.0002571978,0.00021219,0.0001887597,0.0007521986,0.0004360728,0.0005437253,0.001212338,0.0005877317,0.000002976894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005750886,"about_ca_system_score_gemma":0.00005643841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560069,"about_ca_topic_score_gemma":0.000007949772,"domain_scores_codex":[0.9977991,0.0002530733,0.0005547248,0.0004850421,0.0004028883,0.000505178],"domain_scores_gemma":[0.9965962,0.001498382,0.0003162331,0.001258772,0.0001833076,0.0001471582],"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.000008156063,0.00007630105,0.0007716707,0.00001320146,0.00001531558,0.000005192231,0.002871975,0.0002065585,0.02185524,0.7762758,0.000002607774,0.197898],"study_design_scores_gemma":[0.0004900583,0.0001058489,0.02560383,0.00003711264,0.000005441742,0.00008606546,0.0001568569,0.1475608,0.03636756,0.7892302,0.00007171615,0.0002844845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4976472,0.00001589438,0.5007268,0.0001668253,0.0006322138,0.00006945472,4.354391e-7,0.0002216027,0.0005195396],"genre_scores_gemma":[0.7083189,6.118554e-7,0.2913764,0.000167431,0.0001223138,8.752845e-7,3.884194e-7,0.000006861101,0.00000611102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2106717,"threshold_uncertainty_score":0.8652857,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01467507942114589,"score_gpt":0.2465031238987778,"score_spread":0.2318280444776319,"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."}}