{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018075,0.0004824946,0.0006153138,0.00321672,0.001597346,0.002292641,0.001160754,0.000965491,0.005499405],"category_scores_gemma":[0.006361611,0.0003907253,0.0007165249,0.002632219,0.003125183,0.004465768,0.003103973,0.001349342,0.0006828272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001326908,"about_ca_system_score_gemma":0.0004026186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007113296,"about_ca_topic_score_gemma":0.0005150054,"domain_scores_codex":[0.9986795,0.0002879955,0.0001361553,0.0004108333,0.0003144884,0.0001709324],"domain_scores_gemma":[0.9941766,0.003357108,0.000978005,0.0004353324,0.0004057393,0.0006471621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002953256,0.00006520516,0.004908504,0.0002329701,0.00006361504,0.0004570016,0.001492106,0.01172617,0.00190476,0.9468694,0.001803359,0.03018149],"study_design_scores_gemma":[0.00003979429,0.0001586888,0.002782929,0.00007417484,0.00003599368,0.0008158638,0.0004334171,0.01921042,0.001250264,0.9647967,0.01035766,0.00004409243],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8100017,0.001999161,0.1205912,0.001270235,0.0001836677,0.0000954649,0.001468975,0.0003437686,0.06404571],"genre_scores_gemma":[0.9690652,0.0004197991,0.02516818,0.00009820021,0.0001130547,0.00007697407,0.0007738093,0.00003371913,0.004251075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005499405,"threshold_uncertainty_score":0.01839733,"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."}}