{"id":"W826208409","doi":"","title":"The linear t-arboricity of complete bipartite graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Bipartite graph; Dense graph; Complete bipartite graph; Combinatorics; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Planar graph","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.000426392,0.0002864917,0.0003176465,0.0009288069,0.0008494747,0.001876603,0.0006016154,0.0007671801,0.01059404],"category_scores_gemma":[0.004905396,0.0003579642,0.0004978686,0.00118663,0.001616244,0.002690644,0.001041027,0.001609076,0.00155183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005871534,"about_ca_system_score_gemma":0.0004197161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009131713,"about_ca_topic_score_gemma":0.001252463,"domain_scores_codex":[0.9994672,0.0001878913,0.00002998364,0.0001265588,0.00009953132,0.00008890749],"domain_scores_gemma":[0.9957918,0.002603095,0.0005806981,0.0003789334,0.0003174028,0.0003280396],"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.0001589304,0.00005518714,0.00160169,0.0001981221,0.00003188986,0.0003762656,0.0003531495,0.00619146,0.004195607,0.9510873,0.009360522,0.02638978],"study_design_scores_gemma":[0.00002553908,0.00003213014,0.0006845762,0.00002971652,0.00001573209,0.0003524641,0.0001130716,0.01531188,0.001093121,0.9782248,0.004106962,0.00001005702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5775509,0.001461567,0.1693195,0.004117873,0.0002941656,0.0001182957,0.002378572,0.0005277515,0.2442313],"genre_scores_gemma":[0.9644109,0.0009006236,0.01544613,0.0005555114,0.0003045405,0.0001157607,0.001179417,0.0001125271,0.01697456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01059404,"threshold_uncertainty_score":0.03544062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02636395996074221,"score_gpt":0.2948282829023085,"score_spread":0.2684643229415663,"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."}}