{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003885179,0.00014038,0.0001409759,0.0001716955,0.0001577916,0.00011176,0.0009487335,0.00004334269,0.00002773495],"category_scores_gemma":[0.00003580221,0.0001095701,0.00003871408,0.001553266,0.0001152877,0.0004677497,0.0003561079,0.0002162067,0.001430698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003694296,"about_ca_system_score_gemma":0.00007982816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008190553,"about_ca_topic_score_gemma":0.00000201792,"domain_scores_codex":[0.9982704,0.00006913249,0.0001313941,0.0004978497,0.0004787299,0.0005524946],"domain_scores_gemma":[0.9987686,0.0001753307,0.00004382373,0.0007673356,0.0001013389,0.0001435952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006022145,0.000241447,0.001211536,0.0001059933,0.0001628978,0.0007576768,0.001966647,0.003577975,0.002068931,0.317931,0.02234006,0.6495756],"study_design_scores_gemma":[0.00294167,0.001136904,0.00452954,0.0001713652,0.00001529561,0.0001916311,0.0001615429,0.544457,0.008174477,0.1690581,0.2677838,0.001378643],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005810422,0.00007242242,0.9838912,0.001605434,0.0002295683,0.0007307712,0.0000172448,0.001122324,0.006520616],"genre_scores_gemma":[0.7641007,0.0001913161,0.2142338,0.001021501,0.0003717678,0.0006925314,0.00005799989,0.0001490418,0.01918126],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7696574,"threshold_uncertainty_score":0.9993468,"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."}}