{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726917,0.0001224951,0.0001592783,0.00009657974,0.00006154977,0.0001069668,0.0003471426,0.00004012586,0.00001431831],"category_scores_gemma":[0.00003695369,0.0001021862,0.00002269121,0.0002495782,0.00003820525,0.0001716714,0.0002078056,0.0001195825,0.0001388229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002376394,"about_ca_system_score_gemma":0.00001009955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.990413e-7,"about_ca_topic_score_gemma":4.610217e-7,"domain_scores_codex":[0.9990358,0.00001238186,0.0001621078,0.0002809906,0.000290676,0.0002179956],"domain_scores_gemma":[0.9990683,0.0002843828,0.00007929046,0.0004801292,0.00002893802,0.00005899377],"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.000005910094,0.00002616501,0.00001035907,0.000115053,0.000008185109,6.931613e-7,0.001095038,0.0002695076,0.01507519,0.9798715,0.00001667332,0.003505759],"study_design_scores_gemma":[0.0005741209,0.00007840692,0.0001218723,0.00007447782,0.000003755953,0.000004860945,0.0001111664,0.13733,0.00882548,0.8524585,0.0001843769,0.0002329082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3004676,0.0000221599,0.6557286,0.00009155247,0.00006055259,0.0008501338,0.000002452683,0.0003178982,0.04245909],"genre_scores_gemma":[0.8935794,0.00001129947,0.105932,0.00004792015,0.000008261377,0.00005584786,0.000002927557,0.00001858936,0.0003437479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5931118,"threshold_uncertainty_score":0.4167034,"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."}}