{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":34,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":34,"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":"fd3f21ff3be2","filters":{"venue":"Journal of Interconnection Networks"}},"results":[{"id":"W2204817054","doi":"10.1142/s0219265915500073","title":"Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults","year":2015,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Connected component; Vertex connectivity; Upper and lower bounds; Mathematics; Graph; Connectivity; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03013633099325564,"gpt":0.2499472537526773,"spread":0.2198109227594216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003742405,0.0003964259,0.0009885136,0.0004308076,0.0001736562,0.0002165896,0.001014623,0.0003574833,0.0000128863],"category_scores_gemma":[0.0008861027,0.0003097601,0.0003791037,0.001150689,0.0001299289,0.001281338,0.0001804393,0.001068692,0.000009774874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003600345,"about_ca_system_score_gemma":0.0002122795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001915937,"about_ca_topic_score_gemma":0.0003339144,"domain_scores_codex":[0.9955227,0.0007987752,0.001861739,0.0004729227,0.0007875366,0.0005563274],"domain_scores_gemma":[0.9925659,0.0009614793,0.002752104,0.0006122048,0.002687886,0.0004204778],"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.003378714,0.0006944097,0.002264718,0.00002236871,0.001154908,0.0002848772,0.00217636,0.9349384,0.0001639698,0.007427269,0.03972791,0.007766094],"study_design_scores_gemma":[0.005497334,0.0051505,0.001544319,0.001062772,0.00007724541,0.001621476,0.0006608588,0.9793262,0.0002621128,0.0006191867,0.003694146,0.0004838428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1446156,0.0003964667,0.8457091,0.000517828,0.005436587,0.0002655397,0.000005078864,0.0001083677,0.002945346],"genre_scores_gemma":[0.9970018,0.00004429996,0.00098089,0.0003127099,0.001244656,0.000006835732,0.000006541627,0.00003633383,0.0003659302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8523862,"threshold_uncertainty_score":0.9999354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078655426","doi":"10.1142/s0219265912500077","title":"A UNIFIED APPROACH TO THE CONDITIONAL DIAGNOSABILITY OF INTERCONNECTION NETWORKS","year":2012,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Dual (grammatical number); Computer science; Cayley graph; Theoretical computer science; Discrete mathematics; Mathematics; Computer network; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01871149027825394,"gpt":0.2429889282324175,"spread":0.2242774379541635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004210849,0.0003370905,0.0006467143,0.0003876564,0.0002768332,0.0002026301,0.001200015,0.000278179,0.00009463919],"category_scores_gemma":[0.0004142088,0.0002375798,0.0005611327,0.001108123,0.0001104558,0.001489571,0.0002611392,0.000984773,0.00002107805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002951577,"about_ca_system_score_gemma":0.00006238733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005035913,"about_ca_topic_score_gemma":0.000045565,"domain_scores_codex":[0.9960039,0.000814471,0.001669028,0.0003555762,0.0005467194,0.0006102785],"domain_scores_gemma":[0.9957991,0.0009467353,0.00124305,0.0006847394,0.0009801558,0.0003462603],"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.0003996758,0.001170795,0.00444492,0.00005251967,0.0005702946,0.000004763915,0.003481404,0.8259665,0.0001305491,0.06761245,0.07976524,0.01640094],"study_design_scores_gemma":[0.001417268,0.001409801,0.01047528,0.0004468287,0.0001187954,0.002454456,0.002515364,0.9344829,0.0005876448,0.001449268,0.04394383,0.0006985688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02701831,0.0006563088,0.9595352,0.0008740205,0.008806407,0.0004134888,0.000002543286,0.0000626426,0.002631097],"genre_scores_gemma":[0.9925103,0.00005180708,0.002282334,0.0007039859,0.004223994,0.00004464584,0.000005202909,0.00002592397,0.0001518339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.965492,"threshold_uncertainty_score":0.9688221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075775382","doi":"10.1142/s021926590400099x","title":"Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Network packet; Static routing; Packet forwarding; Routing (electronic design automation); Distributed computing; Computer network; Mathematical optimization; Routing protocol; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01491837458209023,"gpt":0.2108605344136199,"spread":0.1959421598315297,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037396,0.0002185925,0.0003434894,0.000155234,0.0002718605,0.0003561252,0.0004217543,0.000139109,0.00001954016],"category_scores_gemma":[0.00008028355,0.0001673113,0.000123177,0.0004892037,0.0001184987,0.001910195,0.00008514235,0.0006854204,7.334176e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001530836,"about_ca_system_score_gemma":0.00007411858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004452939,"about_ca_topic_score_gemma":0.0001646374,"domain_scores_codex":[0.9983143,0.0001184033,0.0007021097,0.0002261839,0.0002710435,0.0003679587],"domain_scores_gemma":[0.9984053,0.0003231047,0.0004564498,0.0002813092,0.000364081,0.0001697856],"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.0002283038,0.0001410561,0.006022455,0.00004735261,0.0002119697,0.00004048258,0.007005191,0.9405939,0.00002371525,0.01039694,0.000943322,0.03434533],"study_design_scores_gemma":[0.003768167,0.002027968,0.006804796,0.001777789,0.0001119232,0.002966317,0.004049662,0.9673532,0.0004728371,0.008841151,0.001043165,0.0007830736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1616518,0.001077756,0.8351804,0.0007031294,0.000855798,0.0001250376,6.009119e-7,0.00007830081,0.0003271243],"genre_scores_gemma":[0.9870268,0.0004067836,0.01159029,0.0002801335,0.0006640491,0.000004739549,0.000001199413,0.00001626778,0.000009716698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.825375,"threshold_uncertainty_score":0.6822759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964071270","doi":"10.1142/s0219265904001039","title":"ON THE COMBINATORIAL PROPERTIES OF k-ARY n-CUBES","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Cube (algebra); Node (physics); Computer science; Tree (set theory); Topology (electrical circuits); Combinatorics; Mathematics; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01668674951699768,"gpt":0.2075188032038992,"spread":0.1908320536869015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117149,0.000154364,0.0003161044,0.0001748048,0.0001491279,0.0001327278,0.0007483424,0.0001132166,0.00002591985],"category_scores_gemma":[0.0002388768,0.00008896145,0.0002795431,0.0003438788,0.00007204805,0.0004788906,0.000081183,0.0005066063,0.00000708518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248929,"about_ca_system_score_gemma":0.00009012219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002661869,"about_ca_topic_score_gemma":0.00001157175,"domain_scores_codex":[0.9982814,0.0002109527,0.0008029447,0.0001515149,0.0003547792,0.0001984481],"domain_scores_gemma":[0.9981769,0.0002276881,0.0006829724,0.0003212219,0.0005080391,0.00008322408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003533901,0.0003461785,0.00005426588,0.00002426075,0.0002565914,0.0000252668,0.001611236,0.2737687,0.001904077,0.7091902,0.009609091,0.002856764],"study_design_scores_gemma":[0.01281834,0.01791925,0.0007845317,0.01146941,0.0001902613,0.005711883,0.00548423,0.5632355,0.1189051,0.2461882,0.01535704,0.001936263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4087495,0.0005667972,0.5679314,0.003041834,0.01795131,0.0002024549,2.946525e-7,0.00004487881,0.001511584],"genre_scores_gemma":[0.9981032,0.00004651546,0.0001568339,0.0005168758,0.001116735,0.00000472901,8.556309e-8,0.00001071854,0.00004427887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5893537,"threshold_uncertainty_score":0.3627743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4290040450","doi":"10.1142/s0219265921500377","title":"Optimal Broadcasting in Fully Connected Trees","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Combinatorics; Dissemination; Graph; Binary logarithm; Discrete mathematics; Mathematics; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01184641524461155,"gpt":0.2263594755566411,"spread":0.2145130603120295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002071336,0.0002036803,0.0004459546,0.0006760412,0.0002971642,0.0002086551,0.0009421999,0.00008770253,0.0002494605],"category_scores_gemma":[0.0001413553,0.0001954443,0.000274492,0.001122982,0.00002653684,0.0007929087,0.0003319882,0.001136757,0.000004132923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004192737,"about_ca_system_score_gemma":0.00009001556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004544353,"about_ca_topic_score_gemma":0.00010255,"domain_scores_codex":[0.9970065,0.0006135015,0.001232121,0.0003027348,0.0004405056,0.0004046517],"domain_scores_gemma":[0.9980237,0.0003843792,0.0008824795,0.0002882991,0.0003015795,0.0001195313],"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.0001601242,0.0001429528,0.001187601,0.000004903079,0.00006383778,0.0002064904,0.001024866,0.9752521,0.0002910453,0.003370259,0.006537678,0.01175814],"study_design_scores_gemma":[0.001291494,0.001172294,0.001108203,0.0001226459,0.00001011727,0.00407417,0.001948942,0.9772891,0.00008574537,0.0002450632,0.01237806,0.0002742015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2835561,0.0005606445,0.706404,0.0006342162,0.007629369,0.0001399858,8.367045e-7,0.00007094542,0.001003854],"genre_scores_gemma":[0.9963882,0.00002421792,0.002075116,0.0003910875,0.0008460135,0.00001876981,0.000001064528,0.00001904984,0.0002364773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7128321,"threshold_uncertainty_score":0.7969986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035138544","doi":"10.1142/s0219265901000464","title":"HIGHER DIMENSIONAL HONEYCOMB NETWORKS","year":2001,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Honeycomb; Interconnection; Generalization; Honeycomb structure; Degree (music); Voronoi diagram; Hexagonal crystal system; Computer science; Materials science; Mathematics; Geometry; Physics; Telecommunications; Composite material; Mathematical analysis; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.01394688179475045,"gpt":0.2327738769313161,"spread":0.2188269951365656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218787,0.000296567,0.0005208746,0.0003559828,0.0002300498,0.0003300512,0.0009002049,0.0002710139,0.0002796658],"category_scores_gemma":[0.00004674295,0.0002408509,0.0004603635,0.0007872809,0.00005156239,0.001241232,0.0001771576,0.0008644786,0.00003233388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001901265,"about_ca_system_score_gemma":0.00004855136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001855513,"about_ca_topic_score_gemma":0.00002345949,"domain_scores_codex":[0.9971795,0.0002981196,0.001213418,0.0003453985,0.0004596958,0.0005038832],"domain_scores_gemma":[0.997335,0.0003243882,0.0008954958,0.0004619424,0.0007071097,0.0002760665],"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.0002131673,0.0002521815,0.002814347,0.000006035248,0.0003215313,0.0003443465,0.0001607019,0.8464626,0.0001233074,0.02120815,0.09575656,0.03233705],"study_design_scores_gemma":[0.00116261,0.0007061869,0.002712002,0.0002662379,0.00002685677,0.00358512,0.00005722331,0.9043551,0.00003901461,0.001147703,0.08553942,0.0004025423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01994918,0.001238912,0.9531558,0.001294251,0.0211148,0.0001152806,2.13051e-7,0.0001148151,0.003016765],"genre_scores_gemma":[0.9914706,0.0002362008,0.001551016,0.001382023,0.003701217,0.000005850382,0.000001170426,0.00002769438,0.001624226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715214,"threshold_uncertainty_score":0.9821613,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137815559","doi":"10.1142/s0219265904001234","title":"TRAVERSAL OF A QUASI-PLANAR SUBDIVISION WITHOUT USING MARK BITS","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Subdivision; Traverse; Tree traversal; Planar; Graph traversal; Planar graph; Computer science; Algorithm; Combinatorics; Graph; Planar straight-line graph; Mathematics; Computer graphics (images); Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01767068749338882,"gpt":0.2611897400789298,"spread":0.2435190525855409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005676783,0.00009906335,0.0002088327,0.0003244443,0.00007203214,0.0000602637,0.0002535986,0.00007177613,0.00001010173],"category_scores_gemma":[0.00005777876,0.00008736413,0.0001343102,0.0004780416,0.00002083072,0.000623556,0.00003075807,0.0002036433,0.00000174937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103942,"about_ca_system_score_gemma":0.0001087699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002000482,"about_ca_topic_score_gemma":0.00001187481,"domain_scores_codex":[0.9988614,0.00008039681,0.000521715,0.0001294723,0.0002792623,0.0001277734],"domain_scores_gemma":[0.998846,0.00008027898,0.0005172132,0.0001187943,0.0003603842,0.00007733158],"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.0001459715,0.0002252707,0.000680629,0.00001549293,0.00008816281,0.00002342339,0.0005745247,0.9542079,0.006653479,0.01060053,0.0003026577,0.02648197],"study_design_scores_gemma":[0.001853936,0.001397624,0.003184072,0.0004546088,0.00004255175,0.00141587,0.0001284502,0.9749196,0.009922987,0.005986621,0.0004634816,0.0002302285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3325185,0.0001280948,0.6659903,0.0001242959,0.001133599,0.00003667655,2.717705e-7,0.000009488853,0.00005869109],"genre_scores_gemma":[0.9672144,0.00003212403,0.03221884,0.000101111,0.0004133387,3.328137e-7,9.412593e-7,0.000005672132,0.00001325249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6346958,"threshold_uncertainty_score":0.3562606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070774400","doi":"10.1142/s0219265909002510","title":"A GENERATING FUNCTION APPROACH TO THE SURFACE AREAS OF SOME INTERCONNECTION NETWORKS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Chordal graph; Interconnection; Vertex (graph theory); Combinatorics; Indifference graph; Star (game theory); Mathematics; Surface (topology); Function (biology); Metric dimension; 1-planar graph; Computer science; Graph; Discrete mathematics; Geometry; Telecommunications; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01416798188061478,"gpt":0.226091175037054,"spread":0.2119231931564393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002811572,0.0003736779,0.0006869863,0.0003730135,0.0003532537,0.0004030651,0.001111966,0.0002819917,0.00001735257],"category_scores_gemma":[0.000168341,0.0002679288,0.0005313916,0.001175222,0.00004288329,0.001470708,0.0001383355,0.000977084,0.000006946396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002450336,"about_ca_system_score_gemma":0.00006305389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003347658,"about_ca_topic_score_gemma":0.00003406913,"domain_scores_codex":[0.9961636,0.0005893649,0.001730364,0.0004722435,0.0005290988,0.0005153052],"domain_scores_gemma":[0.9964121,0.0003035267,0.001426384,0.0006619782,0.0009668315,0.0002292072],"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.0001963175,0.0001671933,0.000102087,0.000008550647,0.0001392998,0.000003916358,0.000637635,0.9507484,0.0005534049,0.01044697,0.0137758,0.02322038],"study_design_scores_gemma":[0.0005772206,0.001687984,0.0006145841,0.000296515,0.00005208358,0.0007777746,0.0006613143,0.9907302,0.0002665416,0.0006404768,0.003397816,0.0002974353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05817829,0.001007928,0.929148,0.00127085,0.009089083,0.0003539155,5.435348e-7,0.00008869455,0.0008626838],"genre_scores_gemma":[0.9896368,0.000100543,0.003907976,0.002038069,0.004083006,0.000008471153,0.0000022362,0.0000251396,0.0001977797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9314585,"threshold_uncertainty_score":0.9999773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992656560","doi":"10.1142/s0219265903000726","title":"MESSY BROADCASTING IN MULTIDIMENSIONAL DIRECTED TORI","year":2003,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Vertex (graph theory); Computer network; Set (abstract data type); Torus; Process (computing); Broadcast communication network; Atomic broadcast; State (computer science); Distributed computing; Theoretical computer science; Graph; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01194061203731723,"gpt":0.2341054699327961,"spread":0.2221648578954789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001790107,0.0001961165,0.000400931,0.0004133622,0.0001103043,0.0001282999,0.0003573022,0.0001624735,0.00007461615],"category_scores_gemma":[0.0004088836,0.0001678658,0.0002172655,0.0007446763,0.00002255625,0.0008320612,0.00005620878,0.0006440346,0.000008349351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000233599,"about_ca_system_score_gemma":0.00007358663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002566025,"about_ca_topic_score_gemma":0.0000751729,"domain_scores_codex":[0.9974915,0.0004950549,0.001084485,0.0002639111,0.000312701,0.0003523421],"domain_scores_gemma":[0.9980776,0.0004233049,0.000634592,0.0002424858,0.000485087,0.0001368868],"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.000378864,0.0009951368,0.02083073,0.00005552374,0.0004626402,0.0007813593,0.00336284,0.7303305,0.003855491,0.1488778,0.03591971,0.05414942],"study_design_scores_gemma":[0.002093292,0.0005367827,0.002456996,0.0007541453,0.00001537048,0.003591594,0.0004966923,0.9595735,0.00108646,0.001149561,0.02777522,0.0004703729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09235045,0.0007883131,0.8915865,0.0002158158,0.01176065,0.0001235758,1.945336e-7,0.00008677103,0.003087729],"genre_scores_gemma":[0.9899442,0.00005081803,0.008915365,0.0002273983,0.0006167383,0.000004410035,3.036983e-7,0.00001504217,0.0002256788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8975938,"threshold_uncertainty_score":0.6845368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973666239","doi":"10.1142/s0219265908002400","title":"AVERAGE-CASE \"MESSY\" BROADCASTING","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Brandon University","funders":"","keywords":"Broadcasting (networking); Hypercube; Computer science; Upper and lower bounds; Network topology; Graph; Focus (optics); Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Combinatorics; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02298913832141157,"gpt":0.2290056388952702,"spread":0.2060165005738587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009156,0.0002140765,0.0004072133,0.0003349449,0.0003955965,0.0001724305,0.0005527199,0.0001573404,0.00009097923],"category_scores_gemma":[0.0001445267,0.0001798933,0.0003554469,0.000534263,0.00004909389,0.001231507,0.000119298,0.0006804464,0.00002369576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398519,"about_ca_system_score_gemma":0.00006511947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002378762,"about_ca_topic_score_gemma":0.00001830846,"domain_scores_codex":[0.9977549,0.0002546685,0.001072477,0.0002605446,0.0003065524,0.000350898],"domain_scores_gemma":[0.997657,0.0003138234,0.0008546843,0.0003421218,0.0006349293,0.0001974365],"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.0002912861,0.0004992663,0.00384135,0.00005426943,0.0006667401,0.03477516,0.005861465,0.7270433,0.000618862,0.01222666,0.1135773,0.1005443],"study_design_scores_gemma":[0.0007951987,0.000536097,0.0001850215,0.0002103185,0.00001193432,0.2976668,0.0002560453,0.6880125,0.000212612,0.0002155254,0.01162392,0.0002740538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0978548,0.0004567523,0.891582,0.0002417061,0.007541959,0.00008308167,2.405119e-7,0.00008248843,0.00215698],"genre_scores_gemma":[0.9925744,0.0001174178,0.003941627,0.0004041126,0.00235833,0.00000353217,2.591086e-7,0.00001841957,0.0005819315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8947195,"threshold_uncertainty_score":0.7335836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2180873154","doi":"10.1142/s0219265904001179","title":"AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Distributed computing; Flooding (psychology); Computer network; Peer-to-peer; Overlay network; Fault tolerance; Anonymity; Architecture; Load balancing (electrical power); Routing protocol; Network topology; Protocol (science); Routing (electronic design automation); Computer security; The Internet; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01049723298505587,"gpt":0.2581609952047771,"spread":0.2476637622197213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023788,0.0002897458,0.0004372234,0.0005091147,0.0002040041,0.0003223862,0.00182199,0.0002863416,0.000004790063],"category_scores_gemma":[0.0001830482,0.0002438656,0.0003038739,0.0008331934,0.00005961662,0.0004155307,0.0002370678,0.0007908667,0.000003796884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003103716,"about_ca_system_score_gemma":0.0000778023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008775803,"about_ca_topic_score_gemma":0.00008134466,"domain_scores_codex":[0.9977568,0.00009240595,0.0007993676,0.0004201881,0.0003352893,0.0005959274],"domain_scores_gemma":[0.9977538,0.0002239448,0.000554767,0.0006843329,0.0005036934,0.0002794359],"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.0001310711,0.0001147888,0.00002405358,0.000004555243,0.00005243776,0.00002024169,0.000308873,0.9263195,0.0001333479,0.003107672,0.002692179,0.06709131],"study_design_scores_gemma":[0.001725553,0.002726608,0.0003567431,0.0003144647,0.0000339474,0.0009573675,0.0001690858,0.9796206,0.0007539529,0.007033341,0.005878394,0.0004299789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04779368,0.0003384851,0.942987,0.004252967,0.00392495,0.0003545335,0.000001074434,0.000281955,0.00006541005],"genre_scores_gemma":[0.8766897,0.00002330623,0.1208003,0.001134824,0.001283022,0.00001982981,0.000001738205,0.00002740668,0.00001985236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.828896,"threshold_uncertainty_score":0.9944551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996719782","doi":"10.1142/s0219265907002107","title":"ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS","year":2007,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Computer science; Load balancing (electrical power); Computer network; Shared mesh; Distributed computing; Order One Network Protocol; Metrics; Dynamic Source Routing; Router; Routing protocol; Wireless network; Network packet; Wireless; Grid; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01055555883743876,"gpt":0.2570016394685372,"spread":0.2464460806310985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005900964,0.0002878424,0.0006083105,0.0005852602,0.0001442582,0.0002182687,0.0009803073,0.0003070048,0.00001297598],"category_scores_gemma":[0.0003608303,0.0002713295,0.0003387425,0.001909659,0.00003457119,0.001011574,0.0001661997,0.001036017,0.0000019112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008331873,"about_ca_system_score_gemma":0.0001180062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002525085,"about_ca_topic_score_gemma":0.000346407,"domain_scores_codex":[0.996551,0.0001477377,0.001598609,0.0004133819,0.0004510362,0.0008382793],"domain_scores_gemma":[0.9958817,0.001573724,0.001222437,0.0003855265,0.0007175219,0.0002190443],"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.0004976066,0.0002173882,0.002013508,0.00002727889,0.0001696506,0.0000972183,0.0008898323,0.5434613,0.00115721,0.01878225,0.002190372,0.4304963],"study_design_scores_gemma":[0.001507837,0.0004560153,0.00139816,0.0004493982,0.00002188101,0.0002413526,0.000194492,0.992914,0.001686129,0.0004389462,0.0003774265,0.0003144264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05212669,0.0004558395,0.9411032,0.0001188382,0.005296968,0.0003124287,1.611776e-7,0.00006693094,0.0005189219],"genre_scores_gemma":[0.9863667,0.0001568334,0.01074114,0.0004122033,0.002219862,0.00001270293,9.174299e-7,0.00003290762,0.00005673375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.93424,"threshold_uncertainty_score":0.9999739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102676521","doi":"10.1142/s0219265908002266","title":"CHRONOLOGICAL TREE — A COMPRESSED STRUCTURE FOR MINING BEHAVIORAL PATTERNS FROM WIRELESS SENSOR NETWORKS","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Behavioral pattern; Tree (set theory); Set (abstract data type); Wireless; Quality of service; Data mining; Representation (politics); Variety (cybernetics); Distributed computing; Machine learning; Computer network; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03268772508257341,"gpt":0.268443296980625,"spread":0.2357555718980516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001532611,0.0001886903,0.0003554902,0.00009988548,0.0002453308,0.0001461696,0.0007413644,0.0001894514,0.00003063981],"category_scores_gemma":[0.00002026763,0.0001558691,0.0001990486,0.0001725892,0.00005552891,0.0004778693,0.0001243496,0.0004379388,0.000001033614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007352995,"about_ca_system_score_gemma":0.00003583239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000402472,"about_ca_topic_score_gemma":0.00005284862,"domain_scores_codex":[0.998575,0.00006924753,0.0005920063,0.0003015592,0.0001764938,0.0002857367],"domain_scores_gemma":[0.9984496,0.0003092401,0.0005314836,0.0003258362,0.0002470288,0.0001368371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003573311,0.0008532516,0.01457636,0.00001626017,0.0004658308,0.0002591396,0.002841752,0.1623509,0.002630076,0.0007801965,0.03562407,0.7792448],"study_design_scores_gemma":[0.0009484345,0.0004959058,0.009089072,0.0001019285,0.00003647327,0.0005123077,0.0001835998,0.9865422,0.0003068789,0.00009822532,0.001475156,0.0002098366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.421073,0.00008210234,0.5776646,0.0001638792,0.0008718222,0.00008258787,0.00002017456,0.00003573736,0.000006175399],"genre_scores_gemma":[0.9259418,0.00006784201,0.07231905,0.0001906084,0.001399273,0.00001187982,0.00003251464,0.00001492556,0.00002216901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8241913,"threshold_uncertainty_score":0.6356158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995422874","doi":"10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Graph; Path (computing); Broadcasting (networking); Tree (set theory); Algorithm; Approximation algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.007086389217122757,"gpt":0.2160067141272689,"spread":0.2089203249101462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897217,0.0001637193,0.0003291722,0.0002771125,0.0001025139,0.0002421454,0.0006714594,0.0001327933,0.00004599656],"category_scores_gemma":[0.00004369659,0.0001109127,0.0003060821,0.0005375578,0.00002154617,0.0008490829,0.00006488163,0.0004261746,0.00002491724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217719,"about_ca_system_score_gemma":0.00003770414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001580954,"about_ca_topic_score_gemma":0.00001335625,"domain_scores_codex":[0.9982607,0.0001631654,0.0008293206,0.0002227416,0.0002451356,0.0002789822],"domain_scores_gemma":[0.9980035,0.0005969144,0.0006374831,0.0003166828,0.0003847668,0.00006069644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001878043,0.0002430888,0.0006406716,0.00003836288,0.0002689412,0.00001536867,0.001483857,0.3005802,0.000564239,0.00914678,0.03340192,0.6534287],"study_design_scores_gemma":[0.0008586083,0.0004125092,0.0001848426,0.0001835025,0.00001025546,0.0003515487,0.0002120665,0.9876698,0.00007428192,0.0008431754,0.009066162,0.0001332568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005771052,0.0005533707,0.9859268,0.0005585531,0.006276036,0.0004376115,8.030205e-7,0.00003087658,0.0004448729],"genre_scores_gemma":[0.9821854,0.0001942472,0.01402797,0.0007011869,0.001822683,0.00003967721,0.000002011782,0.00002790642,0.0009989496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9764143,"threshold_uncertainty_score":0.4522889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942927459","doi":"10.1142/s0219265919400048","title":"Search Numbers in Networks with Special Topologies","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Vertex (graph theory); Chordal graph; Combinatorics; Mathematics; Indifference graph; Maximal independent set; Computer science; Time complexity; Discrete mathematics; Graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01192170820813132,"gpt":0.2694484824025898,"spread":0.2575267741944585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203172,0.0001438519,0.0003008142,0.0004140363,0.00005549355,0.0001392703,0.0008541503,0.0001130255,0.0001481585],"category_scores_gemma":[0.00005397737,0.0001088972,0.0001089542,0.0009033468,0.00009434797,0.001029194,0.0001815059,0.001067005,0.00001687417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001831082,"about_ca_system_score_gemma":0.00006877593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001393318,"about_ca_topic_score_gemma":0.00009823884,"domain_scores_codex":[0.9982638,0.000260567,0.0004409298,0.0002391801,0.0003658093,0.0004296889],"domain_scores_gemma":[0.9986534,0.0004218415,0.0002230117,0.0003204827,0.000274181,0.0001070817],"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.0006563796,0.00008168061,0.03241557,0.000007673706,0.00006097136,0.000154199,0.0005287487,0.9120323,0.0000522001,0.02068224,0.001069822,0.03225822],"study_design_scores_gemma":[0.005062738,0.004931547,0.0194651,0.0008272546,0.00001541078,0.002539829,0.003775094,0.9433067,0.0008823837,0.01364415,0.004710411,0.0008394042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2867926,0.0001644425,0.7073455,0.0004341125,0.001905342,0.0001447319,9.828679e-8,0.00002670199,0.00318643],"genre_scores_gemma":[0.9936816,0.000135952,0.004708892,0.0001364216,0.0010708,0.00000228566,2.62688e-7,0.00001299669,0.0002507674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.706889,"threshold_uncertainty_score":0.4635666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069471802","doi":"10.1142/s0219265909002455","title":"BALANCING TRAFFIC LOAD USING ONE-TURN RECTILINEAR ROUTING","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Carleton University; University of Manitoba","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Path (computing); Load balancing (electrical power); Path vector protocol; Reduction (mathematics); Mathematical optimization; Topology (electrical circuits); Computer network; Mathematics; Routing protocol; Combinatorics; Geometry; Grid","retraction":null,"screen_n_in":null,"score":{"opus":0.01874577577433612,"gpt":0.2567553213121447,"spread":0.2380095455378086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165295,0.0002265435,0.0004354246,0.0002008629,0.0001939674,0.0003214822,0.0007422729,0.0001932041,0.00002750901],"category_scores_gemma":[0.0001934508,0.0002136038,0.0002867996,0.0007062191,0.00002400013,0.001212042,0.0000813318,0.001006116,0.000005215302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005354523,"about_ca_system_score_gemma":0.0001486425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008224548,"about_ca_topic_score_gemma":0.00001893259,"domain_scores_codex":[0.9975504,0.0002025925,0.0009974411,0.0003101033,0.0004752511,0.000464226],"domain_scores_gemma":[0.9977251,0.0002204044,0.0009423689,0.0003798844,0.0005403863,0.000191843],"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.0000614879,0.0001025958,0.00009568779,0.000003759029,0.0000596387,0.00005885731,0.000525835,0.7908161,0.0009994142,0.0006157289,0.0009845156,0.2056764],"study_design_scores_gemma":[0.0005391944,0.0004894653,0.0003782003,0.0004417436,0.00002930987,0.001244595,0.00009630623,0.9952412,0.0004065321,0.0002937834,0.000619852,0.0002197965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1911579,0.0006131722,0.8041581,0.0003810674,0.003054296,0.00009568199,9.412987e-8,0.00009503475,0.0004446853],"genre_scores_gemma":[0.9722472,0.00008671314,0.02445512,0.0006845687,0.00247274,6.845862e-7,2.331603e-7,0.00001636306,0.00003633435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7810894,"threshold_uncertainty_score":0.8710509,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046908253","doi":"10.1142/s0219265906001685","title":"AN ANALYTICAL APPROACH TO RELIABILITY ESTIMATION OF MOBILE AGENT-BASED SYSTEMS","year":2006,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Reliability (semiconductor); Asynchronous communication; Distributed computing; Node (physics); Throughput; Component (thermodynamics); Petri net; Mobile agent; Multi-agent system; Real-time computing; Computer network; Wireless; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01200447530507184,"gpt":0.2548075220576361,"spread":0.2428030467525643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967078,0.0001894718,0.0004206599,0.0003996712,0.00007158523,0.0001874753,0.0007801258,0.0001071214,0.00001228526],"category_scores_gemma":[0.00005459591,0.0001656929,0.0002123672,0.0008211382,0.00004084532,0.0006119447,0.00007908802,0.000272336,0.000004473654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003709326,"about_ca_system_score_gemma":0.00007002874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001030345,"about_ca_topic_score_gemma":0.000006382261,"domain_scores_codex":[0.9972658,0.0003583877,0.001225993,0.0003481944,0.0005203632,0.0002812321],"domain_scores_gemma":[0.9977528,0.0001783707,0.0007543921,0.0006792767,0.0004517064,0.0001834905],"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.00006097752,0.0004513293,0.0003176319,0.00004024485,0.00002696174,0.000006170098,0.00003931403,0.9814753,0.00004437474,0.003906938,0.004433127,0.009197651],"study_design_scores_gemma":[0.0004171723,0.0008892729,0.0008843165,0.000110146,0.00003668864,0.00002941338,0.00006613301,0.9962233,0.0002023905,0.0001609027,0.0008327141,0.000147548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08976848,0.0001038463,0.9077974,0.00007782389,0.001230921,0.0004154465,8.037598e-7,0.00005351487,0.0005517513],"genre_scores_gemma":[0.9606499,0.00000386585,0.03870936,0.0001277632,0.0004202724,0.00003570571,0.000005383775,0.00001390588,0.00003386563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8708814,"threshold_uncertainty_score":0.6756762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035352178","doi":"10.1142/s0219265905001435","title":"MULTI-AGENT SYSTEM ARCHITECTURE TO TRADING SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Architecture; Systems architecture; Negotiation; Interface (matter); IBM; Peer-to-peer; Resource (disambiguation); Multi-agent system; World Wide Web; Distributed computing; Computer network; Operating system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02011124692324592,"gpt":0.2493852751227801,"spread":0.2292740281995342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023547,0.000179892,0.0003421283,0.0003853666,0.0001314271,0.0002846454,0.0005585611,0.0001143738,0.000008390022],"category_scores_gemma":[0.00004552742,0.0001435451,0.0002010084,0.0003478613,0.000007372729,0.0005606783,0.00006299754,0.0003494601,0.0000293518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004480586,"about_ca_system_score_gemma":0.00002905468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002671846,"about_ca_topic_score_gemma":0.0000460569,"domain_scores_codex":[0.9980347,0.0002173492,0.0009031956,0.0002364221,0.0003366352,0.0002716641],"domain_scores_gemma":[0.9984904,0.0001005005,0.0006328527,0.0002818118,0.000251767,0.0002426517],"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.00004337927,0.0001113014,0.0003268351,0.00007507042,0.0001316137,0.00003677219,0.002596798,0.9419728,0.003451116,0.002312812,0.007477396,0.0414641],"study_design_scores_gemma":[0.0005815189,0.0002050282,0.0005574732,0.0006662074,0.00001532148,0.00120706,0.000338873,0.983546,0.0003846095,0.000002491656,0.01231934,0.0001761061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04109703,0.0005530937,0.9507748,0.0005865545,0.006494243,0.0002429673,5.722897e-7,0.00008758264,0.0001631338],"genre_scores_gemma":[0.977267,0.000008458873,0.02010937,0.0001482965,0.002275062,0.000008558705,3.787057e-7,0.00001516779,0.0001677654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9361699,"threshold_uncertainty_score":0.5853599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001623268","doi":"10.1142/s0219265909002662","title":"SECURE ANONYMOUS COMMUNICATION FOR WIRELESS SENSOR NETWORKS BASED ON PAIRING OVER ELLIPTIC CURVES","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer network; Computer science; Anonymity; Wireless sensor network; Computer security; Overhead (engineering); Protocol (science); Key (lock); Key distribution in wireless sensor networks; Secure communication; Wireless network; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01126112765214111,"gpt":0.2511109492248429,"spread":0.2398498215727018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001373527,0.0003647319,0.000582271,0.0003262531,0.0002908338,0.0002985643,0.001260719,0.0003264014,0.00002406469],"category_scores_gemma":[0.000157063,0.0003395395,0.0004624979,0.0006157331,0.00006027719,0.0007645549,0.00006999253,0.001167629,0.000002813254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002576747,"about_ca_system_score_gemma":0.00005700923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005123761,"about_ca_topic_score_gemma":0.00001868761,"domain_scores_codex":[0.9971326,0.0004128456,0.001055383,0.0003854218,0.0004671519,0.0005466169],"domain_scores_gemma":[0.9957686,0.001382436,0.001106192,0.0008854512,0.0006464786,0.0002108305],"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.0002715954,0.0002687731,0.000194074,0.0000364784,0.00006897363,0.00002304566,0.0001962113,0.9488598,0.00007327024,0.00295532,0.01525099,0.03180151],"study_design_scores_gemma":[0.001171254,0.001111274,0.0007067277,0.00185311,0.00004872727,0.000168145,0.00005254188,0.9924425,0.000168112,0.0005218483,0.001408013,0.0003477779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02607349,0.002465049,0.9649484,0.003517186,0.002149029,0.0004223876,0.000001351979,0.0001590948,0.0002639829],"genre_scores_gemma":[0.9816437,0.001181692,0.009762598,0.006077195,0.001244089,0.00001067202,0.000008811891,0.00003466416,0.00003651206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9555703,"threshold_uncertainty_score":0.9999056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140347193","doi":"10.1142/s0219265909002649","title":"QoS BASED SELECTION ALGORITHMS FOR COMPOSITE DISTRIBUTED WEB SERVICES","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Web service; Quality of service; Distributed computing; Fault tolerance; Selection algorithm; Selection (genetic algorithm); Component (thermodynamics); Function (biology); Service (business); Algorithm; Computer network; World Wide Web; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.007906585319661291,"gpt":0.244248468386534,"spread":0.2363418830668727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000437137,0.0002088016,0.0003059417,0.0002972025,0.0002101377,0.0002604271,0.0007274137,0.0001348903,0.00001002772],"category_scores_gemma":[0.000006994449,0.0001739716,0.00025942,0.0007064795,0.00001147179,0.0007589061,0.00003763727,0.0003600159,0.000002239357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008956974,"about_ca_system_score_gemma":0.00005866385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001531426,"about_ca_topic_score_gemma":0.0000818173,"domain_scores_codex":[0.9984657,0.0001023392,0.0006023351,0.0002573291,0.0002606616,0.0003116648],"domain_scores_gemma":[0.9981819,0.0002035657,0.0005986731,0.000210268,0.0006549492,0.000150576],"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.00163427,0.001194502,0.002786971,0.0002200896,0.0005472447,0.00005358502,0.001931679,0.7053592,0.02958651,0.00503464,0.006678495,0.2449729],"study_design_scores_gemma":[0.001267136,0.001190813,0.001622212,0.0002191346,0.00004391257,0.0002178104,0.00008731722,0.9801419,0.003866888,0.0008786474,0.01026003,0.0002042352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04446241,0.0002237449,0.9499742,0.002685537,0.002274206,0.0001746335,0.000004857002,0.0001128384,0.00008755684],"genre_scores_gemma":[0.9686237,0.00002180996,0.02594816,0.003820351,0.001542613,0.000005297441,0.00001823043,0.00001124559,0.00000860268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9241613,"threshold_uncertainty_score":0.7094356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098945293","doi":"10.1142/s0219265907002077","title":"ENERGY EFFICIENT DATA DISSEMINATION FOR UNIFORM COVERAGE IN WIRELESS SENSOR NETWORKS","year":2007,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"","keywords":"Wireless sensor network; Computer science; Efficient energy use; Computer network; Key distribution in wireless sensor networks; Distributed computing; Wireless; Real-time computing; Wireless network; Telecommunications; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01418532006575951,"gpt":0.269473368491935,"spread":0.2552880484261755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00338997,0.0003066484,0.0004913084,0.0006406811,0.0001557407,0.0002205242,0.001647494,0.0003130502,0.000007246816],"category_scores_gemma":[0.0001273339,0.0002825485,0.0001964022,0.001111667,0.00005772421,0.0007600775,0.0003543809,0.0006064571,7.715042e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003890703,"about_ca_system_score_gemma":0.00005524003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002733716,"about_ca_topic_score_gemma":0.0002591563,"domain_scores_codex":[0.9967467,0.0001455332,0.001402629,0.0005326614,0.0004641957,0.0007082389],"domain_scores_gemma":[0.9957664,0.001604198,0.001043531,0.0008403329,0.0005319052,0.0002136288],"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.0002095283,0.0002100531,0.0002112044,0.00000774416,0.0000420635,0.00006476866,0.000125365,0.8762359,0.0001934263,0.005687283,0.001476423,0.1155362],"study_design_scores_gemma":[0.0009286432,0.0002666269,0.000526884,0.0003443028,0.00001945206,0.000276709,0.0001189365,0.9945719,0.0005046899,0.00007496847,0.0020748,0.0002921472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07716078,0.0003589881,0.9174366,0.0002446329,0.004287706,0.0001597239,0.000002508171,0.00005973643,0.0002893062],"genre_scores_gemma":[0.9894276,0.0002681047,0.008550973,0.0002515915,0.001318243,0.000004553626,0.00003196005,0.00003703393,0.0001099673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9122668,"threshold_uncertainty_score":0.9999627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985317738","doi":"10.1142/s0219265909002637","title":"AN ADAPTIVE DYNAMIC LOAD BALANCING TECHNIQUE FOR GRID-BASED LARGE SCALE DISTRIBUTED SIMULATIONS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Scalability; Grid; Load balancing (electrical power); DEVS; Scheme (mathematics); Computation; Grid computing; Modeling and simulation; Algorithm; Simulation","retraction":null,"screen_n_in":null,"score":{"opus":0.009221525002629552,"gpt":0.269522023443353,"spread":0.2603004984407234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035028,0.0001671281,0.0003108471,0.000152007,0.0002151725,0.000190373,0.0005610737,0.0001437459,0.000004620607],"category_scores_gemma":[0.00008692597,0.0001499125,0.0002157485,0.0004353048,0.00001381084,0.0005930078,0.00002154814,0.000330076,9.768318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314027,"about_ca_system_score_gemma":0.000147105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005000938,"about_ca_topic_score_gemma":0.00003522494,"domain_scores_codex":[0.9984175,0.0001524431,0.0006499686,0.0002314861,0.0002375888,0.0003110381],"domain_scores_gemma":[0.9979388,0.0002419692,0.0006114533,0.0002862154,0.0007765651,0.0001450111],"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.0001142926,0.0002091949,0.0001265108,0.000005833667,0.00002742371,0.000007182483,0.0001309292,0.9935629,0.0009704987,0.0005825433,0.001644338,0.002618299],"study_design_scores_gemma":[0.0007987386,0.00138331,0.0008412198,0.0002310459,0.00001656843,0.0000900942,0.00005892387,0.9940298,0.0003152739,0.0009779728,0.001089577,0.0001674489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007655414,0.00009058017,0.9900401,0.0003944675,0.001362295,0.0002789641,0.00004090874,0.0001013274,0.00003590103],"genre_scores_gemma":[0.9748192,0.000001800233,0.02438683,0.00024112,0.0004903405,0.000005392636,0.00003836712,0.000008545556,0.000008407861],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9671638,"threshold_uncertainty_score":0.6113254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096437618","doi":"10.1142/s0219265902000513","title":"STATION LAYOUTS IN THE PRESENCE OF LOCATION CONSTRAINTS","year":2002,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Center (category theory); Base station; RADIUS; Point (geometry); Planar; Total station; Computer science; SIGNAL (programming language); Cover (algebra); Wireless; Telecommunications; Metro station; Electrical engineering; Computer network; Geodesy; Geometry; Geography; Mathematics; Engineering; Computer graphics (images); Transport engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02180173331021613,"gpt":0.2467084641188144,"spread":0.2249067308085982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080432,0.00005546359,0.00009759574,0.0001984731,0.00002923097,0.00005357733,0.0002957457,0.00003808356,0.00002606035],"category_scores_gemma":[0.0001851174,0.00004135038,0.00004607834,0.0006483629,0.00003345666,0.00058207,0.00001775233,0.0001695147,0.00000227688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003242125,"about_ca_system_score_gemma":0.00002057189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004471086,"about_ca_topic_score_gemma":0.00001497725,"domain_scores_codex":[0.9989796,0.0001838225,0.0004415157,0.00008082672,0.0002340803,0.00008020327],"domain_scores_gemma":[0.998769,0.0003385369,0.0003833838,0.0001098564,0.000376762,0.00002245717],"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.00002779919,0.0001757684,0.0007451032,0.00001182656,0.00002064539,0.000008899603,0.003622574,0.8003082,0.0003404719,0.0158851,0.004810101,0.1740435],"study_design_scores_gemma":[0.0003861336,0.000246621,0.007233577,0.00009860683,0.00000575249,0.0002312131,0.0003451075,0.988876,0.0003873989,0.001757564,0.0003702985,0.00006165716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0838218,0.0002834566,0.9139427,0.0007959762,0.0007008183,0.00007024607,2.326493e-7,0.000005218661,0.0003795415],"genre_scores_gemma":[0.9967375,0.00006359255,0.002822977,0.0001797403,0.0001646538,0.000001829125,8.2208e-7,0.000001853672,0.0000270016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9129158,"threshold_uncertainty_score":0.168622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106723590","doi":"10.1142/s0219265908002138","title":"A NOVEL SOFTWARE-BUILT PARALLEL MACHINES AND THEIR INTERCONNECTIONS","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Computer science; Software; Virtual machine; Distributed computing; Parallel computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0235275803992602,"gpt":0.2365458262791595,"spread":0.2130182458798993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156337,0.000213367,0.0003699256,0.0002408898,0.0002789873,0.0001580635,0.0005822152,0.0001150722,0.00001068283],"category_scores_gemma":[0.0001575502,0.0001596975,0.0002141724,0.0003651627,0.00006988813,0.0006628892,0.0001729036,0.0004743433,0.000004223005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005772905,"about_ca_system_score_gemma":0.00005606886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005171173,"about_ca_topic_score_gemma":0.00003044982,"domain_scores_codex":[0.9985699,0.000110491,0.0006685229,0.0002404263,0.0001555275,0.0002551391],"domain_scores_gemma":[0.9983796,0.0003570152,0.0005041052,0.0002689059,0.0003274658,0.0001628696],"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.0005484063,0.001663309,0.02912494,0.0001340415,0.001820083,0.000394467,0.01890547,0.6327354,0.003484161,0.02097922,0.08797409,0.2022365],"study_design_scores_gemma":[0.002039409,0.0009964784,0.007958358,0.0004586322,0.00002469423,0.03598754,0.0002987011,0.9325965,0.00008976869,0.002032273,0.01696602,0.0005516189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08395287,0.0007842359,0.9116504,0.0004868911,0.002749492,0.00007266757,0.000001781567,0.0001026339,0.0001990321],"genre_scores_gemma":[0.9833993,0.000152035,0.01528896,0.000280441,0.0007309452,0.000003131669,0.000001449481,0.00001279692,0.0001309584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8994464,"threshold_uncertainty_score":0.6512274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068164281","doi":"10.1142/s0219265908002369","title":"A NOVEL SPECTRUM OF EPOCH CONVERGENT CONGESTION CONTROL","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Bottleneck; Computer science; Network congestion; Bandwidth (computing); Computer network; Software deployment; Epoch (astronomy); HSTCP; Distributed computing; TCP Friendly Rate Control","retraction":null,"screen_n_in":null,"score":{"opus":0.01241703797414058,"gpt":0.2082214643645836,"spread":0.1958044263904431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006289328,0.0001727349,0.0004522154,0.0002230793,0.0001037722,0.00003518605,0.0005096372,0.0001286197,0.00006329098],"category_scores_gemma":[0.00009614954,0.0001496444,0.0002868329,0.0003579931,0.00009135705,0.0005091171,0.00004143019,0.0004148131,0.000006820278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008767441,"about_ca_system_score_gemma":0.000109633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001251237,"about_ca_topic_score_gemma":0.00001245525,"domain_scores_codex":[0.9981625,0.0001222489,0.0009202733,0.0001964284,0.0003434203,0.0002551471],"domain_scores_gemma":[0.9978575,0.0003004498,0.0009606766,0.0002593782,0.0004640499,0.0001579331],"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.001423788,0.001244236,0.007868849,0.00003620765,0.001180863,0.0002942395,0.001263432,0.7523546,0.005412642,0.08152071,0.0204977,0.1269028],"study_design_scores_gemma":[0.004977505,0.001266205,0.006379363,0.0002054897,0.00007458379,0.004689927,0.00006731457,0.978074,0.0006883886,0.0007066052,0.002580931,0.0002896726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06871887,0.0006308199,0.9252464,0.001449654,0.003548382,0.0001222594,9.150158e-7,0.00004394735,0.0002388017],"genre_scores_gemma":[0.9961039,0.0002706683,0.002316274,0.0003983121,0.0007837848,0.000003886654,4.906612e-7,0.00001072368,0.0001119818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.927385,"threshold_uncertainty_score":0.6102321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023975480","doi":"10.1142/s0219265909002625","title":"USING ACCURACY-BASED LEARNING CLASSIFIER SYSTEMS FOR ADAPTABLE STRATEGY GENERATION IN GAMES AND INTERACTIVE VIRTUAL SIMULATIONS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Classifier (UML); Adaptability; Scripting language; Learning classifier system; Human–computer interaction; Unsupervised learning","retraction":null,"screen_n_in":null,"score":{"opus":0.05289993945390044,"gpt":0.3128467681012841,"spread":0.2599468286473837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003234873,0.00009228376,0.0001570721,0.0002088725,0.0001642449,0.0002075523,0.0001256232,0.00007209083,0.000003146514],"category_scores_gemma":[0.00009275397,0.00008636479,0.00005589226,0.000248385,0.00001382435,0.001084,0.00001442915,0.0002767823,1.872247e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001353653,"about_ca_system_score_gemma":0.00007584479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001563208,"about_ca_topic_score_gemma":0.00001537289,"domain_scores_codex":[0.9990959,0.00009064792,0.0004341748,0.0001525822,0.00009356315,0.000133186],"domain_scores_gemma":[0.9988826,0.0003007138,0.0003865873,0.00008463331,0.000293492,0.00005201088],"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.00002140903,0.0000519747,0.0001167078,0.000001577157,0.00001011058,0.000001111222,0.00009392917,0.979004,0.0013236,0.004801046,0.0001563268,0.01441816],"study_design_scores_gemma":[0.000482074,0.0004172314,0.0005975812,0.00007547243,0.000008868344,0.00005537266,0.0002347845,0.9968596,0.0000963743,0.0003693411,0.000716277,0.00008707488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1029932,0.0003211287,0.8958936,0.0002736705,0.0003396615,0.0001460377,9.064377e-7,0.00001341276,0.00001843648],"genre_scores_gemma":[0.9838715,0.00003492385,0.01553778,0.00006760207,0.0004384874,0.000005327925,0.000004052847,0.000004888652,0.00003541999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8808783,"threshold_uncertainty_score":0.3521854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007824828","doi":"10.1142/s0219265905001393","title":"A FRAMEWORK FOR ADAPTIVE AND DYNAMIC COMPOSITION OF WEB SERVICES","year":2005,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Web service; Computer science; WS-I Basic Profile; WS-Policy; Web modeling; World Wide Web; WS-Addressing; Services computing; Service-oriented architecture; Dynamic web page; Data Web; OWL-S; Web standards; Context (archaeology); Web development; Web application security; Web mapping; Web intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.007030550419173799,"gpt":0.2498384989005161,"spread":0.2428079484813423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819299,0.0001197623,0.0002402736,0.0001989116,0.00007622161,0.00006453981,0.0003722541,0.0001044445,0.000005865875],"category_scores_gemma":[0.000004208899,0.00009886116,0.0001189729,0.0002381934,0.0000221957,0.0005898801,0.00007811288,0.0002526919,6.603337e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003600085,"about_ca_system_score_gemma":0.0000229416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009238308,"about_ca_topic_score_gemma":0.0001452319,"domain_scores_codex":[0.9990451,0.00005879819,0.0004481561,0.0001523488,0.0001453713,0.0001502625],"domain_scores_gemma":[0.9985605,0.0003226641,0.0005653881,0.0001510368,0.000325249,0.00007509624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002643537,0.0008888835,0.001488009,0.0006260984,0.001201889,0.0000201628,0.02334501,0.2151796,0.01868052,0.1903236,0.0004232762,0.5451793],"study_design_scores_gemma":[0.0007036253,0.0008476249,0.0006401169,0.0006630385,0.00004344828,0.0002322176,0.0006174044,0.9836161,0.001269459,0.01012829,0.00110276,0.0001359044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.21277,0.0008578954,0.7844383,0.001177435,0.0005772783,0.00009274765,0.000001651059,0.00001927117,0.00006543017],"genre_scores_gemma":[0.8971509,0.0001191585,0.1015192,0.000829285,0.0003666522,0.00000306191,0.000001101515,0.000007446388,0.000003224879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7684365,"threshold_uncertainty_score":0.4031441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099324926","doi":"10.1142/s0219265906001624","title":"INTERCONNECTING 802.15.4 CLUSTERS IN MASTER-SLAVE MODE USING GUARANTEED TIME SLOTS AND ACKNOWLEDGED TRANSFERS: QUEUEING THEORETIC ANALYSIS","year":2006,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Queueing theory; Network packet; Cluster (spacecraft); Sink (geography); Wireless sensor network; Queue; Distributed computing; Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01112550333423283,"gpt":0.2486679462179452,"spread":0.2375424428837124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001502612,0.0003201021,0.0007456394,0.001010988,0.0001572106,0.0004445789,0.000555835,0.0002157402,0.00004486557],"category_scores_gemma":[0.00005121412,0.0002841477,0.0003827829,0.001219343,0.00008194198,0.001046634,0.0001307271,0.0007164421,0.000002566903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002195241,"about_ca_system_score_gemma":0.00004873134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001362055,"about_ca_topic_score_gemma":0.0007171244,"domain_scores_codex":[0.9970801,0.0004965974,0.001265325,0.0004170935,0.0002615559,0.000479286],"domain_scores_gemma":[0.9982815,0.0004667695,0.0005961349,0.0002916341,0.000246965,0.0001169945],"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.000322349,0.0001359609,0.005504115,0.00004427553,0.0004347501,0.00009889153,0.002266929,0.9677296,0.001807373,0.001671339,0.0001499193,0.01983456],"study_design_scores_gemma":[0.001190905,0.0003022401,0.0006855245,0.000721523,0.000154761,0.0002833094,0.0002637987,0.9940132,0.0003708575,0.001680905,0.00003742093,0.0002954802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3700684,0.0002010203,0.6284068,0.0001327758,0.0004134604,0.0004672266,5.457941e-7,0.00003620149,0.0002736211],"genre_scores_gemma":[0.9951663,0.00002556356,0.004003276,0.0001430132,0.0005688141,0.00002604353,0.000001160439,0.00002642949,0.00003939241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6250979,"threshold_uncertainty_score":0.9999611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2995864758","doi":"10.1142/s0219265919500087","title":"Traversal with Enumeration of Geometric Graphs in Bounded Space","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","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":"Simon Fraser University","funders":"","keywords":"Geometric graph theory; Graph traversal; Tree traversal; Vertex (graph theory); Spatial network; Bounded function; Graph; Enumeration; Path graph; Edge-graceful labeling","retraction":null,"screen_n_in":null,"score":{"opus":0.004675571913619606,"gpt":0.2007537409321477,"spread":0.1960781690185281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441608,0.0000832888,0.0001912563,0.0008786524,0.00002464531,0.000063092,0.0001963309,0.00005727503,0.00003287241],"category_scores_gemma":[0.00003816524,0.00006922497,0.00007589571,0.001570864,0.00001346116,0.0007380233,0.00002208018,0.0002113504,0.000002776976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006881227,"about_ca_system_score_gemma":0.00007251521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349332,"about_ca_topic_score_gemma":0.00003875023,"domain_scores_codex":[0.9990038,0.00008102393,0.0004156402,0.000126083,0.0002617131,0.0001116837],"domain_scores_gemma":[0.9989401,0.0001548903,0.0004283678,0.0001172771,0.0003165171,0.00004284047],"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.0002561778,0.0001738237,0.009420925,0.00001948722,0.00007660512,0.00001255351,0.000560334,0.9353795,0.0017078,0.02350002,0.0004816261,0.02841112],"study_design_scores_gemma":[0.003551561,0.003284926,0.046033,0.0003274152,0.00002754022,0.0006060702,0.0003086975,0.9310074,0.008359374,0.004797089,0.00136636,0.0003305909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4441268,0.000107774,0.5547479,0.0001294551,0.0006486122,0.00005750483,1.016777e-7,0.000005112782,0.0001767173],"genre_scores_gemma":[0.9920161,0.00003780449,0.00771014,0.00006160435,0.0001004115,9.721655e-7,0.00000133836,0.000004302173,0.00006726999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5478893,"threshold_uncertainty_score":0.2822913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967637888","doi":"10.1142/s0219265905001320","title":"(QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS","year":2005,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc 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":"Simon Fraser University","funders":"","keywords":"Spanner; Computer science; Wireless ad hoc network; Mobile ad hoc network; Class (philosophy); Post hoc; Wireless; Computer network; Distributed computing; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01081509108304547,"gpt":0.2524495803292482,"spread":0.2416344892462028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001424494,0.0003245345,0.0005474676,0.0002722053,0.0002033903,0.0003087197,0.001267107,0.0003014976,0.00008153217],"category_scores_gemma":[0.00009080137,0.0002900092,0.0005456531,0.000563642,0.00006300392,0.001488759,0.0001760778,0.0008337761,0.00001412579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003147302,"about_ca_system_score_gemma":0.00008254889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001130592,"about_ca_topic_score_gemma":0.00005128015,"domain_scores_codex":[0.9972442,0.0001570751,0.001175348,0.0004189203,0.0003441853,0.000660259],"domain_scores_gemma":[0.9969047,0.000601484,0.001001038,0.0005697057,0.0006118032,0.0003112588],"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.0001208332,0.000162316,0.00003199491,0.000005220922,0.00009034976,0.000009595562,0.0001781843,0.5567361,0.00001656154,0.001177166,0.03366244,0.4078093],"study_design_scores_gemma":[0.0009991459,0.001656055,0.00004370976,0.0001313837,0.00003385869,0.0004112682,0.00009904827,0.7706432,0.00008759501,0.0003327133,0.2252927,0.0002692646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006376434,0.01107987,0.9752572,0.001000228,0.005400847,0.0004438073,7.874253e-7,0.0001202731,0.0003205386],"genre_scores_gemma":[0.9469012,0.002767227,0.04258611,0.001486677,0.005643656,0.00009026982,0.000003229373,0.00005341359,0.0004682183],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9405248,"threshold_uncertainty_score":0.9999552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167205037","doi":"10.1142/s0219265900000147","title":"LINK-STATE AWARE DYNAMIC TRAFFIC SCHEDULING FOR PROVIDING PREDICTIVE QoS IN WIRELESS MOBILE MULTIMEDIA NETWORKS","year":2000,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Advanced Wireless Network Optimization","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":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Time division multiple access; Quality of service; Burstiness; Scheduling (production processes); Call Admission Control; Real-time computing; Wireless broadband; Wireless; Wireless network; Network packet; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.004322295544888888,"gpt":0.222165718609343,"spread":0.2178434230644541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004562383,0.0003274119,0.0005201446,0.000314768,0.0001035554,0.00007398937,0.0002254054,0.0002881624,0.0000545772],"category_scores_gemma":[0.00003464471,0.0003367726,0.0002128584,0.0005350766,0.00004279526,0.0007490183,0.00001616616,0.0009796642,0.000002161501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000546456,"about_ca_system_score_gemma":0.0000324948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002135477,"about_ca_topic_score_gemma":0.00008558215,"domain_scores_codex":[0.9978624,0.00008023965,0.001091212,0.0002588241,0.0001786933,0.0005286467],"domain_scores_gemma":[0.9987526,0.0003845211,0.0003214775,0.0001591906,0.0002345556,0.000147641],"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.0003104403,0.00003805359,0.00005911206,0.00003155016,0.00007499469,0.00001048481,0.0003909275,0.7707997,0.00005564213,0.000001033939,0.0001239217,0.2281041],"study_design_scores_gemma":[0.001495967,0.0003357797,0.00009329489,0.0007977761,0.00003792347,0.00007043306,0.0002173635,0.9962701,0.0001012811,0.00002012168,0.0002577202,0.0003022999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3213035,0.0008701728,0.6748121,0.00001978428,0.002302251,0.0005258921,0.000003852773,0.0001420489,0.00002033364],"genre_scores_gemma":[0.9886093,0.00282563,0.006235897,0.00003132624,0.001983548,0.0001210232,0.00002712979,0.0001198189,0.00004632676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6685762,"threshold_uncertainty_score":0.9999084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210619295","doi":"10.1142/s0219265921420172","title":"A Note on Linearly Many Faults of Interconnection Networks","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Interconnection; Computer science; Vulnerability (computing); Measure (data warehouse); Graph; Theoretical computer science; Distributed computing; Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Data mining; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01129294789628866,"gpt":0.2422694728931259,"spread":0.2309765249968373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002672074,0.0004019901,0.0008218093,0.0008961239,0.0004631391,0.0001732131,0.001424791,0.0002359384,0.0002446019],"category_scores_gemma":[0.0001702794,0.0003702536,0.0007622953,0.00126482,0.00006652777,0.0009354212,0.0004403441,0.001912482,0.00001009393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005721576,"about_ca_system_score_gemma":0.00009879561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006927171,"about_ca_topic_score_gemma":0.00005081796,"domain_scores_codex":[0.995208,0.0008578447,0.002030299,0.0005322386,0.0008219011,0.0005497113],"domain_scores_gemma":[0.9954794,0.0006607969,0.002174699,0.000692237,0.0007730801,0.0002198109],"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.0008093946,0.0004097681,0.0002873635,0.00002101307,0.0002485674,0.00008833535,0.001124532,0.9440375,0.0003554712,0.009279439,0.01510935,0.02822927],"study_design_scores_gemma":[0.001496714,0.004543439,0.0003688842,0.000350159,0.00004424047,0.001955453,0.0007710229,0.9716001,0.0004540105,0.0005161677,0.01749002,0.0004097649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.055719,0.0004352265,0.9222078,0.0007589553,0.0191143,0.0002876095,0.000003321075,0.0001073602,0.001366399],"genre_scores_gemma":[0.9951401,0.0001009913,0.001025504,0.0009108072,0.002264157,0.00003155048,0.000003649067,0.00004637109,0.0004769076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9394211,"threshold_uncertainty_score":0.9998749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993964758","doi":"10.1142/s0219265906001739","title":"EXPLORING PLANAR GRAPHS USING UNORIENTED MAPS","year":2006,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Overhead (engineering); Embedding; Planar graph; Node (physics); Graph; Traverse; Algorithm; Planar; Terrain; Planar straight-line graph; Book embedding; Theoretical computer science; Artificial intelligence; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.06915790782859202,"gpt":0.2541455881890506,"spread":0.1849876803604586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004789847,0.00009818596,0.0001564473,0.0003547285,0.0001231586,0.0001738507,0.0003299242,0.00004592981,0.00001608253],"category_scores_gemma":[0.0000266148,0.00008601558,0.0001215749,0.0005758256,0.00002120074,0.001440312,0.00004294615,0.0002966611,0.000002792049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008704497,"about_ca_system_score_gemma":0.00003189312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004235389,"about_ca_topic_score_gemma":0.0000156494,"domain_scores_codex":[0.9988399,0.00009980666,0.0004868238,0.0001300198,0.0002341035,0.0002093783],"domain_scores_gemma":[0.9990748,0.00006764042,0.0003184173,0.0001464896,0.0003100297,0.00008263445],"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.00004245243,0.0001066783,0.001312913,0.000007789789,0.00005192037,0.0000563356,0.000283587,0.9432653,0.0007554488,0.04210811,0.004128141,0.007881285],"study_design_scores_gemma":[0.0007437382,0.0002584643,0.0005804252,0.0001821047,0.0000116384,0.000546855,0.0001677056,0.9868693,0.0005995535,0.005078465,0.00477197,0.0001897494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0464191,0.0001265944,0.9503946,0.0002637436,0.002141041,0.00005106198,2.661602e-7,0.00004508721,0.0005585251],"genre_scores_gemma":[0.9677637,0.0001233618,0.03140841,0.0001419003,0.000480071,0.000001922719,0.000001424469,0.00001064395,0.00006858257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9213446,"threshold_uncertainty_score":0.3507614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095444497","doi":"10.1142/s0219265900000020","title":"IMPROVED BOUNDS FOR GOSSIPING IN MESH BUS NETWORKS","year":2000,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","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":"University of the Fraser Valley","funders":"","keywords":"Gossip; Computer science; Bus network; Computer network; Node (physics); Dimension (graph theory); Protocol (science); Address bus; Distributed computing; Control bus; System bus; Mathematics; Combinatorics; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.01029071756906438,"gpt":0.2399911025432439,"spread":0.2297003849741795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001922024,0.0002808028,0.0005851245,0.0003741657,0.0002013351,0.0004700359,0.0008262174,0.0002927654,0.0001317437],"category_scores_gemma":[0.0001009856,0.0002483455,0.0004463703,0.0007131284,0.00004091582,0.001210749,0.00005733522,0.0007287789,0.000004394002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002917661,"about_ca_system_score_gemma":0.00007095517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004962133,"about_ca_topic_score_gemma":0.0002124926,"domain_scores_codex":[0.9971293,0.000218495,0.001469317,0.0003769262,0.0002172862,0.0005886568],"domain_scores_gemma":[0.9977702,0.0003978717,0.0008602468,0.0003759556,0.0004210731,0.0001745895],"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.0007018079,0.000237903,0.0006077078,0.00003104995,0.000220623,0.00005146997,0.0008776571,0.6895557,0.0001732075,0.005992866,0.01804251,0.2835075],"study_design_scores_gemma":[0.001478687,0.0006871881,0.000298791,0.0003448762,0.00001483283,0.0006089331,0.000133373,0.9796799,0.00005061704,0.0006301579,0.01579817,0.0002744969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02972623,0.0008722814,0.9602503,0.0005144546,0.007099173,0.0003171474,4.578414e-7,0.00007000555,0.001149915],"genre_scores_gemma":[0.9923285,0.0002955279,0.002990681,0.0006794335,0.002815814,0.00003191761,0.000001397084,0.00002995012,0.0008267697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9626023,"threshold_uncertainty_score":0.9999969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}