{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003860712,0.0002968888,0.0003084745,0.001069561,0.0005642911,0.0005926571,0.0008328105,0.0003798243,0.003812229],"category_scores_gemma":[0.004009865,0.0001724416,0.0003735438,0.001028109,0.0008740525,0.001615823,0.0008528498,0.0007374728,0.0001899301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001093637,"about_ca_system_score_gemma":0.0005848051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005498808,"about_ca_topic_score_gemma":0.003949839,"domain_scores_codex":[0.999661,0.00005464217,0.00001345182,0.00006995628,0.0001283884,0.00007264805],"domain_scores_gemma":[0.9975605,0.001122387,0.0004664789,0.0002817283,0.0003959725,0.0001728492],"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.000271469,0.00004950117,0.003929992,0.0002988236,0.00003797888,0.0005119632,0.0003782857,0.408973,0.006940904,0.5322058,0.003508174,0.04289407],"study_design_scores_gemma":[0.0000292879,0.00008400848,0.002413841,0.00002062415,0.00002369053,0.0003370541,0.0001686582,0.6470041,0.002196855,0.3431162,0.004584066,0.00002155622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5521879,0.00121414,0.4086278,0.0006920717,0.000052339,0.0001204199,0.001056797,0.0003834736,0.03566517],"genre_scores_gemma":[0.9790984,0.0004251955,0.0171649,0.00006717484,0.00003251596,0.00005705264,0.0004345741,0.00004231096,0.002677702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005498808,"threshold_uncertainty_score":0.01275313,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"László Lipták","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710615,0.0007743923,0.0007319626,0.001529612,0.0004724069,0.001346004,0.002004823,0.0008954266,0.002860214],"category_scores_gemma":[0.006960555,0.0004261725,0.0009168626,0.001179228,0.002570649,0.004410103,0.002126846,0.002551398,0.0001961826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001456072,"about_ca_system_score_gemma":0.001138778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009342537,"about_ca_topic_score_gemma":0.00102668,"domain_scores_codex":[0.9988846,0.0002696869,0.00006467983,0.0002177364,0.0004352654,0.0001280466],"domain_scores_gemma":[0.9971818,0.00171647,0.0001876106,0.0004072714,0.0004137312,0.00009322487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001760369,0.00001814593,0.0002973262,0.00006437941,0.00001970163,0.0001373858,0.00007394297,0.228406,0.002782163,0.7558367,0.0004031914,0.01194342],"study_design_scores_gemma":[0.000006653172,0.00002762477,0.0001073261,0.00001169637,0.00001107786,0.00007047925,0.0000150871,0.6436732,0.001182922,0.3540094,0.0008715609,0.000012909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007230835,0.000119256,0.9898775,0.0001100199,0.00002033204,0.00001256768,0.00003438639,0.00008453097,0.002510564],"genre_scores_gemma":[0.771417,0.0008801102,0.223585,0.0001812098,0.000214244,0.0001712668,0.0002371881,0.00009766028,0.003216382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002860214,"threshold_uncertainty_score":0.01056457,"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","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Rafail Ostrovsky","is_ca":false},{"name":"Yuval Rabani","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009535127,0.0005061424,0.0004324804,0.0004233949,0.0006609887,0.001046133,0.0007978342,0.0005800702,0.001914482],"category_scores_gemma":[0.005228698,0.0002034623,0.0006301533,0.0004377371,0.00204978,0.002691363,0.001612698,0.001353419,0.0002277584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071997,"about_ca_system_score_gemma":0.0006391853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002180506,"about_ca_topic_score_gemma":0.0009968427,"domain_scores_codex":[0.9990973,0.0002705098,0.00004462533,0.0001903958,0.0002363549,0.0001607985],"domain_scores_gemma":[0.9968656,0.001453959,0.0004970485,0.0007159171,0.0002911855,0.000176343],"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.0001687185,0.00004986174,0.0007112311,0.00003412991,0.00003877671,0.0002988945,0.0002563024,0.5584859,0.01026416,0.4109225,0.0006790648,0.01809047],"study_design_scores_gemma":[0.00001153704,0.00005982089,0.0001545665,0.000004091717,0.00001289858,0.00005933222,0.00004086014,0.8289405,0.003330145,0.1665245,0.0008521603,0.000009444823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2011703,0.0001254698,0.7866349,0.0004839626,0.00004753395,0.0000596028,0.0001169989,0.0005041861,0.01085702],"genre_scores_gemma":[0.9838051,0.00009841211,0.01354814,0.00005337705,0.00002369882,0.00002987296,0.00004104372,0.00004222085,0.002358123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002180506,"threshold_uncertainty_score":0.007777989,"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","authors":[{"name":"Hamid Sarbazi‐Azad","is_ca":false},{"name":"M. Ould‐Khaoua","is_ca":false},{"name":"Lewis Mackenzie","is_ca":false},{"name":"Selim G. Akl","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001534816,0.0006182919,0.000824648,0.001572606,0.001296332,0.003004193,0.001135708,0.0007959609,0.003305029],"category_scores_gemma":[0.01218569,0.0005139163,0.000632848,0.003617013,0.003244083,0.00538574,0.00150326,0.001423618,0.0004909718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001138718,"about_ca_system_score_gemma":0.000642323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001769659,"about_ca_topic_score_gemma":0.001283738,"domain_scores_codex":[0.9987671,0.000418144,0.00008058188,0.0001966157,0.0003810506,0.0001565191],"domain_scores_gemma":[0.9896075,0.007698894,0.001200472,0.000553733,0.0006733278,0.000266032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001931279,0.0000736362,0.002968423,0.0002268167,0.00003660235,0.0003821615,0.0004626946,0.2192001,0.003872115,0.7237301,0.004209579,0.04464453],"study_design_scores_gemma":[0.00003329508,0.00009489899,0.001503627,0.00005125836,0.00002063633,0.0007289865,0.0003310535,0.252595,0.001930114,0.7360601,0.006612939,0.00003802004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5439432,0.004418546,0.3675654,0.002851742,0.0001881368,0.0001530938,0.0009670787,0.0002065435,0.07970611],"genre_scores_gemma":[0.9141718,0.004311844,0.07220067,0.0005670826,0.0005324432,0.0003074942,0.0009475619,0.0001606509,0.006800444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003305029,"threshold_uncertainty_score":0.01105636,"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","authors":[{"name":"Saber Gholami","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Edward Maraachlian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003614765,0.0002479304,0.0005430663,0.000440437,0.0006275052,0.0008769601,0.0006428928,0.0006513632,0.001967437],"category_scores_gemma":[0.004113317,0.0004053403,0.0002900151,0.0009075134,0.0004878506,0.001562375,0.0007388052,0.0005088993,0.0003643851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009491976,"about_ca_system_score_gemma":0.0009419858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002822527,"about_ca_topic_score_gemma":0.003296706,"domain_scores_codex":[0.9995936,0.0001153092,0.00002295518,0.00009217559,0.00008287347,0.00009316879],"domain_scores_gemma":[0.9982679,0.001028507,0.0001976453,0.0001789148,0.0002117783,0.0001151355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006040384,0.0001337759,0.001275373,0.0007484252,0.00007770677,0.0002563514,0.0006468926,0.5673575,0.03361528,0.2145266,0.01599788,0.1647601],"study_design_scores_gemma":[0.0000726892,0.0001168977,0.0005660676,0.0000415924,0.00002756811,0.0001092218,0.0001185877,0.8369901,0.004562068,0.1523857,0.00499007,0.00001939058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3803267,0.00221323,0.5918582,0.001038394,0.0001195791,0.0001641166,0.0008118686,0.001319825,0.02214818],"genre_scores_gemma":[0.8731119,0.001023514,0.1199372,0.0001677215,0.0000556948,0.0001225299,0.0006239518,0.0001468658,0.004810615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002822527,"threshold_uncertainty_score":0.006887019,"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","authors":[{"name":"Jean Carle","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001284283,0.0002271202,0.0002833644,0.0005370757,0.0004545555,0.001275243,0.0004818591,0.000581221,0.003982665],"category_scores_gemma":[0.0008289101,0.0001654635,0.0003365297,0.0004703155,0.0005513358,0.001498805,0.0009339347,0.0005226987,0.0006722368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000323221,"about_ca_system_score_gemma":0.0001700518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007059618,"about_ca_topic_score_gemma":0.0008752467,"domain_scores_codex":[0.9997914,0.00005016299,0.00001157618,0.00003741388,0.00006421961,0.00004522376],"domain_scores_gemma":[0.999661,0.00008506412,0.000043155,0.00009108493,0.00007584086,0.00004401077],"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.0000344851,0.00003119423,0.0005216536,0.00009045981,0.00001955834,0.0002687038,0.0001266836,0.04624984,0.007346204,0.9015117,0.005518258,0.03828132],"study_design_scores_gemma":[0.00001985758,0.00005800111,0.0007579412,0.00003518394,0.00001556105,0.000646844,0.00009720567,0.2844424,0.004891912,0.6427098,0.06629094,0.00003435131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1881932,0.004349625,0.6806831,0.001052893,0.0008050402,0.0001524843,0.000519502,0.0008476752,0.1233966],"genre_scores_gemma":[0.8182459,0.002981124,0.1538148,0.0005036287,0.0002042212,0.0001825768,0.0004788371,0.00008611807,0.02350277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003982665,"threshold_uncertainty_score":0.01332331,"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","authors":[{"name":"Edgar Chávez","is_ca":false},{"name":"Stefan Dobrev","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Jaroslav Opatrny","is_ca":true},{"name":"Ladislav Stacho","is_ca":true},{"name":"Jorge Urrutia","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001852295,0.0002608372,0.0003029543,0.0004706337,0.0004854246,0.0008391217,0.0006641719,0.0004590236,0.007261619],"category_scores_gemma":[0.001234646,0.0002832459,0.0003401606,0.000633269,0.0005390237,0.001525759,0.001191434,0.0005173021,0.001569625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003902687,"about_ca_system_score_gemma":0.0005374738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001824226,"about_ca_topic_score_gemma":0.002716423,"domain_scores_codex":[0.9997149,0.00003139328,0.00002229693,0.0000560695,0.0001326194,0.00004262131],"domain_scores_gemma":[0.9995433,0.0001149924,0.00004992978,0.0001898177,0.00007900788,0.00002300535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005004362,0.0001225821,0.003420673,0.0003677519,0.00006080221,0.0005949946,0.0006773772,0.09494915,0.1578397,0.1757213,0.01138977,0.5543555],"study_design_scores_gemma":[0.0001129449,0.0005276548,0.002196747,0.00008563828,0.00008422958,0.001069926,0.0005386872,0.5879882,0.1265489,0.1433457,0.1374055,0.00009580227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08121415,0.0001169457,0.9022002,0.0002693605,0.00006709007,0.00008901147,0.0003606472,0.002307459,0.01337519],"genre_scores_gemma":[0.4063249,0.0002617271,0.5805875,0.0001129921,0.00001233782,0.00009704869,0.0009149174,0.000364138,0.01132446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007261619,"threshold_uncertainty_score":0.02429247,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000616244,0.0006693652,0.0005169139,0.002564138,0.0005461369,0.001148525,0.0009225805,0.0008201731,0.004953269],"category_scores_gemma":[0.003281323,0.0002931919,0.000628247,0.001196912,0.001174591,0.002697229,0.0005828244,0.001154802,0.0006896954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008072305,"about_ca_system_score_gemma":0.0002426526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004337218,"about_ca_topic_score_gemma":0.0002791074,"domain_scores_codex":[0.9997594,0.00008815055,0.000009587565,0.00003883138,0.00006489124,0.00003921911],"domain_scores_gemma":[0.9987204,0.0007940331,0.0001074702,0.00009380229,0.0002151838,0.00006909361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008301488,0.00001304175,0.0002530703,0.00003476886,0.00000759422,0.00007307487,0.00009374976,0.02440842,0.00185853,0.9607611,0.0007674724,0.01172083],"study_design_scores_gemma":[0.000006098623,0.00002102485,0.0002890698,0.00001223374,0.000006981577,0.0001445457,0.00003405875,0.2333876,0.0008572199,0.7624382,0.002790531,0.000012528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1671756,0.001573418,0.792958,0.0007273721,0.0001305846,0.00004483268,0.0001922252,0.0003093696,0.03688857],"genre_scores_gemma":[0.920841,0.001602771,0.06406546,0.0001715198,0.0005579222,0.0001488382,0.0002875053,0.0002399584,0.01208496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004953269,"threshold_uncertainty_score":0.01657033,"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","authors":[{"name":"Francesc Comellas","is_ca":false},{"name":"Hovhannes A. Harutyunyan","is_ca":true},{"name":"Arthur L. Liestman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007469078,0.0004407565,0.0006675444,0.001005261,0.001223635,0.001362234,0.0009549364,0.0007990254,0.003135988],"category_scores_gemma":[0.00675064,0.0004459009,0.0003673412,0.001039984,0.001483093,0.002428157,0.001347115,0.001144377,0.0004438112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899108,"about_ca_system_score_gemma":0.0004247664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003238348,"about_ca_topic_score_gemma":0.003080823,"domain_scores_codex":[0.9994081,0.0001577831,0.000029952,0.0001068543,0.0001466891,0.0001506728],"domain_scores_gemma":[0.9959926,0.0022295,0.0006841143,0.0005377759,0.0003348358,0.0002212521],"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.000265972,0.00002530243,0.001001966,0.0002674709,0.00004714443,0.0003731621,0.000964258,0.32044,0.005360774,0.6468096,0.004448147,0.01999621],"study_design_scores_gemma":[0.00003466758,0.00007339735,0.0004802802,0.00002846322,0.00002580365,0.0002679632,0.0004435711,0.6298231,0.002601148,0.3594985,0.006675667,0.00004742877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.319204,0.002643386,0.6414881,0.0009828067,0.0001613425,0.0001357647,0.0003918891,0.001075215,0.03391742],"genre_scores_gemma":[0.9641258,0.0009448874,0.02848486,0.0001069781,0.00005743358,0.0001291408,0.0001666902,0.0000832353,0.005900868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003238348,"threshold_uncertainty_score":0.01377904,"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","authors":[{"name":"Chenkuan Li","is_ca":true},{"name":"Thomas E. Hart","is_ca":true},{"name":"Kevin Henry","is_ca":true},{"name":"IAN A. NEUFELD","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003699,0.0004248339,0.001154177,0.0006561786,0.001019549,0.001709758,0.001895429,0.001045046,0.004309291],"category_scores_gemma":[0.01969624,0.0006584593,0.0006048944,0.0009828929,0.00185424,0.005617852,0.001562877,0.001208276,0.0005456952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902398,"about_ca_system_score_gemma":0.001100183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002458297,"about_ca_topic_score_gemma":0.002731916,"domain_scores_codex":[0.9974968,0.0005632495,0.0001335324,0.000567089,0.0005709198,0.0006683958],"domain_scores_gemma":[0.9832504,0.01071099,0.001482389,0.002633934,0.00110852,0.0008138012],"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.000763318,0.0001083261,0.006487844,0.0003380407,0.0001095832,0.0004325965,0.0008456956,0.7613236,0.01488228,0.1794494,0.00434086,0.0309183],"study_design_scores_gemma":[0.00003717021,0.0001464201,0.001322895,0.00001637341,0.00003232056,0.0003171307,0.0003239075,0.8458946,0.005534884,0.1441223,0.002214147,0.00003801786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.497724,0.0008304298,0.4867855,0.0007107519,0.00006585066,0.00009458552,0.0004459622,0.0009733178,0.01236956],"genre_scores_gemma":[0.9725686,0.0002787652,0.02445393,0.0001050254,0.00003492811,0.00009329188,0.0001777322,0.0001461231,0.002141722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004309291,"threshold_uncertainty_score":0.01588529,"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","authors":[{"name":"Juan Li","is_ca":true},{"name":"Son T. Vuong","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003586727,0.0003798297,0.0002901338,0.000509422,0.0008918652,0.0007020135,0.001132392,0.0005847814,0.001723075],"category_scores_gemma":[0.0007730798,0.000248002,0.0002226453,0.0008976309,0.0003614694,0.0012601,0.0006802742,0.0006058906,0.0007548591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006025456,"about_ca_system_score_gemma":0.0009911126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002304816,"about_ca_topic_score_gemma":0.003975255,"domain_scores_codex":[0.999699,0.00005639466,0.00001741605,0.00006718237,0.0001361628,0.00002387822],"domain_scores_gemma":[0.9996195,0.00004175746,0.0000261453,0.0001188566,0.0001590119,0.0000347718],"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.0003233679,0.000239427,0.001556243,0.0005470117,0.0001729975,0.0005459834,0.0003738625,0.2611028,0.1302596,0.1843477,0.02854856,0.3919824],"study_design_scores_gemma":[0.00008500236,0.0003819851,0.0009189856,0.00002860444,0.00009146038,0.0005282189,0.000128578,0.8422144,0.03544461,0.0453231,0.0747897,0.00006533624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278178,0.0006898616,0.9511139,0.0005326005,0.0001400276,0.0002618202,0.0001591422,0.003104959,0.0112159],"genre_scores_gemma":[0.341143,0.0007546663,0.6481168,0.000162296,0.0001035608,0.0003196554,0.0005704779,0.0001229338,0.008706645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002304816,"threshold_uncertainty_score":0.005764306,"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","authors":[{"name":"Liang Ma","is_ca":true},{"name":"Mieso K. Denko","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471293,0.0007592823,0.0006451661,0.001296032,0.0003513703,0.0007753847,0.001027539,0.000581028,0.0009410461],"category_scores_gemma":[0.006304648,0.0001203558,0.00024955,0.001663593,0.0002762664,0.001802583,0.0006734144,0.0004648606,0.0002046076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008513161,"about_ca_system_score_gemma":0.0004878044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000629051,"about_ca_topic_score_gemma":0.0009130681,"domain_scores_codex":[0.9983675,0.000650625,0.0001454282,0.0001582087,0.0006121161,0.00006621575],"domain_scores_gemma":[0.998498,0.0005021086,0.0002211018,0.0001402821,0.0005889297,0.00004958148],"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.0004523025,0.0001384759,0.002654529,0.0004368057,0.0001404489,0.0002100542,0.0001029134,0.580089,0.04457346,0.04981168,0.005705881,0.3156843],"study_design_scores_gemma":[0.00001983407,0.000182521,0.0006383717,0.00001190671,0.00002790919,0.0001509653,0.00002018624,0.9798782,0.006945481,0.007460177,0.004639143,0.0000252375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03919786,0.001589183,0.9544995,0.0002540416,0.0002628863,0.0001331033,0.0001596732,0.0005981008,0.00330571],"genre_scores_gemma":[0.703637,0.0008076054,0.2924399,0.0001251005,0.0001738793,0.0002163635,0.0005518626,0.00009445524,0.001953834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001471293,"threshold_uncertainty_score":0.007781029,"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","authors":[{"name":"Samer Samarah","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957246,0.0005403159,0.0007224875,0.00384765,0.0008759879,0.001059683,0.001484104,0.0007017978,0.001204211],"category_scores_gemma":[0.007859119,0.0003157002,0.0009609863,0.005186381,0.0005685989,0.002371526,0.0009606283,0.0009027756,0.0004393462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007047337,"about_ca_system_score_gemma":0.001854722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005371256,"about_ca_topic_score_gemma":0.00868528,"domain_scores_codex":[0.9988557,0.0002117041,0.0001614381,0.0002499017,0.0004209327,0.0001002924],"domain_scores_gemma":[0.9964827,0.001393087,0.0005333499,0.00066333,0.0007607234,0.0001667102],"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.0007907821,0.0005288821,0.02548413,0.001033669,0.0002179056,0.0009909421,0.001502613,0.1043611,0.01921388,0.04841769,0.0153317,0.7821267],"study_design_scores_gemma":[0.00007439723,0.0003341297,0.005979759,0.0001687147,0.0000988525,0.001138528,0.0005987128,0.8875562,0.01004035,0.06872498,0.02520569,0.00007962923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05838423,0.0007341091,0.9315714,0.0005927323,0.0000799576,0.0003453462,0.00524389,0.001552956,0.001495278],"genre_scores_gemma":[0.2231961,0.0008573571,0.7613223,0.0001928743,0.00008452244,0.0006564622,0.01228479,0.0001185268,0.001287012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005371256,"threshold_uncertainty_score":0.01067996,"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","authors":[{"name":"Puspal Bhabak","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818129,0.001497066,0.001474077,0.001088309,0.001079447,0.002054738,0.002761832,0.001746611,0.007892851],"category_scores_gemma":[0.005159565,0.000537101,0.001110345,0.002121246,0.0009311878,0.003349341,0.001403268,0.002339995,0.001691174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003588595,"about_ca_system_score_gemma":0.00362792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008433831,"about_ca_topic_score_gemma":0.008853127,"domain_scores_codex":[0.9986832,0.0002318577,0.00006642278,0.0003349097,0.0002589413,0.0004246692],"domain_scores_gemma":[0.9974395,0.001539518,0.0002352871,0.0003789543,0.00022431,0.0001824318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001971623,0.0009137096,0.003603831,0.0009274821,0.0002402621,0.0003574797,0.0007935665,0.6383487,0.01397823,0.05557393,0.03335742,0.2499338],"study_design_scores_gemma":[0.0002734094,0.0001580079,0.0004982487,0.00003836176,0.00006676318,0.0002706223,0.0001451286,0.9501097,0.002749813,0.04217562,0.003487643,0.00002662884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1171458,0.001486802,0.8538244,0.002447719,0.0002490717,0.0004031206,0.001391981,0.00437485,0.0186762],"genre_scores_gemma":[0.5028754,0.0006711382,0.4839073,0.0004439804,0.0001659646,0.0005030574,0.003028323,0.0006777095,0.007727145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008433831,"threshold_uncertainty_score":0.0264042,"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","authors":[{"name":"Boting Yang","is_ca":true},{"name":"Runtao Zhang","is_ca":true},{"name":"Yi Cao","is_ca":true},{"name":"Farong Zhong","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008018715,0.0003502158,0.0007758673,0.001053141,0.0006781571,0.00130919,0.0009211606,0.0009406242,0.003868764],"category_scores_gemma":[0.00853971,0.0003913791,0.0004391977,0.001193262,0.001007699,0.003930814,0.000727594,0.0006269953,0.0003422326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008988142,"about_ca_system_score_gemma":0.0005674452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006505424,"about_ca_topic_score_gemma":0.001199873,"domain_scores_codex":[0.999386,0.000128258,0.0000442905,0.0001967675,0.0001120202,0.0001327359],"domain_scores_gemma":[0.9957107,0.003086285,0.0005457405,0.0002908582,0.0002089039,0.0001574727],"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.0008106669,0.0001378527,0.004891508,0.0006393094,0.00009827174,0.0004179912,0.0004492239,0.5912712,0.01903535,0.2841132,0.004212979,0.09392239],"study_design_scores_gemma":[0.00008550197,0.000150979,0.001229307,0.00003507886,0.00004792659,0.0004894712,0.0001627199,0.7552752,0.008305637,0.229798,0.004393058,0.0000272489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.54978,0.001213386,0.4355882,0.0008118602,0.00004972108,0.00008208385,0.0004018248,0.0006076668,0.01146527],"genre_scores_gemma":[0.85829,0.0004470609,0.1367342,0.00008073182,0.00003878774,0.0001318897,0.0003952158,0.0001282224,0.00375392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003868764,"threshold_uncertainty_score":0.01294231,"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","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Lata Narayanan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850376,0.001118202,0.001003918,0.0005188756,0.0008107086,0.001213305,0.001230286,0.000893309,0.002883181],"category_scores_gemma":[0.002520838,0.0004347198,0.0005692893,0.0008518785,0.00116569,0.00177128,0.001236362,0.0006727554,0.0006072851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001653582,"about_ca_system_score_gemma":0.001246773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006264126,"about_ca_topic_score_gemma":0.006484917,"domain_scores_codex":[0.9991964,0.0002914917,0.0000268131,0.0001541367,0.0001009987,0.0002302496],"domain_scores_gemma":[0.9987733,0.0005525389,0.000251379,0.0001931081,0.0001021372,0.0001275798],"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.0002333585,0.00004821342,0.0003943117,0.00003593141,0.00001719358,0.00006371835,0.000048474,0.9706463,0.003959643,0.01056613,0.0008360067,0.01315079],"study_design_scores_gemma":[0.0000220351,0.00006573737,0.00007234546,0.000003611913,0.000006083224,0.00002445536,0.00002754826,0.9930452,0.0009985059,0.005050477,0.0006753797,0.00000867071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2510214,0.000572602,0.7299737,0.0009028575,0.0001133239,0.0002610516,0.0002515297,0.001044713,0.0158589],"genre_scores_gemma":[0.8605905,0.0003611651,0.1331011,0.0001625411,0.00002622535,0.0001197751,0.0001930649,0.0001292537,0.005316434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006264126,"threshold_uncertainty_score":0.01245534,"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","authors":[{"name":"Qusay H. Mahmoud","is_ca":true},{"name":"Mosaab Daoud","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323944,0.0009551097,0.0007978239,0.001307259,0.0004584827,0.0009552808,0.001109221,0.0007030549,0.0007770672],"category_scores_gemma":[0.009010277,0.0005497152,0.0006051926,0.000859337,0.0008812836,0.001370769,0.0006674973,0.0009633476,0.0002345474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001165885,"about_ca_system_score_gemma":0.0009455727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003244949,"about_ca_topic_score_gemma":0.001439324,"domain_scores_codex":[0.9989783,0.0004030872,0.00003701037,0.00008774456,0.000408675,0.00008518334],"domain_scores_gemma":[0.9972581,0.001790477,0.0003386153,0.0001326421,0.0004331915,0.00004703028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001127053,0.00001397314,0.0002968323,0.00005808156,0.00001852836,0.00006994183,0.00006380946,0.965193,0.001756998,0.02235834,0.0002806693,0.009878621],"study_design_scores_gemma":[9.894372e-7,0.00000766024,0.00005326036,0.000007161535,0.000004912658,0.00001685887,0.000008979906,0.9932769,0.0003338676,0.005923716,0.0003617605,0.000003945095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007545764,0.0006621784,0.9899688,0.000147552,0.0000220299,0.00002203864,0.00001934972,0.0001292227,0.001483005],"genre_scores_gemma":[0.8332354,0.0028148,0.1610491,0.00008846005,0.0001828254,0.0001850465,0.00008200559,0.00009194567,0.002270377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003244949,"threshold_uncertainty_score":0.008459091,"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","authors":[{"name":"Elhadi Shakshuki","is_ca":true},{"name":"S. Abu-Draz","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001791693,0.001196609,0.001174995,0.001078323,0.001469649,0.004348798,0.002650565,0.003491599,0.007743459],"category_scores_gemma":[0.004229886,0.0005771492,0.0008414095,0.001934255,0.003079172,0.003822813,0.003412748,0.003955274,0.002249974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045084,"about_ca_system_score_gemma":0.001861599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003041991,"about_ca_topic_score_gemma":0.00253967,"domain_scores_codex":[0.9975877,0.001236168,0.0001765081,0.0003118078,0.000542042,0.0001458173],"domain_scores_gemma":[0.99864,0.0005475729,0.0001017082,0.0001967126,0.000380725,0.0001333893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005382195,0.00008186395,0.0004054649,0.0006642116,0.0001087379,0.0005566122,0.0009338984,0.04963771,0.002093561,0.8719311,0.01227551,0.06125745],"study_design_scores_gemma":[0.00008786786,0.0001255089,0.0002596893,0.0003251764,0.00007963313,0.000509401,0.0003695576,0.2234968,0.001758671,0.4719854,0.3009476,0.0000546831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002558149,0.006891546,0.958223,0.002587884,0.001033737,0.0002875287,0.00005534831,0.001293083,0.02706966],"genre_scores_gemma":[0.2049325,0.01098587,0.7447551,0.002762954,0.001346512,0.00129349,0.0003345708,0.0003672683,0.03322181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007743459,"threshold_uncertainty_score":0.02590442,"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","authors":[{"name":"Sk. Md. Mizanur Rahman","is_ca":true},{"name":"Khalil El‐Khatib","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002120466,0.0004382793,0.0007489998,0.0007275732,0.001382612,0.0013022,0.0006702362,0.000895995,0.00118844],"category_scores_gemma":[0.003992847,0.0002919376,0.0006607427,0.000977661,0.001749269,0.00308723,0.002620457,0.001311298,0.0004555465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005642647,"about_ca_system_score_gemma":0.001031071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001715799,"about_ca_topic_score_gemma":0.0001286173,"domain_scores_codex":[0.9970401,0.001297971,0.0002110005,0.0002403695,0.001046419,0.0001642108],"domain_scores_gemma":[0.9977199,0.0009103552,0.0003818601,0.0006011588,0.0002826173,0.0001039675],"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.0005889045,0.0001855799,0.0011949,0.0004281143,0.0001044751,0.001138416,0.001293462,0.1138156,0.03822238,0.710586,0.003179419,0.1292628],"study_design_scores_gemma":[0.0001866677,0.0007922084,0.000533685,0.0001243076,0.00009610432,0.001858127,0.0003418331,0.5427291,0.03764904,0.3711898,0.04431868,0.0001804785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03437393,0.0006410104,0.958931,0.0004040427,0.0001276183,0.0002210307,0.00003903921,0.0003826348,0.004879536],"genre_scores_gemma":[0.8041339,0.001487847,0.1885668,0.0001729238,0.0001985486,0.00052423,0.0001258798,0.00007460982,0.004715323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002120466,"threshold_uncertainty_score":0.0112142,"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","authors":[{"name":"Abdulmotaleb El Saddik","is_ca":true},{"name":"Deyang Liu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899566,0.000798918,0.001009903,0.001860257,0.0008011509,0.00141533,0.00141898,0.000889325,0.001938153],"category_scores_gemma":[0.004922676,0.0003914232,0.0005416016,0.001477677,0.0006159483,0.001496767,0.001065295,0.0008433098,0.0005003578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001475639,"about_ca_system_score_gemma":0.001048193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003274845,"about_ca_topic_score_gemma":0.002525468,"domain_scores_codex":[0.9986503,0.0003283306,0.0000976462,0.0001662701,0.0006155448,0.0001419884],"domain_scores_gemma":[0.9977261,0.00124047,0.0001663807,0.0001314955,0.0006093055,0.0001261267],"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.0005185254,0.0001943979,0.002054374,0.0001530174,0.00009563787,0.0001563283,0.0002497342,0.50486,0.01117003,0.06177485,0.004949845,0.4138232],"study_design_scores_gemma":[0.0000313845,0.00002208514,0.0001358817,0.00000469554,0.000008907374,0.00002583407,0.00001766254,0.9893555,0.001290992,0.008239668,0.0008593648,0.00000799322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01573871,0.0002546314,0.9822051,0.0001352909,0.00003592487,0.00006892864,0.00002624097,0.0004832673,0.001051988],"genre_scores_gemma":[0.3546478,0.000321189,0.6416072,0.0001254759,0.000114221,0.0002893424,0.0002185301,0.0001789431,0.002497288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003274845,"threshold_uncertainty_score":0.01070648,"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","authors":[{"name":"Sajid Hussain","is_ca":true},{"name":"MD ASHIQUR RAHMAN","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001571625,0.0004790606,0.0006089064,0.001271838,0.000438187,0.0008562274,0.0006093967,0.0005724001,0.0009447158],"category_scores_gemma":[0.0114341,0.0003029272,0.0005146533,0.001284139,0.0008252698,0.001832405,0.0009613682,0.0005794347,0.0001937877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007862212,"about_ca_system_score_gemma":0.0003740042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005937365,"about_ca_topic_score_gemma":0.0004547872,"domain_scores_codex":[0.998701,0.0004940812,0.00008919248,0.0001663923,0.0004621977,0.00008715659],"domain_scores_gemma":[0.9966863,0.00223541,0.0003666619,0.0003370839,0.0003302572,0.00004421802],"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.0002582687,0.0000902157,0.002084336,0.0005106201,0.00008659865,0.0003116026,0.0006904154,0.5648216,0.05729841,0.1885451,0.002570295,0.1827326],"study_design_scores_gemma":[0.00002061772,0.00008949772,0.0006449015,0.00002421748,0.00002442274,0.0001586826,0.00004997257,0.9524696,0.008024978,0.03567031,0.002808882,0.00001390482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03045595,0.0009963696,0.9657617,0.0002678067,0.00002433324,0.00005198126,0.00003768249,0.000167017,0.00223717],"genre_scores_gemma":[0.8497461,0.001955947,0.1446209,0.0001404613,0.0001532752,0.0003069588,0.0001316395,0.0001641018,0.002780651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001571625,"threshold_uncertainty_score":0.008311629,"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","authors":[{"name":"Elie El Ajaltouni","is_ca":true},{"name":"Ming Zhang","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true},{"name":"Robson E. De Grande","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007659114,0.0003194822,0.0003481471,0.0003750887,0.0005012092,0.0005532667,0.0009982069,0.0003768415,0.001042297],"category_scores_gemma":[0.001469477,0.000238385,0.0003300678,0.0003838128,0.0004646863,0.0007503394,0.001000024,0.0007945308,0.0002882764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004194001,"about_ca_system_score_gemma":0.0005319174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001351418,"about_ca_topic_score_gemma":0.002187217,"domain_scores_codex":[0.9995944,0.0001191205,0.00002540773,0.00006526404,0.0001631867,0.00003277651],"domain_scores_gemma":[0.9995479,0.0001258493,0.00005176592,0.000139852,0.0000976477,0.00003705341],"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.0002779233,0.000164444,0.002302935,0.0001053674,0.0000787219,0.0002524637,0.0004865915,0.5956988,0.07977512,0.05398956,0.003253798,0.2636142],"study_design_scores_gemma":[0.00001841214,0.00002482416,0.0001074449,0.000002453987,0.000006163718,0.00003211287,0.00001677228,0.9892132,0.004682387,0.003966995,0.001923949,0.000005352017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01011532,0.00002464707,0.9879358,0.00006707242,0.00001454786,0.00003678533,0.00001007589,0.0009385285,0.000857287],"genre_scores_gemma":[0.5884966,0.00006442691,0.409105,0.00005801074,0.00002528172,0.000130325,0.00009444304,0.000164315,0.001861787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001351418,"threshold_uncertainty_score":0.004050553,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Christos Kaklamanis","is_ca":false},{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"David Peleg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006716691,0.0007559828,0.0008040024,0.001098816,0.0006525381,0.001671436,0.001542524,0.001306318,0.006752865],"category_scores_gemma":[0.005959995,0.0008643211,0.0006586833,0.002325922,0.0006744309,0.002105137,0.001445948,0.0006875811,0.001030817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008369041,"about_ca_system_score_gemma":0.0007478587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003936204,"about_ca_topic_score_gemma":0.006075181,"domain_scores_codex":[0.9994879,0.0001468096,0.00003066591,0.0001212885,0.0001160014,0.00009737365],"domain_scores_gemma":[0.9978651,0.001269001,0.0003164945,0.0002470698,0.0001763552,0.0001259133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000117529,0.00003325125,0.001650288,0.0001008039,0.00002609682,0.0002655379,0.0001097582,0.9371604,0.001373671,0.03007013,0.002508533,0.02658394],"study_design_scores_gemma":[0.00004474412,0.00004299989,0.0003377841,0.00001474309,0.00001669168,0.000109588,0.0001023432,0.9524035,0.001025824,0.04130211,0.004581035,0.00001866864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09950218,0.0003508434,0.8907777,0.0002581356,0.00004801078,0.00009260712,0.001307025,0.001216972,0.006446633],"genre_scores_gemma":[0.5099443,0.0006538664,0.4791142,0.00007573448,0.00007013364,0.0001573056,0.002647922,0.0002735563,0.007062933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006752865,"threshold_uncertainty_score":0.02259064,"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","authors":[{"name":"Mohammad Mursalin Akon","is_ca":true},{"name":"Dhrubajyoti Goswami","is_ca":true},{"name":"Hon Fung Li","is_ca":true},{"name":"Xuemin Shen","is_ca":true},{"name":"Ajit Singh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003788811,0.0003675818,0.0003088029,0.0004025969,0.0005894748,0.001068614,0.001206144,0.0006304967,0.00314089],"category_scores_gemma":[0.001481758,0.0003439722,0.0004899626,0.0005774284,0.0009914251,0.001896517,0.001345567,0.001142328,0.0009341358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003849001,"about_ca_system_score_gemma":0.0008067187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005609489,"about_ca_topic_score_gemma":0.000618635,"domain_scores_codex":[0.9993982,0.0001319889,0.00003191704,0.0001061251,0.0002825516,0.00004915306],"domain_scores_gemma":[0.9994905,0.0001094276,0.00004191851,0.0001865667,0.0001262394,0.00004528942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002175021,0.0001304246,0.001616849,0.0004006073,0.0000667936,0.0007555449,0.0005929096,0.1029731,0.05934781,0.6756846,0.01265066,0.1455631],"study_design_scores_gemma":[0.00009598252,0.0002526122,0.0005690728,0.0000531021,0.00004298978,0.000874233,0.00007550844,0.6321929,0.03200785,0.175876,0.1579172,0.00004257492],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.02198376,0.0002604387,0.9612819,0.0003603057,0.0001965782,0.00006255596,0.00009653975,0.00275575,0.01300224],"genre_scores_gemma":[0.3098741,0.0004377478,0.6766403,0.0002296044,0.00009633281,0.0003158155,0.0003413896,0.0004236241,0.01164103],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.00314089,"threshold_uncertainty_score":0.01050735,"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","authors":[{"name":"Yansheng Qu","is_ca":false},{"name":"Junzhou Luo","is_ca":false},{"name":"Peng Wang","is_ca":false},{"name":"Laurence T. Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001580721,0.0005489559,0.0006734196,0.000738651,0.0008543973,0.001524176,0.001821357,0.000930016,0.002274462],"category_scores_gemma":[0.002947792,0.0003042491,0.0004472425,0.0005946032,0.001954047,0.003110676,0.002093212,0.001870262,0.000381061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008497305,"about_ca_system_score_gemma":0.0007650115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006559457,"about_ca_topic_score_gemma":0.0005074972,"domain_scores_codex":[0.9988147,0.0002170689,0.00006514402,0.0002505248,0.0005264826,0.0001260724],"domain_scores_gemma":[0.9982754,0.0004011043,0.0001754432,0.0005746307,0.0003954635,0.0001780443],"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.0005992604,0.0001826318,0.001062845,0.0001530758,0.00006660125,0.0004450527,0.0005334051,0.1440524,0.05514152,0.6545818,0.003776337,0.1394052],"study_design_scores_gemma":[0.00008297944,0.0004707107,0.0005453955,0.00005228848,0.00004815125,0.0005942868,0.00009892007,0.7929698,0.01518978,0.1673694,0.02250515,0.00007319775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05749486,0.001393056,0.9124469,0.0004737855,0.0003332382,0.0001231537,0.00005923593,0.0008308695,0.02684483],"genre_scores_gemma":[0.8505834,0.00104221,0.1391467,0.0003789001,0.0004398413,0.0001856683,0.00006426543,0.0001145393,0.008044482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002274462,"threshold_uncertainty_score":0.00835973,"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","authors":[{"name":"Alejandro Juan","is_ca":true},{"name":"Richard W. Pazzi","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948646,0.000478828,0.0006506785,0.0008705046,0.0004693334,0.0009968631,0.001205552,0.0008667079,0.001017219],"category_scores_gemma":[0.008289219,0.0002898788,0.0003900208,0.0005518823,0.0007242444,0.001256408,0.0008130814,0.0009862111,0.0003094276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085627,"about_ca_system_score_gemma":0.0006499218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003364385,"about_ca_topic_score_gemma":0.00254599,"domain_scores_codex":[0.9986944,0.0003809633,0.0001176754,0.0002513712,0.000456322,0.0000993951],"domain_scores_gemma":[0.9958988,0.001961714,0.0005200016,0.000557392,0.0009466487,0.0001154457],"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.0001260713,0.0002427664,0.007131473,0.00007104869,0.00007598345,0.0001370492,0.0002968003,0.6832296,0.01588053,0.01126917,0.0008890625,0.2806504],"study_design_scores_gemma":[0.000004801603,0.00004611194,0.0004013864,0.000003867243,0.000008228981,0.00002381889,0.000009404319,0.993183,0.003519495,0.002337465,0.000455026,0.000007504136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07320157,0.0001020081,0.9233345,0.0001508076,0.00003862953,0.0001255518,0.0000316131,0.001058945,0.001956483],"genre_scores_gemma":[0.7347915,0.00007994925,0.2634586,0.00008188767,0.0000249091,0.0001695563,0.00007746376,0.00007598387,0.001240204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003364385,"threshold_uncertainty_score":0.01030552,"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","authors":[{"name":"Qusay H. Mahmoud","is_ca":true},{"name":"Wassam Zahreddine","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006313225,0.001230011,0.001220878,0.002249885,0.002518114,0.004632217,0.003879767,0.002747707,0.003641752],"category_scores_gemma":[0.004692309,0.001622359,0.002809671,0.001657621,0.003868039,0.004213599,0.004346478,0.004286563,0.002011954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002459481,"about_ca_system_score_gemma":0.004462235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01052783,"about_ca_topic_score_gemma":0.009862999,"domain_scores_codex":[0.9961239,0.0009674813,0.0005143334,0.0005739377,0.001518814,0.0003017011],"domain_scores_gemma":[0.9984953,0.0003941934,0.0001220068,0.0004321452,0.0002854122,0.000270889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008141872,0.0001064799,0.0003014981,0.0003273833,0.00009540616,0.000690315,0.001003029,0.04623784,0.009205341,0.8283004,0.009144577,0.1045064],"study_design_scores_gemma":[0.0001323053,0.0001425983,0.0002121503,0.000367743,0.000119167,0.0009670583,0.0002182333,0.286031,0.007136922,0.3221188,0.3823912,0.0001628729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007137008,0.0002653833,0.9926911,0.0002453129,0.00008627017,0.0002250748,0.000047316,0.002696635,0.00302924],"genre_scores_gemma":[0.02185804,0.0004981199,0.973033,0.0001218151,0.00006917572,0.000470967,0.0002363959,0.0002624937,0.003449979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01052783,"threshold_uncertainty_score":0.0333879,"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","authors":[{"name":"Jelena Mišić","is_ca":true},{"name":"Vojislav B. Mišić","is_ca":true},{"name":"Carol Fung","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005667076,0.0006898409,0.0008746798,0.0008686172,0.00100678,0.001932926,0.001640557,0.001008598,0.001497563],"category_scores_gemma":[0.0128185,0.0006545656,0.0004982578,0.0006962898,0.002233991,0.003480003,0.001033668,0.0009358788,0.0001749921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003830349,"about_ca_system_score_gemma":0.002049042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005568937,"about_ca_topic_score_gemma":0.003325673,"domain_scores_codex":[0.998219,0.0007057397,0.00005665742,0.000183731,0.0004573154,0.000377627],"domain_scores_gemma":[0.991789,0.005529818,0.0009982791,0.0004258511,0.001049087,0.0002079234],"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.0002616346,0.00008889353,0.001377013,0.00006694268,0.00006924468,0.0001633347,0.0003356596,0.8471069,0.00493029,0.1383032,0.001127716,0.006169049],"study_design_scores_gemma":[0.00001271469,0.00004445644,0.0001849926,0.000004158022,0.00001500482,0.00001948845,0.00003845551,0.988185,0.0004984633,0.01081628,0.0001707188,0.00001023399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3312502,0.0006915769,0.6622461,0.0006051369,0.00007548588,0.0001070304,0.00007241429,0.0003156953,0.004636349],"genre_scores_gemma":[0.9822222,0.0002556769,0.01606692,0.00005199109,0.00003929617,0.00006425874,0.00003182267,0.00003788786,0.001229871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005667076,"threshold_uncertainty_score":0.02997071,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522572,0.000602746,0.0007080599,0.001067691,0.0008037534,0.001584377,0.001752265,0.0008340529,0.006422699],"category_scores_gemma":[0.004287567,0.000377218,0.0005471929,0.002217619,0.0009532614,0.004557204,0.002281119,0.0007930294,0.001579283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009644088,"about_ca_system_score_gemma":0.0009930577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001983057,"about_ca_topic_score_gemma":0.003707526,"domain_scores_codex":[0.9990023,0.0002547147,0.00007346564,0.0001890402,0.0003266779,0.0001538628],"domain_scores_gemma":[0.9983468,0.0007882256,0.0001435008,0.0004834289,0.0001838096,0.00005425484],"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.000544052,0.0001553912,0.00172677,0.0005188152,0.00004704697,0.0003828149,0.0004795351,0.2881285,0.01690495,0.2395303,0.009899387,0.4416824],"study_design_scores_gemma":[0.00006227304,0.000119153,0.0003189802,0.00004982884,0.00002071422,0.0003782139,0.0002374631,0.7591981,0.01176916,0.2091518,0.01866081,0.00003349867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02883403,0.0002016451,0.9624093,0.0002133102,0.00003682203,0.00006138085,0.0002091171,0.002259864,0.005774571],"genre_scores_gemma":[0.2102448,0.0002536141,0.784492,0.00007681468,0.00001978571,0.0001607882,0.0009764476,0.0002658073,0.003509945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006422699,"threshold_uncertainty_score":0.02148604,"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","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Ján Maňuch","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005764653,0.0005874441,0.0004048107,0.0007923696,0.0004787853,0.001076675,0.0007929697,0.0005776765,0.005632861],"category_scores_gemma":[0.002155111,0.000257847,0.0005558205,0.001371318,0.0008160811,0.003658125,0.001472027,0.001319404,0.001561553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004093432,"about_ca_system_score_gemma":0.0003094489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002843498,"about_ca_topic_score_gemma":0.0005034661,"domain_scores_codex":[0.9995492,0.0001378833,0.00004152151,0.0001029191,0.0001221206,0.00004636752],"domain_scores_gemma":[0.9991462,0.0003428249,0.0001114896,0.0002165483,0.0001114239,0.00007158384],"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.00009562416,0.00004892685,0.0003654618,0.0002443973,0.00003352076,0.0001347694,0.0001584302,0.06820662,0.007410961,0.7990263,0.004666487,0.1196085],"study_design_scores_gemma":[0.00001561973,0.0001087814,0.0001599837,0.0000213873,0.000007997386,0.0002304007,0.00004713463,0.1725514,0.001659125,0.8102813,0.01490404,0.00001293253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01740261,0.0009409765,0.9761816,0.0002960307,0.0001565842,0.00007178106,0.0001491321,0.0003914282,0.004409844],"genre_scores_gemma":[0.2815276,0.002238785,0.7068515,0.0003374688,0.0004798688,0.0003136288,0.0006097349,0.0001700875,0.007471401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005632861,"threshold_uncertainty_score":0.01884377,"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","authors":[{"name":"Ekram Hossain","is_ca":true},{"name":"Vijay K. Bhargava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007622543,0.0004000243,0.0004222544,0.0003539027,0.000358632,0.0005227599,0.0006058756,0.0002784679,0.000313737],"category_scores_gemma":[0.002054369,0.0002012045,0.000158655,0.0004822886,0.0004536121,0.0004917556,0.0003245481,0.0003230621,0.00005893595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007877894,"about_ca_system_score_gemma":0.0008215021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002837992,"about_ca_topic_score_gemma":0.003387738,"domain_scores_codex":[0.9997039,0.00009848169,0.000007803284,0.00002824973,0.0001125132,0.00004908198],"domain_scores_gemma":[0.9990762,0.0005494072,0.0001392671,0.00006150811,0.0001251102,0.00004859269],"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.0001601526,0.00008970979,0.0009636694,0.00004606446,0.00002105389,0.00005761991,0.00004021954,0.9365435,0.01513908,0.004936345,0.0003257679,0.04167686],"study_design_scores_gemma":[0.000004584129,0.00004107136,0.0001507631,0.000001158192,0.000004979633,0.000009437075,0.000004317831,0.9982004,0.001129984,0.000396125,0.00005457587,0.000002677941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3563964,0.001116707,0.6396831,0.0001569562,0.00006775316,0.00005140134,0.00003338764,0.0003790836,0.002115208],"genre_scores_gemma":[0.9889095,0.0001383654,0.0107302,0.00001216157,0.00002051572,0.00001205062,0.00001204909,0.000008456077,0.0001566958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002837992,"threshold_uncertainty_score":0.005715847,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"László Lipták","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004967435,0.0008393252,0.0004980408,0.0007984678,0.001195076,0.001331369,0.0008365151,0.0007120588,0.006915342],"category_scores_gemma":[0.003333699,0.0002218837,0.0008364422,0.001238952,0.001312771,0.003178929,0.0008416244,0.003743939,0.001476396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007538775,"about_ca_system_score_gemma":0.0004158948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002448236,"about_ca_topic_score_gemma":0.002268567,"domain_scores_codex":[0.9996647,0.00009216106,0.00002186288,0.00007218312,0.0001197081,0.00002946515],"domain_scores_gemma":[0.9979962,0.001427342,0.00008709094,0.0001575702,0.0002375899,0.00009423684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002542615,0.0001074065,0.001208334,0.0006354756,0.00007204574,0.001770374,0.0003727963,0.02071841,0.01172606,0.6201748,0.2257344,0.1172257],"study_design_scores_gemma":[0.00002172327,0.000197097,0.001715683,0.0001226279,0.00005929744,0.000583657,0.0001319597,0.02571293,0.0027748,0.7621956,0.2064292,0.0000553073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06322236,0.04839405,0.4425821,0.07550683,0.116732,0.0001341215,0.00146751,0.001204409,0.2507566],"genre_scores_gemma":[0.5376925,0.05398468,0.1225229,0.01931072,0.1112569,0.0001899884,0.0009041923,0.001016955,0.1531211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006915342,"threshold_uncertainty_score":0.02313411,"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","authors":[{"name":"Krzysztof Diks","is_ca":false},{"name":"Stefan Dobrev","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391343,0.000619366,0.0004158062,0.0005663062,0.000424325,0.0006748931,0.0007402308,0.000457535,0.002295172],"category_scores_gemma":[0.002040416,0.0003187532,0.0004863831,0.00104745,0.0004801482,0.002089401,0.001374886,0.0005413551,0.000351474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005461841,"about_ca_system_score_gemma":0.0006019825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002362136,"about_ca_topic_score_gemma":0.003163392,"domain_scores_codex":[0.9997117,0.00009075632,0.00001148564,0.00006278962,0.00007597539,0.00004732004],"domain_scores_gemma":[0.9989588,0.0007131855,0.0001057219,0.0001216196,0.0000578651,0.00004269477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002298328,0.0000443779,0.0009843879,0.0002099822,0.00003472333,0.0002621436,0.0001492581,0.8771756,0.007639628,0.02398805,0.002134834,0.08714726],"study_design_scores_gemma":[0.00002794457,0.00005483631,0.0004256713,0.00001672517,0.00001387083,0.0001198235,0.00009126568,0.9448094,0.003502634,0.04794841,0.002976722,0.00001252878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2366655,0.0006284348,0.747477,0.0006592897,0.00003685614,0.00009970109,0.000333978,0.002000236,0.01209903],"genre_scores_gemma":[0.6809962,0.001066871,0.3131185,0.000102244,0.00002654621,0.0001127937,0.0007189607,0.0001822117,0.003675754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002362136,"threshold_uncertainty_score":0.007678092,"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","authors":[{"name":"Jean‐Claude Bermond","is_ca":false},{"name":"Susan Marshall","is_ca":false},{"name":"Min‐Li Yu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003924779,0.002173606,0.001586239,0.003126486,0.001207642,0.002966083,0.002850513,0.00141284,0.007564873],"category_scores_gemma":[0.01942695,0.0008600951,0.001372968,0.002466399,0.001835216,0.007855227,0.003331141,0.004911643,0.001759165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003201489,"about_ca_system_score_gemma":0.001182993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002100734,"about_ca_topic_score_gemma":0.002618527,"domain_scores_codex":[0.9974612,0.0005723959,0.0001594955,0.0003401822,0.0009127898,0.0005538457],"domain_scores_gemma":[0.9854537,0.009739397,0.000841648,0.001567694,0.001794408,0.0006031098],"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.0009427209,0.0001643931,0.001126118,0.001003095,0.000199371,0.000369682,0.0006308018,0.5072105,0.0187018,0.379538,0.01660314,0.07351046],"study_design_scores_gemma":[0.00003705573,0.0001174007,0.000434046,0.0001185623,0.00008784312,0.0001097248,0.00008792275,0.7659207,0.004083564,0.2219123,0.007038299,0.00005252506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05117124,0.01307057,0.8907277,0.002168991,0.0006747862,0.0001281862,0.0008160488,0.001889469,0.03935311],"genre_scores_gemma":[0.7496185,0.008957163,0.2242181,0.0007188774,0.001277804,0.0006862039,0.001251535,0.001143562,0.01212833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007564873,"threshold_uncertainty_score":0.025307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}