{"id":"W4415556773","doi":"10.61091/jcmcc128-07","title":"Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Wiener index; Connectivity; Graph; Vertex (graph theory); Real number; Topological index","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003253503,0.0007165,0.001923144,0.0004530627,0.0008981514,0.000349129,0.0009481462,0.0004545314,0.00001845158],"category_scores_gemma":[0.0007907081,0.0005158585,0.0004004404,0.001767784,0.0008112231,0.0002399505,0.0004838022,0.001367425,0.000001343747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006182046,"about_ca_system_score_gemma":0.000403379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002141111,"about_ca_topic_score_gemma":0.000003146982,"domain_scores_codex":[0.9951314,0.0005289903,0.002413739,0.0004370574,0.0009023456,0.000586424],"domain_scores_gemma":[0.9886538,0.00553014,0.003299767,0.0007786827,0.001466457,0.0002711574],"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.0003497472,0.001404262,0.0005511345,0.0009930469,0.001127912,0.00001204417,0.002637467,0.000002192058,0.0008954924,0.9899964,0.0002646899,0.001765593],"study_design_scores_gemma":[0.008092692,0.0009000745,0.000247712,0.002239858,0.00151872,0.0001996326,0.00320516,0.001048707,0.002072353,0.9796991,0.0002973629,0.0004785711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9887514,0.0006621249,0.001469418,0.0006339796,0.005391501,0.0009423749,0.000009172464,0.00003213541,0.002107877],"genre_scores_gemma":[0.9974868,0.0002207241,0.001907409,0.00004991181,0.0002398549,0.000008134459,0.000001338977,0.00006600023,0.00001988113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01029726,"threshold_uncertainty_score":0.9997293,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0140703795903176,"score_gpt":0.2755205080906672,"score_spread":0.2614501285003496,"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."}}