{"id":"W2608271081","doi":"10.1016/j.disc.2018.03.026","title":"On 1-uniqueness and dense critical graphs for tree-depth","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Uniqueness; Conjecture; Vertex (graph theory); Graph; Discrete mathematics","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.000462443,0.0001512607,0.000189881,0.0001291331,0.0002156873,0.0001486021,0.0005414829,0.00005750263,0.000007400027],"category_scores_gemma":[0.0007228097,0.000120654,0.00006600689,0.0002416388,0.0004336048,0.0002220548,0.000193144,0.00009880789,0.00002755547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001370556,"about_ca_system_score_gemma":0.00002201044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.177885e-7,"about_ca_topic_score_gemma":0.000006689654,"domain_scores_codex":[0.9987932,0.00005516223,0.0001962699,0.0003326918,0.0002572558,0.0003653999],"domain_scores_gemma":[0.9978095,0.001226374,0.00004234621,0.0006168704,0.0001613308,0.0001435905],"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.00001698573,0.00004429615,0.00001301849,0.00008248998,0.000008570476,0.000004360511,0.000693946,6.157562e-7,0.0004634426,0.9949449,0.0001859801,0.003541417],"study_design_scores_gemma":[0.0002304524,0.0003804036,0.00004925025,0.00005879411,0.000006625055,0.00001818904,0.00008002689,0.03167224,0.005767886,0.961417,0.0001586896,0.0001604139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03111848,0.00002984881,0.9641911,0.0005428765,0.0000943454,0.0003128771,0.0000080441,0.0001253819,0.003577001],"genre_scores_gemma":[0.6728328,0.000005555677,0.3266367,0.0002087524,0.00004191451,0.00006504598,0.000001145374,0.00002552218,0.0001825934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6417143,"threshold_uncertainty_score":0.4920128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03676595863659552,"score_gpt":0.3534904469610584,"score_spread":0.3167244883244628,"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."}}