{"id":"W4285230523","doi":"10.4086/toc.2022.v018a019","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Rank (graph theory); Communication complexity; Combinatorics; Context (archaeology); Sign (mathematics); Dimension (graph theory); Discrete mathematics; Boolean function; Connection (principal bundle); Matrix (chemical analysis); VC dimension; Computational complexity theory; Omega; Algorithm","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002176636,0.0006391747,0.0007652919,0.001166882,0.001424036,0.003476208,0.001141565,0.001551609,0.006631205],"category_scores_gemma":[0.01724405,0.0003409515,0.00062906,0.001579815,0.005830777,0.009161768,0.003905929,0.004423991,0.001364316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140734,"about_ca_system_score_gemma":0.001388494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000367853,"about_ca_topic_score_gemma":0.0003920141,"domain_scores_codex":[0.9956701,0.001159099,0.0002757096,0.0006894499,0.001704341,0.0005013655],"domain_scores_gemma":[0.9832886,0.008541809,0.001858084,0.003079623,0.00209459,0.001137347],"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.00009703802,0.0000328752,0.000565916,0.00006246023,0.000006953309,0.00005233092,0.0001511095,0.001774136,0.001699067,0.975921,0.00313796,0.01649916],"study_design_scores_gemma":[0.00001487387,0.00007000348,0.0004646238,0.0000266159,0.000007900546,0.0002955636,0.00009111899,0.01116159,0.002414439,0.9751136,0.01030573,0.00003380024],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1448111,0.002732001,0.7377622,0.01632595,0.0008552168,0.0001574203,0.001310707,0.0006190424,0.0954264],"genre_scores_gemma":[0.9019286,0.00132317,0.08376203,0.001463481,0.001008009,0.0001903601,0.0007688195,0.0001671006,0.009388415],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9933688,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0219599547056952,"score_gpt":0.2398138414644886,"score_spread":0.2178538867587934,"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."}}