{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002869599,0.001351884,0.001334125,0.002243807,0.002608643,0.005145019,0.00380195,0.003724845,0.0436339],"category_scores_gemma":[0.02103742,0.0006227689,0.001970203,0.002549075,0.005824191,0.01984217,0.005565431,0.007909551,0.003870676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002186072,"about_ca_system_score_gemma":0.0008971141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002392864,"about_ca_topic_score_gemma":0.00234234,"domain_scores_codex":[0.9966768,0.0007197935,0.0001791076,0.0007735743,0.001119801,0.0005310038],"domain_scores_gemma":[0.9715921,0.02187825,0.0009511646,0.002818773,0.001651833,0.001107824],"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.0001870136,0.00007712907,0.0009401641,0.0002784455,0.00003686603,0.0003630789,0.0003015521,0.003897476,0.0009550628,0.9546496,0.02744026,0.01087341],"study_design_scores_gemma":[0.00001681043,0.00001666915,0.0004428125,0.00002442076,0.00001035257,0.0001307332,0.00009182401,0.002795154,0.0003481757,0.9901653,0.005938102,0.00001970361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1223346,0.005354388,0.2753663,0.1053822,0.005029186,0.0002428465,0.004289659,0.001849203,0.4801516],"genre_scores_gemma":[0.8539632,0.004141432,0.06212906,0.01529412,0.005250137,0.0004570854,0.002523037,0.0007411803,0.05550074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0436339,"threshold_uncertainty_score":0.14597,"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."}}