{"id":"W2962878651","doi":"10.1002/jgt.22178","title":"Packing odd<i>T</i>‐joins with at most two terminals","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research Global; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Joins; Mathematics; Bipartite graph; Cardinality (data modeling); Conjecture; Eulerian path; Disjoint sets; Graph; Set (abstract data type); Discrete mathematics; Computer science","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.0004519469,0.0004618404,0.0007070724,0.0005969447,0.001319544,0.002118469,0.0006900112,0.0005984281,0.005070505],"category_scores_gemma":[0.002347881,0.0005156182,0.0005205875,0.001027354,0.001030241,0.003077098,0.002340919,0.0006102572,0.0007556753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006508171,"about_ca_system_score_gemma":0.0005524052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006934656,"about_ca_topic_score_gemma":0.0007294633,"domain_scores_codex":[0.9994005,0.00007394332,0.00005681744,0.0001188208,0.0001043375,0.0002455732],"domain_scores_gemma":[0.9972557,0.0006133063,0.0006350199,0.000706855,0.0001887415,0.0006002359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004524985,0.000935792,0.1004353,0.0005574079,0.0002679175,0.003977061,0.003373193,0.1652738,0.2638505,0.2619524,0.01298778,0.1818639],"study_design_scores_gemma":[0.000155356,0.002160259,0.02442621,0.0001933206,0.0002318089,0.006022901,0.005167775,0.4077729,0.2309148,0.2810963,0.04166792,0.0001904183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9449779,0.00007600427,0.04854684,0.0001041824,0.00003354884,0.00003989738,0.0001619176,0.000255959,0.005803665],"genre_scores_gemma":[0.9711415,0.00007553294,0.02600852,0.00007271278,0.00001966608,0.00002760635,0.0002858822,0.0001014805,0.00226716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005070505,"threshold_uncertainty_score":0.01696253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02431626381934828,"score_gpt":0.3199633436365374,"score_spread":0.2956470798171891,"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."}}