{"id":"W2403682178","doi":"","title":"Remarks on the complexity of signed k-independece on graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Signed graph; Combinatorics; Discrete mathematics; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610951,0.0002673719,0.0003647933,0.0001315297,0.0001540785,0.000101509,0.002224356,0.000112726,0.00002143453],"category_scores_gemma":[0.0004648206,0.0001939902,0.0001531817,0.0008022958,0.0003901732,0.0001836558,0.0006163628,0.0003724192,0.00009925025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001340145,"about_ca_system_score_gemma":0.0001455986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009389665,"about_ca_topic_score_gemma":0.00001102715,"domain_scores_codex":[0.9970925,0.0005005892,0.0004047673,0.0006101019,0.0009962412,0.000395781],"domain_scores_gemma":[0.9965799,0.0007868128,0.0002177509,0.00186725,0.0003395129,0.0002087722],"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.00003133212,0.0004183731,0.0004464806,0.000006132132,0.0000200884,0.00000967505,0.0004446998,0.00007537318,0.00006512905,0.992069,0.003990425,0.002423305],"study_design_scores_gemma":[0.0008326223,0.0008739386,0.005290218,0.00002318717,0.000005474271,0.000005923979,0.00004810552,0.0105735,0.002583287,0.9791051,0.0004338452,0.000224828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9255608,0.0001191528,0.008270798,0.01082697,0.007947295,0.001265245,0.00001138057,0.0005815112,0.0454168],"genre_scores_gemma":[0.9964404,0.000001785888,0.002928776,0.0005274684,0.00001266223,0.00001663095,0.000002185317,0.00001452563,0.00005555573],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07087957,"threshold_uncertainty_score":0.7910692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05864324606427127,"score_gpt":0.2635474071256836,"score_spread":0.2049041610614124,"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."}}