{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","routes":{"ca_aff":true,"ca_fund":true,"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.002987877,0.0003014987,0.000364853,0.000160327,0.0007087305,0.0003552207,0.001595967,0.00007702289,0.00002769839],"category_scores_gemma":[0.0002324825,0.0001756801,0.0003342121,0.0004062935,0.0001967209,0.0005405023,0.0002156347,0.0006917866,0.00005652506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143255,"about_ca_system_score_gemma":0.00007487612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001162875,"about_ca_topic_score_gemma":0.000001106006,"domain_scores_codex":[0.9972122,0.0002166947,0.0005719261,0.0002894191,0.0008212497,0.0008885677],"domain_scores_gemma":[0.9961472,0.001975816,0.0003691935,0.0009700896,0.000165096,0.000372602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001618614,0.001609252,0.0005225351,0.0001752118,0.0002580221,0.00001902842,0.004849017,0.0007743911,0.0002236558,0.8359599,0.00649581,0.1489513],"study_design_scores_gemma":[0.001875645,0.001750328,0.001252388,0.0002173008,0.00005735814,0.0003512953,0.0007553347,0.1656842,0.001578518,0.8126478,0.0131021,0.0007277239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01112408,0.0002273536,0.9846927,0.001086612,0.0004154468,0.001175352,0.00003442063,0.00008777588,0.00115625],"genre_scores_gemma":[0.623201,0.00006504779,0.3751768,0.0004182479,0.0005992787,0.0001859872,0.000003974443,0.00006794061,0.0002817406],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6120769,"threshold_uncertainty_score":0.7164026,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03762119088775073,"score_gpt":0.3278538762090636,"score_spread":0.2902326853213129,"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."}}