{"id":"W1863587147","doi":"10.1016/j.tcs.2015.12.017","title":"Towards tight bounds on theta-graphs: More is not always better","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Discrete mathematics; Disjoint sets; Indifference graph; Matching (statistics); Graph","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.001646509,0.0002644155,0.000235729,0.0003888767,0.0004252992,0.0008067334,0.002349956,0.00007453858,0.00005284907],"category_scores_gemma":[0.00008801377,0.0002056759,0.0001133027,0.00184413,0.001498685,0.0008518922,0.0008278849,0.0002421301,0.0003182292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009673403,"about_ca_system_score_gemma":0.000345625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003612136,"about_ca_topic_score_gemma":2.41775e-7,"domain_scores_codex":[0.9963492,0.0001176761,0.0003211337,0.0009534606,0.001666948,0.0005916472],"domain_scores_gemma":[0.9978454,0.0001519722,0.00008073896,0.0009559585,0.0004444847,0.0005214637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001457796,0.00007497815,0.00002021055,0.0000025535,0.000006140733,0.00001141677,0.001016044,0.0008054794,0.0001847158,0.9349078,0.002089035,0.06086703],"study_design_scores_gemma":[0.0003833607,0.0004484418,0.0009613734,0.0000181377,0.000006055453,0.00004167921,0.000006661318,0.5700079,0.01799867,0.4050554,0.004732088,0.0003402608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06076636,0.00002515052,0.9136617,0.01351426,0.001406469,0.0001652251,0.000004071934,0.0002246666,0.01023215],"genre_scores_gemma":[0.8725687,0.000002012204,0.1144429,0.01261329,0.0002867559,0.000009386486,0.000002857211,0.000008995835,0.00006502329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8118024,"threshold_uncertainty_score":0.838722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279109794043746,"score_gpt":0.2792897733223311,"score_spread":0.2513787939179565,"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."}}