{"id":"W344896498","doi":"10.46298/dmtcs.2073","title":"Uniquely monopolar-partitionable block graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Postdoctoral Science Foundation","keywords":"Combinatorics; Mathematics; Chordal graph; Bipartite graph; Indifference graph; Cograph; Pathwidth; Partition (number theory); Discrete mathematics; Maximal independent set; 1-planar graph; Modular decomposition; Vertex (graph theory); Block graph; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003745415,0.0003558031,0.0004013132,0.0004429086,0.0008581587,0.0009184926,0.004785634,0.00008713604,0.00006146912],"category_scores_gemma":[0.000446397,0.0002893314,0.0001678008,0.002286309,0.004153962,0.001232617,0.001962431,0.0004025132,0.0002393267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005918197,"about_ca_system_score_gemma":0.0001245141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001675206,"about_ca_topic_score_gemma":5.295647e-7,"domain_scores_codex":[0.9954152,0.0002530443,0.000536499,0.001081661,0.001525366,0.001188296],"domain_scores_gemma":[0.9959447,0.0008114415,0.0001521081,0.002073275,0.0004206729,0.0005977393],"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.000003790142,0.0000916354,0.00002377049,0.00002858528,0.000007130392,0.000005808311,0.0004442839,0.0002118695,0.001026502,0.9957051,0.00005377453,0.002397738],"study_design_scores_gemma":[0.0001293767,0.0001154588,0.00003472208,0.00003382333,0.000003759303,0.00003134379,0.00001167198,0.4259019,0.003183584,0.5701854,0.0001408888,0.0002280823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01321789,0.00002138706,0.9687964,0.0009611241,0.0002697321,0.0003266855,0.000003103592,0.0004141423,0.01598958],"genre_scores_gemma":[0.5889589,0.00000401124,0.4106293,0.0003022044,0.00003354475,0.00002180026,0.000001068796,0.00001718612,0.00003199112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.575741,"threshold_uncertainty_score":0.9999559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01466658074978645,"score_gpt":0.2808183078698894,"score_spread":0.266151727120103,"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."}}