{"id":"W2605695111","doi":"10.4236/ojdm.2017.72007","title":"Length of the Longest Path and Diameter in Orientations of Graphs","year":2017,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory); Path (computing); Property (philosophy); Interval graph; Pathwidth; Discrete mathematics; Longest path problem; Indifference graph; Graph; Chordal graph; Line graph; Computer science","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.001161537,0.0008717323,0.001017287,0.00244225,0.0008274253,0.002960704,0.001588636,0.001453506,0.00300774],"category_scores_gemma":[0.01287851,0.0006188762,0.0005144594,0.003152899,0.00386662,0.008112215,0.001858146,0.001902935,0.0005285131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134028,"about_ca_system_score_gemma":0.0002953939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006028885,"about_ca_topic_score_gemma":0.0003492914,"domain_scores_codex":[0.9986518,0.0002771568,0.0001100916,0.000555766,0.0002366254,0.0001685712],"domain_scores_gemma":[0.983356,0.01048901,0.003072007,0.0009099638,0.0005645799,0.001608426],"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.001021493,0.000231339,0.02847433,0.0004622142,0.0000938363,0.0007149822,0.001593197,0.02760828,0.01704281,0.8701447,0.007069127,0.0455437],"study_design_scores_gemma":[0.00007276322,0.0002243943,0.01344779,0.00009703313,0.00006722108,0.001205784,0.000522416,0.04310581,0.003263503,0.9298079,0.008094829,0.00009062458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.829612,0.006435067,0.1326092,0.002098918,0.0003841541,0.00005170924,0.001666527,0.0003543022,0.02678805],"genre_scores_gemma":[0.9740959,0.002198415,0.01965228,0.0001601691,0.001005099,0.0001278855,0.0007865541,0.0001180405,0.001855599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00300774,"threshold_uncertainty_score":0.01006192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0416074269276484,"score_gpt":0.3508159470323561,"score_spread":0.3092085201047077,"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."}}