{"id":"W75080855","doi":"","title":"The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Vertex (graph theory); Combinatorics; Graph; Set (abstract data type); Integer (computer science); Discrete mathematics; Planar graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000133905,0.0002219592,0.0002158967,0.0006868623,0.0007719102,0.001203428,0.0005423677,0.0005228678,0.005511231],"category_scores_gemma":[0.001414384,0.000194398,0.0002058904,0.000752806,0.0007521302,0.001385165,0.0007146877,0.0007495183,0.0006815357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004378763,"about_ca_system_score_gemma":0.0002102492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006885857,"about_ca_topic_score_gemma":0.0008888845,"domain_scores_codex":[0.9997993,0.0000480108,0.00001110516,0.00004949053,0.0000471036,0.00004508073],"domain_scores_gemma":[0.998958,0.0004648845,0.0002292021,0.00009973414,0.00008279906,0.0001653378],"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.0003366028,0.00007074748,0.002536847,0.0001500909,0.00002437406,0.0009487636,0.0004424582,0.009183711,0.01366018,0.9414122,0.005989494,0.02524455],"study_design_scores_gemma":[0.00007331945,0.000121073,0.003095871,0.00004480091,0.00004436244,0.001598586,0.0005254665,0.05836421,0.006089853,0.9131981,0.01681341,0.0000310034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8250245,0.0003468505,0.05413432,0.0008264726,0.0001309311,0.00004057991,0.0008056917,0.0002382066,0.1184525],"genre_scores_gemma":[0.9790557,0.0001838154,0.01100446,0.0001020005,0.00006055694,0.0000295704,0.0004939653,0.00004191825,0.0090281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005511231,"threshold_uncertainty_score":0.01843691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00849990397534381,"score_gpt":0.2532728140834457,"score_spread":0.2447729101081018,"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."}}