{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006949622,0.0009356198,0.001153116,0.001413879,0.002676952,0.001759421,0.00152626,0.001061561,0.005944472],"category_scores_gemma":[0.002074778,0.0005444117,0.00119888,0.001311744,0.002295439,0.003775261,0.002224721,0.003090879,0.0006311872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009175861,"about_ca_system_score_gemma":0.0005211423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242757,"about_ca_topic_score_gemma":0.001919694,"domain_scores_codex":[0.9995878,0.0001314101,0.00001747931,0.0001064018,0.00007501194,0.00008176194],"domain_scores_gemma":[0.9986324,0.0005314229,0.0002186989,0.0001277363,0.0001293765,0.0003603185],"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.0001582889,0.00004843134,0.0003633028,0.00007175033,0.00001258449,0.0003093435,0.0005141307,0.002806044,0.001742322,0.9872384,0.001691437,0.005043875],"study_design_scores_gemma":[0.00002192519,0.0000256363,0.0003350922,0.00002247683,0.00001723388,0.0001552312,0.0001763165,0.005763076,0.0005384479,0.990222,0.002711423,0.000011262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8121806,0.0004877007,0.08217791,0.001930496,0.0002896613,0.0001216263,0.0004894771,0.0002289009,0.1020937],"genre_scores_gemma":[0.933803,0.000563255,0.0396507,0.0004184146,0.0002655349,0.0001302757,0.0007792967,0.000150602,0.02423895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005944472,"threshold_uncertainty_score":0.0198862,"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."}}