{"id":"W2023058821","doi":"10.1016/j.disopt.2009.05.003","title":"Chip firing and all-terminal network reliability bounds","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Reliability (semiconductor); Bounding overwatch; Terminal (telecommunication); Computer science; Chip; Reliability theory; Graph; Mathematics; Graph theory; Reliability engineering; Algorithm; Combinatorics; Theoretical computer science; Failure rate; Engineering; Statistics; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0002731769,0.00009952352,0.0001108173,0.00002310617,0.0001937107,0.00005520321,0.00007525214,0.00005812281,0.00004391486],"category_scores_gemma":[0.00008012222,0.00009127744,0.00003627908,0.0001377159,0.00004719511,0.0001379635,0.00001933017,0.00007814742,0.000002296699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001162562,"about_ca_system_score_gemma":0.000006813739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.772453e-7,"about_ca_topic_score_gemma":0.000001185051,"domain_scores_codex":[0.9993386,0.00004589471,0.0001821367,0.000191499,0.00008182225,0.000160013],"domain_scores_gemma":[0.9995157,0.00008085041,0.00007658009,0.0002406491,0.00003059959,0.00005567381],"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.00005411108,0.0001094668,0.0009762539,0.00004575891,0.00002590398,0.000002142596,0.000658372,0.1300828,0.0001080414,0.8627055,0.001493843,0.003737789],"study_design_scores_gemma":[0.0002459341,0.00005837865,0.002461225,0.00003710315,0.00006817723,0.00001044418,0.00002771363,0.1180077,0.00007147535,0.8781995,0.0006244032,0.0001879549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4642242,0.0001896141,0.5170193,0.002128881,0.0001149385,0.0007569846,0.00001317467,0.0003507573,0.01520221],"genre_scores_gemma":[0.9062754,0.00003665199,0.09319792,0.0001490111,0.00008648246,0.00001621925,0.00003992498,0.00001092028,0.0001874964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4420512,"threshold_uncertainty_score":0.3722186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02141643991881777,"score_gpt":0.3003653373785734,"score_spread":0.2789488974597557,"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."}}