{"id":"W2288751468","doi":"10.1109/pdcat.2010.28","title":"A Random Heuristic for Message Broadcasting in Arbitrary Networks","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing: Applications and Technologies","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Heuristic; Computer science; Broadcasting (networking); Null-move heuristic; Node (physics); Consistent heuristic; Tree (set theory); Path (computing); Distributed computing; Theoretical computer science; Algorithm; Computer network; Incremental heuristic search; Search algorithm; Mathematics; Artificial intelligence; Beam search","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.001910324,0.0005754138,0.0009465137,0.001118271,0.00108305,0.0008634519,0.002169803,0.001120914,0.003178095],"category_scores_gemma":[0.007034184,0.0004178442,0.0006074124,0.001139084,0.00133857,0.001668467,0.001071383,0.000864215,0.0007557393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001466307,"about_ca_system_score_gemma":0.001526219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001592707,"about_ca_topic_score_gemma":0.001722977,"domain_scores_codex":[0.9981773,0.0008928448,0.00007155712,0.0002314744,0.0003975413,0.0002293137],"domain_scores_gemma":[0.9953251,0.003106261,0.0003066714,0.0007638086,0.0003098742,0.0001881314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008064437,0.0002649139,0.0008529131,0.0003700696,0.000107831,0.0003278578,0.0003741018,0.6975586,0.01115808,0.1295027,0.009851812,0.1488247],"study_design_scores_gemma":[0.0002130412,0.0001767893,0.0001573532,0.00003022735,0.00004275964,0.0002085926,0.00007246103,0.9425446,0.005076017,0.04313075,0.008306202,0.00004124447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01945574,0.0003071168,0.9749673,0.0002126875,0.00008587446,0.0002308514,0.00008784488,0.0007847454,0.003867784],"genre_scores_gemma":[0.3808795,0.0003518135,0.6132926,0.0002371653,0.00009573671,0.0006155188,0.0004340697,0.0003319889,0.003761556],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003178095,"threshold_uncertainty_score":0.01063883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009504980256280092,"score_gpt":0.229423143669971,"score_spread":0.2199181634136909,"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."}}