{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305544,0.0005154379,0.0005114097,0.000198817,0.000630365,0.0005510226,0.001392758,0.000236492,0.00007295918],"category_scores_gemma":[0.0002560743,0.0004596269,0.0001814672,0.0007906207,0.0003369928,0.001331252,0.00125382,0.001191679,0.000116479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000077438,"about_ca_system_score_gemma":0.0001025371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001290229,"about_ca_topic_score_gemma":0.00009772328,"domain_scores_codex":[0.9953496,0.0002730713,0.0006956481,0.001523343,0.001038088,0.001120247],"domain_scores_gemma":[0.9970074,0.0002878615,0.000333956,0.00167264,0.0002419586,0.0004562384],"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.0008951654,0.002046635,0.009452774,0.0002687882,0.0005003774,0.0007262701,0.008110292,0.0001992315,0.1419198,0.5393721,0.001881049,0.2946276],"study_design_scores_gemma":[0.007191716,0.002542989,0.05348399,0.0003921413,0.00008072758,0.0002542521,0.0004555516,0.2159144,0.06538697,0.6335759,0.01712476,0.003596538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6527158,0.0003444906,0.3094678,0.005685002,0.002735127,0.002557301,0.0001749004,0.001166578,0.02515303],"genre_scores_gemma":[0.8906796,0.0002703315,0.1077152,0.0004658555,0.0003002025,0.0001217462,0.00003909807,0.00007311522,0.0003348028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.291031,"threshold_uncertainty_score":0.9997855,"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."}}