{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253753,0.001438398,0.00176489,0.004422876,0.004612194,0.004387355,0.002806473,0.003259759,0.01119708],"category_scores_gemma":[0.01674811,0.001440458,0.001726865,0.002831623,0.007362162,0.01466473,0.006146097,0.006219035,0.0008127902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002477407,"about_ca_system_score_gemma":0.001231818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00222038,"about_ca_topic_score_gemma":0.003201396,"domain_scores_codex":[0.9988409,0.0003292682,0.00005430199,0.0003432387,0.0002036852,0.0002286781],"domain_scores_gemma":[0.9899042,0.00688759,0.0009028496,0.0004984303,0.0007240745,0.001082785],"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.00003686995,0.00001945023,0.0003913791,0.00006830413,0.000008551376,0.00006339417,0.0004563758,0.001276483,0.000363748,0.9936526,0.001026941,0.002635909],"study_design_scores_gemma":[0.000009187102,0.000007789746,0.0001587637,0.00001882091,0.000009095314,0.00005501821,0.0001388999,0.002832751,0.0001298681,0.9957431,0.0008862573,0.00001039339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5018837,0.004552868,0.3765588,0.00754267,0.0005708212,0.0002343036,0.0008685539,0.0004968167,0.1072915],"genre_scores_gemma":[0.922911,0.002034958,0.04808897,0.001547826,0.000730652,0.000241895,0.0008168844,0.0004595341,0.02316827],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01119708,"threshold_uncertainty_score":0.037458,"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."}}