{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006834271,0.001677764,0.001600502,0.0008965873,0.001073045,0.002090295,0.0029565,0.001713468,0.01420489],"category_scores_gemma":[0.002580063,0.0007522065,0.001055837,0.00267805,0.0006452134,0.005485665,0.002526026,0.001421321,0.003642328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001643631,"about_ca_system_score_gemma":0.002266956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002870606,"about_ca_topic_score_gemma":0.003358319,"domain_scores_codex":[0.9983895,0.0002435337,0.0001099301,0.0005684744,0.0002940032,0.0003945761],"domain_scores_gemma":[0.9986052,0.000604793,0.0001157978,0.0004398151,0.0001203085,0.0001139936],"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.002062101,0.000879591,0.002127568,0.001147667,0.000171868,0.0004141249,0.0005939527,0.1753642,0.02319974,0.04572786,0.04779985,0.7005115],"study_design_scores_gemma":[0.0006652962,0.0004459588,0.0008413268,0.00005684911,0.00008526057,0.0005715262,0.0003010252,0.8654777,0.008604114,0.1035781,0.01930891,0.00006386264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08236894,0.001123406,0.8813034,0.001321718,0.0002148835,0.0006133908,0.001986035,0.01095662,0.02011159],"genre_scores_gemma":[0.2314008,0.000450377,0.7547995,0.0004032822,0.0001126983,0.0005417913,0.004079655,0.000831749,0.007380194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01420489,"threshold_uncertainty_score":0.0475201,"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."}}