{"id":"W1858133485","doi":"10.37236/2299","title":"On the Cartesian Product of Non Well-Covered Graphs","year":2013,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Cartesian product; Combinatorics; Vertex (graph theory); Mathematics; Cardinality (data modeling); Graph; Product (mathematics); Maximal independent set; Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Geometry; Data mining","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001823021,0.0009059858,0.00109546,0.002634005,0.001407786,0.002624778,0.001101275,0.0008769078,0.003222009],"category_scores_gemma":[0.007814551,0.001286949,0.0008681377,0.002536723,0.003015627,0.007369449,0.003144315,0.001570611,0.0004891595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008402778,"about_ca_system_score_gemma":0.0003611252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032049,"about_ca_topic_score_gemma":0.0007305782,"domain_scores_codex":[0.9980863,0.0005596228,0.00009763025,0.0005600062,0.0004455518,0.0002507676],"domain_scores_gemma":[0.9856219,0.009726304,0.001403335,0.001367508,0.0008847961,0.0009961957],"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.0009641661,0.0001634256,0.01465399,0.0003468085,0.0001659237,0.00198359,0.00277226,0.03305296,0.009383227,0.9049742,0.004176883,0.0273624],"study_design_scores_gemma":[0.00005738094,0.0001675819,0.004828272,0.00007681011,0.0001266746,0.001875199,0.0005040281,0.07981092,0.003356334,0.9037421,0.005412465,0.0000421996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8915353,0.001148607,0.09417903,0.0005974195,0.0000425825,0.00003605258,0.0004550293,0.0002002412,0.01180574],"genre_scores_gemma":[0.9636509,0.001096695,0.03023311,0.0001494759,0.0001678517,0.00008583312,0.001207892,0.0001369744,0.003271297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003222009,"threshold_uncertainty_score":0.01077873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01168114969656787,"score_gpt":0.2604816849212847,"score_spread":0.2488005352247168,"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."}}