{"id":"W2127629780","doi":"10.1002/jgt.21755","title":"On the Polarity and Monopolarity of Graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Pathwidth; Indifference graph; Cograph; Strong perfect graph theorem; Maximal independent set; 1-planar graph; Modular decomposition; Discrete mathematics; Split graph; Metric dimension; Bipartite graph; Time complexity; Line graph; 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.0004014168,0.0003611772,0.0003309197,0.001358938,0.0007892239,0.002307841,0.0007736234,0.0006934204,0.004730908],"category_scores_gemma":[0.005162069,0.0003936542,0.0004644098,0.001186656,0.001601264,0.003865992,0.001341979,0.00131467,0.0006942165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006608107,"about_ca_system_score_gemma":0.0004313212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001638838,"about_ca_topic_score_gemma":0.001230032,"domain_scores_codex":[0.9992761,0.0001435557,0.00003964252,0.0002123168,0.0002112382,0.0001172164],"domain_scores_gemma":[0.9943941,0.003797411,0.0004601715,0.0004919877,0.0005797695,0.0002765162],"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.0006170607,0.0001833732,0.00852618,0.0008133965,0.00006929501,0.001168005,0.001582305,0.06423938,0.05073035,0.6473264,0.01508852,0.2096557],"study_design_scores_gemma":[0.00004098838,0.00006956962,0.002112694,0.00007363885,0.00003049794,0.0008021918,0.0005520494,0.1104004,0.01471751,0.8598031,0.01135632,0.00004098079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4905118,0.001058314,0.4591831,0.003481933,0.0001720865,0.0002911747,0.001524629,0.0009897971,0.04278713],"genre_scores_gemma":[0.938817,0.0008737114,0.05414169,0.0004780832,0.0001533235,0.00008421537,0.001464127,0.0001010453,0.003886837],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004730908,"threshold_uncertainty_score":0.01582646,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01533379284387667,"score_gpt":0.2595133158819415,"score_spread":0.2441795230380649,"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."}}