{"id":"W2049419313","doi":"10.1016/j.ejc.2010.03.008","title":"Subgraphs with orthogonal factorizations and algorithms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Factorization; Vertex (graph theory); Integer (computer science); Induced subgraph; Discrete mathematics; Algorithm; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004789013,0.0001059335,0.0001417557,0.0001203716,0.00006422413,0.00004826385,0.0001406756,0.00002010645,0.00001409617],"category_scores_gemma":[0.00002027197,0.00008205455,0.0000405967,0.0002162149,0.00004817508,0.0001439704,0.00001097684,0.0003880422,0.000004886717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005017182,"about_ca_system_score_gemma":0.00001162886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.067404e-7,"about_ca_topic_score_gemma":5.61178e-7,"domain_scores_codex":[0.9993394,0.0000823317,0.0002414657,0.00005633424,0.000164446,0.0001160214],"domain_scores_gemma":[0.999498,0.00004287533,0.00009122039,0.0001101361,0.0001225867,0.0001352113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001028922,0.0003587196,0.139148,0.0002635354,0.0007409657,0.001605889,0.003623891,0.001998545,0.03198386,0.7976208,0.003390486,0.01916233],"study_design_scores_gemma":[0.01212097,0.003880703,0.553735,0.0005900921,0.0004899856,0.009873049,0.001518218,0.003640769,0.008588271,0.05435545,0.3483957,0.002811773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9777991,0.0002221326,0.0117685,0.00001884295,0.001626449,0.0000380017,0.000003135893,0.00004864895,0.008475219],"genre_scores_gemma":[0.9994621,0.00004739414,0.0002942786,0.000006582436,0.0001113112,2.360759e-7,8.692779e-7,0.00003219999,0.00004499401],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7432654,"threshold_uncertainty_score":0.3346087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003388723162634998,"score_gpt":0.1564607481507949,"score_spread":0.1530720249881599,"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."}}