{"meta":{"query_hash":"a792d321a17f","filters":{"venue":"International Performance, Computing, and Communications Conference"},"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/a792d321a17f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Performance%2C+Computing%2C+and+Communications+Conference"},"results":[{"id":"W2124446522","doi":"10.1109/pccc.2010.5682307","title":"Multiple description video multicast in MANETs","year":2010,"lang":"en","type":"article","venue":"International Performance, Computing, and Communications Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Multicast; Computer science; Computer network; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Multiple description coding; Xcast; Source-specific multicast; Pragmatic General Multicast; Distributed computing; Reliable multicast; IP multicast; Network packet","score_opus":0.026062257849050086,"score_gpt":0.26828848189874316,"score_spread":0.24222622404969307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124446522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8164247,0.000089898356,0.16209374,0.0013561297,0.00092958467,0.0002695785,0.0000031924499,0.00017123859,0.018661926],"genre_scores_gemma":[0.9462481,0.00032378995,0.052969415,0.00019579231,0.00006919731,0.00003112526,0.000023783474,0.000007862128,0.00013089573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873763,0.0000626776,0.00038826998,0.00033948754,0.00022745554,0.00024447648],"domain_scores_gemma":[0.99804723,0.00023569839,0.00015396491,0.0012344584,0.00024396203,0.000084659776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003860408,0.00015741517,0.00014657686,0.00020518353,0.00023684799,0.00033944828,0.0026357707,0.000088645975,0.000029538913],"category_scores_gemma":[0.000068136775,0.0001658407,0.000030881118,0.00024219824,0.00020104599,0.00078297587,0.0012664552,0.0006085768,0.000045400655],"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.000018509818,0.0003627637,0.2429554,0.000018611147,0.000029579163,0.000004230588,0.0018432725,0.0007348474,0.0025058072,0.3325015,0.0003430984,0.4186824],"study_design_scores_gemma":[0.00041192732,0.000022722037,0.1493901,0.00005065366,0.0000017917318,0.000033774417,0.000037265152,0.8382978,0.000083823696,0.0006787388,0.010833528,0.0001578965],"about_ca_topic_score_codex":0.00015009394,"about_ca_topic_score_gemma":0.0009393838,"teacher_disagreement_score":0.8375629,"about_ca_system_score_codex":0.000048547954,"about_ca_system_score_gemma":0.000065124674,"threshold_uncertainty_score":0.67627877},"labels":[],"label_agreement":null},{"id":"W2142648121","doi":"10.1109/pccc.2010.5682314","title":"A primal-dual approximation algorithm for the Minimum Cost Stashing problem in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"International Performance, Computing, and Communications Conference","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless sensor network; Dual (grammatical number); Computer science; Approximation algorithm; Wireless; Algorithm; Mathematical optimization; Mathematics; Computer network; Telecommunications","score_opus":0.020593711511089602,"score_gpt":0.26768937758672706,"score_spread":0.24709566607563746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142648121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08263996,0.00007496501,0.91175675,0.0017243607,0.00056052,0.00063195475,0.000006997121,0.0001185155,0.0024859617],"genre_scores_gemma":[0.79325116,0.0003130734,0.2058703,0.00016272397,0.00012922651,0.000113135284,0.000060153227,0.000011993681,0.00008823839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984002,0.000083936924,0.0004925295,0.00038819283,0.00028621926,0.00034892382],"domain_scores_gemma":[0.99733305,0.0008014137,0.00029834852,0.0010503042,0.00044890965,0.000067953675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079151674,0.00020714874,0.00018707736,0.00016549524,0.00059052475,0.00053632533,0.002412163,0.000116118834,0.0000051316083],"category_scores_gemma":[0.000031709744,0.00017778858,0.000050618924,0.0003368357,0.00027097197,0.00049049774,0.0009378727,0.0006802959,0.0000030876217],"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.000012457058,0.00018992621,0.0027348646,0.000014493221,0.000041214327,8.2045943e-7,0.0011655544,0.037281036,0.00020647215,0.18130901,0.00012909391,0.7769151],"study_design_scores_gemma":[0.00053930684,0.00003264094,0.0036502308,0.00007183861,0.0000064392552,0.000029099292,0.0001348457,0.9899835,0.000079399826,0.00017012219,0.0050886576,0.00021391148],"about_ca_topic_score_codex":0.000062261744,"about_ca_topic_score_gemma":0.0001740839,"teacher_disagreement_score":0.95270246,"about_ca_system_score_codex":0.00006298859,"about_ca_system_score_gemma":0.000094100455,"threshold_uncertainty_score":0.72500074},"labels":[],"label_agreement":null}]}