{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079593,0.00007144838,0.0002603025,0.00009675173,0.0001125382,0.0001581345,0.002491005,0.00002192877,0.00000576576],"category_scores_gemma":[0.0004866792,0.00004262919,0.00007139437,0.0001563826,0.0002768294,0.000780063,0.0008525421,0.0001552922,3.460081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008500517,"about_ca_system_score_gemma":0.00005892654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007149703,"about_ca_topic_score_gemma":0.00001392721,"domain_scores_codex":[0.9989467,0.00008680928,0.0004543336,0.00008437663,0.0003136765,0.000114157],"domain_scores_gemma":[0.9979188,0.0002344927,0.0009295637,0.0007121509,0.0001544845,0.00005050523],"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.00004229943,0.0003544084,0.04586516,0.000246138,0.0001118984,0.00002539642,0.01543789,0.00008796062,0.003494008,0.9231029,0.00007130847,0.01116069],"study_design_scores_gemma":[0.001276752,0.0003308577,0.05314863,0.0008429178,0.00002873592,0.00008104031,0.001639241,0.00250206,0.008957976,0.9310075,0.00003783112,0.0001464825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9169836,0.0001143389,0.07837102,0.0008130759,0.0001319213,0.0003575568,0.000009051295,0.00000162953,0.003217783],"genre_scores_gemma":[0.9033457,0.00005092661,0.09652741,0.000007505532,0.000004684534,0.000001851547,5.484607e-8,0.000005325672,0.00005656478],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01815639,"threshold_uncertainty_score":0.4628949,"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."}}