{"id":"W84752148","doi":"","title":"Lower bounds on the signed k-subdomination number of graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","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.001899602,0.001688351,0.001398716,0.003598219,0.002088221,0.004954644,0.003244241,0.002306418,0.01949267],"category_scores_gemma":[0.0205576,0.0006478331,0.001017138,0.002768692,0.002764025,0.009613397,0.003196584,0.00481646,0.004606847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002419759,"about_ca_system_score_gemma":0.00135928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006131256,"about_ca_topic_score_gemma":0.001472572,"domain_scores_codex":[0.9979797,0.0003700349,0.0001262477,0.0003896613,0.0006933405,0.0004410087],"domain_scores_gemma":[0.9811578,0.01220016,0.001301285,0.002166167,0.001504057,0.001670488],"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.001189924,0.0002895686,0.004152395,0.0008705138,0.0001091242,0.0003314276,0.0004708963,0.0244382,0.01484371,0.8258269,0.03458457,0.0928928],"study_design_scores_gemma":[0.00006797042,0.000120149,0.00206139,0.0001672299,0.00008845438,0.0005773888,0.0001719989,0.04823378,0.00727163,0.9233132,0.01785404,0.00007275906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.338095,0.006730266,0.2862054,0.01032786,0.00203785,0.0002777801,0.004467978,0.00239248,0.3494654],"genre_scores_gemma":[0.8758234,0.003495801,0.08220234,0.001134899,0.001031994,0.0004874089,0.003340452,0.0007146199,0.03176902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01949267,"threshold_uncertainty_score":0.06520945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0136541518866032,"score_gpt":0.2796857383714805,"score_spread":0.2660315864848773,"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."}}