{"id":"W4323317406","doi":"10.1007/s00453-023-01106-2","title":"Path Cover Problems with Length Cost","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Corporation; Japan Society for the Promotion of Science London","keywords":"Combinatorics; Mathematics; Disjoint sets; Hamiltonian path; Cover (algebra); Path (computing); Vertex (graph theory); Discrete mathematics; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205578,0.001341501,0.0017361,0.001852296,0.001714215,0.00340844,0.003271056,0.003882379,0.02528021],"category_scores_gemma":[0.01367752,0.001179802,0.00165645,0.004586131,0.001827866,0.01015228,0.003180498,0.004934617,0.001571325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002748379,"about_ca_system_score_gemma":0.001460126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621436,"about_ca_topic_score_gemma":0.002224325,"domain_scores_codex":[0.9983221,0.0004166945,0.000075977,0.0003365178,0.0005192973,0.0003294671],"domain_scores_gemma":[0.9867287,0.01065514,0.0007567455,0.0007175947,0.000459316,0.000682477],"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.001599311,0.0009276925,0.004070257,0.001784226,0.0003408932,0.0009284873,0.0007060578,0.2829299,0.006463125,0.5265246,0.05399496,0.1197305],"study_design_scores_gemma":[0.0002424578,0.0001815445,0.0007213538,0.00007750518,0.0001388914,0.0004052826,0.0001817237,0.243044,0.001971629,0.7440506,0.008949842,0.00003521463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4862362,0.004415205,0.3986145,0.01455029,0.0007381146,0.000643215,0.005885888,0.00156328,0.08735324],"genre_scores_gemma":[0.7577903,0.003057537,0.1663204,0.001227899,0.001379558,0.0007900373,0.004797502,0.001121663,0.06351522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02528021,"threshold_uncertainty_score":0.08457071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02234746722420633,"score_gpt":0.2734891129624179,"score_spread":0.2511416457382116,"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."}}