{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.003110102,0.001728195,0.001414939,0.001655555,0.001301502,0.003168692,0.001943293,0.001556763,0.01327339],"category_scores_gemma":[0.01977351,0.0008093304,0.001066167,0.002234929,0.001862949,0.01121202,0.002442483,0.003109092,0.001950637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633915,"about_ca_system_score_gemma":0.0007744326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009538734,"about_ca_topic_score_gemma":0.001410791,"domain_scores_codex":[0.9974324,0.0007565444,0.00009693293,0.0004797556,0.0005703898,0.0006640381],"domain_scores_gemma":[0.9885324,0.006977972,0.001080421,0.001895073,0.000751542,0.0007625469],"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.0008455239,0.0003239738,0.00486889,0.001040351,0.0002531179,0.0002990712,0.0003902774,0.1313229,0.01439351,0.6846283,0.03432234,0.1273118],"study_design_scores_gemma":[0.000067847,0.0002069652,0.002186406,0.0002333831,0.0001079548,0.0007405174,0.0003691048,0.1370068,0.005072394,0.8366683,0.01728071,0.0000594722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3572111,0.03491267,0.4637974,0.01827321,0.00131118,0.0001111809,0.001940093,0.001838947,0.1206044],"genre_scores_gemma":[0.9020146,0.00646697,0.08231663,0.002527785,0.0006715013,0.000103505,0.0008767075,0.0006335141,0.004388781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01327339,"threshold_uncertainty_score":0.04440391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05157835567815482,"score_gpt":0.3078867761724915,"score_spread":0.2563084204943367,"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."}}