{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104606,0.0001715588,0.0004402054,0.00007435292,0.0002372705,0.00006165224,0.0002168924,0.0001049998,0.0000901618],"category_scores_gemma":[0.0008054152,0.0001111892,0.00008123134,0.00008062097,0.0006524789,0.0002875212,0.00007292368,0.0003122012,4.464999e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700175,"about_ca_system_score_gemma":0.00004551447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.68528e-7,"about_ca_topic_score_gemma":6.749094e-7,"domain_scores_codex":[0.9986057,0.0003792125,0.0004107882,0.0001136796,0.000296346,0.0001942578],"domain_scores_gemma":[0.9980755,0.0008966886,0.0004499361,0.0002289062,0.0002236954,0.0001252456],"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.0009667819,0.0000501707,0.0005923592,0.00004541378,0.00009979353,0.00002112456,0.000681763,7.027637e-7,0.0001143154,0.9941637,0.0002344653,0.003029418],"study_design_scores_gemma":[0.001428148,0.0006927435,0.000403281,0.0000903067,0.00007810875,0.0005600122,0.0004954839,0.000001870561,0.001287597,0.9908881,0.003923357,0.0001510407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837536,0.0001358633,0.00142952,0.0001297294,0.00232435,0.0001032212,0.000003535031,0.00002690201,0.01209329],"genre_scores_gemma":[0.994556,0.00004426762,0.004749787,0.00005835431,0.000467836,8.428508e-7,2.425348e-7,0.00002093085,0.000101766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01199152,"threshold_uncertainty_score":0.4534164,"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."}}