{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"addfc0094822","filters":{"venue":"Parallel and Distributed Computing: Applications and Technologies"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"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","authors":[{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Wei Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009504980256280092,"gpt":0.229423143669971,"spread":0.2199181634136909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002183178,0.0001433552,0.0002025426,0.0000998809,0.0002955344,0.000177635,0.000383704,0.0001291422,2.471605e-7],"category_scores_gemma":[0.00008295741,0.0001300027,0.00003738742,0.0003156525,0.0001306315,0.00008971345,0.000315449,0.0003097831,5.574124e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006480572,"about_ca_system_score_gemma":0.0000153549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002355225,"about_ca_topic_score_gemma":0.000009436159,"domain_scores_codex":[0.9990233,0.00001220086,0.0002325434,0.0004072317,0.00005875785,0.0002659426],"domain_scores_gemma":[0.9991433,0.000357544,0.00008704042,0.000328801,0.00004232962,0.00004100203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004366607,0.0001655259,0.007911171,0.00006007023,0.00002960214,0.000006367034,0.0001011928,0.00521004,0.0003373643,0.524206,0.0003006845,0.4616283],"study_design_scores_gemma":[0.001268878,0.00003492307,0.002825234,0.00002495607,0.00001024728,0.00004095685,0.0001877823,0.9601774,0.00002309906,0.03326784,0.001907716,0.0002309371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05473496,0.001849192,0.9413265,0.0008805924,0.00004151757,0.0004225065,0.00001441148,0.0006543957,0.00007591814],"genre_scores_gemma":[0.9657956,0.0001599352,0.03375335,0.00003757173,0.00002314645,0.0001893482,0.00003022571,0.000005187722,0.000005588543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9549674,"threshold_uncertainty_score":0.5301355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}