{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01663491,0.003799024,0.004571954,0.004078055,0.003042976,0.00978803,0.009403328,0.004883331,0.02043141],"category_scores_gemma":[0.1074055,0.002822158,0.004186812,0.003437705,0.007932886,0.01878998,0.0091502,0.01251647,0.002256558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006828154,"about_ca_system_score_gemma":0.006694338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171067,"about_ca_topic_score_gemma":0.002167812,"domain_scores_codex":[0.9878618,0.00353849,0.0005013281,0.002361799,0.002932741,0.002803921],"domain_scores_gemma":[0.7340075,0.2359094,0.005369608,0.01129226,0.006331278,0.007089955],"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.00174251,0.0003354303,0.002416051,0.0009990982,0.0003493807,0.0002818922,0.0007594061,0.2010179,0.006849366,0.7477846,0.009106062,0.02835833],"study_design_scores_gemma":[0.000101114,0.0001181016,0.0005490856,0.0001545433,0.000166039,0.0001899623,0.00009261703,0.3263861,0.002343056,0.6683641,0.001444789,0.00009054034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08030112,0.002658636,0.8637846,0.006550833,0.0006244631,0.0002214808,0.00170525,0.001629198,0.04252457],"genre_scores_gemma":[0.8808833,0.002992596,0.09291661,0.001578022,0.001350438,0.0007774,0.001473165,0.001799815,0.01622871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02043141,"threshold_uncertainty_score":0.08797485,"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."}}