{"id":"W1061820890","doi":"10.1007/s10878-015-9936-0","title":"Lower bounds for positive semidefinite zero forcing and their applications","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex cover; Positive-definite matrix; Theory of computation; Vertex (graph theory); Zero (linguistics); Discrete mathematics; Graph; Forcing (mathematics); Semidefinite programming; Upper and lower bounds; Algorithm; Mathematical optimization","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.01191078,0.006450192,0.003970572,0.007991211,0.003034383,0.008078653,0.008029032,0.004604796,0.0307578],"category_scores_gemma":[0.06133685,0.00261641,0.003346816,0.008062765,0.01013015,0.01432789,0.01233171,0.01303021,0.006302988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004558051,"about_ca_system_score_gemma":0.003117857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001143346,"about_ca_topic_score_gemma":0.002219494,"domain_scores_codex":[0.9941412,0.002028784,0.0002549777,0.0008759077,0.001860832,0.0008382415],"domain_scores_gemma":[0.9250284,0.06051213,0.002669669,0.004470163,0.00448168,0.002837918],"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.0002691043,0.0002373891,0.0004347667,0.0007067771,0.0000820822,0.0001444325,0.0003258073,0.04592532,0.00208179,0.8976603,0.01761194,0.03452035],"study_design_scores_gemma":[0.00003480507,0.00007235952,0.0001839056,0.0002801673,0.00005732577,0.0001448176,0.00008917111,0.1280924,0.0009939255,0.8644246,0.005551453,0.00007510657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0216593,0.005908263,0.8532277,0.005482606,0.001397381,0.0002839157,0.00111841,0.001146704,0.1097757],"genre_scores_gemma":[0.4956357,0.01321589,0.4144401,0.004952924,0.005520076,0.002164915,0.002322904,0.002576421,0.05917113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0307578,"threshold_uncertainty_score":0.1028951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01974725460452239,"score_gpt":0.2832249792297368,"score_spread":0.2634777246252145,"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."}}