{"id":"W2060031821","doi":"10.1016/j.jctb.2014.01.005","title":"Removable paths and cycles with parity constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Parity (physics); Bipartite graph; Vertex (graph theory); Graph; Integer (computer science); Connectivity; Discrete mathematics; Physics; Computer science","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.001063262,0.0008905139,0.001140855,0.002865905,0.003186663,0.004034916,0.002545867,0.002593101,0.01157731],"category_scores_gemma":[0.009713911,0.001171965,0.001166481,0.002757318,0.004693331,0.008806084,0.003720936,0.004310261,0.0009157852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001220112,"about_ca_system_score_gemma":0.0009192549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175313,"about_ca_topic_score_gemma":0.001358702,"domain_scores_codex":[0.9990115,0.0002751591,0.00005965585,0.0002012535,0.0002795282,0.0001728768],"domain_scores_gemma":[0.9956181,0.002677124,0.0005057317,0.0004613857,0.0003116867,0.0004259724],"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.00001676259,0.00001699169,0.0001307745,0.00002017418,0.000003880412,0.0001045007,0.000154036,0.0005916869,0.000192044,0.9955942,0.0006976728,0.002477378],"study_design_scores_gemma":[0.000005511493,0.00000259313,0.00002978258,0.000006917598,0.00000374008,0.00006516562,0.00003801773,0.001209461,0.00007866962,0.9978319,0.0007245703,0.000003677642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.593955,0.001937746,0.18887,0.004188483,0.0006811664,0.0001171778,0.0005500308,0.0004764433,0.2092239],"genre_scores_gemma":[0.9289153,0.001030766,0.03060983,0.0006043715,0.0004882756,0.0001735607,0.0004222098,0.0002488626,0.03750682],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01157731,"threshold_uncertainty_score":0.03872997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01139345464392068,"score_gpt":0.2486869429507045,"score_spread":0.2372934883067838,"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."}}