{"id":"W1996212671","doi":"10.1109/icc.2012.6363762","title":"Carving-decomposition based algorithms for the maximum path coloring problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Cardinality (data modeling); Path (computing); Approximation algorithm; Disjoint sets; Mathematics; Algorithm; Computer science; Discrete mathematics; Graph; Database","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.0009689958,0.0001017835,0.00008837852,0.00006805648,0.0003274466,0.0001072104,0.000767192,0.00003385795,0.00001957112],"category_scores_gemma":[0.00002791334,0.00006684923,0.00007071712,0.0003034753,0.00004769807,0.0006245442,0.0001879904,0.0001104301,0.00002672971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005429178,"about_ca_system_score_gemma":0.00003476766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001247112,"about_ca_topic_score_gemma":0.000002835475,"domain_scores_codex":[0.9988214,0.00006641605,0.0001322153,0.0002158168,0.0002516986,0.0005123871],"domain_scores_gemma":[0.9986621,0.0006168564,0.00004252461,0.000473423,0.00009945326,0.0001056719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005345331,0.0002346829,0.001834841,0.00006489291,0.00004392336,0.000002609155,0.0007115921,0.00220429,0.00637068,0.7724028,0.001163625,0.2149126],"study_design_scores_gemma":[0.001028512,0.0003008812,0.00197204,0.00003030372,0.0000134479,0.00001593269,0.0001504272,0.8482494,0.02966525,0.09784748,0.02032307,0.0004032363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009294397,0.0001212169,0.9950016,0.001048088,0.0002513837,0.0006320491,0.000002763314,0.0001634612,0.001850033],"genre_scores_gemma":[0.5082477,0.000003785004,0.4907409,0.0003081603,0.0001287825,0.0003064497,0.000002477733,0.00001295089,0.0002488252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8460451,"threshold_uncertainty_score":0.2726032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04160270630932097,"score_gpt":0.3298041118872781,"score_spread":0.2882014055779571,"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."}}