{"id":"W2058537654","doi":"10.1016/j.disc.2004.06.019","title":"On minimal prime extensions of a four-vertex graph in a prime graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Circulant graph; Neighbourhood (mathematics); Vertex (graph theory); Discrete mathematics; Graph; Prime (order theory); Complement graph; Graph power; Line graph","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.0005698149,0.000239905,0.0004111148,0.000573223,0.00008326019,0.00004819173,0.001125106,0.00008751835,0.00001211805],"category_scores_gemma":[0.0003993427,0.0002002912,0.000191737,0.001329012,0.0002299941,0.0002841089,0.000340431,0.0002817967,0.00004707531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005127804,"about_ca_system_score_gemma":0.0001024775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001132064,"about_ca_topic_score_gemma":0.0000134443,"domain_scores_codex":[0.9977829,0.00008257343,0.0005330169,0.0004378268,0.0006591193,0.0005045003],"domain_scores_gemma":[0.9979397,0.0004320145,0.0001994719,0.001175717,0.0001087713,0.0001443002],"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.00002863806,0.0004162805,0.00006245069,0.00007532902,0.0000259325,0.0000665812,0.00262188,0.0004693887,0.006591221,0.9885817,0.00002045124,0.001040111],"study_design_scores_gemma":[0.0008918589,0.0003111539,0.0008343976,0.0003476767,0.000007602704,0.00003032797,0.0001631574,0.004711786,0.01231682,0.9801299,0.000008790925,0.0002465369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3693414,0.00008381806,0.6270806,0.0003915443,0.00008215778,0.0005889578,0.00001111686,0.0001156451,0.002304796],"genre_scores_gemma":[0.8346898,0.00001603727,0.1650931,0.0000621726,0.000006584113,0.0000329593,0.000001955933,0.00002488143,0.00007244217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4653484,"threshold_uncertainty_score":0.8167636,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03006382065887293,"score_gpt":0.297465557096821,"score_spread":0.2674017364379481,"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."}}