{"id":"W2619788868","doi":"10.1007/978-3-319-59250-3_23","title":"Min-Max Theorems for Packing and Covering Odd (u, v)-trails","year":2017,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Cover (algebra); Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Vertex cover; Packing problems","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.002741029,0.002408796,0.002166174,0.003126083,0.002984371,0.007511726,0.003932556,0.001827434,0.01612757],"category_scores_gemma":[0.01100172,0.001721756,0.002720084,0.004066956,0.00364743,0.0149471,0.005236476,0.006015767,0.001983908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003129849,"about_ca_system_score_gemma":0.001540239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512267,"about_ca_topic_score_gemma":0.001945927,"domain_scores_codex":[0.998247,0.0003896044,0.0001052799,0.0004157558,0.0004185916,0.0004237044],"domain_scores_gemma":[0.9930676,0.004473328,0.0004950925,0.0008444406,0.000472072,0.0006474767],"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.0002069456,0.00006355814,0.0006300347,0.000236835,0.0000428548,0.00008989826,0.0003583532,0.006573072,0.001234332,0.9629678,0.007972934,0.01962345],"study_design_scores_gemma":[0.00001750225,0.00001912024,0.0001897933,0.00002859673,0.00002880484,0.00007310256,0.00006234585,0.01277836,0.0006538025,0.9834589,0.002677072,0.00001255894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1867717,0.003421346,0.6664425,0.004723175,0.0006484066,0.0001856828,0.002500997,0.001261492,0.1340447],"genre_scores_gemma":[0.7982913,0.00378068,0.139477,0.001559978,0.001188126,0.0005892613,0.002640843,0.001981057,0.05049184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01612757,"threshold_uncertainty_score":0.05395204,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03460716648484819,"score_gpt":0.3322170849591088,"score_spread":0.2976099184742607,"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."}}