{"id":"W2053756329","doi":"10.1016/j.disc.2008.08.013","title":"More on almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Complement (music); Constructive proof; Automorphism; Discrete mathematics; Graph; Matching (statistics); Order (exchange); Existential quantification","routes":{"ca_aff":true,"ca_fund":true,"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.0006997515,0.000808518,0.0009459562,0.001849658,0.001246438,0.001395316,0.001096801,0.00171139,0.02321296],"category_scores_gemma":[0.002412752,0.0003060119,0.001066205,0.002628678,0.001853196,0.006896107,0.001316379,0.002523428,0.002557611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116032,"about_ca_system_score_gemma":0.0003438042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001510975,"about_ca_topic_score_gemma":0.001621414,"domain_scores_codex":[0.9995304,0.0001589075,0.0000121991,0.00009095776,0.0001527814,0.00005480109],"domain_scores_gemma":[0.9986946,0.0006564055,0.00006779412,0.0002892181,0.0002081916,0.00008388855],"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.000008458015,0.00001968219,0.00005191633,0.00006979713,0.000008791371,0.00004465513,0.0000740491,0.001372673,0.000335659,0.9744105,0.01507989,0.008524016],"study_design_scores_gemma":[0.00000436119,0.000004663874,0.00005631109,0.00001576225,0.000004089737,0.00004115503,0.00002403727,0.00109377,0.0000954408,0.9763315,0.02232179,0.000007100858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05142032,0.0128124,0.2713037,0.06187804,0.01230403,0.00007198963,0.001240483,0.0004919341,0.5884771],"genre_scores_gemma":[0.5462694,0.01829194,0.08149195,0.0422862,0.01536454,0.0001583465,0.001565334,0.0009109,0.2936615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02321296,"threshold_uncertainty_score":0.07765514,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05181479243030929,"score_gpt":0.295176398150736,"score_spread":0.2433616057204267,"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."}}