{"id":"W2269982198","doi":"10.55016/ojs/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.0004641867,0.0004475822,0.0004046276,0.0009635363,0.001261865,0.001780023,0.0006803258,0.000434236,0.005782949],"category_scores_gemma":[0.002486791,0.0004172764,0.0004987666,0.0007983525,0.002979068,0.004223831,0.001911071,0.001553044,0.0004671011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004871494,"about_ca_system_score_gemma":0.0002853258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000720231,"about_ca_topic_score_gemma":0.000843758,"domain_scores_codex":[0.9993856,0.00009591337,0.00004634066,0.0001647087,0.0001905616,0.0001168022],"domain_scores_gemma":[0.9973158,0.001300539,0.000390261,0.0003668428,0.0002013688,0.0004250656],"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.0001081333,0.00004562923,0.002077288,0.00004939402,0.00001465033,0.0007225895,0.000731127,0.003047925,0.006970564,0.9745393,0.0007996762,0.0108937],"study_design_scores_gemma":[0.00001345011,0.00003871823,0.001345818,0.00001749145,0.00001948714,0.0008571527,0.0003211072,0.01228994,0.008694651,0.9706642,0.005710235,0.00002767305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7904544,0.0004867245,0.1482228,0.0003957714,0.00005751648,0.00003990039,0.0002126218,0.0001975477,0.0599327],"genre_scores_gemma":[0.9819842,0.0002464546,0.01183085,0.00006765181,0.00004558817,0.00002814591,0.000299877,0.0000718687,0.005425338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005782949,"threshold_uncertainty_score":0.01934594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02411014843513037,"score_gpt":0.3497646671427325,"score_spread":0.3256545187076021,"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."}}