{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571007,0.0002002855,0.0003085023,0.0000410149,0.00008427847,0.00009541789,0.0006773969,0.0000397741,0.0001347978],"category_scores_gemma":[0.00003312776,0.0001460376,0.00006276085,0.0005955165,0.001148635,0.0001863369,0.0001648878,0.0001424539,0.00004521279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001340193,"about_ca_system_score_gemma":0.00002086113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.377073e-7,"about_ca_topic_score_gemma":9.289634e-8,"domain_scores_codex":[0.9985316,0.00002594104,0.0003244254,0.0002730807,0.0004870474,0.0003578622],"domain_scores_gemma":[0.9992231,0.000086316,0.00005326708,0.0003268208,0.00007282021,0.0002376662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001528485,0.00002681016,0.00008062129,0.0003198071,0.0000268815,0.000006306705,0.004012532,0.01321531,0.00170458,0.9802026,0.00001917252,0.0003700852],"study_design_scores_gemma":[0.0002186191,0.0001169409,0.00003523822,0.0001888933,0.00002134137,0.0000287001,0.0002889449,0.9710822,0.009381864,0.01836295,0.00002972228,0.0002445951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3948767,0.00001419865,0.5972764,0.00005855652,0.0001015635,0.000145879,0.000004261073,0.0001461382,0.007376328],"genre_scores_gemma":[0.931271,0.000002531273,0.06862958,0.00003398262,0.00003033639,0.000005667275,8.412322e-7,0.00002423361,0.000001874842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9618397,"threshold_uncertainty_score":0.5955239,"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."}}