{"id":"W4406203420","doi":"10.61091/jcmcc123-14","title":"Analyzing Pathway Energy And Time Complexity In Flower Families Through Vertex-Disjoint Paths","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Computer science; Vertex (graph theory); Computational complexity theory; Graph; Theoretical computer science; Graph theory; Strongly connected component; Connected component; Algorithm; Combinatorics; Mathematics; Artificial intelligence","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.00104169,0.0005312787,0.0005512226,0.001168111,0.0006636651,0.0009648128,0.001187265,0.0007904642,0.003568498],"category_scores_gemma":[0.009316995,0.0003032433,0.0007760119,0.001066434,0.0007476085,0.002162969,0.0008707507,0.0006853624,0.0002119826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001472795,"about_ca_system_score_gemma":0.001187111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003817886,"about_ca_topic_score_gemma":0.005778377,"domain_scores_codex":[0.9994574,0.0001700822,0.00001860107,0.0001555033,0.0001131058,0.00008533611],"domain_scores_gemma":[0.9939218,0.004632279,0.0004516223,0.0005417163,0.0002372259,0.0002153566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000280143,0.0001299858,0.007580687,0.0002140033,0.00007509785,0.0001769432,0.0001792715,0.906619,0.006149165,0.04603519,0.001740859,0.03081979],"study_design_scores_gemma":[0.00001359834,0.00005874707,0.0009796661,0.00000852898,0.00001601035,0.00008351832,0.00007082344,0.95984,0.00138852,0.03707965,0.0004509366,0.00001004732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7825591,0.0004287548,0.2093597,0.0003985803,0.00002405646,0.0001137821,0.0009624492,0.0004949681,0.0056586],"genre_scores_gemma":[0.9186054,0.0002193218,0.07846762,0.00004262559,0.000009477011,0.0001211089,0.0009923746,0.0001091804,0.001432935],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003817886,"threshold_uncertainty_score":0.0119378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01499193588469321,"score_gpt":0.2569693946950782,"score_spread":0.241977458810385,"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."}}