{"id":"W2998968188","doi":"","title":"Maximum linear arrangement of directed graphs","year":2019,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001904341,0.0003420349,0.0004747851,0.00148172,0.0001274289,0.00003294243,0.002272535,0.0002931791,0.0001021178],"category_scores_gemma":[0.00003837917,0.0003905231,0.0002913616,0.002310756,0.00008542229,0.0005056199,0.0002516966,0.0004950358,0.0001248123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001167422,"about_ca_system_score_gemma":0.000214222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007030058,"about_ca_topic_score_gemma":0.003642315,"domain_scores_codex":[0.9976938,0.0001823238,0.000259191,0.000753372,0.0006595603,0.0004517181],"domain_scores_gemma":[0.9977825,0.0001402805,0.0003145818,0.001148686,0.0004584281,0.0001555592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.004033202,0.002298044,0.2343412,0.00399186,0.002869283,0.00179965,0.001451633,0.001741587,0.002280529,0.5977868,0.03597897,0.1114271],"study_design_scores_gemma":[0.01170444,0.002361596,0.008742419,0.0022515,0.0007336224,4.393652e-8,0.05874648,0.01196243,0.1252239,0.09404629,0.6777861,0.006441204],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7901341,0.00134065,0.06058433,0.0002275223,0.004662844,0.003104988,0.0002803566,0.001552928,0.1381122],"genre_scores_gemma":[0.7944254,0.001387874,0.02195648,0.0001123701,0.0001180162,0.000009776653,0.001663079,0.0002026678,0.1801243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6418071,"threshold_uncertainty_score":0.9998547,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01455678866706619,"score_gpt":0.2466469829840335,"score_spread":0.2320901943169673,"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."}}