{"id":"W7116927456","doi":"10.1016/j.dam.2025.12.013","title":"An approximation algorithm for zero forcing","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Forcing (mathematics); Upper and lower bounds; Vertex (graph theory); Zero (linguistics); Path (computing); Order (exchange); Approximation algorithm","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.0009750215,0.0008736344,0.000926414,0.001417968,0.000877164,0.001527625,0.002184164,0.001118117,0.006591199],"category_scores_gemma":[0.005529039,0.0005472059,0.001190009,0.001255311,0.001493117,0.002972222,0.002525384,0.001741506,0.001552404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001613812,"about_ca_system_score_gemma":0.001697564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002044432,"about_ca_topic_score_gemma":0.002244517,"domain_scores_codex":[0.9989423,0.0001505188,0.00007125377,0.00026032,0.0003447756,0.0002308475],"domain_scores_gemma":[0.997744,0.00113302,0.0001219847,0.0006565012,0.0002502708,0.00009424223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008504725,0.0001820469,0.001996814,0.0004546526,0.00008205277,0.0002252787,0.0005107005,0.2320385,0.03126717,0.3440887,0.01474026,0.3735633],"study_design_scores_gemma":[0.0001140871,0.0001167528,0.0002961664,0.00005950908,0.00004166231,0.0002325832,0.00008021825,0.6789259,0.01390232,0.2970939,0.009094642,0.00004213777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02560059,0.0001790937,0.9675664,0.0002269111,0.00006084285,0.00005682964,0.0001723651,0.001834698,0.00430239],"genre_scores_gemma":[0.2613728,0.0002107733,0.7321064,0.0001661565,0.00005007159,0.000187069,0.0008139908,0.0005245155,0.004568302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006591199,"threshold_uncertainty_score":0.02204978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0232173473149624,"score_gpt":0.3234788113688176,"score_spread":0.3002614640538552,"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."}}