{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40874952,0.00056679716,0.56793135,0.003041834,0.017951306,0.00020245486,2.946525e-7,0.000044878805,0.0015115838],"genre_scores_gemma":[0.9981032,0.00004651546,0.00015683389,0.00051687576,0.0011167346,0.0000047290105,8.5563094e-8,0.0000107185415,0.000044278866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00021095265,0.0008029447,0.00015151495,0.00035477916,0.00019844809],"domain_scores_gemma":[0.9981769,0.0002276881,0.00068297243,0.00032122192,0.0005080391,0.000083224084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171491,0.00015436402,0.00031610436,0.00017480484,0.00014912788,0.00013272783,0.0007483424,0.00011321661,0.000025919853],"category_scores_gemma":[0.0002388768,0.00008896145,0.00027954314,0.00034387875,0.00007204805,0.00047889064,0.000081182996,0.0005066063,0.0000070851797],"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.00035339015,0.00034617854,0.00005426588,0.000024260751,0.00025659142,0.0000252668,0.0016112358,0.27376866,0.001904077,0.7091902,0.009609091,0.0028567635],"study_design_scores_gemma":[0.0128183365,0.01791925,0.0007845317,0.011469405,0.00019026131,0.0057118833,0.0054842304,0.5632355,0.11890506,0.24618822,0.015357035,0.0019362628],"about_ca_topic_score_codex":0.000026618687,"about_ca_topic_score_gemma":0.000011571754,"teacher_disagreement_score":0.58935374,"about_ca_system_score_codex":0.00012489289,"about_ca_system_score_gemma":0.00009012219,"threshold_uncertainty_score":0.36277428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006376434,0.011079866,0.9752572,0.0010002283,0.005400847,0.00044380725,7.874253e-7,0.00012027312,0.00032053865],"genre_scores_gemma":[0.9469012,0.0027672271,0.04258611,0.0014866772,0.0056436565,0.00009026982,0.0000032293729,0.000053413594,0.0004682183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724424,0.0001570751,0.0011753481,0.00041892027,0.0003441853,0.00066025904],"domain_scores_gemma":[0.99690473,0.00060148403,0.0010010379,0.00056970573,0.0006118032,0.00031125883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014244937,0.00032453446,0.00054746756,0.0002722053,0.00020339034,0.00030871967,0.0012671067,0.00030149755,0.00008153217],"category_scores_gemma":[0.00009080137,0.00029000916,0.0005456531,0.000563642,0.00006300392,0.001488759,0.00017607778,0.0008337761,0.000014125792],"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.00012083321,0.00016231602,0.000031994907,0.0000052209216,0.00009034976,0.000009595562,0.00017818432,0.55673605,0.000016561542,0.0011771658,0.03366244,0.40780932],"study_design_scores_gemma":[0.0009991459,0.0016560555,0.000043709755,0.00013138368,0.000033858694,0.00041126818,0.000099048266,0.77064323,0.00008759501,0.00033271327,0.22529273,0.0002692646],"about_ca_topic_score_codex":0.0000011305922,"about_ca_topic_score_gemma":0.00005128015,"teacher_disagreement_score":0.94052476,"about_ca_system_score_codex":0.00031473016,"about_ca_system_score_gemma":0.00008254889,"threshold_uncertainty_score":0.9999552},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0978548,0.00045675234,0.891582,0.00024170606,0.007541959,0.00008308167,2.4051187e-7,0.000082488434,0.00215698],"genre_scores_gemma":[0.9925744,0.00011741778,0.0039416268,0.00040411262,0.0023583302,0.0000035321696,2.5910856e-7,0.00001841957,0.0005819315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977549,0.0002546685,0.0010724766,0.00026054456,0.00030655242,0.00035089804],"domain_scores_gemma":[0.997657,0.00031382337,0.00085468433,0.0003421218,0.00063492934,0.00019743654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010091558,0.00021407651,0.00040721332,0.00033494487,0.0003955965,0.0001724305,0.00055271987,0.00015734039,0.00009097923],"category_scores_gemma":[0.00014452674,0.0001798933,0.00035544691,0.00053426303,0.000049093887,0.0012315072,0.000119297976,0.0006804464,0.00002369576],"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.00029128612,0.0004992663,0.00384135,0.00005426943,0.00066674006,0.034775157,0.0058614654,0.72704333,0.000618862,0.012226659,0.113577254,0.10054433],"study_design_scores_gemma":[0.00079519866,0.00053609704,0.00018502153,0.00021031848,0.00001193432,0.29766682,0.00025604534,0.6880125,0.00021261201,0.00021552539,0.011623919,0.00027405383],"about_ca_topic_score_codex":0.000023787617,"about_ca_topic_score_gemma":0.000018308461,"teacher_disagreement_score":0.89471954,"about_ca_system_score_codex":0.00013985191,"about_ca_system_score_gemma":0.00006511947,"threshold_uncertainty_score":0.73358357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007655414,0.00009058017,0.9900401,0.00039446747,0.0013622945,0.00027896406,0.000040908744,0.00010132737,0.000035901034],"genre_scores_gemma":[0.9748192,0.0000018002335,0.024386825,0.00024111997,0.0004903405,0.0000053926356,0.000038367125,0.000008545556,0.000008407861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984175,0.00015244314,0.0006499686,0.00023148615,0.00023758883,0.0003110381],"domain_scores_gemma":[0.9979388,0.00024196917,0.0006114533,0.0002862154,0.0007765651,0.00014501107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010350285,0.0001671281,0.00031084713,0.00015200696,0.00021517248,0.00019037296,0.0005610737,0.00014374594,0.0000046206073],"category_scores_gemma":[0.000086925975,0.00014991249,0.00021574849,0.0004353048,0.000013810839,0.00059300783,0.00002154814,0.00033007603,9.768318e-7],"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.000114292554,0.00020919491,0.00012651081,0.0000058336673,0.000027423706,0.000007182483,0.00013092917,0.99356294,0.0009704987,0.00058254326,0.0016443377,0.0026182993],"study_design_scores_gemma":[0.00079873856,0.0013833098,0.0008412198,0.00023104592,0.000016568432,0.000090094196,0.00005892387,0.9940298,0.00031527394,0.0009779728,0.0010895765,0.00016744895],"about_ca_topic_score_codex":0.000005000938,"about_ca_topic_score_gemma":0.000035224937,"teacher_disagreement_score":0.9671638,"about_ca_system_score_codex":0.00031402698,"about_ca_system_score_gemma":0.00014710503,"threshold_uncertainty_score":0.61132544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092350446,0.0007883131,0.8915865,0.0002158158,0.011760651,0.00012357581,1.9453357e-7,0.000086771026,0.0030877294],"genre_scores_gemma":[0.9899442,0.000050818027,0.008915365,0.00022739827,0.0006167383,0.0000044100348,3.036983e-7,0.000015042172,0.00022567877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974915,0.0004950549,0.0010844852,0.00026391112,0.000312701,0.00035234212],"domain_scores_gemma":[0.99807763,0.00042330488,0.00063459197,0.00024248578,0.00048508702,0.00013688675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017901065,0.00019611647,0.00040093096,0.00041336223,0.00011030435,0.00012829993,0.00035730223,0.00016247347,0.00007461615],"category_scores_gemma":[0.0004088836,0.00016786579,0.00021726551,0.0007446763,0.000022556254,0.0008320612,0.000056208784,0.00064403465,0.000008349351],"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.00037886403,0.0009951368,0.020830734,0.000055523742,0.0004626402,0.00078135927,0.00336284,0.73033047,0.003855491,0.14887781,0.035919707,0.054149423],"study_design_scores_gemma":[0.0020932923,0.00053678267,0.0024569961,0.0007541453,0.000015370477,0.0035915938,0.00049669226,0.9595735,0.00108646,0.0011495611,0.027775217,0.0004703729],"about_ca_topic_score_codex":0.000025660254,"about_ca_topic_score_gemma":0.0000751729,"teacher_disagreement_score":0.8975938,"about_ca_system_score_codex":0.00023359897,"about_ca_system_score_gemma":0.00007358663,"threshold_uncertainty_score":0.6845368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0464191,0.0001265944,0.9503946,0.00026374357,0.0021410407,0.000051061976,2.661602e-7,0.000045087207,0.0005585251],"genre_scores_gemma":[0.96776366,0.00012336178,0.03140841,0.00014190034,0.00048007103,0.000001922719,0.0000014244695,0.0000106439475,0.000068582565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883986,0.00009980666,0.00048682376,0.00013001982,0.00023410346,0.00020937825],"domain_scores_gemma":[0.9990748,0.00006764042,0.00031841733,0.00014648956,0.0003100297,0.00008263445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047898473,0.000098185956,0.00015644728,0.0003547285,0.0001231586,0.00017385071,0.00032992422,0.00004592981,0.000016082535],"category_scores_gemma":[0.000026614802,0.00008601558,0.00012157488,0.00057582563,0.000021200742,0.0014403119,0.000042946147,0.00029666108,0.000002792049],"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.000042452426,0.000106678264,0.0013129134,0.000007789789,0.00005192037,0.000056335604,0.000283587,0.9432653,0.0007554488,0.042108115,0.0041281413,0.007881285],"study_design_scores_gemma":[0.0007437382,0.00025846434,0.0005804252,0.00018210468,0.000011638397,0.000546855,0.00016770557,0.98686934,0.00059955346,0.0050784647,0.0047719697,0.00018974944],"about_ca_topic_score_codex":0.000042353895,"about_ca_topic_score_gemma":0.000015649397,"teacher_disagreement_score":0.9213446,"about_ca_system_score_codex":0.00008704497,"about_ca_system_score_gemma":0.000031893123,"threshold_uncertainty_score":0.35076135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05212669,0.0004558395,0.9411032,0.00011883823,0.005296968,0.00031242872,1.611776e-7,0.000066930945,0.00051892194],"genre_scores_gemma":[0.9863667,0.00015683338,0.010741135,0.00041220328,0.0022198623,0.0000127029325,9.1742993e-7,0.000032907625,0.000056733752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996551,0.00014773771,0.0015986089,0.00041338187,0.00045103623,0.00083827926],"domain_scores_gemma":[0.99588174,0.0015737243,0.0012224374,0.00038552654,0.00071752194,0.00021904433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005900964,0.00028784235,0.00060831045,0.0005852602,0.00014425824,0.00021826875,0.0009803073,0.00030700478,0.000012975982],"category_scores_gemma":[0.00036083025,0.0002713295,0.00033874254,0.0019096595,0.000034571192,0.0010115741,0.00016619966,0.0010360174,0.0000019112001],"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.00049760664,0.00021738817,0.0020135078,0.000027278888,0.00016965062,0.000097218304,0.0008898323,0.5434613,0.0011572102,0.018782254,0.0021903722,0.43049634],"study_design_scores_gemma":[0.0015078373,0.00045601526,0.0013981595,0.0004493982,0.000021881013,0.0002413526,0.00019449198,0.99291396,0.0016861286,0.00043894624,0.00037742654,0.00031442643],"about_ca_topic_score_codex":0.000025250854,"about_ca_topic_score_gemma":0.00034640703,"teacher_disagreement_score":0.93424004,"about_ca_system_score_codex":0.00083318725,"about_ca_system_score_gemma":0.000118006195,"threshold_uncertainty_score":0.9999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02607349,0.002465049,0.9649484,0.0035171858,0.0021490287,0.00042238756,0.0000013519789,0.00015909475,0.0002639829],"genre_scores_gemma":[0.98164374,0.0011816925,0.009762598,0.0060771946,0.0012440892,0.00001067202,0.000008811891,0.000034664157,0.00003651206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971326,0.00041284563,0.0010553835,0.00038542182,0.00046715193,0.00054661685],"domain_scores_gemma":[0.9957686,0.0013824361,0.0011061921,0.0008854512,0.0006464786,0.0002108305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013735272,0.00036473188,0.000582271,0.0003262531,0.00029083382,0.00029856426,0.0012607186,0.0003264014,0.000024064686],"category_scores_gemma":[0.00015706303,0.00033953952,0.0004624979,0.0006157331,0.000060277194,0.0007645549,0.00006999253,0.0011676291,0.0000028132538],"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.00027159543,0.0002687731,0.00019407396,0.000036478395,0.000068973626,0.000023045664,0.0001962113,0.94885975,0.00007327024,0.0029553203,0.015250987,0.03180151],"study_design_scores_gemma":[0.0011712536,0.0011112745,0.0007067277,0.0018531099,0.00004872727,0.00016814498,0.000052541884,0.9924425,0.00016811198,0.00052184827,0.001408013,0.00034777785],"about_ca_topic_score_codex":0.000005123761,"about_ca_topic_score_gemma":0.00001868761,"teacher_disagreement_score":0.9555703,"about_ca_system_score_codex":0.0002576747,"about_ca_system_score_gemma":0.000057009234,"threshold_uncertainty_score":0.99990565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21276999,0.0008578954,0.7844383,0.0011774354,0.00057727826,0.00009274765,0.0000016510588,0.000019271165,0.00006543017],"genre_scores_gemma":[0.8971509,0.00011915854,0.10151917,0.00082928495,0.0003666522,0.00000306191,0.0000011015154,0.000007446388,0.0000032248788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.00005879819,0.00044815615,0.00015234885,0.00014537132,0.00015026251],"domain_scores_gemma":[0.99856055,0.00032266407,0.0005653881,0.0001510368,0.00032524896,0.000075096235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028192985,0.0001197623,0.0002402736,0.00019891161,0.00007622161,0.00006453981,0.00037225414,0.000104444545,0.000005865875],"category_scores_gemma":[0.0000042088986,0.000098861165,0.00011897285,0.00023819337,0.000022195703,0.0005898801,0.000078112884,0.00025269194,6.6033374e-7],"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.002643537,0.00088888354,0.0014880091,0.00062609836,0.0012018892,0.000020162805,0.02334501,0.21517964,0.018680522,0.19032364,0.00042327621,0.5451793],"study_design_scores_gemma":[0.0007036253,0.0008476249,0.00064011686,0.00066303846,0.000043448275,0.00023221756,0.0006174044,0.9836161,0.0012694594,0.010128286,0.0011027602,0.00013590441],"about_ca_topic_score_codex":0.000009238308,"about_ca_topic_score_gemma":0.0001452319,"teacher_disagreement_score":0.7684365,"about_ca_system_score_codex":0.000036000853,"about_ca_system_score_gemma":0.000022941598,"threshold_uncertainty_score":0.40314412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10299317,0.00032112867,0.8958936,0.0002736705,0.00033966152,0.00014603771,9.0643766e-7,0.000013412764,0.00001843648],"genre_scores_gemma":[0.9838715,0.000034923854,0.015537777,0.00006760207,0.00043848742,0.0000053279246,0.0000040528466,0.000004888652,0.00003541999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909586,0.00009064792,0.00043417476,0.00015258223,0.00009356315,0.00013318604],"domain_scores_gemma":[0.9988826,0.00030071381,0.00038658734,0.000084633306,0.000293492,0.000052010884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032348727,0.00009228376,0.00015707214,0.0002088725,0.00016424488,0.0002075523,0.00012562324,0.00007209083,0.0000031465142],"category_scores_gemma":[0.000092753966,0.00008636479,0.000055892262,0.000248385,0.00001382435,0.0010839995,0.000014429151,0.0002767823,1.8722474e-7],"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.00002140903,0.000051974705,0.000116707786,0.0000015771569,0.000010110577,0.0000011112221,0.00009392917,0.979004,0.0013236003,0.0048010456,0.00015632677,0.0144181615],"study_design_scores_gemma":[0.00048207404,0.00041723144,0.0005975812,0.00007547243,0.000008868344,0.000055372664,0.00023478449,0.99685955,0.0000963743,0.00036934105,0.000716277,0.000087074885],"about_ca_topic_score_codex":0.000015632078,"about_ca_topic_score_gemma":0.000015372894,"teacher_disagreement_score":0.8808783,"about_ca_system_score_codex":0.00013536532,"about_ca_system_score_gemma":0.000075844786,"threshold_uncertainty_score":0.35218537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019949177,0.0012389121,0.9531558,0.0012942511,0.021114798,0.00011528058,2.1305104e-7,0.000114815106,0.0030167652],"genre_scores_gemma":[0.9914706,0.00023620075,0.0015510164,0.001382023,0.003701217,0.0000058503824,0.0000011704263,0.00002769438,0.0016242263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971795,0.0002981196,0.0012134183,0.0003453985,0.00045969582,0.00050388323],"domain_scores_gemma":[0.997335,0.00032438824,0.00089549576,0.00046194237,0.0007071097,0.0002760665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012187869,0.00029656704,0.0005208746,0.00035598277,0.00023004979,0.00033005117,0.00090020493,0.00027101388,0.00027966578],"category_scores_gemma":[0.000046742945,0.00024085087,0.0004603635,0.0007872809,0.00005156239,0.0012412319,0.00017715756,0.00086447864,0.000032333875],"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.00021316734,0.00025218155,0.0028143474,0.000006035248,0.00032153126,0.00034434654,0.00016070192,0.8464626,0.00012330736,0.021208147,0.09575656,0.032337055],"study_design_scores_gemma":[0.0011626101,0.0007061869,0.0027120016,0.00026623794,0.000026856775,0.0035851197,0.00005722331,0.9043551,0.00003901461,0.0011477032,0.08553942,0.0004025423],"about_ca_topic_score_codex":0.00001855513,"about_ca_topic_score_gemma":0.00002345949,"teacher_disagreement_score":0.97152144,"about_ca_system_score_codex":0.0001901265,"about_ca_system_score_gemma":0.000048551363,"threshold_uncertainty_score":0.98216134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04109703,0.0005530937,0.95077485,0.00058655447,0.006494243,0.0002429673,5.7228965e-7,0.00008758264,0.00016313384],"genre_scores_gemma":[0.97726697,0.000008458873,0.020109372,0.00014829655,0.002275062,0.000008558705,3.7870572e-7,0.00001516779,0.00016776544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980347,0.00021734915,0.0009031956,0.00023642214,0.0003366352,0.00027166412],"domain_scores_gemma":[0.9984904,0.00010050051,0.00063285267,0.00028181178,0.00025176702,0.00024265169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235469,0.00017989195,0.00034212827,0.00038536664,0.00013142712,0.0002846454,0.00055856106,0.00011437379,0.000008390022],"category_scores_gemma":[0.00004552742,0.00014354508,0.00020100844,0.00034786126,0.000007372729,0.0005606783,0.00006299754,0.00034946008,0.000029351802],"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.000043379267,0.00011130141,0.00032683508,0.00007507042,0.00013161369,0.00003677219,0.002596798,0.9419728,0.003451116,0.0023128125,0.007477396,0.041464098],"study_design_scores_gemma":[0.0005815189,0.00020502818,0.00055747316,0.0006662074,0.000015321475,0.0012070604,0.00033887304,0.98354596,0.0003846095,0.0000024916562,0.012319341,0.00017610606],"about_ca_topic_score_codex":0.000026718459,"about_ca_topic_score_gemma":0.000046056903,"teacher_disagreement_score":0.9361699,"about_ca_system_score_codex":0.00044805862,"about_ca_system_score_gemma":0.000029054681,"threshold_uncertainty_score":0.5853599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08976848,0.00010384629,0.9077974,0.00007782389,0.0012309211,0.00041544653,8.037598e-7,0.00005351487,0.0005517513],"genre_scores_gemma":[0.9606499,0.00000386585,0.03870936,0.00012776323,0.00042027238,0.00003570571,0.000005383775,0.00001390588,0.000033865632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972658,0.00035838768,0.0012259926,0.00034819444,0.00052036316,0.00028123212],"domain_scores_gemma":[0.9977528,0.00017837067,0.0007543921,0.0006792767,0.00045170638,0.00018349054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670783,0.00018947182,0.00042065993,0.0003996712,0.00007158523,0.00018747529,0.0007801258,0.0001071214,0.000012285263],"category_scores_gemma":[0.000054595912,0.00016569292,0.0002123672,0.00082113815,0.000040845316,0.0006119447,0.00007908802,0.000272336,0.0000044736544],"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.000060977523,0.00045132934,0.00031763193,0.000040244846,0.000026961743,0.0000061700985,0.000039314033,0.9814753,0.000044374745,0.0039069382,0.0044331267,0.009197651],"study_design_scores_gemma":[0.00041717233,0.0008892729,0.00088431645,0.000110145986,0.000036688638,0.000029413382,0.000066133005,0.99622333,0.00020239048,0.0001609027,0.00083271414,0.00014754797],"about_ca_topic_score_codex":0.000103034465,"about_ca_topic_score_gemma":0.000006382261,"teacher_disagreement_score":0.8708814,"about_ca_system_score_codex":0.00037093263,"about_ca_system_score_gemma":0.00007002874,"threshold_uncertainty_score":0.67567617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06871887,0.0006308199,0.92524636,0.0014496536,0.0035483819,0.00012225939,9.1501585e-7,0.00004394735,0.0002388017],"genre_scores_gemma":[0.9961039,0.00027066833,0.0023162744,0.00039831206,0.00078378484,0.0000038866538,4.906612e-7,0.00001072368,0.00011198181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981625,0.00012224886,0.0009202733,0.00019642836,0.0003434203,0.00025514708],"domain_scores_gemma":[0.9978575,0.00030044976,0.00096067664,0.00025937817,0.00046404992,0.00015793314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006289328,0.00017273487,0.00045221543,0.00022307933,0.00010377215,0.000035186054,0.0005096372,0.00012861966,0.00006329098],"category_scores_gemma":[0.00009614954,0.0001496444,0.00028683292,0.00035799306,0.00009135705,0.0005091171,0.00004143019,0.00041481314,0.000006820278],"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.0014237883,0.001244236,0.007868849,0.00003620765,0.001180863,0.0002942395,0.0012634316,0.75235456,0.0054126424,0.081520714,0.020497696,0.12690276],"study_design_scores_gemma":[0.0049775047,0.0012662049,0.0063793627,0.00020548972,0.00007458379,0.004689927,0.00006731457,0.978074,0.0006883886,0.0007066052,0.002580931,0.00028967264],"about_ca_topic_score_codex":0.000012512366,"about_ca_topic_score_gemma":0.000012455245,"teacher_disagreement_score":0.92738503,"about_ca_system_score_codex":0.00008767441,"about_ca_system_score_gemma":0.00010963303,"threshold_uncertainty_score":0.6102321},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19115789,0.00061317225,0.8041581,0.0003810674,0.0030542961,0.00009568199,9.4129874e-8,0.00009503475,0.00044468528],"genre_scores_gemma":[0.97224724,0.00008671314,0.02445512,0.0006845687,0.0024727397,6.845862e-7,2.3316029e-7,0.000016363061,0.000036334353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755037,0.00020259249,0.0009974411,0.00031010326,0.00047525112,0.00046422597],"domain_scores_gemma":[0.9977251,0.00022040437,0.0009423689,0.00037988435,0.0005403863,0.000191843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016529497,0.0002265435,0.00043542462,0.0002008629,0.00019396741,0.00032148216,0.0007422729,0.00019320408,0.000027509006],"category_scores_gemma":[0.0001934508,0.00021360377,0.00028679962,0.0007062191,0.000024000128,0.0012120417,0.000081331804,0.0010061163,0.000005215302],"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.0000614879,0.00010259577,0.00009568779,0.0000037590294,0.000059638696,0.000058857313,0.00052583497,0.79081607,0.0009994142,0.0006157289,0.0009845156,0.20567639],"study_design_scores_gemma":[0.00053919444,0.0004894653,0.00037820032,0.00044174356,0.000029309871,0.0012445946,0.000096306234,0.9952412,0.00040653205,0.0002937834,0.000619852,0.0002197965],"about_ca_topic_score_codex":0.000008224548,"about_ca_topic_score_gemma":0.000018932591,"teacher_disagreement_score":0.78108937,"about_ca_system_score_codex":0.00053545233,"about_ca_system_score_gemma":0.0001486425,"threshold_uncertainty_score":0.8710509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05817829,0.0010079278,0.929148,0.0012708498,0.009089083,0.00035391547,5.435348e-7,0.00008869455,0.00086268375],"genre_scores_gemma":[0.9896368,0.00010054304,0.003907976,0.0020380686,0.004083006,0.000008471153,0.0000022361999,0.000025139603,0.00019777972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961636,0.0005893649,0.0017303638,0.0004722435,0.00052909885,0.0005153052],"domain_scores_gemma":[0.9964121,0.00030352667,0.0014263837,0.0006619782,0.0009668315,0.00022920719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028115716,0.00037367787,0.00068698626,0.00037301346,0.00035325368,0.00040306506,0.0011119655,0.00028199173,0.000017352566],"category_scores_gemma":[0.00016834098,0.00026792884,0.0005313916,0.0011752225,0.000042883286,0.0014707084,0.00013833553,0.000977084,0.000006946396],"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.00019631746,0.00016719331,0.00010208703,0.000008550647,0.00013929975,0.0000039163583,0.000637635,0.95074844,0.00055340485,0.010446971,0.013775802,0.023220377],"study_design_scores_gemma":[0.0005772206,0.0016879836,0.0006145841,0.000296515,0.000052083582,0.0007777746,0.00066131435,0.9907302,0.00026654158,0.0006404768,0.0033978156,0.00029743533],"about_ca_topic_score_codex":0.000033476575,"about_ca_topic_score_gemma":0.000034069126,"teacher_disagreement_score":0.9314585,"about_ca_system_score_codex":0.00024503362,"about_ca_system_score_gemma":0.000063053885,"threshold_uncertainty_score":0.9999773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16165183,0.001077756,0.8351804,0.0007031294,0.00085579796,0.00012503762,6.009119e-7,0.00007830081,0.0003271243],"genre_scores_gemma":[0.9870268,0.00040678357,0.011590289,0.00028013348,0.00066404906,0.000004739549,0.0000011994126,0.000016267784,0.000009716698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983143,0.00011840334,0.0007021097,0.00022618393,0.00027104354,0.00036795874],"domain_scores_gemma":[0.9984053,0.00032310473,0.0004564498,0.0002813092,0.00036408097,0.00016978559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010373964,0.00021859245,0.00034348943,0.00015523401,0.00027186045,0.00035612524,0.00042175432,0.00013910898,0.000019540157],"category_scores_gemma":[0.00008028355,0.00016731134,0.00012317704,0.0004892037,0.00011849873,0.0019101949,0.00008514235,0.0006854204,7.334176e-7],"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.00022830379,0.0001410561,0.0060224547,0.000047352605,0.00021196969,0.000040482584,0.007005191,0.9405939,0.000023715253,0.010396944,0.000943322,0.034345325],"study_design_scores_gemma":[0.0037681675,0.0020279677,0.006804796,0.0017777892,0.000111923175,0.002966317,0.004049662,0.96735317,0.0004728371,0.008841151,0.0010431646,0.0007830736],"about_ca_topic_score_codex":0.00004452939,"about_ca_topic_score_gemma":0.00016463743,"teacher_disagreement_score":0.82537496,"about_ca_system_score_codex":0.00015308362,"about_ca_system_score_gemma":0.00007411858,"threshold_uncertainty_score":0.6822759},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027018312,0.00065630884,0.9595352,0.0008740205,0.0088064065,0.00041348877,0.0000025432862,0.0000626426,0.0026310973],"genre_scores_gemma":[0.99251026,0.00005180708,0.0022823338,0.00070398586,0.004223994,0.00004464584,0.0000052029086,0.000025923971,0.00015183387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960039,0.00081447104,0.0016690278,0.00035557622,0.00054671936,0.0006102785],"domain_scores_gemma":[0.99579906,0.00094673526,0.00124305,0.00068473944,0.0009801558,0.0003462603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042108493,0.0003370905,0.0006467143,0.00038765644,0.00027683322,0.00020263011,0.001200015,0.000278179,0.00009463919],"category_scores_gemma":[0.0004142088,0.00023757976,0.00056113274,0.001108123,0.000110455825,0.0014895706,0.00026113915,0.000984773,0.000021078045],"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.00039967577,0.0011707948,0.0044449205,0.000052519666,0.00057029456,0.0000047639146,0.0034814037,0.8259665,0.00013054907,0.067612454,0.07976524,0.016400937],"study_design_scores_gemma":[0.001417268,0.0014098014,0.010475276,0.00044682872,0.000118795375,0.002454456,0.0025153637,0.9344829,0.0005876448,0.0014492676,0.04394383,0.0006985688],"about_ca_topic_score_codex":0.000050359125,"about_ca_topic_score_gemma":0.000045565,"teacher_disagreement_score":0.96549195,"about_ca_system_score_codex":0.0002951577,"about_ca_system_score_gemma":0.00006238733,"threshold_uncertainty_score":0.9688221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029726226,0.0008722814,0.9602503,0.00051445456,0.007099173,0.00031714735,4.5784137e-7,0.000070005546,0.0011499148],"genre_scores_gemma":[0.9923285,0.00029552795,0.0029906812,0.00067943346,0.0028158145,0.000031917614,0.0000013970836,0.000029950117,0.0008267697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971293,0.00021849498,0.0014693167,0.00037692615,0.00021728624,0.0005886568],"domain_scores_gemma":[0.99777025,0.00039787166,0.0008602468,0.0003759556,0.00042107314,0.00017458954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019220238,0.00028080284,0.0005851245,0.00037416574,0.0002013351,0.0004700359,0.00082621735,0.0002927654,0.00013174367],"category_scores_gemma":[0.00010098561,0.00024834552,0.00044637034,0.00071312836,0.000040915824,0.0012107487,0.000057335223,0.00072877895,0.000004394002],"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.0007018079,0.00023790299,0.00060770777,0.000031049945,0.000220623,0.00005146997,0.0008776571,0.6895557,0.00017320753,0.005992866,0.018042507,0.28350753],"study_design_scores_gemma":[0.0014786874,0.00068718806,0.00029879098,0.00034487617,0.000014832834,0.0006089331,0.00013337297,0.9796799,0.00005061704,0.00063015794,0.01579817,0.00027449694],"about_ca_topic_score_codex":0.000049621332,"about_ca_topic_score_gemma":0.00021249264,"teacher_disagreement_score":0.96260226,"about_ca_system_score_codex":0.00029176607,"about_ca_system_score_gemma":0.00007095517,"threshold_uncertainty_score":0.9999969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083821796,0.0002834566,0.9139427,0.0007959762,0.0007008183,0.00007024607,2.3264931e-7,0.0000052186606,0.00037954145],"genre_scores_gemma":[0.99673754,0.000063592546,0.0028229775,0.00017974034,0.0001646538,0.0000018291253,8.2208004e-7,0.0000018536715,0.000027001595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897957,0.00018382246,0.00044151567,0.00008082672,0.00023408032,0.000080203274],"domain_scores_gemma":[0.998769,0.00033853695,0.0003833838,0.00010985642,0.00037676198,0.000022457167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080804323,0.000055463588,0.000097595745,0.0001984731,0.00002923097,0.00005357733,0.00029574567,0.000038083555,0.00002606035],"category_scores_gemma":[0.00018511743,0.00004135038,0.000046078345,0.00064836285,0.000033456665,0.00058207,0.00001775233,0.0001695147,0.0000022768802],"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.000027799193,0.00017576842,0.0007451032,0.000011826563,0.000020645386,0.000008899603,0.0036225743,0.80030817,0.00034047186,0.015885103,0.004810101,0.17404354],"study_design_scores_gemma":[0.0003861336,0.00024662097,0.0072335773,0.00009860683,0.00000575249,0.0002312131,0.00034510752,0.98887604,0.00038739893,0.0017575637,0.0003702985,0.00006165716],"about_ca_topic_score_codex":0.0000044710855,"about_ca_topic_score_gemma":0.000014977253,"teacher_disagreement_score":0.91291577,"about_ca_system_score_codex":0.00003242125,"about_ca_system_score_gemma":0.000020571892,"threshold_uncertainty_score":0.16862196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07716078,0.0003589881,0.9174366,0.00024463292,0.0042877058,0.00015972395,0.000002508171,0.000059736434,0.00028930616],"genre_scores_gemma":[0.98942757,0.0002681047,0.008550973,0.00025159147,0.0013182433,0.000004553626,0.000031960055,0.000037033926,0.00010996731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967467,0.00014553315,0.0014026294,0.0005326614,0.00046419568,0.00070823886],"domain_scores_gemma":[0.9957664,0.0016041979,0.0010435309,0.0008403329,0.00053190516,0.00021362875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00338997,0.00030664844,0.0004913084,0.0006406811,0.00015574066,0.00022052422,0.0016474937,0.00031305023,0.000007246816],"category_scores_gemma":[0.00012733394,0.00028254846,0.00019640218,0.0011116675,0.000057724214,0.0007600775,0.00035438087,0.00060645706,7.7150423e-7],"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.00020952825,0.00021005314,0.0002112044,0.00000774416,0.0000420635,0.00006476866,0.000125365,0.8762359,0.00019342631,0.005687283,0.0014764229,0.11553623],"study_design_scores_gemma":[0.0009286432,0.00026662688,0.000526884,0.00034430277,0.000019452063,0.00027670898,0.000118936536,0.99457186,0.00050468993,0.00007496847,0.0020747995,0.00029214725],"about_ca_topic_score_codex":0.000027337157,"about_ca_topic_score_gemma":0.00025915625,"teacher_disagreement_score":0.9122668,"about_ca_system_score_codex":0.0003890703,"about_ca_system_score_gemma":0.00005524003,"threshold_uncertainty_score":0.9999627},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37006837,0.00020102033,0.62840676,0.00013277576,0.00041346037,0.00046722658,5.4579414e-7,0.000036201487,0.00027362106],"genre_scores_gemma":[0.9951663,0.000025563557,0.0040032757,0.00014301317,0.0005688141,0.000026043532,0.0000011604392,0.00002642949,0.00003939241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708015,0.00049659744,0.0012653248,0.0004170935,0.00026155595,0.00047928604],"domain_scores_gemma":[0.9982815,0.00046676953,0.0005961349,0.00029163406,0.00024696504,0.00011699451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015026123,0.00032010215,0.0007456394,0.0010109877,0.00015721058,0.00044457888,0.00055583497,0.00021574023,0.000044865574],"category_scores_gemma":[0.000051214123,0.0002841477,0.00038278295,0.001219343,0.00008194198,0.001046634,0.0001307271,0.0007164421,0.0000025669028],"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.00032234896,0.00013596095,0.0055041146,0.000044275526,0.00043475005,0.00009889153,0.0022669295,0.96772957,0.001807373,0.0016713386,0.00014991927,0.01983456],"study_design_scores_gemma":[0.0011909052,0.00030224008,0.00068552454,0.000721523,0.00015476096,0.00028330937,0.00026379872,0.99401325,0.0003708575,0.0016809045,0.000037420927,0.00029548025],"about_ca_topic_score_codex":0.00013620546,"about_ca_topic_score_gemma":0.0007171244,"teacher_disagreement_score":0.62509793,"about_ca_system_score_codex":0.00021952411,"about_ca_system_score_gemma":0.00004873134,"threshold_uncertainty_score":0.9999611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42107296,0.00008210234,0.57766455,0.00016387919,0.0008718222,0.00008258787,0.000020174564,0.000035737365,0.0000061753994],"genre_scores_gemma":[0.92594177,0.00006784201,0.072319046,0.0001906084,0.0013992732,0.000011879824,0.000032514636,0.000014925562,0.000022169008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998575,0.00006924753,0.0005920063,0.00030155916,0.00017649379,0.0002857367],"domain_scores_gemma":[0.99844956,0.00030924013,0.00053148356,0.00032583624,0.00024702877,0.00013683706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015326115,0.00018869035,0.00035549022,0.00009988548,0.00024533077,0.00014616961,0.00074136443,0.00018945137,0.000030639807],"category_scores_gemma":[0.000020267633,0.0001558691,0.00019904863,0.00017258916,0.000055528908,0.00047786933,0.00012434962,0.0004379388,0.0000010336139],"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.00035733107,0.0008532516,0.0145763615,0.000016260166,0.00046583085,0.0002591396,0.0028417516,0.16235092,0.0026300761,0.0007801965,0.035624072,0.77924484],"study_design_scores_gemma":[0.00094843446,0.00049590576,0.009089072,0.0001019285,0.000036473266,0.0005123077,0.00018359983,0.98654217,0.00030687885,0.00009822532,0.0014751559,0.00020983658],"about_ca_topic_score_codex":0.000040247203,"about_ca_topic_score_gemma":0.000052848616,"teacher_disagreement_score":0.8241913,"about_ca_system_score_codex":0.00007352995,"about_ca_system_score_gemma":0.00003583239,"threshold_uncertainty_score":0.63561577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08395287,0.00078423595,0.9116504,0.00048689113,0.0027494924,0.00007266757,0.0000017815674,0.000102633894,0.0001990321],"genre_scores_gemma":[0.9833993,0.00015203498,0.015288956,0.00028044096,0.0007309452,0.0000031316692,0.000001449481,0.00001279692,0.00013095843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985699,0.00011049105,0.0006685229,0.00024042629,0.00015552752,0.0002551391],"domain_scores_gemma":[0.99837965,0.00035701523,0.00050410524,0.00026890595,0.00032746576,0.00016286958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156337,0.00021336698,0.00036992558,0.0002408898,0.00027898725,0.00015806346,0.0005822152,0.00011507224,0.000010682831],"category_scores_gemma":[0.00015755015,0.00015969746,0.00021417243,0.0003651627,0.00006988813,0.0006628892,0.00017290364,0.0004743433,0.000004223005],"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.0005484063,0.0016633089,0.029124936,0.00013404147,0.0018200832,0.00039446697,0.018905472,0.6327354,0.0034841613,0.020979224,0.087974094,0.20223646],"study_design_scores_gemma":[0.0020394088,0.0009964784,0.007958358,0.00045863222,0.000024694227,0.035987537,0.00029870114,0.9325965,0.00008976869,0.0020322725,0.016966019,0.00055161887],"about_ca_topic_score_codex":0.00005171173,"about_ca_topic_score_gemma":0.000030449819,"teacher_disagreement_score":0.8994464,"about_ca_system_score_codex":0.000057729052,"about_ca_system_score_gemma":0.00005606886,"threshold_uncertainty_score":0.65122736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33251855,0.00012809483,0.6659903,0.00012429587,0.0011335989,0.000036676553,2.7177052e-7,0.000009488853,0.000058691086],"genre_scores_gemma":[0.9672144,0.000032124026,0.032218836,0.000101111036,0.00041333865,3.3281373e-7,9.4125926e-7,0.000005672132,0.000013252489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988614,0.000080396814,0.000521715,0.0001294723,0.00027926225,0.00012777344],"domain_scores_gemma":[0.998846,0.00008027898,0.0005172132,0.00011879431,0.00036038423,0.00007733158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005676783,0.00009906335,0.00020883266,0.0003244443,0.00007203214,0.0000602637,0.00025359858,0.00007177613,0.000010101733],"category_scores_gemma":[0.00005777876,0.000087364126,0.00013431019,0.0004780416,0.000020830721,0.000623556,0.000030758074,0.00020364329,0.0000017493697],"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.00014597145,0.00022527066,0.00068062905,0.000015492935,0.000088162815,0.000023423394,0.0005745247,0.9542079,0.0066534793,0.010600529,0.00030265766,0.02648197],"study_design_scores_gemma":[0.0018539364,0.0013976243,0.0031840715,0.0004546088,0.00004255175,0.0014158702,0.00012845019,0.97491956,0.009922987,0.0059866207,0.00046348156,0.00023022847],"about_ca_topic_score_codex":0.000020004816,"about_ca_topic_score_gemma":0.000011874806,"teacher_disagreement_score":0.6346958,"about_ca_system_score_codex":0.00011039418,"about_ca_system_score_gemma":0.0001087699,"threshold_uncertainty_score":0.35626057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044462405,0.00022374486,0.94997424,0.0026855373,0.0022742061,0.00017463355,0.000004857002,0.000112838396,0.00008755684],"genre_scores_gemma":[0.9686237,0.000021809965,0.025948158,0.0038203506,0.0015426128,0.0000052974415,0.000018230432,0.000011245595,0.00000860268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846566,0.00010233917,0.00060233515,0.0002573291,0.00026066156,0.00031166477],"domain_scores_gemma":[0.99818194,0.00020356567,0.00059867307,0.00021026802,0.0006549492,0.00015057602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043713703,0.00020880162,0.00030594168,0.00029720252,0.0002101377,0.00026042707,0.00072741375,0.00013489035,0.000010027719],"category_scores_gemma":[0.0000069944494,0.0001739716,0.00025942,0.00070647954,0.000011471793,0.00075890607,0.000037637266,0.00036001587,0.0000022393572],"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.0016342702,0.0011945023,0.0027869714,0.00022008958,0.0005472447,0.00005358502,0.0019316785,0.70535916,0.02958651,0.00503464,0.0066784946,0.24497285],"study_design_scores_gemma":[0.0012671361,0.0011908129,0.0016222125,0.00021913463,0.000043912572,0.00021781039,0.000087317225,0.9801419,0.0038668883,0.0008786474,0.01026003,0.00020423517],"about_ca_topic_score_codex":0.000015314263,"about_ca_topic_score_gemma":0.0000818173,"teacher_disagreement_score":0.9241613,"about_ca_system_score_codex":0.000089569745,"about_ca_system_score_gemma":0.000058663853,"threshold_uncertainty_score":0.7094356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32130355,0.0008701728,0.67481214,0.000019784282,0.002302251,0.00052589213,0.0000038527733,0.00014204891,0.00002033364],"genre_scores_gemma":[0.9886093,0.0028256297,0.006235897,0.00003132624,0.0019835483,0.000121023215,0.000027129787,0.000119818935,0.000046326764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978624,0.00008023965,0.0010912122,0.00025882415,0.00017869327,0.00052864675],"domain_scores_gemma":[0.9987526,0.00038452112,0.0003214775,0.00015919059,0.00023455561,0.00014764095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004562383,0.0003274119,0.00052014465,0.00031476803,0.00010355537,0.00007398937,0.00022540537,0.00028816238,0.000054577198],"category_scores_gemma":[0.00003464471,0.00033677262,0.00021285839,0.0005350766,0.00004279526,0.00074901833,0.000016166157,0.0009796642,0.0000021615006],"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.00031044026,0.000038053593,0.00005911206,0.00003155016,0.00007499469,0.000010484808,0.00039092745,0.7707997,0.00005564213,0.000001033939,0.00012392174,0.22810411],"study_design_scores_gemma":[0.0014959673,0.0003357797,0.00009329489,0.0007977761,0.000037923473,0.00007043306,0.00021736353,0.99627006,0.0001012811,0.000020121677,0.00025772015,0.00030229986],"about_ca_topic_score_codex":0.0000021354774,"about_ca_topic_score_gemma":0.00008558215,"teacher_disagreement_score":0.66857624,"about_ca_system_score_codex":0.000546456,"about_ca_system_score_gemma":0.000032494798,"threshold_uncertainty_score":0.99990845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04779368,0.00033848514,0.94298697,0.004252967,0.00392495,0.00035453352,0.0000010744344,0.00028195497,0.00006541005],"genre_scores_gemma":[0.87668973,0.000023306231,0.12080029,0.0011348242,0.0012830219,0.000019829811,0.0000017382048,0.000027406679,0.000019852365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775684,0.00009240595,0.00079936755,0.00042018807,0.00033528925,0.00059592735],"domain_scores_gemma":[0.9977538,0.00022394481,0.00055476703,0.0006843329,0.00050369336,0.00027943592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010237877,0.0002897458,0.00043722338,0.0005091147,0.00020400411,0.00032238624,0.0018219899,0.00028634156,0.000004790063],"category_scores_gemma":[0.00018304824,0.00024386561,0.0003038739,0.0008331934,0.00005961662,0.00041553067,0.00023706775,0.00079086673,0.0000037968837],"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.00013107112,0.000114788774,0.000024053585,0.0000045552433,0.000052437765,0.000020241694,0.00030887304,0.9263195,0.00013334793,0.0031076723,0.0026921788,0.06709131],"study_design_scores_gemma":[0.0017255526,0.0027266084,0.0003567431,0.0003144647,0.000033947395,0.0009573675,0.00016908576,0.9796206,0.00075395295,0.0070333406,0.0058783945,0.0004299789],"about_ca_topic_score_codex":0.000008775803,"about_ca_topic_score_gemma":0.00008134466,"teacher_disagreement_score":0.82889605,"about_ca_system_score_codex":0.00031037163,"about_ca_system_score_gemma":0.0000778023,"threshold_uncertainty_score":0.9944551},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1446156,0.0003964667,0.84570915,0.000517828,0.0054365867,0.00026553968,0.0000050788644,0.000108367705,0.0029453463],"genre_scores_gemma":[0.9970018,0.00004429996,0.00098089,0.00031270992,0.0012446556,0.0000068357317,0.0000065416266,0.000036333826,0.00036593017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955227,0.00079877523,0.0018617389,0.00047292272,0.0007875366,0.0005563274],"domain_scores_gemma":[0.9925659,0.00096147927,0.0027521036,0.0006122048,0.002687886,0.00042047777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037424045,0.00039642586,0.0009885136,0.00043080765,0.00017365617,0.00021658956,0.0010146227,0.00035748325,0.000012886298],"category_scores_gemma":[0.0008861027,0.00030976013,0.00037910373,0.001150689,0.00012992887,0.0012813376,0.00018043928,0.0010686917,0.000009774874],"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.0033787135,0.0006944097,0.0022647176,0.000022368713,0.0011549082,0.00028487717,0.0021763605,0.9349384,0.00016396976,0.0074272687,0.03972791,0.007766094],"study_design_scores_gemma":[0.0054973336,0.0051504998,0.0015443191,0.0010627721,0.00007724541,0.0016214758,0.0006608588,0.9793262,0.00026211282,0.0006191867,0.0036941464,0.00048384277],"about_ca_topic_score_codex":0.00019159375,"about_ca_topic_score_gemma":0.0003339144,"teacher_disagreement_score":0.8523862,"about_ca_system_score_codex":0.0003600345,"about_ca_system_score_gemma":0.00021227945,"threshold_uncertainty_score":0.99993545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867926,0.0001644425,0.70734555,0.0004341125,0.0019053422,0.00014473186,9.828679e-8,0.000026701988,0.0031864296],"genre_scores_gemma":[0.9936816,0.00013595197,0.004708892,0.0001364216,0.0010708002,0.0000022856598,2.6268796e-7,0.000012996687,0.0002507674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826384,0.00026056703,0.00044092975,0.00023918007,0.00036580933,0.0004296889],"domain_scores_gemma":[0.9986534,0.00042184148,0.00022301172,0.0003204827,0.000274181,0.00010708169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012031717,0.00014385194,0.0003008142,0.00041403627,0.00005549355,0.00013927028,0.00085415033,0.00011302548,0.00014815849],"category_scores_gemma":[0.00005397737,0.000108897235,0.000108954184,0.00090334675,0.00009434797,0.0010291942,0.0001815059,0.0010670053,0.000016874174],"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.00065637956,0.000081680606,0.03241557,0.000007673706,0.000060971364,0.00015419899,0.00052874873,0.9120323,0.000052200103,0.020682238,0.0010698218,0.03225822],"study_design_scores_gemma":[0.005062738,0.0049315467,0.019465102,0.0008272546,0.000015410782,0.0025398294,0.0037750937,0.9433067,0.00088238367,0.013644153,0.004710411,0.0008394042],"about_ca_topic_score_codex":0.000013933179,"about_ca_topic_score_gemma":0.00009823884,"teacher_disagreement_score":0.70688903,"about_ca_system_score_codex":0.00018310819,"about_ca_system_score_gemma":0.00006877593,"threshold_uncertainty_score":0.46356663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005771052,0.0005533707,0.9859268,0.00055855315,0.006276036,0.00043761145,8.030205e-7,0.000030876585,0.00044487295],"genre_scores_gemma":[0.98218536,0.00019424724,0.014027975,0.00070118695,0.0018226828,0.000039677212,0.0000020117818,0.000027906415,0.0009989496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982607,0.0001631654,0.00082932063,0.0002227416,0.0002451356,0.00027898216],"domain_scores_gemma":[0.9980035,0.0005969144,0.00063748314,0.00031668282,0.00038476684,0.00006069644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018972172,0.00016371933,0.0003291722,0.0002771125,0.000102513884,0.00024214537,0.0006714594,0.00013279326,0.00004599656],"category_scores_gemma":[0.000043696593,0.0001109127,0.00030608213,0.00053755776,0.000021546173,0.00084908295,0.000064881635,0.00042617464,0.00002491724],"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.00018780427,0.00024308884,0.00064067164,0.000038362876,0.00026894122,0.000015368667,0.0014838567,0.3005802,0.00056423905,0.00914678,0.033401918,0.65342873],"study_design_scores_gemma":[0.00085860834,0.00041250922,0.00018484265,0.00018350246,0.000010255457,0.00035154866,0.00021206653,0.98766977,0.00007428192,0.0008431754,0.009066162,0.00013325678],"about_ca_topic_score_codex":0.000015809537,"about_ca_topic_score_gemma":0.000013356251,"teacher_disagreement_score":0.9764143,"about_ca_system_score_codex":0.000121771875,"about_ca_system_score_gemma":0.000037704136,"threshold_uncertainty_score":0.45228887},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44412684,0.000107774,0.5547479,0.0001294551,0.00064861216,0.000057504833,1.0167772e-7,0.000005112782,0.00017671728],"genre_scores_gemma":[0.99201614,0.000037804493,0.00771014,0.000061604354,0.00010041154,9.721655e-7,0.00000133836,0.0000043021732,0.00006726999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990038,0.00008102393,0.00041564024,0.00012608297,0.00026171314,0.00011168373],"domain_scores_gemma":[0.9989401,0.00015489025,0.00042836778,0.00011727707,0.00031651708,0.000042840467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441608,0.000083288796,0.0001912563,0.0008786524,0.000024645307,0.000063092,0.00019633089,0.00005727503,0.00003287241],"category_scores_gemma":[0.000038165235,0.000069224974,0.00007589571,0.001570864,0.000013461162,0.00073802326,0.000022080185,0.00021135045,0.0000027769763],"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.0002561778,0.00017382372,0.009420925,0.00001948722,0.000076605116,0.0000125535125,0.00056033395,0.9353795,0.0017078003,0.023500022,0.00048162608,0.028411122],"study_design_scores_gemma":[0.0035515607,0.0032849256,0.046033002,0.00032741515,0.000027540224,0.0006060702,0.0003086975,0.9310074,0.0083593745,0.004797089,0.0013663599,0.00033059088],"about_ca_topic_score_codex":0.000013493316,"about_ca_topic_score_gemma":0.00003875023,"teacher_disagreement_score":0.5478893,"about_ca_system_score_codex":0.000068812275,"about_ca_system_score_gemma":0.000072515206,"threshold_uncertainty_score":0.28229126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055718996,0.00043522648,0.92220783,0.00075895526,0.019114297,0.0002876095,0.0000033210747,0.00010736023,0.0013663995],"genre_scores_gemma":[0.9951401,0.00010099129,0.0010255036,0.00091080717,0.0022641572,0.000031550484,0.0000036490671,0.000046371093,0.00047690756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995208,0.0008578447,0.002030299,0.00053223857,0.0008219011,0.0005497113],"domain_scores_gemma":[0.9954794,0.0006607969,0.0021746994,0.000692237,0.0007730801,0.00021981094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002672074,0.00040199008,0.0008218093,0.0008961239,0.0004631391,0.00017321315,0.001424791,0.00023593837,0.00024460186],"category_scores_gemma":[0.00017027937,0.00037025363,0.00076229527,0.0012648201,0.00006652777,0.0009354212,0.0004403441,0.0019124815,0.000010093931],"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.0008093946,0.00040976805,0.00028736345,0.00002101307,0.00024856743,0.00008833535,0.0011245323,0.9440375,0.00035547125,0.009279439,0.015109355,0.028229268],"study_design_scores_gemma":[0.001496714,0.004543439,0.00036888418,0.00035015898,0.000044240474,0.0019554533,0.0007710229,0.9716001,0.0004540105,0.0005161677,0.017490024,0.00040976494],"about_ca_topic_score_codex":0.00006927171,"about_ca_topic_score_gemma":0.000050817962,"teacher_disagreement_score":0.93942106,"about_ca_system_score_codex":0.00057215756,"about_ca_system_score_gemma":0.00009879561,"threshold_uncertainty_score":0.99987495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2835561,0.0005606445,0.70640403,0.00063421624,0.007629369,0.00013998583,8.3670454e-7,0.00007094542,0.0010038541],"genre_scores_gemma":[0.9963882,0.000024217918,0.0020751164,0.00039108752,0.0008460135,0.00001876981,0.0000010645279,0.000019049841,0.00023647732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970065,0.0006135015,0.0012321211,0.00030273478,0.00044050557,0.00040465166],"domain_scores_gemma":[0.99802375,0.00038437918,0.00088247954,0.00028829914,0.00030157948,0.00011953128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020713361,0.00020368033,0.00044595456,0.0006760412,0.0002971642,0.00020865507,0.0009421999,0.00008770253,0.00024946046],"category_scores_gemma":[0.00014135533,0.00019544427,0.00027449205,0.0011229819,0.000026536836,0.0007929087,0.0003319882,0.0011367574,0.000004132923],"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.00016012417,0.00014295283,0.0011876009,0.000004903079,0.00006383778,0.00020649044,0.0010248659,0.9752521,0.0002910453,0.003370259,0.0065376777,0.011758145],"study_design_scores_gemma":[0.0012914935,0.0011722943,0.0011082034,0.00012264593,0.000010117273,0.0040741703,0.0019489421,0.9772891,0.00008574537,0.00024506316,0.012378065,0.00027420153],"about_ca_topic_score_codex":0.00004544353,"about_ca_topic_score_gemma":0.00010255,"teacher_disagreement_score":0.7128321,"about_ca_system_score_codex":0.0004192737,"about_ca_system_score_gemma":0.000090015565,"threshold_uncertainty_score":0.7969986},"labels":[],"label_agreement":null}]}