{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008441702,0.0003687561,0.0006554401,0.0001764115,0.0002561043,0.0001727494,0.0004551866,0.0002167046,0.00004553523],"category_scores_gemma":[0.0002717712,0.0003181012,0.0001997248,0.0002913967,0.00008076874,0.0001656779,0.00008925094,0.0001738606,0.00001841442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007079732,"about_ca_system_score_gemma":0.0000493005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001591722,"about_ca_topic_score_gemma":0.000002331605,"domain_scores_codex":[0.9978696,0.00001675762,0.0008615434,0.000437636,0.0003231168,0.0004913937],"domain_scores_gemma":[0.9975536,0.0009986245,0.0003167091,0.0008718011,0.0001310442,0.0001282171],"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.000008568431,0.0003311082,9.016561e-7,0.001171395,0.00007507332,5.047891e-7,0.0005905709,0.0000115679,0.002175617,0.9662259,0.0008168413,0.028592],"study_design_scores_gemma":[0.0004628395,0.0000304582,0.000001614711,0.00009761995,0.0001151251,0.000001559515,0.0004543602,0.3510219,0.001826079,0.6454733,0.000285183,0.0002299597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003495683,0.00001481625,0.9538322,0.00009871634,0.0001073268,0.001869688,0.00006718099,0.0002953113,0.04021905],"genre_scores_gemma":[0.06908674,0.000005318517,0.9289462,0.0001582449,0.00006758287,0.0007175328,0.0000972818,0.00008441399,0.0008366988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3510103,"threshold_uncertainty_score":0.9999271,"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."}}