{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004031396,0.0003693083,0.0006324729,0.0003629203,0.0002196656,0.000160184,0.006943045,0.0001414361,0.00001713261],"category_scores_gemma":[0.0003582831,0.0002017757,0.0004526171,0.0009800751,0.0002639004,0.0002413729,0.00103028,0.004102848,0.00002067271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003816197,"about_ca_system_score_gemma":0.001426418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001559956,"about_ca_topic_score_gemma":0.000001963825,"domain_scores_codex":[0.995701,0.0007697986,0.0007878563,0.0003711698,0.001469122,0.0009010309],"domain_scores_gemma":[0.9942005,0.0009851902,0.001502745,0.002288022,0.0009133681,0.0001102086],"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.00005540391,0.0001700451,0.0000246055,0.00003901911,0.0002019029,0.000005818258,0.0003684861,0.0009487722,0.0004407125,0.9954843,0.001296778,0.0009641903],"study_design_scores_gemma":[0.0003884221,0.000860343,0.0001378319,0.0001558682,0.00003454653,0.00006597363,0.0000361648,0.001056156,0.008597458,0.9878625,0.0006119919,0.0001927078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7468236,0.01227358,0.2107256,0.01629182,0.003807835,0.003919131,0.000006210038,0.00008605605,0.006066195],"genre_scores_gemma":[0.9982153,0.001110337,0.00008241372,0.00009443034,0.00008550084,0.00003261423,6.315499e-7,0.00003335093,0.0003454595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2513917,"threshold_uncertainty_score":0.9984299,"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."}}