{"meta":{"query_hash":"addfc0094822","filters":{"venue":"Parallel and Distributed Computing: Applications and Technologies"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/addfc0094822","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+and+Distributed+Computing%3A+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009504980256280092,"score_gpt":0.22942314366997096,"score_spread":0.21991816341369086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288751468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054734956,0.0018491922,0.9413265,0.0008805924,0.000041517567,0.0004225065,0.000014411483,0.0006543957,0.00007591814],"genre_scores_gemma":[0.96579564,0.00015993515,0.033753347,0.000037571728,0.000023146451,0.00018934815,0.00003022571,0.0000051877223,0.0000055885434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990233,0.000012200863,0.0002325434,0.00040723168,0.000058757847,0.0002659426],"domain_scores_gemma":[0.9991433,0.00035754396,0.00008704042,0.000328801,0.00004232962,0.000041002026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021831781,0.00014335524,0.00020254256,0.0000998809,0.00029553438,0.000177635,0.00038370397,0.00012914215,2.471605e-7],"category_scores_gemma":[0.000082957406,0.00013000266,0.00003738742,0.00031565252,0.0001306315,0.00008971345,0.00031544897,0.0003097831,5.5741236e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043666074,0.00016552585,0.007911171,0.00006007023,0.00002960214,0.0000063670336,0.00010119279,0.00521004,0.0003373643,0.52420604,0.00030068448,0.4616283],"study_design_scores_gemma":[0.0012688783,0.00003492307,0.002825234,0.000024956074,0.000010247277,0.000040956853,0.00018778231,0.9601774,0.000023099064,0.03326784,0.001907716,0.00023093708],"about_ca_topic_score_codex":0.000023552246,"about_ca_topic_score_gemma":0.0000094361585,"teacher_disagreement_score":0.9549674,"about_ca_system_score_codex":0.000006480572,"about_ca_system_score_gemma":0.000015354903,"threshold_uncertainty_score":0.53013545},"labels":[],"label_agreement":null}]}