{"id":"W2973207532","doi":"10.1016/j.ejc.2021.103405","title":"Bounds on expected propagation time of probabilistic zero forcing","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"National Sanitarium Association; Division of Mathematical Sciences; National Security Agency; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Graph; Probabilistic logic; Binary logarithm; Discrete mathematics; Connectivity; Mathematical analysis; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006982738,0.0002321665,0.0006420468,0.0004025214,0.0001232004,0.0003375915,0.001469038,0.00007159479,0.0001388415],"category_scores_gemma":[0.00547457,0.0001814922,0.0003512402,0.0007486809,0.0001274568,0.000157067,0.0004640627,0.0008416647,0.0001085865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001091461,"about_ca_system_score_gemma":0.0003347341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.858918e-7,"about_ca_topic_score_gemma":9.496294e-8,"domain_scores_codex":[0.9941628,0.001888791,0.001826002,0.0003589503,0.001587388,0.0001760551],"domain_scores_gemma":[0.9925476,0.001024017,0.002964381,0.0009198947,0.00239613,0.0001479904],"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.001517331,0.008941654,0.002777329,0.0009386486,0.001093137,0.00169653,0.03190305,0.09934065,0.03869074,0.6907727,0.04595973,0.07636848],"study_design_scores_gemma":[0.001782213,0.001582471,0.01073225,0.001692279,0.0002412734,0.0001752906,0.001090135,0.002001013,0.008088933,0.9665365,0.005353013,0.0007246039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.944711,0.0002194973,0.03516309,0.0003285858,0.001192015,0.0002847458,0.00001024523,0.00002338053,0.01806745],"genre_scores_gemma":[0.9980137,0.00001645785,0.0005338494,0.00003421722,0.0001193881,0.000002408554,0.000008291325,0.0000343343,0.001237295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2757638,"threshold_uncertainty_score":0.7401038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07555647171697927,"score_gpt":0.3301831449677431,"score_spread":0.2546266732507639,"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."}}