{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981598,0.000223884,0.0003897781,0.0004471581,0.001089826,0.0004419158,0.003205247,0.00005430347,0.00004702525],"category_scores_gemma":[0.0003288971,0.0001550697,0.0002155731,0.0002955861,0.0006212936,0.001825824,0.0006362885,0.0005141857,0.00002228886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007006035,"about_ca_system_score_gemma":0.0001373361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003455901,"about_ca_topic_score_gemma":0.00001972889,"domain_scores_codex":[0.9976335,0.0003431175,0.0004368962,0.0002949418,0.0007798874,0.0005117042],"domain_scores_gemma":[0.9963018,0.000444721,0.001072487,0.00147138,0.0004178635,0.0002917059],"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.0009842898,0.0001913365,0.02331362,0.00003703928,0.0002710597,0.001987217,0.00125258,0.000186499,0.01549153,0.8765359,0.0007899372,0.07895902],"study_design_scores_gemma":[0.002628807,0.000966351,0.01556118,0.0003858595,0.00004748529,0.002862573,0.0001666666,0.0002510843,0.022205,0.9514586,0.002977843,0.0004885672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5958582,0.0009404892,0.3895082,0.001163009,0.0007125966,0.000247096,0.000005741561,0.00006745981,0.01149724],"genre_scores_gemma":[0.9838778,0.00009607301,0.01456488,0.0002263606,0.0001776575,0.00000346252,2.272787e-7,0.00002717011,0.001026308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3880197,"threshold_uncertainty_score":0.8382169,"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."}}