{"id":"W2058621291","doi":"10.1016/j.ipl.2005.09.006","title":"Vertex covering by paths on trees with its applications in machine translation","year":2005,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Edge cover; Vertex cover; Vertex (graph theory); Path (computing); Combinatorics; Set cover problem; Enhanced Data Rates for GSM Evolution; Tree (set theory); Mathematics; Cover (algebra); Translation (biology); Computer science; Set (abstract data type); Algorithm; Time complexity; Discrete mathematics; Artificial intelligence; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0001422307,0.0001430191,0.0001020134,0.000236142,0.0001266648,0.0003271354,0.0003979225,0.00005046551,0.000002626168],"category_scores_gemma":[0.00001439834,0.0001179998,0.00001735752,0.0005174674,0.00002100648,0.004938986,0.00002230058,0.0001874864,0.0000180584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001042887,"about_ca_system_score_gemma":0.0000345744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009331487,"about_ca_topic_score_gemma":0.00001007229,"domain_scores_codex":[0.9990606,0.00001501669,0.0002824453,0.0001600184,0.000293993,0.0001879603],"domain_scores_gemma":[0.9995309,0.00003945595,0.0001635591,0.0001776176,0.00005086858,0.00003757585],"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.00001646365,0.00003618635,0.0001310404,0.00007950947,0.000003100175,7.810191e-7,0.002884327,0.001895858,0.005774787,0.001165384,0.0004663407,0.9875462],"study_design_scores_gemma":[0.002182973,0.000170538,0.0008260606,0.0007559281,0.00001496334,0.00003688295,0.0001252926,0.8158783,0.115031,0.0007948259,0.06295933,0.001223958],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008074978,0.0006749855,0.9840894,0.005795626,0.00001643002,0.0002852813,0.000005885037,0.0005277082,0.0005296723],"genre_scores_gemma":[0.8729607,0.000006161011,0.122893,0.003989289,0.00001390644,0.00007510791,0.0000454943,0.000007397337,0.000008902372],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9863223,"threshold_uncertainty_score":0.4811893,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006243725173338033,"score_gpt":0.2270362528958371,"score_spread":0.220792527722499,"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."}}