{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002455509,0.0005159687,0.0005862041,0.001002875,0.0004244334,0.0003986047,0.005290764,0.0002347568,0.0000477841],"category_scores_gemma":[0.0003335318,0.0003477208,0.0002422968,0.00093652,0.003235599,0.0003014103,0.001163846,0.00116426,0.000036612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001107158,"about_ca_system_score_gemma":0.0004738152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005695451,"about_ca_topic_score_gemma":0.000009644154,"domain_scores_codex":[0.995726,0.0001482441,0.0005655656,0.001304227,0.001514281,0.0007417029],"domain_scores_gemma":[0.9942788,0.002524395,0.0003862491,0.002307208,0.0003599475,0.0001434383],"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.00001000186,0.00001427465,0.0000336503,0.00001651113,0.00001869093,0.00001381317,0.0005226218,0.01096192,0.0006830127,0.8712774,0.00001894247,0.1164292],"study_design_scores_gemma":[0.0002115667,0.0003243036,0.00007334953,0.0003475363,0.000006321739,0.00003356182,4.913745e-7,0.2008097,0.004819701,0.7920001,0.0009315035,0.0004418709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003411533,0.0001460497,0.9855472,0.001950414,0.000715857,0.0004787495,0.000004716373,0.00009152957,0.01072431],"genre_scores_gemma":[0.8603352,0.00003045925,0.1359821,0.00229021,0.0002319583,0.00002051199,0.000002887753,0.00005152147,0.001055186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.859994,"threshold_uncertainty_score":0.9998975,"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."}}