{"id":"W3013102369","doi":"10.23638/dmtcs-22-1-1","title":"Vertex ordering with optimal number of adjacent predecessors","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Computer science; Graph","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.0005194083,0.0003748047,0.0007125811,0.0003856343,0.0005338661,0.0009098718,0.0008842819,0.0006914826,0.003792301],"category_scores_gemma":[0.00355805,0.0003321486,0.0004965452,0.0007005155,0.0004964538,0.001540532,0.000708703,0.0008911186,0.0004666712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006585232,"about_ca_system_score_gemma":0.001188067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693246,"about_ca_topic_score_gemma":0.003105627,"domain_scores_codex":[0.9993772,0.0001821318,0.00003772737,0.0001604929,0.000134956,0.0001074607],"domain_scores_gemma":[0.9976195,0.001592922,0.0002201881,0.0002833671,0.0001181189,0.000165978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008208635,0.0004458669,0.005082626,0.0005122279,0.00007113741,0.0005239484,0.0002764856,0.745976,0.02308737,0.07997994,0.004163599,0.1390598],"study_design_scores_gemma":[0.00009660092,0.0003762024,0.0006765921,0.00003112494,0.00003694769,0.0002492883,0.0001942982,0.9108452,0.01071777,0.07384755,0.002905965,0.00002250381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5496219,0.0005206706,0.4382656,0.000725688,0.00004945382,0.0002572477,0.0005886657,0.0006226481,0.00934817],"genre_scores_gemma":[0.7313247,0.0002509361,0.2636728,0.00009811342,0.00001409788,0.00009989789,0.0006413067,0.00009725876,0.003800856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003792301,"threshold_uncertainty_score":0.01268655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009019497210736761,"score_gpt":0.2211173328874201,"score_spread":0.2120978356766833,"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."}}