{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172488,0.0002072863,0.000242003,0.00007966199,0.0003437218,0.0001055667,0.001710633,0.00005523039,0.000004717576],"category_scores_gemma":[0.00006468164,0.0001422582,0.00007489009,0.00125345,0.000532173,0.000599229,0.0001943568,0.0003235595,0.000009669332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007151218,"about_ca_system_score_gemma":0.00008939398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005599774,"about_ca_topic_score_gemma":0.000225103,"domain_scores_codex":[0.9978496,0.0001887739,0.0003065348,0.0004808355,0.000679498,0.0004946881],"domain_scores_gemma":[0.9978843,0.0003451304,0.0001713877,0.001213412,0.0002756008,0.0001101621],"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.0001363337,0.0001476144,0.001810722,0.000008348952,0.00001332528,0.00002310477,0.0001436809,0.00009036104,0.0001141328,0.9957759,0.0003315981,0.001404861],"study_design_scores_gemma":[0.0007321879,0.0002975626,0.004442703,0.000028304,0.00000469757,0.00000571949,0.00004732074,0.004164874,0.002506892,0.9827144,0.004832183,0.0002231525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7891937,0.000432746,0.2006225,0.0004245121,0.002120731,0.0006106917,0.00002208121,0.0002256566,0.006347318],"genre_scores_gemma":[0.9970928,0.00001638548,0.002510954,0.00002129759,0.00004685286,0.0000253033,0.000003789584,0.00001947833,0.0002631065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2078991,"threshold_uncertainty_score":0.5801121,"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."}}