{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004447948,0.0001818555,0.0003435264,0.000297797,0.001406391,0.00006275986,0.003621562,0.0000178108,0.00002598205],"category_scores_gemma":[0.0000734505,0.0002065468,0.0002011512,0.001296554,0.0001906005,0.0003200929,0.004891952,0.0004097637,7.352941e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000452919,"about_ca_system_score_gemma":0.00007011027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001745335,"about_ca_topic_score_gemma":5.143619e-7,"domain_scores_codex":[0.9966741,0.001100782,0.0005514801,0.0004938666,0.0006981072,0.0004817146],"domain_scores_gemma":[0.9972322,0.001270512,0.0003637007,0.0009646475,0.0000796626,0.00008927779],"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.0000227035,0.0001398189,0.000401538,0.00001212294,0.00002485446,0.00001489711,0.007850339,0.02373123,0.0008103521,0.834599,0.00001049906,0.1323827],"study_design_scores_gemma":[0.000578666,0.0003363678,0.005529802,0.00001472189,0.000005551722,0.0001316006,0.001488417,0.2863234,0.002402053,0.7027217,0.000200626,0.0002670817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4379793,0.000110117,0.5606174,0.0002380921,0.000383898,0.00009488453,0.000001863094,0.0002182668,0.0003560911],"genre_scores_gemma":[0.898899,8.048049e-7,0.10056,0.0004584671,0.00005055041,0.000005980109,0.000001293165,0.000008691906,0.00001518851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4609197,"threshold_uncertainty_score":0.9998937,"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."}}