{"meta":{"query_hash":"fd3f21ff3be2","filters":{"venue":"Journal of Interconnection Networks"},"cohort_total":34,"direct_labels_cover":0,"predictions_cover":34,"exported":34,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/fd3f21ff3be2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Interconnection+Networks"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016686749516997685,"score_gpt":0.20751880320389918,"score_spread":0.19083205368690148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964071270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5439432,0.0044185463,0.36756542,0.0028517423,0.00018813676,0.00015309376,0.0009670787,0.00020654348,0.07970611],"genre_scores_gemma":[0.91417176,0.004311844,0.07220067,0.0005670826,0.00053244317,0.00030749422,0.0009475619,0.00016065095,0.006800444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876714,0.00041814402,0.00008058188,0.00019661571,0.00038105063,0.00015651908],"domain_scores_gemma":[0.9896075,0.007698894,0.0012004715,0.000553733,0.00067332777,0.000266032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348165,0.0006182919,0.00082464796,0.0015726059,0.0012963315,0.0030041928,0.0011357081,0.0007959609,0.003305029],"category_scores_gemma":[0.012185693,0.0005139163,0.00063284795,0.0036170133,0.0032440834,0.00538574,0.0015032601,0.0014236179,0.0004909718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019312794,0.0000736362,0.0029684233,0.00022681673,0.00003660235,0.0003821615,0.00046269465,0.21920015,0.0038721152,0.7237301,0.0042095794,0.044644535],"study_design_scores_gemma":[0.00003329508,0.00009489899,0.0015036266,0.000051258357,0.000020636335,0.0007289865,0.00033105348,0.252595,0.001930114,0.73606014,0.006612939,0.000038020044],"about_ca_topic_score_codex":0.0017696593,"about_ca_topic_score_gemma":0.0012837376,"teacher_disagreement_score":0.003305029,"about_ca_system_score_codex":0.0011387184,"about_ca_system_score_gemma":0.000642323,"threshold_uncertainty_score":0.011056364},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01081509108304547,"score_gpt":0.25244958032924825,"score_spread":0.2416344892462028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967637888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017402606,0.00094097655,0.9761816,0.0002960307,0.00015658418,0.00007178106,0.00014913209,0.00039142816,0.0044098436],"genre_scores_gemma":[0.28152758,0.0022387851,0.7068515,0.00033746875,0.0004798688,0.00031362884,0.00060973485,0.00017008746,0.0074714012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995492,0.00013788331,0.000041521507,0.000102919126,0.00012212056,0.000046367524],"domain_scores_gemma":[0.9991462,0.00034282487,0.00011148958,0.00021654826,0.00011142389,0.00007158384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057646533,0.0005874441,0.00040481074,0.0007923696,0.00047878534,0.0010766755,0.00079296966,0.00057767646,0.0056328606],"category_scores_gemma":[0.0021551114,0.00025784704,0.0005558205,0.0013713177,0.0008160811,0.0036581252,0.0014720269,0.0013194035,0.001561553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009562416,0.000048926846,0.00036546183,0.00024439732,0.000033520755,0.00013476939,0.00015843018,0.068206616,0.0074109607,0.7990263,0.0046664868,0.11960846],"study_design_scores_gemma":[0.000015619731,0.00010878141,0.00015998373,0.0000213873,0.000007997386,0.00023040074,0.000047134632,0.17255141,0.001659125,0.8102813,0.014904045,0.000012932527],"about_ca_topic_score_codex":0.0002843498,"about_ca_topic_score_gemma":0.0005034661,"teacher_disagreement_score":0.0056328606,"about_ca_system_score_codex":0.00040934322,"about_ca_system_score_gemma":0.0003094489,"threshold_uncertainty_score":0.01884377},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022989138321411567,"score_gpt":0.22900563889527023,"score_spread":0.20601650057385867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973666239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49772397,0.00083042984,0.48678547,0.00071075186,0.00006585066,0.00009458552,0.00044596219,0.00097331783,0.012369558],"genre_scores_gemma":[0.9725686,0.00027876525,0.02445393,0.00010502542,0.000034928114,0.00009329188,0.00017773216,0.00014612307,0.0021417225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974968,0.0005632495,0.00013353238,0.00056708895,0.0005709198,0.00066839583],"domain_scores_gemma":[0.98325044,0.010710992,0.0014823893,0.0026339341,0.00110852,0.00081380125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003699,0.00042483394,0.0011541767,0.0006561786,0.001019549,0.001709758,0.0018954293,0.0010450458,0.0043092915],"category_scores_gemma":[0.019696236,0.00065845926,0.00060489436,0.0009828929,0.0018542398,0.005617852,0.0015628767,0.0012082757,0.0005456952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076331804,0.000108326065,0.006487844,0.0003380407,0.00010958322,0.00043259654,0.00084569555,0.76132363,0.014882281,0.17944944,0.00434086,0.030918304],"study_design_scores_gemma":[0.000037170208,0.00014642015,0.0013228948,0.000016373408,0.00003232056,0.0003171307,0.0003239075,0.8458946,0.0055348836,0.14412226,0.0022141475,0.000038017864],"about_ca_topic_score_codex":0.0024582972,"about_ca_topic_score_gemma":0.0027319163,"teacher_disagreement_score":0.0043092915,"about_ca_system_score_codex":0.0019023981,"about_ca_system_score_gemma":0.0011001832,"threshold_uncertainty_score":0.015885293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009221525002629552,"score_gpt":0.269522023443353,"score_spread":0.26030049844072345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985317738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010115317,0.00002464707,0.9879358,0.00006707242,0.000014547862,0.00003678533,0.000010075894,0.0009385285,0.00085728697],"genre_scores_gemma":[0.58849657,0.00006442691,0.40910497,0.000058010744,0.000025281724,0.00013032503,0.000094443036,0.00016431496,0.0018617867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00011912049,0.000025407728,0.000065264045,0.00016318666,0.00003277651],"domain_scores_gemma":[0.9995479,0.00012584933,0.000051765925,0.000139852,0.0000976477,0.000037053414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076591136,0.00031948218,0.0003481471,0.0003750887,0.0005012092,0.0005532667,0.0009982069,0.00037684155,0.0010422971],"category_scores_gemma":[0.0014694773,0.00023838504,0.00033006776,0.00038381282,0.00046468628,0.00075033936,0.0010000236,0.00079453085,0.00028827644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027792333,0.00016444396,0.0023029353,0.000105367355,0.000078721896,0.0002524637,0.00048659148,0.59569883,0.079775125,0.05398956,0.0032537978,0.2636142],"study_design_scores_gemma":[0.000018412138,0.000024824156,0.00010744495,0.000002453987,0.0000061637184,0.00003211287,0.000016772277,0.98921317,0.0046823868,0.0039669946,0.001923949,0.0000053520166],"about_ca_topic_score_codex":0.0013514175,"about_ca_topic_score_gemma":0.0021872167,"teacher_disagreement_score":0.0013514175,"about_ca_system_score_codex":0.0004194001,"about_ca_system_score_gemma":0.0005319174,"threshold_uncertainty_score":0.004050553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011940612037317232,"score_gpt":0.2341054699327961,"score_spread":0.22216485789547888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992656560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.319204,0.0026433864,0.64148813,0.0009828067,0.00016134251,0.00013576468,0.0003918891,0.0010752153,0.033917423],"genre_scores_gemma":[0.9641258,0.0009448874,0.028484862,0.0001069781,0.000057433583,0.00012914081,0.00016669022,0.000083235296,0.0059008677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994081,0.00015778307,0.000029952002,0.00010685435,0.00014668911,0.00015067284],"domain_scores_gemma":[0.9959926,0.0022294996,0.0006841143,0.0005377759,0.00033483582,0.00022125208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074690784,0.00044075647,0.00066754443,0.0010052612,0.0012236347,0.0013622345,0.0009549364,0.00079902535,0.0031359878],"category_scores_gemma":[0.0067506405,0.00044590092,0.00036734118,0.001039984,0.0014830931,0.0024281566,0.0013471151,0.0011443774,0.00044381118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026597196,0.000025302428,0.0010019658,0.00026747092,0.00004714443,0.0003731621,0.00096425804,0.32044,0.0053607738,0.6468096,0.004448147,0.019996211],"study_design_scores_gemma":[0.000034667577,0.00007339735,0.0004802802,0.00002846322,0.000025803649,0.00026796325,0.00044357107,0.6298231,0.0026011476,0.35949847,0.0066756667,0.00004742877],"about_ca_topic_score_codex":0.0032383478,"about_ca_topic_score_gemma":0.0030808232,"teacher_disagreement_score":0.0032383478,"about_ca_system_score_codex":0.0018991078,"about_ca_system_score_gemma":0.00042476636,"threshold_uncertainty_score":0.013779044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06915790782859202,"score_gpt":0.2541455881890506,"score_spread":0.18498768036045857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993964758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23666552,0.0006284348,0.747477,0.0006592897,0.000036856138,0.00009970109,0.00033397798,0.0020002364,0.01209903],"genre_scores_gemma":[0.6809962,0.0010668705,0.31311855,0.00010224404,0.000026546213,0.00011279369,0.0007189607,0.00018221166,0.0036757537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997117,0.000090756315,0.00001148564,0.00006278962,0.00007597539,0.00004732004],"domain_scores_gemma":[0.9989588,0.0007131855,0.000105721876,0.000121619574,0.000057865098,0.00004269477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023913426,0.00061936595,0.0004158062,0.00056630623,0.000424325,0.00067489315,0.0007402308,0.00045753503,0.0022951716],"category_scores_gemma":[0.0020404155,0.0003187532,0.00048638313,0.0010474505,0.0004801482,0.0020894015,0.0013748863,0.0005413551,0.00035147395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022983277,0.0000443779,0.0009843879,0.00020998222,0.000034723325,0.00026214356,0.00014925809,0.87717557,0.007639628,0.02398805,0.002134834,0.08714726],"study_design_scores_gemma":[0.000027944572,0.000054836306,0.0004256713,0.000016725166,0.000013870833,0.00011982355,0.000091265676,0.94480944,0.0035026341,0.04794841,0.002976722,0.000012528781],"about_ca_topic_score_codex":0.002362136,"about_ca_topic_score_gemma":0.0031633917,"teacher_disagreement_score":0.002362136,"about_ca_system_score_codex":0.0005461841,"about_ca_system_score_gemma":0.0006019825,"threshold_uncertainty_score":0.0076780915},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010555558837438759,"score_gpt":0.2570016394685372,"score_spread":0.24644608063109846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996719782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03919786,0.0015891825,0.95449954,0.00025404157,0.0002628863,0.00013310327,0.00015967319,0.00059810077,0.0033057097],"genre_scores_gemma":[0.703637,0.0008076054,0.29243988,0.00012510053,0.0001738793,0.00021636348,0.0005518626,0.000094455245,0.0019538342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983675,0.000650625,0.00014542819,0.00015820866,0.0006121161,0.00006621575],"domain_scores_gemma":[0.99849796,0.0005021086,0.00022110176,0.0001402821,0.00058892975,0.000049581482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712927,0.0007592823,0.0006451661,0.0012960322,0.00035137028,0.0007753847,0.0010275387,0.000581028,0.0009410461],"category_scores_gemma":[0.006304648,0.00012035583,0.00024954995,0.0016635933,0.0002762664,0.0018025829,0.00067341444,0.00046486064,0.00020460755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045230245,0.00013847591,0.002654529,0.00043680574,0.00014044894,0.00021005422,0.00010291342,0.58008903,0.04457346,0.049811676,0.005705881,0.31568435],"study_design_scores_gemma":[0.000019834071,0.00018252105,0.00063837174,0.0000119067145,0.000027909186,0.00015096531,0.000020186244,0.9798782,0.006945481,0.007460177,0.0046391427,0.0000252375],"about_ca_topic_score_codex":0.000629051,"about_ca_topic_score_gemma":0.0009130681,"teacher_disagreement_score":0.0014712927,"about_ca_system_score_codex":0.00085131614,"about_ca_system_score_gemma":0.00048780435,"threshold_uncertainty_score":0.0077810287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011261127652141106,"score_gpt":0.25111094922484295,"score_spread":0.23984982157270185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001623268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034373928,0.00064101035,0.958931,0.00040404272,0.00012761826,0.0002210307,0.00003903921,0.0003826348,0.004879536],"genre_scores_gemma":[0.8041339,0.001487847,0.18856676,0.00017292383,0.00019854859,0.00052423,0.00012587977,0.00007460982,0.0047153225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970401,0.001297971,0.00021100049,0.00024036947,0.0010464195,0.0001642108],"domain_scores_gemma":[0.99771994,0.0009103552,0.00038186007,0.0006011588,0.0002826173,0.000103967504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021204655,0.0004382793,0.0007489998,0.00072757324,0.0013826117,0.0013021996,0.0006702362,0.000895995,0.0011884402],"category_scores_gemma":[0.003992847,0.00029193758,0.00066074275,0.000977661,0.001749269,0.0030872298,0.0026204574,0.001311298,0.00045554645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058890454,0.00018557992,0.0011949004,0.0004281143,0.00010447507,0.0011384157,0.0012934617,0.1138156,0.03822238,0.710586,0.0031794193,0.12926278],"study_design_scores_gemma":[0.00018666766,0.00079220836,0.00053368503,0.00012430763,0.00009610432,0.0018581272,0.00034183313,0.5427291,0.037649035,0.37118983,0.04431868,0.0001804785],"about_ca_topic_score_codex":0.00017157989,"about_ca_topic_score_gemma":0.00012861726,"teacher_disagreement_score":0.0021204655,"about_ca_system_score_codex":0.0005642647,"about_ca_system_score_gemma":0.0010310707,"threshold_uncertainty_score":0.011214197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007030550419173799,"score_gpt":0.24983849890051613,"score_spread":0.24280794848134232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007824828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007137008,0.00026538334,0.9926911,0.0002453129,0.00008627017,0.00022507484,0.000047315996,0.0026966345,0.0030292403],"genre_scores_gemma":[0.021858044,0.00049811986,0.973033,0.00012181507,0.00006917572,0.000470967,0.0002363959,0.0002624937,0.003449979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612385,0.00096748135,0.00051433337,0.00057393766,0.0015188138,0.00030170107],"domain_scores_gemma":[0.99849534,0.00039419343,0.000122006815,0.0004321452,0.00028541216,0.000270889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006313225,0.0012300109,0.0012208784,0.0022498854,0.002518114,0.004632217,0.003879767,0.002747707,0.0036417523],"category_scores_gemma":[0.0046923086,0.001622359,0.0028096708,0.0016576208,0.0038680385,0.0042135986,0.0043464783,0.004286563,0.0020119539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008141872,0.00010647987,0.00030149808,0.00032738326,0.00009540616,0.00069031504,0.0010030288,0.04623784,0.009205341,0.82830036,0.009144577,0.10450642],"study_design_scores_gemma":[0.00013230531,0.00014259834,0.00021215028,0.00036774296,0.00011916701,0.0009670583,0.0002182333,0.286031,0.0071369223,0.32211885,0.38239115,0.00016287291],"about_ca_topic_score_codex":0.01052783,"about_ca_topic_score_gemma":0.0098629985,"teacher_disagreement_score":0.01052783,"about_ca_system_score_codex":0.002459481,"about_ca_system_score_gemma":0.0044622347,"threshold_uncertainty_score":0.0333879},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05289993945390044,"score_gpt":0.31284676810128415,"score_spread":0.2599468286473837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023975480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073201574,0.00010200806,0.9233345,0.00015080761,0.000038629525,0.00012555177,0.000031613105,0.0010589447,0.0019564827],"genre_scores_gemma":[0.73479146,0.00007994925,0.26345858,0.000081887665,0.000024909104,0.0001695563,0.00007746376,0.00007598387,0.0012402041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.0003809633,0.00011767538,0.00025137115,0.000456322,0.000099395096],"domain_scores_gemma":[0.9958988,0.0019617141,0.0005200016,0.000557392,0.0009466487,0.00011544575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948646,0.000478828,0.0006506785,0.00087050465,0.00046933338,0.0009968631,0.0012055517,0.0008667079,0.0010172186],"category_scores_gemma":[0.008289219,0.0002898788,0.0003900208,0.0005518823,0.0007242444,0.0012564079,0.0008130814,0.0009862111,0.00030942765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012607135,0.00024276636,0.007131473,0.00007104869,0.00007598345,0.00013704922,0.0002968003,0.6832296,0.015880533,0.011269171,0.0008890625,0.2806504],"study_design_scores_gemma":[0.0000048016027,0.00004611194,0.0004013864,0.0000038672433,0.000008228981,0.000023818888,0.000009404319,0.99318296,0.0035194953,0.0023374646,0.00045502605,0.000007504136],"about_ca_topic_score_codex":0.0033643846,"about_ca_topic_score_gemma":0.00254599,"teacher_disagreement_score":0.0033643846,"about_ca_system_score_codex":0.0010856274,"about_ca_system_score_gemma":0.00064992177,"threshold_uncertainty_score":0.010305524},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013946881794750452,"score_gpt":0.2327738769313161,"score_spread":0.21882699513656564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035138544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18819319,0.0043496247,0.6806831,0.0010528933,0.00080504024,0.00015248428,0.000519502,0.0008476752,0.123396635],"genre_scores_gemma":[0.8182459,0.002981124,0.15381478,0.0005036287,0.0002042212,0.00018257678,0.00047883706,0.000086118074,0.023502765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979144,0.00005016299,0.000011576183,0.00003741388,0.00006421961,0.00004522376],"domain_scores_gemma":[0.99966097,0.000085064115,0.000043155,0.00009108493,0.000075840864,0.000044010772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012842828,0.00022712024,0.00028336444,0.0005370757,0.0004545555,0.0012752429,0.0004818591,0.00058122096,0.0039826655],"category_scores_gemma":[0.0008289101,0.0001654635,0.0003365297,0.0004703155,0.0005513358,0.0014988048,0.0009339347,0.0005226987,0.00067223684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344851,0.00003119423,0.0005216536,0.00009045981,0.000019558343,0.00026870382,0.00012668363,0.046249837,0.007346204,0.9015117,0.005518258,0.038281318],"study_design_scores_gemma":[0.000019857576,0.00005800111,0.0007579412,0.000035183944,0.000015561052,0.000646844,0.000097205666,0.2844424,0.004891912,0.6427098,0.06629094,0.000034351313],"about_ca_topic_score_codex":0.0007059618,"about_ca_topic_score_gemma":0.0008752467,"teacher_disagreement_score":0.0039826655,"about_ca_system_score_codex":0.00032322103,"about_ca_system_score_gemma":0.0001700518,"threshold_uncertainty_score":0.013323307},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020111246923245917,"score_gpt":0.2493852751227801,"score_spread":0.22927402819953419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035352178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002558149,0.0068915463,0.958223,0.002587884,0.0010337373,0.00028752867,0.000055348308,0.0012930833,0.027069662],"genre_scores_gemma":[0.2049325,0.01098587,0.7447551,0.0027629538,0.0013465125,0.0012934904,0.00033457082,0.00036726828,0.03322181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975877,0.0012361675,0.0001765081,0.00031180782,0.000542042,0.00014581728],"domain_scores_gemma":[0.99864,0.00054757285,0.00010170822,0.00019671259,0.00038072502,0.00013338932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017916928,0.0011966092,0.0011749946,0.0010783235,0.0014696487,0.004348798,0.002650565,0.0034915993,0.007743459],"category_scores_gemma":[0.004229886,0.00057714916,0.0008414095,0.0019342547,0.0030791718,0.0038228128,0.0034127482,0.003955274,0.0022499743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005382195,0.000081863946,0.00040546487,0.0006642116,0.000108737935,0.00055661215,0.00093389844,0.049637705,0.0020935605,0.87193114,0.012275507,0.061257448],"study_design_scores_gemma":[0.00008786786,0.0001255089,0.00025968926,0.0003251764,0.00007963313,0.000509401,0.00036955762,0.22349682,0.0017586709,0.4719854,0.30094764,0.0000546831],"about_ca_topic_score_codex":0.0030419915,"about_ca_topic_score_gemma":0.0025396696,"teacher_disagreement_score":0.007743459,"about_ca_system_score_codex":0.0020450845,"about_ca_system_score_gemma":0.0018615988,"threshold_uncertainty_score":0.025904417},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012004475305071842,"score_gpt":0.2548075220576361,"score_spread":0.24280304675256428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046908253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007545764,0.00066217844,0.98996884,0.00014755203,0.0000220299,0.000022038645,0.000019349722,0.00012922268,0.0014830049],"genre_scores_gemma":[0.83323544,0.0028148002,0.16104905,0.00008846005,0.00018282545,0.00018504652,0.000082005594,0.000091945665,0.002270377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897826,0.0004030872,0.000037010373,0.000087744564,0.00040867497,0.00008518334],"domain_scores_gemma":[0.99725807,0.0017904771,0.00033861527,0.00013264213,0.00043319154,0.000047030277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013239438,0.0009551097,0.0007978239,0.0013072591,0.00045848265,0.0009552808,0.0011092214,0.00070305495,0.0007770672],"category_scores_gemma":[0.009010277,0.0005497152,0.00060519256,0.000859337,0.0008812836,0.0013707692,0.00066749734,0.0009633476,0.00023454739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011270528,0.000013973141,0.00029683227,0.00005808156,0.000018528359,0.00006994183,0.000063809464,0.965193,0.0017569975,0.02235834,0.00028066928,0.009878621],"study_design_scores_gemma":[9.894372e-7,0.00000766024,0.00005326036,0.0000071615354,0.000004912658,0.000016858872,0.000008979906,0.9932769,0.0003338676,0.005923716,0.0003617605,0.000003945095],"about_ca_topic_score_codex":0.0032449486,"about_ca_topic_score_gemma":0.0014393239,"teacher_disagreement_score":0.0032449486,"about_ca_system_score_codex":0.0011658852,"about_ca_system_score_gemma":0.0009455727,"threshold_uncertainty_score":0.008459091},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012417037974140578,"score_gpt":0.20822146436458364,"score_spread":0.19580442639044307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068164281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057494856,0.0013930558,0.9124469,0.0004737855,0.0003332382,0.0001231537,0.00005923593,0.0008308695,0.026844831],"genre_scores_gemma":[0.8505834,0.0010422105,0.13914673,0.00037890015,0.0004398413,0.00018566825,0.00006426543,0.00011453929,0.008044482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988147,0.0002170689,0.00006514402,0.00025052478,0.0005264826,0.00012607235],"domain_scores_gemma":[0.9982754,0.0004011043,0.00017544319,0.00057463074,0.0003954635,0.00017804428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015807209,0.0005489559,0.0006734196,0.00073865097,0.0008543973,0.001524176,0.0018213566,0.00093001605,0.0022744625],"category_scores_gemma":[0.0029477922,0.00030424906,0.00044724252,0.0005946032,0.0019540472,0.0031106758,0.0020932117,0.001870262,0.00038106096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005992604,0.00018263183,0.0010628452,0.00015307576,0.00006660125,0.00044505272,0.0005334051,0.14405237,0.055141516,0.65458184,0.0037763373,0.13940516],"study_design_scores_gemma":[0.00008297944,0.00047071074,0.0005453955,0.00005228848,0.00004815125,0.0005942868,0.00009892007,0.7929698,0.015189776,0.16736944,0.022505147,0.00007319775],"about_ca_topic_score_codex":0.00065594574,"about_ca_topic_score_gemma":0.0005074972,"teacher_disagreement_score":0.0022744625,"about_ca_system_score_codex":0.00084973045,"about_ca_system_score_gemma":0.00076501153,"threshold_uncertainty_score":0.00835973},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01874577577433612,"score_gpt":0.2567553213121447,"score_spread":0.23800954553780856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069471802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25102136,0.000572602,0.7299737,0.00090285746,0.0001133239,0.00026105158,0.00025152965,0.0010447133,0.0158589],"genre_scores_gemma":[0.86059046,0.00036116515,0.1331011,0.00016254112,0.000026225352,0.00011977512,0.00019306489,0.00012925375,0.005316434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00029149165,0.000026813099,0.00015413667,0.000100998746,0.00023024959],"domain_scores_gemma":[0.9987733,0.0005525389,0.000251379,0.00019310806,0.000102137165,0.00012757981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850376,0.0011182016,0.0010039184,0.0005188756,0.0008107086,0.0012133047,0.0012302856,0.000893309,0.0028831805],"category_scores_gemma":[0.0025208378,0.0004347198,0.00056928926,0.0008518785,0.0011656904,0.00177128,0.0012363619,0.00067275536,0.00060728507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023335853,0.00004821342,0.00039431168,0.00003593141,0.000017193583,0.000063718355,0.000048474,0.9706463,0.0039596427,0.010566129,0.0008360067,0.01315079],"study_design_scores_gemma":[0.000022035098,0.000065737375,0.00007234546,0.0000036119127,0.0000060832244,0.00002445536,0.000027548262,0.99304515,0.0009985059,0.005050477,0.0006753797,0.0000086707105],"about_ca_topic_score_codex":0.0062641264,"about_ca_topic_score_gemma":0.006484917,"teacher_disagreement_score":0.0062641264,"about_ca_system_score_codex":0.0016535823,"about_ca_system_score_gemma":0.0012467727,"threshold_uncertainty_score":0.012455344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014167981880614784,"score_gpt":0.22609117503705403,"score_spread":0.21192319315643926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070774400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16717562,0.0015734178,0.79295796,0.00072737207,0.00013058461,0.000044832675,0.00019222521,0.00030936964,0.036888573],"genre_scores_gemma":[0.920841,0.001602771,0.06406546,0.00017151983,0.00055792223,0.00014883821,0.0002875053,0.00023995843,0.012084962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000088150555,0.000009587565,0.00003883138,0.00006489124,0.000039219107],"domain_scores_gemma":[0.9987204,0.00079403305,0.000107470216,0.00009380229,0.00021518378,0.000069093614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000616244,0.00066936517,0.0005169139,0.0025641383,0.00054613693,0.0011485246,0.0009225805,0.0008201731,0.004953269],"category_scores_gemma":[0.0032813232,0.00029319193,0.000628247,0.0011969119,0.0011745906,0.0026972292,0.0005828244,0.0011548024,0.00068969536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008301488,0.000013041754,0.00025307032,0.00003476886,0.0000075942203,0.00007307487,0.00009374976,0.024408417,0.0018585296,0.96076113,0.0007674724,0.011720834],"study_design_scores_gemma":[0.0000060986226,0.000021024853,0.00028906984,0.000012233738,0.000006981577,0.00014454575,0.000034058754,0.2333876,0.00085721986,0.7624382,0.0027905307,0.000012527997],"about_ca_topic_score_codex":0.00043372184,"about_ca_topic_score_gemma":0.0002791074,"teacher_disagreement_score":0.004953269,"about_ca_system_score_codex":0.0008072305,"about_ca_system_score_gemma":0.00024265262,"threshold_uncertainty_score":0.01657033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01491837458209023,"score_gpt":0.2108605344136199,"score_spread":0.19594215983152968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075775382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20117033,0.00012546984,0.78663486,0.00048396256,0.00004753395,0.0000596028,0.00011699894,0.00050418614,0.010857019],"genre_scores_gemma":[0.9838051,0.000098412114,0.013548144,0.000053377047,0.000023698823,0.00002987296,0.00004104372,0.000042220854,0.0023581232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909735,0.00027050977,0.000044625325,0.00019039583,0.00023635494,0.00016079855],"domain_scores_gemma":[0.9968656,0.0014539587,0.0004970485,0.0007159171,0.00029118548,0.00017634299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009535127,0.0005061424,0.0004324804,0.00042339487,0.00066098874,0.001046133,0.00079783425,0.0005800702,0.0019144816],"category_scores_gemma":[0.005228698,0.00020346227,0.00063015334,0.00043773712,0.0020497795,0.0026913635,0.0016126981,0.001353419,0.00022775844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016871854,0.000049861745,0.00071123114,0.00003412991,0.000038776707,0.00029889453,0.00025630242,0.55848587,0.010264162,0.4109225,0.00067906483,0.018090473],"study_design_scores_gemma":[0.000011537043,0.00005982089,0.00015456647,0.000004091717,0.000012898579,0.00005933222,0.00004086014,0.8289405,0.0033301455,0.16652451,0.00085216033,0.000009444823],"about_ca_topic_score_codex":0.0021805055,"about_ca_topic_score_gemma":0.0009968427,"teacher_disagreement_score":0.0021805055,"about_ca_system_score_codex":0.0010719973,"about_ca_system_score_gemma":0.0006391853,"threshold_uncertainty_score":0.007777989},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01871149027825394,"score_gpt":0.24298892823241747,"score_spread":0.22427743795416352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078655426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007230835,0.00011925599,0.9898775,0.000110019886,0.000020332038,0.000012567679,0.000034386394,0.00008453097,0.002510564],"genre_scores_gemma":[0.77141696,0.0008801102,0.22358502,0.00018120976,0.00021424404,0.00017126679,0.00023718814,0.00009766028,0.0032163817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988846,0.00026968695,0.00006467983,0.00021773636,0.00043526536,0.00012804662],"domain_scores_gemma":[0.9971818,0.00171647,0.00018761063,0.00040727144,0.0004137312,0.000093224866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017106151,0.0007743923,0.00073196256,0.0015296121,0.0004724069,0.0013460041,0.002004823,0.0008954266,0.0028602143],"category_scores_gemma":[0.006960555,0.00042617254,0.0009168626,0.0011792284,0.0025706491,0.004410103,0.0021268458,0.0025513978,0.00019618263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017603694,0.000018145925,0.0002973262,0.00006437941,0.00001970163,0.00013738584,0.00007394297,0.22840601,0.002782163,0.7558367,0.0004031914,0.011943418],"study_design_scores_gemma":[0.0000066531716,0.00002762477,0.000107326065,0.000011696373,0.000011077864,0.000070479255,0.000015087102,0.6436732,0.0011829219,0.35400945,0.00087156094,0.000012909003],"about_ca_topic_score_codex":0.00093425374,"about_ca_topic_score_gemma":0.0010266795,"teacher_disagreement_score":0.0028602143,"about_ca_system_score_codex":0.0014560721,"about_ca_system_score_gemma":0.0011387776,"threshold_uncertainty_score":0.010564566},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010290717569064384,"score_gpt":0.23999110254324385,"score_spread":0.22970038497417947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095444497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051171236,0.013070566,0.8907277,0.0021689914,0.00067478616,0.00012818625,0.00081604876,0.0018894685,0.03935311],"genre_scores_gemma":[0.7496185,0.008957163,0.22421807,0.00071887736,0.0012778043,0.0006862039,0.0012515348,0.0011435619,0.012128326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974612,0.00057239586,0.00015949554,0.0003401822,0.0009127898,0.0005538457],"domain_scores_gemma":[0.9854537,0.009739397,0.000841648,0.0015676935,0.0017944081,0.00060310983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039247787,0.0021736058,0.0015862392,0.0031264857,0.0012076418,0.002966083,0.0028505127,0.0014128395,0.007564873],"category_scores_gemma":[0.01942695,0.00086009514,0.0013729681,0.0024663988,0.0018352161,0.007855227,0.0033311413,0.0049116425,0.0017591654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009427209,0.00016439306,0.0011261178,0.001003095,0.00019937103,0.000369682,0.0006308018,0.5072105,0.018701795,0.37953797,0.016603136,0.07351046],"study_design_scores_gemma":[0.000037055728,0.00011740067,0.00043404603,0.000118562275,0.000087843124,0.00010972476,0.00008792275,0.7659207,0.0040835636,0.22191231,0.007038299,0.00005252506],"about_ca_topic_score_codex":0.0021007343,"about_ca_topic_score_gemma":0.0026185266,"teacher_disagreement_score":0.007564873,"about_ca_system_score_codex":0.0032014893,"about_ca_system_score_gemma":0.001182993,"threshold_uncertainty_score":0.025307},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021801733310216134,"score_gpt":0.2467084641188144,"score_spread":0.22490673080859824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096437618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099502176,0.00035084345,0.8907777,0.00025813555,0.00004801078,0.00009260712,0.0013070246,0.0012169721,0.0064466326],"genre_scores_gemma":[0.50994426,0.00065386645,0.4791142,0.000075734475,0.00007013364,0.00015730562,0.0026479217,0.00027355633,0.007062933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994879,0.00014680957,0.000030665906,0.00012128845,0.000116001436,0.00009737365],"domain_scores_gemma":[0.99786514,0.0012690012,0.00031649446,0.00024706984,0.00017635524,0.00012591334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067166914,0.00075598276,0.0008040024,0.0010988158,0.00065253815,0.0016714361,0.0015425244,0.0013063175,0.0067528654],"category_scores_gemma":[0.005959995,0.00086432113,0.0006586833,0.0023259216,0.00067443086,0.0021051373,0.0014459485,0.0006875811,0.0010308174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011752895,0.00003325125,0.0016502879,0.00010080395,0.000026096817,0.00026553794,0.000109758184,0.9371604,0.0013736708,0.03007013,0.002508533,0.026583944],"study_design_scores_gemma":[0.000044744116,0.000042999887,0.00033778415,0.000014743088,0.000016691678,0.00010958802,0.00010234317,0.9524035,0.0010258242,0.041302107,0.004581035,0.000018668636],"about_ca_topic_score_codex":0.0039362037,"about_ca_topic_score_gemma":0.0060751806,"teacher_disagreement_score":0.0067528654,"about_ca_system_score_codex":0.0008369041,"about_ca_system_score_gemma":0.0007478587,"threshold_uncertainty_score":0.022590637},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014185320065759507,"score_gpt":0.26947336849193504,"score_spread":0.25528804842617553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098945293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030455954,0.0009963696,0.9657617,0.00026780672,0.00002433324,0.000051981257,0.000037682486,0.000167017,0.0022371705],"genre_scores_gemma":[0.8497461,0.0019559467,0.14462085,0.0001404613,0.00015327522,0.00030695883,0.00013163946,0.00016410176,0.0027806514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998701,0.0004940812,0.00008919248,0.00016639227,0.0004621977,0.000087156586],"domain_scores_gemma":[0.9966863,0.0022354098,0.0003666619,0.0003370839,0.00033025717,0.000044218017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015716254,0.00047906063,0.00060890644,0.0012718375,0.00043818698,0.00085622736,0.0006093967,0.0005724001,0.0009447158],"category_scores_gemma":[0.011434099,0.0003029272,0.00051465334,0.0012841388,0.0008252698,0.0018324048,0.0009613682,0.0005794347,0.00019378771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025826867,0.0000902157,0.0020843362,0.00051062007,0.00008659865,0.00031160263,0.00069041544,0.5648216,0.057298407,0.1885451,0.0025702952,0.18273255],"study_design_scores_gemma":[0.000020617717,0.00008949772,0.00064490153,0.000024217483,0.000024422743,0.00015868261,0.000049972572,0.9524696,0.0080249775,0.035670307,0.002808882,0.000013904821],"about_ca_topic_score_codex":0.0005937365,"about_ca_topic_score_gemma":0.00045478716,"teacher_disagreement_score":0.0015716254,"about_ca_system_score_codex":0.00078622124,"about_ca_system_score_gemma":0.00037400416,"threshold_uncertainty_score":0.008311629},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011125503334232833,"score_gpt":0.24866794621794525,"score_spread":0.2375424428837124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099324926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33125016,0.0006915769,0.6622461,0.0006051369,0.000075485885,0.000107030355,0.00007241429,0.0003156953,0.0046363487],"genre_scores_gemma":[0.9822222,0.00025567686,0.016066918,0.00005199109,0.000039296167,0.00006425874,0.00003182267,0.000037887865,0.0012298712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821895,0.0007057397,0.000056657424,0.00018373103,0.00045731541,0.000377627],"domain_scores_gemma":[0.991789,0.0055298177,0.0009982791,0.00042585112,0.0010490873,0.00020792343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056670755,0.00068984093,0.0008746798,0.0008686172,0.0010067798,0.0019329259,0.0016405572,0.0010085981,0.0014975629],"category_scores_gemma":[0.012818504,0.00065456564,0.00049825775,0.00069628976,0.0022339914,0.003480003,0.0010336683,0.00093587884,0.0001749921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026163465,0.00008889353,0.0013770129,0.00006694268,0.000069244685,0.00016333471,0.00033565957,0.84710693,0.00493029,0.1383032,0.0011277164,0.0061690486],"study_design_scores_gemma":[0.0000127146905,0.000044456443,0.00018499263,0.0000041580215,0.000015004816,0.000019488449,0.000038455506,0.98818505,0.0004984633,0.0108162835,0.00017071876,0.000010233986],"about_ca_topic_score_codex":0.0055689374,"about_ca_topic_score_gemma":0.0033256728,"teacher_disagreement_score":0.0056670755,"about_ca_system_score_codex":0.0038303486,"about_ca_system_score_gemma":0.0020490424,"threshold_uncertainty_score":0.029970706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032687725082573414,"score_gpt":0.268443296980625,"score_spread":0.2357555718980516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102676521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058384232,0.00073410914,0.9315714,0.0005927323,0.0000799576,0.0003453462,0.0052438905,0.0015529564,0.0014952777],"genre_scores_gemma":[0.2231961,0.00085735705,0.7613223,0.00019287434,0.00008452244,0.0006564622,0.012284792,0.00011852685,0.0012870121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988557,0.00021170409,0.0001614381,0.00024990173,0.00042093272,0.00010029237],"domain_scores_gemma":[0.99648273,0.0013930871,0.0005333499,0.00066332996,0.0007607234,0.00016671016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957246,0.0005403159,0.0007224875,0.0038476505,0.0008759879,0.0010596829,0.0014841041,0.0007017978,0.0012042113],"category_scores_gemma":[0.007859119,0.00031570016,0.0009609863,0.005186381,0.0005685989,0.002371526,0.0009606283,0.0009027756,0.00043934616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007907821,0.0005288821,0.025484126,0.0010336691,0.0002179056,0.0009909421,0.0015026127,0.104361095,0.019213878,0.048417687,0.0153317,0.7821267],"study_design_scores_gemma":[0.00007439723,0.00033412967,0.0059797587,0.00016871469,0.0000988525,0.0011385283,0.00059871277,0.8875562,0.010040351,0.06872498,0.025205694,0.00007962923],"about_ca_topic_score_codex":0.005371256,"about_ca_topic_score_gemma":0.00868528,"teacher_disagreement_score":0.005371256,"about_ca_system_score_codex":0.00070473365,"about_ca_system_score_gemma":0.0018547218,"threshold_uncertainty_score":0.01067996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Computer science; Software; Virtual machine; Distributed computing; Parallel computing; Operating system","score_opus":0.023527580399260204,"score_gpt":0.2365458262791595,"score_spread":0.2130182458798993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106723590","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02198376,0.00026043868,0.9612819,0.0003603057,0.00019657817,0.00006255596,0.00009653975,0.0027557497,0.013002241],"genre_scores_gemma":[0.30987412,0.00043774777,0.67664033,0.00022960437,0.000096332806,0.0003158155,0.0003413896,0.0004236241,0.011641028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939823,0.00013198887,0.00003191704,0.00010612514,0.00028255163,0.000049153055],"domain_scores_gemma":[0.9994905,0.0001094276,0.000041918513,0.00018656667,0.00012623938,0.00004528942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003788811,0.00036758184,0.00030880288,0.0004025969,0.0005894748,0.0010686142,0.0012061445,0.0006304967,0.00314089],"category_scores_gemma":[0.0014817577,0.00034397223,0.00048996264,0.00057742844,0.0009914251,0.0018965174,0.0013455668,0.0011423277,0.0009341358],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002175021,0.00013042455,0.0016168494,0.0004006073,0.000066793604,0.0007555449,0.0005929096,0.10297313,0.059347812,0.67568463,0.012650662,0.1455631],"study_design_scores_gemma":[0.00009598252,0.0002526122,0.00056907284,0.000053102103,0.00004298978,0.00087423297,0.00007550844,0.6321929,0.032007847,0.17587598,0.15791719,0.000042574924],"about_ca_topic_score_codex":0.0005609489,"about_ca_topic_score_gemma":0.000618635,"teacher_disagreement_score":0.00314089,"about_ca_system_score_codex":0.00038490014,"about_ca_system_score_gemma":0.0008067187,"threshold_uncertainty_score":0.010507345},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017670687493388817,"score_gpt":0.26118974007892976,"score_spread":0.24351905258554093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137815559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08121415,0.000116945695,0.9022002,0.00026936052,0.00006709007,0.00008901147,0.00036064725,0.002307459,0.013375191],"genre_scores_gemma":[0.4063249,0.00026172708,0.5805875,0.000112992144,0.000012337816,0.000097048694,0.00091491744,0.000364138,0.011324461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997149,0.000031393283,0.00002229693,0.0000560695,0.00013261939,0.00004262131],"domain_scores_gemma":[0.9995433,0.00011499241,0.00004992978,0.00018981766,0.00007900788,0.000023005347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018522945,0.0002608372,0.00030295434,0.0004706337,0.0004854246,0.0008391217,0.00066417194,0.00045902358,0.0072616185],"category_scores_gemma":[0.0012346462,0.00028324587,0.00034016056,0.000633269,0.0005390237,0.0015257595,0.0011914336,0.0005173021,0.0015696253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005004362,0.00012258209,0.0034206728,0.00036775187,0.000060802213,0.00059499464,0.0006773772,0.09494915,0.15783972,0.17572129,0.011389767,0.5543555],"study_design_scores_gemma":[0.000112944916,0.0005276548,0.0021967466,0.00008563828,0.00008422958,0.001069926,0.0005386872,0.5879882,0.12654893,0.14334568,0.1374055,0.00009580227],"about_ca_topic_score_codex":0.0018242256,"about_ca_topic_score_gemma":0.0027164228,"teacher_disagreement_score":0.0072616185,"about_ca_system_score_codex":0.00039026872,"about_ca_system_score_gemma":0.0005374738,"threshold_uncertainty_score":0.024292469},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007906585319661291,"score_gpt":0.244248468386534,"score_spread":0.2363418830668727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140347193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015738713,0.00025463145,0.9822051,0.00013529089,0.00003592487,0.00006892864,0.00002624097,0.00048326733,0.0010519883],"genre_scores_gemma":[0.3546478,0.00032118897,0.6416072,0.00012547593,0.00011422099,0.00028934242,0.00021853005,0.00017894308,0.002497288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.0003283306,0.000097646196,0.0001662701,0.0006155448,0.00014198838],"domain_scores_gemma":[0.99772614,0.0012404704,0.00016638069,0.00013149552,0.0006093055,0.00012612666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018995663,0.00079891796,0.0010099034,0.0018602569,0.00080115086,0.0014153295,0.0014189801,0.00088932505,0.0019381534],"category_scores_gemma":[0.0049226764,0.00039142318,0.00054160156,0.001477677,0.00061594835,0.0014967674,0.001065295,0.0008433098,0.0005003578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005185254,0.0001943979,0.0020543744,0.00015301745,0.00009563787,0.00015632827,0.00024973424,0.50486,0.011170026,0.061774846,0.0049498454,0.4138232],"study_design_scores_gemma":[0.0000313845,0.000022085143,0.00013588167,0.0000046955397,0.000008907374,0.000025834068,0.000017662538,0.9893555,0.0012909921,0.008239668,0.00085936475,0.00000799322],"about_ca_topic_score_codex":0.0032748452,"about_ca_topic_score_gemma":0.002525468,"teacher_disagreement_score":0.0032748452,"about_ca_system_score_codex":0.0014756388,"about_ca_system_score_gemma":0.0010481932,"threshold_uncertainty_score":0.010706484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004322295544888888,"score_gpt":0.222165718609343,"score_spread":0.21784342306445412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167205037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35639638,0.0011167068,0.63968307,0.00015695619,0.000067753164,0.00005140134,0.000033387638,0.00037908365,0.002115208],"genre_scores_gemma":[0.98890954,0.00013836539,0.010730201,0.000012161571,0.000020515716,0.000012050621,0.000012049093,0.000008456077,0.00015669584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970394,0.000098481694,0.000007803284,0.000028249726,0.00011251318,0.00004908198],"domain_scores_gemma":[0.99907625,0.0005494072,0.00013926705,0.00006150811,0.00012511018,0.000048592687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007622543,0.00040002435,0.0004222544,0.00035390272,0.00035863198,0.0005227599,0.00060587557,0.0002784679,0.00031373696],"category_scores_gemma":[0.002054369,0.00020120453,0.00015865498,0.00048228857,0.00045361207,0.0004917556,0.00032454813,0.00032306206,0.00005893595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016015256,0.00008970979,0.0009636694,0.00004606446,0.000021053895,0.00005761991,0.00004021954,0.9365435,0.015139077,0.004936345,0.00032576788,0.04167686],"study_design_scores_gemma":[0.0000045841293,0.00004107136,0.00015076312,0.000001158192,0.0000049796326,0.000009437075,0.000004317831,0.9982004,0.001129984,0.00039612505,0.00005457587,0.0000026779412],"about_ca_topic_score_codex":0.0028379923,"about_ca_topic_score_gemma":0.003387738,"teacher_disagreement_score":0.0028379923,"about_ca_system_score_codex":0.0007877894,"about_ca_system_score_gemma":0.0008215021,"threshold_uncertainty_score":0.005715847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010497232985055869,"score_gpt":0.25816099520477714,"score_spread":0.24766376221972128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180873154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278178,0.0006898616,0.95111394,0.0005326005,0.00014002762,0.00026182018,0.00015914219,0.0031049591,0.011215899],"genre_scores_gemma":[0.34114295,0.0007546663,0.64811677,0.00016229601,0.000103560844,0.0003196554,0.00057047786,0.00012293381,0.008706645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999699,0.00005639466,0.000017416052,0.000067182365,0.00013616275,0.000023878225],"domain_scores_gemma":[0.9996195,0.000041757456,0.000026145304,0.00011885657,0.00015901188,0.0000347718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035867267,0.00037982967,0.00029013376,0.00050942204,0.00089186523,0.0007020135,0.0011323921,0.0005847814,0.0017230748],"category_scores_gemma":[0.0007730798,0.00024800203,0.00022264529,0.00089763093,0.0003614694,0.0012601004,0.0006802742,0.0006058906,0.00075485907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032336786,0.00023942703,0.0015562432,0.0005470117,0.00017299755,0.0005459834,0.00037386254,0.26110283,0.13025956,0.18434773,0.028548561,0.39198238],"study_design_scores_gemma":[0.00008500236,0.00038198513,0.0009189856,0.00002860444,0.00009146038,0.00052821886,0.00012857796,0.8422144,0.035444614,0.045323104,0.074789695,0.000065336244],"about_ca_topic_score_codex":0.002304816,"about_ca_topic_score_gemma":0.0039752554,"teacher_disagreement_score":0.002304816,"about_ca_system_score_codex":0.0006025456,"about_ca_system_score_gemma":0.0009911126,"threshold_uncertainty_score":0.0057643056},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030136330993255644,"score_gpt":0.24994725375267726,"score_spread":0.21981092275942163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204817054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55218786,0.0012141401,0.40862778,0.00069207174,0.000052339,0.00012041994,0.0010567965,0.0003834736,0.03566517],"genre_scores_gemma":[0.97909844,0.00042519547,0.017164899,0.00006717484,0.000032515956,0.000057052643,0.00043457415,0.00004231096,0.0026777016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.000054642172,0.000013451822,0.00006995628,0.00012838838,0.00007264805],"domain_scores_gemma":[0.9975605,0.001122387,0.00046647887,0.0002817283,0.00039597249,0.00017284922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038607116,0.00029688884,0.0003084745,0.0010695613,0.0005642911,0.00059265713,0.0008328105,0.00037982425,0.0038122295],"category_scores_gemma":[0.0040098648,0.0001724416,0.00037354376,0.0010281095,0.00087405246,0.0016158228,0.0008528498,0.00073747284,0.00018993008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027146903,0.000049501166,0.0039299917,0.00029882364,0.000037978883,0.0005119632,0.00037828565,0.40897304,0.006940904,0.5322058,0.003508174,0.04289407],"study_design_scores_gemma":[0.000029287896,0.000084008476,0.0024138414,0.000020624148,0.000023690525,0.00033705405,0.00016865823,0.6470041,0.0021968554,0.34311616,0.004584066,0.00002155622],"about_ca_topic_score_codex":0.005498808,"about_ca_topic_score_gemma":0.003949839,"teacher_disagreement_score":0.005498808,"about_ca_system_score_codex":0.0010936366,"about_ca_system_score_gemma":0.0005848051,"threshold_uncertainty_score":0.012753129},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011921708208131324,"score_gpt":0.2694484824025898,"score_spread":0.25752677419445846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942927459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54978,0.0012133863,0.43558824,0.0008118602,0.00004972108,0.000082083854,0.0004018248,0.0006076668,0.011465273],"genre_scores_gemma":[0.85829,0.00044706094,0.1367342,0.00008073182,0.000038787744,0.00013188971,0.00039521584,0.00012822237,0.00375392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.00012825798,0.0000442905,0.00019676755,0.000112020185,0.00013273592],"domain_scores_gemma":[0.99571073,0.0030862845,0.0005457405,0.00029085815,0.00020890393,0.0001574727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080187153,0.00035021582,0.0007758673,0.0010531413,0.00067815714,0.0013091897,0.0009211606,0.0009406242,0.0038687643],"category_scores_gemma":[0.00853971,0.00039137914,0.0004391977,0.0011932623,0.0010076986,0.0039308136,0.000727594,0.0006269953,0.00034223258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081066694,0.00013785274,0.0048915083,0.0006393094,0.00009827174,0.00041799122,0.00044922388,0.59127116,0.019035352,0.28411323,0.0042129788,0.09392239],"study_design_scores_gemma":[0.00008550197,0.00015097903,0.0012293071,0.00003507886,0.000047926587,0.0004894712,0.00016271987,0.7552752,0.008305637,0.22979797,0.004393058,0.000027248903],"about_ca_topic_score_codex":0.00065054244,"about_ca_topic_score_gemma":0.0011998729,"teacher_disagreement_score":0.0038687643,"about_ca_system_score_codex":0.0008988142,"about_ca_system_score_gemma":0.00056744524,"threshold_uncertainty_score":0.012942314},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007086389217122757,"score_gpt":0.21600671412726893,"score_spread":0.20892032491014617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995422874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11714583,0.0014868021,0.85382444,0.002447719,0.0002490717,0.00040312056,0.0013919807,0.00437485,0.018676203],"genre_scores_gemma":[0.5028754,0.00067113823,0.48390728,0.00044398042,0.00016596461,0.0005030574,0.003028323,0.0006777095,0.0077271448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868315,0.00023185775,0.000066422785,0.00033490968,0.00025894132,0.0004246692],"domain_scores_gemma":[0.9974395,0.001539518,0.00023528705,0.00037895428,0.00022431,0.0001824318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981813,0.0014970659,0.0014740771,0.0010883088,0.0010794475,0.0020547376,0.0027618324,0.0017466107,0.007892851],"category_scores_gemma":[0.005159565,0.000537101,0.0011103451,0.0021212464,0.0009311878,0.003349341,0.0014032678,0.0023399955,0.0016911742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019716232,0.0009137096,0.0036038312,0.0009274821,0.00024026207,0.00035747973,0.00079356646,0.6383487,0.01397823,0.055573925,0.033357415,0.24993378],"study_design_scores_gemma":[0.00027340942,0.00015800787,0.00049824873,0.000038361763,0.000066763176,0.0002706223,0.00014512856,0.9501097,0.0027498128,0.042175617,0.0034876426,0.000026628837],"about_ca_topic_score_codex":0.008433831,"about_ca_topic_score_gemma":0.008853127,"teacher_disagreement_score":0.008433831,"about_ca_system_score_codex":0.0035885947,"about_ca_system_score_gemma":0.0036279198,"threshold_uncertainty_score":0.026404202},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004675571913619606,"score_gpt":0.2007537409321477,"score_spread":0.1960781690185281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995864758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028834028,0.00020164507,0.9624093,0.00021331015,0.00003682203,0.00006138085,0.00020911715,0.0022598645,0.0057745706],"genre_scores_gemma":[0.21024485,0.00025361407,0.78449196,0.00007681468,0.000019785712,0.00016078821,0.0009764476,0.00026580732,0.0035099452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990023,0.00025471466,0.000073465635,0.00018904018,0.00032667792,0.0001538628],"domain_scores_gemma":[0.9983468,0.0007882256,0.00014350083,0.00048342886,0.00018380958,0.000054254837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045225723,0.00060274603,0.00070805993,0.0010676912,0.0008037534,0.0015843766,0.001752265,0.0008340529,0.006422699],"category_scores_gemma":[0.004287567,0.00037721804,0.0005471929,0.0022176185,0.00095326145,0.0045572035,0.0022811193,0.0007930294,0.0015792827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054405205,0.00015539123,0.0017267701,0.0005188152,0.000047046975,0.00038281488,0.0004795351,0.28812853,0.016904954,0.23953034,0.009899387,0.44168237],"study_design_scores_gemma":[0.000062273044,0.00011915303,0.00031898016,0.00004982884,0.000020714224,0.00037821388,0.00023746314,0.75919807,0.011769161,0.20915183,0.018660806,0.000033498673],"about_ca_topic_score_codex":0.0019830575,"about_ca_topic_score_gemma":0.0037075258,"teacher_disagreement_score":0.006422699,"about_ca_system_score_codex":0.0009644088,"about_ca_system_score_gemma":0.0009930577,"threshold_uncertainty_score":0.021486044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011292947896288664,"score_gpt":0.24226947289312595,"score_spread":0.2309765249968373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210619295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06322236,0.048394047,0.44258213,0.07550683,0.116731964,0.00013412152,0.0014675101,0.0012044088,0.25075656],"genre_scores_gemma":[0.53769255,0.053984676,0.12252291,0.019310724,0.11125687,0.0001899884,0.00090419233,0.0010169555,0.15312113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966466,0.000092161055,0.000021862881,0.000072183124,0.000119708086,0.000029465153],"domain_scores_gemma":[0.9979962,0.0014273422,0.000087090935,0.0001575702,0.00023758992,0.000094236835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049674354,0.0008393252,0.00049804075,0.0007984678,0.0011950759,0.0013313688,0.0008365151,0.0007120588,0.006915342],"category_scores_gemma":[0.003333699,0.00022188366,0.00083644217,0.0012389519,0.0013127708,0.0031789294,0.0008416244,0.0037439386,0.0014763963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002542615,0.000107406515,0.0012083342,0.0006354756,0.00007204574,0.001770374,0.00037279635,0.02071841,0.01172606,0.62017477,0.22573443,0.117225654],"study_design_scores_gemma":[0.000021723272,0.000197097,0.0017156835,0.00012262787,0.000059297436,0.000583657,0.0001319597,0.025712928,0.0027748002,0.76219565,0.20642923,0.000055307297],"about_ca_topic_score_codex":0.0024482359,"about_ca_topic_score_gemma":0.0022685672,"teacher_disagreement_score":0.006915342,"about_ca_system_score_codex":0.00075387745,"about_ca_system_score_gemma":0.0004158948,"threshold_uncertainty_score":0.023134112},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011846415244611547,"score_gpt":0.2263594755566411,"score_spread":0.21451306031202955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290040450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3803267,0.0022132304,0.5918582,0.0010383942,0.00011957914,0.00016411662,0.0008118686,0.0013198246,0.022148175],"genre_scores_gemma":[0.8731119,0.0010235137,0.119937174,0.00016772148,0.0000556948,0.0001225299,0.0006239518,0.00014686576,0.0048106154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.000115309194,0.000022955177,0.00009217559,0.00008287347,0.00009316879],"domain_scores_gemma":[0.9982679,0.0010285074,0.00019764532,0.00017891476,0.00021177834,0.00011513551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003614765,0.0002479304,0.0005430663,0.00044043703,0.00062750524,0.0008769601,0.00064289285,0.0006513632,0.0019674366],"category_scores_gemma":[0.004113317,0.0004053403,0.0002900151,0.0009075134,0.0004878506,0.0015623746,0.00073880516,0.00050889933,0.00036438505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006040384,0.00013377587,0.0012753733,0.0007484252,0.00007770677,0.0002563514,0.0006468926,0.56735754,0.033615276,0.2145266,0.015997875,0.1647601],"study_design_scores_gemma":[0.000072689196,0.000116897674,0.0005660676,0.000041592404,0.000027568114,0.000109221844,0.00011858769,0.83699006,0.004562068,0.15238574,0.00499007,0.00001939058],"about_ca_topic_score_codex":0.002822527,"about_ca_topic_score_gemma":0.0032967061,"teacher_disagreement_score":0.002822527,"about_ca_system_score_codex":0.0009491976,"about_ca_system_score_gemma":0.00094198575,"threshold_uncertainty_score":0.0068870187},"labels":[],"label_agreement":null}]}