{"id":"W2020187144","doi":"","title":"A nearly linear time algorithm for the half integral disjoint paths packing","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Binary logarithm; Bounded function; Mathematics; Disjoint sets; Time complexity; Planar graph; Vertex (graph theory); Running time; Graph; Discrete mathematics; Algorithm","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.0005330418,0.0001451435,0.0001519671,0.0000803319,0.0004805728,0.00009926574,0.001236637,0.00004464338,0.00004957072],"category_scores_gemma":[0.0001321945,0.00008596172,0.0001503757,0.0004352127,0.0002107459,0.0004671011,0.0003730716,0.0002308245,0.0002075885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003365575,"about_ca_system_score_gemma":0.00007785885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002741176,"about_ca_topic_score_gemma":0.000007341363,"domain_scores_codex":[0.9985529,0.00007107695,0.0001883258,0.0003703819,0.0003425654,0.0004747935],"domain_scores_gemma":[0.9982921,0.000671329,0.00004563469,0.000720475,0.0001631933,0.0001072787],"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.00001791602,0.00008535175,0.00007997113,0.000005061335,0.00004454348,0.00004859831,0.001499524,0.000117901,0.0007011428,0.08580709,0.002081052,0.9095119],"study_design_scores_gemma":[0.0003361927,0.0001807824,0.0002069216,0.000008943698,0.000002709373,0.0000741239,0.00005719363,0.9679289,0.002213158,0.01775519,0.01106331,0.0001725465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001251768,0.00011724,0.9957845,0.001278969,0.0001361043,0.0004109461,0.000006249647,0.0002083445,0.0008059452],"genre_scores_gemma":[0.04437977,0.00004105204,0.9440851,0.0006214348,0.0002568002,0.0001432928,0.000004089496,0.00003287884,0.0104356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.967811,"threshold_uncertainty_score":0.3696226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03436248603954672,"score_gpt":0.294476237236862,"score_spread":0.2601137511973153,"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."}}