{"id":"W4413071390","doi":"10.1007/978-3-031-98740-3_10","title":"Covering Vertices by $$4^+$$-Paths: A Simpler Local Search Coupled with a More Delicate Amortization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Amortization; Algorithm","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.001118333,0.001336845,0.002265569,0.001131985,0.001348819,0.002748653,0.004079432,0.002510978,0.05194723],"category_scores_gemma":[0.004941316,0.0009601277,0.002315533,0.002158419,0.001377188,0.006990281,0.004663128,0.003023876,0.006694325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393105,"about_ca_system_score_gemma":0.001697645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002956106,"about_ca_topic_score_gemma":0.006969611,"domain_scores_codex":[0.9986413,0.0003529645,0.0000761488,0.0004064125,0.0002994525,0.0002237459],"domain_scores_gemma":[0.9973255,0.001299737,0.00009128332,0.00100679,0.0001276968,0.0001489649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001079428,0.0007122346,0.0006873626,0.00105189,0.0002454033,0.0003020991,0.000433569,0.1772001,0.02325009,0.2342704,0.0669824,0.4937851],"study_design_scores_gemma":[0.000237201,0.0002047287,0.0003249884,0.00007167576,0.0001497583,0.0003736739,0.0002032632,0.7084607,0.005739924,0.2648422,0.01933037,0.00006158447],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04114268,0.0004810596,0.9091428,0.001421322,0.0003638575,0.0003329409,0.0007432799,0.003665692,0.04270647],"genre_scores_gemma":[0.1257363,0.0002305182,0.8472419,0.0005322185,0.0001920624,0.0002988798,0.0007863177,0.002030783,0.02295099],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05194723,"threshold_uncertainty_score":0.1737808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01465062526611189,"score_gpt":0.281982273973631,"score_spread":0.2673316487075191,"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."}}