{"id":"W7145951013","doi":"","title":"Path Cover Problems withLength Cost","year":2022,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Path (computing); Longest path problem; Minimum weight; Widest path problem; Induced path; Vertex (graph theory); Cardinality (data modeling); Cover (algebra)","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004482581,0.000228487,0.0002005118,0.0001419824,0.002195443,0.0003148025,0.001384067,0.00003549161,0.0001329155],"category_scores_gemma":[0.0001001352,0.0002340077,0.0001055433,0.0008700496,0.0002904611,0.001458164,0.00186425,0.0004670567,0.00006053286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003074066,"about_ca_system_score_gemma":0.0006595299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002918626,"about_ca_topic_score_gemma":0.00001490991,"domain_scores_codex":[0.9972175,0.000125383,0.0003823547,0.0006838859,0.001196118,0.0003947314],"domain_scores_gemma":[0.9983551,0.00013288,0.0001551661,0.001030487,0.0001598476,0.0001665486],"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.00003158309,0.0003769982,0.001089981,0.00004878763,0.00005555499,0.0004663233,0.0003795931,0.00461395,0.0006446281,0.9742675,0.01520278,0.002822304],"study_design_scores_gemma":[0.000638766,0.0001607803,0.0009223709,0.00006623827,0.0000142784,0.0009748559,0.00005697936,0.02459602,0.0007420903,0.005728674,0.9656091,0.0004898254],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01232646,0.001255603,0.9420654,0.001645343,0.015295,0.001143939,0.002088932,0.0009462889,0.02323303],"genre_scores_gemma":[0.9313132,0.00006803573,0.06263382,0.001234975,0.001215401,0.0007275204,0.001074986,0.00002976716,0.001702292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9685388,"threshold_uncertainty_score":0.9991035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02366442485002743,"score_gpt":0.2403529839601594,"score_spread":0.216688559110132,"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."}}