{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019455738,0.00030711677,0.9749673,0.00021268753,0.00008587446,0.00023085141,0.00008784488,0.00078474544,0.0038677836],"genre_scores_gemma":[0.38087946,0.0003518135,0.61329263,0.0002371653,0.00009573671,0.00061551883,0.00043406975,0.0003319889,0.0037615558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981773,0.0008928448,0.00007155712,0.00023147438,0.00039754127,0.00022931366],"domain_scores_gemma":[0.9953251,0.0031062614,0.0003066714,0.0007638086,0.00030987416,0.00018813144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019103241,0.0005754138,0.00094651367,0.0011182714,0.0010830496,0.0008634519,0.0021698033,0.0011209138,0.0031780954],"category_scores_gemma":[0.0070341844,0.0004178442,0.0006074124,0.0011390835,0.0013385701,0.001668467,0.0010713832,0.00086421496,0.00075573934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0008064437,0.0002649139,0.0008529131,0.00037006958,0.000107831016,0.00032785782,0.00037410183,0.69755864,0.011158079,0.12950271,0.009851812,0.14882466],"study_design_scores_gemma":[0.00021304125,0.00017678928,0.00015735319,0.000030227346,0.000042759635,0.00020859255,0.00007246103,0.9425446,0.0050760168,0.043130748,0.0083062025,0.00004124447],"about_ca_topic_score_codex":0.0015927069,"about_ca_topic_score_gemma":0.0017229774,"teacher_disagreement_score":0.0031780954,"about_ca_system_score_codex":0.0014663069,"about_ca_system_score_gemma":0.0015262194,"threshold_uncertainty_score":0.010638833},"labels":[],"label_agreement":null}]}