{"id":"W2908576804","doi":"10.1016/j.dam.2018.12.012","title":"On directed covering and domination problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Directed acyclic graph; Directed graph; Mathematics; Edge cover; Vertex cover; Vertex (graph theory); Feedback arc set; Time complexity; Maximal independent set; Feedback vertex set; Discrete mathematics; Graph; Pathwidth; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.001652414,0.001263618,0.001662164,0.002732961,0.002094899,0.003442806,0.001983514,0.002928762,0.00882583],"category_scores_gemma":[0.01231885,0.0008451266,0.001377892,0.005619599,0.003250932,0.00821151,0.003296437,0.003997447,0.0005980264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002145376,"about_ca_system_score_gemma":0.000835292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002133848,"about_ca_topic_score_gemma":0.001476298,"domain_scores_codex":[0.9985681,0.0005865787,0.00005175465,0.0002487514,0.0003447351,0.0002000717],"domain_scores_gemma":[0.9895669,0.008614485,0.0005298583,0.0003853946,0.0003702118,0.0005331177],"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.00009338743,0.00007839853,0.0006905433,0.0001806729,0.00003368835,0.0001792983,0.0004002703,0.01378755,0.0004003574,0.9602697,0.006638298,0.0172478],"study_design_scores_gemma":[0.00001912802,0.000008953663,0.0002259622,0.00002494186,0.00001245877,0.0001172893,0.00008689223,0.02051062,0.00007549515,0.9753184,0.003592196,0.000007664597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3713903,0.01455738,0.3619087,0.01458395,0.001001116,0.0001917057,0.001346757,0.0002750453,0.2347449],"genre_scores_gemma":[0.864116,0.01107851,0.0542228,0.001705488,0.002681224,0.0003775174,0.001731838,0.0002439531,0.06384256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00882583,"threshold_uncertainty_score":0.0295254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01102175588865655,"score_gpt":0.2531472860980281,"score_spread":0.2421255302093715,"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."}}