{"id":"W2067443412","doi":"10.1016/j.disc.2008.03.009","title":"Vertex arboricity of integer distance graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Arboricity; Combinatorics; Vertex (graph theory); Mathematics; Graph; Integer (computer science); Discrete mathematics; Planar graph; Computer science","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.0002389417,0.0003147457,0.0002979539,0.001197924,0.0008418598,0.001670216,0.0005382487,0.0004261112,0.0103232],"category_scores_gemma":[0.00236486,0.0001888489,0.000250181,0.001339305,0.0006646807,0.001392952,0.0005487321,0.0006725079,0.001491593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007939583,"about_ca_system_score_gemma":0.0003838062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001940384,"about_ca_topic_score_gemma":0.001961414,"domain_scores_codex":[0.999667,0.00006113883,0.00001807567,0.00009852747,0.0000814975,0.00007365867],"domain_scores_gemma":[0.9980569,0.0008988536,0.0003715066,0.0001484077,0.000283188,0.0002410926],"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.0006211906,0.0001011316,0.00943025,0.0003957093,0.00004019636,0.001025674,0.0007517339,0.02486428,0.009618914,0.8713704,0.02038093,0.06139952],"study_design_scores_gemma":[0.00008387105,0.0001386415,0.006112521,0.0000740956,0.00005385252,0.001409957,0.0005959456,0.08316676,0.007449209,0.8760047,0.02487226,0.0000381012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7492185,0.0005248546,0.112109,0.001519285,0.0001296978,0.00008147842,0.004095958,0.0004988439,0.1318223],"genre_scores_gemma":[0.9562489,0.0004439052,0.02265779,0.0001699954,0.00008404305,0.00007246145,0.002929912,0.0001176861,0.01727546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0103232,"threshold_uncertainty_score":0.03453451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02157159271649036,"score_gpt":0.2563671469383798,"score_spread":0.2347955542218894,"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."}}