{"id":"W1578742758","doi":"10.48550/arxiv.1410.7423","title":"Packing odd $T$-joins with at most two terminals","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Joins; Bipartite graph; Conjecture; Cardinality (data modeling); Disjoint sets; Sigma; Graph; Discrete mathematics; Physics; 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.0004053743,0.0006730144,0.0007064198,0.000523332,0.001454718,0.001938023,0.000948418,0.0007059564,0.007386484],"category_scores_gemma":[0.002868345,0.0005722206,0.000657686,0.001408668,0.001143898,0.003604413,0.002327954,0.000790187,0.001114088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000725936,"about_ca_system_score_gemma":0.000736908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001332276,"about_ca_topic_score_gemma":0.001441033,"domain_scores_codex":[0.9992411,0.000089518,0.00006182862,0.0002074375,0.0001317992,0.0002683864],"domain_scores_gemma":[0.9975271,0.0007047114,0.0005062681,0.0006777925,0.0001576624,0.0004265597],"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.003340914,0.0007544672,0.07305335,0.0007474177,0.0002601574,0.002778798,0.003499739,0.149559,0.1337426,0.3787997,0.02205541,0.2314085],"study_design_scores_gemma":[0.000191762,0.001480215,0.01999613,0.000201793,0.0002304799,0.006985075,0.003990473,0.3497544,0.1371022,0.4224901,0.05740923,0.0001680034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9001414,0.0001560031,0.08734822,0.0002558133,0.00004716207,0.00007467601,0.0006612506,0.0003982889,0.0109172],"genre_scores_gemma":[0.9247089,0.0002462931,0.06700118,0.0001784573,0.00003334073,0.00007967474,0.00152133,0.0001688507,0.006061933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007386484,"threshold_uncertainty_score":0.02471024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07429698143910071,"score_gpt":0.2254815278046076,"score_spread":0.1511845463655068,"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."}}