{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835657,0.00275186,0.003416704,0.003295386,0.00394811,0.00694415,0.00615574,0.006489326,0.03227061],"category_scores_gemma":[0.02259076,0.002253753,0.003399392,0.00970855,0.003947909,0.02270668,0.006557073,0.006911093,0.001762079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007710664,"about_ca_system_score_gemma":0.004002068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005378442,"about_ca_topic_score_gemma":0.006240682,"domain_scores_codex":[0.99536,0.001269636,0.0002194049,0.0008920896,0.001291007,0.000967905],"domain_scores_gemma":[0.9662318,0.02650973,0.002011758,0.002693116,0.000997207,0.001556285],"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.001366652,0.001080078,0.004285648,0.001957508,0.0003941013,0.0006519756,0.0008052733,0.2910865,0.003678579,0.5272303,0.07891095,0.08855245],"study_design_scores_gemma":[0.0002373621,0.00009348663,0.0007492098,0.00008212126,0.000112418,0.0003105813,0.000173362,0.2423041,0.001421121,0.7480052,0.006469105,0.00004194432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4050429,0.007409206,0.4793329,0.03061152,0.0007851392,0.001099423,0.01334267,0.002381285,0.05999497],"genre_scores_gemma":[0.7374442,0.005993503,0.1847758,0.002414551,0.001603731,0.001193909,0.01211686,0.001782774,0.05267478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03227061,"threshold_uncertainty_score":0.1079559,"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."}}