{"meta":{"query_hash":"db13c38c8266","filters":{"venue":"Parallel and distributed computing and networks"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/db13c38c8266","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+and+distributed+computing+and+networks"},"results":[{"id":"W160047886","doi":"","title":"Path-based multicasting in multicomputers","year":2007,"lang":"en","type":"article","venue":"Parallel and distributed computing and networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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":"Multicast; Computer science; Xcast; Protocol Independent Multicast; Source-specific multicast; Computer network; Distributed computing; Distance Vector Multicast Routing Protocol; Routing algorithm; Multicast address; Routing (electronic design automation); Routing protocol","score_opus":0.011615928782863457,"score_gpt":0.24363197022961663,"score_spread":0.23201604144675317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160047886","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.18912965,0.0004078401,0.8096976,0.00009632556,0.00035539042,0.00010369175,0.000001000158,0.0001247575,0.00008369934],"genre_scores_gemma":[0.9821766,0.000013716578,0.01732719,0.00028032108,0.00017781615,0.0000032945595,0.0000082728075,0.000007682988,0.000005109348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982748,0.00008758182,0.00043404163,0.0004551465,0.000120835015,0.0006275904],"domain_scores_gemma":[0.99887884,0.000554081,0.00011640675,0.00019436576,0.000049062513,0.0002072724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011055256,0.00019601086,0.0002696821,0.000096549025,0.00023029017,0.0002043074,0.00020668376,0.0001231529,9.3304175e-7],"category_scores_gemma":[0.000034405555,0.00018040946,0.00003867805,0.00033507156,0.00005673078,0.00010805217,0.00017041374,0.00026464523,0.0000011296644],"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.00008676244,0.00014976301,0.03885684,0.00006876464,0.000030696123,0.00020864939,0.0011477233,0.79267615,0.000017436587,0.008416071,0.0002947152,0.15804644],"study_design_scores_gemma":[0.0009811743,0.000060161237,0.024146816,0.0001270409,0.000002080641,0.000043526416,0.00012047017,0.97389793,0.0000021574906,0.00012991842,0.00027043515,0.00021830336],"about_ca_topic_score_codex":0.000058502006,"about_ca_topic_score_gemma":0.000020699039,"teacher_disagreement_score":0.79304695,"about_ca_system_score_codex":0.000045870045,"about_ca_system_score_gemma":0.00001333858,"threshold_uncertainty_score":0.73568845},"labels":[],"label_agreement":null},{"id":"W39796434","doi":"","title":"Efficient heuristics for message dissemination in networks","year":2007,"lang":"en","type":"article","venue":"Parallel and distributed computing and networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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":"Heuristics; Computer science; Heuristic; Gossip; Broadcasting (networking); Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.009029404762501544,"score_gpt":0.2602048136757128,"score_spread":0.2511754089132113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39796434","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.037351828,0.0022903325,0.9591582,0.00011145387,0.000588298,0.0002520268,0.000004253216,0.00009167369,0.00015194033],"genre_scores_gemma":[0.99581003,0.00007260055,0.0036629497,0.000075493874,0.0002988335,0.0000077403165,0.000038544422,0.000008650703,0.000025167728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984963,0.000056519562,0.0004298194,0.0004115213,0.000108195,0.00049762876],"domain_scores_gemma":[0.9987196,0.0007564375,0.00013553615,0.00017379689,0.000079603175,0.00013504802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012948923,0.00017990981,0.00025267867,0.00007697819,0.00027975286,0.00018821967,0.0001776237,0.00014833058,5.90832e-7],"category_scores_gemma":[0.000044548477,0.00016566088,0.00004742827,0.00032850844,0.000043672597,0.000044883956,0.00013715719,0.00019688727,2.926806e-7],"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.000040587474,0.00005006036,0.0027197201,0.00001795147,0.000011391579,0.000008782878,0.00017106844,0.92973554,0.0000012246246,0.024361826,0.00094739767,0.041934468],"study_design_scores_gemma":[0.0005203083,0.00006484067,0.014084671,0.00012421593,0.000006006135,0.000029017945,0.00007851832,0.98418546,0.0000012364226,0.0002456521,0.00045856676,0.000201494],"about_ca_topic_score_codex":0.00001504228,"about_ca_topic_score_gemma":0.000022042865,"teacher_disagreement_score":0.9584582,"about_ca_system_score_codex":0.000032260712,"about_ca_system_score_gemma":0.0000072137414,"threshold_uncertainty_score":0.67554545},"labels":[],"label_agreement":null}]}