{"id":"W2559261669","doi":"","title":"Rainbow K-Connection in Dense Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Rainbow; Multipartite; Bipartite graph; Vertex (graph theory); Edge coloring; Discrete mathematics; Graph; Connection (principal bundle); Graph power; Line graph; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003977028,0.0003088494,0.0008937104,0.0004374266,0.0002127067,0.0001271656,0.0003779189,0.0002281281,0.000005189138],"category_scores_gemma":[0.002675031,0.0002593084,0.000206003,0.0004607009,0.0001182408,0.0002364634,0.0002448619,0.0006365541,8.444734e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001250243,"about_ca_system_score_gemma":0.0001341947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009674048,"about_ca_topic_score_gemma":0.000001077211,"domain_scores_codex":[0.9970786,0.0002415347,0.001359597,0.000210528,0.0007438554,0.000365885],"domain_scores_gemma":[0.9964765,0.001294649,0.001077663,0.0002754515,0.0005948032,0.0002809312],"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.0001685609,0.0003608555,0.000712865,0.0001137767,0.00007133958,0.0000540004,0.003937996,0.00001526745,0.00006868291,0.9933388,0.0004703515,0.000687489],"study_design_scores_gemma":[0.005724705,0.0005932769,0.0001104541,0.0002667502,0.00007450145,0.0002712754,0.001326734,0.0008462708,0.0002627552,0.9899291,0.0003170942,0.0002771112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9807495,0.0002683985,0.00092692,0.00007838645,0.01617325,0.0002400889,8.533157e-7,0.00003752653,0.001525051],"genre_scores_gemma":[0.9911307,0.00002080218,0.007816157,0.00002361964,0.0009585202,0.000001484499,4.27588e-7,0.00004138246,0.000006977602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01521473,"threshold_uncertainty_score":0.9999859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02971354290033515,"score_gpt":0.2851789709057531,"score_spread":0.255465428005418,"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."}}