{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002517617,0.0008678582,0.0009994769,0.0006741973,0.002566863,0.003134274,0.003220668,0.003066893,0.009567602],"category_scores_gemma":[0.01499049,0.000451579,0.001705172,0.0008748732,0.002839462,0.01219049,0.004803854,0.005763254,0.001953002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310166,"about_ca_system_score_gemma":0.002037832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001249637,"about_ca_topic_score_gemma":0.001218822,"domain_scores_codex":[0.9972705,0.000746134,0.0000805359,0.000734265,0.0005831393,0.0005854166],"domain_scores_gemma":[0.9916906,0.004223601,0.0006475391,0.002582764,0.000452398,0.0004031439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001075697,0.0001205404,0.0006724625,0.0001768073,0.00003159805,0.0001064962,0.000243325,0.02440135,0.002030212,0.9153723,0.0100677,0.04666961],"study_design_scores_gemma":[0.00002621385,0.00006270555,0.0002828387,0.00004268243,0.00002468588,0.0001871772,0.0001260404,0.147467,0.004560771,0.8301309,0.01705915,0.00002977333],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.03452132,0.0003442312,0.9306086,0.006261153,0.0002594144,0.0001644878,0.0002047255,0.0005511955,0.02708496],"genre_scores_gemma":[0.6041505,0.000712117,0.3572952,0.002051259,0.0005598532,0.0004311886,0.0006282029,0.0003746713,0.03379696],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9904324,"threshold_uncertainty_score":0,"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."}}