{"id":"W2404905038","doi":"","title":"Boundary powerful k-alliances in graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Alliance; Boundary (topology); Combinatorics; Graph; Offensive; Discrete mathematics; Mathematical analysis; Political science; Operations research","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003987573,0.0001579466,0.0001900031,0.0002582594,0.0001061005,0.0002053632,0.001368826,0.00006900842,0.00009981841],"category_scores_gemma":[0.00008659304,0.0001518393,0.00006258611,0.001208129,0.0001742474,0.001351128,0.0003590903,0.0003152353,0.0008306419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005960819,"about_ca_system_score_gemma":0.00007794141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007178678,"about_ca_topic_score_gemma":0.000009139624,"domain_scores_codex":[0.9982193,0.0001438783,0.0002395482,0.0004487031,0.0003964714,0.000552104],"domain_scores_gemma":[0.9987318,0.0001852731,0.00005871634,0.0007584937,0.0001170073,0.0001487348],"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.000003330676,0.00008039614,0.009823875,0.00000661508,0.000006023178,0.00002035302,0.0002080088,0.000006637431,0.0004264147,0.9811879,0.001406229,0.006824232],"study_design_scores_gemma":[0.0004602689,0.00008536938,0.02734161,0.0000185615,5.374832e-7,0.000004782326,0.00003427437,0.0008924138,0.0007155214,0.9675249,0.002739999,0.0001817435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9816064,0.0008770957,0.002077392,0.001408195,0.001785922,0.0004697197,7.681572e-7,0.0002297686,0.01154474],"genre_scores_gemma":[0.9946721,0.00005246197,0.004467736,0.0002145043,0.000003152175,0.00005242522,0.000001093997,0.0000135493,0.0005229897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01751773,"threshold_uncertainty_score":0.9999473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01297498511765379,"score_gpt":0.2712440401254521,"score_spread":0.2582690550077983,"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."}}