{"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":"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.006264558,0.002908691,0.0012676,0.002137953,0.004835793,0.003991344,0.009550209,0.005767664,0.3789556],"category_scores_gemma":[0.006592025,0.005662359,0.005962656,0.005441731,0.007549702,0.004959309,0.007744431,0.005718908,0.00464545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007997797,"about_ca_system_score_gemma":0.00426262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002903951,"about_ca_topic_score_gemma":0.00269565,"domain_scores_codex":[0.9706969,0.001684843,0.005952951,0.005478082,0.008703144,0.007484027],"domain_scores_gemma":[0.9757306,0.005852637,0.006468466,0.007287117,0.0009004527,0.003760712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.003186709,0.001162293,0.00004502172,0.003844175,0.003841935,0.003426009,0.005923771,0.003611809,0.004023148,0.6636491,0.3044971,0.002789016],"study_design_scores_gemma":[0.004557255,0.004135959,0.0001317464,0.004140978,0.003147627,0.004157597,0.004562283,0.06352818,0.8957286,0.007122524,0.003606395,0.005180802],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4557306,0.003719467,0.01764201,0.001301896,0.006088381,0.0002072695,0.001393197,0.000909136,0.513008],"genre_scores_gemma":[0.9697515,0.003978823,0.011912,0.002379225,0.00337864,0.003263566,0.002006494,0.002576144,0.0007536357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8917055,"threshold_uncertainty_score":0.9983644,"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."}}