{"id":"W4412435997","doi":"10.55016/ojs/cdm.v11i2.62553","title":"Fully Indecomposable and Nearly Decomposable Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences; Sharif University of Technology","keywords":"Combinatorics; Mathematics; Indecomposable module; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002868708,0.0004834139,0.0002581021,0.0006681523,0.0004437695,0.0006670624,0.000656779,0.0004874787,0.004406344],"category_scores_gemma":[0.00188256,0.0003441123,0.0003305099,0.0005670654,0.0009024424,0.001559244,0.000880103,0.0009279113,0.0004870626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002354649,"about_ca_system_score_gemma":0.0002182029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003356858,"about_ca_topic_score_gemma":0.0003920926,"domain_scores_codex":[0.9995302,0.00007333012,0.00002720054,0.0001677225,0.000102469,0.00009913979],"domain_scores_gemma":[0.9981666,0.0006834063,0.0003377874,0.0003137659,0.000192533,0.0003058528],"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.000491211,0.0002365048,0.005680252,0.0002677237,0.00009227523,0.004532611,0.0009380172,0.03697164,0.07231393,0.7985704,0.006516572,0.07338895],"study_design_scores_gemma":[0.00003172684,0.0001080465,0.003218603,0.00002565611,0.00002453749,0.002190961,0.0002885495,0.06169171,0.009988104,0.9155148,0.006883794,0.00003362745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.766965,0.0003782319,0.195505,0.0005357455,0.00005451125,0.00007100487,0.001307696,0.0004473596,0.03473548],"genre_scores_gemma":[0.9631385,0.000260981,0.02866589,0.000169147,0.00006879656,0.00006241404,0.001289785,0.00006192945,0.006282557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004406344,"threshold_uncertainty_score":0.01474065,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01858071375396913,"score_gpt":0.3376772356103748,"score_spread":0.3190965218564057,"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."}}