{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001462206,0.0005197211,0.0004724676,0.0002058596,0.0007956898,0.0005705699,0.00243204,0.0001696974,0.00001842488],"category_scores_gemma":[0.0001002726,0.0003466014,0.0004259523,0.000863046,0.0002740982,0.0008985559,0.0003953881,0.0007539449,0.0001541079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001496586,"about_ca_system_score_gemma":0.0001359078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004012273,"about_ca_topic_score_gemma":0.000005295663,"domain_scores_codex":[0.9958907,0.0002651602,0.0005596132,0.00113559,0.0009180244,0.001230879],"domain_scores_gemma":[0.9968549,0.0007046424,0.000213574,0.001610217,0.0002929435,0.0003237365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008493748,0.0002477966,0.00001210888,0.00001774334,0.00009700379,0.00004419048,0.001226177,0.0007224966,0.002733231,0.05553354,0.0007680358,0.9385127],"study_design_scores_gemma":[0.001003214,0.00176279,0.0002241466,0.0001000471,0.00002808463,0.00003823431,0.00007657231,0.9192542,0.004316478,0.06303423,0.00953118,0.0006308131],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002821941,0.000266261,0.9848246,0.01054635,0.0003598527,0.001725816,0.00009792324,0.0004547259,0.001442281],"genre_scores_gemma":[0.04370147,0.0002158678,0.9476577,0.002244764,0.001261655,0.0006983242,0.00009006953,0.000142889,0.003987258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9378819,"threshold_uncertainty_score":0.9998986,"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."}}