{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117276,0.001487437,0.001558125,0.001380182,0.0009759853,0.001865932,0.003327462,0.001411054,0.007827712],"category_scores_gemma":[0.01602652,0.0007213961,0.001224976,0.001385617,0.002030272,0.004179969,0.002267853,0.00391606,0.0007899089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001945241,"about_ca_system_score_gemma":0.001120962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001771117,"about_ca_topic_score_gemma":0.002365748,"domain_scores_codex":[0.9988212,0.000341607,0.00003898093,0.0002195411,0.0003582446,0.0002203857],"domain_scores_gemma":[0.9883084,0.007878407,0.0008062187,0.001311555,0.001125715,0.0005696989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002356011,0.0000718122,0.0006348381,0.0001798787,0.00005928964,0.000108289,0.0001347716,0.6215197,0.003483366,0.3490681,0.003242963,0.02126145],"study_design_scores_gemma":[0.00001336506,0.00005116222,0.000434948,0.00006183118,0.00005052298,0.00007586872,0.0000401149,0.7364299,0.00309056,0.2586648,0.001063851,0.00002300889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09767742,0.001841114,0.8602396,0.001112554,0.0002365346,0.00004560087,0.0002748322,0.0004516592,0.03812062],"genre_scores_gemma":[0.9144586,0.001810532,0.06929398,0.0003260075,0.0001733949,0.0001218865,0.0002429744,0.0004322392,0.01314032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007827712,"threshold_uncertainty_score":0.02618629,"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."}}