{"id":"W4401748186","doi":"10.1016/j.ejc.2024.104043","title":"The Nash-Williams orientation theorem for graphs with countably many ends","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orientation (vector space); Discrete mathematics; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957408,0.0008267211,0.0007793185,0.00125474,0.002145588,0.003305547,0.001250309,0.001269198,0.008245115],"category_scores_gemma":[0.005034833,0.0005282857,0.0009094966,0.001128884,0.004075699,0.008154606,0.002992705,0.002861146,0.001725931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139983,"about_ca_system_score_gemma":0.0007299657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002128904,"about_ca_topic_score_gemma":0.002730776,"domain_scores_codex":[0.9989973,0.000194422,0.00004705038,0.0003239147,0.0001895993,0.0002477744],"domain_scores_gemma":[0.9970015,0.001661536,0.0002665103,0.000422651,0.0003248201,0.0003230919],"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.00007939795,0.00002335614,0.0010445,0.00007791165,0.00001237382,0.00009009855,0.0001769079,0.003137227,0.001365656,0.9820426,0.003012306,0.008937514],"study_design_scores_gemma":[0.00001218748,0.00001736258,0.0004860902,0.00002817504,0.00001556564,0.00009730179,0.0001554236,0.007443875,0.001064669,0.9817247,0.008937434,0.0000173249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3003108,0.002297994,0.4441696,0.006076671,0.0006641422,0.0001618392,0.000867037,0.0005462605,0.2449056],"genre_scores_gemma":[0.8851247,0.002364107,0.07872406,0.001950565,0.0007043465,0.0003608889,0.001311084,0.0002731174,0.0291872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008245115,"threshold_uncertainty_score":0.02758265,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418523057348827,"score_gpt":0.271210711128085,"score_spread":0.2570254805545968,"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."}}