{"id":"W4410455285","doi":"10.1007/978-3-031-92935-9_1","title":"Happy Set Problems on Cubic Graphs and Convex Bipartite Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bipartite graph; Regular polygon; Computer science; Combinatorics; Set (abstract data type); Mathematics; Graph; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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.001084526,0.001051475,0.001412544,0.001002047,0.002353437,0.003944539,0.003028837,0.002156183,0.02220244],"category_scores_gemma":[0.005477615,0.0009089694,0.001382923,0.002647816,0.002000765,0.005617647,0.002635563,0.004488186,0.001935203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002123716,"about_ca_system_score_gemma":0.001104302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003070555,"about_ca_topic_score_gemma":0.00377724,"domain_scores_codex":[0.9991571,0.000299897,0.00003078299,0.0001554459,0.0002156679,0.0001411798],"domain_scores_gemma":[0.9978307,0.001503048,0.0001482158,0.0001749307,0.0001391072,0.0002040009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009177544,0.00005769077,0.0001017745,0.0001654604,0.00002090663,0.00005098859,0.0001244255,0.02359455,0.000428054,0.925822,0.0238457,0.02569672],"study_design_scores_gemma":[0.00003237567,0.00002043241,0.0001631959,0.00003432308,0.00001045765,0.00005173135,0.0001333503,0.05002322,0.0002896414,0.9401598,0.009066588,0.00001485946],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1253584,0.003903426,0.485699,0.006846155,0.000897023,0.0002955826,0.002342781,0.0004884076,0.3741692],"genre_scores_gemma":[0.5884516,0.004777701,0.2366634,0.0009452462,0.001215553,0.0008277428,0.004071795,0.0007590422,0.1622879],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.02220244,"threshold_uncertainty_score":0.07427454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02357357690253381,"score_gpt":0.2809783464260794,"score_spread":0.2574047695235456,"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."}}