{"id":"W1853166665","doi":"10.1007/978-3-642-54423-1_10","title":"Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Spanning tree; Integer (computer science); Mathematics; Computer science; 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.002672231,0.00296823,0.00213451,0.004232333,0.001394136,0.003744883,0.005134411,0.002091039,0.02001788],"category_scores_gemma":[0.02384495,0.001444294,0.001444836,0.005041655,0.002261533,0.007986959,0.003769417,0.005126899,0.003463652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002111238,"about_ca_system_score_gemma":0.0006993262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007508261,"about_ca_topic_score_gemma":0.001179098,"domain_scores_codex":[0.9976841,0.0006044082,0.0000867764,0.0005181351,0.0006674148,0.0004390416],"domain_scores_gemma":[0.9790751,0.01647947,0.000892892,0.001475387,0.0009640038,0.001113157],"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.0008044995,0.0003043953,0.002234706,0.001435623,0.0002467933,0.0003342041,0.0005282345,0.1015648,0.01831246,0.7243778,0.02624474,0.1236119],"study_design_scores_gemma":[0.00006033942,0.0001359404,0.001919134,0.0002515478,0.0001620963,0.0006725275,0.0002177835,0.177574,0.004828834,0.8047126,0.009398513,0.00006664344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2506769,0.01679661,0.4962794,0.005358886,0.000752416,0.000263353,0.003124649,0.002306115,0.2244418],"genre_scores_gemma":[0.8181799,0.0113109,0.1398606,0.001490853,0.001584744,0.0005714962,0.003234016,0.001862073,0.02190545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02001788,"threshold_uncertainty_score":0.06696641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02470718623155525,"score_gpt":0.2757769881116598,"score_spread":0.2510698018801045,"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."}}