{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008204294,0.0002148086,0.000328863,0.0001900702,0.001671574,0.001474795,0.001974959,0.00008183035,0.00002435098],"category_scores_gemma":[0.00117873,0.0001935783,0.00008941376,0.0002681132,0.0002726443,0.001043872,0.001312993,0.0002248092,0.0001898783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006402613,"about_ca_system_score_gemma":0.00008583193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001041375,"about_ca_topic_score_gemma":0.00001258133,"domain_scores_codex":[0.9981757,0.00006000026,0.0003343982,0.0004448247,0.0003413839,0.0006436475],"domain_scores_gemma":[0.9967723,0.0002688153,0.0001836107,0.002019708,0.0003400402,0.000415454],"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.000006729069,0.00005695879,0.0004905168,0.0000241064,0.00003000491,0.00001164805,0.0003384162,0.00002549576,0.001024047,0.9955315,0.000664731,0.001795874],"study_design_scores_gemma":[0.000722831,0.000127152,0.002033332,0.00009200656,0.00001453802,0.0000496725,0.00005780129,0.02662679,0.002844099,0.9611596,0.005874823,0.000397323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03644024,0.0001348348,0.9517956,0.004884601,0.0001486633,0.0006043096,0.0000774357,0.0001802176,0.005734076],"genre_scores_gemma":[0.7788885,0.00002981962,0.2196655,0.0001343983,0.00003599705,0.00009397817,0.000006490488,0.00002275929,0.001122637],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7424482,"threshold_uncertainty_score":0.9996281,"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."}}