{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003535091,0.0001479316,0.0004572336,0.0008091955,0.0002344138,0.00008409597,0.00296832,0.0000741571,0.00002451609],"category_scores_gemma":[0.001258847,0.0001134816,0.0003611574,0.0004891658,0.0005617139,0.001175773,0.0004565566,0.0003547272,0.000001511986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001379043,"about_ca_system_score_gemma":0.0001116418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005115687,"about_ca_topic_score_gemma":0.000001954518,"domain_scores_codex":[0.9977421,0.0003549213,0.0006845883,0.0001896938,0.0007343679,0.0002943733],"domain_scores_gemma":[0.9957251,0.0005856333,0.001656143,0.001133098,0.0007644814,0.0001355437],"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.0005989152,0.0002623222,0.01076407,0.00008982464,0.0002037523,0.00005946486,0.001373276,0.00007710659,0.03650853,0.9175091,0.0001423155,0.03241131],"study_design_scores_gemma":[0.00113492,0.0006230057,0.02397861,0.0003464644,0.0000264081,0.00007129041,0.0001401181,0.0002916561,0.04149365,0.9315884,0.0001514894,0.000154068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6218619,0.0009282324,0.3746962,0.0001682533,0.0004095841,0.0001518687,0.000005403674,0.00001396439,0.001764579],"genre_scores_gemma":[0.9852293,0.0001600781,0.01445225,0.00001618124,0.00003469124,0.000001387008,1.399221e-7,0.0000123067,0.00009369382],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3633673,"threshold_uncertainty_score":0.5515927,"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."}}