{"id":"W2081110589","doi":"10.1016/j.disc.2015.01.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Honjo International Scholarship Foundation","keywords":"Combinatorics; Mathematics; Degree (music); Spanning tree; Minimum degree spanning tree; Connected dominating set; Vertex (graph theory); Graph; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008247179,0.001577456,0.001291352,0.002189265,0.001050181,0.005457659,0.003125143,0.001592241,0.6795534],"category_scores_gemma":[0.005115353,0.001060352,0.001019799,0.004121779,0.0006789368,0.005064105,0.002668903,0.002583063,0.5894837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002526329,"about_ca_system_score_gemma":0.001323816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007581614,"about_ca_topic_score_gemma":0.009793503,"domain_scores_codex":[0.999458,0.00008705687,0.00005528507,0.00009722005,0.0002354475,0.00006699556],"domain_scores_gemma":[0.9977003,0.0006222925,0.0001337652,0.0005249759,0.0007547015,0.0002639859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004924717,0.00002592882,0.000139573,0.0001743091,0.000006608927,0.00003355855,0.00006956312,0.0002952633,0.0008586074,0.01848733,0.9480393,0.03182062],"study_design_scores_gemma":[0.00004430362,0.00001314437,0.0006756755,0.00007077073,0.000006397527,0.0001163817,0.0000607113,0.002214867,0.002806577,0.02397655,0.9699827,0.00003202637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001963601,0.0003868376,0.1291307,0.005643674,0.001457415,0.0003937147,0.1940267,0.1472623,0.519735],"genre_scores_gemma":[0.02745795,0.001562337,0.1134341,0.002357637,0.0009647413,0.0007709911,0.2410293,0.1275356,0.4848874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6795534,"threshold_uncertainty_score":0.4570781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03484990926391326,"score_gpt":0.2770893809379679,"score_spread":0.2422394716740546,"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."}}