{"id":"W4411687204","doi":"10.61091/um123-09","title":"Path-systems in regular graphs and bipartite graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Path (computing); Chordal graph; Longest path problem; Discrete mathematics; Graph; Computer science; Computer network","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.001116097,0.001004798,0.0007971522,0.001980225,0.002394173,0.002598652,0.001427613,0.00134219,0.01551903],"category_scores_gemma":[0.003061528,0.000823478,0.00114547,0.003915153,0.002617568,0.005528169,0.002503371,0.002070948,0.00170418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186133,"about_ca_system_score_gemma":0.0008698749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066878,"about_ca_topic_score_gemma":0.0018568,"domain_scores_codex":[0.9983962,0.0003566182,0.0001189643,0.0006266994,0.0002349062,0.00026654],"domain_scores_gemma":[0.9972549,0.001179421,0.0005445498,0.0003273676,0.0003172353,0.0003765937],"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.0001364646,0.0000712048,0.0007667242,0.0001646979,0.00002782286,0.0002467207,0.0005353353,0.007481421,0.002119008,0.9711127,0.003825504,0.01351254],"study_design_scores_gemma":[0.00004796413,0.00005338761,0.0005160304,0.0000291576,0.00002525339,0.000213659,0.0002161528,0.0218558,0.001118576,0.9675264,0.008371693,0.00002590226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3649766,0.0008195473,0.5594462,0.001597218,0.0003054182,0.0003989947,0.003888838,0.001781326,0.06678598],"genre_scores_gemma":[0.8248816,0.0007711619,0.1361015,0.0007001682,0.0002931037,0.0006648858,0.005223344,0.0003933311,0.03097102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01551903,"threshold_uncertainty_score":0.0519163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02565338256795302,"score_gpt":0.2986187748509654,"score_spread":0.2729653922830124,"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."}}