{"id":"W4391294907","doi":"10.1016/j.dam.2024.01.014","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si5.svg\"> <mml:mi>q</mml:mi> </mml:math> -analogue of zero forcing for certain families of graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; University of Manitoba; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Scalable Vector Graphics; Zero (linguistics); Combinatorics; Forcing (mathematics); Algorithm; Discrete mathematics; Mathematical analysis; Computer science; World Wide Web","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.0007139654,0.0003413439,0.0005012061,0.001077244,0.001326368,0.003210946,0.0009483691,0.0009826673,0.1354329],"category_scores_gemma":[0.002900112,0.0004260433,0.0007803719,0.00124494,0.00185948,0.00500467,0.001395221,0.002434732,0.03035011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297113,"about_ca_system_score_gemma":0.0005470169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790981,"about_ca_topic_score_gemma":0.001749941,"domain_scores_codex":[0.9994277,0.0001538058,0.0000389129,0.0001576344,0.0001593379,0.00006257468],"domain_scores_gemma":[0.998264,0.0007509955,0.0001012525,0.0004152621,0.0003416793,0.0001268708],"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.00003294385,0.00001383677,0.00009662627,0.0001059124,0.000003663627,0.00007357757,0.0002639965,0.0001954964,0.00130486,0.911444,0.07425657,0.01220855],"study_design_scores_gemma":[0.00003536384,0.00001985231,0.0006422806,0.00006250527,0.000007518411,0.0004550779,0.0001432351,0.002889617,0.003505747,0.6304457,0.3617496,0.00004359595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01088287,0.0004784488,0.2357891,0.007354937,0.001769698,0.00008816951,0.00529339,0.00455241,0.7337909],"genre_scores_gemma":[0.396506,0.001802447,0.1537536,0.005983838,0.002086721,0.0004276817,0.01063493,0.01312855,0.4156762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1354329,"threshold_uncertainty_score":0.4530681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02191222765559496,"score_gpt":0.275700517625191,"score_spread":0.253788289969596,"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."}}