{"id":"W1987809901","doi":"10.5555/1873601.1873628","title":"Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Parity (physics); Mathematics; Ackermann function; Time complexity; Subdivision; Discrete mathematics; Vertex (graph theory); Graph; Inverse; Geometry","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.0002833626,0.0005705446,0.0005157514,0.0003375009,0.000559186,0.0009081915,0.0008715724,0.0007850156,0.005218952],"category_scores_gemma":[0.002113587,0.0003849194,0.0008344456,0.0006580442,0.0006793533,0.002224003,0.001644632,0.001011702,0.001134753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006233922,"about_ca_system_score_gemma":0.0008317825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001899117,"about_ca_topic_score_gemma":0.002996733,"domain_scores_codex":[0.9995211,0.00005381793,0.00004219,0.0001551723,0.0001024665,0.0001252846],"domain_scores_gemma":[0.9988309,0.0004042318,0.000149156,0.0003870181,0.0001361194,0.00009259794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001500369,0.0003597928,0.0133008,0.0007735338,0.0001078281,0.001489107,0.001990898,0.09879778,0.1592703,0.152764,0.01344053,0.556205],"study_design_scores_gemma":[0.0001959086,0.0005686334,0.005644418,0.0001039625,0.00009605179,0.001734829,0.001299612,0.4110878,0.131496,0.4162358,0.03139723,0.0001397244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4435694,0.0001605257,0.5404619,0.0004545398,0.00006487589,0.0002441087,0.0009667664,0.001948793,0.01212911],"genre_scores_gemma":[0.6243815,0.00009324164,0.3653491,0.0001261904,0.0000107925,0.0001243933,0.002328459,0.0002599149,0.007326358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005218952,"threshold_uncertainty_score":0.01745915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01978642089397287,"score_gpt":0.2940209903722933,"score_spread":0.2742345694783205,"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."}}