{"id":"W2142143427","doi":"10.1016/j.disc.2015.09.027","title":"Uniqueness and minimal obstructions for tree-depth","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Discrete mathematics; Graph; Uniqueness","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.0003701368,0.0001087365,0.0001525984,0.00008377352,0.00009712041,0.0001132626,0.0004411854,0.00004012868,0.000001285751],"category_scores_gemma":[0.0002372453,0.0000905697,0.00004263761,0.0002207122,0.000116898,0.0003174231,0.0002002125,0.00006946278,0.000007731608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002280985,"about_ca_system_score_gemma":0.00004901874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001349823,"about_ca_topic_score_gemma":0.000006623518,"domain_scores_codex":[0.9991319,0.00003208414,0.0001746477,0.0002184559,0.0002032784,0.0002396129],"domain_scores_gemma":[0.9989861,0.0002298472,0.00006188546,0.0004317947,0.0001251774,0.0001652284],"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.000006995592,0.00002433908,0.00007716125,0.00005602109,0.00001187839,0.000002344208,0.001753671,0.00001890923,0.0002298223,0.9911505,0.0002012952,0.006467056],"study_design_scores_gemma":[0.0004271089,0.0001175964,0.00009825637,0.00002103614,0.000007995414,0.00003985739,0.0008438457,0.06641092,0.001773687,0.9287872,0.001305314,0.0001672027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02368083,0.00007331769,0.9717608,0.0003707344,0.00009022371,0.0003003884,0.00001038596,0.0001207151,0.003592574],"genre_scores_gemma":[0.2186838,0.000005294976,0.7804741,0.00003237735,0.00004034244,0.00008508143,0.000003044963,0.00002074604,0.0006551944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1950029,"threshold_uncertainty_score":0.3693325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06581150215029835,"score_gpt":0.3367363074743629,"score_spread":0.2709248053240645,"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."}}