{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006771366,0.002576981,0.001443998,0.001687148,0.002761844,0.003701782,0.008415476,0.003550001,0.004434233],"category_scores_gemma":[0.005911639,0.003834382,0.003304207,0.003988135,0.00382963,0.004127075,0.007864485,0.004502425,0.003462326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001325071,"about_ca_system_score_gemma":0.002424061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001299421,"about_ca_topic_score_gemma":0.001989621,"domain_scores_codex":[0.9772522,0.001164328,0.004567533,0.004307773,0.006824048,0.00588408],"domain_scores_gemma":[0.9822287,0.004033731,0.004135962,0.005963638,0.0007844864,0.00285348],"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.001511111,0.0009955911,0.00007405176,0.002692233,0.001798189,0.002285137,0.008535788,0.003951317,0.001715689,0.9386195,0.03418941,0.003632016],"study_design_scores_gemma":[0.005177246,0.003226317,0.0001739909,0.004520784,0.00168194,0.002487808,0.005589656,0.7563269,0.1723029,0.03997679,0.004193119,0.004342553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9045091,0.003206871,0.02686277,0.00121221,0.003759875,0.0004718143,0.001486806,0.001019962,0.05747054],"genre_scores_gemma":[0.958346,0.001157931,0.0316132,0.00130616,0.002142475,0.001953559,0.001155163,0.001577368,0.0007481469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8986427,"threshold_uncertainty_score":0.9988814,"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."}}