{"id":"W2953294211","doi":"10.1002/jgt.22174","title":"Finding a subdivision of a prescribed digraph of order 4","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Digraph; Subdivision; Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Reduction (mathematics); Time complexity; Order (exchange); 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.0002786689,0.0002209948,0.0005990497,0.0005626809,0.0008822924,0.00119022,0.0007409962,0.0007781431,0.003949828],"category_scores_gemma":[0.002025257,0.0003192182,0.0006293479,0.0005500042,0.0008897006,0.001786725,0.0007923364,0.0008142351,0.0003371184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001168149,"about_ca_system_score_gemma":0.0008961927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003988274,"about_ca_topic_score_gemma":0.005238891,"domain_scores_codex":[0.9996558,0.0000426958,0.00002799869,0.0001228001,0.0000550337,0.00009562544],"domain_scores_gemma":[0.9986721,0.0005778247,0.0001564156,0.0002711862,0.0001205734,0.0002018385],"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.001062318,0.0004904273,0.0463838,0.0009326114,0.0001825337,0.002011918,0.002819088,0.2005025,0.08948392,0.4402466,0.01077695,0.2051073],"study_design_scores_gemma":[0.0001025915,0.0004240667,0.01095892,0.0001851095,0.0001361851,0.001419996,0.002134121,0.4191115,0.03544537,0.4978389,0.03216091,0.0000822672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8444136,0.0002259556,0.1395635,0.000582111,0.00005011513,0.000151305,0.0006964282,0.0004000397,0.01391689],"genre_scores_gemma":[0.9231479,0.0001067587,0.07014188,0.00008159377,0.00001457368,0.00003097068,0.001095347,0.00003387538,0.005347122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003988274,"threshold_uncertainty_score":0.01321346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03208911507895253,"score_gpt":0.3273542662692229,"score_spread":0.2952651511902704,"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."}}