{"id":"W1509794588","doi":"10.5555/1496770.1496898","title":"A nearly linear time algorithm for the half integral parity disjoint paths packing problem","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Disjoint sets; Ackermann function; Mathematics; Time complexity; Parity (physics); Binary logarithm; Vertex (graph theory); Discrete mathematics; Approximation algorithm; Inverse; Algorithm; Graph; Physics","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.0008685606,0.002093493,0.001988225,0.0009984632,0.001352956,0.002501277,0.003468142,0.002187269,0.01608444],"category_scores_gemma":[0.003470892,0.0008656482,0.001278168,0.002906934,0.0007223065,0.006638194,0.002739717,0.001834081,0.004536254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001937021,"about_ca_system_score_gemma":0.002909146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003467578,"about_ca_topic_score_gemma":0.003887062,"domain_scores_codex":[0.9979396,0.0003087255,0.0001364628,0.0007448622,0.0003705075,0.0004998294],"domain_scores_gemma":[0.9980859,0.0008646972,0.0001566117,0.000559263,0.0001862182,0.0001473662],"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.00232715,0.001077192,0.002250046,0.001384988,0.0002125075,0.0004338014,0.0006511575,0.174924,0.02047181,0.04157585,0.06266925,0.6920223],"study_design_scores_gemma":[0.0008801698,0.0004783254,0.0009072162,0.00006879738,0.0001120831,0.0005944403,0.0004001993,0.8623055,0.008416319,0.1040089,0.02175222,0.00007588092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08574332,0.001284848,0.8681496,0.001825426,0.0003092391,0.000903468,0.002470681,0.01428978,0.02502373],"genre_scores_gemma":[0.2186883,0.0004823803,0.765619,0.0005789499,0.0001515331,0.0007114295,0.004948138,0.001112758,0.00770739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01608444,"threshold_uncertainty_score":0.0538078,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01650779417379294,"score_gpt":0.2897351951554409,"score_spread":0.2732274009816479,"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."}}