{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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"},"query_hash":"6f54b838511e","filters":{"venue":"International Journal of Computer and Communication Engineering"}},"results":[{"id":"W2327970053","doi":"10.7763/ijcce.2013.v2.185","title":"Exact Solution for Search-and-Rescue Path Planning","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer and Communication Engineering","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec; Université TÉLUQ; Defence Research and Development Canada","funders":"","keywords":"Path (computing); Computer science; Search and rescue; Motion planning; Operations research; Artificial intelligence; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01931845165039675,"gpt":0.2681265063062482,"spread":0.2488080546558515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003368204,0.00007871986,0.0001123881,0.0001637668,0.0000539798,0.00024217,0.0007101326,0.00003055543,0.000001001225],"category_scores_gemma":[0.00002792455,0.00007390065,0.00003695274,0.00004717094,0.0000169506,0.0006638336,0.0002407665,0.0001531399,0.00000115467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003164689,"about_ca_system_score_gemma":0.0000201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001796052,"about_ca_topic_score_gemma":6.948557e-8,"domain_scores_codex":[0.9993133,0.00003034576,0.0002627156,0.00008696177,0.0001991279,0.0001075482],"domain_scores_gemma":[0.999182,0.0001958843,0.00006983792,0.0001651411,0.0003160453,0.00007105141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001586031,0.00008014072,0.001261831,0.00004128089,0.0002851046,0.00001519667,0.004023998,0.5791079,0.002178105,0.02271367,0.001040742,0.3892362],"study_design_scores_gemma":[0.0003448929,0.00005737808,0.01474918,0.0001410018,0.000003351323,0.0001936824,0.00001161268,0.9835045,0.00008704324,0.0004252763,0.0004067938,0.0000752365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03237932,0.0006335857,0.9651374,0.001389206,0.0003444561,0.00007066078,7.266307e-7,0.00002958027,0.00001507112],"genre_scores_gemma":[0.5170923,0.00005715988,0.4826731,0.00006320162,0.000100396,0.00000378302,0.000001615758,0.000004116391,0.000004325934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.484713,"threshold_uncertainty_score":0.3013581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772308048","doi":"10.17706/ijcce.2017.6.3.151-160","title":"Bandwidth Allocation with Fairness in Multipath Networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Computer and Communication Engineering","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"University of Ottawa","keywords":"Computer science; Multipath propagation; Bandwidth (computing); Computer network; Bandwidth allocation","retraction":null,"screen_n_in":null,"score":{"opus":0.00436713570505597,"gpt":0.2081642927965029,"spread":0.203797157091447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001353517,0.00009071243,0.0001227681,0.0001271372,0.00004390215,0.0001268497,0.0004917628,0.00003663062,0.000001618336],"category_scores_gemma":[0.00001064454,0.00008666993,0.00001936704,0.00003691125,0.00002281343,0.0005758359,0.00006497572,0.0001942629,2.434364e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005641963,"about_ca_system_score_gemma":0.000007052475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004027776,"about_ca_topic_score_gemma":0.00001060471,"domain_scores_codex":[0.999468,0.00001156122,0.0002512383,0.00005448659,0.0001327305,0.00008200351],"domain_scores_gemma":[0.9993854,0.00005415872,0.0001394939,0.0002237051,0.0001612068,0.00003607235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001400394,0.00001066987,0.002818133,0.00000495568,0.0000363232,0.000005646263,0.000128512,0.9671239,0.00002762605,0.0006582979,0.00001201068,0.02915993],"study_design_scores_gemma":[0.0006118899,0.00001648026,0.03874048,0.0002214914,0.000004282953,0.00004841004,0.000008379749,0.9598581,0.00006349081,0.00005227107,0.0002849754,0.0000897067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08914509,0.0004744226,0.9097666,0.0001268443,0.000323006,0.0000436761,4.256609e-7,0.00002879611,0.00009112852],"genre_scores_gemma":[0.9487374,0.00115397,0.04992399,0.0000125589,0.0001449351,0.000003464589,0.000005071762,0.00001630432,0.000002251174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8598426,"threshold_uncertainty_score":0.3534297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807850458","doi":"10.17706/ijcce.2017.6.1.1-18","title":"Using Modified Floyd-Warshall Algorithm to Implement SPB IEEE 802.1aq Protocol Simulator on NS-3","year":2017,"lang":"en","type":"article","venue":"International Journal of Computer and Communication Engineering","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol (science); Algorithm; Simulation; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.03981131453518005,"gpt":0.3383204725198667,"spread":0.2985091579846866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384335,0.000161215,0.0001931752,0.0002477461,0.0001791002,0.000597997,0.002658131,0.00004719958,0.000003347273],"category_scores_gemma":[0.00002976275,0.00015492,0.00008184294,0.00005904879,0.00001764865,0.0004981755,0.0006383171,0.0002500846,0.000002139829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001026849,"about_ca_system_score_gemma":0.00004245877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001472573,"about_ca_topic_score_gemma":0.000001523451,"domain_scores_codex":[0.9986399,0.0000470341,0.000472238,0.000174093,0.000487818,0.0001788532],"domain_scores_gemma":[0.998131,0.0001226052,0.0003915666,0.0007814197,0.0004066573,0.0001667298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001465946,0.00005928834,0.00003766504,0.000003871591,0.00006325187,0.00001422179,0.0001817231,0.938023,0.0002122049,0.005536269,0.00007831001,0.0557755],"study_design_scores_gemma":[0.0007581541,0.00009793563,0.0009354328,0.0002264966,0.000004309805,0.00007213921,0.000003222609,0.9930702,0.001101006,0.000101953,0.003474634,0.0001545283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.016288,0.00001418278,0.98059,0.0008391658,0.000838646,0.001302455,0.000001725667,0.0000360257,0.00008975551],"genre_scores_gemma":[0.6528885,0.000006833778,0.3464097,0.0002051937,0.0003464712,0.0001230146,7.918434e-7,0.00001279007,0.000006650516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6366005,"threshold_uncertainty_score":0.6317456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808347109","doi":"10.17706/ijcce.2017.6.2.127-136","title":"Considerations in Designing DCI (Data Centre Interconnect) in Full Mesh VPLS/ Multicast Enable WAN over OTV Tunne","year":2017,"lang":"en","type":"article","venue":"International Journal of Computer and Communication Engineering","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Georgian College","funders":"","keywords":"Multicast; Computer science; Computer network; Interconnection","retraction":null,"screen_n_in":null,"score":{"opus":0.02233470462655468,"gpt":0.2651981213737811,"spread":0.2428634167472264,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002675075,0.0001209196,0.0001932751,0.0002463342,0.00004828818,0.0001889966,0.001001414,0.00006214383,0.00001212627],"category_scores_gemma":[0.0002210641,0.0001275727,0.00002694964,0.00004586991,0.00004622673,0.0008383375,0.0004926494,0.0004238034,0.000001275199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014041,"about_ca_system_score_gemma":0.00001204557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067475,"about_ca_topic_score_gemma":0.00008556434,"domain_scores_codex":[0.9991412,0.00002120323,0.0004468142,0.0001044051,0.0001376106,0.0001487903],"domain_scores_gemma":[0.9989064,0.0003110537,0.0001108029,0.0005270618,0.0001016742,0.00004298877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002682341,0.00008787434,0.005658701,0.00003029035,0.0001722884,0.0001327337,0.0008285472,0.9470338,0.002817275,0.01140414,0.0003444079,0.03146309],"study_design_scores_gemma":[0.0008378739,0.00001708921,0.00939515,0.0004412811,0.000006131653,0.00009509931,0.00007050544,0.9860713,0.0003272008,0.001909707,0.00067815,0.0001504525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4821132,0.002427646,0.5114371,0.002304004,0.00101879,0.0001825752,0.00001232592,0.0001603497,0.0003440561],"genre_scores_gemma":[0.8552278,0.0005849751,0.1440676,0.00002187565,0.00007421229,0.000001887327,0.000005545538,0.00001401041,0.000002146212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3731146,"threshold_uncertainty_score":0.5202265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}