{"id":"W1497440123","doi":"10.1007/978-3-540-39890-5_24","title":"On the Recognition of General Partition Graphs","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Frequency partition of a graph; Discrete mathematics; Partition (number theory); Vertex (graph theory); Planar graph; Outerplanar graph; Pathwidth; Graph; Line graph; Graph power","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411012,0.0003243723,0.0003107255,0.0007531429,0.0002323725,0.0001634527,0.002283031,0.0001797259,0.00004799003],"category_scores_gemma":[0.0002076078,0.0002352799,0.0001408776,0.0008832,0.001066764,0.000358512,0.0004182351,0.0007400933,0.00004088953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166915,"about_ca_system_score_gemma":0.0001699153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004655193,"about_ca_topic_score_gemma":0.00001181606,"domain_scores_codex":[0.9969751,0.0001242027,0.000390911,0.0009546562,0.001061564,0.0004935208],"domain_scores_gemma":[0.9970751,0.0009687838,0.0002563049,0.001305847,0.0002993624,0.00009456604],"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.00001065431,0.00003046858,0.000006458968,0.00001620562,0.000008550289,0.00001758634,0.0001718771,0.007469562,0.0004335278,0.6750975,0.00006067933,0.316677],"study_design_scores_gemma":[0.0001194747,0.0002172494,0.00001893431,0.0001863455,0.000002796771,0.00001845644,7.251791e-8,0.03666041,0.01054241,0.95176,0.000215349,0.0002585207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007450499,0.0001252707,0.9913849,0.0008275845,0.0007086677,0.0003989422,0.000007321544,0.00005309678,0.005749188],"genre_scores_gemma":[0.3946394,0.0002938622,0.5935664,0.009828403,0.0004302533,0.0000922879,0.00002299937,0.0001127979,0.001013681],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3978185,"threshold_uncertainty_score":0.9594436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03503227322603025,"score_gpt":0.2766525167281121,"score_spread":0.2416202435020818,"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."}}