{"id":"W102410762","doi":"","title":"Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; 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.0004660111,0.000491784,0.0003923104,0.001921169,0.001716887,0.002403896,0.0009359086,0.00157077,0.008180076],"category_scores_gemma":[0.005967828,0.0006258496,0.0005299834,0.00214463,0.002070252,0.00514165,0.002029622,0.001158889,0.001492868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00101086,"about_ca_system_score_gemma":0.0005665154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168316,"about_ca_topic_score_gemma":0.002747708,"domain_scores_codex":[0.9993885,0.0001811389,0.0000548312,0.0001532815,0.0001057134,0.0001165899],"domain_scores_gemma":[0.9955048,0.002409694,0.0009630169,0.0004188194,0.0003215134,0.0003821746],"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.0002150634,0.00003886256,0.001746108,0.0003010957,0.0000306606,0.0006678985,0.0008619755,0.007671126,0.003035851,0.947466,0.003937361,0.0340281],"study_design_scores_gemma":[0.00001955962,0.00002811848,0.0005683252,0.00008626316,0.00002608244,0.0004598296,0.0003639328,0.009102816,0.001794319,0.9770575,0.01046958,0.00002365471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6111865,0.004369687,0.2953435,0.002158311,0.0003398689,0.0002095149,0.001975355,0.001013308,0.08340383],"genre_scores_gemma":[0.9054117,0.002262609,0.06015404,0.0003483477,0.0001349961,0.0002488608,0.001387515,0.000276242,0.02977584],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008180076,"threshold_uncertainty_score":0.02736509,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02411753286254315,"score_gpt":0.2860400059407764,"score_spread":0.2619224730782332,"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."}}