{"id":"W4404238465","doi":"10.1109/tkde.2024.3496586","title":"Finding Antagonistic Communities in Signed Uncertain Graphs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Computer science; Signed graph; Theoretical computer science; Graph","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.001346323,0.001166185,0.001040042,0.002718674,0.001305532,0.001407698,0.001664423,0.001478179,0.001272802],"category_scores_gemma":[0.009047104,0.000643951,0.001070122,0.002106952,0.001179943,0.003413264,0.001730009,0.00118603,0.0003474452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009741019,"about_ca_system_score_gemma":0.0007660902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003979759,"about_ca_topic_score_gemma":0.004774017,"domain_scores_codex":[0.9984646,0.0004417927,0.00008259345,0.000445033,0.0004471432,0.0001188033],"domain_scores_gemma":[0.9950818,0.002613518,0.001085192,0.0004387455,0.0005048123,0.000275893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004293511,0.0001746331,0.01354535,0.0004550338,0.0002307108,0.001325648,0.0007183108,0.6923497,0.008503641,0.06972886,0.006722284,0.2058165],"study_design_scores_gemma":[0.00001670428,0.00002660731,0.0009457002,0.00001837324,0.0000230403,0.0002159987,0.0001253254,0.9121774,0.001221473,0.08340582,0.001807307,0.00001619773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09651108,0.0006088688,0.8987963,0.0004736056,0.00003495325,0.0001169776,0.0005537969,0.0004570287,0.002447371],"genre_scores_gemma":[0.7307159,0.0006445055,0.2634322,0.0003174124,0.0001280797,0.0001614257,0.001993506,0.0001311588,0.002475872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003979759,"threshold_uncertainty_score":0.007913232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03610903175891978,"score_gpt":0.2821716042545989,"score_spread":0.2460625724956791,"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."}}