{"id":"W132858928","doi":"","title":"Distance between two k-sets and Path-Systems Extendibility.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Vertex (graph theory); Graph; Induced path; Disjoint sets; Path (computing); Connectivity; Bound graph; Discrete mathematics; Distance; Graph power; Shortest path problem; Line 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.0004572306,0.000197289,0.0003318849,0.00004627138,0.0002546428,0.00006491334,0.0002041968,0.00009324114,0.00001253023],"category_scores_gemma":[0.0001002243,0.0001656399,0.00006336392,0.0001247896,0.0001509139,0.0001029551,0.0001177043,0.0001694453,0.000004255133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003745023,"about_ca_system_score_gemma":0.0000119322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001019763,"about_ca_topic_score_gemma":0.000008121409,"domain_scores_codex":[0.9986541,0.0001255921,0.0003584685,0.0003237601,0.0002488413,0.0002892317],"domain_scores_gemma":[0.9987047,0.0004926108,0.0001362968,0.0005282274,0.00005871243,0.00007939216],"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.000006860078,0.00003645831,0.05618413,0.00006724153,0.00001932863,0.000008651155,0.0001466053,5.57559e-7,0.00001781915,0.9414068,0.001617687,0.0004878614],"study_design_scores_gemma":[0.0007028211,0.00003541846,0.02591071,0.00003519332,0.00003372729,0.000005721491,0.0000392208,0.00003946292,0.00007300827,0.9701845,0.002736316,0.0002038762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890989,0.0006866203,0.0001339239,0.0000356333,0.001265491,0.0002617195,0.0000282697,0.0001156338,0.008373819],"genre_scores_gemma":[0.9990434,0.00000830608,0.0005015149,0.00001274626,0.00004598045,0.00001542611,0.000008625439,0.00002953164,0.0003344687],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03027342,"threshold_uncertainty_score":0.6754598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01747837690461657,"score_gpt":0.2805900898952599,"score_spread":0.2631117129906433,"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."}}