{"meta":{"query_hash":"79899d6c734e","filters":{"topic":"Interconnection Networks and Systems"},"cohort_total":1044,"direct_labels_cover":0,"predictions_cover":1044,"exported":1044,"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/79899d6c734e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Interconnection+Networks+and+Systems"},"results":[{"id":"W101439583","doi":"","title":"A 10-Gbps Energy Efficient On-Chip Wireless Communication Network for Multicore Processing","year":2014,"lang":"en","type":"article","venue":"Microelectronics and solid state electronics","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Multi-core processor; Computer science; Transceiver; Keying; Transmission (telecommunications); Computer network; Transmitter; Chip; Wireless; Efficient energy use; Core (optical fiber); Wireless network; Telecommunications; Engineering; Channel (broadcasting); Electrical engineering","score_opus":0.007573185360831452,"score_gpt":0.22630960675142148,"score_spread":0.21873642139059002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101439583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30857858,0.0058556907,0.60585403,0.0019708723,0.0009007457,0.00029863665,0.0006940458,0.0026630792,0.07318424],"genre_scores_gemma":[0.7592043,0.0032999513,0.19749928,0.0004819773,0.00008740836,0.00016744605,0.00094037043,0.00014167457,0.038177535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998996,0.000016430344,0.0000038124408,0.000014921029,0.0000449636,0.000020266607],"domain_scores_gemma":[0.9999126,0.000022143939,0.000011638095,0.000011034143,0.000025733296,0.000016752128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015725127,0.00025962244,0.00013641018,0.00015000065,0.00025134417,0.00050078554,0.0004339743,0.00040532043,0.003092669],"category_scores_gemma":[0.00021390917,0.00013027656,0.00010018449,0.00019227772,0.00015238469,0.00066343264,0.0002684639,0.0004525233,0.00084863894],"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.0001939216,0.00023399509,0.0019939663,0.00072985137,0.00007075564,0.0003891939,0.00016336891,0.03235523,0.6304215,0.054284863,0.021333676,0.25782973],"study_design_scores_gemma":[0.000052209904,0.0013396048,0.0043807155,0.0001844401,0.00008758678,0.0014744699,0.0002290642,0.27117452,0.32027453,0.017581347,0.38312802,0.000093567345],"about_ca_topic_score_codex":0.00067737565,"about_ca_topic_score_gemma":0.0027139168,"teacher_disagreement_score":0.003092669,"about_ca_system_score_codex":0.00054102676,"about_ca_system_score_gemma":0.00069503207,"threshold_uncertainty_score":0.010346055},"labels":[],"label_agreement":null},{"id":"W1019300650","doi":"10.1007/978-1-4614-7079-3_4","title":"Resource Allocation for Single-Network and Multi-Homing Services","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homing (biology); Computer science; Multihoming; Resource allocation; Computer network; World Wide Web; Biology; Ecology; The Internet","score_opus":0.02556454649064386,"score_gpt":0.2306191743689768,"score_spread":0.20505462787833295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1019300650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049425226,0.00709909,0.8848293,0.00064888736,0.00066632783,0.00015216299,0.00015699526,0.0011105703,0.05591151],"genre_scores_gemma":[0.75420064,0.0041776816,0.20045727,0.00022136173,0.00043957337,0.00020480229,0.00019493954,0.00031545397,0.039788276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.000067785375,0.000016869975,0.000050749437,0.00008615688,0.000093127775],"domain_scores_gemma":[0.99977535,0.000092754395,0.000013649462,0.00004913241,0.000039028546,0.000030068519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004813906,0.0005742246,0.0006198815,0.00040661028,0.0005422922,0.001349192,0.0012785571,0.00047314411,0.009491289],"category_scores_gemma":[0.0009559154,0.00021976659,0.0003252305,0.00083834835,0.00033096928,0.0014680652,0.00091557496,0.0006211598,0.001169092],"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.00048848375,0.0001453344,0.00034274923,0.00039069256,0.000060942755,0.00023253319,0.0001865382,0.1922624,0.018054701,0.21258418,0.018236134,0.55701524],"study_design_scores_gemma":[0.000028580725,0.00009150822,0.0004371291,0.000053226315,0.00003317649,0.00027268837,0.00011264971,0.8370475,0.005736468,0.13113253,0.025028918,0.000025560339],"about_ca_topic_score_codex":0.0010361801,"about_ca_topic_score_gemma":0.0013488419,"teacher_disagreement_score":0.009491289,"about_ca_system_score_codex":0.0009855223,"about_ca_system_score_gemma":0.000529895,"threshold_uncertainty_score":0.031751573},"labels":[],"label_agreement":null},{"id":"W107284894","doi":"","title":"A high-performance low-power ethernet controller with embedded 8-bit MCU for information appliances","year":2007,"lang":"en","type":"article","venue":"International Conference on Circuits","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Microcontroller; Embedded system; Computer science; Ethernet; ATA over Ethernet; Synchronous Ethernet; Power (physics); Ethernet flow control; Carrier Ethernet; Computer hardware","score_opus":0.021184920383294375,"score_gpt":0.2551651437094967,"score_spread":0.23398022332620236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107284894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.406209,0.0026021828,0.48293796,0.0008029024,0.00084363687,0.0011052559,0.0008402609,0.040508263,0.06415059],"genre_scores_gemma":[0.8633882,0.00027155262,0.10351018,0.00050794584,0.00018823342,0.0001961988,0.0007063976,0.00051505177,0.030716157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966073,0.000046081557,0.000019347503,0.00006834747,0.00015415551,0.000051385337],"domain_scores_gemma":[0.9997315,0.000036405225,0.000017019152,0.00005084203,0.00012682557,0.000037360507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025676104,0.0005296561,0.0005651402,0.00073237426,0.00069835014,0.00053250155,0.0018079034,0.00036132353,0.011718881],"category_scores_gemma":[0.00037263022,0.0002817073,0.00019366764,0.0005419644,0.00015627772,0.0008155839,0.0004600958,0.00053265406,0.0021210003],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0017369678,0.0007956754,0.0058036693,0.00062220974,0.00017351178,0.001025964,0.00036510703,0.0046996726,0.47052878,0.008059103,0.0571485,0.44904086],"study_design_scores_gemma":[0.00045033538,0.0025223547,0.014214114,0.00010175993,0.00052750105,0.002631813,0.00019445046,0.20701967,0.60596627,0.0025214842,0.16366431,0.00018596488],"about_ca_topic_score_codex":0.0013250414,"about_ca_topic_score_gemma":0.0027274184,"teacher_disagreement_score":0.011718881,"about_ca_system_score_codex":0.000465613,"about_ca_system_score_gemma":0.0006347991,"threshold_uncertainty_score":0.039203525},"labels":[],"label_agreement":null},{"id":"W109780709","doi":"","title":"Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Mathematics; Star (game theory); Combinatorics; Group (periodic table); Astrophysics; Physics; Mathematical analysis","score_opus":0.013193417785829796,"score_gpt":0.22919929267255962,"score_spread":0.21600587488672982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109780709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6063265,0.0045466786,0.20561375,0.0025761772,0.0003288763,0.00007932884,0.0008714816,0.00044713548,0.17921004],"genre_scores_gemma":[0.9666127,0.0018746807,0.01750301,0.0003203395,0.00022167356,0.00006502911,0.00057370396,0.00006998937,0.01275886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.0000687471,0.000010622053,0.00005210458,0.00006175228,0.000043829074],"domain_scores_gemma":[0.99842864,0.00082075084,0.00025465875,0.0001374562,0.00015502973,0.00020332112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030604753,0.00025664183,0.00032498536,0.0010896915,0.0006662799,0.0010218921,0.00050886296,0.00060844695,0.0071942345],"category_scores_gemma":[0.0023314673,0.00032323366,0.00026877405,0.0010431535,0.0008805219,0.0032969585,0.0009755368,0.0008916096,0.00053431327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072532486,0.00002109761,0.0009587894,0.00010052118,0.000014232564,0.00027668162,0.00026662086,0.0052547795,0.0022412236,0.9675589,0.0058131004,0.017421499],"study_design_scores_gemma":[0.0000114317045,0.00001924177,0.00077256345,0.000021113286,0.000012397832,0.00035539223,0.00016366238,0.015456088,0.00058913906,0.97591317,0.006679724,0.0000060859584],"about_ca_topic_score_codex":0.000702399,"about_ca_topic_score_gemma":0.0014637245,"teacher_disagreement_score":0.0071942345,"about_ca_system_score_codex":0.00043952503,"about_ca_system_score_gemma":0.00026577886,"threshold_uncertainty_score":0.024067044},"labels":[],"label_agreement":null},{"id":"W110399080","doi":"","title":"Network Performance in High Performance Linux Clusters.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Interconnection Networks and 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":"Western University","funders":"","keywords":"Myrinet; Gigabit Ethernet; Computer science; Operating system; Supercomputer; Gigabit; Network interface controller; Ethernet; Network performance; Process (computing); Computer network; Local area network; Embedded system; Distributed computing; Message passing; Telecommunications","score_opus":0.011638721391826007,"score_gpt":0.2378320049602438,"score_spread":0.22619328356841778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110399080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381044,0.003620831,0.030829636,0.0007813816,0.000267188,0.000050803737,0.0005483414,0.0016750323,0.024122357],"genre_scores_gemma":[0.9956285,0.00040527736,0.0024585791,0.000020993004,0.000019843485,0.00001742083,0.00039032838,0.00006710135,0.0009920035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833184,0.00041220928,0.0000559946,0.00023302421,0.0007830358,0.00018377737],"domain_scores_gemma":[0.9974542,0.0010492074,0.00032765133,0.00029234219,0.0006803281,0.00019613752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017009695,0.00040325912,0.00023982242,0.00071659527,0.0008592027,0.0011109435,0.00064789795,0.0004154132,0.0016377744],"category_scores_gemma":[0.007762887,0.0001489748,0.00015804995,0.0016401886,0.0005505334,0.0018465301,0.00077280257,0.0004288183,0.0005206182],"study_design_candidate":"bench_or_experimental","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.0013097541,0.00039429523,0.1381291,0.00070916215,0.00020144135,0.0012851804,0.0021488694,0.5822344,0.04533723,0.03872182,0.021396745,0.16813214],"study_design_scores_gemma":[0.000090633075,0.0011088031,0.11473822,0.000118776676,0.00012598251,0.0013144264,0.001575712,0.7600614,0.051966228,0.031530205,0.037230086,0.00013952293],"about_ca_topic_score_codex":0.006366957,"about_ca_topic_score_gemma":0.002683561,"teacher_disagreement_score":0.006366957,"about_ca_system_score_codex":0.0013444754,"about_ca_system_score_gemma":0.00071937154,"threshold_uncertainty_score":0.012659788},"labels":[],"label_agreement":null},{"id":"W113946067","doi":"","title":"One-to-many mappings represented on feed-forward networks.","year":2001,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.023366891930622344,"score_gpt":0.24549523529751077,"score_spread":0.22212834336688841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113946067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021438519,0.00040978033,0.9696228,0.00026851712,0.00010752291,0.00004336507,0.00022348404,0.00077018177,0.0071158237],"genre_scores_gemma":[0.6073597,0.0005573174,0.3777529,0.0001792485,0.00005617415,0.00015831892,0.0006080342,0.00008904887,0.013239249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961025,0.0001390781,0.000028583123,0.00008388919,0.0000938856,0.000044300607],"domain_scores_gemma":[0.99929607,0.00035511126,0.00006372479,0.00013476446,0.00012563441,0.000024663877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007431825,0.00086535537,0.00042328812,0.00050330535,0.00030622963,0.001287934,0.0010027995,0.0010127168,0.005583519],"category_scores_gemma":[0.0035023368,0.00028078113,0.00049536215,0.0008690954,0.0008039285,0.0021514988,0.00079357025,0.0009902178,0.000996217],"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.00026514308,0.000056704685,0.0009538063,0.0001676543,0.00006624956,0.00034512847,0.00014256455,0.61913615,0.0062763616,0.1526199,0.003120884,0.21684933],"study_design_scores_gemma":[0.0000057093744,0.00002890134,0.00013340173,0.000014650049,0.000009339779,0.00004596052,0.000013400209,0.93906504,0.0020208468,0.056139477,0.0025157009,0.000007472308],"about_ca_topic_score_codex":0.0033696168,"about_ca_topic_score_gemma":0.004095333,"teacher_disagreement_score":0.005583519,"about_ca_system_score_codex":0.0007708939,"about_ca_system_score_gemma":0.0005467747,"threshold_uncertainty_score":0.018678725},"labels":[],"label_agreement":null},{"id":"W115768707","doi":"","title":"Worst-case Behaviour of History Based Pivot Rules on Acyclic Unique Sink Orientations of Hypercubes","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McGill University","funders":"","keywords":"Directed acyclic graph; Hypercube; Digraph; Hamiltonian path; Sink (geography); Path (computing); Combinatorics; Mathematics; Computer science; Discrete mathematics; Graph","score_opus":0.05958933292467188,"score_gpt":0.24160419032653951,"score_spread":0.18201485740186762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115768707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.876492,0.0005874939,0.11572009,0.00030915617,0.00005712249,0.00014934217,0.0005015521,0.00054367294,0.0056395163],"genre_scores_gemma":[0.9730472,0.0001634515,0.025037052,0.0000502437,0.000015169643,0.000065600536,0.00044271018,0.00010951295,0.001068969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569845,0.0014602934,0.0003921644,0.0005545316,0.0009540793,0.000940522],"domain_scores_gemma":[0.92529553,0.055994313,0.0057288837,0.0076705874,0.002951513,0.0023591758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006561175,0.0007224711,0.0013179485,0.0013738791,0.0015997407,0.0021975415,0.0024093199,0.0014877418,0.0038086025],"category_scores_gemma":[0.04369766,0.0007306482,0.00092469563,0.0013730046,0.0024291824,0.0033452304,0.0013011495,0.0013245486,0.00035047453],"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.0011253075,0.00024780433,0.011743146,0.00024892468,0.00015220944,0.00043289474,0.00029448606,0.9014648,0.0048722145,0.03763852,0.002282885,0.039496727],"study_design_scores_gemma":[0.000081378756,0.00026029357,0.0011942604,0.000025386347,0.00005156411,0.00020101118,0.00020818102,0.9452453,0.005422367,0.04668455,0.00059103104,0.000034642875],"about_ca_topic_score_codex":0.0039589107,"about_ca_topic_score_gemma":0.004490616,"teacher_disagreement_score":0.006561175,"about_ca_system_score_codex":0.0016715752,"about_ca_system_score_gemma":0.0018021489,"threshold_uncertainty_score":0.0346992},"labels":[],"label_agreement":null},{"id":"W1185566510","doi":"","title":"CONDITIONAL MATCHING PRECLUSION FOR THE STAR GRAPHS","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Matching (statistics); Star (game theory); Graph; Discrete mathematics; Statistics","score_opus":0.026630135662144224,"score_gpt":0.2579758320319657,"score_spread":0.2313456963698215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1185566510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45928088,0.00076485454,0.49654034,0.0020984833,0.00012257442,0.0003461836,0.0013167352,0.00046086617,0.03906918],"genre_scores_gemma":[0.9086555,0.0005886051,0.08234028,0.00041517586,0.0001790176,0.0003139157,0.0012688676,0.00011480281,0.0061237277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981651,0.00041583125,0.00013135302,0.00056985614,0.00043097514,0.00028686936],"domain_scores_gemma":[0.99069595,0.0052331192,0.0012530001,0.0011218835,0.00077220576,0.000923722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016637993,0.0006107541,0.00086154527,0.0013877075,0.0015566117,0.0017691744,0.001646897,0.0013174746,0.0102075655],"category_scores_gemma":[0.015994191,0.00046649732,0.0010590864,0.00164465,0.0022937057,0.0054826066,0.002996083,0.0033047178,0.0007549364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057070993,0.00018100052,0.0036995602,0.0004324042,0.00006950628,0.00031386712,0.000452278,0.079295024,0.009188928,0.8302376,0.008548387,0.06701067],"study_design_scores_gemma":[0.000057126825,0.00011183737,0.001710226,0.000050878214,0.000034347446,0.00043605204,0.0001649997,0.18077946,0.0061628376,0.805053,0.0053934045,0.000045888817],"about_ca_topic_score_codex":0.0010060914,"about_ca_topic_score_gemma":0.00089474436,"teacher_disagreement_score":0.0102075655,"about_ca_system_score_codex":0.0014251276,"about_ca_system_score_gemma":0.0012603081,"threshold_uncertainty_score":0.03414768},"labels":[],"label_agreement":null},{"id":"W1215136999","doi":"","title":"On 3-restricted edge connectivity of Cartesian product graphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Enhanced Data Rates for GSM Evolution; Product (mathematics); Mathematics; Computer science; Combinatorics; Graph product; Discrete mathematics; Graph; 1-planar graph; Chordal graph; Geometry; Artificial intelligence","score_opus":0.0142915018899416,"score_gpt":0.23321566790385245,"score_spread":0.21892416601391085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1215136999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3557304,0.001031981,0.5285893,0.0005606312,0.000097676326,0.000092548136,0.0006576119,0.00044672954,0.11279312],"genre_scores_gemma":[0.9438958,0.00060359586,0.050154965,0.00018849786,0.00006410931,0.00010224844,0.0005058039,0.000079037774,0.0044059064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994618,0.00018698133,0.00003666089,0.00012138781,0.0001119219,0.00008128766],"domain_scores_gemma":[0.99856985,0.00075996306,0.00020869817,0.00018800459,0.00019321259,0.00008034499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940096,0.00038700693,0.00031753027,0.0010131969,0.0006797095,0.00085560675,0.0005967256,0.00063027407,0.008007058],"category_scores_gemma":[0.0024627983,0.00027232827,0.0003887068,0.00090077927,0.0012976998,0.0028924677,0.0010779353,0.000983856,0.0006872919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057824527,0.000017272921,0.00068070233,0.00010933139,0.000012240979,0.00046855805,0.00042285866,0.007178708,0.004177129,0.97359776,0.0015659863,0.011711657],"study_design_scores_gemma":[0.000018939056,0.000060084396,0.0015524976,0.00008021317,0.000039075963,0.001372281,0.00036323824,0.045866586,0.0031866545,0.9334854,0.013940075,0.000034926667],"about_ca_topic_score_codex":0.0007511074,"about_ca_topic_score_gemma":0.001015421,"teacher_disagreement_score":0.008007058,"about_ca_system_score_codex":0.0003469227,"about_ca_system_score_gemma":0.00020554595,"threshold_uncertainty_score":0.026786268},"labels":[],"label_agreement":null},{"id":"W127268912","doi":"10.1007/978-1-4419-6193-8_8","title":"System Level Exploration for the Integration of Optical Networks on Chip in 3D MPSoC Architectures","year":2012,"lang":"en","type":"book-chapter","venue":"Embedded systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada); Polytechnique Montréal","funders":"","keywords":"MPSoC; System on a chip; Computer architecture; Design space exploration; Computer science; Three-dimensional integrated circuit; Interconnection; Design flow; Throughput; Context (archaeology); Embedded system; Network on a chip; Chip; Routing (electronic design automation); Telecommunications","score_opus":0.08055830894233974,"score_gpt":0.27153006060879287,"score_spread":0.19097175166645314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127268912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14503,0.019624516,0.64173836,0.00121078,0.00053926796,0.00011707721,0.00025126745,0.00201076,0.18947807],"genre_scores_gemma":[0.59955335,0.011551919,0.3406568,0.0003303322,0.00017186359,0.0001545657,0.00033314564,0.000428427,0.04681957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998988,0.0000122396095,0.0000029961832,0.000010942946,0.000059068272,0.000015916032],"domain_scores_gemma":[0.9999286,0.00003165886,0.000006630401,0.00001182988,0.0000165864,0.0000047025687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015350251,0.00040173315,0.00027758678,0.00021071342,0.00030836012,0.000901387,0.00052312354,0.00044121908,0.0051553664],"category_scores_gemma":[0.0002600054,0.00031236644,0.0004365882,0.00027147355,0.0003110728,0.0009146058,0.0005228454,0.00088572054,0.0006978329],"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.00015047376,0.00012299631,0.00076821825,0.0013745759,0.00011284019,0.00036534012,0.0005324282,0.20964226,0.23045431,0.31656435,0.009055737,0.23085646],"study_design_scores_gemma":[0.000021655685,0.00023913407,0.0007667119,0.00024080352,0.00007430174,0.00037237635,0.000119764416,0.66078544,0.08200306,0.1236095,0.13171908,0.00004822588],"about_ca_topic_score_codex":0.00053814333,"about_ca_topic_score_gemma":0.0012069057,"teacher_disagreement_score":0.0051553664,"about_ca_system_score_codex":0.00059814093,"about_ca_system_score_gemma":0.00043383098,"threshold_uncertainty_score":0.017246366},"labels":[],"label_agreement":null},{"id":"W135324672","doi":"","title":"{K (1, 3) , Z 2 }-Free Graphs of Low Connectivity.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010826840453081158,"score_gpt":0.22267370441509307,"score_spread":0.2118468639620119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135324672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7501452,0.0010081044,0.08992382,0.0028464857,0.00023835398,0.00010634709,0.003218795,0.0012275744,0.15128542],"genre_scores_gemma":[0.95695627,0.00031095694,0.014595804,0.00040616075,0.00004552988,0.00007632029,0.0017214855,0.000115144416,0.025772305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997557,0.0000535446,0.000012108117,0.00005015756,0.000042230175,0.00008628275],"domain_scores_gemma":[0.9986092,0.0006063097,0.00028572822,0.00015069704,0.00012940238,0.0002186588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019417779,0.0003500481,0.00035562165,0.0010453565,0.0013082119,0.0015065644,0.00077125133,0.0007307686,0.014479779],"category_scores_gemma":[0.0018708523,0.00034217647,0.00027742248,0.0007672394,0.0007747355,0.001731196,0.0010379426,0.0010448208,0.0015331928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054566027,0.00009218825,0.0022584337,0.00037867896,0.00006675296,0.0007528238,0.0003845937,0.0079714935,0.015132972,0.9097896,0.030789481,0.03183728],"study_design_scores_gemma":[0.00009486451,0.000059565227,0.0031301172,0.00007350485,0.000056359033,0.00068994315,0.00025930276,0.015165974,0.00589788,0.95111114,0.023421254,0.000040106457],"about_ca_topic_score_codex":0.0014429999,"about_ca_topic_score_gemma":0.0034174884,"teacher_disagreement_score":0.014479779,"about_ca_system_score_codex":0.00069393375,"about_ca_system_score_gemma":0.0004713044,"threshold_uncertainty_score":0.04843968},"labels":[],"label_agreement":null},{"id":"W141638915","doi":"","title":"Minimum Average Broadcast Time in a Graph of Bounded Degree.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Bounded function; Graph; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.01643793209246781,"score_gpt":0.22748849478388355,"score_spread":0.21105056269141576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141638915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7020487,0.0023660327,0.27026558,0.0029194988,0.00020986819,0.000114702336,0.0037888866,0.002069546,0.016217045],"genre_scores_gemma":[0.95816773,0.0005919854,0.03512391,0.00013049295,0.00011269275,0.000092710914,0.0010996514,0.00038097918,0.004299813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990866,0.00025649596,0.000050032868,0.00022532094,0.00015308145,0.00022850784],"domain_scores_gemma":[0.98587984,0.00994598,0.001294513,0.0010289359,0.00093620917,0.00091446436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012050465,0.0006570212,0.001355869,0.0010799567,0.000972197,0.0020912685,0.002135525,0.0012848531,0.0045426176],"category_scores_gemma":[0.012243408,0.00046251365,0.00041776197,0.0011697081,0.0007234973,0.0031085517,0.0007704103,0.00095036323,0.0006662999],"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.0045341463,0.00035476199,0.0054772473,0.0017413023,0.00034534401,0.00037639093,0.000880828,0.6073936,0.051914938,0.19905335,0.026182089,0.10174594],"study_design_scores_gemma":[0.00024831796,0.00030979028,0.002214303,0.000073685645,0.00016597843,0.0003673764,0.0002381071,0.83052695,0.011042681,0.15122852,0.0035483507,0.000035919227],"about_ca_topic_score_codex":0.0026139016,"about_ca_topic_score_gemma":0.005711962,"teacher_disagreement_score":0.0045426176,"about_ca_system_score_codex":0.0019660222,"about_ca_system_score_gemma":0.0013344772,"threshold_uncertainty_score":0.015196562},"labels":[],"label_agreement":null},{"id":"W1482741084","doi":"","title":"Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Implementation; Telecommunications; Quality (philosophy); Process (computing); Work (physics); Software-defined networking; Library science; Engineering management; Software engineering; Engineering; Computer network; Operating system","score_opus":0.04620767349521079,"score_gpt":0.2535491729286818,"score_spread":0.207341499433471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482741084","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014781219,0.068135016,0.18976118,0.021355344,0.13339013,0.002008334,0.0042837393,0.010552257,0.55573285],"genre_scores_gemma":[0.038763355,0.03825449,0.06798804,0.003749259,0.013510603,0.0010418164,0.010086539,0.0015912886,0.8250146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847203,0.00031554862,0.00012359643,0.00018217934,0.0007516063,0.00015499361],"domain_scores_gemma":[0.99712354,0.00033548803,0.000097965174,0.0004125916,0.0014103522,0.00062001334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025593208,0.0015548066,0.0012769671,0.0009789864,0.0009236222,0.003798205,0.0013727766,0.001506112,0.09294275],"category_scores_gemma":[0.0035551905,0.00048639465,0.00068517495,0.0008351758,0.0006252585,0.0024187877,0.0017158312,0.0035261735,0.06426638],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00018917088,0.0001775324,0.0010051994,0.00031707544,0.00007255697,0.00013452464,0.000117112904,0.0008128704,0.0046320315,0.008149433,0.74883825,0.23555426],"study_design_scores_gemma":[0.000017171042,0.00007532847,0.0007527433,0.0001262299,0.000024701314,0.0001547789,0.000052541374,0.0032379748,0.0007713793,0.002360279,0.992411,0.000015834794],"about_ca_topic_score_codex":0.002442614,"about_ca_topic_score_gemma":0.0035419383,"teacher_disagreement_score":0.09294275,"about_ca_system_score_codex":0.00085244974,"about_ca_system_score_gemma":0.0024629626,"threshold_uncertainty_score":0.31092447},"labels":[],"label_agreement":null},{"id":"W1483333409","doi":"10.1002/9780470986424.ch10","title":"Cluster Interconnection with Slave‐Slave Bridges","year":2008,"lang":"en","type":"other","venue":"","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 Manitoba","funders":"","keywords":"Bridge (graph theory); Markov chain; Computer science; Interconnection; Cluster (spacecraft); Network packet; Computer network; Engineering; Medicine","score_opus":0.01013785139219004,"score_gpt":0.20722790009134093,"score_spread":0.1970900486991509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483333409","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24481007,0.00041540313,0.69184697,0.0005352726,0.00025031465,0.00019405397,0.00031293597,0.0036026493,0.05803233],"genre_scores_gemma":[0.92017925,0.00023937224,0.051641893,0.00008935589,0.000043915723,0.00014361984,0.00032331728,0.00017358788,0.02716568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977964,0.00004736769,0.000009256642,0.00005001656,0.00006331513,0.000050434763],"domain_scores_gemma":[0.99973065,0.00007934045,0.000015056825,0.000084692016,0.000068868176,0.000021413025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287049,0.00025284835,0.00036034553,0.00022032742,0.00063567,0.00080590654,0.0006869095,0.0002919927,0.007350077],"category_scores_gemma":[0.0006818417,0.0002557159,0.00034696786,0.00043167284,0.0002585733,0.0008560206,0.00066722895,0.0004267817,0.00090727216],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043219037,0.00016925795,0.0025774124,0.00013063921,0.00008942545,0.00015910172,0.00029275595,0.6647134,0.020698907,0.16167448,0.018998088,0.13006434],"study_design_scores_gemma":[0.000022291182,0.00004996129,0.0005336416,0.000007113949,0.000013106797,0.00003532378,0.000037502556,0.97205997,0.0042392905,0.015687156,0.0073049422,0.000009687498],"about_ca_topic_score_codex":0.003933548,"about_ca_topic_score_gemma":0.007128212,"teacher_disagreement_score":0.007350077,"about_ca_system_score_codex":0.00095987215,"about_ca_system_score_gemma":0.0009094523,"threshold_uncertainty_score":0.024588466},"labels":[],"label_agreement":null},{"id":"W1485948868","doi":"10.1109/ipps.1991.153804","title":"Bounds on performance of VLSI processor arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Carleton University","funders":"","keywords":"Reconfigurability; Very-large-scale integration; Computer science; Generalization; Computation; Parallel computing; Embedded system; Computer engineering; Algorithm; Mathematics; Operating system","score_opus":0.02239197252597379,"score_gpt":0.20568765272835993,"score_spread":0.18329568020238612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485948868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35534292,0.017842665,0.552422,0.004031012,0.00050691847,0.0000622107,0.00053080695,0.0033109535,0.06595057],"genre_scores_gemma":[0.9708935,0.0037772495,0.020976812,0.00031013106,0.0002655058,0.000104448525,0.00030719835,0.0003296282,0.0030355235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970994,0.00052171765,0.0001532372,0.00036657712,0.0013733893,0.00048573583],"domain_scores_gemma":[0.9813265,0.013484633,0.00112019,0.0018265467,0.0017808757,0.0004612155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017349272,0.0009972004,0.00074495975,0.0008669726,0.00054701325,0.0019258994,0.0009802488,0.001243609,0.0031360013],"category_scores_gemma":[0.024132617,0.00041661144,0.00024429336,0.001166924,0.0017260045,0.0036379478,0.0015998969,0.0015606885,0.0009103817],"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.0007713903,0.00008999821,0.0025741921,0.00056411175,0.00006462699,0.00029350127,0.00018140167,0.69521236,0.051599994,0.1757286,0.0044138134,0.068506055],"study_design_scores_gemma":[0.000055580225,0.00044403796,0.0014359504,0.00016397198,0.000040163904,0.0003195939,0.00006973509,0.8056217,0.036905207,0.14752467,0.007361593,0.000057916615],"about_ca_topic_score_codex":0.00046061008,"about_ca_topic_score_gemma":0.00028703082,"teacher_disagreement_score":0.0031360013,"about_ca_system_score_codex":0.0010198803,"about_ca_system_score_gemma":0.0006467489,"threshold_uncertainty_score":0.0104910135},"labels":[],"label_agreement":null},{"id":"W148728774","doi":"","title":"Massive parallel processing for matrix multiplication: a systolic approach","year":2001,"lang":"en","type":"book","venue":"WIT Press eBooks","topic":"Interconnection Networks and Systems","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":"Trent University","funders":"","keywords":"Systolic array; Matrix multiplication; Multiplication (music); Representation (politics); Computer science; Matrix (chemical analysis); Isolated systolic hypertension; Matrix representation; Systolic hypertension; Parallel computing; Arithmetic; Algorithm; Mathematics; Blood pressure; Internal medicine; Combinatorics; Medicine; Materials science; Very-large-scale integration; Physics; Group (periodic table); Embedded system","score_opus":0.04272778698264719,"score_gpt":0.27291233169300366,"score_spread":0.2301845447103565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148728774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046930495,0.0035147606,0.96477413,0.00031203395,0.00030615283,0.000055422122,0.000059772243,0.0011493351,0.025135301],"genre_scores_gemma":[0.045024805,0.006857777,0.92126906,0.00023792115,0.0003252294,0.00013912961,0.00021889767,0.00024649236,0.025680749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983096,0.000026724305,0.000011456465,0.000025258087,0.00009369057,0.000011847772],"domain_scores_gemma":[0.9998578,0.000055099445,0.000007861976,0.000020483165,0.00005022946,0.000008581037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002521771,0.0005626394,0.00026893808,0.00032110637,0.0003210442,0.0008379787,0.00057626946,0.00037895728,0.006803825],"category_scores_gemma":[0.00047662036,0.00023542048,0.0003898054,0.00060665194,0.0004219112,0.0007957136,0.00033920817,0.00076570845,0.0029357404],"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.00007218507,0.000065244996,0.00029556753,0.00061013625,0.000045966794,0.00015655119,0.0002821401,0.031911235,0.0643242,0.3019359,0.016138887,0.5841619],"study_design_scores_gemma":[0.000060627255,0.00047958439,0.00050305424,0.0002714797,0.00009819139,0.0008705446,0.00012362064,0.21179412,0.06443208,0.19457687,0.5267429,0.000046939003],"about_ca_topic_score_codex":0.00026017925,"about_ca_topic_score_gemma":0.00075001584,"teacher_disagreement_score":0.006803825,"about_ca_system_score_codex":0.00030961356,"about_ca_system_score_gemma":0.00067338883,"threshold_uncertainty_score":0.022760987},"labels":[],"label_agreement":null},{"id":"W1494296452","doi":"10.1007/978-1-4613-0281-0_6","title":"Nonblocking Routing Properties of Clos Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Network theory and applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Clos network; Computer network; Computer science; Routing (electronic design automation); Transmission (telecommunications); Set (abstract data type); Process (computing); Distributed computing; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering; Operating system","score_opus":0.017446874642825693,"score_gpt":0.21088851298380426,"score_spread":0.19344163834097858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494296452","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17127289,0.011385782,0.40435567,0.0017853951,0.0009872693,0.00011709928,0.0004851251,0.00072781753,0.40888298],"genre_scores_gemma":[0.9119563,0.009435618,0.031451136,0.00034186602,0.0007596652,0.00016477949,0.00037921354,0.00033559327,0.045175795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996979,0.00003966902,0.00001584886,0.00004726946,0.0001645898,0.000034762164],"domain_scores_gemma":[0.99894005,0.0005973182,0.00008380912,0.000114206174,0.00021123208,0.000053372805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035785485,0.0004527779,0.00029730267,0.000670607,0.00059512793,0.0015968789,0.0006276721,0.0003302695,0.0038414253],"category_scores_gemma":[0.0016713606,0.00029331914,0.00024200337,0.0007076663,0.0006876169,0.0018173954,0.000511409,0.0009807103,0.0004316603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013770656,0.000054152817,0.00037363105,0.00035316718,0.000016548483,0.00018736758,0.00027794688,0.014060458,0.030893782,0.8616243,0.006848998,0.08517196],"study_design_scores_gemma":[0.000029769642,0.00008568209,0.00085082185,0.000059207792,0.000031845128,0.00053652626,0.00014202614,0.068758585,0.015878145,0.8707491,0.042849705,0.000028588098],"about_ca_topic_score_codex":0.0006641317,"about_ca_topic_score_gemma":0.00073294254,"teacher_disagreement_score":0.0038414253,"about_ca_system_score_codex":0.0007848473,"about_ca_system_score_gemma":0.0004821405,"threshold_uncertainty_score":0.012850881},"labels":[],"label_agreement":null},{"id":"W1496822384","doi":"10.1007/978-3-540-27810-8_15","title":"Connectivity of Graphs Under Edge Flips","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Disjoint sets; Vertex (graph theory); Planar graph; Mathematics; Graph; Discrete mathematics","score_opus":0.02026367846141447,"score_gpt":0.2386009472908872,"score_spread":0.21833726882947274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496822384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75902754,0.0013736944,0.12354773,0.0018397821,0.000280316,0.0001224246,0.0008509321,0.0004906724,0.11246687],"genre_scores_gemma":[0.9712804,0.0014339752,0.012686767,0.00019593623,0.0002638205,0.00011725108,0.00062695076,0.000117615506,0.013277276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996984,0.00007556294,0.000012989963,0.00007090307,0.00007809372,0.00006416094],"domain_scores_gemma":[0.99842644,0.00082409376,0.0002596197,0.00018141996,0.0001736651,0.00013487338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033461978,0.00033974313,0.0004906146,0.001357097,0.0008324466,0.0013871018,0.00061769114,0.0008102943,0.0051788576],"category_scores_gemma":[0.0030218645,0.00033026512,0.00043491359,0.001186045,0.0013255494,0.00212843,0.000878959,0.001074006,0.00038104155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002516554,0.00004167745,0.0011302866,0.00018876702,0.000026165288,0.00046592255,0.0005703294,0.02294447,0.0070160613,0.9185745,0.007575074,0.04121498],"study_design_scores_gemma":[0.000041947904,0.00005515831,0.001068443,0.00003725953,0.00002304471,0.00040714943,0.00017425735,0.025469065,0.0016974587,0.9667136,0.004297424,0.000015093801],"about_ca_topic_score_codex":0.00055924273,"about_ca_topic_score_gemma":0.00046779602,"teacher_disagreement_score":0.0051788576,"about_ca_system_score_codex":0.0004123187,"about_ca_system_score_gemma":0.00026789756,"threshold_uncertainty_score":0.017325044},"labels":[],"label_agreement":null},{"id":"W1498511021","doi":"10.1109/estmed.2004.1359697","title":"A queuing-theoretic performance model for context-flow system-on-chip platforms","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; Queueing theory; Context (archaeology); System on a chip; Instruction set; Computer architecture; Chip; Embedded system; Distributed computing; Parallel computing; Computer network","score_opus":0.0207526574376069,"score_gpt":0.22419774891860067,"score_spread":0.20344509148099377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498511021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031557366,0.0008233538,0.9547821,0.0006950325,0.00011511137,0.00016971747,0.00028498788,0.0007626125,0.010809655],"genre_scores_gemma":[0.85605395,0.0018904568,0.12777576,0.00038731235,0.00022306008,0.0005986826,0.00034537385,0.00028711054,0.012438362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915934,0.00023228355,0.00004771722,0.0001216484,0.00029261582,0.00014635792],"domain_scores_gemma":[0.99915206,0.00043283915,0.00007555427,0.000087883695,0.00020514446,0.000046576635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011986381,0.0009844603,0.0007855742,0.000818729,0.00066567695,0.0014370189,0.0019533955,0.0013712954,0.0028256476],"category_scores_gemma":[0.00390841,0.0004515234,0.0005970229,0.00085489725,0.00096625194,0.0022822623,0.00066262134,0.0013844485,0.0008184193],"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.000027497394,0.000027640128,0.0001792026,0.000038542865,0.000010225239,0.000052450196,0.000049652313,0.9035908,0.0017172552,0.089354575,0.00077266677,0.0041795373],"study_design_scores_gemma":[0.0000025859497,0.000010596228,0.000027248045,0.000003086641,0.000003481502,0.000008033732,0.0000039090605,0.9920854,0.0001492276,0.007159296,0.000542987,0.000004099013],"about_ca_topic_score_codex":0.008086754,"about_ca_topic_score_gemma":0.0036454725,"teacher_disagreement_score":0.008086754,"about_ca_system_score_codex":0.0020563095,"about_ca_system_score_gemma":0.002012879,"threshold_uncertainty_score":0.016079366},"labels":[],"label_agreement":null},{"id":"W1499845837","doi":"10.1007/978-3-642-25011-8_26","title":"Hamilton Cycles in Restricted Rotator Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Notation; Graph; Computer science; Cayley graph; Discrete mathematics; Hamiltonian path; Mathematics; Arithmetic","score_opus":0.02086592338687279,"score_gpt":0.23152830313070044,"score_spread":0.21066237974382765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499845837","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3659005,0.007376483,0.23922238,0.0010237884,0.00072655577,0.00031973806,0.0008589468,0.00096722844,0.38360432],"genre_scores_gemma":[0.79988885,0.006695352,0.058121692,0.00045642856,0.00038177698,0.0004374084,0.0010278461,0.00047595816,0.13251464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980265,0.00006180752,0.000011080496,0.000041953608,0.000049125087,0.000033471115],"domain_scores_gemma":[0.9996025,0.00018908684,0.000056856632,0.00005491323,0.00005401462,0.000042732056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018602062,0.000488656,0.0005437904,0.0010306804,0.00067597395,0.0009516834,0.0006965602,0.00052571815,0.009579412],"category_scores_gemma":[0.0010772962,0.00048382604,0.0004251054,0.001224519,0.000761624,0.0012667859,0.0006911423,0.0008204041,0.0013075449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087480796,0.00003128423,0.00018016623,0.0002690438,0.000023570883,0.00016518074,0.00027029423,0.008830029,0.0048447736,0.93079156,0.007943919,0.046562646],"study_design_scores_gemma":[0.000040427374,0.000040983105,0.00024584308,0.000040979117,0.000019703102,0.00017106695,0.00009129932,0.012078459,0.0011396493,0.9696305,0.016481418,0.000019627225],"about_ca_topic_score_codex":0.0010313729,"about_ca_topic_score_gemma":0.0016979252,"teacher_disagreement_score":0.009579412,"about_ca_system_score_codex":0.00047268294,"about_ca_system_score_gemma":0.0003360507,"threshold_uncertainty_score":0.032046378},"labels":[],"label_agreement":null},{"id":"W1502190774","doi":"10.1007/3-540-40996-3_32","title":"Deterministic Broadcasting Time with Partial Knowledge of the Network","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","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":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); RADIUS; Computer network; Point-to-point; Network topology; Graph; Point (geometry); Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics; Physics","score_opus":0.012879428475081847,"score_gpt":0.22157744543605767,"score_spread":0.20869801696097584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502190774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18701075,0.003175217,0.79124486,0.0028947871,0.00013886765,0.00028132176,0.0010511581,0.002142733,0.012060347],"genre_scores_gemma":[0.8458474,0.0016230559,0.14700371,0.00025895837,0.00016944078,0.000332685,0.0007474018,0.00044109454,0.0035761998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961777,0.00071745407,0.00024370148,0.0010087293,0.00092235574,0.00093005894],"domain_scores_gemma":[0.9590452,0.033943236,0.0022144304,0.0024284695,0.0013346494,0.0010340739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043591154,0.0013014346,0.0021260737,0.0013442873,0.0016131104,0.004056004,0.003682499,0.0021926465,0.003437279],"category_scores_gemma":[0.033497304,0.0010807938,0.001130578,0.0024561665,0.002538206,0.007539031,0.002355055,0.0019675957,0.0005414635],"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.0011878395,0.00012327694,0.0023522219,0.0005562301,0.00011186364,0.00022072332,0.0004881797,0.88466465,0.0061977403,0.06353281,0.0026448898,0.03791959],"study_design_scores_gemma":[0.00006983175,0.00008951102,0.00036436238,0.000030744424,0.00005778924,0.00011596364,0.0000817725,0.9588198,0.0021077844,0.037105102,0.0011345708,0.000022709937],"about_ca_topic_score_codex":0.008448982,"about_ca_topic_score_gemma":0.00498802,"teacher_disagreement_score":0.008448982,"about_ca_system_score_codex":0.005487156,"about_ca_system_score_gemma":0.0050624474,"threshold_uncertainty_score":0.039812326},"labels":[],"label_agreement":null},{"id":"W150449192","doi":"10.1007/978-3-642-21378-6_18","title":"Computer Network Reverse Engineering","year":2011,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Reverse engineering; Computer science; Snapshot (computer storage); Software; Network topology; Software engineering; Distributed computing; Data mining; Computer network; Operating system","score_opus":0.09650519901681874,"score_gpt":0.29552542246617425,"score_spread":0.1990202234493555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150449192","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062218285,0.01383772,0.30515715,0.0035685636,0.0028070146,0.00017043824,0.00024123759,0.0011799452,0.66681606],"genre_scores_gemma":[0.11271783,0.025987472,0.13821463,0.0015949288,0.0013522255,0.00020302214,0.0009351951,0.0011589037,0.7178358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950385,0.00009067785,0.0000186813,0.00009296269,0.00025488096,0.000038928636],"domain_scores_gemma":[0.999206,0.00022859727,0.00002946141,0.00034620415,0.00016628965,0.000023471934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006034611,0.00065405644,0.00037402092,0.0010450836,0.00064988,0.001764458,0.00089636905,0.00088508654,0.028265875],"category_scores_gemma":[0.0020523437,0.00040318488,0.0004111173,0.001055734,0.0011568828,0.0030588764,0.0012215152,0.0022515624,0.008578767],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019841027,0.000044007575,0.00013868789,0.00021516456,0.000015741083,0.00013006982,0.00013573914,0.0068124915,0.0021982864,0.53979105,0.08668398,0.363815],"study_design_scores_gemma":[0.000008093285,0.00002616576,0.00014611025,0.00014296414,0.00001599693,0.0006042587,0.00007018313,0.013304271,0.00578398,0.23565893,0.7442249,0.000014146486],"about_ca_topic_score_codex":0.0010964903,"about_ca_topic_score_gemma":0.0016942766,"teacher_disagreement_score":0.028265875,"about_ca_system_score_codex":0.0009462706,"about_ca_system_score_gemma":0.0008552774,"threshold_uncertainty_score":0.094558716},"labels":[],"label_agreement":null},{"id":"W1505362665","doi":"10.1016/s0167-739x(99)00128-4","title":"Buffer management in wormhole-routed torus multicomputer networks","year":2000,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Computer science; Buffer (optical fiber); Wormhole; Computer network; Distributed computing; Telecommunications","score_opus":0.010952791760047695,"score_gpt":0.20869628093321146,"score_spread":0.19774348917316376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505362665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491202,0.003992551,0.49183673,0.0012649756,0.00046395874,0.00011741559,0.00026613096,0.0023197185,0.008536481],"genre_scores_gemma":[0.98180217,0.00035969654,0.015320278,0.000060590755,0.000038718623,0.000030370285,0.000060219136,0.000049698963,0.002278305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963534,0.000103809485,0.00002800477,0.000077280296,0.000067658504,0.00008788236],"domain_scores_gemma":[0.9986791,0.00066687417,0.00018366853,0.00015660384,0.00023261228,0.000081062346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008460782,0.00031355963,0.00057835685,0.0008376325,0.0008146992,0.0013965301,0.0015256614,0.0005826531,0.0014944053],"category_scores_gemma":[0.0032456766,0.00030698764,0.00014811275,0.00068935397,0.00051828596,0.00214627,0.0007989667,0.00036987144,0.00016769927],"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.0020451155,0.00029140932,0.003028824,0.0003854752,0.00012245768,0.00046438116,0.00058236835,0.66891146,0.056598302,0.08617738,0.010376765,0.1710161],"study_design_scores_gemma":[0.00003631397,0.00013160198,0.0002976126,0.0000121962385,0.000039762854,0.000090765236,0.00009011483,0.9697276,0.011261428,0.016195204,0.0020970474,0.000020430798],"about_ca_topic_score_codex":0.0019151142,"about_ca_topic_score_gemma":0.0022022338,"teacher_disagreement_score":0.0019151142,"about_ca_system_score_codex":0.0008468626,"about_ca_system_score_gemma":0.00060702726,"threshold_uncertainty_score":0.006144464},"labels":[],"label_agreement":null},{"id":"W1505544684","doi":"10.1109/pacrim.1993.407199","title":"A 1.2 μm CMOS deadlock-free router for hypercycle networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Deadlock; Router; Computer science; Interconnection; Routing (electronic design automation); Network on a chip; CMOS; Fault tolerance; Parallel computing; Throughput; Routing algorithm; Chip; Topology (electrical circuits); Computer network; Distributed computing; Engineering; Routing protocol; Electrical engineering; Telecommunications","score_opus":0.02487616174122195,"score_gpt":0.20718368286972466,"score_spread":0.1823075211285027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505544684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06407769,0.003001819,0.89118636,0.0012238943,0.00037821432,0.0002571851,0.00016401774,0.0019421139,0.037768636],"genre_scores_gemma":[0.48711735,0.0017414378,0.48377421,0.0005604924,0.000109414446,0.00027381527,0.00018178554,0.00013571071,0.026105775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988246,0.000032945583,0.0000053048043,0.000022428618,0.000038514423,0.000018232267],"domain_scores_gemma":[0.99988973,0.000036827685,0.000013052459,0.000014680144,0.00003327142,0.000012401051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016688829,0.00040273624,0.00030045674,0.00030196123,0.000526252,0.0006940343,0.0008215189,0.000724007,0.0035726046],"category_scores_gemma":[0.00043490942,0.00017846945,0.00033430886,0.00025595663,0.00025872572,0.0009163666,0.0003196007,0.00038423456,0.0005875662],"study_design_candidate":"bench_or_experimental","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.0002457667,0.00017505501,0.0010422001,0.00050691585,0.00013469461,0.0009880894,0.00018767043,0.36903462,0.103821285,0.3296514,0.017869508,0.17634276],"study_design_scores_gemma":[0.00006484216,0.00039535385,0.00049133704,0.00005515593,0.00009027152,0.000648341,0.00006473534,0.8558164,0.036857326,0.042858213,0.06260413,0.00005390934],"about_ca_topic_score_codex":0.00083579327,"about_ca_topic_score_gemma":0.0019904939,"teacher_disagreement_score":0.0035726046,"about_ca_system_score_codex":0.00082658563,"about_ca_system_score_gemma":0.00048312204,"threshold_uncertainty_score":0.011951566},"labels":[],"label_agreement":null},{"id":"W1509547215","doi":"10.1023/a:1011454709330","title":"A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; University of Toronto; University of Saskatchewan","keywords":"Computer science; Hypercube; Node (physics); Routing (electronic design automation); Fault tolerance; Path (computing); Fault (geology); Routing algorithm; Adaptive routing; Algorithm; Parallel computing; Distributed computing; Computer network; Link-state routing protocol; Routing protocol","score_opus":0.018128057815828175,"score_gpt":0.2501036426428538,"score_spread":0.2319755848270256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509547215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05733782,0.000657031,0.93535775,0.00034903744,0.00024360884,0.0001963171,0.000073268006,0.0010429878,0.004742239],"genre_scores_gemma":[0.4559712,0.00034366766,0.53881603,0.00016011657,0.00007598197,0.00024282782,0.0002131904,0.00011125465,0.004065647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999731,0.00008427437,0.000013285287,0.00003547794,0.000093842245,0.000042227683],"domain_scores_gemma":[0.9994293,0.00021635236,0.000058542602,0.00008124061,0.00017012247,0.000044433727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921735,0.00042507867,0.0007654743,0.0008261753,0.0008388746,0.0006569358,0.001531143,0.0008206555,0.0021973546],"category_scores_gemma":[0.0018898452,0.00038381136,0.00030015956,0.00093252043,0.0004627791,0.0010257981,0.00075785565,0.0004626801,0.00027132037],"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.000467193,0.00016902255,0.00079899403,0.0001701675,0.000088921624,0.00009159131,0.00010091104,0.6612029,0.008177295,0.020128205,0.0051933825,0.30341133],"study_design_scores_gemma":[0.000055888173,0.00008243274,0.00012985904,0.000007231891,0.000018173552,0.00003738114,0.000020691094,0.9914437,0.0015238385,0.005264136,0.0014048022,0.000011745437],"about_ca_topic_score_codex":0.002962881,"about_ca_topic_score_gemma":0.0046276967,"teacher_disagreement_score":0.002962881,"about_ca_system_score_codex":0.0006346633,"about_ca_system_score_gemma":0.0010521219,"threshold_uncertainty_score":0.007350862},"labels":[],"label_agreement":null},{"id":"W1510991112","doi":"10.1109/glocom.1994.513565","title":"Analysis and simulation of the buffered-expanded delta fast packet switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"Government of Canada; Australian Government","keywords":"Interleaving; Computer science; Burst switching; Throughput; Packet switching; Network packet; LAN switching; Crossover switch; Node (physics); Cut-through switching; Computer network; Fast packet switching; Circuit switching; Topology (electrical circuits); Value (mathematics); Real-time computing; Transmission delay; Crossbar switch; Processing delay; Physics; Electrical engineering; Engineering; Operating system; Telecommunications","score_opus":0.01933030494953714,"score_gpt":0.23171034678671953,"score_spread":0.2123800418371824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510991112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8497427,0.00034830603,0.108944416,0.00048360042,0.00006785549,0.00010403779,0.0007611379,0.00083238847,0.038715597],"genre_scores_gemma":[0.99170554,0.00010575985,0.0051182187,0.00002869396,0.0000060743228,0.000047376205,0.00016520661,0.00003128418,0.0027918767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982446,0.000039779137,0.000005500402,0.000021895006,0.000052504656,0.000055829067],"domain_scores_gemma":[0.9995834,0.00023513303,0.000045927205,0.000019349107,0.000087622306,0.00002860933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032775174,0.00039537027,0.00045973167,0.0004318404,0.0004140123,0.0005774001,0.00074973254,0.0007113514,0.003528812],"category_scores_gemma":[0.0011001916,0.00025111448,0.0004133839,0.00036736988,0.00054784754,0.0004881153,0.00033998207,0.0004300796,0.00022842173],"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.00005217331,0.00002126715,0.0007447555,0.000017436549,0.000008163793,0.00008679077,0.000030037141,0.9933537,0.002024829,0.0023927288,0.00019351821,0.0010746081],"study_design_scores_gemma":[0.0000036579852,0.000011520129,0.0001064095,0.0000012580933,0.0000019521872,0.0000042062898,0.0000044926282,0.9993656,0.0002521059,0.00016609019,0.00008118564,0.0000014883856],"about_ca_topic_score_codex":0.016629476,"about_ca_topic_score_gemma":0.0061326716,"teacher_disagreement_score":0.016629476,"about_ca_system_score_codex":0.0011218565,"about_ca_system_score_gemma":0.0009100707,"threshold_uncertainty_score":0.03306538},"labels":[],"label_agreement":null},{"id":"W151120489","doi":"","title":"2-Reducible paths containing a specified edge in (2k+1)-edge-connected graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.02159210417045681,"score_gpt":0.2407699990500419,"score_spread":0.21917789487958508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151120489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7592529,0.0010318272,0.09810003,0.0012680499,0.0003309039,0.00028818933,0.0043557477,0.0012871876,0.13408512],"genre_scores_gemma":[0.91289216,0.00066917995,0.047909968,0.00028616146,0.00006031299,0.00024328119,0.00383953,0.00023544996,0.033863965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934644,0.00013392435,0.000051164618,0.00014646981,0.00012282746,0.00019924759],"domain_scores_gemma":[0.998502,0.00058727764,0.00027664122,0.0003528496,0.00013411717,0.00014712861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036463403,0.00067847106,0.0005413252,0.00097455346,0.0017995106,0.002011589,0.00092299056,0.0012358851,0.012687144],"category_scores_gemma":[0.002467721,0.0005903302,0.00083547906,0.00096629193,0.0011145057,0.0023919016,0.0016646279,0.0012890521,0.0024629917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001508983,0.0003666776,0.0049391463,0.001123493,0.00016647362,0.005709013,0.0021652535,0.032374296,0.028360326,0.78551066,0.02193854,0.11583711],"study_design_scores_gemma":[0.00013829296,0.00016046841,0.0033947325,0.00023126297,0.00010323741,0.0033658757,0.00089194614,0.01846684,0.020852135,0.9200219,0.032294482,0.00007884537],"about_ca_topic_score_codex":0.00096401566,"about_ca_topic_score_gemma":0.0020441525,"teacher_disagreement_score":0.012687144,"about_ca_system_score_codex":0.0006851197,"about_ca_system_score_gemma":0.0007192889,"threshold_uncertainty_score":0.04244274},"labels":[],"label_agreement":null},{"id":"W1511954377","doi":"10.1109/mwscas.1998.759431","title":"A VLSI switch architecture for broadband satellite networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Waterloo","funders":"","keywords":"Computer science; Payload (computing); Sorting; Queue; Broadband networks; Architecture; Computer network; Satellite; Communications satellite; Broadband; Very-large-scale integration; Application-specific integrated circuit; Embedded system; Packet switching; Computer architecture; Telecommunications; Engineering; Network packet","score_opus":0.01953562200895383,"score_gpt":0.21770272653562164,"score_spread":0.1981671045266678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511954377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09463786,0.004287057,0.80829036,0.001302611,0.0011906488,0.00019859424,0.00048081242,0.005448222,0.08416377],"genre_scores_gemma":[0.5268671,0.004322827,0.41148254,0.00080861925,0.00053326087,0.00017236563,0.0011158184,0.00016898474,0.05452849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999597,0.000004458556,0.0000021696403,0.000008229298,0.000017670325,0.000007787325],"domain_scores_gemma":[0.9999707,0.000004421111,0.000002546396,0.0000039989204,0.000013591306,0.000004854594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007255074,0.00016695911,0.00008675085,0.0001971322,0.0002247892,0.00042722112,0.00035102206,0.0002420756,0.006669269],"category_scores_gemma":[0.00010843301,0.00008484995,0.00013218571,0.00029235092,0.00013338847,0.00034378638,0.0001468082,0.00030041006,0.0011555424],"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.00020162654,0.00010026507,0.0009318859,0.00043079778,0.00005969148,0.00041070898,0.00008896999,0.020114554,0.36700162,0.10793881,0.026703723,0.47601736],"study_design_scores_gemma":[0.00022150835,0.0018555397,0.0032289743,0.00009256563,0.00017159317,0.0022156679,0.00008637566,0.22215319,0.14096397,0.041574508,0.5873672,0.000068938534],"about_ca_topic_score_codex":0.0005349758,"about_ca_topic_score_gemma":0.0012335312,"teacher_disagreement_score":0.006669269,"about_ca_system_score_codex":0.00025035857,"about_ca_system_score_gemma":0.00031609586,"threshold_uncertainty_score":0.022310972},"labels":[],"label_agreement":null},{"id":"W1512634875","doi":"10.1109/iss.1990.765801","title":"A multistage atm switch with interstage buffer","year":2005,"lang":"en","type":"article","venue":"International Symposium on Switching","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Computer network; Asynchronous Transfer Mode; Network packet; Packet switching; Throughput; Asynchronous communication; Latency (audio); Cut-through switching; Real-time computing; Burst switching; Transmission delay; Telecommunications; Wireless","score_opus":0.00956502890308743,"score_gpt":0.23732820300853832,"score_spread":0.22776317410545088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512634875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2290574,0.0028122303,0.71198785,0.0006341872,0.00094411644,0.00078863424,0.0020151315,0.011650592,0.040109906],"genre_scores_gemma":[0.80979395,0.0008800352,0.1722099,0.0003210252,0.00027662358,0.00017610368,0.0009850693,0.00006209709,0.015295166],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984205,0.000018360735,0.0000109097,0.00004186513,0.000060471142,0.000026329652],"domain_scores_gemma":[0.9998795,0.000018076222,0.000015898915,0.000024825573,0.000036998394,0.000024839192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016900997,0.0003248252,0.0002691731,0.00036079105,0.00057392125,0.00056902453,0.0012429464,0.0004925503,0.009769298],"category_scores_gemma":[0.0001861938,0.0001807237,0.0002804959,0.0005047484,0.00014463285,0.00075161643,0.00035489383,0.00035394455,0.0014513452],"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.0012698964,0.0007563217,0.005110148,0.0005426144,0.00013600418,0.00085769524,0.000094733856,0.024633517,0.49533224,0.023423979,0.025131034,0.42271188],"study_design_scores_gemma":[0.00040051757,0.0034410567,0.010881593,0.00007067114,0.00042626986,0.004185472,0.000051503615,0.5351216,0.2544912,0.007292458,0.18348232,0.0001553167],"about_ca_topic_score_codex":0.0006335259,"about_ca_topic_score_gemma":0.0008812983,"teacher_disagreement_score":0.009769298,"about_ca_system_score_codex":0.0002960683,"about_ca_system_score_gemma":0.00031276068,"threshold_uncertainty_score":0.032681525},"labels":[],"label_agreement":null},{"id":"W1512827236","doi":"10.5555/2043468.2043526","title":"Collection of BCNET BGP traffic","year":2011,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","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","funders":"","keywords":"Testbed; Computer science; Border Gateway Protocol; Computer network; Data collection; Software; Visualization; Protocol (science); Routing protocol; Operating system; Data mining; Routing (electronic design automation)","score_opus":0.020943413102160923,"score_gpt":0.19079189844360722,"score_spread":0.1698484853414463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512827236","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6602932,0.0003286163,0.109309144,0.0007996861,0.00068886974,0.0037010645,0.11434088,0.03172983,0.07880871],"genre_scores_gemma":[0.6580482,0.0004747598,0.095172964,0.00024479526,0.00015664057,0.0026129454,0.218078,0.0016684427,0.023543095],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879396,0.0001602084,0.00008130147,0.00024631945,0.0005664015,0.00015181136],"domain_scores_gemma":[0.99829143,0.00017005118,0.000067085864,0.00030918882,0.00094200147,0.00022011442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090900273,0.000584993,0.0005348527,0.0027172794,0.0013585847,0.0010173992,0.0005911328,0.00031941943,0.008074111],"category_scores_gemma":[0.0014838115,0.0002500196,0.00017156827,0.0036893776,0.00033767507,0.00069263804,0.00080040464,0.0007425337,0.0033258689],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023316636,0.002090089,0.041290995,0.00077796617,0.00014874063,0.0009679707,0.0012542699,0.0316908,0.36293593,0.013871049,0.21930738,0.32333305],"study_design_scores_gemma":[0.00030087883,0.0014519929,0.08398703,0.00015086161,0.000087515415,0.00091955817,0.0009490295,0.1696687,0.4990175,0.0073805754,0.23586336,0.00022306682],"about_ca_topic_score_codex":0.005971442,"about_ca_topic_score_gemma":0.0045923637,"teacher_disagreement_score":0.008074111,"about_ca_system_score_codex":0.0010528484,"about_ca_system_score_gemma":0.0013792285,"threshold_uncertainty_score":0.02701056},"labels":[],"label_agreement":null},{"id":"W151284889","doi":"10.1007/0-306-47015-2_19","title":"Communication Latency Hiding in Reconfigurable Message-Passing Environments: Quantitative Studies","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Locality; Latency (audio); Heuristics; IBM; Locality of reference; Message passing; Overhead (engineering); Computation; Distributed computing; Parallel computing; Computer network; Operating system; Telecommunications; Cache; Algorithm","score_opus":0.06624175471583707,"score_gpt":0.29450494233184354,"score_spread":0.22826318761600647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151284889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53266126,0.013483009,0.41207254,0.0006758972,0.00011936421,0.00015223677,0.0004888932,0.0018018775,0.03854495],"genre_scores_gemma":[0.96173006,0.0024887063,0.032936644,0.000037178477,0.000057349906,0.000086405795,0.00017355554,0.00021754068,0.0022724832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746406,0.0007431339,0.00006323744,0.00019781246,0.001310992,0.00022074225],"domain_scores_gemma":[0.97323036,0.021600097,0.0020400148,0.0021118876,0.0008525095,0.00016509558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026909243,0.0008117804,0.0005438308,0.0011861575,0.00042755745,0.0011413427,0.0015702874,0.00048525826,0.0022116865],"category_scores_gemma":[0.017415863,0.00041820307,0.00034065676,0.0022382534,0.0018055849,0.002691576,0.0005246686,0.0009985684,0.00032049653],"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.00041959397,0.00033405094,0.0037925579,0.0012411013,0.000090030095,0.00019400578,0.0003879509,0.71595585,0.05113282,0.10559729,0.0018772302,0.1189775],"study_design_scores_gemma":[0.000032581316,0.0005084957,0.003885488,0.00009276377,0.000090676534,0.0002737215,0.00013522494,0.8824417,0.06874235,0.040264063,0.0034727068,0.000060345097],"about_ca_topic_score_codex":0.00062317593,"about_ca_topic_score_gemma":0.0004944703,"teacher_disagreement_score":0.0026909243,"about_ca_system_score_codex":0.001217354,"about_ca_system_score_gemma":0.0004839208,"threshold_uncertainty_score":0.014231145},"labels":[],"label_agreement":null},{"id":"W1515818667","doi":"10.1109/icc.1988.13760","title":"System of interconnected ring networks: a delay analysis","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Ring (chemistry); Queue; Class (philosophy); Service (business); Independence (probability theory); Computer science; Queueing theory; Connection (principal bundle); Computer network; Discrete mathematics; Topology (electrical circuits); Mathematics; Combinatorics; Geometry; Artificial intelligence; Statistics","score_opus":0.01051222436506269,"score_gpt":0.2161005989035349,"score_spread":0.2055883745384722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515818667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28695986,0.00496828,0.68185675,0.00067786756,0.00024377076,0.00011975918,0.00039350297,0.00030630018,0.024473956],"genre_scores_gemma":[0.968088,0.0016702613,0.019992493,0.00004879308,0.00011427854,0.000086896674,0.0001436286,0.000042915188,0.009812813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997713,0.00006583903,0.000008759486,0.000046448557,0.00006189212,0.00004587245],"domain_scores_gemma":[0.999178,0.00039091142,0.00014132062,0.00004662322,0.00019944478,0.000043802513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048334297,0.0003974682,0.00041060327,0.00066350854,0.0003542401,0.00071338867,0.00056200475,0.00046896018,0.00418553],"category_scores_gemma":[0.0027101662,0.00019250042,0.0003147988,0.0005820903,0.000430979,0.0010607202,0.0004471598,0.0004271098,0.0003140443],"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.00006988809,0.00001836181,0.00095569564,0.00008866706,0.00003777972,0.00014735069,0.00008699853,0.87682897,0.0033957502,0.11076849,0.0010562236,0.006545829],"study_design_scores_gemma":[0.0000075885696,0.000031391297,0.00019036507,0.00000565716,0.000013105673,0.000043710454,0.000017924078,0.9889631,0.00038664535,0.008710423,0.001624612,0.000005398558],"about_ca_topic_score_codex":0.0026758474,"about_ca_topic_score_gemma":0.0012950962,"teacher_disagreement_score":0.00418553,"about_ca_system_score_codex":0.0009592999,"about_ca_system_score_gemma":0.0004617172,"threshold_uncertainty_score":0.0140019655},"labels":[],"label_agreement":null},{"id":"W1519447018","doi":"10.1109/icc.1994.369015","title":"A fast algorithm for multi-channel/port traffic assignment","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Algorithm; Channel (broadcasting); Computer science; Port (circuit theory); Network packet; Simple (philosophy); Throughput; Algorithm design; Computer network; Wireless; Engineering; Telecommunications","score_opus":0.05374448762005245,"score_gpt":0.25626675713789965,"score_spread":0.2025222695178472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519447018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017584874,0.00007323038,0.9950324,0.000078009114,0.000062553394,0.0000711986,0.000050780964,0.001304484,0.0015687875],"genre_scores_gemma":[0.038889855,0.00010539312,0.95597273,0.00006318484,0.00004578136,0.00026351737,0.00034579835,0.00020819514,0.0041055665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.0001381161,0.000060543018,0.00021159257,0.00028800912,0.00011299798],"domain_scores_gemma":[0.99904186,0.0002750276,0.0000690613,0.0001979331,0.00036833764,0.000047671045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007606872,0.0012023968,0.0010181328,0.0015222968,0.0012357302,0.0017745584,0.0020230436,0.0015409213,0.013509394],"category_scores_gemma":[0.0027560308,0.00059206743,0.00073088845,0.001756805,0.0006599158,0.002399673,0.0018402376,0.0014134242,0.005461991],"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.00023724104,0.00012607673,0.000491311,0.00017796141,0.0000495466,0.00010905518,0.000116922056,0.15393415,0.008463166,0.037540853,0.015687963,0.78306586],"study_design_scores_gemma":[0.00014038026,0.000063788306,0.00021042484,0.00002291529,0.000015822492,0.00019210594,0.00003831595,0.9451023,0.006734212,0.032646403,0.014795055,0.00003826483],"about_ca_topic_score_codex":0.0030087654,"about_ca_topic_score_gemma":0.003637597,"teacher_disagreement_score":0.013509394,"about_ca_system_score_codex":0.0010679099,"about_ca_system_score_gemma":0.00227922,"threshold_uncertainty_score":0.045193434},"labels":[],"label_agreement":null},{"id":"W1521404434","doi":"10.1109/glocom.1994.513317","title":"A merging network scheme that builds large sorting networks","year":2002,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Sorting network; Sorting; Scheme (mathematics); Computer science; Limit (mathematics); Sorting algorithm; Chip; Algorithm; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.026511073721743054,"score_gpt":0.22714755002436499,"score_spread":0.20063647630262194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521404434","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016389742,0.00021036736,0.96496826,0.00016774445,0.00007315707,0.00016915218,0.00017813238,0.0030872072,0.014756143],"genre_scores_gemma":[0.12790416,0.0002204972,0.8602962,0.00012528291,0.00003600795,0.000227446,0.00044998675,0.00035141775,0.010388965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.00011272936,0.000050943712,0.00015710275,0.00018669442,0.000080418424],"domain_scores_gemma":[0.99906915,0.00020633762,0.00009778866,0.0003298986,0.00021616285,0.00008070817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007171445,0.0005770785,0.000485193,0.00095463067,0.0011461627,0.0010403378,0.0013233041,0.00068779907,0.00885815],"category_scores_gemma":[0.0016270563,0.0004399132,0.0005866161,0.0011546451,0.0011772072,0.0035185819,0.0018724478,0.0009792686,0.0023334168],"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.0002514984,0.00012022467,0.0009948122,0.00032446036,0.000059013473,0.00026715308,0.00048662283,0.053313803,0.07315881,0.4421002,0.010697477,0.41822597],"study_design_scores_gemma":[0.000117601594,0.00047744295,0.0011535155,0.000098394936,0.00017475142,0.000890801,0.00016876766,0.40432653,0.14167997,0.21868765,0.23206608,0.0001585117],"about_ca_topic_score_codex":0.0022499184,"about_ca_topic_score_gemma":0.0030714965,"teacher_disagreement_score":0.00885815,"about_ca_system_score_codex":0.0010234826,"about_ca_system_score_gemma":0.0010253384,"threshold_uncertainty_score":0.029633462},"labels":[],"label_agreement":null},{"id":"W1521682806","doi":"10.1109/icccn.2002.1043117","title":"Design and implementation of the scalable multicast balanced gamma (BG) switch","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Source-specific multicast; Protocol Independent Multicast; IP multicast; Pragmatic General Multicast; Distributed computing; Scalability; Multicast address; Inter-domain; Unicast; Operating system","score_opus":0.01750768781183503,"score_gpt":0.25670893131626954,"score_spread":0.2392012435044345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521682806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16421469,0.00086568814,0.79330474,0.0004989789,0.00020516012,0.00047979507,0.00027119028,0.0052460493,0.034913678],"genre_scores_gemma":[0.7431717,0.00041482612,0.24886414,0.0002934083,0.000071281145,0.00020071412,0.00036919088,0.00013187883,0.0064827628],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979764,0.000027229287,0.00000830821,0.000026806778,0.00009269534,0.000047282112],"domain_scores_gemma":[0.9998535,0.000018051995,0.00001939395,0.000021108544,0.00006560175,0.000022390503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023429147,0.0003081923,0.000203576,0.00030324937,0.00023993815,0.00049975293,0.0007395053,0.00032557332,0.0025351692],"category_scores_gemma":[0.0002574177,0.00017420863,0.00014578177,0.00028593992,0.0002594757,0.0004074995,0.0003221099,0.0002874997,0.0007370594],"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.0005385734,0.00019168918,0.0045273886,0.00036916966,0.00008638245,0.00082569086,0.0003161828,0.052163005,0.5031913,0.034334276,0.011100836,0.39235565],"study_design_scores_gemma":[0.000422188,0.0024218948,0.005493674,0.00007059366,0.00025657425,0.0019488757,0.00021225767,0.4042226,0.44772902,0.012448435,0.124707446,0.00006639748],"about_ca_topic_score_codex":0.0008760982,"about_ca_topic_score_gemma":0.00083363574,"teacher_disagreement_score":0.0025351692,"about_ca_system_score_codex":0.0004234282,"about_ca_system_score_gemma":0.0005657287,"threshold_uncertainty_score":0.008480966},"labels":[],"label_agreement":null},{"id":"W1523257389","doi":"10.1109/pacrim.1995.519409","title":"Input smoothing with buffering: a new technique for queueing in fast packet switching","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Victoria","funders":"","keywords":"Computer science; Network packet; Queueing theory; Transmission delay; Computer network; Fast packet switching; Smoothing; Packet switching; Queue; Burst switching; Frame (networking); Packet generator; Real-time computing; Queuing delay; Processing delay","score_opus":0.02391848412606886,"score_gpt":0.22760705461795866,"score_spread":0.2036885704918898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523257389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013456007,0.0014989008,0.97991085,0.00021242346,0.00023652417,0.00011445134,0.000048471265,0.0020838664,0.0024385357],"genre_scores_gemma":[0.41609895,0.002755222,0.57432854,0.0003688598,0.00063892396,0.00021802781,0.00015366996,0.00038921775,0.00504856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901915,0.00021120408,0.000054702683,0.0001127017,0.00049033976,0.00011194779],"domain_scores_gemma":[0.9982863,0.00076274876,0.00016879922,0.00039257534,0.00032538112,0.00006418871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013764952,0.00076099543,0.00062057906,0.000814721,0.0007259771,0.001285808,0.002133723,0.00065183424,0.001940917],"category_scores_gemma":[0.0034959335,0.00029966576,0.00054916635,0.001109686,0.0009788419,0.0020060788,0.00086044753,0.0012327789,0.00043737632],"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.0007847157,0.00036034908,0.002623674,0.00055836554,0.00015378838,0.00036990913,0.0005889057,0.08114281,0.13051106,0.114585765,0.007108828,0.66121185],"study_design_scores_gemma":[0.00010658915,0.00082976057,0.0009601425,0.0000802029,0.00021212181,0.0007906524,0.000083411665,0.78015774,0.124152556,0.04931847,0.04317745,0.00013095819],"about_ca_topic_score_codex":0.0016591541,"about_ca_topic_score_gemma":0.0011029863,"teacher_disagreement_score":0.002133723,"about_ca_system_score_codex":0.0010002346,"about_ca_system_score_gemma":0.0009937391,"threshold_uncertainty_score":0.007279694},"labels":[],"label_agreement":null},{"id":"W1527845817","doi":"10.1109/acssc.1995.540539","title":"Rapid prototyping environment for the specification and automatic synthesis of controllers for interconnection routers","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Computer science; Compiler; VHDL; Embedded system; Application-specific integrated circuit; Routing (electronic design automation); Router; Controller (irrigation); Field-programmable gate array; Backtracking; Hardware description language; Interconnection; Rapid prototyping; Computer architecture; Operating system; Computer network; Programming language","score_opus":0.034673131643277566,"score_gpt":0.21193498755352555,"score_spread":0.17726185591024798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527845817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00424413,0.00018650004,0.98211366,0.00005494246,0.000039118117,0.00013697543,0.00018548296,0.009927554,0.0031116738],"genre_scores_gemma":[0.051074956,0.00039167478,0.942029,0.0000665636,0.000030714084,0.00059909036,0.0008619784,0.0016558628,0.0032901098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864334,0.00043880916,0.000097141,0.00014485841,0.00052764924,0.00014819551],"domain_scores_gemma":[0.9978029,0.0014019617,0.00015610857,0.00029030943,0.00026180866,0.00008688925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024106484,0.0012110313,0.00089841516,0.00061581045,0.00054432225,0.0014327869,0.0021225945,0.00097547454,0.010659468],"category_scores_gemma":[0.0038918306,0.0013423081,0.0010458207,0.00047636987,0.00084377686,0.0013660542,0.0009851255,0.0017171254,0.003608805],"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.0010060691,0.00033168506,0.0015463091,0.0016020385,0.00015596901,0.0020440666,0.0010983235,0.22525483,0.18554753,0.14609301,0.030906448,0.40441367],"study_design_scores_gemma":[0.0010549383,0.0012823357,0.00085383526,0.00037257661,0.00014595759,0.0016390659,0.0001719553,0.5615545,0.18709628,0.03834608,0.20731606,0.00016644513],"about_ca_topic_score_codex":0.00052962586,"about_ca_topic_score_gemma":0.00062439556,"teacher_disagreement_score":0.010659468,"about_ca_system_score_codex":0.00046662163,"about_ca_system_score_gemma":0.0009284251,"threshold_uncertainty_score":0.035659432},"labels":[],"label_agreement":null},{"id":"W1530636245","doi":"10.1002/9781118468654.ch12","title":"Software Modeling Approaches for Presilicon System Performance Analysis","year":2012,"lang":"en","type":"other","venue":"","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":"Blackberry (Canada)","funders":"","keywords":"Computer science; Software; Software engineering; Operating system","score_opus":0.052237421656247056,"score_gpt":0.22456239966138739,"score_spread":0.17232497800514032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530636245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028579885,0.0018225977,0.98084235,0.00017900756,0.00006817473,0.000052798143,0.00007453348,0.00064307445,0.013459573],"genre_scores_gemma":[0.25432068,0.012723941,0.6860728,0.00029125434,0.0003157191,0.0006190603,0.0010111822,0.0012687494,0.04337651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990815,0.00026431784,0.00004968285,0.000088215216,0.00044842507,0.0000679323],"domain_scores_gemma":[0.99923337,0.0003379205,0.00006716023,0.00013817074,0.00020613214,0.000017317434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091245153,0.0017211419,0.000707524,0.0016234957,0.00056323735,0.0020450884,0.0020463169,0.0008423224,0.006528914],"category_scores_gemma":[0.0019138787,0.0008348078,0.001105097,0.0015082231,0.0006277622,0.0023394602,0.00086733076,0.0019800381,0.0023482286],"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.00003198,0.0001265636,0.00053399365,0.00053710636,0.000111629146,0.00012988762,0.0002556662,0.46994206,0.0046821544,0.34033406,0.0047057434,0.17860912],"study_design_scores_gemma":[0.00000884834,0.000042510408,0.0001806476,0.0001569793,0.000049919017,0.00006569151,0.00006183883,0.83108574,0.0033181058,0.1288943,0.03611559,0.000019906698],"about_ca_topic_score_codex":0.00439021,"about_ca_topic_score_gemma":0.0060917763,"teacher_disagreement_score":0.006528914,"about_ca_system_score_codex":0.0014110645,"about_ca_system_score_gemma":0.0013883044,"threshold_uncertainty_score":0.021841407},"labels":[],"label_agreement":null},{"id":"W1532834634","doi":"10.1109/nca.2004.1347794","title":"Myrinet networks: a performance study","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Computer science; Computer network; Interconnection; Latency (audio); Bandwidth (computing); Computation; Network interface; Node (physics); Distributed computing; Software; Message passing; Operating system; Telecommunications","score_opus":0.01130172908167928,"score_gpt":0.2154333423509683,"score_spread":0.20413161326928903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532834634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79259527,0.02771507,0.085024945,0.00462344,0.0003884848,0.00018513364,0.00089856307,0.0016048093,0.086964205],"genre_scores_gemma":[0.9837616,0.004583676,0.0082552135,0.00011244189,0.00015685122,0.000052786374,0.0003699003,0.000094369156,0.002613195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985832,0.0003566418,0.000046265184,0.00015758397,0.00059756485,0.0002587498],"domain_scores_gemma":[0.9974208,0.0012177207,0.00028237604,0.00027126458,0.00066154316,0.00014626708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016196959,0.00046544525,0.0003912322,0.0017699744,0.00074388005,0.0014314634,0.0008165416,0.00063135865,0.0025177703],"category_scores_gemma":[0.007185286,0.00021135408,0.00017290674,0.0043085143,0.00051553565,0.0028744026,0.0007110575,0.00076055067,0.00034929038],"study_design_candidate":"bench_or_experimental","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.0018834217,0.0006215289,0.045389414,0.0011878983,0.00018007137,0.0009394003,0.00090400793,0.47669122,0.017818827,0.1612644,0.025508724,0.26761115],"study_design_scores_gemma":[0.0000559304,0.0004930134,0.012348213,0.00016639139,0.00006021948,0.00097185886,0.00035865605,0.9240892,0.011415635,0.01885876,0.031136246,0.000045915833],"about_ca_topic_score_codex":0.004392318,"about_ca_topic_score_gemma":0.0024084304,"teacher_disagreement_score":0.004392318,"about_ca_system_score_codex":0.0017140051,"about_ca_system_score_gemma":0.0008432725,"threshold_uncertainty_score":0.012436032},"labels":[],"label_agreement":null},{"id":"W1534162696","doi":"10.1109/pacrim.1993.407157","title":"Reliability and performance of the augmented 3D-tree fault tolerant network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Mean time between failures; Reliability (semiconductor); Fault tree analysis; Computer science; Fault (geology); Throughput; Fault tolerance; Reliability engineering; Engineering; Distributed computing; Failure rate; Operating system","score_opus":0.012686712891497675,"score_gpt":0.19426958322774104,"score_spread":0.18158287033624337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534162696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878203,0.0001076141,0.009946244,0.00005667534,0.0000097285365,0.0000053703234,0.00011488413,0.00023246686,0.0017066789],"genre_scores_gemma":[0.9983765,0.000030040597,0.0011856046,0.000005001745,0.0000024201904,0.0000036050658,0.000074109725,0.0000069166026,0.0003158535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999819,0.000037639806,0.000010728448,0.000027989112,0.00006414004,0.000040525596],"domain_scores_gemma":[0.9990558,0.00037738858,0.00014142871,0.000103829276,0.00027492677,0.000046573965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029295916,0.00017493305,0.00018314502,0.00027684914,0.00016117714,0.00028212147,0.00024648604,0.00027216424,0.0008532847],"category_scores_gemma":[0.0013932906,0.000066808774,0.00010386243,0.00030841157,0.0002436244,0.00035476816,0.00016542895,0.00012597075,0.00013088383],"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.0012372659,0.000062091145,0.0072424426,0.000075692034,0.00004819301,0.00024803675,0.00015582835,0.88035315,0.06468482,0.0026148355,0.0010809918,0.04219672],"study_design_scores_gemma":[0.000016516058,0.000537995,0.006909614,0.000006212144,0.000028076947,0.00018862281,0.000036809368,0.968177,0.022173919,0.0012273177,0.00068014034,0.000017734714],"about_ca_topic_score_codex":0.0025440352,"about_ca_topic_score_gemma":0.0016736415,"teacher_disagreement_score":0.0025440352,"about_ca_system_score_codex":0.00039871864,"about_ca_system_score_gemma":0.00022160055,"threshold_uncertainty_score":0.0050584674},"labels":[],"label_agreement":null},{"id":"W1536791495","doi":"","title":"Proceedings of the 2008 international workshop on System level interconnect prediction","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Interconnection; Computer science; OSI model; Architecture; Computer architecture; Engineering; Telecommunications","score_opus":0.041022868460798945,"score_gpt":0.2244052392980544,"score_spread":0.18338237083725545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536791495","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025031375,0.04408956,0.6278348,0.036474545,0.08179083,0.0007845685,0.00608406,0.013771688,0.16413863],"genre_scores_gemma":[0.1333647,0.032123175,0.18932112,0.007900804,0.019954827,0.0011255553,0.021979164,0.004798924,0.58943176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989623,0.00022075651,0.0000623273,0.00022942746,0.00038863914,0.00013657084],"domain_scores_gemma":[0.9982835,0.00039577796,0.000060477494,0.0002701778,0.0007186179,0.0002714257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019687582,0.0011637649,0.0009952992,0.0008633109,0.0006973968,0.0028033454,0.0017499935,0.0015210651,0.045941226],"category_scores_gemma":[0.0034347188,0.0005262132,0.00081259734,0.00079582015,0.00052973285,0.0027296322,0.0015996713,0.0028967601,0.021319056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00028634063,0.00012836512,0.0005766477,0.00027904412,0.000042015574,0.00018614142,0.00014691766,0.007864386,0.0042978977,0.012918236,0.74402946,0.22924456],"study_design_scores_gemma":[0.00005115179,0.00018659067,0.0008665401,0.00018501912,0.000043883367,0.00027364114,0.00011218734,0.031669408,0.0044794683,0.015156454,0.9469385,0.000037232887],"about_ca_topic_score_codex":0.0013860164,"about_ca_topic_score_gemma":0.0019314104,"teacher_disagreement_score":0.045941226,"about_ca_system_score_codex":0.0009808999,"about_ca_system_score_gemma":0.0015857092,"threshold_uncertainty_score":0.15368873},"labels":[],"label_agreement":null},{"id":"W1545073706","doi":"10.1007/978-3-540-24596-4_10","title":"Efficient Algorithm for Embedding Hypergraphs in a Cycle","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Computation; Algorithm; Approximation algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01249321993447994,"score_gpt":0.24651903251036908,"score_spread":0.23402581257588914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545073706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034128953,0.00045112753,0.9465568,0.0004373341,0.00011929796,0.00040279847,0.0007883572,0.0057219486,0.011393256],"genre_scores_gemma":[0.10057859,0.00029030992,0.88615066,0.00009962497,0.000038726044,0.00034164372,0.0020389091,0.00048721733,0.00997428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.00011833746,0.000041141368,0.00018116002,0.00015376566,0.00010509094],"domain_scores_gemma":[0.9990262,0.00035310688,0.000056636338,0.00029731463,0.00019652159,0.000070159665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046450362,0.0014181142,0.0011687229,0.0016318735,0.001014381,0.0020841616,0.0021965518,0.0013568999,0.01672853],"category_scores_gemma":[0.002039936,0.000842109,0.0009423107,0.002500808,0.0006114245,0.003558314,0.0027753767,0.0013610356,0.0040460075],"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.0004538666,0.0002860645,0.00081076875,0.0005971092,0.00010044853,0.00017362258,0.0003063829,0.051388886,0.016722089,0.044435397,0.02659309,0.85813224],"study_design_scores_gemma":[0.00048593277,0.00036993314,0.00087215105,0.00012904592,0.00019334289,0.0004958715,0.0005231417,0.72040296,0.02875951,0.20940486,0.03827772,0.00008561312],"about_ca_topic_score_codex":0.0033303273,"about_ca_topic_score_gemma":0.006599346,"teacher_disagreement_score":0.01672853,"about_ca_system_score_codex":0.001264074,"about_ca_system_score_gemma":0.0019019219,"threshold_uncertainty_score":0.055962503},"labels":[],"label_agreement":null},{"id":"W1563172144","doi":"","title":"Design and Evaluation of a High Speed Routing Lookup Architecture","year":2004,"lang":"en","type":"article","venue":"IEICE Transactions on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Computer science; Architecture; Routing (electronic design automation); Computer architecture; Lookup table; Computer network; Embedded system; Operating system","score_opus":0.060516892961367946,"score_gpt":0.2973720615495137,"score_spread":0.23685516858814573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563172144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47177026,0.0027243532,0.49284574,0.0010385549,0.0005278889,0.0009616006,0.00031888354,0.006652344,0.023160405],"genre_scores_gemma":[0.8126305,0.0003560309,0.1798998,0.00019924631,0.000078892124,0.00013185086,0.00021773635,0.00011176832,0.0063742613],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946624,0.00011849963,0.00002900186,0.00006504245,0.00024640394,0.00007483228],"domain_scores_gemma":[0.9990314,0.00024852715,0.00010908036,0.000128402,0.00041595192,0.000066626664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665194,0.00046465464,0.00031119204,0.00059998425,0.00043912948,0.0012541041,0.002151427,0.00064920983,0.0047361846],"category_scores_gemma":[0.0013640975,0.0002878019,0.00020177262,0.00040009225,0.0002858873,0.0009817189,0.0003308604,0.0003860301,0.00077175425],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0018447549,0.00088084495,0.008016273,0.0013166083,0.00032003346,0.00053645845,0.00027835317,0.17314257,0.4027055,0.026939088,0.011676769,0.37234277],"study_design_scores_gemma":[0.0004796157,0.0033456322,0.002322308,0.000039090868,0.0003673475,0.000513456,0.00011471478,0.7828714,0.18948126,0.0021983427,0.01821977,0.000047107955],"about_ca_topic_score_codex":0.0025433067,"about_ca_topic_score_gemma":0.00401852,"teacher_disagreement_score":0.0047361846,"about_ca_system_score_codex":0.0009862492,"about_ca_system_score_gemma":0.0015635949,"threshold_uncertainty_score":0.015844107},"labels":[],"label_agreement":null},{"id":"W1563645183","doi":"10.1109/mwscas.2003.1562412","title":"Network on Chip Using a Reconfigurable Platform","year":2006,"lang":"en","type":"article","venue":"","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":"Université de Montréal","funders":"","keywords":"MicroBlaze; Field-programmable gate array; Computer science; Hypercube; Embedded system; Parallel computing; Multiprocessing; Embedding","score_opus":0.03496965191117229,"score_gpt":0.2335245925995905,"score_spread":0.1985549406884182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563645183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21989432,0.0040424285,0.55128396,0.0008751128,0.0012356483,0.0006330294,0.0007626448,0.025378134,0.19589478],"genre_scores_gemma":[0.6889488,0.0011516124,0.25471207,0.000620181,0.00017496443,0.00036508762,0.0010909373,0.00037818318,0.05255824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997515,0.000053702246,0.000011996346,0.000046159592,0.00008191583,0.000054687218],"domain_scores_gemma":[0.99981886,0.00003452593,0.000018468085,0.000067983674,0.000038899336,0.000021380143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015040555,0.00039995494,0.00027933926,0.0003741356,0.00024737575,0.00059593533,0.0009094892,0.0003579386,0.013232713],"category_scores_gemma":[0.0002665996,0.00017887031,0.00029738658,0.00027501548,0.00015546576,0.0005461052,0.00048428835,0.0004389838,0.0039858916],"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.00085024437,0.00023955156,0.0014717528,0.0006931846,0.0002116698,0.0013714392,0.00016598268,0.07267839,0.29133108,0.04876791,0.04091715,0.5413017],"study_design_scores_gemma":[0.00049892534,0.0018467258,0.0032044782,0.0002102756,0.0002182847,0.0020645976,0.00009861389,0.31148022,0.19594881,0.017633833,0.46663502,0.00016017105],"about_ca_topic_score_codex":0.00081856677,"about_ca_topic_score_gemma":0.0014985407,"teacher_disagreement_score":0.013232713,"about_ca_system_score_codex":0.00030888326,"about_ca_system_score_gemma":0.00034399505,"threshold_uncertainty_score":0.044267833},"labels":[],"label_agreement":null},{"id":"W1564610723","doi":"10.1109/mwscas.1993.342970","title":"The augmented 3D-tree fault-tolerant network","year":2002,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Computer science; Vulnerability (computing); Fault tree analysis; Tree (set theory); Fault tolerance; Reliability (semiconductor); Distributed computing; Scheme (mathematics); Fault (geology); Tree network; Computer network; Theoretical computer science; Reliability engineering; Engineering; Algorithm; Computer security; Mathematics","score_opus":0.017571942016327714,"score_gpt":0.20626958553635966,"score_spread":0.18869764352003193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564610723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2531698,0.0003169591,0.73325825,0.0001578352,0.00004685683,0.000037091308,0.00017899147,0.00032536828,0.012508777],"genre_scores_gemma":[0.91016364,0.0002719364,0.08643898,0.000054341555,0.000015988078,0.000041696552,0.0001278264,0.000018733697,0.002866849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999069,0.000024193083,0.000003753047,0.000017568458,0.000034829834,0.000012791483],"domain_scores_gemma":[0.9998159,0.000050113722,0.00003131258,0.000025604373,0.00006606714,0.000011109667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010604483,0.00011847756,0.00012988386,0.00021477138,0.00019912161,0.00035544828,0.00025075392,0.0002351374,0.0010380395],"category_scores_gemma":[0.00035403145,0.00007570416,0.0001868652,0.00021261835,0.00023931648,0.00043572986,0.00023888129,0.0001602482,0.00012748342],"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.00020644974,0.000021504577,0.0013301931,0.00008198248,0.000026350823,0.00032797258,0.000115338065,0.7780059,0.045056023,0.094261475,0.001571713,0.07899519],"study_design_scores_gemma":[0.000006077712,0.0000840665,0.00047530362,0.000005285391,0.0000116776955,0.00016482749,0.000014050999,0.97201604,0.0048833676,0.017092975,0.0052381246,0.000008277016],"about_ca_topic_score_codex":0.0011486915,"about_ca_topic_score_gemma":0.0011298013,"teacher_disagreement_score":0.0011486915,"about_ca_system_score_codex":0.00030193015,"about_ca_system_score_gemma":0.00026586832,"threshold_uncertainty_score":0.0034726262},"labels":[],"label_agreement":null},{"id":"W1568102860","doi":"10.1007/978-3-540-73545-8_37","title":"Linear Algorithm for Broadcasting in Unicyclic Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"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); Broadcasting (networking); Graph; Time complexity; Graph algorithms; Algorithm; Upper and lower bounds; Connectivity; Theoretical computer science; Combinatorics; Discrete mathematics; Computer network; Mathematics","score_opus":0.03335498008116616,"score_gpt":0.27878679155807135,"score_spread":0.24543181147690518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568102860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03612116,0.0013436492,0.89703363,0.0013810763,0.00025900095,0.0004130011,0.0011739585,0.0073372796,0.05493728],"genre_scores_gemma":[0.3043991,0.001402937,0.6338205,0.0008189461,0.0002868426,0.0012966479,0.0033894365,0.0009809562,0.05360459],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989974,0.00019774487,0.000053439533,0.00020881361,0.00027080663,0.00027182788],"domain_scores_gemma":[0.99778205,0.0011706682,0.00013337313,0.00041926056,0.00038210404,0.00011265138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061795255,0.0009381925,0.0011042457,0.0012851811,0.0012696256,0.0020674467,0.0030251113,0.0011063615,0.018085523],"category_scores_gemma":[0.0038218684,0.0005676424,0.00058672903,0.0030436506,0.0009868437,0.0028814618,0.0028149798,0.0018604888,0.0045236577],"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.0009877859,0.0004846135,0.0005150671,0.0011511155,0.00009094344,0.0001105473,0.0005196412,0.07480906,0.010920814,0.1318923,0.065546446,0.7129716],"study_design_scores_gemma":[0.0008765024,0.0004215614,0.00062795484,0.00016591625,0.00014181476,0.00032058728,0.00035418206,0.67583215,0.017496705,0.2729448,0.030726802,0.000091045884],"about_ca_topic_score_codex":0.0057280306,"about_ca_topic_score_gemma":0.007548845,"teacher_disagreement_score":0.018085523,"about_ca_system_score_codex":0.002779886,"about_ca_system_score_gemma":0.0023847476,"threshold_uncertainty_score":0.060502052},"labels":[],"label_agreement":null},{"id":"W157437755","doi":"","title":"Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Degree (music); Line (geometry); Separable space; Point (geometry); Combinatorics; Discrete mathematics; Algorithm; Mathematical analysis; Geometry; Physics","score_opus":0.027018049765787637,"score_gpt":0.23695281671421112,"score_spread":0.20993476694842347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157437755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7400024,0.00020198004,0.22710031,0.0005588364,0.000027439031,0.000071087044,0.00096891174,0.00041538183,0.030653642],"genre_scores_gemma":[0.9830993,0.00009401019,0.013707511,0.00004065181,0.000015326792,0.00004733594,0.00052496715,0.00003526761,0.002435659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.00011024141,0.000028490504,0.00009185146,0.00007793927,0.000058642763],"domain_scores_gemma":[0.9985266,0.0006926749,0.00034184317,0.00018052754,0.000112636895,0.00014574504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365578,0.00036508677,0.00033396768,0.0004867203,0.0006631662,0.0015406338,0.00073941547,0.00081309886,0.0047418205],"category_scores_gemma":[0.0022207692,0.00036010944,0.00059580815,0.00054321537,0.0011301958,0.0023033668,0.00088717026,0.0008551442,0.0004108942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045657638,0.00012057865,0.0024297037,0.00019607322,0.000053211406,0.0007179143,0.0005276122,0.055570696,0.013379126,0.90808254,0.0023378436,0.016128113],"study_design_scores_gemma":[0.00015203976,0.00010901736,0.0011198298,0.000034377194,0.000035371733,0.00033903265,0.00025052324,0.12673129,0.0060408646,0.862387,0.0027763792,0.000024334504],"about_ca_topic_score_codex":0.0011806925,"about_ca_topic_score_gemma":0.0015440175,"teacher_disagreement_score":0.0047418205,"about_ca_system_score_codex":0.0006586309,"about_ca_system_score_gemma":0.00033142773,"threshold_uncertainty_score":0.015862942},"labels":[],"label_agreement":null},{"id":"W15772922","doi":"10.1007/978-3-319-08016-1_1","title":"Broadcast Problem in Hypercube of Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Hypercube; Vertex (graph theory); Broadcasting (networking); Time complexity; Tree (set theory); Theoretical computer science; Node (physics); Spanning tree; K-ary tree; Graph; Discrete mathematics; Binary tree; Combinatorics; Algorithm; Computer network; Tree structure; Mathematics; Parallel computing","score_opus":0.014625453950197983,"score_gpt":0.22499183869136916,"score_spread":0.21036638474117117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15772922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29667807,0.0121944295,0.5476876,0.009305223,0.0011490571,0.00035769423,0.0022296784,0.0008627796,0.12953545],"genre_scores_gemma":[0.81776166,0.007966996,0.10972858,0.0006667116,0.0010895904,0.0004184318,0.002223099,0.00033512714,0.059809715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995259,0.00016784159,0.000024232206,0.00009201899,0.00009827521,0.000091814574],"domain_scores_gemma":[0.9987205,0.00089039083,0.00008625278,0.000086727305,0.00011324757,0.00010291208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610848,0.00037920088,0.0011134403,0.0006085226,0.0010288085,0.0020205546,0.0011889996,0.0014978031,0.0054220245],"category_scores_gemma":[0.0028293908,0.00041558192,0.0004622754,0.0014297924,0.00080647506,0.0030201052,0.0011522416,0.001692541,0.00056889706],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007896114,0.00016699256,0.0006467131,0.001610064,0.000097627235,0.000410108,0.0006047828,0.21914579,0.0068630218,0.61763287,0.054515153,0.09751727],"study_design_scores_gemma":[0.00016791305,0.00008226998,0.00041504143,0.000117708834,0.000039956856,0.00025585937,0.0004167354,0.31276298,0.002694855,0.6676077,0.015411762,0.000027185524],"about_ca_topic_score_codex":0.0018732081,"about_ca_topic_score_gemma":0.0012844818,"teacher_disagreement_score":0.0054220245,"about_ca_system_score_codex":0.0012859373,"about_ca_system_score_gemma":0.0007633167,"threshold_uncertainty_score":0.018138468},"labels":[],"label_agreement":null},{"id":"W1577845740","doi":"10.1109/dmcc.1991.633203","title":"Linear Speedup of Winograd's Matrix Multiplication Algorithm Using an Array Processor","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Speedup; Computer science; Matrix multiplication; Parallel computing; Multiplication (music); Algorithm; Arithmetic; Mathematics; Combinatorics; Physics","score_opus":0.03315127482240068,"score_gpt":0.3087668065772507,"score_spread":0.27561553175485004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577845740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3833524,0.0018177376,0.5272935,0.0010848996,0.0010470472,0.00015335539,0.00065730995,0.017781183,0.066812575],"genre_scores_gemma":[0.5055479,0.0004963782,0.4623927,0.000147898,0.00016736182,0.000112921945,0.000872176,0.00073623756,0.02952636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961436,0.00008373447,0.000017056575,0.00006854136,0.0001228522,0.00009339509],"domain_scores_gemma":[0.9995511,0.00015943071,0.00001427408,0.00007478384,0.00016098592,0.00003935213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040298392,0.00083095353,0.0005650939,0.00059865566,0.00068405725,0.00082499924,0.0010114479,0.00046814483,0.01837202],"category_scores_gemma":[0.0012250481,0.00029938764,0.00038080986,0.001302326,0.00031079122,0.0015309295,0.0006740351,0.0006470448,0.0031686996],"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.0029384415,0.000321164,0.0023580324,0.00042773888,0.00015973834,0.00044307235,0.0003345484,0.14040303,0.04568609,0.041456103,0.05578095,0.70969105],"study_design_scores_gemma":[0.00033604915,0.00025579342,0.0009856136,0.000018481258,0.000060073402,0.00016968617,0.000101001824,0.942161,0.03146994,0.007644309,0.016767332,0.000030658888],"about_ca_topic_score_codex":0.012238647,"about_ca_topic_score_gemma":0.018414248,"teacher_disagreement_score":0.01837202,"about_ca_system_score_codex":0.0007327983,"about_ca_system_score_gemma":0.0013477388,"threshold_uncertainty_score":0.061460555},"labels":[],"label_agreement":null},{"id":"W1582333905","doi":"10.1109/iscas.1993.394062","title":"RTL synthesis for systolic arrays","year":2002,"lang":"en","type":"article","venue":"1993 IEEE International Symposium on Circuits and Systems","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":"Technical University of Nova Scotia","funders":"","keywords":"Computer science; Controller (irrigation); Transfer (computing); Parallel computing; Algorithm; Theoretical computer science","score_opus":0.04442066773905498,"score_gpt":0.2505097326350306,"score_spread":0.20608906489597564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582333905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004132099,0.00038430293,0.9695273,0.00013154531,0.00011561127,0.00010743524,0.00045721896,0.0060529206,0.019091569],"genre_scores_gemma":[0.11168091,0.00069528626,0.8673469,0.00030830715,0.00013645044,0.00046321948,0.0015711538,0.0016936861,0.016104076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999458,0.00009670029,0.00006148468,0.00007215726,0.0002530002,0.000058654434],"domain_scores_gemma":[0.9995751,0.00012814102,0.000053866173,0.00007827368,0.00015043322,0.0000143025745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039908048,0.00057687145,0.00035879185,0.00052525505,0.00039520918,0.0010148213,0.00059785397,0.0003750056,0.012282904],"category_scores_gemma":[0.0010540024,0.0003930205,0.00061993167,0.00044631006,0.0003531193,0.00064796704,0.00047426758,0.0006615966,0.005519805],"study_design_candidate":"bench_or_experimental","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.00017624882,0.00008977278,0.0003109243,0.0010291632,0.000059133275,0.00046490456,0.0003111088,0.1419701,0.18888117,0.20303068,0.023767598,0.43990922],"study_design_scores_gemma":[0.00018263274,0.0004476835,0.00030079638,0.0002561871,0.00008177967,0.00062168686,0.00007334681,0.4532319,0.19971654,0.10876104,0.23624408,0.00008235114],"about_ca_topic_score_codex":0.00061628077,"about_ca_topic_score_gemma":0.0013395438,"teacher_disagreement_score":0.012282904,"about_ca_system_score_codex":0.0006699897,"about_ca_system_score_gemma":0.0007994926,"threshold_uncertainty_score":0.04109043},"labels":[],"label_agreement":null},{"id":"W1582803778","doi":"10.1002/spe.1157","title":"MpAssign: a framework for solving the many‐core platform mapping problem","year":2011,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Interconnection Networks and 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":"Polytechnique Montréal; STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Metaheuristic; Sorting; Evolutionary algorithm; Context (archaeology); Pareto principle; Multi-objective optimization; Genetic algorithm; Evolutionary computation; Mathematical optimization; Distributed computing; Theoretical computer science; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.08788266090564611,"score_gpt":0.30195133746322184,"score_spread":0.21406867655757572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582803778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035507085,0.00025225544,0.99133193,0.00018395763,0.000049866972,0.00007974505,0.000070546856,0.0012655099,0.0032154915],"genre_scores_gemma":[0.089935064,0.0003299666,0.90571123,0.00012256093,0.000038943595,0.00036208582,0.00027055325,0.00029324729,0.0029362368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.00015424358,0.000025423471,0.0000628787,0.00014644058,0.000081919396],"domain_scores_gemma":[0.9996923,0.00016187747,0.000028368077,0.000029666699,0.00005334458,0.000034367073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856073,0.0011271841,0.0007077749,0.0008204859,0.0006169528,0.0011046013,0.0022734986,0.0015874464,0.0045990273],"category_scores_gemma":[0.0017673621,0.00050280115,0.0014457454,0.0006035129,0.0006595851,0.00090405217,0.0018455663,0.0018285974,0.0007647605],"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.000055379416,0.00009213927,0.00034202109,0.0002073185,0.00004883075,0.00014452449,0.00006786982,0.84586287,0.0022071518,0.064503886,0.0054218164,0.08104616],"study_design_scores_gemma":[0.000021627115,0.000017793662,0.000041590745,0.000014750648,0.000006102204,0.00002712286,0.00001371232,0.98228157,0.00042256442,0.011855696,0.0052904165,0.0000070224414],"about_ca_topic_score_codex":0.0058546877,"about_ca_topic_score_gemma":0.007599473,"teacher_disagreement_score":0.0058546877,"about_ca_system_score_codex":0.00079116883,"about_ca_system_score_gemma":0.00218465,"threshold_uncertainty_score":0.01538533},"labels":[],"label_agreement":null},{"id":"W1585941015","doi":"10.1007/978-3-540-27776-7_9","title":"CoDeL: Automatically Synthesizing Network Interface Controllers","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Interface (matter); Routing (electronic design automation); Embedded system; Computer architecture; Interconnection; Controller (irrigation); Distributed computing; Programming language; Operating system; Computer network","score_opus":0.01329805670161898,"score_gpt":0.2348273460073907,"score_spread":0.2215292893057717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585941015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009554453,0.00017601503,0.94076896,0.00009383566,0.00016327566,0.00012756599,0.00056454306,0.04140603,0.0071453094],"genre_scores_gemma":[0.17772382,0.00019001533,0.805305,0.00027367673,0.000074853924,0.00044984545,0.0016725969,0.006275855,0.008034281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994842,0.00009339789,0.000028974762,0.00010340038,0.00023121713,0.000058718317],"domain_scores_gemma":[0.99933666,0.00036067268,0.00005140446,0.0000966266,0.00013467178,0.000020042387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042238084,0.0019540119,0.0007775097,0.0009555148,0.0005300665,0.0013107492,0.0017202375,0.0010324144,0.015543364],"category_scores_gemma":[0.0018609051,0.0011001371,0.0007949629,0.0004752829,0.00060089794,0.0010665506,0.0010063958,0.0012422233,0.0035635233],"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.00045731806,0.00019900412,0.0012436043,0.0011024335,0.00011606633,0.00037206052,0.00025300065,0.20557943,0.085058756,0.020443277,0.047250904,0.6379241],"study_design_scores_gemma":[0.00017521353,0.0001413985,0.0002421071,0.000086436165,0.000063061234,0.00012856064,0.00004532174,0.89014274,0.07159383,0.010120299,0.027229285,0.000031724212],"about_ca_topic_score_codex":0.004628892,"about_ca_topic_score_gemma":0.008834273,"teacher_disagreement_score":0.015543364,"about_ca_system_score_codex":0.0008149306,"about_ca_system_score_gemma":0.0012383206,"threshold_uncertainty_score":0.05199778},"labels":[],"label_agreement":null},{"id":"W1586785345","doi":"10.1109/newcas.2015.7182086","title":"DPDK and MKL; Enabling technologies for near deterministic cloud-based signal processing","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"Canada Research Chairs","keywords":"Cloud computing; Scalability; Computer science; Software; Distributed computing; Computation; Operating system; Programming language","score_opus":0.04393730168377307,"score_gpt":0.2690833240320945,"score_spread":0.22514602234832143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586785345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053398453,0.005752882,0.87799376,0.0030086343,0.0005208962,0.00024058847,0.00053089345,0.010762093,0.047791794],"genre_scores_gemma":[0.83074033,0.0021389334,0.15562382,0.0013966698,0.00020759307,0.00015236926,0.00042120824,0.00040800366,0.008911232],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989791,0.00013898274,0.00005824464,0.000145527,0.00044549824,0.00023273384],"domain_scores_gemma":[0.9992398,0.00014136534,0.00011830365,0.00025527625,0.00013700906,0.00010835477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080390467,0.00043245152,0.00039349814,0.0007061522,0.00068675366,0.0024805688,0.0018915263,0.000554846,0.0036206567],"category_scores_gemma":[0.0015421391,0.0003404188,0.00022386243,0.0005077996,0.0008542642,0.0033512963,0.0028795705,0.0013681354,0.0015612808],"study_design_candidate":"bench_or_experimental","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.0011875045,0.0003758439,0.0034183057,0.000901098,0.00006530558,0.00081626454,0.00071730925,0.024743026,0.11601845,0.37924886,0.039937984,0.43257],"study_design_scores_gemma":[0.0002925387,0.0006689639,0.0017563592,0.00025353767,0.00008739978,0.0015231073,0.0003443252,0.40173686,0.15051349,0.087260365,0.35537484,0.00018825119],"about_ca_topic_score_codex":0.0013403,"about_ca_topic_score_gemma":0.0015053835,"teacher_disagreement_score":0.0036206567,"about_ca_system_score_codex":0.0015564663,"about_ca_system_score_gemma":0.0012353584,"threshold_uncertainty_score":0.0121123195},"labels":[],"label_agreement":null},{"id":"W1587933445","doi":"10.1109/dasip.2014.7115629","title":"Communication-model based embedded mapping of dataflow actors on heterogeneous MPSoC","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Commercializations Promotion Agency for R and D Outcomes; Ministry of Economy, Trade and Industry; Agence Nationale de la Recherche; University of Minnesota","keywords":"Dataflow; MPSoC; Computer science; Multiprocessing; Computation; Parallel computing; Throughput; Symmetric multiprocessor system; Embedded system; Computer architecture; Algorithm; Operating system; Wireless","score_opus":0.04053735866278147,"score_gpt":0.27211721928634297,"score_spread":0.2315798606235615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587933445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060673,0.00009253159,0.93520707,0.000060256432,0.000032575794,0.000050838364,0.000029113333,0.0017221301,0.0021325082],"genre_scores_gemma":[0.71802163,0.00008517597,0.27906853,0.000033714474,0.000015326565,0.000101131795,0.00011947827,0.00021497825,0.0023400409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979883,0.00005299469,0.0000111950085,0.00004489998,0.0000611889,0.000030981002],"domain_scores_gemma":[0.99968934,0.00011358771,0.00004536202,0.00006560875,0.000064765154,0.000021339038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694188,0.00059348496,0.00040149078,0.0003843245,0.00040259573,0.0006445288,0.00070441805,0.00038002525,0.0016464823],"category_scores_gemma":[0.000981394,0.0002302785,0.00034680645,0.00025137654,0.0003092678,0.00057735364,0.0006100185,0.0004130274,0.00025290306],"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.000100048484,0.00007070656,0.00076952437,0.000061288374,0.000027094917,0.000101498874,0.000098691446,0.8710222,0.02172593,0.0076193525,0.00072926475,0.097674236],"study_design_scores_gemma":[0.0000034723994,0.000015852453,0.00006327781,0.0000021128965,0.0000027105611,0.000011181966,0.00000879828,0.99297404,0.0048992857,0.00158743,0.00042965784,0.0000021927942],"about_ca_topic_score_codex":0.0023098171,"about_ca_topic_score_gemma":0.002479658,"teacher_disagreement_score":0.0023098171,"about_ca_system_score_codex":0.0006846286,"about_ca_system_score_gemma":0.0007047743,"threshold_uncertainty_score":0.005508065},"labels":[],"label_agreement":null},{"id":"W1589486145","doi":"10.1109/vetec.1996.503417","title":"System partitioning in a cellular network","year":2002,"lang":"en","type":"article","venue":"","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":"Nortel (Canada)","funders":"Division of Chemistry","keywords":"Computer science; Cellular network; Computer network; Service (business); Distributed computing; Service provider; Cellular radio; Mobile telephony; Order (exchange); Cellular traffic; Mobile radio; Base station","score_opus":0.01857972962581926,"score_gpt":0.18662879954884135,"score_spread":0.1680490699230221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589486145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17977323,0.00064149074,0.81260455,0.00027765174,0.000048827897,0.00017602443,0.00008845351,0.00047929375,0.00591047],"genre_scores_gemma":[0.79641443,0.00031066692,0.20040298,0.00010094318,0.00002791931,0.0001561619,0.00020645045,0.00008333512,0.0022970487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937016,0.00029471182,0.000025847123,0.00008205812,0.0001261877,0.00010104725],"domain_scores_gemma":[0.99926966,0.00044186483,0.000054675194,0.00009147687,0.000094185096,0.000048098616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005028392,0.00051295536,0.00045948304,0.0004027771,0.0008751195,0.0007659412,0.00042998084,0.000447396,0.001563071],"category_scores_gemma":[0.0018143359,0.00024320967,0.00026729645,0.00055142335,0.00048264544,0.00067601935,0.00087103195,0.0003751363,0.0002632574],"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.00019042932,0.000053127696,0.0011698533,0.00007970765,0.000035887264,0.0002081212,0.0002248422,0.89249974,0.013920964,0.014378185,0.0016827324,0.07555635],"study_design_scores_gemma":[0.000026149588,0.00007921722,0.00040523475,0.000010529227,0.000021503583,0.00015030924,0.000095259325,0.9781632,0.0040578037,0.013605,0.0033758455,0.000010001182],"about_ca_topic_score_codex":0.0025442725,"about_ca_topic_score_gemma":0.0024573465,"teacher_disagreement_score":0.0025442725,"about_ca_system_score_codex":0.0006142948,"about_ca_system_score_gemma":0.0005111797,"threshold_uncertainty_score":0.0052289963},"labels":[],"label_agreement":null},{"id":"W1591233969","doi":"10.1109/glocom.1994.513563","title":"A dynamic cell splitting copy network design for ATM multicast switching","year":2002,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Multicast; Computer science; Computer network; Throughput; Banyan; Distributed computing; Telecommunications","score_opus":0.032671670011304006,"score_gpt":0.2413508918673389,"score_spread":0.2086792218560349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591233969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12786272,0.0006169213,0.8551162,0.00029104794,0.00014335994,0.00013513118,0.000120208104,0.0007264778,0.014988015],"genre_scores_gemma":[0.7417734,0.00035407636,0.25268835,0.00012834305,0.00008050336,0.00013567523,0.00012824005,0.00003286894,0.0046785465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987435,0.000026012898,0.0000066449866,0.000030226212,0.00004707045,0.000015662992],"domain_scores_gemma":[0.9998845,0.000019170095,0.000015619073,0.000020630669,0.000048670783,0.000011456117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013401943,0.00019866684,0.0001591474,0.00027783963,0.0003160525,0.00038399437,0.0009315871,0.0003439175,0.0013948918],"category_scores_gemma":[0.00024747296,0.000114582326,0.00017398287,0.00032507954,0.00022874166,0.0005789544,0.00026768894,0.00031048618,0.00021602129],"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.0003835013,0.00019482647,0.001412549,0.00023403045,0.00008678572,0.00046541358,0.00018903986,0.10475083,0.4048172,0.06754246,0.004681589,0.4152418],"study_design_scores_gemma":[0.00010421404,0.0008369846,0.0012486153,0.000029490362,0.000099486795,0.0013051744,0.00005136284,0.8162533,0.13667268,0.012956025,0.030378552,0.000064084816],"about_ca_topic_score_codex":0.00081627123,"about_ca_topic_score_gemma":0.0013844214,"teacher_disagreement_score":0.0013948918,"about_ca_system_score_codex":0.00057111995,"about_ca_system_score_gemma":0.00031025862,"threshold_uncertainty_score":0.004666388},"labels":[],"label_agreement":null},{"id":"W1593266071","doi":"10.1109/iscas.2003.1206235","title":"Design of a switch for network on chip applications","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":186,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Embedded system; Interconnection; Network on a chip; Routing (electronic design automation); System on a chip; Synchronization (alternating current); Overhead (engineering); Computer network; Latency (audio); Computer architecture; Telecommunications","score_opus":0.03569348335389942,"score_gpt":0.25483422756158386,"score_spread":0.21914074420768442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593266071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1037125,0.0017537096,0.8426257,0.0010125904,0.0006911341,0.0004513608,0.00041719255,0.00569436,0.043641556],"genre_scores_gemma":[0.6542773,0.0013523925,0.32444876,0.0005449329,0.00028275707,0.0004657072,0.0005661301,0.00017458577,0.017887527],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998883,0.000021433729,0.0000068900613,0.000022672753,0.000039282077,0.000021334921],"domain_scores_gemma":[0.99992585,0.000015113214,0.000007750402,0.000008985686,0.000029245444,0.000013079821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019821538,0.00031727247,0.00017578428,0.00034449913,0.00044692415,0.00068189367,0.0005768168,0.00048068792,0.0036590258],"category_scores_gemma":[0.00017438563,0.00015081887,0.000209129,0.00024867425,0.00019136396,0.0004066762,0.00020879866,0.0002808716,0.00097507023],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0005870902,0.00021223057,0.0017224138,0.0005388552,0.00016467048,0.0007073627,0.00022976482,0.06002205,0.43165362,0.068402894,0.02252649,0.41323254],"study_design_scores_gemma":[0.00028528023,0.0014015882,0.0029107048,0.00007555692,0.00024269767,0.0011162524,0.00016725318,0.5240254,0.22011611,0.023202404,0.22638585,0.00007097421],"about_ca_topic_score_codex":0.0006591342,"about_ca_topic_score_gemma":0.0011953908,"teacher_disagreement_score":0.0036590258,"about_ca_system_score_codex":0.0003039426,"about_ca_system_score_gemma":0.00039742296,"threshold_uncertainty_score":0.012240708},"labels":[],"label_agreement":null},{"id":"W1597098093","doi":"10.1109/pacrim.1999.799600","title":"A RISC core design for an ATM network interfaces","year":2003,"lang":"en","type":"article","venue":"","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":"Acadia University","funders":"","keywords":"Computer science; Reduced instruction set computing; Scalability; Instruction set; Computer architecture; Multi-core processor; Embedded system; Core (optical fiber); Asynchronous Transfer Mode; Computer network; Operating system; Computer hardware; Telecommunications","score_opus":0.10355074574208462,"score_gpt":0.2943541811839931,"score_spread":0.19080343544190848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597098093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060410887,0.002318965,0.82644457,0.00057957263,0.0006039766,0.00068582833,0.00034965237,0.0032932397,0.105313346],"genre_scores_gemma":[0.3861659,0.0009856707,0.5747643,0.00074549107,0.00019367634,0.00044597674,0.00051613466,0.00033979525,0.035843115],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971515,0.000038912734,0.000015736237,0.000037687685,0.00016069142,0.00003180973],"domain_scores_gemma":[0.99970406,0.000027685028,0.000024988782,0.00003602591,0.00019409266,0.000013032125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022050457,0.00031193465,0.0001970606,0.00036440277,0.000317359,0.00056656246,0.0006665562,0.0004560624,0.0045576734],"category_scores_gemma":[0.0004743338,0.0002672419,0.00024028796,0.00026917615,0.00017622666,0.00041122158,0.00015988052,0.00063411763,0.0020523984],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00041200197,0.00013250553,0.0009464715,0.0008392881,0.00007124902,0.00060774176,0.00019909999,0.040053852,0.5084544,0.13952038,0.019570658,0.28919235],"study_design_scores_gemma":[0.0001685412,0.0012667284,0.0024931685,0.00016017361,0.00018359572,0.0015993954,0.000043290634,0.320448,0.38637683,0.011270621,0.27590764,0.00008198487],"about_ca_topic_score_codex":0.00082082127,"about_ca_topic_score_gemma":0.0011844367,"teacher_disagreement_score":0.0045576734,"about_ca_system_score_codex":0.0005726775,"about_ca_system_score_gemma":0.0009900654,"threshold_uncertainty_score":0.015246928},"labels":[],"label_agreement":null},{"id":"W1598327503","doi":"10.1109/icc.1995.524277","title":"A unified design approach for dilated banyan switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of British Columbia","funders":"","keywords":"Banyan; Multistage interconnection networks; Computer science; Throughput; Computer network; Bandwidth (computing); Dilation (metric space); Parallel computing; Topology (electrical circuits); Mathematics; Interconnection; Telecommunications; Combinatorics; Wireless","score_opus":0.08107596182541443,"score_gpt":0.22652874482688093,"score_spread":0.1454527830014665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598327503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055962265,0.0000998457,0.9910198,0.000041243067,0.00002631255,0.00004178235,0.000010925126,0.00017199402,0.002991908],"genre_scores_gemma":[0.3577549,0.00047882125,0.63493955,0.00013870349,0.000097108634,0.00032577998,0.00006751699,0.000068100606,0.0061295405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955505,0.00010066012,0.00002403085,0.00008091632,0.00019324725,0.000046033463],"domain_scores_gemma":[0.9997634,0.000047855112,0.000026553056,0.00004475445,0.000102706035,0.000014651409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005382459,0.00043031236,0.00042832174,0.00035855285,0.00041800019,0.00074722216,0.001148999,0.0004884236,0.0019106832],"category_scores_gemma":[0.0006916935,0.0002826737,0.00041916312,0.00024270214,0.00042565627,0.000995012,0.0006484907,0.00074290636,0.00037167285],"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.00019133874,0.0001421254,0.0005752062,0.00032536796,0.00009258124,0.00025431658,0.00026175685,0.37722787,0.16062465,0.246152,0.002691602,0.21146126],"study_design_scores_gemma":[0.000036904206,0.00033161126,0.00019125515,0.000024697001,0.000049695856,0.00019747364,0.000031051248,0.9198341,0.022375692,0.03444911,0.022450557,0.00002781402],"about_ca_topic_score_codex":0.00057972193,"about_ca_topic_score_gemma":0.0008846784,"teacher_disagreement_score":0.0019106832,"about_ca_system_score_codex":0.0006423766,"about_ca_system_score_gemma":0.0006533748,"threshold_uncertainty_score":0.006391883},"labels":[],"label_agreement":null},{"id":"W1599706562","doi":"10.1109/fpt.2004.1393308","title":"A scalable and pipelined FPGA implementation of an OC192 WF scheduler","year":2005,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Computer science; Scalability; Field-programmable gate array; Scheduling (production processes); Queueing theory; Network packet; Schedule; Scheme (mathematics); Parallel computing; Embedded system; Computer network; Operating system","score_opus":0.013843275190411597,"score_gpt":0.2805552943912245,"score_spread":0.2667120192008129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599706562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16246067,0.0006714085,0.7888717,0.00024775823,0.00037622932,0.00046781483,0.0005929223,0.011452253,0.034859248],"genre_scores_gemma":[0.65229166,0.0002342146,0.33700365,0.000111471665,0.00006076078,0.00012358384,0.0004595328,0.00013243774,0.009582712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986887,0.000012480319,0.00000754258,0.000026147787,0.000041987605,0.000042999425],"domain_scores_gemma":[0.9998846,0.00001784789,0.0000137812085,0.000025617002,0.000038344424,0.000019728417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016551258,0.00044281877,0.00021877355,0.0003977995,0.00035752167,0.00044803577,0.0010291924,0.00023467556,0.008010948],"category_scores_gemma":[0.00025347952,0.00020182034,0.00019110978,0.00036683938,0.00014888647,0.00035240786,0.0001795807,0.0003107035,0.0014142974],"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.0011789723,0.00033675067,0.0038226286,0.00041314363,0.00010556066,0.0006264174,0.00018067163,0.11427121,0.30123016,0.024749536,0.016943017,0.53614193],"study_design_scores_gemma":[0.00039198238,0.0011728052,0.0036607513,0.000061756036,0.000121725105,0.0005616712,0.00006702084,0.75385624,0.17080049,0.004100928,0.06511376,0.000090821115],"about_ca_topic_score_codex":0.006464166,"about_ca_topic_score_gemma":0.008035609,"teacher_disagreement_score":0.008010948,"about_ca_system_score_codex":0.0006919407,"about_ca_system_score_gemma":0.0008556743,"threshold_uncertainty_score":0.026799321},"labels":[],"label_agreement":null},{"id":"W160047886","doi":"","title":"Path-based multicasting in multicomputers","year":2007,"lang":"en","type":"article","venue":"Parallel and distributed computing and 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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Xcast; Protocol Independent Multicast; Source-specific multicast; Computer network; Distributed computing; Distance Vector Multicast Routing Protocol; Routing algorithm; Multicast address; Routing (electronic design automation); Routing protocol","score_opus":0.011615928782863457,"score_gpt":0.24363197022961663,"score_spread":0.23201604144675317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160047886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09400552,0.0016927215,0.8943919,0.00047975598,0.00013835909,0.000091198155,0.0000621497,0.0011189288,0.008019429],"genre_scores_gemma":[0.57533205,0.0009701855,0.41824552,0.00012475035,0.00007112074,0.0001135475,0.00012940119,0.00009421734,0.0049191792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963677,0.0001368391,0.000013908092,0.000049818194,0.00011930232,0.000043281478],"domain_scores_gemma":[0.9995443,0.00023000884,0.00004136227,0.000086729175,0.00007942717,0.000018146095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042028463,0.0002475303,0.00031426531,0.00058974087,0.00065712706,0.00046876128,0.0006201128,0.0005397764,0.0016866832],"category_scores_gemma":[0.0014530413,0.00023672439,0.00021255027,0.0007213717,0.00044742657,0.0013168807,0.00074863236,0.00036658885,0.0003039907],"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.0003417076,0.00009705844,0.0015396102,0.00032528848,0.00006985672,0.00029665232,0.00031046823,0.32017255,0.031907592,0.16397625,0.0062154406,0.47474745],"study_design_scores_gemma":[0.00004710168,0.0001562258,0.0004991703,0.000025477975,0.000021503152,0.00021034089,0.00007033748,0.87794185,0.011379107,0.09667826,0.012951204,0.00001941481],"about_ca_topic_score_codex":0.0008543211,"about_ca_topic_score_gemma":0.00091995246,"teacher_disagreement_score":0.0016866832,"about_ca_system_score_codex":0.000520686,"about_ca_system_score_gemma":0.00032521904,"threshold_uncertainty_score":0.0056425333},"labels":[],"label_agreement":null},{"id":"W1601323719","doi":"10.1007/11527954","title":"Combinatorial and algorithmic aspects of networking : first workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004 Banff, Alberta, Canada, August 2004, revised selected papers","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; The Internet; traceroute; Bipartite graph; Theoretical computer science; Computer network; Border Gateway Protocol; Internet backbone; IP forwarding; Distributed computing; Internet traffic; Network packet; Routing protocol; Graph; World Wide Web; Static routing","score_opus":0.0075175946600856275,"score_gpt":0.20375155179534715,"score_spread":0.19623395713526154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601323719","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021255244,0.24031326,0.095427014,0.08498754,0.10001104,0.00036232313,0.0071972394,0.0017440816,0.44870225],"genre_scores_gemma":[0.059397288,0.06746793,0.037212126,0.0022753445,0.0147865685,0.00013930534,0.005750676,0.0008901612,0.8120807],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913055,0.00009532123,0.00002893141,0.0002366664,0.0003627056,0.00014590708],"domain_scores_gemma":[0.9969157,0.00046339285,0.00006489918,0.00016700239,0.0018773014,0.0005116583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017391044,0.0021185814,0.0013761098,0.0026655444,0.002247288,0.0059482744,0.0019939495,0.0009124698,0.056831613],"category_scores_gemma":[0.003192342,0.0009817128,0.0007287383,0.0046161297,0.0020716419,0.0024506662,0.00090763223,0.0027760894,0.0072485823],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0001087271,0.000067271874,0.0006396416,0.00028544164,0.00003828564,0.000104330335,0.00016795378,0.0035795933,0.0008473188,0.04455556,0.8731305,0.076475434],"study_design_scores_gemma":[0.00006491607,0.00004394913,0.0030553155,0.00039586087,0.00009424699,0.0002906358,0.0004050601,0.0094938185,0.002038864,0.04667182,0.93738407,0.000061388724],"about_ca_topic_score_codex":0.24518931,"about_ca_topic_score_gemma":0.56843245,"teacher_disagreement_score":0.24518931,"about_ca_system_score_codex":0.017138023,"about_ca_system_score_gemma":0.011574794,"threshold_uncertainty_score":0.48752427},"labels":[],"label_agreement":null},{"id":"W160262093","doi":"","title":"One edge union of k shell graphs is cordial.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Shell (structure); Computer science; Telecommunications; Materials science; Composite material","score_opus":0.020721625719953788,"score_gpt":0.2217733056093445,"score_spread":0.2010516798893907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160262093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44732058,0.0009601228,0.26182416,0.0013168706,0.0007696571,0.0002295462,0.0015545492,0.0033762625,0.2826483],"genre_scores_gemma":[0.87430894,0.0007722767,0.051589206,0.0004590286,0.00018116272,0.00012680178,0.0020343862,0.00061039475,0.069917716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988907,0.00013172209,0.000098722296,0.00035982355,0.00020961628,0.00030948952],"domain_scores_gemma":[0.99631643,0.0008752975,0.0006183289,0.00076887035,0.0007305654,0.0006905524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115372,0.0008205617,0.00078399107,0.0012920494,0.0024548664,0.0033689784,0.00150701,0.0012888109,0.024255786],"category_scores_gemma":[0.00440534,0.0005758302,0.0008001914,0.0013961258,0.0024178629,0.005409488,0.0031122982,0.001500685,0.00586852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013470973,0.00029137413,0.0053161387,0.0009941749,0.00014333773,0.002646332,0.0015458111,0.0077121654,0.024843786,0.7948467,0.024025127,0.13628788],"study_design_scores_gemma":[0.00007477562,0.00026491407,0.0049603865,0.00028147534,0.00015735986,0.003010986,0.0011852928,0.028328925,0.027838672,0.8749564,0.058814295,0.00012637276],"about_ca_topic_score_codex":0.001255411,"about_ca_topic_score_gemma":0.0019158808,"teacher_disagreement_score":0.024255786,"about_ca_system_score_codex":0.000731533,"about_ca_system_score_gemma":0.0006716727,"threshold_uncertainty_score":0.08114368},"labels":[],"label_agreement":null},{"id":"W1603566622","doi":"10.1002/9780470986424.ch8","title":"Cluster Interconnection with Master‐Slave Bridges","year":2008,"lang":"en","type":"other","venue":"","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 Manitoba","funders":"","keywords":"Bridge (graph theory); Cluster (spacecraft); Interconnection; Computer science; Node (physics); Computer network; Network packet; Markov chain; Transmission (telecommunications); Service (business); Engineering; Telecommunications; Structural engineering","score_opus":0.016257203955993754,"score_gpt":0.20786826832900038,"score_spread":0.19161106437300662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603566622","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29942733,0.0006511463,0.64581764,0.0005386657,0.00016781835,0.00010679083,0.00025319113,0.0010951348,0.051942214],"genre_scores_gemma":[0.948802,0.00036628876,0.026519496,0.0000622227,0.000038375296,0.000079932026,0.00016643417,0.00010782712,0.02385746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998154,0.0000342343,0.0000045928073,0.000043464443,0.00006428212,0.000038022314],"domain_scores_gemma":[0.99979216,0.000084207066,0.000020710413,0.000039432933,0.00005118036,0.000012298537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030518856,0.00023375308,0.0003726091,0.00019935488,0.00037057695,0.0006302978,0.0006866165,0.00030963717,0.0052120155],"category_scores_gemma":[0.0006594484,0.00025096082,0.00036581102,0.0004450402,0.0002681743,0.0007190296,0.00037910836,0.0004846266,0.00050240685],"study_design_candidate":"bench_or_experimental","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.00009377294,0.000057269946,0.001040973,0.0000490018,0.000040938863,0.00009100511,0.00008457632,0.8518751,0.00843707,0.10812552,0.004139548,0.025965171],"study_design_scores_gemma":[0.0000051596535,0.000013782531,0.0002587153,0.0000024381495,0.00000572075,0.000016712656,0.000008859202,0.9910817,0.0009872003,0.0062524616,0.0013642131,0.0000030159258],"about_ca_topic_score_codex":0.0035404947,"about_ca_topic_score_gemma":0.0045402567,"teacher_disagreement_score":0.0052120155,"about_ca_system_score_codex":0.001101354,"about_ca_system_score_gemma":0.0006500587,"threshold_uncertainty_score":0.017435908},"labels":[],"label_agreement":null},{"id":"W1606402180","doi":"10.1109/pacrim.1995.519415","title":"Performance of the Fat-Banyan switch under non-uniform traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 British Columbia","funders":"","keywords":"Banyan; Computer network; Bandwidth (computing); Computer science","score_opus":0.018231802896700615,"score_gpt":0.20246240450589248,"score_spread":0.18423060160919186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606402180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529076,0.00015285001,0.003373728,0.000059178416,0.000014609865,0.000005654963,0.00003952986,0.00015588032,0.0009077287],"genre_scores_gemma":[0.99923575,0.000053880558,0.0004422073,0.000012649187,0.0000057815905,0.0000022580502,0.000044355314,0.000011913312,0.00019123606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990758,0.00020006462,0.000047219415,0.00013383625,0.00021961487,0.00032355636],"domain_scores_gemma":[0.99591523,0.00252275,0.00034640162,0.000300033,0.0006546137,0.00026088432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295934,0.00051604153,0.00062238914,0.0004521441,0.0006894946,0.00074383325,0.00067889044,0.00078245316,0.0016972981],"category_scores_gemma":[0.0047477228,0.00016685996,0.00019889067,0.0006519175,0.0009621553,0.0010130309,0.0005069799,0.0004893361,0.000271128],"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.011080506,0.00061083736,0.02189541,0.00027263252,0.0002536418,0.00092667656,0.000592866,0.6507868,0.27110228,0.0066017834,0.0017953063,0.03408123],"study_design_scores_gemma":[0.0001542499,0.001978488,0.01230928,0.000015330888,0.000117365584,0.00038878826,0.0001832549,0.8825836,0.099829264,0.002099019,0.0002848218,0.000056563604],"about_ca_topic_score_codex":0.0034886652,"about_ca_topic_score_gemma":0.0016554183,"teacher_disagreement_score":0.0034886652,"about_ca_system_score_codex":0.0008652593,"about_ca_system_score_gemma":0.0006580468,"threshold_uncertainty_score":0.006936729},"labels":[],"label_agreement":null},{"id":"W161262107","doi":"","title":"Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Line graph; Mathematics; Cubic graph; Butterfly graph; Voltage graph; Combinatorics; Null graph; Simplex graph; Graph; Discrete mathematics; Regular graph","score_opus":0.0124261256614257,"score_gpt":0.20146713975832303,"score_spread":0.18904101409689733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161262107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59187055,0.0016212811,0.23221482,0.0021703313,0.00024536104,0.00009184692,0.001346721,0.00036378464,0.17007531],"genre_scores_gemma":[0.9701054,0.00084970327,0.015948812,0.00014778858,0.00021227413,0.00007247511,0.0007092356,0.000065593165,0.011888715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997315,0.000080412756,0.000012920782,0.00007334279,0.00005791698,0.00004392574],"domain_scores_gemma":[0.9981213,0.00083094265,0.00044578605,0.00012518933,0.0002766972,0.00020000848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002893222,0.0002837624,0.00029081583,0.0013656867,0.00088903366,0.0018064196,0.0005137045,0.0005495769,0.007197589],"category_scores_gemma":[0.0032760873,0.00026356254,0.00035633025,0.0010950654,0.001480647,0.00366382,0.0010213441,0.0008957018,0.00061001355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040658786,0.000010458254,0.0005868284,0.00003825405,0.000008571238,0.000080488586,0.00018644183,0.0022932824,0.00073771394,0.98552763,0.002127638,0.008362093],"study_design_scores_gemma":[0.000014712296,0.000026359123,0.0010391814,0.00002254267,0.000022250206,0.0002706554,0.00021568038,0.0152779715,0.00066586264,0.9751042,0.007328204,0.00001247519],"about_ca_topic_score_codex":0.0014448239,"about_ca_topic_score_gemma":0.0018473557,"teacher_disagreement_score":0.007197589,"about_ca_system_score_codex":0.00058889604,"about_ca_system_score_gemma":0.00030556152,"threshold_uncertainty_score":0.02407831},"labels":[],"label_agreement":null},{"id":"W1627195273","doi":"10.1109/icc.1993.397570","title":"Performance analysis of output buffered multipath multistage interconnection networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Computer science; Multipath propagation; Interconnection; Multistage interconnection networks; Computer network; Buffer (optical fiber); Parallel computing; Telecommunications","score_opus":0.0261733164845351,"score_gpt":0.21572514709882473,"score_spread":0.18955183061428962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627195273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59345615,0.0014738559,0.38939434,0.00022746185,0.0000358099,0.00005233801,0.0002824881,0.0009643492,0.014113236],"genre_scores_gemma":[0.9910048,0.00026648818,0.007641134,0.000013385825,0.000007682992,0.000016863627,0.00007789033,0.000023776352,0.0009479252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995685,0.00013699676,0.000017177192,0.000052428477,0.00014504683,0.00007990638],"domain_scores_gemma":[0.99884295,0.00055664877,0.00017803343,0.00010319204,0.00028324124,0.000035846206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066254113,0.00065478985,0.00030611028,0.0005055207,0.00024350248,0.0007341019,0.00047804293,0.000390667,0.0019702325],"category_scores_gemma":[0.0028829116,0.0001673389,0.00029742232,0.0005502588,0.00029056307,0.00070175057,0.00042061412,0.0002533365,0.00016979856],"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.00014460836,0.000011928768,0.0009294593,0.000050428316,0.000019133933,0.00005853057,0.000027463459,0.97990936,0.0048772455,0.003609525,0.00021713754,0.010145097],"study_design_scores_gemma":[0.000003446858,0.00005916488,0.00019031638,0.0000044867784,0.000008920515,0.000017341472,0.0000062749596,0.996249,0.0025564688,0.00074686285,0.00015438342,0.0000033971562],"about_ca_topic_score_codex":0.0031363396,"about_ca_topic_score_gemma":0.0016274266,"teacher_disagreement_score":0.0031363396,"about_ca_system_score_codex":0.0012441819,"about_ca_system_score_gemma":0.00043427953,"threshold_uncertainty_score":0.009027243},"labels":[],"label_agreement":null},{"id":"W1636089511","doi":"10.1109/icdcs.1994.302421","title":"On the impact of sense of direction in arbitrary networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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","funders":"","keywords":"Sense (electronics); Computer science; Engineering; Electrical engineering","score_opus":0.020141444544892646,"score_gpt":0.23277899139763983,"score_spread":0.2126375468527472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636089511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5191115,0.0076747905,0.3897397,0.014831575,0.0008958836,0.000112835834,0.0003872702,0.0008678649,0.066378646],"genre_scores_gemma":[0.97126096,0.0023318564,0.021413317,0.0004363075,0.0003899153,0.000104672064,0.00013331078,0.00015031364,0.0037793622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979892,0.0009362958,0.000065963664,0.00027196875,0.0003890827,0.0003476633],"domain_scores_gemma":[0.9265554,0.06567031,0.0033977856,0.002113107,0.0013996925,0.0008636934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023369973,0.00087835494,0.0009978642,0.00075501914,0.0011593369,0.0022378305,0.0010221511,0.0012902779,0.007913874],"category_scores_gemma":[0.038557176,0.00037107826,0.00054989074,0.0012498635,0.002987501,0.0052548912,0.0017593431,0.002447415,0.0007107628],"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.0010776568,0.00026260794,0.007554629,0.0006225066,0.00014092209,0.0006079166,0.00037798527,0.53275764,0.009179321,0.35166413,0.012355444,0.08339926],"study_design_scores_gemma":[0.00007750247,0.00040922593,0.002412832,0.00006576639,0.00006655007,0.00047761,0.00025242666,0.75824195,0.0042673196,0.22926895,0.0044077346,0.00005221697],"about_ca_topic_score_codex":0.001167738,"about_ca_topic_score_gemma":0.00092459517,"teacher_disagreement_score":0.007913874,"about_ca_system_score_codex":0.0011413138,"about_ca_system_score_gemma":0.0005930665,"threshold_uncertainty_score":0.026474595},"labels":[],"label_agreement":null},{"id":"W1644106052","doi":"10.1109/iwsoc.2004.38","title":"Evaluation of MP-SoC interconnect architectures: a case study","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","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 British Columbia","funders":"","keywords":"Computer science; Interconnection; Computer architecture; Network topology; Embedded system; System on a chip; Multiprocessing; Integrated circuit design; Latency (audio); Parallel computing; Computer network","score_opus":0.052348903584294636,"score_gpt":0.3449629018224926,"score_spread":0.292613998238198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644106052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95483476,0.00035126036,0.035488505,0.00022159173,0.000016426995,0.00023730106,0.00035113623,0.00029924943,0.008199776],"genre_scores_gemma":[0.9651039,0.00017126305,0.032818798,0.000028942539,0.0000072407634,0.000101454716,0.00022777144,0.00004833143,0.001492347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981875,0.0008788007,0.00009237967,0.00009448448,0.0005863596,0.00016051733],"domain_scores_gemma":[0.99338394,0.0043220366,0.00035443288,0.00050856994,0.0012663794,0.00016464779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019870999,0.0006039666,0.0003430394,0.00082424725,0.0003982307,0.000671665,0.00095537317,0.0008288998,0.0019408246],"category_scores_gemma":[0.0074948086,0.00020169147,0.0003215665,0.0010859397,0.00049262564,0.00078808377,0.0006018021,0.00041644648,0.00021590371],"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.0011743022,0.0009715571,0.017072193,0.0016625749,0.00013581471,0.0042958697,0.00090247666,0.73140615,0.045035593,0.017102474,0.004433212,0.17580783],"study_design_scores_gemma":[0.00012469792,0.0021329953,0.006455648,0.0000632083,0.00007450024,0.0011420135,0.00074283994,0.92058724,0.057623338,0.004077862,0.0069469446,0.00002877839],"about_ca_topic_score_codex":0.0016748888,"about_ca_topic_score_gemma":0.002509664,"teacher_disagreement_score":0.0019870999,"about_ca_system_score_codex":0.0008609733,"about_ca_system_score_gemma":0.00044024794,"threshold_uncertainty_score":0.010508895},"labels":[],"label_agreement":null},{"id":"W1644445135","doi":"10.1002/cpe.3330","title":"Capturing the sensitivity of optical network quality metrics to its network interface parameters","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; FP7 Information and Communication Technologies; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; SystemC; Scalability; Serialization; Network on a chip; Distributed computing; Network interface; Computer network; Interface (matter); Network architecture; Computer architecture; Architecture; Embedded system; Parallel computing","score_opus":0.04617414862232739,"score_gpt":0.3412086375550242,"score_spread":0.2950344889326968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644445135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89122075,0.00043338275,0.10177785,0.00013963834,0.000047474135,0.00003646646,0.00029351257,0.0007393712,0.005311598],"genre_scores_gemma":[0.99514174,0.000072728595,0.0041764597,0.00001833748,0.000005784629,0.000010517583,0.00013022822,0.000037986465,0.00040620708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996506,0.00006995663,0.000013552002,0.00007932675,0.00013758005,0.00004889217],"domain_scores_gemma":[0.9982614,0.0008400084,0.00034170513,0.00022241179,0.00028798752,0.000046512887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068391644,0.00041261537,0.00019647523,0.00085844076,0.00014667374,0.0006511553,0.00026559873,0.0003382255,0.0014233509],"category_scores_gemma":[0.003573277,0.00015144862,0.00017269303,0.0005566929,0.00033692888,0.0006260101,0.0003583644,0.0004248423,0.000172217],"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.00031588608,0.00013461843,0.035408042,0.00017727655,0.000091511334,0.0001677619,0.00017504305,0.76419336,0.104367554,0.0063860537,0.0011820156,0.087400876],"study_design_scores_gemma":[0.0000051395127,0.00010129263,0.0135571025,0.000016307875,0.000016014354,0.000080735495,0.00004626391,0.9577381,0.025055688,0.0025694617,0.00079204177,0.000021842816],"about_ca_topic_score_codex":0.0029357586,"about_ca_topic_score_gemma":0.0017278953,"teacher_disagreement_score":0.0029357586,"about_ca_system_score_codex":0.00046999555,"about_ca_system_score_gemma":0.00026903683,"threshold_uncertainty_score":0.005837381},"labels":[],"label_agreement":null},{"id":"W1664130632","doi":"10.1109/iscas.2003.1206289","title":"A semi-Gray encoding algorithm for low-power state assignment","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Windsor","funders":"","keywords":"Computer science; Algorithm; Encoding (memory); Gray (unit); Artificial intelligence","score_opus":0.01269325242089233,"score_gpt":0.23593523706207073,"score_spread":0.2232419846411784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664130632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072061233,0.000116173454,0.9900379,0.00008302059,0.000024636514,0.000043316515,0.000036571986,0.00091326796,0.0015389888],"genre_scores_gemma":[0.12121323,0.00015557508,0.87484884,0.00012495219,0.00001807609,0.0001481898,0.00020356812,0.00017296022,0.0031146412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000065153734,0.000016839964,0.00005963559,0.00010018762,0.000032106225],"domain_scores_gemma":[0.9996377,0.00016591232,0.00003532619,0.000084364045,0.00006193598,0.000014793104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042291952,0.00058437604,0.0005305849,0.0008487069,0.0004184242,0.00053583697,0.0007310093,0.000569168,0.0040610516],"category_scores_gemma":[0.0012496071,0.0003289143,0.00039380055,0.00079663197,0.0007003666,0.0012352514,0.00084006204,0.00087305147,0.0008879623],"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.0002250394,0.00013620644,0.00024366117,0.00011211006,0.000022288528,0.000071750634,0.00015365523,0.14317314,0.031943962,0.05708525,0.004215751,0.7626172],"study_design_scores_gemma":[0.00005225254,0.00012839146,0.000134544,0.000025581061,0.00001652983,0.00009515808,0.000020745672,0.9274701,0.021309335,0.045384463,0.005341483,0.00002144164],"about_ca_topic_score_codex":0.0016068637,"about_ca_topic_score_gemma":0.0019212095,"teacher_disagreement_score":0.0040610516,"about_ca_system_score_codex":0.0006356451,"about_ca_system_score_gemma":0.0008328243,"threshold_uncertainty_score":0.0135855675},"labels":[],"label_agreement":null},{"id":"W1666232924","doi":"10.1109/fpl.2015.7293965","title":"Design and simulation tools for Embedded NOCs on FPGAs","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Computer architecture; Embedding; Parallel computing","score_opus":0.14795082843122775,"score_gpt":0.31690155688922284,"score_spread":0.16895072845799508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666232924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03425063,0.00035596802,0.9445398,0.00019129417,0.00012422797,0.00032337944,0.00082986144,0.006115389,0.013269453],"genre_scores_gemma":[0.2672289,0.00070142886,0.7203012,0.00017330878,0.00004521034,0.0014761855,0.0013164867,0.0010046178,0.0077525633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952936,0.00013811416,0.00003760002,0.00003272793,0.00021067067,0.000051504274],"domain_scores_gemma":[0.9993198,0.00033017434,0.00006938078,0.00011437932,0.00013580652,0.000030498633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006929269,0.00086841406,0.00048634235,0.000537491,0.0003247227,0.00066125393,0.0012759779,0.0005133486,0.0070101027],"category_scores_gemma":[0.0016463483,0.00041503855,0.00055597443,0.00035404696,0.0004411316,0.00054256106,0.0004206847,0.0008721756,0.00094915606],"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.00013184588,0.000101867634,0.0012314082,0.0004960607,0.00007507281,0.00020689124,0.00019156659,0.8996084,0.023810413,0.027749494,0.003940358,0.042456582],"study_design_scores_gemma":[0.000096487136,0.000113581154,0.00033697044,0.000046344863,0.000023764416,0.000071393646,0.000029626446,0.9561548,0.019765988,0.0063030636,0.017039027,0.000018996401],"about_ca_topic_score_codex":0.0020686246,"about_ca_topic_score_gemma":0.0017481844,"teacher_disagreement_score":0.0070101027,"about_ca_system_score_codex":0.00051327987,"about_ca_system_score_gemma":0.00079366105,"threshold_uncertainty_score":0.02345115},"labels":[],"label_agreement":null},{"id":"W1693775031","doi":"","title":"Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chordal graph; Indifference graph; Pancyclic graph; Combinatorics; 1-planar graph; Pathwidth; Maximal independent set; Discrete mathematics; Graph; Line graph","score_opus":0.008639259654158413,"score_gpt":0.21023155357091586,"score_spread":0.20159229391675745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1693775031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81224656,0.0006531113,0.12731297,0.0014885634,0.00018353426,0.00007236626,0.00068237016,0.0005915206,0.056768965],"genre_scores_gemma":[0.9773473,0.00025484792,0.013863053,0.0002954788,0.000045681696,0.000034440385,0.0003773831,0.00005573293,0.0077261855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979025,0.000029662646,0.000009617844,0.000047856673,0.00006188432,0.000060790237],"domain_scores_gemma":[0.9991357,0.00022140295,0.00023975695,0.0001376916,0.00012479015,0.00014073403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001667189,0.0002793012,0.00041559362,0.0006945206,0.0010796068,0.0008294122,0.0008841854,0.00058639806,0.005784386],"category_scores_gemma":[0.0009777648,0.00021902818,0.00033081186,0.001179639,0.00067330827,0.0012583721,0.0008617649,0.0010510014,0.00036600814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000503178,0.00016542409,0.003487518,0.00037029214,0.00005442376,0.0011350039,0.00083905103,0.09155022,0.026079303,0.78180623,0.01197501,0.08203443],"study_design_scores_gemma":[0.00008051076,0.0001254674,0.0032979033,0.000037515827,0.00004451496,0.00069246575,0.00054040743,0.13442,0.0070428634,0.8431537,0.010525971,0.000038824455],"about_ca_topic_score_codex":0.0030156935,"about_ca_topic_score_gemma":0.0059611257,"teacher_disagreement_score":0.005784386,"about_ca_system_score_codex":0.00083161064,"about_ca_system_score_gemma":0.0005767104,"threshold_uncertainty_score":0.019350708},"labels":[],"label_agreement":null},{"id":"W1696031286","doi":"10.1109/glsv.1999.757444","title":"A VLSI architecture for ATM algorithm-agile encryption","year":2003,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Encryption; Computer network; Sorting; Multicast; Queue; Cryptography; Algorithm; Embedded system","score_opus":0.012093263451548155,"score_gpt":0.22990271970715154,"score_spread":0.21780945625560338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696031286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829657,0.0013557444,0.89496815,0.00041947083,0.00037030954,0.0001669151,0.00015470223,0.0021037506,0.017495325],"genre_scores_gemma":[0.61878383,0.0008856347,0.36891738,0.000320723,0.000117414886,0.00009426016,0.0002464947,0.0000657142,0.0105685145],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998797,0.000016260637,0.00000906097,0.000019212648,0.000047877023,0.000027825772],"domain_scores_gemma":[0.9998816,0.000021327924,0.000012549415,0.0000179366,0.000056850007,0.00000974666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020808239,0.00021160452,0.00013163529,0.00031943616,0.00033325717,0.00066504505,0.00070561265,0.00035841117,0.0037383118],"category_scores_gemma":[0.00029063292,0.0001532558,0.00019835719,0.00033166006,0.0001911076,0.00068109325,0.0002110138,0.00036683376,0.0009609213],"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.00049653224,0.00015435206,0.0018826935,0.00042957475,0.00010047253,0.00060531235,0.00016476275,0.025187502,0.46064746,0.11690516,0.010471665,0.38295436],"study_design_scores_gemma":[0.00024061212,0.0022984652,0.0021884094,0.000102098034,0.00026936384,0.0030815594,0.00011042505,0.39483264,0.41377744,0.026296267,0.15669677,0.00010587943],"about_ca_topic_score_codex":0.000434921,"about_ca_topic_score_gemma":0.0007348466,"teacher_disagreement_score":0.0037383118,"about_ca_system_score_codex":0.00047691693,"about_ca_system_score_gemma":0.00039019823,"threshold_uncertainty_score":0.012505889},"labels":[],"label_agreement":null},{"id":"W172001932","doi":"","title":"An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.01060679274702316,"score_gpt":0.24529651187151613,"score_spread":0.23468971912449296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172001932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053085096,0.0008761409,0.9042123,0.0010018414,0.0002358145,0.0007697657,0.0015676667,0.009750132,0.02850129],"genre_scores_gemma":[0.22444768,0.00038619124,0.75850487,0.00028845423,0.00010855891,0.00080087216,0.0041042566,0.00081027584,0.010548849],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992423,0.00017649255,0.00005052051,0.00017861013,0.00020510527,0.00014697477],"domain_scores_gemma":[0.99779797,0.0010243283,0.00012916983,0.00061849324,0.00030289774,0.00012728336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060583313,0.0009889874,0.00078189827,0.0015226194,0.0011532876,0.0015627666,0.0022652445,0.0014391786,0.012913287],"category_scores_gemma":[0.005187943,0.0005413515,0.00067793846,0.002441326,0.0007448544,0.0027680274,0.002587673,0.0010912364,0.0031247712],"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.0007516216,0.0004520018,0.0016144781,0.0006374573,0.00011436365,0.00036014192,0.00044404736,0.060139086,0.012786265,0.086453676,0.083526544,0.75272036],"study_design_scores_gemma":[0.0006460892,0.00031433714,0.0010449002,0.00010659561,0.0001339533,0.0006724334,0.00030919773,0.6794746,0.0143574,0.25830048,0.044562202,0.000077798635],"about_ca_topic_score_codex":0.0042118547,"about_ca_topic_score_gemma":0.0072988244,"teacher_disagreement_score":0.012913287,"about_ca_system_score_codex":0.0012356596,"about_ca_system_score_gemma":0.002387986,"threshold_uncertainty_score":0.04319924},"labels":[],"label_agreement":null},{"id":"W172494826","doi":"","title":"Maximum Number of Contractible Edges on Longest Cycles of a 3-Connected Graph.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics; Graph","score_opus":0.013649292137118964,"score_gpt":0.25014681230987906,"score_spread":0.2364975201727601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172494826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272417,0.00095418503,0.032656424,0.0008357264,0.000107459266,0.000089748675,0.0033339525,0.00022685972,0.03455402],"genre_scores_gemma":[0.9613866,0.0006389826,0.026703494,0.0001407664,0.00006715023,0.0001204851,0.0017396443,0.0000902482,0.009112651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.00009034566,0.000037128702,0.00009288298,0.00009091706,0.00011556918],"domain_scores_gemma":[0.99646086,0.0017093007,0.00055881427,0.0002872357,0.00034670957,0.0006370743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039477053,0.0004846707,0.00045414423,0.0010778018,0.0013144767,0.0014608268,0.00097340695,0.0010911557,0.009822915],"category_scores_gemma":[0.0030798758,0.00037579972,0.0004622573,0.00092227635,0.0008457268,0.0020123331,0.0008402566,0.00058011134,0.0008533449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037853369,0.0004088105,0.021800358,0.0022553569,0.00035927325,0.0020088956,0.0019102917,0.050078645,0.11688714,0.58424836,0.027403574,0.18885393],"study_design_scores_gemma":[0.00029442928,0.0005055237,0.019886624,0.00044540947,0.00031812256,0.0030691547,0.0014999163,0.079339296,0.048051514,0.794139,0.052305017,0.00014600098],"about_ca_topic_score_codex":0.00087409274,"about_ca_topic_score_gemma":0.0021000477,"teacher_disagreement_score":0.009822915,"about_ca_system_score_codex":0.0005780562,"about_ca_system_score_gemma":0.00057122036,"threshold_uncertainty_score":0.032860875},"labels":[],"label_agreement":null},{"id":"W1758157050","doi":"10.1109/iscas.2006.1693515","title":"Architecture of a hypertransport tunnel","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ranging; Latency (audio); Architecture; Interconnection; Chip; Embedded system; Computer architecture; Low latency (capital markets); System on a chip; Network packet; Computer network; Telecommunications","score_opus":0.004641886216946245,"score_gpt":0.17406423488493228,"score_spread":0.16942234866798603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758157050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14980333,0.00072944054,0.81104475,0.0004113105,0.00024225931,0.00020857327,0.00018637585,0.003329835,0.034044202],"genre_scores_gemma":[0.75791115,0.00049356796,0.22014184,0.00015395276,0.00005971062,0.00017619673,0.00025301072,0.00013501872,0.020675585],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997662,0.000047881542,0.000016329823,0.00004049726,0.000089529174,0.00003960436],"domain_scores_gemma":[0.99971503,0.00003673511,0.000025724456,0.00006992912,0.00010104453,0.00005145836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002848415,0.00022640824,0.00023748848,0.00044257374,0.0005562686,0.00094963866,0.0010118204,0.0006327499,0.0052844863],"category_scores_gemma":[0.00034815757,0.0002479004,0.0003265108,0.00027978653,0.0004476537,0.0013193055,0.00088034704,0.0005704625,0.0013156809],"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.0009257679,0.00031315026,0.002854869,0.00049701566,0.000117093165,0.0013472207,0.0006306831,0.09968194,0.3291838,0.28140393,0.008617186,0.27442735],"study_design_scores_gemma":[0.00018742516,0.0017751398,0.0019781108,0.0001343874,0.0001334324,0.0028947908,0.00028364745,0.6176668,0.17810582,0.056413293,0.14023392,0.0001932742],"about_ca_topic_score_codex":0.00042423647,"about_ca_topic_score_gemma":0.00057757844,"teacher_disagreement_score":0.0052844863,"about_ca_system_score_codex":0.00033882144,"about_ca_system_score_gemma":0.00054593163,"threshold_uncertainty_score":0.01767838},"labels":[],"label_agreement":null},{"id":"W1760467556","doi":"10.1109/icapp.1995.472164","title":"Synthesis of systolic arrays from single assignment algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Selection (genetic algorithm); Computer science; Algorithm; Systolic array; Visibility; Dependency (UML); Algorithm design; Matrix (chemical analysis); Parallel algorithm; Artificial intelligence; Very-large-scale integration; Embedded system","score_opus":0.025102369890829423,"score_gpt":0.19880337101476023,"score_spread":0.1737010011239308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760467556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006310228,0.0001283359,0.9882157,0.00003790456,0.000056986195,0.000039921426,0.000038891685,0.000750399,0.0044216686],"genre_scores_gemma":[0.080196194,0.00022799686,0.91566396,0.000047661244,0.00003704269,0.00014606863,0.00012915565,0.00015956869,0.0033924454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997303,0.000052902185,0.000023894145,0.000050655926,0.00011636889,0.000026023294],"domain_scores_gemma":[0.99974173,0.00007468398,0.000027858465,0.00005381692,0.00008822932,0.00001367699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028275722,0.00041145508,0.00034536462,0.0004453449,0.00037351332,0.0005398495,0.00062206807,0.00022783119,0.003478958],"category_scores_gemma":[0.00076885364,0.00027249943,0.00039580642,0.0004892176,0.00034168683,0.0005263173,0.00040653007,0.0005536386,0.0011379654],"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.0001230929,0.000070088216,0.00039932318,0.0004076341,0.000048837854,0.0001500618,0.00023981807,0.08431485,0.13662374,0.16940731,0.004552484,0.60366267],"study_design_scores_gemma":[0.000110328154,0.0004992484,0.0005629181,0.00012996561,0.000068379384,0.00044284217,0.00008791616,0.60735357,0.20835754,0.1051496,0.0771915,0.00004624372],"about_ca_topic_score_codex":0.00031906058,"about_ca_topic_score_gemma":0.0006951894,"teacher_disagreement_score":0.003478958,"about_ca_system_score_codex":0.00031870673,"about_ca_system_score_gemma":0.0008237997,"threshold_uncertainty_score":0.011638224},"labels":[],"label_agreement":null},{"id":"W177200576","doi":"","title":"3-restricted edge connectivity of vertex transitive graphs","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Mathematics; Transitive relation; Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Computer science; Telecommunications","score_opus":0.010790451077434449,"score_gpt":0.22510424006502486,"score_spread":0.2143137889875904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177200576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833183,0.0003915631,0.10240784,0.0006474441,0.00007526806,0.00008158071,0.00082491,0.00046809696,0.06192032],"genre_scores_gemma":[0.982143,0.00033183597,0.010943133,0.00016386766,0.000069189424,0.00010091387,0.0007206046,0.000089277106,0.0054383017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.00019110914,0.00006504276,0.00016538709,0.00015281806,0.00013005208],"domain_scores_gemma":[0.99591845,0.0021174063,0.0007594266,0.0005295498,0.0002963974,0.00037867617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055074255,0.00046316133,0.00076689874,0.0014229023,0.0012048428,0.0027221707,0.0012015399,0.0010254995,0.009442736],"category_scores_gemma":[0.0036059564,0.0005697678,0.00062919495,0.0015135846,0.0013916694,0.0034074604,0.0015226201,0.0013954558,0.00071081053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034426057,0.00010233046,0.0024787756,0.00020534,0.0000551612,0.0007292463,0.000953687,0.014117866,0.010149884,0.9466053,0.0037949178,0.02046321],"study_design_scores_gemma":[0.0000608615,0.000042977128,0.0015863567,0.00003192549,0.000044891913,0.0006327669,0.0002748623,0.029973887,0.002398828,0.96059024,0.004338154,0.000024209887],"about_ca_topic_score_codex":0.0009567478,"about_ca_topic_score_gemma":0.0013503013,"teacher_disagreement_score":0.009442736,"about_ca_system_score_codex":0.00053019734,"about_ca_system_score_gemma":0.0004138393,"threshold_uncertainty_score":0.03158915},"labels":[],"label_agreement":null},{"id":"W178290692","doi":"10.1007/0-387-29026-5_16","title":"Topological Properties of Interconnection Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Interconnection; Topology (electrical circuits); Computer science; Mathematics; Computer network; Combinatorics","score_opus":0.030159588528763923,"score_gpt":0.21497609550495522,"score_spread":0.18481650697619129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178290692","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03763746,0.036724325,0.36322385,0.0023737887,0.0015932707,0.000101848804,0.0011568597,0.001194543,0.55599403],"genre_scores_gemma":[0.64583063,0.055139415,0.1337757,0.00069107243,0.002807114,0.0003988091,0.0026679793,0.0008786013,0.15781064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975735,0.00004034887,0.000015851783,0.000052088937,0.000111805726,0.000022552951],"domain_scores_gemma":[0.99954456,0.0002038143,0.000045082907,0.00008756795,0.00008866052,0.00003038436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002618451,0.0007026524,0.00044920217,0.0015829402,0.00040347365,0.0022035409,0.00053863775,0.0004899524,0.008917366],"category_scores_gemma":[0.0014597053,0.00048091228,0.00030761398,0.0018003861,0.00096379983,0.0027221164,0.00065038464,0.0012551945,0.0022554328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015040016,0.000013097334,0.00015214176,0.000207159,0.000011610215,0.00007450643,0.00013786533,0.0069824313,0.0031954686,0.91625535,0.011872776,0.061082575],"study_design_scores_gemma":[0.0000061863307,0.000025730502,0.0002823498,0.00006960313,0.0000123995405,0.00032108682,0.000061085375,0.013017715,0.0013763899,0.88760805,0.0972058,0.000013566833],"about_ca_topic_score_codex":0.00022318514,"about_ca_topic_score_gemma":0.0002169001,"teacher_disagreement_score":0.008917366,"about_ca_system_score_codex":0.00052985735,"about_ca_system_score_gemma":0.00031893956,"threshold_uncertainty_score":0.029831529},"labels":[],"label_agreement":null},{"id":"W1792738620","doi":"10.1109/pacrim.1999.799573","title":"End-system architecture for distributed networked multimedia applications: issues, trends and future directions","year":2003,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Computer science; Multimedia; Interfacing; Quality of service; Computer architecture; Computer network; Embedded system; Computer hardware","score_opus":0.009334296348931357,"score_gpt":0.23989520152143473,"score_spread":0.23056090517250338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1792738620","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07543372,0.09622331,0.7359568,0.018283213,0.0010784852,0.0006569414,0.00019032457,0.0036159873,0.06856124],"genre_scores_gemma":[0.32726958,0.05104026,0.5584646,0.0032796357,0.0016154937,0.0005134234,0.0007479704,0.0004276762,0.05664128],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.00019534063,0.000068404,0.00008511725,0.00032400584,0.00008964873],"domain_scores_gemma":[0.9980666,0.0003564556,0.00007611623,0.00016431278,0.0011533477,0.0001831385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028459202,0.00054145313,0.00045876703,0.00084057887,0.00049649435,0.0022519578,0.0016928118,0.0025858423,0.004710364],"category_scores_gemma":[0.0016682413,0.00030530294,0.00026704324,0.0011465374,0.0006378778,0.0041793217,0.0006071655,0.0011009135,0.0025724277],"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.00027297824,0.0005099661,0.0073376494,0.0017383446,0.00005267795,0.00041077562,0.000519049,0.020131858,0.035437766,0.105475456,0.013205686,0.8149078],"study_design_scores_gemma":[0.00023214806,0.0035761297,0.013880539,0.0018219625,0.00028711438,0.0027859788,0.0019669288,0.32452512,0.046662282,0.094716646,0.50931287,0.00023228071],"about_ca_topic_score_codex":0.0016270516,"about_ca_topic_score_gemma":0.0018881784,"teacher_disagreement_score":0.004710364,"about_ca_system_score_codex":0.0008836507,"about_ca_system_score_gemma":0.0009838997,"threshold_uncertainty_score":0.0157578},"labels":[],"label_agreement":null},{"id":"W1795074296","doi":"10.1109/iscas.1989.100738","title":"System level diagnosis with local constraints","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McGill University; Concordia University","funders":"","keywords":"Constraint (computer-aided design); Multiprocessing; Domain (mathematical analysis); Computer science; Ring (chemistry); Fault (geology); Local search (optimization); Local area network; Theoretical computer science; Algorithm; Parallel computing; Mathematics","score_opus":0.02609648534802966,"score_gpt":0.21461685183735324,"score_spread":0.18852036648932358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795074296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013177746,0.0004375513,0.9815938,0.00022969818,0.000038256243,0.00005814208,0.00010989595,0.00067659584,0.0036783882],"genre_scores_gemma":[0.5591322,0.00070087024,0.43594033,0.000251823,0.000086763175,0.00015570749,0.00038399265,0.00016012705,0.003188111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988826,0.00030513466,0.00007767384,0.00022493253,0.00038636543,0.00012326083],"domain_scores_gemma":[0.99753076,0.0013655649,0.00022884169,0.00046927508,0.00031922254,0.00008641012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000917727,0.000494406,0.0007026102,0.00067521003,0.00043527113,0.0016422911,0.0010288983,0.0007860171,0.0040441323],"category_scores_gemma":[0.0052356417,0.00028976775,0.0005851168,0.00087857555,0.0011668202,0.0024969107,0.0018520101,0.001346522,0.0006263255],"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.00036916402,0.00009211856,0.0023587572,0.00087331847,0.00010451848,0.0008896399,0.0003952409,0.4374629,0.02442454,0.24257974,0.005358266,0.28509185],"study_design_scores_gemma":[0.000041817184,0.0000915727,0.0002597896,0.000054589585,0.00004119801,0.00028619624,0.000052121497,0.8789707,0.013866999,0.0992382,0.007069661,0.000027165246],"about_ca_topic_score_codex":0.0019280822,"about_ca_topic_score_gemma":0.002225959,"teacher_disagreement_score":0.0040441323,"about_ca_system_score_codex":0.00087791315,"about_ca_system_score_gemma":0.0014010892,"threshold_uncertainty_score":0.013529003},"labels":[],"label_agreement":null},{"id":"W180089728","doi":"","title":"Restricted edge-connectivity and minimum edge-degree.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Degree (music); Mathematics; Computer science; Telecommunications; Physics","score_opus":0.02030007296313182,"score_gpt":0.23291870956597047,"score_spread":0.21261863660283864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180089728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35614464,0.007888191,0.41668847,0.004239904,0.00050921104,0.00011410149,0.0024069145,0.0007811578,0.21122742],"genre_scores_gemma":[0.9500092,0.003095189,0.029830908,0.00034239897,0.00028580282,0.000113534225,0.0010875119,0.00012468794,0.015110644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994518,0.00015454674,0.000030937364,0.00014685735,0.00011110531,0.000104690494],"domain_scores_gemma":[0.99700326,0.0017195884,0.00039715646,0.00035845675,0.00028576102,0.00023581322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004609674,0.00044852437,0.0005989387,0.00088111614,0.0005763892,0.0013271512,0.0012545993,0.0008789528,0.009672966],"category_scores_gemma":[0.00541561,0.00027793553,0.00029650444,0.0011447923,0.0011407862,0.0036251405,0.0010584979,0.0012453829,0.0014006083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002143107,0.00006551453,0.0014487613,0.00037430777,0.00004610226,0.00036288062,0.00015408202,0.015101597,0.0048623993,0.9157573,0.012946524,0.048666216],"study_design_scores_gemma":[0.000029700841,0.00003578904,0.0010100425,0.00004805655,0.000026616477,0.00073652004,0.00009380811,0.020810125,0.0014832426,0.9640252,0.011686283,0.000014596357],"about_ca_topic_score_codex":0.00042894468,"about_ca_topic_score_gemma":0.00068414916,"teacher_disagreement_score":0.009672966,"about_ca_system_score_codex":0.0004082034,"about_ca_system_score_gemma":0.00024794647,"threshold_uncertainty_score":0.032359302},"labels":[],"label_agreement":null},{"id":"W1801582292","doi":"10.1109/icc.1994.368868","title":"Design and performance analysis of an output-buffering ATM switch with complexity of O(Nlog/sub 2/N)","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Canada; Australian Government","keywords":"Computer science; Asynchronous Transfer Mode; Interconnection; Routing (electronic design automation); Topology (electrical circuits); Algorithm; Computer network; Mathematics; Combinatorics","score_opus":0.06502020691790479,"score_gpt":0.22703638566768136,"score_spread":0.16201617874977658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801582292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34235024,0.00076632533,0.6398698,0.00040093742,0.000060800718,0.00015115751,0.00022064801,0.0017700087,0.014410088],"genre_scores_gemma":[0.90400296,0.00019323538,0.092721894,0.000058790036,0.000033142736,0.000050381594,0.0001824456,0.000045155608,0.0027118754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997862,0.000053838205,0.000007884914,0.000029769279,0.000087383865,0.00003496163],"domain_scores_gemma":[0.9996532,0.0001627097,0.000037718,0.00002804512,0.00010053703,0.00001762128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029280726,0.0003894609,0.0002171774,0.00026498665,0.00034778702,0.00060488516,0.0005897541,0.00032721442,0.0031126342],"category_scores_gemma":[0.0006006363,0.0001765511,0.00018289145,0.00027699114,0.00022255487,0.0004036035,0.00019767068,0.000250945,0.00028204158],"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.00071253156,0.00015065237,0.0036507875,0.00028052958,0.00009968042,0.00027521676,0.0001410056,0.64194614,0.2130378,0.0177135,0.004509308,0.11748289],"study_design_scores_gemma":[0.000022447892,0.00017224261,0.0007145865,0.0000036088022,0.000023811508,0.000076053366,0.000010439628,0.98102164,0.015658809,0.00097406586,0.0013161652,0.0000062175654],"about_ca_topic_score_codex":0.002087535,"about_ca_topic_score_gemma":0.002372317,"teacher_disagreement_score":0.0031126342,"about_ca_system_score_codex":0.0009303555,"about_ca_system_score_gemma":0.00059772487,"threshold_uncertainty_score":0.010412812},"labels":[],"label_agreement":null},{"id":"W182272990","doi":"","title":"Restricted Edge Connectivity of Edge Transitive Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Transitive relation; Combinatorics; Computer science; Artificial intelligence","score_opus":0.009947330772996156,"score_gpt":0.21667002099512614,"score_spread":0.20672269022213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182272990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44242197,0.0023445007,0.35824457,0.0016157206,0.00037643465,0.00017947708,0.0025886004,0.0010093781,0.19121943],"genre_scores_gemma":[0.9594869,0.0013474054,0.023099557,0.0002562531,0.00022754246,0.00015040312,0.0017675445,0.00014101228,0.013523514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999286,0.00022201036,0.00005793005,0.00016987874,0.00015824733,0.00010609511],"domain_scores_gemma":[0.9963373,0.0019866573,0.00049827783,0.0006491236,0.00029471464,0.0002339706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003815106,0.00034670398,0.00046195314,0.0013566059,0.00068225054,0.0016262471,0.0008387707,0.00073004613,0.0108646145],"category_scores_gemma":[0.005398025,0.00034567164,0.0004076075,0.0014068794,0.0011078555,0.0035180217,0.0010773224,0.0011099571,0.00117346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012956464,0.000045892153,0.0013128251,0.0002387822,0.00004068294,0.0005536748,0.00030697105,0.009601981,0.004449915,0.9438128,0.008024213,0.031482704],"study_design_scores_gemma":[0.000032525815,0.000042682426,0.0011215606,0.000050768584,0.000042882595,0.0010619204,0.00016104708,0.029153435,0.0019908994,0.9511163,0.015207884,0.000018221539],"about_ca_topic_score_codex":0.0005992211,"about_ca_topic_score_gemma":0.00077702274,"teacher_disagreement_score":0.0108646145,"about_ca_system_score_codex":0.0004015126,"about_ca_system_score_gemma":0.0002543205,"threshold_uncertainty_score":0.03634578},"labels":[],"label_agreement":null},{"id":"W1840441498","doi":"10.1109/ccece.1995.528068","title":"Implementation of a window-based scheduler in an ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Quality of service; Computer network; Queue; Scheduling (production processes); Asynchronous Transfer Mode; Priority queue; Queueing theory; Packet switching; Network packet; Real-time computing; Distributed computing; Engineering","score_opus":0.03269776890614777,"score_gpt":0.2856342516614101,"score_spread":0.2529364827552623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840441498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22075675,0.000627198,0.75769013,0.00018805104,0.00058025087,0.0003495413,0.00025377778,0.013749853,0.0058044437],"genre_scores_gemma":[0.7878097,0.000302087,0.20733362,0.00013789393,0.00015057686,0.00015826951,0.00021315065,0.00025945864,0.0036352274],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968195,0.000057619374,0.000035380584,0.0000646531,0.000097108576,0.00006327345],"domain_scores_gemma":[0.9994349,0.00018767892,0.00005272651,0.00009735419,0.00013389508,0.000093405935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058143,0.00035057325,0.00040662583,0.00037263945,0.0003918759,0.0009872048,0.0014889643,0.0004415538,0.0025994848],"category_scores_gemma":[0.0013766584,0.00039744625,0.00024557824,0.0003324727,0.00029326908,0.0008001346,0.0003409063,0.000614793,0.00064514024],"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.004314945,0.0013543166,0.0142754745,0.00047044104,0.00029421793,0.0011896716,0.0006770734,0.1631971,0.40856478,0.037079614,0.012686927,0.3558954],"study_design_scores_gemma":[0.0003105816,0.00061853265,0.0016921381,0.00001828639,0.00011886177,0.0002109162,0.00003187451,0.8566521,0.12539853,0.002246668,0.012639902,0.00006158733],"about_ca_topic_score_codex":0.0024582178,"about_ca_topic_score_gemma":0.0017671282,"teacher_disagreement_score":0.0025994848,"about_ca_system_score_codex":0.0005734734,"about_ca_system_score_gemma":0.0010172045,"threshold_uncertainty_score":0.008696139},"labels":[],"label_agreement":null},{"id":"W1841472478","doi":"10.1109/ccece.1996.548276","title":"ATM switch design requirements under FEC environment","year":2002,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Computer science; Forward error correction; Asynchronous Transfer Mode; Computer network; Error detection and correction; Automatic repeat request; Wireless; Selective Repeat ARQ; ATM adaptation layer; Data loss; Hybrid automatic repeat request; Real-time computing; Telecommunications; Telecommunications link; Decoding methods","score_opus":0.09078932529860692,"score_gpt":0.2307365662246608,"score_spread":0.13994724092605387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841472478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2846563,0.0036546586,0.5343903,0.0023234698,0.0011182759,0.0009233086,0.002464724,0.00771815,0.16275083],"genre_scores_gemma":[0.8397223,0.0019229937,0.11070889,0.0006309744,0.00061922014,0.000490952,0.0023173478,0.00069696223,0.04289039],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.000059936276,0.000040173705,0.000071705945,0.00028420574,0.00011272906],"domain_scores_gemma":[0.9990606,0.00025284797,0.00010290021,0.000059882685,0.00047011915,0.00005374677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035434347,0.00053377805,0.0004562635,0.0005751857,0.00052283594,0.00089555886,0.0006818982,0.00077738636,0.015715653],"category_scores_gemma":[0.0012314814,0.00025145037,0.00016368445,0.00038083817,0.00011714298,0.0005918513,0.00032994003,0.0004220997,0.0037800632],"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.0008344545,0.00014012663,0.0023067575,0.0013641869,0.00004925174,0.0013104052,0.00036169495,0.03493856,0.7161735,0.024903579,0.020636477,0.19698094],"study_design_scores_gemma":[0.00034154352,0.0019522352,0.008537225,0.00020204313,0.00028475182,0.0074371193,0.00035204974,0.1614596,0.44314945,0.007893907,0.36825448,0.00013568],"about_ca_topic_score_codex":0.0006943736,"about_ca_topic_score_gemma":0.0007723685,"teacher_disagreement_score":0.015715653,"about_ca_system_score_codex":0.00047797483,"about_ca_system_score_gemma":0.0004886157,"threshold_uncertainty_score":0.052574098},"labels":[],"label_agreement":null},{"id":"W1842313047","doi":"10.1109/iwsoc.2004.18","title":"A step towards intelligent translation from high-level design to RTL","year":2004,"lang":"en","type":"article","venue":"IEEE International Workshop on System-on-Chip for Real-Time Applications","topic":"Interconnection Networks and Systems","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":"Université de Montréal","funders":"","keywords":"Computer science; sort; Compiler; High-level synthesis; Programming language; Merge (version control); Field-programmable gate array; Software; Intermediate language; Computer architecture; High-level programming language; Parallel computing; Embedded system; Database","score_opus":0.07616103253424063,"score_gpt":0.312498093884344,"score_spread":0.2363370613501034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842313047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021997108,0.00012615949,0.9866232,0.00044947787,0.00011391517,0.000082394254,0.00008726619,0.007043234,0.0032746461],"genre_scores_gemma":[0.031000162,0.0003121725,0.96204126,0.0004617326,0.00008726548,0.00013539371,0.00035504645,0.0027507008,0.0028562378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974112,0.00087844307,0.0002979114,0.00027607798,0.0009237207,0.00021258548],"domain_scores_gemma":[0.99303484,0.0021303534,0.00030573327,0.0024882792,0.0019303812,0.00011036069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034271914,0.0009711301,0.0008442171,0.0010718248,0.00047009767,0.0030995246,0.001912168,0.0008718955,0.0068563935],"category_scores_gemma":[0.009086535,0.0009637627,0.0011257613,0.0009040858,0.0012205667,0.0032519735,0.0012657889,0.0041695554,0.006226722],"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.0003369524,0.00041429492,0.0014356637,0.0014410156,0.00012783051,0.0005555368,0.0022240044,0.056443777,0.09356835,0.2864622,0.025594767,0.5313956],"study_design_scores_gemma":[0.0002315047,0.0006120144,0.00060514675,0.0006388485,0.00014188654,0.00064351095,0.00038490843,0.23549561,0.15838847,0.1560259,0.44666776,0.0001644651],"about_ca_topic_score_codex":0.001025211,"about_ca_topic_score_gemma":0.0008618581,"teacher_disagreement_score":0.0068563935,"about_ca_system_score_codex":0.0009532833,"about_ca_system_score_gemma":0.0019098369,"threshold_uncertainty_score":0.02293688},"labels":[],"label_agreement":null},{"id":"W1849362294","doi":"10.1109/icecs.2001.957544","title":"New embedded memory architecture for enhanced yield, performance and power consumption","year":2002,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Redundancy (engineering); Computer science; Power consumption; Architecture; Memory architecture; Embedded system; Computer architecture; Parallel computing; Yield (engineering); Power (physics); Operating system; Materials science","score_opus":0.02284104387793833,"score_gpt":0.22592846838493438,"score_spread":0.20308742450699604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849362294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33110747,0.005096585,0.6434758,0.00047636827,0.000285538,0.000067275854,0.00026006863,0.003250075,0.015980909],"genre_scores_gemma":[0.8028118,0.0012466278,0.18491948,0.00016963735,0.000102874554,0.00006160127,0.0003279458,0.00010763399,0.010252364],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99994254,0.000004778604,0.0000035253568,0.000011796946,0.000028284076,0.000009047447],"domain_scores_gemma":[0.99993443,0.0000068138725,0.000008686299,0.000014220546,0.00003065247,0.0000051809334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000794908,0.00020184845,0.0001987648,0.00018310155,0.00012139872,0.00025171085,0.0007269508,0.0002564337,0.00094056746],"category_scores_gemma":[0.000115019,0.000088392146,0.0001368829,0.00023315697,0.00011826017,0.0006360554,0.00024365204,0.00020812567,0.00026587644],"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.00015561003,0.00008128837,0.0006524959,0.00030920023,0.00005260087,0.000455612,0.00006549438,0.031356625,0.78037894,0.03615605,0.0041674473,0.14616856],"study_design_scores_gemma":[0.00009497713,0.0010977418,0.0020768933,0.000034161258,0.00013276668,0.0020718942,0.000040861854,0.5581087,0.3703242,0.009910988,0.056061413,0.00004545741],"about_ca_topic_score_codex":0.00017418205,"about_ca_topic_score_gemma":0.00039754724,"teacher_disagreement_score":0.00094056746,"about_ca_system_score_codex":0.00018245792,"about_ca_system_score_gemma":0.00017231522,"threshold_uncertainty_score":0.0031464696},"labels":[],"label_agreement":null},{"id":"W1850008580","doi":"10.1109/wescan.1995.493975","title":"A concurrent architecture for 622 Mb/s ATM segmentation and reassembly","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Simon Fraser University","funders":"","keywords":"Computer science; Asynchronous communication; Very-large-scale integration; Segmentation; Computer architecture; Adaptation (eye); Asynchronous Transfer Mode; ATM adaptation layer; Architecture; Layer (electronics); Parallel computing; Distributed computing; Computer network; Embedded system; Artificial intelligence","score_opus":0.026651982240988657,"score_gpt":0.24558733319452208,"score_spread":0.21893535095353342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850008580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07614999,0.0005696097,0.8955081,0.00023696542,0.00036318103,0.00037839424,0.00024099548,0.0089169955,0.017635697],"genre_scores_gemma":[0.5659077,0.00026363382,0.41843247,0.00015948318,0.00014045474,0.0002661778,0.00048401963,0.00031326283,0.0140328],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995789,0.00003531067,0.00002796401,0.0000878805,0.00020309581,0.00006682505],"domain_scores_gemma":[0.99938405,0.000097619864,0.000040348885,0.00014912704,0.0002574606,0.00007128732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005012142,0.0004248022,0.00023336068,0.0007516243,0.00079761486,0.0010334753,0.001962741,0.00037945327,0.008056624],"category_scores_gemma":[0.0010888708,0.00038621764,0.00029973206,0.000570329,0.00034803708,0.000795446,0.0007412696,0.0006823845,0.0018064986],"study_design_candidate":"bench_or_experimental","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.0012502719,0.00046587994,0.0023351004,0.0002233668,0.00009336803,0.000421328,0.00029306673,0.018366646,0.41881034,0.058355916,0.012916302,0.48646843],"study_design_scores_gemma":[0.00040757094,0.0015219846,0.002824345,0.00004783205,0.00023187128,0.0013810807,0.000086491724,0.58020985,0.31415635,0.020425495,0.078535296,0.00017181392],"about_ca_topic_score_codex":0.0029218283,"about_ca_topic_score_gemma":0.0045471885,"teacher_disagreement_score":0.008056624,"about_ca_system_score_codex":0.00071505556,"about_ca_system_score_gemma":0.0013753171,"threshold_uncertainty_score":0.026952028},"labels":[],"label_agreement":null},{"id":"W1868608563","doi":"10.1109/ipps.1995.395952","title":"Efficient algorithms for global data communication on the multidimensional torus network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Broadcasting (networking); Torus; Graph; Node (physics); Theoretical computer science; Telecommunications network; Network topology; Algorithm; Distributed computing; Computer network; Mathematics; Engineering","score_opus":0.09786082174380249,"score_gpt":0.2925564198448302,"score_spread":0.1946955981010277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868608563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00900794,0.0004162467,0.98546946,0.00024143804,0.000044922246,0.00005101462,0.00009621196,0.00074356166,0.003929182],"genre_scores_gemma":[0.1790808,0.00078125915,0.8133606,0.00010698091,0.00009477929,0.00045935716,0.00067039684,0.0004232226,0.0050226757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.00022409482,0.000045852983,0.0001731573,0.00020814457,0.00012836214],"domain_scores_gemma":[0.9985154,0.0008622318,0.00011228064,0.00028867464,0.0001657575,0.00005560707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011323413,0.001159692,0.0012669783,0.001260592,0.0012326678,0.0021995197,0.001769539,0.0014376986,0.005016378],"category_scores_gemma":[0.0039046581,0.0005917033,0.0009454979,0.0022424017,0.0012386492,0.0038546897,0.00277594,0.0014342307,0.0013555625],"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.0001682152,0.00008279089,0.0005956176,0.0002677949,0.00006977159,0.000093781,0.0003234127,0.60536814,0.002129572,0.17221303,0.011767533,0.20692039],"study_design_scores_gemma":[0.00005884558,0.000027275564,0.000081823055,0.000014277266,0.000012953512,0.000038680417,0.000072393115,0.8749892,0.0009210741,0.11994177,0.0038313163,0.000010481014],"about_ca_topic_score_codex":0.002537039,"about_ca_topic_score_gemma":0.0043944805,"teacher_disagreement_score":0.005016378,"about_ca_system_score_codex":0.0013508339,"about_ca_system_score_gemma":0.0015565938,"threshold_uncertainty_score":0.016781509},"labels":[],"label_agreement":null},{"id":"W1879969327","doi":"10.1109/icatm.1999.786815","title":"A feasible scheduling algorithm for per-VC queueing ATM switches","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queueing theory; Computer science; Scheduling (production processes); Layered queueing network; Computation; Queueing system; Weighted fair queueing; Computer network; Algorithm; Real-time computing; Distributed computing; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.026491842363281008,"score_gpt":0.2579020394017021,"score_spread":0.23141019703842108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879969327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024289687,0.00005233888,0.9954632,0.0000733692,0.000040818588,0.000054293963,0.000043395175,0.00031291164,0.0015306782],"genre_scores_gemma":[0.13315895,0.00014582467,0.8637044,0.00006115055,0.000061202474,0.0002555106,0.00024335066,0.0001527201,0.0022168702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989604,0.00030617078,0.00006437014,0.00017679294,0.0003420605,0.00015026303],"domain_scores_gemma":[0.998896,0.00050460466,0.00008669036,0.0001412115,0.00029480725,0.00007659852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013615945,0.0008344595,0.0007627051,0.00069947884,0.0010629649,0.0015914107,0.0021398314,0.0010947103,0.0068329643],"category_scores_gemma":[0.0040638954,0.00063921005,0.0006772849,0.000993528,0.0006726666,0.0016120471,0.0011738027,0.0012243825,0.0017348299],"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.00028749698,0.0001246508,0.000335936,0.00018848041,0.000036788628,0.00014713123,0.00018942177,0.5814957,0.0068426197,0.17140092,0.008341965,0.23060897],"study_design_scores_gemma":[0.000048727215,0.00004224399,0.000039336282,0.000010932817,0.000006815507,0.000028191896,0.00001585191,0.9723948,0.0011313367,0.022776274,0.0034938268,0.000011676544],"about_ca_topic_score_codex":0.0032412598,"about_ca_topic_score_gemma":0.002443925,"teacher_disagreement_score":0.0068329643,"about_ca_system_score_codex":0.0012490817,"about_ca_system_score_gemma":0.002721178,"threshold_uncertainty_score":0.0228585},"labels":[],"label_agreement":null},{"id":"W1881623667","doi":"10.1007/978-3-642-31770-5_5","title":"The Edge-Centered Surface Area of the Arrangement Graph","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Computer science; Interconnection; Surface (topology); Graph; Edge contraction; Theoretical computer science; Topology (electrical circuits); Geometry; Combinatorics; Mathematics; Line graph; Voltage graph; Artificial intelligence; Telecommunications","score_opus":0.024431572673624377,"score_gpt":0.22643070229619983,"score_spread":0.20199912962257544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881623667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3918665,0.0034019658,0.3143287,0.0015266056,0.0007422441,0.00009189118,0.0014142969,0.00094523793,0.28568262],"genre_scores_gemma":[0.933997,0.0017523266,0.029430633,0.00021674138,0.00091870665,0.000100266225,0.00062869437,0.0003905786,0.03256521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998186,0.000041659878,0.0000061763812,0.000051280604,0.000060166803,0.000022121449],"domain_scores_gemma":[0.99948186,0.00019420318,0.00007040701,0.000044309367,0.00014319317,0.00006604847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018441599,0.00042026903,0.0004699413,0.0014663929,0.00045314425,0.0012681325,0.00077862263,0.00059559295,0.00998869],"category_scores_gemma":[0.0011349979,0.00023129002,0.00022277885,0.00095033966,0.00084867334,0.0016346844,0.0005498218,0.00070721086,0.0016950704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084260006,0.000027858861,0.00064796815,0.0001258225,0.000019120911,0.0000997084,0.00017284216,0.010309796,0.008826863,0.8964815,0.008451513,0.07475267],"study_design_scores_gemma":[0.000017104618,0.00006963211,0.0025198178,0.000028361765,0.00002027593,0.00058793713,0.00014496365,0.065184325,0.0028474198,0.9068136,0.021736065,0.000030434348],"about_ca_topic_score_codex":0.00038737842,"about_ca_topic_score_gemma":0.00034567033,"teacher_disagreement_score":0.00998869,"about_ca_system_score_codex":0.00028413598,"about_ca_system_score_gemma":0.00018078402,"threshold_uncertainty_score":0.033415496},"labels":[],"label_agreement":null},{"id":"W1883773588","doi":"10.1109/iwsoc.2004.58","title":"SERDES technology for gigabit I/O communications in storage area networking","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Simon Fraser University; University of Alberta","funders":"","keywords":"SerDes; Backplane; Gigabit; Computer science; Transceiver; Embedded system; Engineering; Telecommunications; Computer hardware; Wireless","score_opus":0.043487871642909674,"score_gpt":0.2805547034716632,"score_spread":0.23706683182875354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883773588","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017409768,0.2894999,0.2965356,0.0066929553,0.011620529,0.00044311472,0.00035991048,0.0020628693,0.3753753],"genre_scores_gemma":[0.15979926,0.23961894,0.20388375,0.004312095,0.0040918826,0.00054164993,0.00062237855,0.00058853446,0.38654152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996038,0.000084617095,0.000028863275,0.00005623339,0.00018121002,0.00004533963],"domain_scores_gemma":[0.9997528,0.0000833806,0.000033456745,0.00003362859,0.000076070726,0.00002058515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004645548,0.0007548576,0.0005160676,0.0006581621,0.00062890985,0.0014097012,0.00062487455,0.0011869158,0.010520307],"category_scores_gemma":[0.00050367415,0.00038839976,0.00035617265,0.00070693024,0.0006108519,0.001947757,0.0007853807,0.0015344942,0.006788064],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013982855,0.00008326048,0.00061356556,0.001897777,0.000042152813,0.00095391594,0.00037776187,0.0037402974,0.07013612,0.4310971,0.07596582,0.41495246],"study_design_scores_gemma":[0.000010204925,0.00016244227,0.00021076432,0.0002235979,0.000017628074,0.00139303,0.000060542934,0.0020624525,0.021276727,0.01589956,0.9586583,0.000024761044],"about_ca_topic_score_codex":0.0001842209,"about_ca_topic_score_gemma":0.00036808522,"teacher_disagreement_score":0.010520307,"about_ca_system_score_codex":0.0006272449,"about_ca_system_score_gemma":0.00044598663,"threshold_uncertainty_score":0.03519392},"labels":[],"label_agreement":null},{"id":"W1884915318","doi":"10.1109/icpp.2002.1040866","title":"Tolerating network failures in system area networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Firmware; Retransmission; Computer science; Suite; Transient (computer programming); Implementation; Scheme (mathematics); Protocol (science); Distributed computing; Simple (philosophy); Computer network; Multithreading; Wide area network; Embedded system; Operating system; Software engineering","score_opus":0.011538593303471437,"score_gpt":0.19821147133824807,"score_spread":0.18667287803477664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884915318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47591254,0.00259095,0.51424533,0.000649885,0.00013323328,0.00011485962,0.00003942776,0.0028168964,0.0034969875],"genre_scores_gemma":[0.9678297,0.000428266,0.029876113,0.00008513862,0.00006774598,0.000054629098,0.000034924327,0.000090082496,0.0015334652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00036375655,0.000056099758,0.00013575463,0.00028732134,0.00015718614],"domain_scores_gemma":[0.9958324,0.0021466233,0.00060832535,0.0008623878,0.00044138066,0.000108913206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017849886,0.00067273417,0.0006778183,0.0005630243,0.0008832849,0.0010038792,0.0015554707,0.0008840713,0.0014798866],"category_scores_gemma":[0.006910648,0.0002940917,0.0002465754,0.0004974728,0.0009882409,0.0033525354,0.0012144077,0.0007175937,0.0002757898],"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.00043497395,0.00009414008,0.0048557054,0.0004310993,0.00009857575,0.0003785212,0.0005791614,0.7784693,0.05609101,0.020159423,0.0020121234,0.13639592],"study_design_scores_gemma":[0.00006257737,0.0008044532,0.0018950746,0.00004354761,0.000117166855,0.00046211123,0.0002803448,0.9243294,0.038877282,0.025160763,0.007925204,0.000042048014],"about_ca_topic_score_codex":0.000961888,"about_ca_topic_score_gemma":0.0008643047,"teacher_disagreement_score":0.0017849886,"about_ca_system_score_codex":0.00055367505,"about_ca_system_score_gemma":0.00045521784,"threshold_uncertainty_score":0.009440064},"labels":[],"label_agreement":null},{"id":"W1887859263","doi":"10.1109/dftvs.1992.224357","title":"Nondeterministic adaptive routing techniques for WSI processor arrays","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Winnipeg","funders":"","keywords":"Nondeterministic algorithm; Computer science; Hypercube; Adaptive routing; Routing (electronic design automation); Distance-vector routing protocol; Parallel computing; Equal-cost multi-path routing; Network packet; Distributed computing; Static routing; Routing algorithm; Network topology; Multipath routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Algorithm; Computer network; Routing protocol","score_opus":0.028277916538954558,"score_gpt":0.26285774285328006,"score_spread":0.2345798263143255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887859263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032690107,0.00017973233,0.99170786,0.00013687665,0.000088505796,0.000026628777,0.00001563818,0.00045046915,0.00412529],"genre_scores_gemma":[0.11141727,0.00077441573,0.8711622,0.0001893723,0.00013021688,0.00018768887,0.00012597664,0.00027257547,0.01574022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.000039936065,0.000016965172,0.000035793742,0.000105421816,0.000018942865],"domain_scores_gemma":[0.99968505,0.00010478926,0.000037893347,0.000081213286,0.000080435864,0.000010585267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026371787,0.00046929735,0.00028666624,0.00057993387,0.00053856027,0.00066299277,0.00088095496,0.00039466046,0.0031015377],"category_scores_gemma":[0.0008648711,0.0002469137,0.00040893778,0.00057135243,0.00043804848,0.001269599,0.00043423194,0.0008388067,0.0010627994],"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.00006757369,0.000051505598,0.00054433476,0.00015019484,0.000040917403,0.00015540564,0.00022801664,0.20360357,0.04397166,0.24688943,0.006750516,0.4975469],"study_design_scores_gemma":[0.00001110889,0.000052565814,0.00013269765,0.000015946991,0.000015255129,0.00021511859,0.000027541324,0.9017751,0.013756631,0.05088216,0.03309024,0.000025578422],"about_ca_topic_score_codex":0.0009110763,"about_ca_topic_score_gemma":0.001778792,"teacher_disagreement_score":0.0031015377,"about_ca_system_score_codex":0.0005286476,"about_ca_system_score_gemma":0.0003674133,"threshold_uncertainty_score":0.010375619},"labels":[],"label_agreement":null},{"id":"W1891394454","doi":"10.1109/mwscas.1993.343289","title":"Multi single-stage-shuffling for fast packet switching","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Network packet; Packet switching; Computer network; Throughput; Banyan; Shuffling; Interconnection; Telecommunications","score_opus":0.08765021289904677,"score_gpt":0.2608176495031529,"score_spread":0.1731674366041061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891394454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2654105,0.0012750839,0.71764505,0.00020548102,0.0002026649,0.0001342741,0.00026566986,0.0021222245,0.012739154],"genre_scores_gemma":[0.82625,0.00033178178,0.16790284,0.00007092879,0.000054928834,0.00005969751,0.00028635192,0.00006980844,0.0049736737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99988854,0.000029091001,0.000007851159,0.000016197602,0.000035840498,0.00002246052],"domain_scores_gemma":[0.9998123,0.00005654398,0.000019753215,0.000052454867,0.000044213994,0.000014753278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025285844,0.00022834507,0.0001499749,0.00028110013,0.00032612562,0.00043420354,0.0003663176,0.00015307528,0.0024967752],"category_scores_gemma":[0.0003761101,0.00008168866,0.000166748,0.0003229703,0.00014740997,0.0005954871,0.00023284751,0.00023779529,0.00031799832],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010201011,0.0002200322,0.0033258155,0.00042292356,0.00007484127,0.00043757207,0.00012180245,0.097339876,0.33635023,0.09856381,0.007128007,0.45499504],"study_design_scores_gemma":[0.00008569802,0.00073778763,0.0022408492,0.000024555775,0.00006855508,0.0005165152,0.0000313977,0.79507554,0.14876337,0.028774204,0.023642393,0.00003909102],"about_ca_topic_score_codex":0.00077640987,"about_ca_topic_score_gemma":0.0019609774,"teacher_disagreement_score":0.0024967752,"about_ca_system_score_codex":0.0003733809,"about_ca_system_score_gemma":0.0004540438,"threshold_uncertainty_score":0.008352578},"labels":[],"label_agreement":null},{"id":"W1892255185","doi":"10.1109/isvlsi.2015.27","title":"Index-Based Round-Robin Arbiter for NoC Routers","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Arbiter; Router; Network on a chip; Computer science; Scalability; System on a chip; Embedded system; Chip; Architecture; Computer network; Operating system; Telecommunications","score_opus":0.047085515106076385,"score_gpt":0.2647276441628646,"score_spread":0.2176421290567882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892255185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08820463,0.0009506251,0.8980136,0.0002756769,0.00023530409,0.00012412798,0.0001024581,0.0036186317,0.008475028],"genre_scores_gemma":[0.7656414,0.000280612,0.22837313,0.00021258302,0.00010216395,0.00009450946,0.0001178147,0.00012840285,0.0050494582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996006,0.00009529098,0.000034625544,0.000078213,0.00013529765,0.000056036894],"domain_scores_gemma":[0.99928963,0.00017321935,0.00014876126,0.00011970883,0.00022021204,0.00004833059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039293393,0.00035503562,0.0003883931,0.00038646828,0.000505975,0.00060774974,0.0009629976,0.0003021608,0.0019477478],"category_scores_gemma":[0.0010689278,0.00014271749,0.00016560113,0.00029876747,0.00031123302,0.00070435996,0.00030455957,0.00041602805,0.00045431222],"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.0018337733,0.00034975886,0.0028520077,0.00040165076,0.0000963009,0.0006131155,0.00026840685,0.1274634,0.43261623,0.055525605,0.011224857,0.36675486],"study_design_scores_gemma":[0.00007060238,0.0004730277,0.000737665,0.000020885114,0.000060133043,0.00033022935,0.000029719879,0.87765515,0.106424764,0.0049125873,0.009227569,0.00005762931],"about_ca_topic_score_codex":0.0010257179,"about_ca_topic_score_gemma":0.0019234355,"teacher_disagreement_score":0.0019477478,"about_ca_system_score_codex":0.0005925233,"about_ca_system_score_gemma":0.0005584227,"threshold_uncertainty_score":0.00651592},"labels":[],"label_agreement":null},{"id":"W1896247917","doi":"10.1109/icc.1996.535296","title":"A growable large scale ATM multicast switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto; Nortel (Canada)","funders":"","keywords":"Multicast; Computer science; Scalability; Computer network; Throughput; Asynchronous Transfer Mode; Routing (electronic design automation); Distributed computing; Queueing theory; Sorting; Crossover switch; Interconnection; Multistage interconnection networks; Telecommunications","score_opus":0.01857991610141471,"score_gpt":0.21487581296496303,"score_spread":0.1962958968635483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896247917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43224728,0.0010745295,0.51974314,0.001329717,0.00039610485,0.00017013901,0.00032168382,0.0031820773,0.041535296],"genre_scores_gemma":[0.7885784,0.000489111,0.2022989,0.00025041372,0.00011621556,0.000102854894,0.00020388687,0.00005910641,0.007901177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999243,0.00001607297,0.0000025773568,0.00001759947,0.000027764188,0.000011596817],"domain_scores_gemma":[0.9999176,0.000020400366,0.00000954202,0.000014210831,0.000019070512,0.000019191219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013606397,0.00016755158,0.00015135623,0.00014613042,0.00035901184,0.0003170596,0.00053373177,0.00027473376,0.002098844],"category_scores_gemma":[0.00019303472,0.00009656364,0.00015947188,0.00012117748,0.00026562964,0.00042516922,0.00034303352,0.00027630723,0.00038236298],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00034295072,0.0001489158,0.0018339854,0.00017558673,0.00004075109,0.0007560768,0.00013807046,0.06642197,0.6856477,0.04612726,0.009683028,0.18868366],"study_design_scores_gemma":[0.0001845009,0.0013581188,0.0046273666,0.00003490368,0.00012123994,0.0016996865,0.00012479992,0.70156735,0.16531065,0.022285338,0.102626614,0.000059406473],"about_ca_topic_score_codex":0.00041034556,"about_ca_topic_score_gemma":0.00056204497,"teacher_disagreement_score":0.002098844,"about_ca_system_score_codex":0.0002789406,"about_ca_system_score_gemma":0.00019844061,"threshold_uncertainty_score":0.0070213675},"labels":[],"label_agreement":null},{"id":"W1901686644","doi":"10.1109/pacrim.1997.620402","title":"An evaluation to the use of the non-overlapped multiple register sets in the network nodes processor","year":2002,"lang":"en","type":"article","venue":"","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":"Acadia University","funders":"","keywords":"Computer science; Context (archaeology); Throughput; Reduction (mathematics); Network processor; Parallel computing; Register (sociolinguistics); Register file; Computer network; Instruction set; Operating system; Network packet; Mathematics","score_opus":0.11283710014620506,"score_gpt":0.2849229635744383,"score_spread":0.17208586342823323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901686644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96469015,0.0011426773,0.029982997,0.00012759594,0.000030565865,0.00010629477,0.000056169018,0.0002809268,0.0035825768],"genre_scores_gemma":[0.9854423,0.0002765312,0.013648727,0.000016920827,0.000010883197,0.00002187182,0.000035981247,0.000020082272,0.0005265775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845064,0.0008080245,0.00006899436,0.000107098895,0.00040214614,0.00016294555],"domain_scores_gemma":[0.99531144,0.0028092416,0.0004845015,0.0004019659,0.0008451114,0.00014776814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010591445,0.00056748657,0.00029521482,0.0005057614,0.0002204539,0.00039345497,0.000898872,0.00030079237,0.0013007673],"category_scores_gemma":[0.004708446,0.00012773956,0.00017848868,0.00038878148,0.00025194424,0.00073240174,0.00024335277,0.00025968408,0.00016177919],"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.0053774724,0.0010036344,0.01726121,0.0011837403,0.00024140095,0.00048002513,0.00031806447,0.22162011,0.31840208,0.0055222954,0.0013526606,0.42723736],"study_design_scores_gemma":[0.00037358436,0.013377583,0.01495764,0.00007458709,0.00055527914,0.00067902467,0.00037833428,0.5090193,0.45220155,0.0010823153,0.0072336905,0.00006709065],"about_ca_topic_score_codex":0.0015295292,"about_ca_topic_score_gemma":0.0020113767,"teacher_disagreement_score":0.0015295292,"about_ca_system_score_codex":0.0005380033,"about_ca_system_score_gemma":0.00043595917,"threshold_uncertainty_score":0.0056013465},"labels":[],"label_agreement":null},{"id":"W1907550666","doi":"10.1109/etacom.1996.502468","title":"Performance of balanced gamma network under bursty traffic","year":2002,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland","funders":"","keywords":"Banyan; Computer science; Computer network; Multistage interconnection networks; Network topology; Routing (electronic design automation)","score_opus":0.01981956486181151,"score_gpt":0.20269151660000773,"score_spread":0.1828719517381962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907550666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916381,0.00021631681,0.005717017,0.00007000458,0.00001886156,0.00001075899,0.00006313088,0.00044104247,0.0018247182],"genre_scores_gemma":[0.9986468,0.00008068828,0.0007968191,0.000014859731,0.000004434805,0.000004591098,0.00007222684,0.000013630724,0.00036596708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994004,0.00013679553,0.000029145898,0.0000967483,0.00011606763,0.00022089989],"domain_scores_gemma":[0.9980192,0.00083247805,0.0002181001,0.00020551287,0.0005603307,0.00016433193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092441,0.000552855,0.00048219386,0.00043005316,0.00054395554,0.0008750316,0.0005247299,0.00049199496,0.0014993558],"category_scores_gemma":[0.0032222897,0.00016190187,0.000119550234,0.00040684835,0.0005816383,0.0013680819,0.0007071937,0.0002389806,0.00019295415],"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.0053997585,0.00017332748,0.014720589,0.00018213221,0.00018107073,0.00047951366,0.00054782233,0.761945,0.13697301,0.0066740746,0.003145981,0.06957776],"study_design_scores_gemma":[0.00006124016,0.0008158058,0.004553319,0.000014138572,0.000060345716,0.0001804665,0.0001895798,0.94352096,0.047641966,0.0022036089,0.0007269139,0.000031798078],"about_ca_topic_score_codex":0.00426492,"about_ca_topic_score_gemma":0.0021074763,"teacher_disagreement_score":0.00426492,"about_ca_system_score_codex":0.0010323299,"about_ca_system_score_gemma":0.00053708383,"threshold_uncertainty_score":0.008480191},"labels":[],"label_agreement":null},{"id":"W1916071409","doi":"10.1109/icccn.1998.998794","title":"Asynchronous deflection with transient buffers","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Alberta","funders":"","keywords":"Asynchronous communication; Computer science; Deflection routing; Deflection (physics); Computer network; Routing (electronic design automation); Distributed computing; Routing protocol; Electronic engineering; Static routing; Engineering; Physics; Optics","score_opus":0.015235562798610486,"score_gpt":0.1917734199138684,"score_spread":0.1765378571152579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916071409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74792916,0.0003605262,0.24244969,0.00029084887,0.00020319728,0.0001843793,0.00019818722,0.0017698853,0.006614168],"genre_scores_gemma":[0.9741294,0.0001455833,0.024119912,0.000052556843,0.0000223133,0.00005371573,0.00008177215,0.00006667864,0.0013280951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992507,0.0001581494,0.000042324245,0.00017066076,0.0002310018,0.00014724761],"domain_scores_gemma":[0.9943566,0.002919176,0.0004717885,0.0010482329,0.000916512,0.00028768377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011118413,0.0006278064,0.0003037181,0.00045238723,0.00055406836,0.0010287131,0.0013080039,0.0006677194,0.0036210695],"category_scores_gemma":[0.0058575445,0.00023687747,0.00021467231,0.0006041235,0.0004996353,0.0018519802,0.00051949325,0.0006984766,0.00045641098],"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.0029151733,0.0013840095,0.008345276,0.00059689226,0.00012333624,0.00054643,0.00033153422,0.43245253,0.38621867,0.03546376,0.0042751087,0.12734722],"study_design_scores_gemma":[0.00024534218,0.00089753314,0.0010962622,0.000022649483,0.00005580885,0.00017366897,0.000099467354,0.7948963,0.19333233,0.00654624,0.0025915534,0.000042873908],"about_ca_topic_score_codex":0.0010785167,"about_ca_topic_score_gemma":0.00087355456,"teacher_disagreement_score":0.0036210695,"about_ca_system_score_codex":0.0007048391,"about_ca_system_score_gemma":0.0004753966,"threshold_uncertainty_score":0.01211369},"labels":[],"label_agreement":null},{"id":"W1916969508","doi":"10.1109/mascot.1998.693689","title":"Prioritized multiprocessor networks: design and performance","year":2002,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer science; Multiprocessing; Throughput; Parallel computing; Distributed computing; Computer network; Operating system","score_opus":0.02684107652944166,"score_gpt":0.20349568726484893,"score_spread":0.17665461073540728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1916969508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1421722,0.013008285,0.819636,0.0007413081,0.00041780178,0.00051287905,0.00024069587,0.0020729117,0.021197954],"genre_scores_gemma":[0.6762652,0.0037349379,0.31352514,0.00018593734,0.0001470602,0.00028217968,0.00023621331,0.00013413015,0.0054891896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.00025624395,0.00004575744,0.00010708712,0.00042224603,0.000084804386],"domain_scores_gemma":[0.9988011,0.000396833,0.00013324707,0.00012980042,0.00045536153,0.00008366475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827801,0.00055184134,0.0002670191,0.00058647216,0.00031992383,0.0016084618,0.0012585351,0.0005102025,0.0018888859],"category_scores_gemma":[0.0028672211,0.00033250471,0.00013948238,0.0006510678,0.0003790787,0.0016920996,0.00041278847,0.00043758046,0.00037163214],"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.00081350195,0.00022265223,0.005081513,0.0010851343,0.0001529836,0.00028948687,0.00016933386,0.3827872,0.055691246,0.07693037,0.0065004514,0.47027615],"study_design_scores_gemma":[0.00015082138,0.0008721678,0.0016120663,0.000099061166,0.00013139902,0.00048891996,0.00008054875,0.9064481,0.030420193,0.029934706,0.029719882,0.000042090196],"about_ca_topic_score_codex":0.0014054552,"about_ca_topic_score_gemma":0.0021720044,"teacher_disagreement_score":0.0018888859,"about_ca_system_score_codex":0.0013909546,"about_ca_system_score_gemma":0.0011842252,"threshold_uncertainty_score":0.01009208},"labels":[],"label_agreement":null},{"id":"W1918106294","doi":"10.1002/cpe.3503","title":"Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Star (game theory); Mathematics; Graph; A* search algorithm; Discrete mathematics; Hypercube; Algorithm; Computer science","score_opus":0.08408094310322434,"score_gpt":0.32253054664030634,"score_spread":0.238449603537082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918106294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44463667,0.0004028223,0.528901,0.0010257221,0.000056421446,0.00018289451,0.00017016755,0.00035019443,0.024274075],"genre_scores_gemma":[0.7534442,0.00022370077,0.24023281,0.000095413074,0.000025876334,0.000109114684,0.00023975135,0.00006531592,0.005563833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976176,0.0000664748,0.000011159844,0.00005185913,0.000063535255,0.000045230525],"domain_scores_gemma":[0.99934,0.00026133275,0.00008157323,0.000102596365,0.00010049287,0.00011394308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003844328,0.00018537487,0.00038891958,0.00043272055,0.0006423934,0.0008396091,0.00093799445,0.0007258785,0.0027541823],"category_scores_gemma":[0.0015414188,0.00024267875,0.00034956355,0.0006495326,0.0006516693,0.0012147647,0.00091760023,0.00048246558,0.00032487072],"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.00043447036,0.00017618012,0.0024403417,0.00023977524,0.000046519956,0.00017066998,0.0009474115,0.29142976,0.03328195,0.44237778,0.008392638,0.22006252],"study_design_scores_gemma":[0.00008280278,0.00013625751,0.00072096795,0.000017364018,0.000020302068,0.00016890992,0.00025492357,0.86861366,0.006226422,0.11883579,0.004904936,0.000017656852],"about_ca_topic_score_codex":0.0029151207,"about_ca_topic_score_gemma":0.0027729033,"teacher_disagreement_score":0.0029151207,"about_ca_system_score_codex":0.00092038553,"about_ca_system_score_gemma":0.0008596993,"threshold_uncertainty_score":0.009213626},"labels":[],"label_agreement":null},{"id":"W1920743835","doi":"10.1109/icc.2003.1204596","title":"Recovery from control plane failures in the CR-LDP signalling protocol","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Ottawa; Nortel (Canada); Communications Research Centre Canada","funders":"","keywords":"Computer network; Node (physics); Protocol (science); Channel (broadcasting); Forwarding plane; Computer science; Control channel; Upstream (networking); Routing control plane; Downstream (manufacturing); Routing protocol; Routing (electronic design automation); Engineering; Network packet","score_opus":0.013795219882884655,"score_gpt":0.23605323263251926,"score_spread":0.2222580127496346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920743835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1296219,0.001259947,0.85561806,0.0008001645,0.00014824243,0.00025292704,0.00017163441,0.0018673458,0.010259711],"genre_scores_gemma":[0.8654298,0.0005909842,0.12778483,0.00014299827,0.000058731326,0.00023524683,0.00027346268,0.00009550771,0.005388462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850214,0.0003233419,0.0001461274,0.00017697392,0.00065095635,0.00020046048],"domain_scores_gemma":[0.99840134,0.00037972993,0.00025926752,0.0006454602,0.0002481048,0.00006609774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016305029,0.0003444172,0.0004181608,0.00057357294,0.00083119154,0.0020469013,0.0013712562,0.001085528,0.0010472289],"category_scores_gemma":[0.003099196,0.00027901694,0.00028752655,0.00070257037,0.0011686912,0.0024137625,0.0018449303,0.0011892278,0.0006907834],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002157534,0.00028167726,0.0023582594,0.00066965114,0.00007766415,0.0029187328,0.0017286539,0.15470104,0.17218384,0.35569456,0.008089708,0.29913867],"study_design_scores_gemma":[0.00025213492,0.0004151416,0.00090118527,0.000100411205,0.00011087109,0.0017045593,0.00035770366,0.7917785,0.09448611,0.07966566,0.030056596,0.0001711522],"about_ca_topic_score_codex":0.0017959345,"about_ca_topic_score_gemma":0.00094004377,"teacher_disagreement_score":0.0020469013,"about_ca_system_score_codex":0.00064629444,"about_ca_system_score_gemma":0.0010512152,"threshold_uncertainty_score":0.008623004},"labels":[],"label_agreement":null},{"id":"W1920782085","doi":"10.1109/lcn.1992.228132","title":"Towards a gigabit FDDI","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Alberta","funders":"","keywords":"Fiber Distributed Data Interface; Token ring; Security token; Computer network; Token bus network; Computer science; Protocol (science); Transmission (telecommunications); Gigabit; Token passing; Local area network; Telecommunications","score_opus":0.015270562534139467,"score_gpt":0.2263846590231803,"score_spread":0.21111409648904084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920782085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04743626,0.0077868714,0.80486405,0.008598481,0.0028391606,0.00031646615,0.0004319289,0.0040273736,0.123699345],"genre_scores_gemma":[0.231141,0.0050835973,0.68043774,0.0022668843,0.0005882475,0.00023177266,0.00063076225,0.0001885366,0.07943148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.00003484936,0.000007824757,0.0000416436,0.00010900197,0.000042123193],"domain_scores_gemma":[0.9997863,0.000028091927,0.0000086316795,0.00004200256,0.000100487145,0.000034579076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066554657,0.00036828336,0.00018832082,0.00038746838,0.0005846953,0.0012237243,0.0008727492,0.0010624359,0.008390714],"category_scores_gemma":[0.00061227556,0.00023535047,0.00020445212,0.00038293368,0.00046242366,0.0013597206,0.00076024595,0.0009939347,0.0028182033],"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.0005155344,0.00013813683,0.0014283126,0.00058860076,0.000039883544,0.00090117264,0.0005809747,0.011821461,0.14542668,0.35330278,0.07995161,0.40530485],"study_design_scores_gemma":[0.00011873639,0.00047025058,0.00092570507,0.00017944326,0.000053193326,0.0013884682,0.000173772,0.087778695,0.04562496,0.111382306,0.7518301,0.000074333664],"about_ca_topic_score_codex":0.0017415516,"about_ca_topic_score_gemma":0.0018201995,"teacher_disagreement_score":0.008390714,"about_ca_system_score_codex":0.0009813453,"about_ca_system_score_gemma":0.00058953126,"threshold_uncertainty_score":0.028069794},"labels":[],"label_agreement":null},{"id":"W1925735128","doi":"10.1109/wescon.1993.488472","title":"AMD's next generation MACH 3 and 4 family optimized for flexibility, fast speed and predictable routing delay","year":2002,"lang":"en","type":"article","venue":"Proceedings of WESCON '93","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Mach number; Flexibility (engineering); Clock rate; Routing (electronic design automation); Computer science; CMOS; Architecture; Electronic engineering; Logic gate; Embedded system; Electrical engineering; Engineering; Aerospace engineering; Mathematics","score_opus":0.06840255812853045,"score_gpt":0.2496492657792474,"score_spread":0.18124670765071693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925735128","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52062684,0.009069264,0.2656895,0.0020017258,0.00086466107,0.0003633973,0.0018215183,0.011014003,0.18854909],"genre_scores_gemma":[0.800676,0.001329484,0.14354922,0.0006302531,0.00010672293,0.00016311089,0.0019186317,0.00034241247,0.051284175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984777,0.000010825802,0.0000052968153,0.000024651128,0.00008113074,0.000030261806],"domain_scores_gemma":[0.9998379,0.000019193421,0.00003072674,0.000023492737,0.0000669316,0.0000216678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011926921,0.00025706526,0.00017645753,0.00030190567,0.00034829913,0.00047294187,0.00048826652,0.00025790092,0.00500326],"category_scores_gemma":[0.00039059712,0.00015131698,0.00021344813,0.00024483528,0.000109328284,0.00053000083,0.00030579756,0.00029091205,0.00097102456],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059814844,0.000091550624,0.01007359,0.0003106234,0.000083204424,0.0010140444,0.00027423765,0.019963177,0.28129545,0.043557707,0.1105077,0.5322307],"study_design_scores_gemma":[0.00021234287,0.0016906693,0.017908119,0.00005978119,0.00014602898,0.004450777,0.00012936204,0.12610196,0.11341613,0.016652888,0.719119,0.00011299181],"about_ca_topic_score_codex":0.0016114808,"about_ca_topic_score_gemma":0.0043386417,"teacher_disagreement_score":0.00500326,"about_ca_system_score_codex":0.0006061049,"about_ca_system_score_gemma":0.0006757791,"threshold_uncertainty_score":0.01673764},"labels":[],"label_agreement":null},{"id":"W1931058433","doi":"10.1109/hpsr.2004.1303510","title":"Fault tolerance analysis of optical switching systems built on the vertical stacking of Banyan network","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Banyan; Blocking (statistics); Fault tolerance; Computer science; Computer network; Fault (geology); Routing (electronic design automation); Distributed computing; Topology (electrical circuits); Engineering","score_opus":0.02270184565595922,"score_gpt":0.25275692047674225,"score_spread":0.23005507482078302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931058433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87037235,0.0006093792,0.12116718,0.0002374955,0.00002581954,0.000019449857,0.00004756011,0.00015801672,0.0073627075],"genre_scores_gemma":[0.9970426,0.00013851436,0.0019738222,0.000011385761,0.0000066193143,0.000006489707,0.000014520022,0.0000070420383,0.0007989502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998196,0.00003532601,0.0000056988174,0.000018636832,0.00005849173,0.000062257226],"domain_scores_gemma":[0.9995016,0.00018247854,0.00014794328,0.00003273645,0.000108066095,0.00002709814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022860103,0.00032494473,0.00021211823,0.0005413022,0.00032864316,0.00033137054,0.00036169452,0.0003457593,0.0009930534],"category_scores_gemma":[0.00089372875,0.00015300962,0.00029146508,0.00035486525,0.00040721896,0.0005474928,0.00022482286,0.00026244592,0.00009215553],"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.00009110651,0.00002579119,0.0013549022,0.000035458495,0.00002046245,0.00010109328,0.0000479865,0.96201706,0.01446121,0.016338058,0.00024079489,0.0052660615],"study_design_scores_gemma":[0.0000011446413,0.000021226888,0.00028158101,0.0000016502225,0.0000042834226,0.000014829033,0.000009936221,0.996906,0.0012906065,0.001382992,0.0000838186,0.0000019602728],"about_ca_topic_score_codex":0.006756481,"about_ca_topic_score_gemma":0.0026339993,"teacher_disagreement_score":0.006756481,"about_ca_system_score_codex":0.0010546221,"about_ca_system_score_gemma":0.0004038883,"threshold_uncertainty_score":0.013434291},"labels":[],"label_agreement":null},{"id":"W193329722","doi":"10.1007/978-1-4757-3171-2_4","title":"Computing Shortest Networks with Fixed Topologies","year":2000,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network topology; Computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.010670663957425598,"score_gpt":0.2017735368791837,"score_spread":0.1911028729217581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193329722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018862454,0.005426538,0.8434344,0.0011460246,0.00072029664,0.00008495623,0.00047400958,0.0016374524,0.12821384],"genre_scores_gemma":[0.17239629,0.011175399,0.7248652,0.00033233632,0.0005068478,0.0002844379,0.0016248414,0.001002969,0.08781171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983454,0.000022010288,0.000007903515,0.000049565955,0.00006663528,0.0000193315],"domain_scores_gemma":[0.9997851,0.000103704515,0.000013284271,0.00005233213,0.000032594933,0.000013051429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021843587,0.0011755968,0.0007380613,0.00070292864,0.0005025216,0.001399557,0.00162438,0.0005559325,0.012441794],"category_scores_gemma":[0.0011603555,0.00054370076,0.00048832357,0.0019943072,0.0006561036,0.0028003252,0.00086399104,0.0011894646,0.003133711],"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.00007097961,0.000051826588,0.0002060715,0.00063155836,0.000057312776,0.000065336615,0.000106679305,0.1912051,0.0048775156,0.3355718,0.0483285,0.41882733],"study_design_scores_gemma":[0.000027885308,0.000041242794,0.00015604983,0.00009725413,0.000029512335,0.000125843,0.00005074833,0.21517491,0.0053485646,0.6655277,0.113397285,0.000022986202],"about_ca_topic_score_codex":0.0007551742,"about_ca_topic_score_gemma":0.0015461817,"teacher_disagreement_score":0.012441794,"about_ca_system_score_codex":0.00082518207,"about_ca_system_score_gemma":0.0006002371,"threshold_uncertainty_score":0.041621923},"labels":[],"label_agreement":null},{"id":"W1936383639","doi":"","title":"Performance analysis and VLSI design of a high-speed reconfigurable shared queue","year":2007,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Computer science; Dram; Queueing theory; Buffer (optical fiber); Network packet; Static random-access memory; Quality of service; Queue; Circular buffer; Computer network; Embedded system; Computer hardware","score_opus":0.030754601660240237,"score_gpt":0.25938523222730103,"score_spread":0.2286306305670608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936383639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3716698,0.0013255609,0.608714,0.0004238937,0.00015036315,0.00016531842,0.00028202208,0.0018481294,0.015420854],"genre_scores_gemma":[0.95637643,0.0002201971,0.04129509,0.000042784966,0.000017530221,0.000038570404,0.00007493065,0.000024105642,0.0019104374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983656,0.000020865491,0.000008418065,0.000031506162,0.000063566564,0.000039094008],"domain_scores_gemma":[0.999811,0.000055542925,0.00003426436,0.000022527722,0.00006486279,0.000011889924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019066113,0.00028920305,0.00020633807,0.0002745557,0.00032633744,0.00074076466,0.0010604509,0.00030697885,0.0031756987],"category_scores_gemma":[0.00044423642,0.00015263422,0.00039239734,0.00028954126,0.00019747272,0.0005079449,0.0001855273,0.00023534038,0.00031470635],"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.0005115468,0.00016145062,0.0040119886,0.00040215862,0.00016542425,0.00044781325,0.0001916992,0.657486,0.2180047,0.028755466,0.0023894524,0.08747225],"study_design_scores_gemma":[0.000040579456,0.00028987878,0.00068925036,0.000009565429,0.000049689268,0.0000894151,0.000022578912,0.97239953,0.023260666,0.0010993108,0.002036183,0.000013363919],"about_ca_topic_score_codex":0.0057472405,"about_ca_topic_score_gemma":0.0046406323,"teacher_disagreement_score":0.0057472405,"about_ca_system_score_codex":0.0012365722,"about_ca_system_score_gemma":0.0010229743,"threshold_uncertainty_score":0.011427581},"labels":[],"label_agreement":null},{"id":"W1936730454","doi":"10.1109/dmcc.1990.556292","title":"An Efficient Method For Distributing Data In Hypercube Computers","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Hypercube; Computer science; Parallel computing; Distributed computing","score_opus":0.04333947646472982,"score_gpt":0.33859589441216903,"score_spread":0.29525641794743923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936730454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012927863,0.00034423734,0.9802377,0.0001686526,0.00014595554,0.00011860717,0.00012029701,0.0017363464,0.004200346],"genre_scores_gemma":[0.13322905,0.0004201508,0.8518026,0.00011499984,0.00011956723,0.00041679296,0.0003723333,0.00043753986,0.013086898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00027019906,0.00005229947,0.00009376497,0.00044416767,0.00009082155],"domain_scores_gemma":[0.9983746,0.00055141543,0.000070985516,0.0005408703,0.00037251046,0.00008962489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009246794,0.0008330648,0.0008934026,0.0012860071,0.001573745,0.001521305,0.0019768302,0.00080765865,0.006844449],"category_scores_gemma":[0.0032236637,0.00059779896,0.0005774463,0.0023080825,0.0010121622,0.00196147,0.001904266,0.0009062332,0.0019052468],"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.0010189398,0.00021918182,0.0010039776,0.0006478051,0.000142279,0.00029028844,0.00054812,0.12999654,0.0367097,0.06761272,0.023637839,0.7381726],"study_design_scores_gemma":[0.00027510666,0.00021852387,0.00048028026,0.000051840056,0.00008549458,0.00024748093,0.00018200235,0.8685387,0.031121675,0.07075377,0.027984293,0.000060939434],"about_ca_topic_score_codex":0.0028129192,"about_ca_topic_score_gemma":0.0056371572,"teacher_disagreement_score":0.006844449,"about_ca_system_score_codex":0.0010100849,"about_ca_system_score_gemma":0.001456855,"threshold_uncertainty_score":0.022897005},"labels":[],"label_agreement":null},{"id":"W1938581980","doi":"10.1109/infcom.1996.493362","title":"ATM multiplexers and output port controllers control and flexible queueing disciplines","year":2002,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Multiplexer; Queueing theory; Computer science; Port (circuit theory); Buffer (optical fiber); Asynchronous Transfer Mode; Computer network; Quality of service; Distributed computing; Multiplexing; Electronic engineering; Telecommunications; Engineering","score_opus":0.018711614277845765,"score_gpt":0.21532308017442064,"score_spread":0.19661146589657488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938581980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03765041,0.00039663166,0.9490514,0.00021235985,0.000121479075,0.000049203267,0.000070655675,0.0008388117,0.011609077],"genre_scores_gemma":[0.7871074,0.0005186072,0.19938682,0.0002240678,0.00030579974,0.00016873698,0.00011122541,0.00010911636,0.012068322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994894,0.00009446617,0.000028841729,0.00012387407,0.00018643218,0.00007687974],"domain_scores_gemma":[0.9995115,0.00017128389,0.00008469162,0.00008854123,0.00010149667,0.000042468168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006297547,0.00053035736,0.0002074004,0.00038087522,0.00044025047,0.0013789212,0.0011974871,0.00055404275,0.0030613057],"category_scores_gemma":[0.0013775384,0.00025137773,0.00033580314,0.00056186714,0.00089400896,0.0016056433,0.0008342667,0.0009150765,0.00041179135],"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.00022648873,0.00008750275,0.0006475964,0.00013553027,0.00003411771,0.00020666193,0.00018232114,0.06677883,0.06873346,0.7169371,0.0024731827,0.14355718],"study_design_scores_gemma":[0.00018799589,0.0003333011,0.0006189744,0.00004261114,0.00008970917,0.00038846594,0.00006538467,0.64938563,0.107455835,0.19096711,0.05041002,0.00005501013],"about_ca_topic_score_codex":0.00063854933,"about_ca_topic_score_gemma":0.000582795,"teacher_disagreement_score":0.0030613057,"about_ca_system_score_codex":0.0005992105,"about_ca_system_score_gemma":0.0007754992,"threshold_uncertainty_score":0.010241032},"labels":[],"label_agreement":null},{"id":"W1949215090","doi":"10.1007/s00446-014-0237-0","title":"Knowledge, level of symmetry, and time of leader election","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Node (physics); Topology (electrical circuits); Computation; Computer science; Network topology; Computer network; Symmetry (geometry); Lambda; Mathematics; Combinatorics; Discrete mathematics; Physics; Algorithm; Geometry","score_opus":0.036822080185433884,"score_gpt":0.2641277812374795,"score_spread":0.22730570105204562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949215090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78581786,0.00029768547,0.195814,0.0016870806,0.00007325765,0.000096618984,0.00038388913,0.00031540537,0.015514215],"genre_scores_gemma":[0.996473,0.000039450577,0.0027017721,0.000018344053,0.000019877049,0.000015109797,0.00006359254,0.000016756088,0.0006520682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965675,0.0009937922,0.0002361115,0.0006917558,0.000764668,0.000746155],"domain_scores_gemma":[0.8764958,0.088907585,0.013904528,0.009959788,0.0058602947,0.0048720026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075422926,0.00027564575,0.001371733,0.0015824173,0.0010543219,0.004039652,0.0012621742,0.0014651555,0.003906224],"category_scores_gemma":[0.080467336,0.00039087672,0.00054195843,0.0009678736,0.002984239,0.008115983,0.0020923694,0.0018330493,0.00051188475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006397646,0.0007607332,0.07049349,0.0003900206,0.00050572876,0.00059960404,0.0025742466,0.22463156,0.016599536,0.57703,0.0032653764,0.09675214],"study_design_scores_gemma":[0.00028766115,0.0010022939,0.022024345,0.000052392228,0.00018007813,0.00042282444,0.001067119,0.33251283,0.008747438,0.63218206,0.0013915964,0.00012935669],"about_ca_topic_score_codex":0.000983418,"about_ca_topic_score_gemma":0.00075565075,"teacher_disagreement_score":0.0075422926,"about_ca_system_score_codex":0.0015375621,"about_ca_system_score_gemma":0.0027330648,"threshold_uncertainty_score":0.039887965},"labels":[],"label_agreement":null},{"id":"W1954447863","doi":"10.1109/hicss.1993.284105","title":"Load balancing and selection on the star and pancake interconnection networks","year":2002,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Interconnection; Selection (genetic algorithm); Star (game theory); Computer science; Component (thermodynamics); Selection algorithm; Load balancing (electrical power); A* search algorithm; Algorithm; Artificial intelligence; Computer network; Mathematics","score_opus":0.015670519349956693,"score_gpt":0.19126827001960914,"score_spread":0.17559775066965244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954447863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025822718,0.0006476837,0.95837057,0.00027352537,0.00011276435,0.000094504496,0.00011867839,0.00084141095,0.013718142],"genre_scores_gemma":[0.34419954,0.0017231526,0.6244847,0.00017444458,0.00022142446,0.00038465456,0.0006209804,0.00035080223,0.02784026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.00013453914,0.00002408639,0.000083275954,0.00020309672,0.00006601153],"domain_scores_gemma":[0.99942434,0.00023015919,0.00006962833,0.000110464025,0.00013574718,0.000029747183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047026487,0.0006070817,0.0005550105,0.00081239134,0.00087103486,0.0010616841,0.0008557282,0.00047475428,0.005666791],"category_scores_gemma":[0.0019223511,0.00028966996,0.00032810002,0.0017485347,0.0005567781,0.0017334257,0.00084596575,0.00063490466,0.0010601771],"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.000385858,0.000056495603,0.00064422895,0.00014354772,0.00003729462,0.00017722946,0.00025114918,0.36933964,0.010724088,0.16856553,0.018710481,0.43096453],"study_design_scores_gemma":[0.000035122044,0.000058527276,0.0003585405,0.000017914788,0.000014634582,0.00015000941,0.000051158397,0.8660157,0.004314406,0.10893064,0.020036886,0.000016509952],"about_ca_topic_score_codex":0.0023223823,"about_ca_topic_score_gemma":0.0035391168,"teacher_disagreement_score":0.005666791,"about_ca_system_score_codex":0.0007722703,"about_ca_system_score_gemma":0.00053146,"threshold_uncertainty_score":0.018957317},"labels":[],"label_agreement":null},{"id":"W1959120815","doi":"10.1109/mascot.1998.693674","title":"Multicast in deflection networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Alberta","funders":"","keywords":"Multicast; Computer network; Computer science; Network packet; Deflection (physics); Source-specific multicast; Communication source; Xcast; Distributed computing; Physics; Optics","score_opus":0.024296327634729904,"score_gpt":0.21532360205053003,"score_spread":0.1910272744158001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959120815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14890403,0.005925977,0.7831024,0.00134928,0.00043398584,0.00040295525,0.00037232134,0.0009342122,0.058574885],"genre_scores_gemma":[0.85677224,0.0051668095,0.12747814,0.0004683412,0.0002483544,0.00030070293,0.00025018366,0.00011976763,0.009195488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989347,0.0004073704,0.00004400825,0.00008828489,0.00034197344,0.00018360045],"domain_scores_gemma":[0.9987274,0.00064380025,0.00014921892,0.00020906099,0.00021407874,0.000056464316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013125025,0.00047560327,0.00043000974,0.00066210714,0.00090319803,0.0011742874,0.000686422,0.0011305016,0.0031758724],"category_scores_gemma":[0.0035642667,0.00020718598,0.0002533046,0.000849467,0.00065455807,0.002510926,0.0011574251,0.0006635829,0.0005237832],"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.0006610194,0.00014531157,0.0016857248,0.0004936399,0.00006146861,0.0003048126,0.00030221796,0.24783455,0.025259638,0.52279705,0.007924706,0.19252987],"study_design_scores_gemma":[0.00014001748,0.0005106108,0.00111733,0.00014275606,0.00008371532,0.0006646055,0.00026250523,0.5181498,0.016444398,0.4052325,0.057174042,0.00007768117],"about_ca_topic_score_codex":0.00044681365,"about_ca_topic_score_gemma":0.00029770404,"teacher_disagreement_score":0.0031758724,"about_ca_system_score_codex":0.0006286354,"about_ca_system_score_gemma":0.00035462802,"threshold_uncertainty_score":0.010624409},"labels":[],"label_agreement":null},{"id":"W1959899082","doi":"10.1109/its.1990.175654","title":"A neural network controller for a high-speed packet switch","year":2002,"lang":"en","type":"article","venue":"SBT/IEEE International Symposium on Telecommunications","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Artificial neural network; Integrated Services Digital Network; Network packet; Throughput; Asynchronous Transfer Mode; Controller (irrigation); Packet switching; Queue; Computer network; Algorithm; Real-time computing; Telecommunications; Artificial intelligence","score_opus":0.03648688003253541,"score_gpt":0.27337869574254825,"score_spread":0.23689181571001283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959899082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06508197,0.0008000067,0.8996216,0.00089575956,0.00051617995,0.00013145871,0.00017350714,0.0040954524,0.02868402],"genre_scores_gemma":[0.89940923,0.00023643066,0.08384518,0.0003521913,0.00007996009,0.00018692114,0.000108910725,0.000043044332,0.01573814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981374,0.000030335093,0.000010437589,0.000052969055,0.00006596967,0.000026564981],"domain_scores_gemma":[0.99979943,0.000052386906,0.000019728714,0.00001534709,0.00009684861,0.000016150274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003076929,0.00037848903,0.0002710776,0.00019030314,0.0005572514,0.0007918978,0.00097425026,0.0009410219,0.00473978],"category_scores_gemma":[0.00061359763,0.00014450355,0.00022374807,0.00023419857,0.00040263392,0.00056431507,0.0003221437,0.00094386743,0.000697559],"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.00048136752,0.00035128323,0.0015177209,0.0002200357,0.00013566727,0.00036301633,0.000107966545,0.68965745,0.047961824,0.026335154,0.0103065735,0.22256199],"study_design_scores_gemma":[0.000027240754,0.00007185365,0.0002100844,0.000007764193,0.000018686764,0.000033037788,0.000006087353,0.9914624,0.0041956077,0.0016817342,0.002276062,0.000009436121],"about_ca_topic_score_codex":0.0065647103,"about_ca_topic_score_gemma":0.008505808,"teacher_disagreement_score":0.0065647103,"about_ca_system_score_codex":0.00088705414,"about_ca_system_score_gemma":0.0006359645,"threshold_uncertainty_score":0.015856206},"labels":[],"label_agreement":null},{"id":"W196143471","doi":"","title":"Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, ... Papers (Lecture Notes in Computer Science)","year":2005,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Data science; Operations research; Theoretical computer science; Engineering","score_opus":0.009139767182181173,"score_gpt":0.21414913559366064,"score_spread":0.20500936841147946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W196143471","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006675935,0.36427522,0.107509606,0.019435301,0.018629948,0.00011140663,0.0019937607,0.0012198761,0.48014897],"genre_scores_gemma":[0.047236893,0.19013987,0.065393545,0.0016101543,0.006634749,0.00014171215,0.0033450865,0.00086537853,0.6846326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999703,0.000029093286,0.000009111095,0.00006985816,0.00014672484,0.000042320353],"domain_scores_gemma":[0.99942833,0.00017301917,0.000025675467,0.00006213792,0.00019459396,0.00011622218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005846889,0.001447344,0.0010924548,0.0016545715,0.0010566646,0.0038663154,0.0014588255,0.00069014676,0.031682055],"category_scores_gemma":[0.0009900942,0.00091099564,0.00063564937,0.00452079,0.0015411532,0.002769581,0.0007048535,0.0026026864,0.0068272427],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004749067,0.000057646383,0.0002658819,0.00049786747,0.00003491392,0.00007084625,0.00011354327,0.004643743,0.0014217965,0.118831165,0.6965722,0.1774429],"study_design_scores_gemma":[0.000020002899,0.000031050487,0.0015694131,0.00029952888,0.000041417374,0.00041318295,0.00011391838,0.007840801,0.0014935489,0.16519012,0.82295597,0.000031150976],"about_ca_topic_score_codex":0.013394116,"about_ca_topic_score_gemma":0.037697263,"teacher_disagreement_score":0.031682055,"about_ca_system_score_codex":0.0036259568,"about_ca_system_score_gemma":0.0028652807,"threshold_uncertainty_score":0.10598701},"labels":[],"label_agreement":null},{"id":"W1963660119","doi":"10.1145/2641483.2641531","title":"Exploring the diameter and broadcast time of general Knödel graphs using extensive simulations","year":2008,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Computer science; Graph; Upper and lower bounds; Gossip; Broadcasting (networking); Dissemination; Theoretical computer science; Binary logarithm; Complete graph; Combinatorics; Computer network; Mathematics; Telecommunications","score_opus":0.11616705505616559,"score_gpt":0.25430171145250124,"score_spread":0.13813465639633565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963660119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90829074,0.0017852754,0.06583427,0.0016043945,0.00015828319,0.00009965237,0.0011418284,0.0003614002,0.020724189],"genre_scores_gemma":[0.98899287,0.00047972176,0.008966237,0.00007885696,0.000017855793,0.00006504219,0.00033174385,0.000053461044,0.0010142528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996747,0.0001345204,0.000009726371,0.000052003084,0.000052697935,0.000076378594],"domain_scores_gemma":[0.9908145,0.00767899,0.00052241056,0.00032177847,0.00039305215,0.00026923648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612028,0.00048877386,0.00057761336,0.0012251922,0.00070875493,0.00060741097,0.0008950078,0.0011067815,0.0017698228],"category_scores_gemma":[0.00805369,0.00034674467,0.0006159745,0.00088599353,0.0010684218,0.001615579,0.0005905553,0.00090986706,0.00015767092],"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.00006526582,0.00005218343,0.001916,0.0000997764,0.00002689777,0.000069336886,0.00010360243,0.9787942,0.0013852832,0.013549934,0.0018025918,0.0021349231],"study_design_scores_gemma":[0.000015603684,0.000027904307,0.000492936,0.000012832327,0.000008777767,0.000021566808,0.00006697649,0.989307,0.0005574354,0.008838227,0.0006414797,0.000009304952],"about_ca_topic_score_codex":0.007268026,"about_ca_topic_score_gemma":0.008658426,"teacher_disagreement_score":0.007268026,"about_ca_system_score_codex":0.0016764986,"about_ca_system_score_gemma":0.00068193366,"threshold_uncertainty_score":0.014451385},"labels":[],"label_agreement":null},{"id":"W1963700980","doi":"10.1093/comjnl/bxs055","title":"A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Combinatorics; Surface (topology); Vertex (graph theory); Mathematics; Enhanced Data Rates for GSM Evolution; Point (geometry); Chordal graph; Graph; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.034625398601954106,"score_gpt":0.21818894781859455,"score_spread":0.18356354921664045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963700980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10840224,0.001795408,0.8445601,0.0007734553,0.0002484644,0.000047473295,0.00023363254,0.00030108917,0.043638155],"genre_scores_gemma":[0.86734205,0.0023678918,0.1086509,0.000297281,0.0012460616,0.00021894091,0.0004108072,0.00033090418,0.019135248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977714,0.00007534538,0.0000095458845,0.00004311575,0.00005661338,0.000038314673],"domain_scores_gemma":[0.9990482,0.00051896524,0.00009670674,0.00010293947,0.00016354606,0.000069678965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005368098,0.0006493095,0.0005451257,0.0025361704,0.00066005765,0.0010562022,0.0010127337,0.0009799242,0.0059148837],"category_scores_gemma":[0.0027584159,0.00026304813,0.00068705616,0.0011951643,0.0012528027,0.0025783866,0.00071607163,0.0013279383,0.0009437968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000592942,0.00001053294,0.00019283635,0.000028392491,0.0000043821656,0.000057783527,0.00007235841,0.00836105,0.0013111501,0.9788842,0.0008887068,0.010182745],"study_design_scores_gemma":[0.0000056204008,0.00002644061,0.00033781343,0.000015480466,0.0000074544246,0.00022324601,0.000034128698,0.1038619,0.0008370261,0.89029247,0.0043433,0.000015236771],"about_ca_topic_score_codex":0.00034653165,"about_ca_topic_score_gemma":0.0002784923,"teacher_disagreement_score":0.0059148837,"about_ca_system_score_codex":0.00062732794,"about_ca_system_score_gemma":0.00023800081,"threshold_uncertainty_score":0.019787312},"labels":[],"label_agreement":null},{"id":"W1963938107","doi":"10.1109/mwscas.2013.6674681","title":"FLNR: A fast light-weight NoC router for FPGAs","year":2013,"lang":"en","type":"article","venue":"","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":"University of Windsor","funders":"","keywords":"Router; Computer science; Network on a chip; Network packet; Embedded system; Latency (audio); Field-programmable gate array; Interconnection; Computer network; Flow control (data); One-armed router","score_opus":0.00935228118008524,"score_gpt":0.20703324674425136,"score_spread":0.19768096556416612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963938107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16415113,0.0032386798,0.7951634,0.00049523026,0.00043458908,0.00041932316,0.00043646607,0.016005822,0.01965528],"genre_scores_gemma":[0.5115349,0.001089773,0.4685847,0.00027516304,0.00008460738,0.0001608317,0.0007730213,0.00024082091,0.017256208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981827,0.0000404296,0.000013813728,0.000029812794,0.00006576656,0.00003188776],"domain_scores_gemma":[0.9998136,0.000033374392,0.000042015487,0.000028044191,0.0000640038,0.000018916637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068077,0.00036868523,0.0002154813,0.0006467936,0.00024982897,0.00041037743,0.0009204807,0.00028715725,0.0030627977],"category_scores_gemma":[0.00042465702,0.0001326748,0.00018523776,0.00030170457,0.00015698235,0.00059212185,0.00026204163,0.00020916789,0.00054372847],"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.0007897731,0.00018969439,0.0018922541,0.00049635954,0.00007421542,0.0005051194,0.000104990424,0.07212185,0.17152454,0.018106593,0.022207998,0.7119866],"study_design_scores_gemma":[0.00037474546,0.003007527,0.0038913314,0.00012320855,0.00013478004,0.0013730424,0.000069738024,0.6914909,0.1801216,0.0045025866,0.114764184,0.0001464404],"about_ca_topic_score_codex":0.0017109833,"about_ca_topic_score_gemma":0.0028701648,"teacher_disagreement_score":0.0030627977,"about_ca_system_score_codex":0.00046402944,"about_ca_system_score_gemma":0.00048406125,"threshold_uncertainty_score":0.010246038},"labels":[],"label_agreement":null},{"id":"W1964071270","doi":"10.1142/s0219265904001039","title":"ON THE COMBINATORIAL PROPERTIES OF k-ARY n-CUBES","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cube (algebra); Node (physics); Computer science; Tree (set theory); Topology (electrical circuits); Combinatorics; Mathematics; Discrete mathematics; Physics","score_opus":0.016686749516997685,"score_gpt":0.20751880320389918,"score_spread":0.19083205368690148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964071270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5439432,0.0044185463,0.36756542,0.0028517423,0.00018813676,0.00015309376,0.0009670787,0.00020654348,0.07970611],"genre_scores_gemma":[0.91417176,0.004311844,0.07220067,0.0005670826,0.00053244317,0.00030749422,0.0009475619,0.00016065095,0.006800444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876714,0.00041814402,0.00008058188,0.00019661571,0.00038105063,0.00015651908],"domain_scores_gemma":[0.9896075,0.007698894,0.0012004715,0.000553733,0.00067332777,0.000266032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348165,0.0006182919,0.00082464796,0.0015726059,0.0012963315,0.0030041928,0.0011357081,0.0007959609,0.003305029],"category_scores_gemma":[0.012185693,0.0005139163,0.00063284795,0.0036170133,0.0032440834,0.00538574,0.0015032601,0.0014236179,0.0004909718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019312794,0.0000736362,0.0029684233,0.00022681673,0.00003660235,0.0003821615,0.00046269465,0.21920015,0.0038721152,0.7237301,0.0042095794,0.044644535],"study_design_scores_gemma":[0.00003329508,0.00009489899,0.0015036266,0.000051258357,0.000020636335,0.0007289865,0.00033105348,0.252595,0.001930114,0.73606014,0.006612939,0.000038020044],"about_ca_topic_score_codex":0.0017696593,"about_ca_topic_score_gemma":0.0012837376,"teacher_disagreement_score":0.003305029,"about_ca_system_score_codex":0.0011387184,"about_ca_system_score_gemma":0.000642323,"threshold_uncertainty_score":0.011056364},"labels":[],"label_agreement":null},{"id":"W1964746861","doi":"10.1016/j.compeleceng.2014.05.006","title":"Design and verification of an efficient WISHBONE-based network interface for network on chip","year":2014,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Canadian Bureau for International Education","keywords":"Asynchronous communication; Computer science; FIFO (computing and electronics); Network on a chip; Latency (audio); Embedded system; Network interface; Chip; Computer network; Parallel computing; Computer hardware","score_opus":0.010887236443879445,"score_gpt":0.21045724941595984,"score_spread":0.19957001297208038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964746861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11691407,0.00020932338,0.87024873,0.00022484871,0.000102553924,0.0003298808,0.00015474817,0.0029202932,0.008895412],"genre_scores_gemma":[0.87449735,0.000091717164,0.12242623,0.00010890893,0.000017340566,0.00015144766,0.00016270246,0.00014974366,0.0023945358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870944,0.00026397713,0.00007119017,0.00013209667,0.00064092845,0.00018244403],"domain_scores_gemma":[0.99877137,0.0004313379,0.00012240025,0.00026932845,0.00037020197,0.000035360492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011673534,0.00048804248,0.0005148967,0.00038234968,0.000577432,0.0013851501,0.002002685,0.00070965115,0.0033587932],"category_scores_gemma":[0.0028831023,0.00029152675,0.0004996646,0.00024191341,0.00058442034,0.0011389225,0.0008268763,0.00072167115,0.00045551648],"study_design_candidate":"bench_or_experimental","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.00094281253,0.0004217674,0.003762723,0.00087575463,0.00021814553,0.0006162547,0.00046418188,0.52549195,0.17810231,0.1513006,0.0055558267,0.13224764],"study_design_scores_gemma":[0.00011438824,0.00040303505,0.000343379,0.000023496465,0.000060458104,0.00009385248,0.000045768847,0.92121714,0.06403253,0.0076322746,0.006013727,0.00002000851],"about_ca_topic_score_codex":0.0037310803,"about_ca_topic_score_gemma":0.0041120024,"teacher_disagreement_score":0.0037310803,"about_ca_system_score_codex":0.0009275237,"about_ca_system_score_gemma":0.0024328504,"threshold_uncertainty_score":0.01123625},"labels":[],"label_agreement":null},{"id":"W1965042227","doi":"10.1016/j.sysarc.2010.07.002","title":"Modeling and evaluation of ring-based interconnects for Network-on-Chip","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Ring (chemistry); Chip; Computer architecture; Embedded system; Parallel computing; Telecommunications","score_opus":0.02838903869049094,"score_gpt":0.2748514868725567,"score_spread":0.24646244818206578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965042227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.613389,0.0024395108,0.34496954,0.00076384854,0.00015186038,0.00023254256,0.00060172915,0.001147969,0.03630403],"genre_scores_gemma":[0.9824867,0.0003616245,0.013819005,0.000025803034,0.000015891908,0.00005286326,0.00009356785,0.0000579283,0.0030866629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00013704333,0.000010592326,0.000042469957,0.0001024936,0.000058416248],"domain_scores_gemma":[0.99913776,0.000418084,0.000103107974,0.00006806616,0.00023117731,0.00004169929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005690085,0.00056215667,0.00065723323,0.00050858926,0.00043398896,0.00082509284,0.00147,0.0010623377,0.002111401],"category_scores_gemma":[0.002176434,0.00037208977,0.00042529978,0.0005228524,0.00045808248,0.00093794893,0.00033846326,0.00037267536,0.0002953674],"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.000015994738,0.000014394816,0.00019107726,0.000016293321,0.000005407259,0.000013582611,0.0000092729215,0.9961653,0.0009327437,0.0012612104,0.00012437203,0.0012504109],"study_design_scores_gemma":[0.0000014419373,0.000012341988,0.000048855607,0.0000010806525,0.0000029161401,0.0000025357886,0.000002679103,0.99937856,0.00027260152,0.00017191582,0.00010367312,0.0000013263976],"about_ca_topic_score_codex":0.011239144,"about_ca_topic_score_gemma":0.008071676,"teacher_disagreement_score":0.011239144,"about_ca_system_score_codex":0.0016009994,"about_ca_system_score_gemma":0.0011105409,"threshold_uncertainty_score":0.02234745},"labels":[],"label_agreement":null},{"id":"W1965360969","doi":"10.1109/nocs.2012.23","title":"Fine-Grained Bandwidth Adaptivity in Networks-on-Chip Using Bidirectional Channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"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; Scalability; Bandwidth (computing); Network on a chip; Provisioning; Latency (audio); Computer architecture; Dynamic bandwidth allocation; Computer network; Channel (broadcasting); Parsec; Distributed computing; Embedded system; Telecommunications; Operating system","score_opus":0.04793330197351456,"score_gpt":0.2635100546675092,"score_spread":0.21557675269399465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965360969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8033783,0.0010050749,0.188546,0.00022300592,0.00007570423,0.00007091762,0.000083322164,0.0014389615,0.005178765],"genre_scores_gemma":[0.983426,0.00013543478,0.015854435,0.000029388286,0.000009099118,0.00002608957,0.000035131638,0.00003892298,0.00044552638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997335,0.000077362,0.000013728705,0.000045516306,0.000056765308,0.00007314539],"domain_scores_gemma":[0.9992835,0.00027752444,0.00011102327,0.00015627671,0.00012684432,0.000044853135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048269102,0.00030313,0.00023225526,0.00039955578,0.00032096097,0.0005035249,0.0006495159,0.0002525703,0.0005942443],"category_scores_gemma":[0.001535981,0.0002420179,0.00013175019,0.0003390294,0.0003938415,0.0010290438,0.00042801478,0.00035727775,0.00010807666],"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.00028791523,0.00013997398,0.003988479,0.00010867585,0.000027393698,0.0001364366,0.00013948043,0.81975526,0.09972674,0.0071634497,0.0011323246,0.067393914],"study_design_scores_gemma":[0.000038706246,0.00020783792,0.0019479363,0.00001672306,0.00003691446,0.00008789189,0.00007736545,0.9541541,0.033346266,0.0064571416,0.0035930425,0.000036082383],"about_ca_topic_score_codex":0.0031519847,"about_ca_topic_score_gemma":0.0057005994,"teacher_disagreement_score":0.0031519847,"about_ca_system_score_codex":0.00061937567,"about_ca_system_score_gemma":0.0006446556,"threshold_uncertainty_score":0.0062672496},"labels":[],"label_agreement":null},{"id":"W1965799226","doi":"10.1109/comst.2004.5342296","title":"A survey of topologies and performance measures for large-scale networks","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Network topology; Computer science; Hypercube; Topology (electrical circuits); Comparison of topologies; Logical topology; Scale (ratio); Distributed computing; Extension topology; Computer network; General topology; Mathematics; Parallel computing","score_opus":0.0759649351815312,"score_gpt":0.3086765142016457,"score_spread":0.23271157902011452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965799226","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01861594,0.11253554,0.84369034,0.0010007289,0.0006842802,0.00021573805,0.00068232464,0.000993053,0.021582099],"genre_scores_gemma":[0.38482192,0.18212132,0.4202528,0.0006011779,0.0026412352,0.00095082965,0.0024122384,0.0006746499,0.00552386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969373,0.0010403421,0.0003361693,0.00033780184,0.0012361959,0.000112108],"domain_scores_gemma":[0.9944254,0.0032602868,0.0006516536,0.00046296147,0.0010706026,0.00012913039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024667578,0.0020042458,0.0017480039,0.004158291,0.0008782244,0.0029304551,0.0013155036,0.0014444428,0.0018819154],"category_scores_gemma":[0.01193626,0.00063656695,0.00065399846,0.007030419,0.0010375555,0.006033645,0.0009032218,0.0015224549,0.0010798861],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024481045,0.00016700514,0.0033005143,0.004048486,0.00016049106,0.0003292532,0.00032756978,0.2232609,0.009025948,0.28033158,0.017666958,0.46113652],"study_design_scores_gemma":[0.00004489331,0.00094276835,0.0035643384,0.0014267889,0.00017236384,0.0028933478,0.0005231811,0.4385433,0.010845642,0.36633366,0.17443949,0.0002702785],"about_ca_topic_score_codex":0.00058070687,"about_ca_topic_score_gemma":0.0003037604,"teacher_disagreement_score":0.004158291,"about_ca_system_score_codex":0.0011331878,"about_ca_system_score_gemma":0.0005251829,"threshold_uncertainty_score":0.013045609},"labels":[],"label_agreement":null},{"id":"W1967505210","doi":"10.1109/cisis.2014.63","title":"Dynamic Virtual Channel Configuration for Efficient Multicore Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtual channel; Router; Multi-core processor; MPSoC; Network packet; Network on a chip; Computer network; Throughput; Latency (audio); Queue; Wormhole; Channel (broadcasting); Distributed computing; Embedded system; System on a chip; Parallel computing; Operating system","score_opus":0.012585261038311263,"score_gpt":0.23394979859465193,"score_spread":0.22136453755634067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967505210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12097913,0.0020996567,0.8647443,0.0002594516,0.00024046365,0.0001369047,0.000088470995,0.0020164768,0.009435112],"genre_scores_gemma":[0.9258723,0.00025937246,0.072056785,0.00007628461,0.000041712592,0.000083296596,0.00007164943,0.000058420705,0.0014801597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.000107453845,0.00002245633,0.00006266747,0.00010736042,0.000087614244],"domain_scores_gemma":[0.999503,0.00013845829,0.00005513671,0.00013581834,0.000105509156,0.00006198045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748058,0.00030929197,0.000329228,0.00043807356,0.0005289541,0.0007191354,0.00090297434,0.00029403958,0.002077665],"category_scores_gemma":[0.0007918431,0.00015827133,0.00014141473,0.0003971014,0.00042191404,0.0009419242,0.0008541808,0.00039830382,0.0002420463],"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.00067464035,0.00018800434,0.0019206045,0.00035912497,0.00006339624,0.00041176844,0.00022699592,0.49339634,0.12990682,0.07178486,0.0064958436,0.2945717],"study_design_scores_gemma":[0.000065664026,0.0002794869,0.0005827102,0.000032403106,0.000029867771,0.00022881238,0.00006478511,0.9260979,0.04179883,0.014952598,0.01582233,0.00004451567],"about_ca_topic_score_codex":0.0006442515,"about_ca_topic_score_gemma":0.0010877247,"teacher_disagreement_score":0.002077665,"about_ca_system_score_codex":0.0005476024,"about_ca_system_score_gemma":0.0006568563,"threshold_uncertainty_score":0.0069504976},"labels":[],"label_agreement":null},{"id":"W1969491738","doi":"10.1109/iwsoc.2005.85","title":"MP SoCs including optical interconnect: technological progresses and challenges for CAD tools design","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"McGill University","keywords":"Scalability; Computer architecture; Interconnection; Computer science; Flexibility (engineering); Bandwidth (computing); System on a chip; Embedded system; CAD; Chip; Electronic design automation; Electronic engineering; Engineering; Telecommunications; Engineering drawing","score_opus":0.1815679830386954,"score_gpt":0.30642505464429887,"score_spread":0.12485707160560347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969491738","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043258682,0.079542175,0.7719747,0.007101546,0.00096140185,0.000089141875,0.0001370713,0.0014997914,0.095435545],"genre_scores_gemma":[0.3706682,0.120991044,0.48260042,0.0016261291,0.0014943361,0.00017794056,0.00029005104,0.0002834266,0.021868438],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965453,0.00006375793,0.000022610648,0.000029632693,0.00020182578,0.000027508853],"domain_scores_gemma":[0.9992587,0.00030092543,0.00007122233,0.000101169135,0.00023749402,0.000030448064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066354085,0.0003835396,0.00025511708,0.0007009586,0.00037124843,0.0013266753,0.00044668163,0.0005272417,0.0022547846],"category_scores_gemma":[0.0012913991,0.00025348002,0.00023657568,0.0006441352,0.0004909189,0.0022182253,0.00050436024,0.00077111577,0.0006011586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042992626,0.00003436482,0.000989569,0.00074655074,0.000022790311,0.00026571477,0.00021295878,0.018873964,0.018187271,0.19006659,0.008356775,0.7622004],"study_design_scores_gemma":[0.00003492144,0.00035096708,0.0018075069,0.0005122188,0.00007784061,0.0017774947,0.00037958723,0.08679359,0.030606223,0.14279154,0.73478717,0.0000808588],"about_ca_topic_score_codex":0.00034520958,"about_ca_topic_score_gemma":0.00077481486,"teacher_disagreement_score":0.0022547846,"about_ca_system_score_codex":0.00037505207,"about_ca_system_score_gemma":0.00046713607,"threshold_uncertainty_score":0.0075430274},"labels":[],"label_agreement":null},{"id":"W1971217502","doi":"10.1016/j.dam.2008.12.004","title":"On explicit formulas for bandwidth and antibandwidth of hypercubes","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hypercube; Mathematics; Bandwidth (computing); Numbering; Simple (philosophy); Combinatorics; Latin hypercube sampling; Discrete mathematics; Algorithm; Computer science; Telecommunications; Monte Carlo method","score_opus":0.012773041884500557,"score_gpt":0.24299205514265712,"score_spread":0.23021901325815655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971217502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741505,0.008329547,0.8508825,0.0026898365,0.0008682261,0.00008688817,0.00035726998,0.00042457215,0.06894615],"genre_scores_gemma":[0.7147081,0.009629524,0.24108793,0.0015734669,0.0015578733,0.00039429686,0.0006075904,0.0011883813,0.02925282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989749,0.0003692907,0.00007020117,0.000117290685,0.00033692128,0.00013151827],"domain_scores_gemma":[0.9943614,0.0041036597,0.0002748055,0.00045195714,0.00057691283,0.00023132669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034800062,0.0017334587,0.0012434296,0.0027933125,0.0012858497,0.003538276,0.003535535,0.00201467,0.008795227],"category_scores_gemma":[0.022976477,0.0010145893,0.0010183413,0.0031705422,0.00280197,0.01225833,0.0032752668,0.0056036296,0.0013443481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048718943,0.000037394137,0.0002799702,0.00013575789,0.000013831741,0.00009894271,0.0002872164,0.012483967,0.00094195415,0.9649969,0.0027428973,0.017932545],"study_design_scores_gemma":[0.000010635781,0.000008819391,0.00013089342,0.000073871044,0.000013365906,0.00007304991,0.000083319785,0.061068792,0.0003905807,0.9353721,0.0027581358,0.000016395783],"about_ca_topic_score_codex":0.0015348662,"about_ca_topic_score_gemma":0.0030077358,"teacher_disagreement_score":0.008795227,"about_ca_system_score_codex":0.0024914783,"about_ca_system_score_gemma":0.00076716556,"threshold_uncertainty_score":0.029422998},"labels":[],"label_agreement":null},{"id":"W1971668188","doi":"10.1177/0037549702078004543","title":"Simulation of an Integrated Architecture for IP-over-ATM Frame Processing","year":2002,"lang":"en","type":"article","venue":"SIMULATION","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedded system; Computer hardware; Software; Duplex (building); Frame (networking); Chip; Computer architecture; Computer network; Operating system","score_opus":0.029237519136058432,"score_gpt":0.28741384793234603,"score_spread":0.2581763287962876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971668188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94093704,0.000115449926,0.04619493,0.00012613492,0.000029185192,0.00008816233,0.00055880804,0.0006156569,0.011334743],"genre_scores_gemma":[0.9877006,0.00006269124,0.00985528,0.000020471649,0.0000033645297,0.00008425415,0.00040833023,0.000031235428,0.0018337328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998191,0.000040904724,0.0000063962257,0.000023443907,0.00005734872,0.0000527958],"domain_scores_gemma":[0.9995359,0.00023131313,0.000040688363,0.000040181512,0.00010963607,0.000042365933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002701158,0.00046801966,0.0004769569,0.00030637303,0.000347269,0.00047884378,0.00082660414,0.0006971665,0.0033087155],"category_scores_gemma":[0.0009812658,0.0003207111,0.00048945035,0.00039256556,0.00046275198,0.0004738927,0.00028775499,0.00046291348,0.00021840818],"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.00004677022,0.000026802176,0.00060349493,0.00000900616,0.000008597969,0.000022748838,0.000019837706,0.99629873,0.0011460591,0.00075688324,0.00009545229,0.0009656309],"study_design_scores_gemma":[0.000011780365,0.000033330318,0.00022069119,0.0000011930093,0.000004976759,0.000004151791,0.000005720129,0.99887043,0.00058823486,0.00012364479,0.00013372736,0.0000021944852],"about_ca_topic_score_codex":0.013720796,"about_ca_topic_score_gemma":0.009111974,"teacher_disagreement_score":0.013720796,"about_ca_system_score_codex":0.0011369019,"about_ca_system_score_gemma":0.0013703749,"threshold_uncertainty_score":0.02728188},"labels":[],"label_agreement":null},{"id":"W1972387588","doi":"10.1109/fpl.2013.6645517","title":"An efficient FPGA overlay for portable custom instruction set extensions","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"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 Hospital","funders":"European Society for Medical Oncology; Norges Forskningsråd","keywords":"Overlay; Field-programmable gate array; Computer science; Overhead (engineering); Interconnection; Embedded system; Set (abstract data type); Architecture; Computer architecture; Operating system; Computer network; Programming language","score_opus":0.016798465612199408,"score_gpt":0.2506084901343303,"score_spread":0.23381002452213087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972387588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7796739,0.000662341,0.17936571,0.00022853773,0.00014942058,0.00017045188,0.00027943272,0.006847892,0.032622337],"genre_scores_gemma":[0.93584555,0.00015597668,0.05863675,0.000033320382,0.000018548593,0.000037941827,0.00023546138,0.0001011483,0.004935233],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99989855,0.000012946157,0.00000636219,0.000014592949,0.000035683257,0.000031950807],"domain_scores_gemma":[0.9998592,0.000024950414,0.000014661116,0.000054969987,0.000027994376,0.000018150602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009347364,0.00026385393,0.00015779892,0.0002573475,0.00026674528,0.00031328207,0.0004132253,0.00017979898,0.002633428],"category_scores_gemma":[0.00037910292,0.00010569935,0.00009794844,0.00032836036,0.00014572257,0.00068576477,0.0005047363,0.00027530984,0.000422636],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0009147057,0.00025112854,0.0042905277,0.00034277147,0.000043138625,0.0017654606,0.00028838884,0.09031851,0.52134174,0.029800542,0.015625456,0.33501762],"study_design_scores_gemma":[0.00015482023,0.0010462726,0.007142837,0.000056975063,0.000080547965,0.0016497975,0.00023803553,0.49297288,0.40282285,0.009285254,0.08447546,0.0000743141],"about_ca_topic_score_codex":0.0008626181,"about_ca_topic_score_gemma":0.0024736489,"teacher_disagreement_score":0.002633428,"about_ca_system_score_codex":0.00035903067,"about_ca_system_score_gemma":0.00036164193,"threshold_uncertainty_score":0.008809686},"labels":[],"label_agreement":null},{"id":"W1973079746","doi":"10.1007/s00373-013-1302-3","title":"The k-Dominating Graph","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Graph power; Bound graph; Neighbourhood (mathematics); Line graph","score_opus":0.005714229060984769,"score_gpt":0.18446223829652275,"score_spread":0.178748009235538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973079746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37357622,0.0075815367,0.34478942,0.010733332,0.0010209274,0.00018435938,0.0032623366,0.00049104536,0.25836083],"genre_scores_gemma":[0.88142085,0.0052769445,0.055094745,0.0014288919,0.00057484943,0.00016538225,0.0016270579,0.00015435254,0.05425701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994487,0.00013533089,0.000028846167,0.000210803,0.000097658965,0.00007857879],"domain_scores_gemma":[0.9982937,0.00082909124,0.0001548213,0.00022124824,0.00025608204,0.0002450366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049988757,0.00069393206,0.00082373456,0.0011434524,0.0013820655,0.0029256218,0.0011311581,0.0011039459,0.005159437],"category_scores_gemma":[0.0030944515,0.00052385655,0.00050208205,0.0013663599,0.0021185,0.0040387525,0.0015002255,0.0015526356,0.0013546402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012146168,0.000027728725,0.00059075997,0.0002301702,0.000028166436,0.00017160464,0.0003002332,0.0077158455,0.0031670053,0.9497231,0.0096472,0.028276678],"study_design_scores_gemma":[0.000021085229,0.00001706824,0.00036430563,0.00003055345,0.000019219422,0.0002865471,0.00008699668,0.012555063,0.0008135331,0.96838456,0.017406275,0.000014856377],"about_ca_topic_score_codex":0.0009951835,"about_ca_topic_score_gemma":0.0007367328,"teacher_disagreement_score":0.005159437,"about_ca_system_score_codex":0.00106026,"about_ca_system_score_gemma":0.0008162456,"threshold_uncertainty_score":0.017260015},"labels":[],"label_agreement":null},{"id":"W1973666239","doi":"10.1142/s0219265908002400","title":"AVERAGE-CASE \"MESSY\" BROADCASTING","year":2008,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brandon University","funders":"","keywords":"Broadcasting (networking); Hypercube; Computer science; Upper and lower bounds; Network topology; Graph; Focus (optics); Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Combinatorics; Parallel computing","score_opus":0.022989138321411567,"score_gpt":0.22900563889527023,"score_spread":0.20601650057385867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973666239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49772397,0.00083042984,0.48678547,0.00071075186,0.00006585066,0.00009458552,0.00044596219,0.00097331783,0.012369558],"genre_scores_gemma":[0.9725686,0.00027876525,0.02445393,0.00010502542,0.000034928114,0.00009329188,0.00017773216,0.00014612307,0.0021417225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974968,0.0005632495,0.00013353238,0.00056708895,0.0005709198,0.00066839583],"domain_scores_gemma":[0.98325044,0.010710992,0.0014823893,0.0026339341,0.00110852,0.00081380125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003699,0.00042483394,0.0011541767,0.0006561786,0.001019549,0.001709758,0.0018954293,0.0010450458,0.0043092915],"category_scores_gemma":[0.019696236,0.00065845926,0.00060489436,0.0009828929,0.0018542398,0.005617852,0.0015628767,0.0012082757,0.0005456952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076331804,0.000108326065,0.006487844,0.0003380407,0.00010958322,0.00043259654,0.00084569555,0.76132363,0.014882281,0.17944944,0.00434086,0.030918304],"study_design_scores_gemma":[0.000037170208,0.00014642015,0.0013228948,0.000016373408,0.00003232056,0.0003171307,0.0003239075,0.8458946,0.0055348836,0.14412226,0.0022141475,0.000038017864],"about_ca_topic_score_codex":0.0024582972,"about_ca_topic_score_gemma":0.0027319163,"teacher_disagreement_score":0.0043092915,"about_ca_system_score_codex":0.0019023981,"about_ca_system_score_gemma":0.0011001832,"threshold_uncertainty_score":0.015885293},"labels":[],"label_agreement":null},{"id":"W1974325710","doi":"10.1016/j.jcta.2011.10.001","title":"Sets of orthogonal hypercubes of class r","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; University College Dublin","keywords":"Hypercube; Combinatorics; Orthogonality; Mathematics; Class (philosophy); Power of two; Discrete mathematics; Prime (order theory); Computer science; Arithmetic; Geometry","score_opus":0.01977501702963548,"score_gpt":0.22370991365212553,"score_spread":0.20393489662249004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974325710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75014067,0.001285877,0.14981079,0.0005286303,0.00028963148,0.00016355459,0.001899228,0.00032210862,0.09555945],"genre_scores_gemma":[0.9441853,0.00057136273,0.036498845,0.00016841924,0.0001517835,0.00031957778,0.0020811383,0.00010452951,0.015918856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.0002113809,0.00006928913,0.0001662133,0.0002433701,0.00016629368],"domain_scores_gemma":[0.9981932,0.0007647644,0.0003284299,0.00022552365,0.00026475487,0.00022334604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042783,0.00059366715,0.0007518224,0.001875381,0.0013915462,0.0027498244,0.0011273581,0.00064520544,0.006964264],"category_scores_gemma":[0.0025212623,0.0005820559,0.0006061508,0.0011561778,0.0011569071,0.0015534164,0.0020269647,0.0006032509,0.00066246977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050502457,0.00012803102,0.002752715,0.00026336682,0.000093839735,0.00041300946,0.00038595323,0.010659596,0.010983372,0.93936455,0.00521841,0.029232135],"study_design_scores_gemma":[0.00014494875,0.00016770166,0.0053844904,0.00016561816,0.0000771044,0.0012591426,0.00070853694,0.082652986,0.012431987,0.8750384,0.021869553,0.000099409604],"about_ca_topic_score_codex":0.0005890794,"about_ca_topic_score_gemma":0.0006447201,"teacher_disagreement_score":0.006964264,"about_ca_system_score_codex":0.00067787064,"about_ca_system_score_gemma":0.00045613822,"threshold_uncertainty_score":0.023297787},"labels":[],"label_agreement":null},{"id":"W1974751828","doi":"10.1145/2684746.2689074","title":"Take the Highway","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":36,"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":"Field-programmable gate array; Embedded system; Computer science; Latency (audio); Network on a chip; Ethernet; Leverage (statistics); Interconnection; Network interface; Computer architecture; Computer hardware; Computer network; Telecommunications","score_opus":0.04708566195706065,"score_gpt":0.23839627971353972,"score_spread":0.19131061775647906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974751828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005379816,0.0087132035,0.014579413,0.3640048,0.036874916,0.00011578532,0.0007259019,0.0018310659,0.567775],"genre_scores_gemma":[0.070453696,0.015309464,0.013748657,0.18780869,0.010111515,0.00018047077,0.0010951489,0.0011642367,0.70012814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987368,0.00021506197,0.00003220739,0.0002840784,0.00039361886,0.00033818933],"domain_scores_gemma":[0.99723923,0.00030272783,0.0000932676,0.00039104524,0.00086359953,0.0011101016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018765338,0.0007842862,0.0003193284,0.0007960245,0.0037323285,0.008675633,0.0015068055,0.0055806767,0.2160521],"category_scores_gemma":[0.006229591,0.00029949268,0.00063562393,0.000559942,0.0025011005,0.01031934,0.004918476,0.005147517,0.08421476],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000075790056,0.00008730422,0.00076867774,0.00013691752,0.000017396687,0.00024617245,0.00048033128,0.00030537174,0.0006030004,0.11009835,0.74677986,0.14040083],"study_design_scores_gemma":[0.000007686888,0.000030007774,0.00017838742,0.00007911508,0.0000049843443,0.00007251815,0.00038066125,0.0000578372,0.00014138453,0.01564053,0.9833994,0.000007502136],"about_ca_topic_score_codex":0.0049059363,"about_ca_topic_score_gemma":0.009064961,"teacher_disagreement_score":0.2160521,"about_ca_system_score_codex":0.0014919647,"about_ca_system_score_gemma":0.004043161,"threshold_uncertainty_score":0.7227663},"labels":[],"label_agreement":null},{"id":"W1977041333","doi":"10.1142/s0129626411000072","title":"ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI","year":2011,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Polygon mesh; Lemma (botany); Torus; Surface (topology); Graph; Mathematics; Product (mathematics); Computer science; Geometry; Combinatorics","score_opus":0.02520157010959262,"score_gpt":0.21100405287633692,"score_spread":0.1858024827667443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977041333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43406945,0.004207899,0.48983043,0.0009137775,0.00018089594,0.00005174883,0.00057777273,0.00039943325,0.069768615],"genre_scores_gemma":[0.953388,0.0020970523,0.035768397,0.00009795971,0.0004667708,0.00010387529,0.000488321,0.00028911626,0.007300602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.00009946443,0.0000191153,0.00010340031,0.00012336829,0.00006166411],"domain_scores_gemma":[0.9970432,0.0018810462,0.00030823937,0.00025616577,0.00031118587,0.00020023994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062855124,0.00065564475,0.0005568553,0.0025654167,0.00064400624,0.0015093861,0.0008217264,0.0007024277,0.004985978],"category_scores_gemma":[0.0053677573,0.0003135725,0.00043389303,0.0014608603,0.0018583509,0.0043044863,0.0013314913,0.00082047685,0.0007630716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048609363,0.000018988412,0.0013688037,0.00007565227,0.000017059196,0.00009256107,0.00019159247,0.029285027,0.0044874027,0.9392175,0.0012909394,0.023905853],"study_design_scores_gemma":[0.000010393566,0.00005672874,0.0022854044,0.000021955579,0.000017334336,0.00031375603,0.00013341449,0.13636948,0.002252884,0.8532261,0.0052891253,0.000023274813],"about_ca_topic_score_codex":0.0005242562,"about_ca_topic_score_gemma":0.00034332732,"teacher_disagreement_score":0.004985978,"about_ca_system_score_codex":0.00060971564,"about_ca_system_score_gemma":0.00015454157,"threshold_uncertainty_score":0.016679764},"labels":[],"label_agreement":null},{"id":"W1978062154","doi":"10.1016/j.procs.2014.07.065","title":"Power-aware Mapping for 3D-NoC Designs Using Genetic Algorithms","year":2014,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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; Thompson Rivers University","funders":"","keywords":"Computer science; Scalability; Multi-core processor; Fitness function; Network on a chip; Genetic algorithm; Power consumption; Power (physics); Chip; Algorithm; Computer architecture; Embedded system; Parallel computing; Distributed computing","score_opus":0.043374633717403514,"score_gpt":0.2646851718614427,"score_spread":0.22131053814403917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978062154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08304996,0.00035183755,0.9089597,0.00018987172,0.00004416568,0.00012564461,0.000053034815,0.00071860093,0.0065072016],"genre_scores_gemma":[0.43959078,0.00024208332,0.557851,0.000082626924,0.000015520684,0.00026201698,0.00009771745,0.0001175682,0.0017407566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982184,0.00006329498,0.000006725463,0.000022708376,0.000060675684,0.000024792816],"domain_scores_gemma":[0.99965954,0.00018768941,0.00005297205,0.000028083517,0.00005927781,0.000012484979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164669,0.00076708954,0.000395251,0.00092442165,0.0004015781,0.00046408028,0.0006094554,0.00065054646,0.0013821101],"category_scores_gemma":[0.0011750975,0.00037440046,0.0006277257,0.00054889556,0.00042015724,0.00042380032,0.00045375156,0.00048165457,0.00021495904],"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.000011453864,0.00003022663,0.00039829558,0.000039482064,0.000018085222,0.000041119933,0.000042899,0.9553491,0.0045826123,0.0036802525,0.00033466332,0.035471752],"study_design_scores_gemma":[0.000006710698,0.000020551468,0.00009497502,0.000005952174,0.0000067084397,0.000014951824,0.000012200704,0.9951742,0.0013002381,0.0027598152,0.0006000022,0.0000036902593],"about_ca_topic_score_codex":0.0028024323,"about_ca_topic_score_gemma":0.0035798384,"teacher_disagreement_score":0.0028024323,"about_ca_system_score_codex":0.0008222144,"about_ca_system_score_gemma":0.00088054576,"threshold_uncertainty_score":0.00596565},"labels":[],"label_agreement":null},{"id":"W1978209500","doi":"10.1016/j.ins.2013.06.053","title":"Some new topological properties of the triangular pyramid networks","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Pyramid (geometry); Topology (electrical circuits); Computer science; Mathematics; Combinatorics; Geometry","score_opus":0.03224226172739179,"score_gpt":0.22104500384862227,"score_spread":0.1888027421212305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978209500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46682742,0.0018909603,0.37862977,0.0016717745,0.00040959576,0.000106386644,0.00076967996,0.0004353312,0.14925902],"genre_scores_gemma":[0.9642577,0.0008549968,0.026164131,0.0001965853,0.0002457096,0.000049847957,0.0002680279,0.000078965335,0.007883943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985147,0.000029020455,0.000009520192,0.000030697636,0.00005183332,0.00002742371],"domain_scores_gemma":[0.9994105,0.00018578634,0.00012076039,0.00006900796,0.000117764364,0.000096238095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002946912,0.00024634838,0.00028522083,0.0012728731,0.00062885444,0.0014266919,0.00056189473,0.00056020194,0.0056510433],"category_scores_gemma":[0.0016611913,0.0002481267,0.00035511618,0.0009258329,0.0008949814,0.0020215886,0.00054464734,0.00073232775,0.00037306832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005470872,0.00002315214,0.0004858593,0.00009266891,0.000012698467,0.00026128907,0.00018464352,0.010120496,0.008242796,0.9618654,0.0024913067,0.01616492],"study_design_scores_gemma":[0.000023068094,0.0000610528,0.0010110681,0.000022770942,0.000019982306,0.0005239145,0.00021417196,0.11829552,0.0022212327,0.8704847,0.007097168,0.000025311823],"about_ca_topic_score_codex":0.00069785316,"about_ca_topic_score_gemma":0.0007386277,"teacher_disagreement_score":0.0056510433,"about_ca_system_score_codex":0.0005011255,"about_ca_system_score_gemma":0.00023810337,"threshold_uncertainty_score":0.018904686},"labels":[],"label_agreement":null},{"id":"W1978745493","doi":"10.1109/ccece.2008.4564695","title":"High-level specification and logic implementation of single-chip multiprocessor systems based on a configurable router","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Router; Multiprocessing; Stratix; Network on a chip; Embedded system; System on a chip; Field-programmable gate array; Network topology; Parallel computing; Computer network","score_opus":0.045405636169642494,"score_gpt":0.21371785936772145,"score_spread":0.16831222319807895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978745493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18738404,0.00025821992,0.7872306,0.0001438155,0.000071085895,0.00029510658,0.00021944518,0.008969854,0.015427899],"genre_scores_gemma":[0.7261198,0.00015219723,0.26879713,0.00008800422,0.00001851009,0.00020378245,0.00032724362,0.00034732182,0.003945977],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.00007634922,0.00003832532,0.00005155539,0.00012152623,0.000053909716],"domain_scores_gemma":[0.99947876,0.00017369037,0.000058102913,0.00016110849,0.00010809083,0.00002030769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031552473,0.00038946274,0.00022482501,0.00028068956,0.00024365017,0.00075001584,0.0013864381,0.00035734926,0.002976085],"category_scores_gemma":[0.0007203103,0.00028719832,0.00026283055,0.00017668246,0.00026297919,0.0006144658,0.0001717683,0.00041845648,0.00052350195],"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.0007575608,0.000303174,0.0039363457,0.00070449075,0.00012563991,0.0012497529,0.00045839467,0.23270662,0.4760543,0.07695399,0.00756664,0.19918303],"study_design_scores_gemma":[0.00016263146,0.00070946553,0.0015106611,0.000047059624,0.000078764046,0.0005664142,0.000061096354,0.68906456,0.28020775,0.00501371,0.022523962,0.000053874017],"about_ca_topic_score_codex":0.0008398027,"about_ca_topic_score_gemma":0.0018167184,"teacher_disagreement_score":0.002976085,"about_ca_system_score_codex":0.000446562,"about_ca_system_score_gemma":0.000593317,"threshold_uncertainty_score":0.009956002},"labels":[],"label_agreement":null},{"id":"W1978926890","doi":"10.1109/cisis.2012.147","title":"Synthesis of NoC Interconnects for Multi-core Architectures","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network on a chip; Computer science; Benchmark (surveying); Asynchronous communication; Queueing theory; System on a chip; Network topology; Computer architecture; Embedded system; Power (physics); Chip; Distributed computing; Computer network","score_opus":0.06329360240142952,"score_gpt":0.29419059484321136,"score_spread":0.23089699244178186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978926890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073380515,0.00051559665,0.9134396,0.0001276285,0.00009149049,0.00014009523,0.00020984886,0.0010324209,0.011062805],"genre_scores_gemma":[0.45178393,0.0005415964,0.542536,0.00005188796,0.000029041212,0.00022799525,0.00050255196,0.0002602725,0.0040667714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.000043141194,0.000012943877,0.000023287848,0.00007548783,0.000019695837],"domain_scores_gemma":[0.99975723,0.00008159483,0.000040079947,0.00004001647,0.000069155445,0.000011988843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729443,0.0003858031,0.00016920976,0.00044315783,0.00027569727,0.00030846536,0.00035916697,0.000224575,0.0018061607],"category_scores_gemma":[0.00078168,0.00021669814,0.000327803,0.00033404157,0.00016807353,0.00030137337,0.00030192523,0.00027418998,0.0003114467],"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.00007927079,0.000058521175,0.0009242869,0.000501558,0.000040420506,0.00032320805,0.00016014147,0.65588826,0.1343598,0.033292882,0.0023923453,0.17197931],"study_design_scores_gemma":[0.000023019318,0.00016246227,0.00040787001,0.000035136105,0.000023291504,0.00011877744,0.000042825748,0.9259075,0.04955196,0.010552726,0.013162125,0.000012293559],"about_ca_topic_score_codex":0.0006808155,"about_ca_topic_score_gemma":0.0019347563,"teacher_disagreement_score":0.0018061607,"about_ca_system_score_codex":0.0004037988,"about_ca_system_score_gemma":0.0006109867,"threshold_uncertainty_score":0.006042242},"labels":[],"label_agreement":null},{"id":"W1979847495","doi":"10.1016/j.micpro.2011.05.002","title":"Designing power and performance optimal application-specific Network-on-Chip architectures","year":2011,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tabu search; Network on a chip; Network topology; Benchmark (surveying); Floorplan; Power (physics); Queueing theory; Network performance; Distributed computing; Topology (electrical circuits); Embedded system; Computer network; Algorithm","score_opus":0.014396621186339406,"score_gpt":0.19884567440974313,"score_spread":0.18444905322340371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979847495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36837468,0.0017217677,0.60014623,0.00085021387,0.0001461855,0.00014115174,0.00012245479,0.0006492791,0.027847938],"genre_scores_gemma":[0.9034505,0.0006536962,0.09261668,0.00013683505,0.00004866387,0.00010150211,0.000119272954,0.000103340826,0.0027695321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973875,0.00007574723,0.00001381288,0.000038518145,0.00005656528,0.00007648378],"domain_scores_gemma":[0.9995946,0.00017033862,0.000061179904,0.0000438265,0.000104259656,0.000025852827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032134217,0.00051851297,0.00038702443,0.0004050151,0.00038530253,0.0006088101,0.0008624171,0.00041790874,0.0016387681],"category_scores_gemma":[0.0017354062,0.00038564333,0.00018552659,0.0005456029,0.00031553704,0.0010575117,0.000487729,0.0004828831,0.00021450024],"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.00017654311,0.00007221846,0.0009691905,0.00021795236,0.000056803157,0.00008250392,0.00007735735,0.8451452,0.03136029,0.027901124,0.0027214563,0.091219395],"study_design_scores_gemma":[0.000018804929,0.00006707832,0.0002738551,0.000008949791,0.000026964937,0.00003850849,0.00004853309,0.9787523,0.0069489423,0.011815759,0.0019919404,0.000008478358],"about_ca_topic_score_codex":0.0009750996,"about_ca_topic_score_gemma":0.004526949,"teacher_disagreement_score":0.0016387681,"about_ca_system_score_codex":0.0008220025,"about_ca_system_score_gemma":0.00082516985,"threshold_uncertainty_score":0.0059641004},"labels":[],"label_agreement":null},{"id":"W1980092883","doi":"10.1007/s11227-007-0128-2","title":"Perfect load balancing on the star interconnection network","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Load balancing (electrical power); Star (game theory); Interconnection; Preprocessor; Tree network; Algorithm; Tree (set theory); Spanning tree; A* search algorithm; Time complexity; Distributed computing; Computer network; Mathematics; Discrete mathematics","score_opus":0.016155434261176597,"score_gpt":0.2315069813058925,"score_spread":0.2153515470447159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980092883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35482135,0.00094227016,0.6117998,0.000784752,0.00027905725,0.000054391498,0.0002869673,0.00116532,0.029866142],"genre_scores_gemma":[0.966815,0.00035471993,0.02609264,0.000078307,0.00007655673,0.000026605798,0.00015131658,0.00009706747,0.0063077984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996284,0.00011629746,0.000017885568,0.00006813837,0.00009159537,0.00007760665],"domain_scores_gemma":[0.99924004,0.0002402886,0.0000939954,0.0001853733,0.00017995221,0.000060386108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058040227,0.00031481052,0.0006518594,0.0006660475,0.0007992854,0.001023663,0.000689283,0.0004091829,0.0034660432],"category_scores_gemma":[0.0021721986,0.00024892998,0.00023922452,0.00096307334,0.00061676285,0.0017049155,0.00077441154,0.00033981228,0.00054760923],"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.0010875935,0.00006295219,0.001079664,0.0001797368,0.00005712059,0.00016019546,0.0001877431,0.61436826,0.0124484375,0.26121145,0.010788212,0.098368704],"study_design_scores_gemma":[0.00004108828,0.000060114744,0.00026291696,0.0000069514176,0.000016712393,0.000046014364,0.00003473555,0.8550673,0.0018283065,0.14003736,0.0025874136,0.000011050526],"about_ca_topic_score_codex":0.0016837447,"about_ca_topic_score_gemma":0.001896977,"teacher_disagreement_score":0.0034660432,"about_ca_system_score_codex":0.00058769534,"about_ca_system_score_gemma":0.0007404481,"threshold_uncertainty_score":0.01159507},"labels":[],"label_agreement":null},{"id":"W198036399","doi":"","title":"DESIGN OF A PROGRAMMABLE CONTROLLER FOR HYPERCYCLE BASED INTERCONNECTION NETWORKS","year":2008,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Computer science; Routing (electronic design automation); VHDL; Simple (philosophy); Field-programmable gate array; Controller (irrigation); Hypercube; Interconnection; Hardware description language; Distributed computing; Parallel computing; Embedded system; Theoretical computer science; Computer network","score_opus":0.040610424565242054,"score_gpt":0.23301171433287662,"score_spread":0.19240128976763457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198036399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06474701,0.00041999537,0.9179736,0.00027163452,0.00014278125,0.00039893584,0.0001527953,0.002496822,0.01339651],"genre_scores_gemma":[0.71264297,0.00021692351,0.2801841,0.00022413516,0.000033654967,0.00043119292,0.00020507061,0.000090704256,0.0059713027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976796,0.00003808845,0.000013849294,0.00005856149,0.000089071415,0.000032544616],"domain_scores_gemma":[0.99979395,0.000047299385,0.000031776726,0.000028304372,0.00007937756,0.00001922691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000294143,0.0002890892,0.00020834543,0.0003129331,0.00041628728,0.00094752514,0.0010782327,0.00044361877,0.0028957466],"category_scores_gemma":[0.0003654595,0.0001574708,0.00022536541,0.0001744826,0.0004196253,0.00050837913,0.00037375145,0.00036747413,0.0004418839],"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.00043175273,0.0002850412,0.0028859007,0.0008232393,0.00017198734,0.0011471331,0.000443191,0.35880664,0.3073917,0.111504376,0.009448148,0.20666091],"study_design_scores_gemma":[0.00011244395,0.00034429415,0.00035497942,0.000041617765,0.000046702404,0.0002015051,0.000058900605,0.89463425,0.07069347,0.0067104856,0.026773209,0.000028106568],"about_ca_topic_score_codex":0.0012884911,"about_ca_topic_score_gemma":0.0020408176,"teacher_disagreement_score":0.0028957466,"about_ca_system_score_codex":0.00069324527,"about_ca_system_score_gemma":0.0009042878,"threshold_uncertainty_score":0.009687245},"labels":[],"label_agreement":null},{"id":"W1981629634","doi":"10.1016/s0304-3975(02)00073-7","title":"Deterministic broadcasting time with partial knowledge of the network","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Computer network; Theoretical computer science","score_opus":0.008588091882672011,"score_gpt":0.22306216494164066,"score_spread":0.21447407305896865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981629634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28050518,0.0018688206,0.68515927,0.008970541,0.00023449084,0.00021633829,0.0020218568,0.0015531575,0.019470366],"genre_scores_gemma":[0.9528305,0.0006586073,0.035559043,0.000490987,0.0002663313,0.00020048906,0.0006367225,0.0002400563,0.009117346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586475,0.0012446082,0.00020943978,0.0010431177,0.00078267115,0.00085542095],"domain_scores_gemma":[0.9098694,0.07747782,0.0033456548,0.0051144087,0.0019007724,0.0022920074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057279463,0.0011255436,0.0030165883,0.0016508091,0.0019568624,0.004589165,0.0048243543,0.0045644757,0.008420881],"category_scores_gemma":[0.04624277,0.002317298,0.0012403694,0.00267391,0.004040128,0.009814292,0.0039709248,0.0038866708,0.0007428094],"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.0027449473,0.00016287495,0.0022001178,0.0007065896,0.00022923829,0.0004186916,0.000648601,0.5636168,0.0039044332,0.3893537,0.0077066887,0.028307192],"study_design_scores_gemma":[0.00026686047,0.00008196299,0.0004482274,0.000033279946,0.00008498608,0.00014805039,0.00005494486,0.73687786,0.0012801908,0.2598063,0.00087012333,0.000047198417],"about_ca_topic_score_codex":0.005471625,"about_ca_topic_score_gemma":0.0054565514,"teacher_disagreement_score":0.008420881,"about_ca_system_score_codex":0.004783746,"about_ca_system_score_gemma":0.0042149816,"threshold_uncertainty_score":0.03470868},"labels":[],"label_agreement":null},{"id":"W1982630460","doi":"10.1016/j.ipl.2009.03.009","title":"Honeycomb toroidal graphs are Cayley graphs","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cayley graph; Toroid; Combinatorics; Chordal graph; Mathematics; Discrete mathematics; Computer science; Physics; Graph; Quantum mechanics","score_opus":0.007792930118177193,"score_gpt":0.20873459803438688,"score_spread":0.20094166791620968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982630460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53813094,0.0018822949,0.2560414,0.0014874721,0.0014325031,0.00032228077,0.0012846644,0.0014298989,0.19798861],"genre_scores_gemma":[0.9394472,0.0009939979,0.027804818,0.00050820643,0.00014530985,0.00012900801,0.0005916128,0.00011561051,0.030264236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999031,0.000019781233,0.0000046172822,0.000022082275,0.000027764632,0.000022653723],"domain_scores_gemma":[0.9996376,0.00007788793,0.00007569213,0.000052652078,0.000095842355,0.000060329356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077891156,0.00032781172,0.0003290642,0.0007097705,0.0006855195,0.0012759981,0.00033563096,0.00059641205,0.008474771],"category_scores_gemma":[0.00052708614,0.00025919036,0.00027950923,0.000694238,0.0005856027,0.0010142052,0.00043710478,0.0006951165,0.0012051482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014152756,0.000035099652,0.0006918647,0.00017523185,0.00003603713,0.0005449512,0.00027106167,0.008787936,0.014205913,0.9137464,0.014007142,0.04735685],"study_design_scores_gemma":[0.00004188655,0.00009405618,0.0014900084,0.000036712994,0.000029610941,0.0007585206,0.00040629753,0.04143811,0.0064794812,0.91465276,0.0345298,0.000042712607],"about_ca_topic_score_codex":0.00076467555,"about_ca_topic_score_gemma":0.001464974,"teacher_disagreement_score":0.008474771,"about_ca_system_score_codex":0.00029718594,"about_ca_system_score_gemma":0.00025459513,"threshold_uncertainty_score":0.02835095},"labels":[],"label_agreement":null},{"id":"W1982676876","doi":"10.1002/net.1034","title":"<i>k</i>‐Broadcasting in trees","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"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); Vertex (graph theory); Computer science; Focus (optics); Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Computer network; Graph; Physics","score_opus":0.015188709972557767,"score_gpt":0.2276185526352694,"score_spread":0.21242984266271162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982676876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40268955,0.0033382822,0.5150899,0.0018172112,0.00010988321,0.0001244602,0.0006788686,0.0011771536,0.07497458],"genre_scores_gemma":[0.9103961,0.0015034439,0.081438154,0.00023830034,0.00007764374,0.00007724131,0.0003643925,0.00016504647,0.0057398602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.000103789156,0.000020328673,0.00007561134,0.000097827244,0.00012563771],"domain_scores_gemma":[0.99757713,0.0012425706,0.00039231687,0.00034483112,0.00031455222,0.00012865211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731247,0.0001856524,0.00035171394,0.000446681,0.000755257,0.0016077214,0.00072626915,0.00047001077,0.003318945],"category_scores_gemma":[0.003602023,0.00024582798,0.00020277784,0.0008187524,0.00076960603,0.001960761,0.0006161025,0.00067831075,0.0008676383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005379766,0.000113790426,0.0040537743,0.0005918051,0.000050463677,0.00026471363,0.00083837454,0.18302248,0.055134706,0.5873361,0.022331856,0.14572401],"study_design_scores_gemma":[0.00005616884,0.00014477095,0.002615505,0.000108639375,0.000040175684,0.0008237229,0.00034441202,0.4366259,0.024525149,0.50889426,0.025775917,0.000045420507],"about_ca_topic_score_codex":0.001904468,"about_ca_topic_score_gemma":0.0019676585,"teacher_disagreement_score":0.003318945,"about_ca_system_score_codex":0.0011359066,"about_ca_system_score_gemma":0.0005830453,"threshold_uncertainty_score":0.011102974},"labels":[],"label_agreement":null},{"id":"W1983131004","doi":"10.1016/j.micpro.2009.03.002","title":"Power optimization for application-specific networks-on-chips: A topology-based approach","year":2009,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"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; Interconnection; Abstraction; Power consumption; Power (physics); Topology (electrical circuits); Network topology; Embedded system; Network on a chip; Chip; Power optimization; Distributed computing; Computer architecture; Computer network; Telecommunications; Electrical engineering","score_opus":0.008955169748065046,"score_gpt":0.2223771140996473,"score_spread":0.21342194435158227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983131004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014544427,0.00071102526,0.9700023,0.00036926856,0.000076380835,0.00009342859,0.00008322036,0.0002658788,0.013853951],"genre_scores_gemma":[0.6882707,0.001650182,0.29453558,0.0003117926,0.00019715098,0.0004208403,0.00029445725,0.0007396953,0.0135796545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.00018695083,0.000013028445,0.000047743186,0.00012234732,0.00005286725],"domain_scores_gemma":[0.99931884,0.0003948202,0.00005603612,0.000065029635,0.00013728347,0.000028057591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008163673,0.0014209652,0.0016550196,0.0010985939,0.00071590143,0.0012673006,0.002071223,0.0014923917,0.005848394],"category_scores_gemma":[0.0028188762,0.00095488137,0.0010514555,0.0016468226,0.00071286235,0.001981666,0.00095725973,0.0009730356,0.00046387158],"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.0000073161223,0.000010817376,0.000042726468,0.000031666244,0.000014968891,0.000017510258,0.000008200853,0.98499876,0.00033559313,0.006572691,0.00041341968,0.00754635],"study_design_scores_gemma":[0.000002855458,0.000006635942,0.000028302027,0.0000032453402,0.0000067795104,0.000006854691,0.0000051029206,0.9933466,0.00012243318,0.0061125383,0.00035641372,0.0000022740307],"about_ca_topic_score_codex":0.002224227,"about_ca_topic_score_gemma":0.003999921,"teacher_disagreement_score":0.005848394,"about_ca_system_score_codex":0.00095925404,"about_ca_system_score_gemma":0.00083086407,"threshold_uncertainty_score":0.019564867},"labels":[],"label_agreement":null},{"id":"W1983241261","doi":"10.1109/fpt.2010.5681758","title":"Deterministic multi-core parallel routing for FPGAs","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":43,"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; Routing (electronic design automation); Field-programmable gate array; Router; Parallel computing; Queue; Multi-core processor; Static routing; Embedded system; Routing protocol; Computer network; Distributed computing","score_opus":0.05109615652191632,"score_gpt":0.297884586517854,"score_spread":0.24678842999593767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983241261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05793617,0.0008786055,0.93511,0.00017965196,0.000078490564,0.000050179522,0.000045527824,0.0006118086,0.0051095765],"genre_scores_gemma":[0.641406,0.00048762045,0.35541606,0.00009786495,0.000030612413,0.00008063189,0.00006926037,0.0000653119,0.002346699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971884,0.00009040607,0.0000122214515,0.00004349806,0.000099195386,0.000035856705],"domain_scores_gemma":[0.9996716,0.000114402996,0.00005450951,0.00009081657,0.000055201304,0.000013561815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033653673,0.0002841921,0.00031798315,0.00021763529,0.00030138483,0.00040419758,0.0006083945,0.00025278036,0.0009434458],"category_scores_gemma":[0.0008177711,0.00018127095,0.00027080817,0.00027839356,0.0002781614,0.0004651412,0.00027172136,0.00029950638,0.00014136269],"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.00006147265,0.000026232457,0.0005648948,0.00009972822,0.00002881039,0.00004909415,0.00002258308,0.9129279,0.007488792,0.030424824,0.0010148044,0.047290877],"study_design_scores_gemma":[0.0000075058592,0.000038618306,0.0001767774,0.0000038807307,0.0000074000627,0.00002537483,0.000004061444,0.98870134,0.0025968442,0.0065981653,0.0018349888,0.0000049080577],"about_ca_topic_score_codex":0.0014665219,"about_ca_topic_score_gemma":0.0035857484,"teacher_disagreement_score":0.0014665219,"about_ca_system_score_codex":0.0006628547,"about_ca_system_score_gemma":0.0006029839,"threshold_uncertainty_score":0.00480932},"labels":[],"label_agreement":null},{"id":"W1983758508","doi":"10.1142/s012905411450018x","title":"ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","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 Windsor","funders":"","keywords":"Adjacency list; Combinatorics; Graph factorization; Computer science; Subgraph isomorphism problem; Vertex (graph theory); Mathematics; Adjacency matrix; Degeneracy (biology); Algorithm; Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.02168548651430138,"score_gpt":0.27394579617006065,"score_spread":0.2522603096557593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983758508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032284003,0.00031543564,0.9613422,0.00019531789,0.000030939875,0.00023688162,0.0003391442,0.0012859835,0.003970113],"genre_scores_gemma":[0.121877596,0.00042092334,0.87259996,0.00014354997,0.00005034635,0.00028497452,0.0020208145,0.00021521593,0.002386544],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992422,0.00019338066,0.000055271867,0.00016021519,0.00024343755,0.00010550345],"domain_scores_gemma":[0.9974348,0.00133111,0.00031737486,0.0004119312,0.00039617077,0.000108599554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794342,0.0012004765,0.00086388807,0.0022267236,0.0010120884,0.0008058528,0.0013997756,0.0009982588,0.0039308397],"category_scores_gemma":[0.0054809796,0.0005167629,0.00082615967,0.0037800756,0.0010187611,0.0031562827,0.002045464,0.00081940327,0.0013112251],"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.0003407538,0.00048463102,0.0031499518,0.0009681987,0.0001325202,0.0007061926,0.000688251,0.23824875,0.024877202,0.10025673,0.018602926,0.61154395],"study_design_scores_gemma":[0.000111495916,0.00026290087,0.0014363227,0.00010987228,0.000093281014,0.00102594,0.0003609406,0.71495813,0.017898936,0.25023833,0.013433939,0.0000698999],"about_ca_topic_score_codex":0.0026145156,"about_ca_topic_score_gemma":0.0038672597,"teacher_disagreement_score":0.0039308397,"about_ca_system_score_codex":0.00067596784,"about_ca_system_score_gemma":0.0010395631,"threshold_uncertainty_score":0.013149977},"labels":[],"label_agreement":null},{"id":"W1983867705","doi":"10.1002/jcd.20062","title":"Fault tolerant forwarding and optical indexes: A design theory approach","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","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":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Fault tolerance; Mathematics; Fault (geology); Arc (geometry); Network planning and design; Combinatorics; Computer science; Discrete mathematics; Distributed computing; Computer network; Graph","score_opus":0.030965606947279775,"score_gpt":0.2514559348853198,"score_spread":0.22049032793804002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983867705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022078326,0.00058553566,0.96560764,0.0005091724,0.00006148015,0.000044723532,0.000041434127,0.000088208624,0.010983491],"genre_scores_gemma":[0.7028679,0.0014490221,0.28789395,0.00044146742,0.0001976384,0.00024628558,0.000130477,0.00007082406,0.0067023835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999065,0.00031037946,0.00003641025,0.000086227905,0.00039767823,0.0001042911],"domain_scores_gemma":[0.99840015,0.00096454663,0.0001872532,0.00017417701,0.00022970195,0.000044184824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017120122,0.0005958342,0.0005420374,0.0013190215,0.0006430844,0.0017623545,0.00088961795,0.0010605135,0.0024623778],"category_scores_gemma":[0.0038062439,0.00046104254,0.00049429806,0.0009544234,0.0014847408,0.0023662446,0.00084428716,0.0008549992,0.000259493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005583397,0.000057129753,0.00032392578,0.00012132641,0.000026171052,0.00005183445,0.00007773114,0.21780586,0.0048027853,0.72717005,0.0015724518,0.047934953],"study_design_scores_gemma":[0.000028743292,0.0001027198,0.00014654403,0.000039209564,0.000023885998,0.00009880531,0.00005743187,0.47886792,0.004888299,0.5089658,0.0067632277,0.000017447708],"about_ca_topic_score_codex":0.0005292993,"about_ca_topic_score_gemma":0.0005530034,"teacher_disagreement_score":0.0024623778,"about_ca_system_score_codex":0.001954197,"about_ca_system_score_gemma":0.0008491465,"threshold_uncertainty_score":0.014178753},"labels":[],"label_agreement":null},{"id":"W1984293343","doi":"10.1007/s00373-012-1172-0","title":"Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cayley graph; Vertex connectivity; Discrete mathematics; Graph","score_opus":0.009608412346894054,"score_gpt":0.2061704933930898,"score_spread":0.19656208104619574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984293343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370196,0.00021508645,0.037778527,0.00021760895,0.000042926884,0.000039132556,0.0004616651,0.00024045963,0.023985002],"genre_scores_gemma":[0.98939973,0.00018994686,0.0060590473,0.00006304078,0.000029013434,0.000037898906,0.00061327,0.000043105847,0.0035648562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983215,0.000039282528,0.000010992965,0.000043494445,0.000038416965,0.000035698045],"domain_scores_gemma":[0.99872017,0.00056094246,0.0002878532,0.0001236736,0.00015879399,0.00014856212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014002046,0.00023702387,0.00022634414,0.00085750764,0.00065191096,0.0010973708,0.00063663675,0.00055991235,0.0067037456],"category_scores_gemma":[0.0013480869,0.00025839932,0.00023507373,0.0013069572,0.0005383762,0.0009130647,0.00043325653,0.00044690652,0.0003708864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036692835,0.00015186169,0.0073103127,0.00024379048,0.00006142974,0.0015701287,0.0010624048,0.04346445,0.034890693,0.8511183,0.0066222725,0.053137444],"study_design_scores_gemma":[0.000106280604,0.00013617268,0.0054487125,0.000047340767,0.000083174746,0.00078967,0.0006386099,0.15059353,0.013857779,0.81814224,0.010108634,0.00004777663],"about_ca_topic_score_codex":0.0015876717,"about_ca_topic_score_gemma":0.0028877615,"teacher_disagreement_score":0.0067037456,"about_ca_system_score_codex":0.00037295168,"about_ca_system_score_gemma":0.00038780557,"threshold_uncertainty_score":0.022426248},"labels":[],"label_agreement":null},{"id":"W1985046107","doi":"10.1145/1723112.1723118","title":"Predicting the performance of application-specific NoCs implemented on FPGAs","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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":"Network topology; Field-programmable gate array; Routing (electronic design automation); Computer science; Network on a chip; Topology (electrical circuits); Design space exploration; Embedded system; Interconnection; System on a chip; Computer architecture; Engineering; Computer network; Electrical engineering","score_opus":0.011070253768545773,"score_gpt":0.23123853599968025,"score_spread":0.22016828223113447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985046107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99031305,0.00007983246,0.007873559,0.000021806754,0.000006609276,0.000014283922,0.00010078015,0.00015305621,0.0014371125],"genre_scores_gemma":[0.9960652,0.0000649357,0.0035075636,0.0000036255792,0.0000021888,0.000009533172,0.000095707175,0.000010107356,0.00024117432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986386,0.000030079296,0.000009416792,0.00002471204,0.00003601693,0.000035958205],"domain_scores_gemma":[0.999006,0.0006370025,0.00010363555,0.000087903376,0.00013629433,0.000029343642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027529013,0.00050539564,0.00024090204,0.00047193334,0.00018182436,0.00023811725,0.00036623137,0.00043478137,0.0007257578],"category_scores_gemma":[0.0021329892,0.00021991396,0.00019991375,0.00044060184,0.00020506045,0.00034979172,0.00011443939,0.0002399608,0.00016001062],"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.000070299895,0.000032825985,0.007892062,0.000029998513,0.000012560675,0.000063593085,0.00001797426,0.9784025,0.005383538,0.00028457373,0.00014201809,0.007668005],"study_design_scores_gemma":[0.0000028370894,0.000060702187,0.0040498236,0.0000024300793,0.0000051594684,0.00002189576,0.000010731742,0.9916579,0.003977774,0.000113947244,0.000092431255,0.0000043550785],"about_ca_topic_score_codex":0.004155551,"about_ca_topic_score_gemma":0.0034469652,"teacher_disagreement_score":0.004155551,"about_ca_system_score_codex":0.00057911826,"about_ca_system_score_gemma":0.00020094017,"threshold_uncertainty_score":0.008262694},"labels":[],"label_agreement":null},{"id":"W1985050732","doi":"10.1002/net.10042","title":"Fast permutation routing in a class of interconnection networks","year":2002,"lang":"en","type":"article","venue":"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 Alberta","funders":"","keywords":"Permutation (music); Routing (electronic design automation); Class (philosophy); Upper and lower bounds; Computer science; Interconnection; Time complexity; Permutation graph; Combinatorics; Mathematics; Theoretical computer science; Mathematical optimization; Discrete mathematics; Computer network; Graph; Artificial intelligence","score_opus":0.016087987533575578,"score_gpt":0.21796019163249497,"score_spread":0.2018722040989194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985050732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3325624,0.00063026225,0.6447396,0.00057880813,0.00008154546,0.00014356608,0.00031041284,0.00081695465,0.020136409],"genre_scores_gemma":[0.87364227,0.00043538288,0.11882867,0.000088209104,0.00007733399,0.00012629865,0.00047230153,0.00006199748,0.0062675495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.000115593124,0.000025889509,0.00012177125,0.000112120615,0.00009041671],"domain_scores_gemma":[0.99894994,0.0005572342,0.0001724352,0.00019228578,0.00008593494,0.00004212509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414934,0.00044268413,0.00045290886,0.00068116916,0.00071655324,0.0013309283,0.00064662285,0.0007012442,0.003780774],"category_scores_gemma":[0.0015455377,0.00024233032,0.0005421426,0.00093323324,0.0007539859,0.0017847735,0.0006120828,0.00070958585,0.00033306598],"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.00037738032,0.00013059365,0.002120629,0.00020107729,0.000052418836,0.00048139977,0.00016012027,0.6028955,0.0113643175,0.23519528,0.0037747698,0.14324656],"study_design_scores_gemma":[0.000029804145,0.00010208997,0.00048472063,0.000011802251,0.000011023992,0.00019535572,0.00004281724,0.8281245,0.002334143,0.1615679,0.007084502,0.000011315981],"about_ca_topic_score_codex":0.001084341,"about_ca_topic_score_gemma":0.0010489818,"teacher_disagreement_score":0.003780774,"about_ca_system_score_codex":0.0006932403,"about_ca_system_score_gemma":0.00044968823,"threshold_uncertainty_score":0.012647986},"labels":[],"label_agreement":null},{"id":"W1985131796","doi":"10.1109/ispass.2013.6557167","title":"Performance analysis of broadcasting algorithms on the Intel Single-Chip Cloud Computer","year":2013,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Computer science; Broadcasting (networking); Atomic broadcast; Unicast; Broadcast communication network; Cloud computing; Speedup; Scheme (mathematics); Message passing; Broadcast radiation; Broadcast domain; Synchronization (alternating current); Parallel computing; Computer network; Distributed computing; Operating system; Multicast","score_opus":0.03434354091562883,"score_gpt":0.2177061459151343,"score_spread":0.18336260499950546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985131796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8950326,0.002449883,0.06902758,0.00046534854,0.000088024746,0.00014570101,0.00041165345,0.0022204688,0.030158734],"genre_scores_gemma":[0.96344304,0.000521366,0.033365555,0.000055516564,0.000026125019,0.000060047754,0.00047793548,0.00013985696,0.0019107186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886775,0.00018839331,0.000038538947,0.00014479703,0.00041537918,0.00034520385],"domain_scores_gemma":[0.99704045,0.0015020161,0.00023360914,0.00034238875,0.00073806284,0.00014341396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010685475,0.00051631115,0.0005832807,0.00069463375,0.0007073463,0.000665827,0.0008635033,0.00039240054,0.0025384778],"category_scores_gemma":[0.004483061,0.00015700152,0.00029514616,0.0016471243,0.00046138855,0.0008262978,0.0002681912,0.00046476827,0.00042078816],"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.0013937497,0.0004119321,0.0075294655,0.00040252236,0.000082183215,0.000089944304,0.00016667237,0.8003957,0.027353207,0.021388166,0.009343466,0.13144302],"study_design_scores_gemma":[0.000039261642,0.0001500136,0.0014777698,0.000007962,0.000016287198,0.000021255624,0.000035110035,0.98955804,0.007054289,0.00092867453,0.000704828,0.000006584635],"about_ca_topic_score_codex":0.017878545,"about_ca_topic_score_gemma":0.012075592,"teacher_disagreement_score":0.017878545,"about_ca_system_score_codex":0.0026987405,"about_ca_system_score_gemma":0.002813141,"threshold_uncertainty_score":0.035548925},"labels":[],"label_agreement":null},{"id":"W1985142908","doi":"10.1016/j.jda.2008.04.003","title":"Yet another optimal algorithm for 3-edge-connectivity","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Algorithm; Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Edge contraction; Mathematics; Computer science; Combinatorics; Line graph; Voltage graph; Artificial intelligence","score_opus":0.02465649113162753,"score_gpt":0.2608431391470576,"score_spread":0.23618664801543005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985142908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03756061,0.00070682215,0.93192446,0.002602156,0.0006258404,0.00031022515,0.00049204996,0.0028391771,0.02293877],"genre_scores_gemma":[0.15546557,0.0003725127,0.832815,0.0008450143,0.00014349555,0.0002963378,0.0007730968,0.00051633554,0.008772741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902046,0.00019061772,0.00007390125,0.00032980106,0.00018242915,0.00020266918],"domain_scores_gemma":[0.99865615,0.00045298226,0.00007205985,0.00051141006,0.00018309994,0.00012425441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008918062,0.0014745108,0.0015891243,0.0011036615,0.0017504625,0.0025237817,0.00321874,0.0033548798,0.018647464],"category_scores_gemma":[0.0040559303,0.000703257,0.0015661421,0.0019652608,0.0011501088,0.0060075405,0.0030013751,0.002906608,0.0023918664],"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.001457462,0.00077006593,0.0011688927,0.0010444255,0.00025386113,0.00025011995,0.00046231036,0.07261342,0.021139052,0.17851052,0.049712237,0.6726177],"study_design_scores_gemma":[0.0009401681,0.0005444611,0.001325062,0.0001786792,0.00034714572,0.0008586496,0.00046311837,0.48420414,0.018691389,0.44978034,0.04251968,0.00014724588],"about_ca_topic_score_codex":0.0021346714,"about_ca_topic_score_gemma":0.004028137,"teacher_disagreement_score":0.018647464,"about_ca_system_score_codex":0.001691531,"about_ca_system_score_gemma":0.0022698021,"threshold_uncertainty_score":0.062381983},"labels":[],"label_agreement":null},{"id":"W1985750603","doi":"10.1145/2641483.2641532","title":"New Properties for Broadcasting in KG2k","year":2008,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Hypercube; Vertex (graph theory); Hypercube graph; Broadcasting (networking); Computer science; Interconnection; Graph; Combinatorics; Mathematics; Discrete mathematics; Topology (electrical circuits); Theoretical computer science; Computer network; Line graph; Voltage graph","score_opus":0.07061813931846905,"score_gpt":0.23383974998840762,"score_spread":0.16322161066993857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985750603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5035719,0.0016728293,0.40790153,0.0026992639,0.00024866677,0.00028137382,0.0012274244,0.0009124754,0.08148458],"genre_scores_gemma":[0.9156285,0.0015022807,0.07127391,0.00060882646,0.00029112736,0.00030134106,0.0010414631,0.00028330061,0.00906936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991404,0.0001557528,0.00006212417,0.00019524027,0.00027997085,0.00016639294],"domain_scores_gemma":[0.9928415,0.00365081,0.0013920051,0.00084105716,0.0008100518,0.0004646571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066798925,0.00029485844,0.0005571975,0.0008586723,0.0013979945,0.0015463268,0.0007459223,0.00082559854,0.0029872668],"category_scores_gemma":[0.005566669,0.0003982721,0.0006096261,0.0012497779,0.0017447916,0.0037563595,0.0010158994,0.0015290509,0.0006495193],"study_design_candidate":"bench_or_experimental","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.0002461483,0.00010192815,0.002835999,0.0004115947,0.000041668536,0.0006186569,0.001927524,0.018030971,0.018362736,0.90827614,0.008082902,0.04106372],"study_design_scores_gemma":[0.00013681948,0.0002953993,0.004043514,0.000087828405,0.0001097316,0.0028297834,0.0010986873,0.08549155,0.01437868,0.8366161,0.05483686,0.00007503232],"about_ca_topic_score_codex":0.001383562,"about_ca_topic_score_gemma":0.0011630201,"teacher_disagreement_score":0.0029872668,"about_ca_system_score_codex":0.0010599839,"about_ca_system_score_gemma":0.00066480995,"threshold_uncertainty_score":0.009993374},"labels":[],"label_agreement":null},{"id":"W1986921363","doi":"10.1504/ijhpcn.2005.007863","title":"Optimal all-to-all personalised exchange in a novel optical multistage interconnection network","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and 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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Computer network; Gigabit; Node (physics); Interconnection; Low latency (capital markets); Bandwidth (computing); Multistage interconnection networks; Distributed computing; Latency (audio); Transmission (telecommunications); Telecommunications","score_opus":0.023464152984837536,"score_gpt":0.27656840881214967,"score_spread":0.2531042558273121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986921363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32313675,0.00059010903,0.6628653,0.00036630937,0.0000770231,0.00008388004,0.00010837516,0.0004209104,0.012351393],"genre_scores_gemma":[0.88159424,0.0002443041,0.11333947,0.00006334449,0.000027900733,0.000051228842,0.000074330674,0.000020817579,0.0045844363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997681,0.000055577468,0.0000128634565,0.000058641024,0.00006623305,0.000038548125],"domain_scores_gemma":[0.99978536,0.00006100768,0.000052503456,0.000036054134,0.00004172887,0.000023264673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028030635,0.00026697095,0.0003627282,0.00022759126,0.00040984477,0.00048654494,0.0006860695,0.0004253415,0.001089154],"category_scores_gemma":[0.00043148588,0.00023790711,0.00022602412,0.00037083478,0.00031984394,0.0011591453,0.00045513082,0.0002860315,0.00017666798],"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.00078524573,0.00023824084,0.001363428,0.00025244872,0.00007269649,0.00057710643,0.00028001337,0.7010912,0.10617342,0.058216553,0.005261531,0.12568808],"study_design_scores_gemma":[0.000030053414,0.00016453558,0.0002719935,0.0000059537188,0.000015562791,0.00011692204,0.000018758494,0.9833682,0.006251246,0.007528098,0.0022132301,0.000015475456],"about_ca_topic_score_codex":0.000857517,"about_ca_topic_score_gemma":0.0023224463,"teacher_disagreement_score":0.001089154,"about_ca_system_score_codex":0.00060533994,"about_ca_system_score_gemma":0.00040114895,"threshold_uncertainty_score":0.0043920875},"labels":[],"label_agreement":null},{"id":"W1987153375","doi":"10.1109/cse.2014.244","title":"Broadcasting in Harary-Like Graphs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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":"Combinatorics; Vertex (graph theory); Logarithm; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.010982925580587392,"score_gpt":0.20969723863473663,"score_spread":0.19871431305414924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987153375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2612682,0.00097218837,0.69991636,0.0018600366,0.00013662784,0.00032693555,0.0012158105,0.0012548269,0.03304907],"genre_scores_gemma":[0.7761844,0.0008265192,0.20717536,0.00046707733,0.00009281615,0.00018348126,0.0013402158,0.00018502193,0.013545093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912995,0.00023461119,0.0000485694,0.0002606004,0.00016704692,0.0001592013],"domain_scores_gemma":[0.9976331,0.0010158373,0.0003511269,0.0004796547,0.0003114508,0.00020889028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004847273,0.00029865553,0.00052813516,0.0006190818,0.001370373,0.0014381277,0.0016237885,0.0009551898,0.0040866123],"category_scores_gemma":[0.003374482,0.0004414082,0.0004785531,0.0013821668,0.0008442014,0.0030984166,0.0014583875,0.001451782,0.0006183603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096601655,0.00024226088,0.0024962006,0.00067348615,0.00012449488,0.0005459891,0.0011937048,0.1919907,0.04332655,0.6048494,0.019492354,0.13409883],"study_design_scores_gemma":[0.00014389514,0.00032465425,0.0024306334,0.00007798839,0.000105532774,0.00079372653,0.0007619389,0.5047859,0.0184475,0.4239237,0.04813812,0.00006643028],"about_ca_topic_score_codex":0.004567785,"about_ca_topic_score_gemma":0.0062352377,"teacher_disagreement_score":0.004567785,"about_ca_system_score_codex":0.0015502307,"about_ca_system_score_gemma":0.00090641587,"threshold_uncertainty_score":0.0136711},"labels":[],"label_agreement":null},{"id":"W1988545066","doi":"10.1109/hpsr.2007.4281246","title":"A Distributed Model for Next Generation Router Software","year":2007,"lang":"en","type":"article","venue":"","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; Router; Packet processing; Distributed computing; Scalability; Computer network; Network packet; Embedded system; Operating system","score_opus":0.07724172030321745,"score_gpt":0.27349197000049713,"score_spread":0.19625024969727967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988545066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148316,0.00021680555,0.97124344,0.0009871239,0.00010144024,0.00017175546,0.000083380895,0.00050586066,0.0118586505],"genre_scores_gemma":[0.51656806,0.000682219,0.44584247,0.000504678,0.00027259006,0.0013118057,0.00036978972,0.00021571401,0.034232613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978503,0.00062159356,0.00014197492,0.00047717692,0.00066404615,0.00024491164],"domain_scores_gemma":[0.99777347,0.0007233245,0.00021207715,0.0005613066,0.0005520708,0.00017778276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019998555,0.0007024167,0.00064754207,0.00071159645,0.0009880743,0.0029027672,0.003058097,0.0030175864,0.004309449],"category_scores_gemma":[0.0032145418,0.0004970853,0.0010285563,0.00062685047,0.0019799438,0.0038540836,0.0017172408,0.002032506,0.001083788],"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.00010627741,0.00017298269,0.0007549372,0.00008579727,0.00003721307,0.00052825967,0.00046947994,0.24340892,0.0043503647,0.72794247,0.0028766224,0.01926668],"study_design_scores_gemma":[0.0001415514,0.00009842116,0.00014836567,0.00002193651,0.000031359406,0.00016831317,0.00006173711,0.8626047,0.0012142211,0.120040186,0.015443311,0.000025892527],"about_ca_topic_score_codex":0.0037198383,"about_ca_topic_score_gemma":0.002475093,"teacher_disagreement_score":0.004309449,"about_ca_system_score_codex":0.0021124945,"about_ca_system_score_gemma":0.0021838788,"threshold_uncertainty_score":0.015327275},"labels":[],"label_agreement":null},{"id":"W1988638065","doi":"10.1049/ip-com:20000632","title":"Prioritised ATM switches on board satellites: architectural analysis and design","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Interconnection Networks and Systems","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":"University of Waterloo","funders":"","keywords":"Asynchronous Transfer Mode; Computer science; Quality of service; Satellite constellation; Broadband; Computer network; Queue; Constellation; Architecture; Broadband networks; Telecommunications","score_opus":0.03279180831479839,"score_gpt":0.25982636746764853,"score_spread":0.22703455915285015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988638065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33894703,0.0034291751,0.6316838,0.00065868034,0.00012127106,0.00018979513,0.00021286444,0.0007036136,0.024053799],"genre_scores_gemma":[0.81639415,0.001562347,0.17457506,0.00012442491,0.000052640426,0.00008936114,0.00021425996,0.000048006143,0.0069398023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987185,0.000027587905,0.0000075386038,0.000014553895,0.000053536525,0.000024959105],"domain_scores_gemma":[0.9998253,0.000055058154,0.000022825441,0.000016740685,0.000064210275,0.000015854055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028125723,0.00019556837,0.00011062743,0.00031319575,0.00027687894,0.00080424035,0.0006054441,0.0002685087,0.0023819266],"category_scores_gemma":[0.00037808964,0.00013726037,0.00016019488,0.00050401135,0.00019041187,0.00053301087,0.00016368322,0.00023861245,0.00024046098],"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.00085534574,0.0002260054,0.0039298316,0.00053293136,0.000076679455,0.0006039106,0.00033710146,0.40188533,0.1291001,0.12720485,0.0063020186,0.3289459],"study_design_scores_gemma":[0.000058841513,0.00036329197,0.0012752371,0.000021856591,0.000053704767,0.0003426689,0.00008741695,0.9567021,0.020481171,0.009935517,0.010662008,0.000016236432],"about_ca_topic_score_codex":0.0017427381,"about_ca_topic_score_gemma":0.0038614885,"teacher_disagreement_score":0.0023819266,"about_ca_system_score_codex":0.0006995631,"about_ca_system_score_gemma":0.00078186806,"threshold_uncertainty_score":0.007968307},"labels":[],"label_agreement":null},{"id":"W1988766139","doi":"10.1145/2554688.2554786","title":"Quantifying the cost and benefit of latency insensitive communication on FPGAs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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":"Interfacing; Latency (audio); Computer science; Field-programmable gate array; Implementation; Embedded system; Computer architecture; Computer hardware; Telecommunications","score_opus":0.04237176278049997,"score_gpt":0.265734710595489,"score_spread":0.223362947814989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988766139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8444048,0.0020045661,0.13027851,0.00054784515,0.00011038464,0.000087401844,0.00026262458,0.0008111129,0.021492595],"genre_scores_gemma":[0.97548985,0.00045249227,0.022545593,0.000056254925,0.000025103924,0.000022320737,0.000081781924,0.000055292217,0.0012713275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850684,0.00036292608,0.00009518272,0.000105490675,0.00063510635,0.00029431013],"domain_scores_gemma":[0.99671566,0.002048428,0.00042392028,0.0004421007,0.0003102334,0.000059705624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086728,0.0007228729,0.00033220212,0.0007737649,0.00033678132,0.0008776543,0.0008707822,0.00058657693,0.0023531949],"category_scores_gemma":[0.0053829057,0.0002750774,0.00021728447,0.0010729879,0.00039247423,0.0023873264,0.00044315658,0.00047179504,0.00029681105],"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.0011127711,0.00011456448,0.0065464936,0.0003343204,0.00009450421,0.00041155887,0.00006457768,0.77970195,0.091114014,0.029334249,0.0010668287,0.09010419],"study_design_scores_gemma":[0.000077020515,0.0011659013,0.0064642145,0.000049756643,0.00021777977,0.0005325918,0.0001274606,0.8709311,0.1021329,0.013116872,0.0051287184,0.000055706627],"about_ca_topic_score_codex":0.0012296061,"about_ca_topic_score_gemma":0.0019922783,"teacher_disagreement_score":0.0023531949,"about_ca_system_score_codex":0.0009681263,"about_ca_system_score_gemma":0.00058313896,"threshold_uncertainty_score":0.007872224},"labels":[],"label_agreement":null},{"id":"W1990976277","doi":"10.1145/1141277.1141385","title":"On the transitive closure representation and adjustable compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Winnipeg","funders":"","keywords":"Transitive closure; Digraph; Transitive reduction; Directed graph; Computer science; Theoretical computer science; Transitive relation; Directed acyclic graph; Graph; Dependency graph; Discrete mathematics; Mathematics; Algorithm; Combinatorics; Voltage graph; Line graph","score_opus":0.01200556966119021,"score_gpt":0.21621637738865257,"score_spread":0.20421080772746236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990976277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02401208,0.0006810388,0.9606963,0.0004450406,0.00013967158,0.00014382282,0.0002953184,0.0019418075,0.011644839],"genre_scores_gemma":[0.2890818,0.0011847394,0.69895005,0.00037477372,0.0002809322,0.00046184598,0.0014288361,0.0005530151,0.0076839305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985228,0.000337138,0.00013618074,0.00027260484,0.0005679628,0.00016337169],"domain_scores_gemma":[0.99743277,0.0012025466,0.00019507152,0.00081479957,0.00029261594,0.00006220345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007702565,0.00077359274,0.0006245819,0.0017094258,0.00067264476,0.001883704,0.0011158356,0.0007049167,0.005030659],"category_scores_gemma":[0.0055828607,0.00036945488,0.0007555384,0.002937374,0.001297694,0.00442664,0.0018358268,0.0015780907,0.0013590823],"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.00041214214,0.00013863407,0.00046346764,0.00020762789,0.000025019817,0.00042626495,0.00045576057,0.04779955,0.022078877,0.3515273,0.009912503,0.56655294],"study_design_scores_gemma":[0.00013200594,0.0003241765,0.00047994856,0.00016231589,0.000060257393,0.0011774136,0.00027544977,0.550033,0.051601216,0.3509966,0.04464707,0.00011064443],"about_ca_topic_score_codex":0.00185013,"about_ca_topic_score_gemma":0.0015620594,"teacher_disagreement_score":0.005030659,"about_ca_system_score_codex":0.001107318,"about_ca_system_score_gemma":0.001150134,"threshold_uncertainty_score":0.016829252},"labels":[],"label_agreement":null},{"id":"W1991220937","doi":"10.1109/isqed.2012.6187569","title":"An enhanced debug-aware network interface for Network-on-Chip","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Debugging; Background debug mode interface; Computer science; Embedded system; Interface (matter); TRACE (psycholinguistics); Computer network; Operating system","score_opus":0.02373088380059072,"score_gpt":0.28329148322634146,"score_spread":0.2595605994257507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991220937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04488637,0.00046708417,0.9394431,0.00017886178,0.0001592378,0.00019154584,0.00015367175,0.010813742,0.0037063372],"genre_scores_gemma":[0.537668,0.00030016233,0.45240763,0.00044243448,0.000095184325,0.00030539962,0.00072054996,0.00044348298,0.007617034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993851,0.00017174963,0.000059354636,0.000120632554,0.00020505009,0.000058065896],"domain_scores_gemma":[0.99896884,0.00022812058,0.00009147873,0.00032226843,0.00031936646,0.00006987773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085432525,0.0004903009,0.00038175163,0.00064369786,0.00023694456,0.00079389854,0.0012692128,0.00050938054,0.0028311294],"category_scores_gemma":[0.002217989,0.00023492966,0.00020015732,0.0003093586,0.00026729392,0.0015590829,0.0011076792,0.0008122459,0.0005714957],"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.0022556505,0.0005833318,0.011648773,0.000614501,0.00017591492,0.0008926726,0.00084627117,0.031381033,0.2791729,0.0479939,0.016271751,0.60816324],"study_design_scores_gemma":[0.00025763508,0.0011046282,0.0031469308,0.000086928245,0.00021315132,0.0014630861,0.00010371169,0.6394876,0.2523878,0.006722422,0.094908364,0.00011773579],"about_ca_topic_score_codex":0.0004580875,"about_ca_topic_score_gemma":0.000757898,"teacher_disagreement_score":0.0028311294,"about_ca_system_score_codex":0.00037148068,"about_ca_system_score_gemma":0.00055256946,"threshold_uncertainty_score":0.009471059},"labels":[],"label_agreement":null},{"id":"W1991225420","doi":"10.1049/iet-cdt.2011.0173","title":"Contention‐aware selection strategy for application‐specific network‐on‐chip","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Routing (electronic design automation); Network on a chip; Static routing; Network packet; Selection algorithm; Adaptive routing; Routing protocol; Computer network","score_opus":0.02258229929357752,"score_gpt":0.2455796995939078,"score_spread":0.22299740030033027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991225420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21235238,0.0012246263,0.7791389,0.0002596572,0.00013891625,0.00015853903,0.000052060914,0.0015233855,0.005151404],"genre_scores_gemma":[0.92472464,0.0002545466,0.07308242,0.000112447386,0.000041152358,0.000081551865,0.000075001466,0.000041478288,0.0015867949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997497,0.00007013016,0.00001871559,0.000037984082,0.00008468014,0.00003871412],"domain_scores_gemma":[0.9994555,0.00022540864,0.00005086563,0.00008831786,0.00013620841,0.000043730728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034512,0.0003794247,0.00023476845,0.00052974373,0.00038179677,0.00045924966,0.000789878,0.00021546466,0.0008870896],"category_scores_gemma":[0.0009503908,0.00013475664,0.00013074886,0.0004043221,0.00031325547,0.0005861544,0.00031611847,0.00032563074,0.000157701],"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.0005719829,0.00042027218,0.0044739996,0.0001654539,0.00009669892,0.00038694288,0.00023248311,0.1681086,0.2555892,0.01911729,0.005504639,0.5453324],"study_design_scores_gemma":[0.00008540374,0.00038453555,0.0016456847,0.000012728938,0.00006897703,0.0002502934,0.000065092434,0.9315095,0.056010444,0.004632894,0.0053007035,0.000033780365],"about_ca_topic_score_codex":0.0011350915,"about_ca_topic_score_gemma":0.0025354116,"teacher_disagreement_score":0.0011350915,"about_ca_system_score_codex":0.00043699704,"about_ca_system_score_gemma":0.0007285949,"threshold_uncertainty_score":0.0031706095},"labels":[],"label_agreement":null},{"id":"W1991720859","doi":"10.4018/jaras.2013070103","title":"Exploration of Temperature Constraints for Thermal-Aware Mapping of 3D Networks-on-Chip","year":2013,"lang":"en","type":"article","venue":"International Journal of Adaptive Resilient and Autonomic Systems","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Computer science; Reduction (mathematics); Chip; Thermal; Power (physics); Network on a chip; Algorithm; Parallel computing; Computer engineering; Mathematics; Embedded system","score_opus":0.028629880172427992,"score_gpt":0.24742383814603228,"score_spread":0.2187939579736043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991720859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03587778,0.00030049833,0.9601886,0.00011967871,0.000025190162,0.000024044231,0.000013917646,0.00020507982,0.0032451113],"genre_scores_gemma":[0.68507,0.00035645624,0.31307042,0.00008493111,0.00002615971,0.00009952851,0.000055405995,0.00015597642,0.0010812242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969876,0.00013386365,0.000012691112,0.000037381094,0.000087707,0.000029706469],"domain_scores_gemma":[0.99916375,0.00058704335,0.00007145932,0.000083179184,0.00007457933,0.000020061674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005329349,0.0007249183,0.00047116604,0.00037164133,0.00047852687,0.0007480476,0.00074762426,0.00048857473,0.0011442705],"category_scores_gemma":[0.002306964,0.00048169773,0.00059293315,0.00030148056,0.00044119172,0.0012334584,0.00071820733,0.00064533553,0.00018350055],"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.000036108042,0.000032812874,0.000415895,0.00006529996,0.00001949624,0.000025233787,0.00006113677,0.9498689,0.0060475906,0.007131901,0.00025847848,0.036037114],"study_design_scores_gemma":[0.000004555631,0.000018349496,0.000080372105,0.000005817424,0.0000058742553,0.000016238067,0.000014123399,0.99453163,0.0018116877,0.0028864124,0.00062044215,0.000004440993],"about_ca_topic_score_codex":0.001097236,"about_ca_topic_score_gemma":0.0015729354,"teacher_disagreement_score":0.0011442705,"about_ca_system_score_codex":0.00062019,"about_ca_system_score_gemma":0.000714997,"threshold_uncertainty_score":0.004499793},"labels":[],"label_agreement":null},{"id":"W1992177081","doi":"10.1117/12.567581","title":"Adaptive packet switch with an optical core (demonstrator)","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Interconnection Networks and 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; Network packet; Field-programmable gate array; Packet switching; Ethernet; Bandwidth (computing); Computer network; Optical switch; Crossbar switch; Computer hardware; Embedded system; Telecommunications; Electronic engineering","score_opus":0.016784983198942362,"score_gpt":0.2277228854337831,"score_spread":0.21093790223484074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992177081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.690561,0.00021567303,0.29064676,0.00028251307,0.0001784073,0.00017679318,0.00018961859,0.0026234067,0.015125809],"genre_scores_gemma":[0.8945091,0.000070151575,0.100019656,0.00006193896,0.000019127978,0.00006595015,0.00009714035,0.000030896186,0.0051260646],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988186,0.000027362681,0.000004895016,0.000032257663,0.000037397498,0.000016139351],"domain_scores_gemma":[0.9998783,0.000031108706,0.000018182061,0.000028243066,0.000024290224,0.000019747213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021541372,0.0002186182,0.00013234501,0.00012216107,0.00015930561,0.00032974916,0.0007789492,0.0004209456,0.0020824387],"category_scores_gemma":[0.0001812661,0.00010497173,0.00015634763,0.000096715514,0.00020877337,0.00035694073,0.00023103546,0.0003337592,0.0003444034],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0008306398,0.00042983913,0.0034649426,0.00033904638,0.00007490935,0.00079766,0.0001992957,0.05040351,0.8358832,0.01948202,0.0026000123,0.085494794],"study_design_scores_gemma":[0.00019962605,0.0031643773,0.004317505,0.000021932214,0.00006670413,0.0015624699,0.00004936829,0.37251118,0.5810587,0.002315079,0.034690283,0.000042745723],"about_ca_topic_score_codex":0.00032411498,"about_ca_topic_score_gemma":0.00026998835,"teacher_disagreement_score":0.0020824387,"about_ca_system_score_codex":0.0002044338,"about_ca_system_score_gemma":0.00022701199,"threshold_uncertainty_score":0.0069664717},"labels":[],"label_agreement":null},{"id":"W1992290340","doi":"10.1049/iet-com:20070099","title":"Packet-loss-robust load-balancing switch with distributed extended cross-point queues","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Interconnection Networks and 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":"University of Ottawa","funders":"","keywords":"Computer science; Queue; Network packet; Packet switching; Computer network; Load balancing (electrical power); Queueing theory; Distributed computing","score_opus":0.02407038269048289,"score_gpt":0.2830280386695847,"score_spread":0.2589576559791018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992290340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08004216,0.00020706118,0.91148007,0.00014860534,0.00013627014,0.00010980547,0.00006626536,0.004114033,0.0036957862],"genre_scores_gemma":[0.8037933,0.00012046978,0.18797341,0.00017130015,0.00011885321,0.000120760575,0.0002121412,0.00012858378,0.007361218],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996061,0.000053966673,0.000023026525,0.00008347903,0.00018106205,0.000052516323],"domain_scores_gemma":[0.99950993,0.000081863625,0.000056435743,0.00014759178,0.00014337662,0.000060806993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691534,0.00045100183,0.0004321894,0.000530835,0.0005465864,0.0011493355,0.0021387078,0.0004538508,0.002253056],"category_scores_gemma":[0.0008011918,0.0001891838,0.0002712498,0.0003964259,0.000416506,0.0007149755,0.000954387,0.0008181039,0.00062822364],"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.0023620403,0.0009581547,0.0032414927,0.00017025894,0.00019002981,0.0005336582,0.0002781147,0.23732188,0.35279235,0.05263564,0.0096915355,0.33982483],"study_design_scores_gemma":[0.00018325195,0.00041627657,0.00095781835,0.000010752456,0.00005584584,0.0002328613,0.000022786473,0.9115269,0.07036617,0.0076847384,0.008501348,0.000041269748],"about_ca_topic_score_codex":0.0012047493,"about_ca_topic_score_gemma":0.0012272624,"teacher_disagreement_score":0.002253056,"about_ca_system_score_codex":0.0006863572,"about_ca_system_score_gemma":0.0005802147,"threshold_uncertainty_score":0.0075372458},"labels":[],"label_agreement":null},{"id":"W1992656560","doi":"10.1142/s0219265903000726","title":"MESSY BROADCASTING IN MULTIDIMENSIONAL DIRECTED TORI","year":2003,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Vertex (graph theory); Computer network; Set (abstract data type); Torus; Process (computing); Broadcast communication network; Atomic broadcast; State (computer science); Distributed computing; Theoretical computer science; Graph; Algorithm; Mathematics","score_opus":0.011940612037317232,"score_gpt":0.2341054699327961,"score_spread":0.22216485789547888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992656560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.319204,0.0026433864,0.64148813,0.0009828067,0.00016134251,0.00013576468,0.0003918891,0.0010752153,0.033917423],"genre_scores_gemma":[0.9641258,0.0009448874,0.028484862,0.0001069781,0.000057433583,0.00012914081,0.00016669022,0.000083235296,0.0059008677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994081,0.00015778307,0.000029952002,0.00010685435,0.00014668911,0.00015067284],"domain_scores_gemma":[0.9959926,0.0022294996,0.0006841143,0.0005377759,0.00033483582,0.00022125208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074690784,0.00044075647,0.00066754443,0.0010052612,0.0012236347,0.0013622345,0.0009549364,0.00079902535,0.0031359878],"category_scores_gemma":[0.0067506405,0.00044590092,0.00036734118,0.001039984,0.0014830931,0.0024281566,0.0013471151,0.0011443774,0.00044381118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026597196,0.000025302428,0.0010019658,0.00026747092,0.00004714443,0.0003731621,0.00096425804,0.32044,0.0053607738,0.6468096,0.004448147,0.019996211],"study_design_scores_gemma":[0.000034667577,0.00007339735,0.0004802802,0.00002846322,0.000025803649,0.00026796325,0.00044357107,0.6298231,0.0026011476,0.35949847,0.0066756667,0.00004742877],"about_ca_topic_score_codex":0.0032383478,"about_ca_topic_score_gemma":0.0030808232,"teacher_disagreement_score":0.0032383478,"about_ca_system_score_codex":0.0018991078,"about_ca_system_score_gemma":0.00042476636,"threshold_uncertainty_score":0.013779044},"labels":[],"label_agreement":null},{"id":"W1993010118","doi":"10.1145/1921168.1921187","title":"LEGUP","year":2010,"lang":"en","type":"article","venue":"Proceedings of the 6th International Conference","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"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 Waterloo","funders":"","keywords":"Clos network; Computer science; Network topology; Bandwidth (computing); Data center; Distributed computing; Computer network; Interconnection; Homogeneous; Topology (electrical circuits); Server; Engineering","score_opus":0.01749963676402912,"score_gpt":0.23981269002735722,"score_spread":0.2223130532633281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993010118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022659965,0.0015768844,0.48957458,0.0013944651,0.0012358489,0.0007469122,0.0051786634,0.08661956,0.39101318],"genre_scores_gemma":[0.23273723,0.001455075,0.44325116,0.0024168259,0.00033203402,0.0009391289,0.019406255,0.013016595,0.2864458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.00009030425,0.000025759204,0.00013877924,0.00017989744,0.00013481242],"domain_scores_gemma":[0.9992173,0.00014881817,0.00004554081,0.00026641088,0.00020725811,0.00011469351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055068906,0.001106721,0.0005244526,0.0010635504,0.0010431986,0.0019676192,0.0020635575,0.001292658,0.115095355],"category_scores_gemma":[0.0017469883,0.00051222544,0.00072268315,0.00081904227,0.0005268162,0.0023079386,0.002438436,0.001145594,0.0446523],"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.00084826845,0.00027916426,0.0017834873,0.00068700436,0.00006684969,0.00065016054,0.0002599339,0.016833665,0.016985275,0.071901865,0.26585868,0.62384564],"study_design_scores_gemma":[0.00011617042,0.0003134703,0.000748888,0.00012734563,0.000041680923,0.0009167735,0.0001175554,0.05251404,0.017030671,0.032215912,0.89579034,0.000067085886],"about_ca_topic_score_codex":0.0009594067,"about_ca_topic_score_gemma":0.0021263761,"teacher_disagreement_score":0.115095355,"about_ca_system_score_codex":0.0006607437,"about_ca_system_score_gemma":0.0009089503,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1993745690","doi":"10.1109/sbac-padw.2014.16","title":"Efficient Virtual Channel Organization and Congestion Avoidance in Multicore NoC Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Virtual channel; Router; Computer science; Network on a chip; Latency (audio); Embedded system; Flow control (data); Queue; Throughput; Queueing theory; Channel (broadcasting); Multi-core processor; Port (circuit theory); Logic synthesis; Computer network; Computer architecture; Logic gate; Parallel computing; Engineering; Operating system; Electronic engineering","score_opus":0.006819217082897281,"score_gpt":0.19006354504228332,"score_spread":0.18324432795938603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993745690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2944299,0.0020489206,0.6969636,0.00024802567,0.00010593687,0.00007646635,0.000057628633,0.001078496,0.004990966],"genre_scores_gemma":[0.9243056,0.00028826713,0.073576406,0.00005584808,0.000026263935,0.000044183555,0.00004793089,0.00003976025,0.0016157612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997464,0.00007545846,0.00001657201,0.000035885336,0.000071042195,0.00005466081],"domain_scores_gemma":[0.99970335,0.00009110894,0.000054881435,0.000054555658,0.000069621616,0.000026423138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037478097,0.00021170925,0.00020704794,0.00035946255,0.000379286,0.0005641365,0.0007347244,0.00019754538,0.0006959504],"category_scores_gemma":[0.00069544546,0.00018396376,0.00011733638,0.0003314451,0.00030295202,0.00075573823,0.00048073486,0.00021440556,0.000086738604],"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.00043447563,0.00019691765,0.0030389659,0.00035780325,0.00006854406,0.00025557075,0.00025702053,0.34978822,0.23563173,0.058411237,0.00355606,0.34800345],"study_design_scores_gemma":[0.000043545737,0.00023409635,0.00091163523,0.000017533515,0.000031474185,0.00013054411,0.000037726113,0.9378535,0.044178262,0.010322326,0.006212844,0.000026555637],"about_ca_topic_score_codex":0.00095171743,"about_ca_topic_score_gemma":0.0021385734,"teacher_disagreement_score":0.00095171743,"about_ca_system_score_codex":0.00049950933,"about_ca_system_score_gemma":0.0007935329,"threshold_uncertainty_score":0.0036242604},"labels":[],"label_agreement":null},{"id":"W1994343603","doi":"10.1145/1557626.1557667","title":"Broadcasting in necklace graphs","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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","funders":"","keywords":"Necklace; Computer science; Broadcasting (networking); Vertex (graph theory); Node (physics); Graph; Theoretical computer science; Computer network; Combinatorics; Mathematics","score_opus":0.01177286757328966,"score_gpt":0.2319740424257526,"score_spread":0.22020117485246293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994343603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14748827,0.0023279143,0.82103425,0.00084045634,0.00009848472,0.0003788672,0.0014208558,0.0012541933,0.025156653],"genre_scores_gemma":[0.65885013,0.004088083,0.30525014,0.0003391413,0.00011671465,0.0004119871,0.002626131,0.00022096689,0.028096637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00009214382,0.000035905123,0.00019160296,0.00012064556,0.00012392769],"domain_scores_gemma":[0.99869615,0.0006587372,0.00019520223,0.00017196285,0.00018868223,0.00008924906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037507244,0.00047297054,0.00064816163,0.0008434457,0.0010424852,0.0011912907,0.0010050337,0.0009364322,0.0046935226],"category_scores_gemma":[0.0030882733,0.00044759118,0.0004275534,0.00155423,0.00088389905,0.0030431051,0.0010017162,0.0010309819,0.001032686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006109784,0.0001760578,0.0015939792,0.0012699127,0.000072949544,0.00054580125,0.0013866585,0.24799637,0.029199129,0.5240532,0.020257672,0.17283727],"study_design_scores_gemma":[0.00013156653,0.00021893445,0.0007531351,0.000088826804,0.00007823203,0.0004434412,0.00045662202,0.40935737,0.015181013,0.5077279,0.06550185,0.00006106473],"about_ca_topic_score_codex":0.007521205,"about_ca_topic_score_gemma":0.0044845534,"teacher_disagreement_score":0.007521205,"about_ca_system_score_codex":0.0016229423,"about_ca_system_score_gemma":0.0008188093,"threshold_uncertainty_score":0.015701354},"labels":[],"label_agreement":null},{"id":"W1994547482","doi":"10.1016/j.ins.2013.10.031","title":"Reliability analysis and fault tolerance for hypercube multi-computer networks","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"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; Fault tolerance; Hypercube; Reliability (semiconductor); Reliability engineering; Parallel computing; Distributed computing; Engineering","score_opus":0.016345119319448754,"score_gpt":0.25063273087107957,"score_spread":0.2342876115516308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994547482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11241625,0.003027945,0.8765178,0.00081466854,0.00009022384,0.000034749708,0.00006497062,0.00017880548,0.0068546156],"genre_scores_gemma":[0.9695341,0.0014325222,0.02488971,0.000057511606,0.00011209772,0.000044626147,0.00007070899,0.00006494646,0.0037937723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.00013819824,0.000012518619,0.000037548212,0.00012431966,0.000049353603],"domain_scores_gemma":[0.9989452,0.0005942293,0.00012730797,0.00008562914,0.00022546506,0.000022263386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088779186,0.00036656385,0.0004136689,0.000993201,0.00038307332,0.0006450385,0.0006261273,0.00047118982,0.0013019547],"category_scores_gemma":[0.0037708373,0.0002431058,0.00043219107,0.0007394066,0.00076880486,0.0010196,0.00041534664,0.000592149,0.00015289745],"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.00008467732,0.000020367881,0.0009096025,0.00011763459,0.00003493376,0.000091108916,0.000083028826,0.89619553,0.004649478,0.07976482,0.0008020939,0.017246693],"study_design_scores_gemma":[0.0000024558408,0.000012460519,0.00026976588,0.000006254092,0.000007249438,0.000020273465,0.0000177622,0.9603695,0.0008367081,0.03815129,0.00030264078,0.0000036372558],"about_ca_topic_score_codex":0.002830452,"about_ca_topic_score_gemma":0.00168594,"teacher_disagreement_score":0.002830452,"about_ca_system_score_codex":0.00089434854,"about_ca_system_score_gemma":0.00059190096,"threshold_uncertainty_score":0.0064890385},"labels":[],"label_agreement":null},{"id":"W1994618033","doi":"10.1109/tc.2015.2425887","title":"A Deadlock-Free and Connectivity-Guaranteed Methodology for Achieving Fault-Tolerance in On-Chip Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Engineering; China Postdoctoral Science Foundation; University of British Columbia; National Natural Science Foundation of China","keywords":"Computer science; Router; Fault tolerance; Distributed computing; Robustness (evolution); Network on a chip; Deadlock; Parallel computing; Computer network","score_opus":0.07252094743277537,"score_gpt":0.29135962714120506,"score_spread":0.21883867970842968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994618033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018816927,0.00033247977,0.97880334,0.000078626086,0.000033512373,0.00005729129,0.000018997489,0.0009773467,0.00088152377],"genre_scores_gemma":[0.4018412,0.00040362598,0.59608245,0.00012628971,0.00002924353,0.000159545,0.00009386128,0.000112238624,0.0011515825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00016450635,0.000039465034,0.00006841588,0.00022968402,0.00006687426],"domain_scores_gemma":[0.9993579,0.0002016799,0.000098733806,0.00018576399,0.00012470498,0.000031198404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089894,0.00054463645,0.00033804518,0.0009064024,0.0005640709,0.0005200491,0.0013675732,0.00046505342,0.000862558],"category_scores_gemma":[0.0013642476,0.00024652318,0.00047764325,0.00047832372,0.0006988239,0.00093675486,0.0006796871,0.00054573396,0.00012900379],"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.00011973945,0.00015274608,0.0016044861,0.00045099604,0.00011247611,0.00029118214,0.00021598463,0.5095989,0.12866783,0.06354599,0.002513888,0.29272568],"study_design_scores_gemma":[0.000050814746,0.00040363704,0.00060004106,0.000030855932,0.00006721487,0.000327688,0.00003740746,0.91697395,0.0505456,0.023355698,0.0075616334,0.000045444776],"about_ca_topic_score_codex":0.0015096097,"about_ca_topic_score_gemma":0.0019002091,"teacher_disagreement_score":0.0015096097,"about_ca_system_score_codex":0.00065322756,"about_ca_system_score_gemma":0.0009899404,"threshold_uncertainty_score":0.0047394633},"labels":[],"label_agreement":null},{"id":"W1994872708","doi":"10.1016/j.disc.2008.08.007","title":"Some topological properties of star graphs: The surface area and volume","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Graph; Star network; Discrete mathematics; Topological graph theory; A* search algorithm; Surface (topology); Topology (electrical circuits); Line graph; Voltage graph; Network topology; Computer science; Geometry; Mathematical analysis","score_opus":0.04434381256212042,"score_gpt":0.2259252630297574,"score_spread":0.181581450467637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994872708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6616796,0.008462307,0.26385772,0.0039028039,0.00036263527,0.00005588578,0.00080614793,0.00041055845,0.060462426],"genre_scores_gemma":[0.98119855,0.002877954,0.011043241,0.00011589757,0.000893045,0.000049635735,0.00027992448,0.00015509459,0.0033865778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00013743361,0.000028445078,0.00008690276,0.0001246704,0.000046197612],"domain_scores_gemma":[0.99445385,0.003460855,0.000830043,0.00033983323,0.00051076827,0.0004045839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043201,0.000721327,0.0008316114,0.0034056196,0.00067449413,0.0028417232,0.0009915725,0.0009617383,0.0035024881],"category_scores_gemma":[0.007048024,0.0004123716,0.0006486557,0.0029969693,0.0032936605,0.0067645623,0.0011521439,0.0014177887,0.0004324202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000675362,0.000025765661,0.0018496988,0.00014623729,0.000028881665,0.00010699081,0.00035097366,0.018487267,0.003131185,0.9495673,0.0018916058,0.024346525],"study_design_scores_gemma":[0.00001077442,0.000034935565,0.0010404183,0.000019605712,0.000020447776,0.00023251794,0.00016357107,0.04040247,0.0011986978,0.95396256,0.0028955766,0.000018386922],"about_ca_topic_score_codex":0.00040259078,"about_ca_topic_score_gemma":0.0003082102,"teacher_disagreement_score":0.0035024881,"about_ca_system_score_codex":0.0007423759,"about_ca_system_score_gemma":0.00030391043,"threshold_uncertainty_score":0.011716962},"labels":[],"label_agreement":null},{"id":"W1996087956","doi":"10.1007/s11390-006-1012-x","title":"Parallel Switch System with QoS Guarantee for Real-Time Traffic","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sierra Wireless (Canada)","funders":"","keywords":"Computer science; Quality of service; Computer network; Multicast; Network packet; Unicast; Scalability; Bandwidth (computing); Distributed computing; Differentiated services; Load balancing (electrical power)","score_opus":0.005619743502437127,"score_gpt":0.2053705500553666,"score_spread":0.19975080655292948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996087956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5948768,0.0007511274,0.38577235,0.00079792214,0.00069550617,0.00022760067,0.0004280754,0.0077662137,0.008684394],"genre_scores_gemma":[0.97958434,0.00011572831,0.01682181,0.000107127584,0.00017196893,0.000057418754,0.00016061218,0.00005914506,0.0029217019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995721,0.000073039635,0.0000284841,0.00012694267,0.00009197701,0.00010741261],"domain_scores_gemma":[0.999047,0.00025933995,0.000089717585,0.0002033586,0.00028471378,0.00011582726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076854223,0.00078950287,0.0013866052,0.0006538031,0.0012296359,0.0013167359,0.0017456756,0.00064001925,0.00529054],"category_scores_gemma":[0.00103713,0.00030140096,0.00036119728,0.0006639583,0.00046627678,0.0010037462,0.0007779781,0.00084751006,0.0006053939],"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.011216608,0.0023341086,0.0076142224,0.0008018217,0.00074573566,0.002564847,0.0005704407,0.3998801,0.18199982,0.041205015,0.035567276,0.31550008],"study_design_scores_gemma":[0.000516028,0.0007204318,0.0010645068,0.0000079409765,0.00022342062,0.00041917825,0.000042166026,0.97161984,0.013573554,0.009277576,0.0024996535,0.000035684967],"about_ca_topic_score_codex":0.0021722058,"about_ca_topic_score_gemma":0.0028100368,"teacher_disagreement_score":0.00529054,"about_ca_system_score_codex":0.000829864,"about_ca_system_score_gemma":0.0012314104,"threshold_uncertainty_score":0.017698586},"labels":[],"label_agreement":null},{"id":"W1996326919","doi":"10.1109/mascot.2009.5366697","title":"Simulation environment for design and verification of Network-on-Chip and multi-core systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SystemC; Computer science; Network on a chip; Interconnection; Transaction-level modeling; Computer architecture; Embedded system; Chip; Network topology; System on a chip; Power network design; Computer network","score_opus":0.0655766725956829,"score_gpt":0.2665436462438014,"score_spread":0.2009669736481185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996326919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008554465,0.0005608448,0.96276754,0.00020306448,0.00020622431,0.00056639395,0.0018554173,0.015491891,0.009794164],"genre_scores_gemma":[0.1432774,0.0014148357,0.8346294,0.00020828542,0.000076061944,0.0037360855,0.0061791083,0.0032257156,0.0072532007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969674,0.0015251808,0.00028352675,0.0001491945,0.00088914915,0.00018558951],"domain_scores_gemma":[0.9962682,0.002367591,0.0001736674,0.00042798455,0.0006342199,0.00012839891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039138086,0.0016062602,0.0016604268,0.0011984897,0.0007031826,0.0013158452,0.0030350317,0.001213099,0.011073632],"category_scores_gemma":[0.007246747,0.0009781679,0.0014251148,0.0011969312,0.00070857524,0.001280354,0.0013786631,0.002207691,0.0021784056],"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.00031142606,0.00016095533,0.0010916446,0.0006840989,0.00018376643,0.00029741772,0.0001948639,0.8810622,0.007188911,0.058012646,0.012844189,0.037967823],"study_design_scores_gemma":[0.00017104264,0.00006222845,0.00015499392,0.00006901718,0.000027707507,0.00004397936,0.000015714259,0.96371114,0.0049533676,0.0048673875,0.025897555,0.000025917998],"about_ca_topic_score_codex":0.0056449883,"about_ca_topic_score_gemma":0.0041950187,"teacher_disagreement_score":0.011073632,"about_ca_system_score_codex":0.0010049351,"about_ca_system_score_gemma":0.0028851207,"threshold_uncertainty_score":0.037044942},"labels":[],"label_agreement":null},{"id":"W1996662615","doi":"10.1007/s11227-014-1130-0","title":"Some properties and algorithms for the hyper-torus network","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Research Foundation of Korea","keywords":"Torus; Hypercube; Computer science; Grid network; Algorithm; Broadcasting (networking); Hamiltonian path; Topology (electrical circuits); Parallel computing; Theoretical computer science; Graph; Mathematics; Combinatorics; Computer network; Grid","score_opus":0.04503358846702985,"score_gpt":0.23130041617350927,"score_spread":0.18626682770647943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996662615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503703,0.00082016893,0.89660263,0.0012645526,0.00014983637,0.00019053729,0.00056079624,0.0006588219,0.024715673],"genre_scores_gemma":[0.48590136,0.0019229662,0.48860198,0.00037816714,0.0003864468,0.00053696416,0.0016476096,0.0007633691,0.01986109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989072,0.00034409895,0.00009163401,0.0002152807,0.0003023872,0.00013937676],"domain_scores_gemma":[0.99333835,0.003875686,0.00070606935,0.0009926208,0.00079573184,0.00029149815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372818,0.0009388989,0.00096089195,0.0018894811,0.0016437608,0.0045956364,0.0028902544,0.0015014805,0.0075734016],"category_scores_gemma":[0.011259765,0.00080249715,0.0014044686,0.0032712065,0.0019833115,0.008729356,0.002172973,0.0023874217,0.0012326263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035024664,0.00013389645,0.0014823271,0.00033136437,0.00006133174,0.00021842837,0.00044455734,0.14251992,0.0039048716,0.7633224,0.009770697,0.07746001],"study_design_scores_gemma":[0.000051493706,0.00006087043,0.0002907822,0.000038598137,0.00003515664,0.00018769923,0.00012933362,0.45095792,0.0018267357,0.5418051,0.0045908764,0.000025411426],"about_ca_topic_score_codex":0.002297797,"about_ca_topic_score_gemma":0.0023163909,"teacher_disagreement_score":0.0075734016,"about_ca_system_score_codex":0.0025079108,"about_ca_system_score_gemma":0.001670429,"threshold_uncertainty_score":0.02533555},"labels":[],"label_agreement":null},{"id":"W1997141240","doi":"10.1109/dsd.2013.59","title":"Monitoring-Aware Virtual Platform Prototype of Heterogeneous NoC-Based Multicore SoCs","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India; Leukemia and Lymphoma Society of Canada","keywords":"Computer science; SystemC; Shared memory; Design space exploration; Multi-core processor; Embedded system; Memory bandwidth; Computer architecture; Parallel computing","score_opus":0.024629514779310194,"score_gpt":0.24087830631706672,"score_spread":0.21624879153775653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997141240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7581061,0.0001604191,0.22544175,0.00013873812,0.00010904562,0.00024654018,0.00025007752,0.0061863004,0.009360936],"genre_scores_gemma":[0.95734376,0.00003659149,0.04088655,0.000025020905,0.0000053207796,0.000095220086,0.00015704558,0.00013553844,0.0013148726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973553,0.00007316117,0.0000132927225,0.000043927088,0.00008333909,0.00005066088],"domain_scores_gemma":[0.9993223,0.00017027534,0.000073152485,0.00018246772,0.00016941912,0.000082484934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049753964,0.00050158025,0.00029988584,0.00034363466,0.0002646907,0.0004937673,0.0015790773,0.00035627556,0.002625341],"category_scores_gemma":[0.0009998527,0.00020642877,0.00029887658,0.00015544146,0.00040231124,0.00044948832,0.00056472555,0.00043836475,0.0002187266],"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.0010051952,0.00042859194,0.005821312,0.00033767804,0.00011478743,0.000896752,0.00041891224,0.7239015,0.19261098,0.012218161,0.0023616874,0.05988447],"study_design_scores_gemma":[0.00007694601,0.00061531743,0.0014247582,0.000014839364,0.000034203702,0.00010812018,0.000039099985,0.94054246,0.051830307,0.0010661497,0.0042274324,0.000020363092],"about_ca_topic_score_codex":0.0015100783,"about_ca_topic_score_gemma":0.0011919525,"teacher_disagreement_score":0.002625341,"about_ca_system_score_codex":0.000490822,"about_ca_system_score_gemma":0.00073061336,"threshold_uncertainty_score":0.008782685},"labels":[],"label_agreement":null},{"id":"W1997700518","doi":"10.1109/tvlsi.2015.2397005","title":"Power Analysis of Embedded NoCs on FPGAs and Comparison With Custom Buses","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Interconnection; Embedded system; Router; Efficient energy use; System on a chip; Dynamic demand; Power (physics); Engineering; Computer network; Electrical engineering","score_opus":0.0223100359649992,"score_gpt":0.2610077314653569,"score_spread":0.2386976955003577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997700518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582764,0.0010366451,0.024334986,0.00011642867,0.000052432544,0.00004622172,0.000439772,0.00058941124,0.015107666],"genre_scores_gemma":[0.9917191,0.000314239,0.004328646,0.000025315869,0.000010322226,0.000025917083,0.00031137554,0.000060583843,0.0032045643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999785,0.000029808334,0.000013897399,0.000033984965,0.000080422506,0.000056876233],"domain_scores_gemma":[0.999408,0.00029355017,0.0000830291,0.00006957669,0.00012796269,0.000017898328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001758004,0.0004952389,0.00019024003,0.00072884245,0.00014116845,0.00033323586,0.00042816842,0.00014239342,0.0046017263],"category_scores_gemma":[0.00086189056,0.00013596605,0.00022158682,0.00081293687,0.00017167711,0.0004901056,0.00014678232,0.00016687175,0.00039761147],"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.0012152531,0.00029579413,0.021904785,0.0008151299,0.00018102728,0.00082956726,0.00014102776,0.6926788,0.094484836,0.0051972186,0.0032919701,0.17896453],"study_design_scores_gemma":[0.00006682541,0.0016339329,0.032943066,0.000060706752,0.00012922582,0.00035450145,0.00015889561,0.8699824,0.08512651,0.0022189785,0.0072920807,0.000032799973],"about_ca_topic_score_codex":0.0018223415,"about_ca_topic_score_gemma":0.002856162,"teacher_disagreement_score":0.0046017263,"about_ca_system_score_codex":0.00042012642,"about_ca_system_score_gemma":0.00020753217,"threshold_uncertainty_score":0.01539427},"labels":[],"label_agreement":null},{"id":"W1998169461","doi":"10.1007/s10878-008-9160-2","title":"On broadcasting in unicyclic graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Graph; Vertex (graph theory); Combinatorics; Time complexity; Broadcasting (networking); Connectivity; Theory of computation; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network","score_opus":0.015147910409883919,"score_gpt":0.22888807424789512,"score_spread":0.2137401638380112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998169461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4219412,0.017956115,0.35691229,0.014046254,0.0017501827,0.0002669661,0.0014430048,0.0007005624,0.18498343],"genre_scores_gemma":[0.8798357,0.019170646,0.034513988,0.0016632323,0.0024431578,0.00035129004,0.0011088088,0.00049898727,0.06041416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.00034719353,0.000030715786,0.00011232111,0.0001896009,0.00018001953],"domain_scores_gemma":[0.98174286,0.014631083,0.0011708931,0.0006536633,0.0010376313,0.0007638947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380984,0.0011776373,0.0020478931,0.003009289,0.0018610725,0.0025362654,0.0025503412,0.0018833086,0.011902342],"category_scores_gemma":[0.01695005,0.00095370616,0.0008169338,0.0052676564,0.0029106599,0.0046729697,0.0024683,0.002217126,0.00090833864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004995351,0.00014657131,0.0015325464,0.0007242409,0.00008852935,0.00029129736,0.00081946485,0.12775227,0.0028001852,0.77981514,0.033595,0.051935166],"study_design_scores_gemma":[0.00010813012,0.0000768757,0.00070260395,0.00014438656,0.00008588103,0.0001873908,0.000267571,0.1854379,0.0006417789,0.80482507,0.0074839895,0.00003843611],"about_ca_topic_score_codex":0.006908836,"about_ca_topic_score_gemma":0.0067239953,"teacher_disagreement_score":0.011902342,"about_ca_system_score_codex":0.002905407,"about_ca_system_score_gemma":0.0013219306,"threshold_uncertainty_score":0.039817274},"labels":[],"label_agreement":null},{"id":"W1998852263","doi":"10.1109/infcom.2010.5462251","title":"Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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 Waterloo","funders":"","keywords":"Network topology; Scalability; Computer science; Logarithm; Lattice (music); Distributed computing; Topology (electrical circuits); Mesh networking; Tree (set theory); Tree network; Theoretical computer science; Algorithm; Time complexity; Mathematics; Computer network; Physics; Combinatorics","score_opus":0.023470531496352358,"score_gpt":0.2675202831977824,"score_spread":0.24404975170143006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998852263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11307764,0.0010046806,0.87003744,0.0013897516,0.000107084714,0.000105328436,0.00020972289,0.00033448898,0.013733882],"genre_scores_gemma":[0.78369635,0.0010290117,0.20749782,0.00022639532,0.000078414996,0.00035022481,0.00027146356,0.00017305653,0.0066772997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994585,0.00021578048,0.000023220278,0.00008167889,0.00009838318,0.00012234786],"domain_scores_gemma":[0.99556434,0.003495004,0.00033792784,0.00015286828,0.0002179287,0.00023198852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017638097,0.0010353841,0.001048636,0.0010796008,0.0006371202,0.00170164,0.0013275096,0.0015485274,0.0036326319],"category_scores_gemma":[0.008650939,0.0005680115,0.00047498645,0.0009837126,0.001867453,0.0023485045,0.0020011598,0.0016808602,0.00042414325],"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.00012520306,0.00006652364,0.00033670268,0.00012774018,0.000019632793,0.000046029243,0.00010164104,0.89099675,0.0009606836,0.08990036,0.0017868432,0.015531864],"study_design_scores_gemma":[0.000024009109,0.000027832335,0.000047856814,0.00000978958,0.0000036198414,0.000012511729,0.00004176065,0.9393962,0.00022134488,0.05981133,0.00039635252,0.0000073363094],"about_ca_topic_score_codex":0.0018411198,"about_ca_topic_score_gemma":0.0020388695,"teacher_disagreement_score":0.0036326319,"about_ca_system_score_codex":0.0021344717,"about_ca_system_score_gemma":0.0012756317,"threshold_uncertainty_score":0.015486777},"labels":[],"label_agreement":null},{"id":"W1999402023","doi":"10.1007/s10836-007-5035-1","title":"Design of Low Power &amp; Reliable Networks on Chip Through Joint Crosstalk Avoidance and Multiple Error Correction Coding","year":2008,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Retransmission; Dependability; Computer science; Error detection and correction; Network on a chip; Crosstalk; Dissipation; Interconnection; Embedded system; System on a chip; Chip; Energy consumption; Electronic engineering; Coding (social sciences); Engineering; Algorithm; Electrical engineering; Computer network; Telecommunications","score_opus":0.055383048353529286,"score_gpt":0.252881047933277,"score_spread":0.1974979995797477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999402023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10932081,0.00061466603,0.8788566,0.00046006686,0.00013055743,0.00016052958,0.00007733221,0.0007358203,0.009643623],"genre_scores_gemma":[0.79182607,0.00032789956,0.20296705,0.00018622441,0.000075357224,0.0001583716,0.000092781884,0.00007825381,0.0042881006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999498,0.00012692674,0.000019497598,0.00008162675,0.00018639879,0.000087492415],"domain_scores_gemma":[0.9990115,0.00028837798,0.00024036654,0.0000729391,0.00033905747,0.000047813835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126028,0.0006953968,0.00049080426,0.00047785818,0.0005859458,0.0010430098,0.001679076,0.00056250347,0.0015795376],"category_scores_gemma":[0.0011211107,0.00042797544,0.00032235877,0.0003140632,0.00048298418,0.000613205,0.000545592,0.00052424043,0.0002943526],"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.00025481527,0.00022205553,0.0014710051,0.00027552206,0.00017961625,0.00038565195,0.0003600527,0.67985463,0.12535569,0.046568375,0.0040877997,0.14098482],"study_design_scores_gemma":[0.000048482372,0.00034553773,0.00032309486,0.000024074743,0.00007385442,0.00010966634,0.00003951766,0.96358246,0.02662255,0.004919273,0.0038862058,0.00002527997],"about_ca_topic_score_codex":0.002231991,"about_ca_topic_score_gemma":0.009633811,"teacher_disagreement_score":0.002231991,"about_ca_system_score_codex":0.0011966149,"about_ca_system_score_gemma":0.0012248154,"threshold_uncertainty_score":0.008682013},"labels":[],"label_agreement":null},{"id":"W1999537538","doi":"10.1504/ijhpcn.2006.013482","title":"Performance assessment of four cluster interconnects on identical hardware: hints for cluster builders","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Computer science; Gigabit Ethernet; Cluster (spacecraft); Popularity; Gigabit; Ethernet; Computer cluster; Computer architecture; Embedded system; Computer network; Distributed computing; Telecommunications; Message passing","score_opus":0.016719539479513337,"score_gpt":0.278292704617197,"score_spread":0.2615731651376837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999537538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849672,0.00021575295,0.0122809,0.00007559505,0.000014437781,0.000026564769,0.000055347096,0.00046492458,0.0018993912],"genre_scores_gemma":[0.98935986,0.00009147604,0.009643522,0.000010642614,0.0000074499426,0.000014705433,0.00013388449,0.00011769302,0.0006208019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872714,0.0003698747,0.000065784574,0.00021166127,0.00043714343,0.00018829996],"domain_scores_gemma":[0.9924412,0.0033781307,0.0009211731,0.0012604845,0.0016512746,0.00034787905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019317119,0.0007548663,0.00053664023,0.0018511482,0.0006601215,0.000982291,0.0011857897,0.0005163591,0.0017796399],"category_scores_gemma":[0.011385177,0.00039000553,0.00036750216,0.0015007943,0.0005176471,0.0019808204,0.0008307224,0.00053973653,0.00030475418],"study_design_candidate":"bench_or_experimental","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.0045336173,0.00078776485,0.11004599,0.0005691096,0.00020226843,0.001384057,0.0008599733,0.49636662,0.22337198,0.007041113,0.0024200988,0.15241744],"study_design_scores_gemma":[0.000088147375,0.004036426,0.03845793,0.000044713368,0.00024174192,0.00057287066,0.0007006615,0.78113186,0.16914105,0.0029757207,0.0024982928,0.00011063309],"about_ca_topic_score_codex":0.0016132486,"about_ca_topic_score_gemma":0.0013474065,"teacher_disagreement_score":0.0019317119,"about_ca_system_score_codex":0.0010493802,"about_ca_system_score_gemma":0.00059079065,"threshold_uncertainty_score":0.010215998},"labels":[],"label_agreement":null},{"id":"W1999567003","doi":"10.1142/s0129054103001790","title":"Interconnection Networks and Their Eigenvalues","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","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":"Acadia University","funders":"","keywords":"Interconnection; Hypercube; Eigenvalues and eigenvectors; Computer science; Graph; Line graph; Graph theory; Spectral graph theory; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics; Voltage graph; Physics; Computer network","score_opus":0.015123795068053699,"score_gpt":0.26573969360016186,"score_spread":0.25061589853210814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999567003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2932543,0.012168819,0.5330763,0.0034182386,0.0006760887,0.000099682584,0.00058727333,0.00075988745,0.15595943],"genre_scores_gemma":[0.9370481,0.0043710466,0.046617072,0.00025654686,0.00047956358,0.00015805877,0.00018216931,0.00013063516,0.010756939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996517,0.00006536347,0.000016361608,0.000080099504,0.00013748997,0.000049006077],"domain_scores_gemma":[0.99905246,0.00046609915,0.0001711551,0.0000739936,0.0001681433,0.00006807534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034930086,0.00050096196,0.00031097495,0.0018683838,0.0008014075,0.0015680328,0.00038490235,0.00082006765,0.005781466],"category_scores_gemma":[0.0029736639,0.0003044693,0.00025556915,0.0009974355,0.001448163,0.0026412057,0.00083333673,0.0008652775,0.0007270859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002017983,0.000016282327,0.00041105482,0.00007441654,0.000010033307,0.00007918005,0.0001941702,0.0118234465,0.0033776576,0.96304387,0.0017986011,0.01915101],"study_design_scores_gemma":[0.000005753312,0.000015855227,0.0006121275,0.000027406975,0.0000038446715,0.00014918909,0.00010693723,0.029726518,0.00067757105,0.96176594,0.006894938,0.000013977797],"about_ca_topic_score_codex":0.00037805142,"about_ca_topic_score_gemma":0.00020374493,"teacher_disagreement_score":0.005781466,"about_ca_system_score_codex":0.00049896515,"about_ca_system_score_gemma":0.00022056661,"threshold_uncertainty_score":0.019340932},"labels":[],"label_agreement":null},{"id":"W1999690811","doi":"10.1145/1723112.1723188","title":"Design and evaluation of a parameterizable NoC router for FPGAs (abstract only)","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Windsor","funders":"","keywords":"Router; Scalability; Computer science; Network on a chip; Embedded system; Computer architecture; Routing (electronic design automation); Field-programmable gate array; One-armed router; Computer network; Core router; Interconnection; Overhead (engineering); Operating system","score_opus":0.06061988649752157,"score_gpt":0.30110518776524614,"score_spread":0.24048530126772458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999690811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6789371,0.0014459041,0.29310057,0.00026997193,0.00021115258,0.0015091466,0.00083641347,0.0080729015,0.015616778],"genre_scores_gemma":[0.85207605,0.0002170124,0.14343229,0.00007263648,0.000013032359,0.00029696227,0.00048397708,0.00017325746,0.0032347846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996031,0.00012434328,0.000027615519,0.00007739669,0.00011978076,0.00004779855],"domain_scores_gemma":[0.9994388,0.00016046924,0.00008444167,0.00007647922,0.00020994563,0.000029841238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568084,0.00057415734,0.00030024373,0.00037985487,0.00019245729,0.00043357693,0.00092071574,0.00040030398,0.0030758786],"category_scores_gemma":[0.000958643,0.00018067115,0.00019231367,0.0002193289,0.00018760932,0.0002975712,0.00015333224,0.00018942621,0.0004039039],"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.0012031924,0.000397027,0.005716093,0.00109184,0.00017698748,0.000592794,0.00014245056,0.49934337,0.24585904,0.0025745523,0.0048973085,0.23800537],"study_design_scores_gemma":[0.0004905274,0.005595792,0.0076361615,0.00008676533,0.00021749074,0.00041035726,0.000079729,0.71659315,0.25206304,0.00043809027,0.016322777,0.00006602118],"about_ca_topic_score_codex":0.0016099295,"about_ca_topic_score_gemma":0.0012806497,"teacher_disagreement_score":0.0030758786,"about_ca_system_score_codex":0.0005956846,"about_ca_system_score_gemma":0.00051820616,"threshold_uncertainty_score":0.010289788},"labels":[],"label_agreement":null},{"id":"W1999881791","doi":"10.1016/j.dam.2009.11.003","title":"Parallel cleaning of a network with brushes","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bipartite graph; Mathematics; Process (computing); Combinatorics; Brush; Algorithm; Computer science; Graph; Materials science; Composite material","score_opus":0.011522141334401477,"score_gpt":0.21896920427227684,"score_spread":0.20744706293787538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999881791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17376067,0.0007799868,0.8040464,0.0005084252,0.0005385349,0.00011148097,0.00014124686,0.0018595619,0.018253636],"genre_scores_gemma":[0.7747161,0.000611989,0.1958412,0.00016784001,0.00010183506,0.00015207482,0.0002157535,0.00055109797,0.027642107],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995844,0.000045143126,0.000022008768,0.0001320734,0.0001448719,0.000071489674],"domain_scores_gemma":[0.99914,0.00016056359,0.00006224317,0.00040395817,0.00013606079,0.0000971426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040498114,0.00051172887,0.0014595885,0.00078906625,0.0016797506,0.0014131792,0.0011647396,0.0009724873,0.009882257],"category_scores_gemma":[0.001816434,0.00067659974,0.0008235811,0.0008112771,0.0008888973,0.0021279522,0.0025737542,0.0011935227,0.0014491051],"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.0012424041,0.00035945338,0.002632197,0.00048030913,0.00021559316,0.0009113484,0.00086507027,0.2852305,0.3102081,0.13443214,0.008836975,0.25458586],"study_design_scores_gemma":[0.000099439894,0.00031788374,0.0011669875,0.000048399677,0.00006358336,0.00036196123,0.00028568992,0.7986337,0.07418742,0.10073442,0.024038667,0.00006183084],"about_ca_topic_score_codex":0.0011806812,"about_ca_topic_score_gemma":0.0014877185,"teacher_disagreement_score":0.009882257,"about_ca_system_score_codex":0.00064894755,"about_ca_system_score_gemma":0.0005076617,"threshold_uncertainty_score":0.033059478},"labels":[],"label_agreement":null},{"id":"W2000479655","doi":"10.1109/iscas.2012.6271851","title":"Two-level configuration for FPGA: A new design methodology based on a computing fabric","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Operand; Routing (electronic design automation); Architecture; Embedded system; Computer architecture; Reconfigurable computing; Software; Distributed computing; Computer hardware; Operating system","score_opus":0.28341080074523994,"score_gpt":0.3573938851560381,"score_spread":0.07398308441079815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000479655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010574737,0.00023391018,0.9790551,0.00010887121,0.00006327683,0.000097347336,0.000018225152,0.0009197181,0.008928797],"genre_scores_gemma":[0.21983409,0.0003282879,0.7716784,0.0001334852,0.00005575534,0.00022546141,0.000059452825,0.00023807157,0.0074469848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956423,0.00010786868,0.000031675852,0.00009312324,0.00014541864,0.000057725443],"domain_scores_gemma":[0.9997502,0.0000497088,0.000034911827,0.000105648935,0.000038496884,0.000021048314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003282092,0.0005081236,0.00029097142,0.0005723744,0.00040144753,0.0010619148,0.0010648145,0.000464391,0.0032415434],"category_scores_gemma":[0.00048976607,0.00036701615,0.00039998867,0.00037430093,0.00064153405,0.0010600908,0.0007421648,0.0007044174,0.0009834071],"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.00017802134,0.00011812015,0.0014450463,0.00055691786,0.00008375885,0.00084822875,0.00055016455,0.11597162,0.21041174,0.26286748,0.0045061014,0.4024628],"study_design_scores_gemma":[0.00014218694,0.0011728248,0.001668494,0.00020416122,0.00012314411,0.002840603,0.00017289644,0.5788611,0.1645307,0.09380662,0.1563138,0.00016347648],"about_ca_topic_score_codex":0.00034203625,"about_ca_topic_score_gemma":0.00054767577,"teacher_disagreement_score":0.0032415434,"about_ca_system_score_codex":0.0004997258,"about_ca_system_score_gemma":0.0005615764,"threshold_uncertainty_score":0.010844052},"labels":[],"label_agreement":null},{"id":"W2000525347","doi":"10.1016/j.disc.2006.07.013","title":"Research problems from the 5th Slovenian Conference (Bled, 2003)","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0639297673745002,"score_gpt":0.30603513295104606,"score_spread":0.24210536557654588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000525347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019764813,0.33943444,0.06691597,0.124244854,0.09485319,0.00014557413,0.0052324436,0.0010437513,0.34836486],"genre_scores_gemma":[0.20235376,0.13194145,0.060833726,0.0065470766,0.03080641,0.00035844668,0.011430211,0.0014269089,0.5543021],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843687,0.00038066934,0.0001136661,0.000436797,0.00042855905,0.00020340076],"domain_scores_gemma":[0.99862814,0.00043119607,0.000057683377,0.00019265254,0.00040001882,0.0002903036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019291228,0.0014716388,0.0017232226,0.0023084339,0.0016946807,0.005870921,0.001044183,0.0015610311,0.03645355],"category_scores_gemma":[0.0031203304,0.0006282865,0.001345043,0.0034251884,0.0016443189,0.0024423595,0.0022466541,0.0030227294,0.008225266],"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.00024841665,0.000085695734,0.00057658716,0.0007707882,0.00009721756,0.00013358558,0.00027400232,0.003867147,0.00062642345,0.11729015,0.66454375,0.21148631],"study_design_scores_gemma":[0.000058138085,0.000060880786,0.0020749008,0.000555859,0.00008854344,0.0002845112,0.00021201186,0.0051006787,0.0010004784,0.10578944,0.88473994,0.000034571585],"about_ca_topic_score_codex":0.0063202945,"about_ca_topic_score_gemma":0.009147511,"teacher_disagreement_score":0.03645355,"about_ca_system_score_codex":0.0067586373,"about_ca_system_score_gemma":0.0033347604,"threshold_uncertainty_score":0.121949255},"labels":[],"label_agreement":null},{"id":"W2001291849","doi":"10.1007/s11227-011-0641-1","title":"On the surface area of the augmented cubes","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Vertex (graph theory); Cube (algebra); Surface (topology); Function (biology); Telecommunications network; Topology (electrical circuits); Theoretical computer science; Algorithm; Distributed computing; Computer network; Graph; Mathematics; Geometry; Combinatorics","score_opus":0.04741821532123593,"score_gpt":0.2118977143211143,"score_spread":0.16447949899987835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001291849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5365594,0.0058728606,0.32479423,0.003932904,0.0009243673,0.00009307784,0.0009610263,0.0003509796,0.12651119],"genre_scores_gemma":[0.95501554,0.002557526,0.025790889,0.00031623847,0.00083128054,0.00006669263,0.0004175236,0.00024034602,0.01476403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00014219328,0.000013263512,0.00006567428,0.00009460298,0.00004852082],"domain_scores_gemma":[0.9980019,0.0011851686,0.00020741508,0.00011191798,0.00031632814,0.00017729751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069441966,0.00082898,0.0006838372,0.0021697897,0.000555477,0.001621979,0.0011151009,0.00081785134,0.0076573915],"category_scores_gemma":[0.0049788337,0.00035497095,0.00040293342,0.0012086389,0.0020232555,0.0027009784,0.0018167063,0.0015745568,0.0008185203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023254877,0.00004102835,0.0013801934,0.00015871943,0.000029128743,0.00013076239,0.00025223487,0.044870082,0.0042044395,0.90615886,0.005044091,0.03749788],"study_design_scores_gemma":[0.00002172938,0.000044475546,0.0013961999,0.000040242896,0.000015996164,0.00017560921,0.00014767061,0.21969815,0.0009617678,0.7708778,0.0065971883,0.000023247681],"about_ca_topic_score_codex":0.0014751512,"about_ca_topic_score_gemma":0.0008755127,"teacher_disagreement_score":0.0076573915,"about_ca_system_score_codex":0.0005509371,"about_ca_system_score_gemma":0.00025259316,"threshold_uncertainty_score":0.025616467},"labels":[],"label_agreement":null},{"id":"W2001500225","doi":"10.1016/s0960-8524(01)00143-2","title":"Chemi-refiner mechanical pulping of flax shives: refining energy and fiber properties","year":2002,"lang":"en","type":"article","venue":"Bioresource Technology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Refining (metallurgy); Pulp and paper industry; Waste management; Fiber; Engineering; Environmental science; Materials science; Composite material; Metallurgy","score_opus":0.022607334308965932,"score_gpt":0.19222963305717714,"score_spread":0.1696222987482112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001500225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9983524,0.0004032529,0.00037933057,0.00002024677,0.000002386088,0.000003766933,0.000068711146,0.000009102483,0.00076072634],"genre_scores_gemma":[0.99802375,0.00019265866,0.00023040108,0.000007783641,0.0000013770006,0.0000023195648,0.000093116374,0.0000074359978,0.0014410873],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99992025,0.000010888652,0.000003506374,0.00001553451,0.000022647006,0.000027179256],"domain_scores_gemma":[0.99984384,0.000059483842,0.000023122919,0.000011498228,0.000049462393,0.000012575981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002448159,0.00022932734,0.00019805593,0.00023075739,0.00036250163,0.00024327693,0.00016147866,0.00021755978,0.0028708472],"category_scores_gemma":[0.0003239923,0.00013844999,0.0001537775,0.00029805137,0.00018692848,0.00043110334,0.000119466466,0.00025407958,0.00029662348],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0004941023,0.000044322278,0.0019947402,0.000071484414,0.000010660156,0.000052544183,0.00007797348,0.000514206,0.99120027,0.000116498675,0.00008530902,0.00533779],"study_design_scores_gemma":[0.0000044963176,0.00019870163,0.01103275,0.0000035827945,0.000009431218,0.000027855678,0.000060391725,0.00064834283,0.987502,0.000027592789,0.00048100288,0.000003932829],"about_ca_topic_score_codex":0.006660765,"about_ca_topic_score_gemma":0.015881212,"teacher_disagreement_score":0.006660765,"about_ca_system_score_codex":0.00049120537,"about_ca_system_score_gemma":0.00026563244,"threshold_uncertainty_score":0.013243973},"labels":[],"label_agreement":null},{"id":"W2002857293","doi":"10.1109/tpds.2014.2360194","title":"An Analysis of Hypermesh NoCs in FPGAs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Computer science; Metric (unit); Set (abstract data type); Parallel computing; Field-programmable gate array; Algorithm; Computer hardware; Programming language","score_opus":0.012602488681938332,"score_gpt":0.23791153494039677,"score_spread":0.22530904625845843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002857293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4069444,0.0019003424,0.5593456,0.00032119144,0.00007144313,0.00006524442,0.00021608447,0.00067177904,0.030463848],"genre_scores_gemma":[0.95495486,0.00091043935,0.037354745,0.000044686894,0.00001670826,0.000059611655,0.00009922384,0.000052265652,0.0065074177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000035364574,0.0000065108115,0.000023168555,0.000095679236,0.00002628553],"domain_scores_gemma":[0.999699,0.00015672235,0.00003756558,0.00003092301,0.00006691656,0.000008852258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022377324,0.0003725084,0.00024302724,0.0005645168,0.0002437803,0.00062974927,0.00046274957,0.00032142614,0.0029972957],"category_scores_gemma":[0.001110214,0.00021441272,0.00026622342,0.00049225765,0.0003415639,0.00089432375,0.00022824472,0.0002403441,0.0002507611],"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.00002715386,0.0000063692287,0.0005058012,0.00003926909,0.000010282115,0.00009627136,0.000027498214,0.9693821,0.0034369114,0.016371503,0.00028858983,0.009808185],"study_design_scores_gemma":[0.0000014938448,0.000019078463,0.00020968536,0.0000053665985,0.000002647791,0.00003063343,0.000010890276,0.99565375,0.00083712244,0.002402565,0.00082432054,0.0000024279334],"about_ca_topic_score_codex":0.0031305696,"about_ca_topic_score_gemma":0.0026144027,"teacher_disagreement_score":0.0031305696,"about_ca_system_score_codex":0.0011462147,"about_ca_system_score_gemma":0.00049775455,"threshold_uncertainty_score":0.010026991},"labels":[],"label_agreement":null},{"id":"W2003856929","doi":"10.1145/1117278.1117290","title":"The routability of multiprocessor network topologies in FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":25,"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 Toronto","funders":"Consejo Nacional de Ciencia y Tecnología; CMC Microsystems","keywords":"Network topology; Field-programmable gate array; Computer science; Routing (electronic design automation); Hypercube; Process (computing); Embedded system; Interconnection; Topology (electrical circuits); Multiprocessing; Parallel computing; Computer network; Engineering","score_opus":0.006079957557155406,"score_gpt":0.21100580747706527,"score_spread":0.20492584991990986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003856929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8142981,0.0006314171,0.16758971,0.00019018518,0.000036823683,0.00006851703,0.00018132599,0.0004853803,0.01651859],"genre_scores_gemma":[0.9596339,0.00025359602,0.038510915,0.000019246525,0.000008923422,0.00005229154,0.00012459484,0.0000434295,0.0013531403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.00018464468,0.00003398677,0.000069494265,0.00013672629,0.000059349044],"domain_scores_gemma":[0.99801093,0.0011353401,0.00033862036,0.0003075547,0.00016982952,0.0000377761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004889486,0.00029066726,0.00025964298,0.00056195416,0.00032195332,0.0007943775,0.0003815866,0.00035652597,0.0017655191],"category_scores_gemma":[0.0036046458,0.00021797317,0.000207315,0.0005058952,0.0003315121,0.0012916323,0.00024996858,0.00026055606,0.00016031468],"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.00027793404,0.00005537036,0.0034778123,0.00018435447,0.000028512846,0.00051719864,0.00010137027,0.88260037,0.033909846,0.025680142,0.00048618484,0.052680887],"study_design_scores_gemma":[0.000047481913,0.00047574792,0.0053202407,0.000036388043,0.00003407239,0.0006983747,0.00015422892,0.94206727,0.028721822,0.018440418,0.0039832266,0.000020655583],"about_ca_topic_score_codex":0.0010450429,"about_ca_topic_score_gemma":0.0014734013,"teacher_disagreement_score":0.0017655191,"about_ca_system_score_codex":0.00064743124,"about_ca_system_score_gemma":0.00028882004,"threshold_uncertainty_score":0.0059062243},"labels":[],"label_agreement":null},{"id":"W2003963507","doi":"10.1109/nocs.2014.7008760","title":"Sampling-based approaches to accelerate network-on-chip simulation","year":2014,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Computer science; Network on a chip; Design space exploration; Sampling (signal processing); Speedup; Cache; Computer architecture; Limit (mathematics); Focus (optics); Architecture; Chip; Parallel computing; Embedded system; Distributed computing; Telecommunications","score_opus":0.17673054197724514,"score_gpt":0.2804366729567744,"score_spread":0.10370613097952924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003963507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010136064,0.00013361625,0.98785806,0.00005621992,0.000024218196,0.00004318645,0.000023484321,0.0008170739,0.00090816856],"genre_scores_gemma":[0.306747,0.00030070587,0.6909844,0.000093282666,0.0000397784,0.00028602194,0.00016298912,0.00023451235,0.0011513649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992267,0.00031671152,0.000036465528,0.00005590701,0.0003101329,0.000054111744],"domain_scores_gemma":[0.9965329,0.0021707404,0.00022777384,0.00042126735,0.0005376247,0.000109601875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017744926,0.0007535036,0.0005929792,0.0010316495,0.00049587566,0.00057053426,0.0014325053,0.00066658796,0.0020351568],"category_scores_gemma":[0.0068965415,0.0005371998,0.00057686516,0.0008869007,0.000619026,0.0009074153,0.0008772614,0.0011347331,0.00044253224],"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.00006447827,0.000055940676,0.001037419,0.00005760348,0.000038836468,0.00003755447,0.00005962833,0.94106394,0.0035688635,0.0150441965,0.0004981074,0.038473375],"study_design_scores_gemma":[0.000003723052,0.000006636621,0.000030231606,0.0000013788897,0.0000016908693,0.0000037423388,0.0000019889176,0.99806625,0.00043571868,0.0012516518,0.00019581553,0.0000012936446],"about_ca_topic_score_codex":0.0056040226,"about_ca_topic_score_gemma":0.0062736436,"teacher_disagreement_score":0.0056040226,"about_ca_system_score_codex":0.00102684,"about_ca_system_score_gemma":0.0011558055,"threshold_uncertainty_score":0.01114279},"labels":[],"label_agreement":null},{"id":"W2004845474","doi":"10.1016/s0166-218x(02)00237-8","title":"Physical network design to facilitate capacity reallocation","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Logical topology; Control reconfiguration; Network topology; Distributed computing; Heuristic; Asynchronous Transfer Mode; Flexibility (engineering); Topology (electrical circuits); Computer network; Engineering; Mathematics","score_opus":0.08591626587253681,"score_gpt":0.2392964225146704,"score_spread":0.15338015664213359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004845474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016413346,0.00022338268,0.9687081,0.00040791108,0.00024950528,0.00009232656,0.00006160478,0.0005984976,0.013245421],"genre_scores_gemma":[0.7969197,0.00031028336,0.1937077,0.00033627806,0.00011902126,0.0001868794,0.00008896437,0.000120993966,0.008210079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966335,0.00011233064,0.000018148394,0.00007646606,0.00009159543,0.000038118036],"domain_scores_gemma":[0.9989172,0.0003410705,0.00013500352,0.00022621409,0.00033336313,0.000047131573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066127756,0.00046816983,0.00032803247,0.00038827775,0.0004087499,0.0008995055,0.0010748903,0.0005001108,0.0068782736],"category_scores_gemma":[0.0030273844,0.0002654823,0.00022049449,0.00035299783,0.00039059494,0.0014081789,0.00060680055,0.00064704544,0.0006964951],"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.00033136184,0.0003532486,0.0008449799,0.00045896333,0.00008349026,0.00019793824,0.0001778135,0.5440505,0.07708063,0.17721711,0.011599382,0.18760462],"study_design_scores_gemma":[0.00008120158,0.0002176979,0.00031595663,0.000040721756,0.00007089934,0.00017967401,0.00004190228,0.91433686,0.022661155,0.042528618,0.019504901,0.000020419866],"about_ca_topic_score_codex":0.00050618534,"about_ca_topic_score_gemma":0.0017535014,"teacher_disagreement_score":0.0068782736,"about_ca_system_score_codex":0.00058380293,"about_ca_system_score_gemma":0.0006435561,"threshold_uncertainty_score":0.023010135},"labels":[],"label_agreement":null},{"id":"W2005088936","doi":"10.1007/s11265-013-0731-9","title":"Guest Editors’ Introduction to Special Issue on Advances in DSP System Design","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.011774306167421419,"score_gpt":0.23948897562418384,"score_spread":0.22771466945676241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005088936","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051674887,0.023206014,0.018316481,0.013253186,0.92988604,0.000038856608,0.00014108924,0.00038044102,0.014261147],"genre_scores_gemma":[0.007852481,0.026717804,0.009178822,0.007305094,0.83422834,0.000058036974,0.00027220443,0.0006779983,0.11370923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986405,0.00017678017,0.0001472415,0.00018796287,0.00072047615,0.00012704116],"domain_scores_gemma":[0.99496305,0.0009004184,0.00020950094,0.00023411405,0.0030887146,0.0006042359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020179255,0.0016869499,0.001249963,0.0020867654,0.000652997,0.002712816,0.0012009472,0.0017623563,0.04335415],"category_scores_gemma":[0.0067811077,0.00055616704,0.0008554641,0.00088334753,0.0005446899,0.0016997576,0.001114367,0.0044863014,0.019732738],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00009617326,0.000040055173,0.0001120622,0.0003881827,0.000028179538,0.000113592796,0.00001413706,0.00069099915,0.0011834805,0.0023407778,0.8868715,0.108120896],"study_design_scores_gemma":[0.000025141264,0.00012453113,0.00034191678,0.00013211188,0.00003580847,0.00033226798,0.00001352089,0.0020200254,0.0010028621,0.0022074615,0.993745,0.0000194639],"about_ca_topic_score_codex":0.0003383026,"about_ca_topic_score_gemma":0.0011364911,"teacher_disagreement_score":0.04335415,"about_ca_system_score_codex":0.0006822379,"about_ca_system_score_gemma":0.00096177304,"threshold_uncertainty_score":0.14503407},"labels":[],"label_agreement":null},{"id":"W2005748437","doi":"10.1109/wamca.2012.12","title":"A Novel Virtual Channel Implementation Technique for Multi-core On-chip Communication","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtual channel; Network on a chip; Computer network; Router; Network packet; Channel (broadcasting); Chip; Interconnection; Embedded system; Telecommunications","score_opus":0.11400835196736916,"score_gpt":0.3543027076431106,"score_spread":0.24029435567574145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005748437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020078158,0.0008896659,0.971626,0.000118229764,0.0002881815,0.00008301535,0.00003329488,0.0010868879,0.0057966467],"genre_scores_gemma":[0.5553443,0.0006183262,0.43769726,0.0002467902,0.00015057946,0.00023473738,0.00011979155,0.00012064972,0.0054675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.00008842758,0.0000238638,0.000058425376,0.00015008893,0.000069422094],"domain_scores_gemma":[0.99961424,0.00010259047,0.0000359112,0.00011309075,0.00010435521,0.000029846247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002908164,0.00034252342,0.00029680083,0.00048115366,0.00046800319,0.0005880584,0.0012062219,0.0004891122,0.0026796958],"category_scores_gemma":[0.00058923464,0.00017106808,0.00026748562,0.000431925,0.0004196717,0.0010698508,0.0005893298,0.00065238733,0.00038003232],"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.00047200496,0.00023949619,0.0011660029,0.0006674991,0.00014422162,0.0005728099,0.00033618952,0.04913524,0.27075186,0.11461444,0.008720683,0.5531795],"study_design_scores_gemma":[0.00013750627,0.0010158274,0.00092957093,0.000098873774,0.00013896881,0.0015217212,0.000106629246,0.63493705,0.24292697,0.025456423,0.092606045,0.00012446419],"about_ca_topic_score_codex":0.00045788585,"about_ca_topic_score_gemma":0.0008667161,"teacher_disagreement_score":0.0026796958,"about_ca_system_score_codex":0.00039386944,"about_ca_system_score_gemma":0.0005550097,"threshold_uncertainty_score":0.008964479},"labels":[],"label_agreement":null},{"id":"W2007102977","doi":"10.1049/iet-cdt.2013.0016","title":"Temperature control in three‐network on chips using task migration","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Scalability; Overhead (engineering); Network on a chip; Multiprocessing; Computer science; Chip; Interconnection; Reliability (semiconductor); Dissipation; Three-dimensional integrated circuit; System on a chip; Thermal management of electronic devices and systems; Integrated circuit; Embedded system; Power (physics); Parallel computing; Engineering; Computer network; Telecommunications","score_opus":0.00968258682185651,"score_gpt":0.21422684694753008,"score_spread":0.20454426012567356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007102977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40401086,0.0004664899,0.58786726,0.00022396952,0.00014661226,0.000086873915,0.000031718013,0.0010646041,0.0061015496],"genre_scores_gemma":[0.9689174,0.00007103435,0.02956369,0.000059031918,0.000008474899,0.000042641568,0.000015489033,0.00003180302,0.0012903598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998404,0.000044397693,0.0000073186816,0.00003935173,0.000031098418,0.00003745623],"domain_scores_gemma":[0.99978906,0.0000682256,0.00004114748,0.000035757763,0.000041121504,0.000024793779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029563083,0.00041903148,0.0003103941,0.00021190233,0.00037524517,0.0005349197,0.000628482,0.000360703,0.0007154036],"category_scores_gemma":[0.00047494212,0.00018045455,0.00031108852,0.00019856513,0.00034352246,0.00041861148,0.0005602094,0.00030637888,0.0001275649],"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.00024615857,0.00016473889,0.0011867105,0.0000586159,0.00004945693,0.00014130252,0.0001398917,0.8612925,0.06420513,0.0050291973,0.0009854591,0.06650087],"study_design_scores_gemma":[0.000015905638,0.00008199637,0.00038549508,0.0000025846803,0.000008272183,0.000021299691,0.0000145940385,0.99080515,0.0062257596,0.0015832429,0.0008475471,0.000008120699],"about_ca_topic_score_codex":0.002569301,"about_ca_topic_score_gemma":0.0026342773,"teacher_disagreement_score":0.002569301,"about_ca_system_score_codex":0.0005088261,"about_ca_system_score_gemma":0.00044832713,"threshold_uncertainty_score":0.005108714},"labels":[],"label_agreement":null},{"id":"W2007363986","doi":"10.1142/s0129626407003137","title":"ON A UNIFIED NEIGHBOURHOOD BROADCASTING SCHEME FOR INTERCONNECTION NETWORKS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Interconnection; Hypercube; Computer science; Broadcasting (networking); Star (game theory); Computer network; Algorithm; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics","score_opus":0.019930868390234693,"score_gpt":0.2607221117937441,"score_spread":0.2407912434035094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007363986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016898833,0.0003941176,0.97270334,0.000212356,0.000057493842,0.000076150405,0.00006180991,0.00034599664,0.00924992],"genre_scores_gemma":[0.3416731,0.0010528493,0.64462626,0.00018741997,0.00014905886,0.0003965025,0.00029540915,0.00029101653,0.011328311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.0002448821,0.00004316378,0.0001295223,0.0002946993,0.00009064414],"domain_scores_gemma":[0.99868494,0.00057360966,0.00008364983,0.00037305403,0.00021907553,0.00006568123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011201015,0.00042595502,0.0008407977,0.00081088825,0.0010804428,0.0011003976,0.0016209146,0.0010855808,0.0034684734],"category_scores_gemma":[0.004703653,0.00034552653,0.0005697933,0.0014097033,0.001326949,0.0030665596,0.002121816,0.0013724746,0.0008997927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002110141,0.00005862182,0.00023781211,0.00016926942,0.000021042137,0.00007907152,0.0005201338,0.21314313,0.017003566,0.6497725,0.005234419,0.11354937],"study_design_scores_gemma":[0.00008404221,0.00014075373,0.0001380396,0.000035386343,0.000023363908,0.00012295612,0.00006232556,0.7653248,0.00515912,0.21301891,0.015853614,0.000036732512],"about_ca_topic_score_codex":0.002257467,"about_ca_topic_score_gemma":0.0026675,"teacher_disagreement_score":0.0034684734,"about_ca_system_score_codex":0.0014541695,"about_ca_system_score_gemma":0.00088558247,"threshold_uncertainty_score":0.011603236},"labels":[],"label_agreement":null},{"id":"W2007692703","doi":"10.1007/s11227-010-0434-y","title":"A note on the alternating group network","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Interconnection; Group (periodic table); Class (philosophy); Alternating group; Network topology; Star (game theory); Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Mathematics; Physics; Astrophysics; Artificial intelligence; Symmetric group","score_opus":0.015074374550928884,"score_gpt":0.23891198934996868,"score_spread":0.2238376147990398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007692703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040650547,0.022840148,0.45038992,0.035862643,0.027457286,0.00008375569,0.00040831897,0.00036066785,0.42194667],"genre_scores_gemma":[0.6136325,0.02910934,0.18627246,0.011560834,0.03175547,0.00031277793,0.0004916307,0.0006706024,0.12619442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.00021711383,0.000026288706,0.000110981455,0.00013667729,0.000042417767],"domain_scores_gemma":[0.9979809,0.0013873294,0.000084588224,0.00025669756,0.00017768073,0.00011279704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011192679,0.0005941194,0.00059966557,0.00096087734,0.0012716365,0.0016564502,0.0011729889,0.00164121,0.008845161],"category_scores_gemma":[0.00480299,0.00029766344,0.00069419766,0.0012660049,0.0024881966,0.0055823233,0.0017860202,0.0042203628,0.0015832961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029305415,0.0000072881294,0.000053033527,0.000046637782,0.00000600581,0.00005713374,0.000041599505,0.0013859443,0.00047657924,0.9789933,0.0069906656,0.011912545],"study_design_scores_gemma":[0.0000060629545,0.000012657679,0.000049225964,0.000013490332,0.0000042978727,0.000057268797,0.000010009153,0.003289679,0.00019578746,0.966691,0.029663045,0.0000074699756],"about_ca_topic_score_codex":0.00081372634,"about_ca_topic_score_gemma":0.0007804433,"teacher_disagreement_score":0.008845161,"about_ca_system_score_codex":0.00067452696,"about_ca_system_score_gemma":0.00041420714,"threshold_uncertainty_score":0.029589951},"labels":[],"label_agreement":null},{"id":"W2007760711","doi":"10.1016/j.tcs.2012.03.039","title":"Computing majority with triple queries","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Pure mathematics","score_opus":0.009783002692198995,"score_gpt":0.23614565000176804,"score_spread":0.22636264730956904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007760711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24587663,0.002909726,0.67672235,0.011834107,0.0015695574,0.00035233158,0.0024785136,0.010422415,0.047834344],"genre_scores_gemma":[0.8458516,0.0005546679,0.1300106,0.002057597,0.0010648282,0.00027272353,0.0016776065,0.0011565097,0.017353974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992653,0.0020724938,0.00053939165,0.0014765481,0.001980897,0.0012776357],"domain_scores_gemma":[0.981862,0.009477708,0.00058495166,0.005308123,0.0017870992,0.0009800717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047749733,0.0011073997,0.0027195455,0.0013141987,0.0025511526,0.0061673927,0.0025858115,0.0021499381,0.014491813],"category_scores_gemma":[0.024160886,0.0007432785,0.0014234573,0.0026884098,0.002530217,0.01377023,0.007448563,0.0036063434,0.004787552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006027947,0.0005278703,0.0044567925,0.0009028062,0.0003385633,0.0005772418,0.0010403154,0.049799602,0.01209111,0.5016593,0.08682543,0.33575308],"study_design_scores_gemma":[0.00020631251,0.00016132153,0.00018008718,0.000044137225,0.00010279922,0.00023421654,0.00025099193,0.13520774,0.0075402134,0.8469869,0.0090459185,0.000039257473],"about_ca_topic_score_codex":0.001210785,"about_ca_topic_score_gemma":0.002209262,"teacher_disagreement_score":0.014491813,"about_ca_system_score_codex":0.0016001969,"about_ca_system_score_gemma":0.0023261253,"threshold_uncertainty_score":0.048479974},"labels":[],"label_agreement":null},{"id":"W2008071991","doi":"10.1002/dac.829","title":"An analytical approach to the performance evaluation of the balanced gamma switch under multicast traffic","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Source-specific multicast; Unicast; Protocol Independent Multicast; Pragmatic General Multicast; Distributed computing; Traffic model","score_opus":0.048140879205084135,"score_gpt":0.3161792377733918,"score_spread":0.26803835856830766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008071991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41958627,0.0009784556,0.5580778,0.0002885064,0.000058152338,0.000082750346,0.00010496059,0.00065835466,0.020164685],"genre_scores_gemma":[0.9842876,0.00022505438,0.014583017,0.00002807424,0.000015219325,0.00002427747,0.00002934343,0.000022889502,0.0007844782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00013056558,0.000011267092,0.00004038054,0.00026131014,0.00009874263],"domain_scores_gemma":[0.9993513,0.00036872164,0.000068651774,0.00004308021,0.00014945089,0.00001890313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008364676,0.0006330729,0.0003184683,0.000663054,0.00027416906,0.00079299125,0.00057522074,0.0004834542,0.0011686538],"category_scores_gemma":[0.002667042,0.00018837147,0.00021279562,0.00046904557,0.0004713538,0.0006010489,0.00045394906,0.00034463694,0.00019093274],"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.000257523,0.0000836744,0.001814896,0.00007831622,0.00002772832,0.0001862878,0.00013900157,0.8766913,0.063095644,0.032762587,0.00069727434,0.024165818],"study_design_scores_gemma":[0.000004489454,0.000055495468,0.00014239571,0.0000042094553,0.0000046962828,0.000032129556,0.000012206419,0.9924039,0.005338693,0.0016801499,0.0003177782,0.0000036970544],"about_ca_topic_score_codex":0.0015477717,"about_ca_topic_score_gemma":0.0005167811,"teacher_disagreement_score":0.0015477717,"about_ca_system_score_codex":0.0013832742,"about_ca_system_score_gemma":0.00068930304,"threshold_uncertainty_score":0.010036409},"labels":[],"label_agreement":null},{"id":"W2008930333","doi":"10.1145/1854273.1854342","title":"Moths","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Bottleneck; Computer science; Thread (computing); Latency (audio); Network packet; Cache; Computer network; Chip; Network on a chip; Embedded system; Distributed computing; Parallel computing; Telecommunications; Operating system","score_opus":0.004671224086347822,"score_gpt":0.2045105857530547,"score_spread":0.19983936166670688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008930333","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03294423,0.003776752,0.27294132,0.0047605247,0.0046026674,0.0009983038,0.039874297,0.24514796,0.39495397],"genre_scores_gemma":[0.14861834,0.0033087544,0.265345,0.0038397908,0.00075684994,0.0014109302,0.089524746,0.030841857,0.4563537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991461,0.00009965917,0.000050332386,0.00019082996,0.00039950135,0.000113532704],"domain_scores_gemma":[0.9989911,0.00016341325,0.00006584816,0.00027455424,0.00032728608,0.00017783786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508557,0.0009638292,0.00060771493,0.0011774035,0.00076222885,0.0018987779,0.0022044783,0.0010953143,0.11037107],"category_scores_gemma":[0.0031914224,0.0005550835,0.0008666129,0.0008419742,0.0004186165,0.0017075717,0.0024218883,0.0012321221,0.07435006],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0009577758,0.0001786182,0.0024897817,0.00084457756,0.00008580351,0.0004330658,0.00024803315,0.0036290807,0.029374383,0.028359571,0.5570259,0.37637344],"study_design_scores_gemma":[0.000125528,0.00013840223,0.0015354797,0.0000857427,0.00003434485,0.00045595554,0.000065816115,0.011166512,0.01306909,0.00802318,0.9652493,0.000050653412],"about_ca_topic_score_codex":0.001650582,"about_ca_topic_score_gemma":0.0022696457,"teacher_disagreement_score":0.11037107,"about_ca_system_score_codex":0.0006372122,"about_ca_system_score_gemma":0.0010963546,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2009534449","doi":"10.1016/j.sysarc.2012.12.002","title":"NISHA: A fault-tolerant NoC router enabling deadlock-free Interconnection of Subnets in Hierarchical Architectures","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Virtual channel; Router; Network on a chip; Redundancy (engineering); Fault tolerance; Deadlock; Interconnection; Distributed computing; Latency (audio); Computer network; Network topology; Embedded system; Channel (broadcasting)","score_opus":0.00909105520208276,"score_gpt":0.2156633856955971,"score_spread":0.20657233049351434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009534449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3045943,0.004185147,0.6167606,0.0007221599,0.0010523044,0.0003908633,0.00078019936,0.040629815,0.030884542],"genre_scores_gemma":[0.70050853,0.0005748243,0.2750384,0.0003474798,0.00008796094,0.00020535238,0.0013203828,0.00069227465,0.02122483],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972886,0.00003688439,0.000022137969,0.000050827457,0.000098261335,0.00006309721],"domain_scores_gemma":[0.9995437,0.000072081326,0.000045809244,0.00011629615,0.00014386057,0.000078277946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001058,0.00061574264,0.00064711017,0.00063319877,0.00066181284,0.001013126,0.0022694676,0.00079094456,0.004884221],"category_scores_gemma":[0.00080905325,0.00046321936,0.00041788246,0.0002973146,0.0004236551,0.0012809095,0.000960611,0.0008132054,0.0016306349],"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.0026514682,0.00039896337,0.0029232258,0.0013248613,0.000341368,0.0010847659,0.0004052392,0.05511049,0.5592587,0.023916734,0.0388583,0.31372586],"study_design_scores_gemma":[0.00070037757,0.0026273741,0.0040732007,0.00013816291,0.00050684094,0.0014313725,0.00021880624,0.5660778,0.35601,0.009140655,0.058797147,0.000278176],"about_ca_topic_score_codex":0.0013712536,"about_ca_topic_score_gemma":0.003235316,"teacher_disagreement_score":0.004884221,"about_ca_system_score_codex":0.00045547128,"about_ca_system_score_gemma":0.00095553574,"threshold_uncertainty_score":0.016339302},"labels":[],"label_agreement":null},{"id":"W2010069829","doi":"10.1109/ahs.2014.6880157","title":"Decentralized run-time recovery mechanism for transient and permanent hardware faults for space-borne FPGA-based computing systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Control reconfiguration; Fault tolerance; Synchronization (alternating current); Transient (computer programming); System on a chip; Fault injection; Reliability (semiconductor); Distributed computing; Operating system; Software; Computer network","score_opus":0.013756461078156501,"score_gpt":0.2291325501297792,"score_spread":0.2153760890516227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010069829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22684264,0.00043036113,0.76542115,0.00016439591,0.00008884985,0.00012783353,0.00005351384,0.0039870357,0.0028842795],"genre_scores_gemma":[0.96698594,0.000044492346,0.03169348,0.00002488992,0.000017042548,0.000033789875,0.00003116401,0.000026063823,0.0011432222],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.00005926046,0.000025039437,0.00007954914,0.00012743197,0.00005579762],"domain_scores_gemma":[0.99914527,0.00012328643,0.0001779554,0.0003133259,0.00019037572,0.00004979408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243143,0.00026059855,0.00035101117,0.00039521954,0.0004453381,0.00045588156,0.00085795054,0.00037284574,0.0012112793],"category_scores_gemma":[0.0009966457,0.00010509552,0.00019662609,0.00017253272,0.00029522946,0.00047436796,0.00042772398,0.0003745545,0.00023900728],"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.0011609965,0.0002615463,0.0040925173,0.00029831007,0.00012291627,0.00094680674,0.0005824764,0.2579409,0.3800673,0.022600165,0.0051702205,0.32675585],"study_design_scores_gemma":[0.00013415619,0.0007769035,0.0036663935,0.000023412533,0.00007226935,0.00055585307,0.00010491739,0.8312443,0.1491924,0.0045048133,0.009664544,0.000060058926],"about_ca_topic_score_codex":0.0007269224,"about_ca_topic_score_gemma":0.0011342295,"teacher_disagreement_score":0.0012112793,"about_ca_system_score_codex":0.00039668125,"about_ca_system_score_gemma":0.00057555997,"threshold_uncertainty_score":0.004052162},"labels":[],"label_agreement":null},{"id":"W2010148338","doi":"10.1007/s11107-005-4529-y","title":"Span-Restorable Mesh Networks with Multiple Quality of Protection (QoP) Service Classes","year":2005,"lang":"en","type":"article","venue":"Photonic Network Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Span (engineering); Service (business); Quality (philosophy); Quality of service; Computer network; Computer security","score_opus":0.06025864275409781,"score_gpt":0.28996873541397733,"score_spread":0.22971009265987952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010148338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33105242,0.0006252466,0.65945786,0.00041779957,0.00014172647,0.00010922046,0.00020633571,0.0015844066,0.006404931],"genre_scores_gemma":[0.93062407,0.00024883536,0.065922566,0.00013805636,0.00009920962,0.00007674298,0.00017826779,0.000044927416,0.0026674115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997472,0.00006318381,0.000015560792,0.00005693302,0.00006005084,0.00005699495],"domain_scores_gemma":[0.9991134,0.00025977404,0.00017056458,0.00024483027,0.00014294176,0.00006849668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809717,0.00042842218,0.00041602112,0.00046475139,0.0006874478,0.00059804774,0.0012282049,0.00048677664,0.00212687],"category_scores_gemma":[0.0011547782,0.0002478302,0.0002729097,0.00046801168,0.0004517436,0.001418054,0.0008865779,0.00050221366,0.00034848746],"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.0029726746,0.000551429,0.0036890155,0.00051435805,0.00019258825,0.0008958629,0.0006438999,0.27803323,0.15580809,0.078957625,0.011116261,0.46662495],"study_design_scores_gemma":[0.00018335028,0.0009857864,0.0013947085,0.000039796014,0.0001059425,0.00052906683,0.00010664235,0.9172147,0.026331903,0.04530188,0.0077707916,0.00003541374],"about_ca_topic_score_codex":0.00053188344,"about_ca_topic_score_gemma":0.0012101036,"teacher_disagreement_score":0.00212687,"about_ca_system_score_codex":0.00044860117,"about_ca_system_score_gemma":0.0003012464,"threshold_uncertainty_score":0.0071151257},"labels":[],"label_agreement":null},{"id":"W2010742926","doi":"10.1109/ccece.2008.4564719","title":"Modeling and simulation of multicore multithreaded processor architectures in SystemC","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"SystemC; Computer science; Multi-core processor; Parallel computing; Multithreading; TRACE (psycholinguistics); Transaction-level modeling; Workload; Computer architecture; Instruction set; Microarchitecture; Embedded system; Operating system; Thread (computing)","score_opus":0.026174173370673296,"score_gpt":0.2126593437886416,"score_spread":0.1864851704179683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010742926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56628126,0.0005694892,0.4042154,0.000667663,0.00013180828,0.00055462593,0.0015168879,0.0029441048,0.023118678],"genre_scores_gemma":[0.90908855,0.00027533816,0.084368266,0.00011041053,0.000019758363,0.00061398034,0.00089394033,0.00023491615,0.004394916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994129,0.00017106441,0.000034977318,0.00008032896,0.00020570726,0.000094897216],"domain_scores_gemma":[0.99894446,0.00044806564,0.000077461606,0.00015244055,0.00031921858,0.00005840443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070552964,0.0005296344,0.000599517,0.00046498363,0.00059873244,0.0010079723,0.0014911764,0.0010848179,0.0020993394],"category_scores_gemma":[0.0021009531,0.00039017867,0.00056088186,0.00071094267,0.0005626222,0.00088546606,0.0005597179,0.0009954163,0.00031119533],"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.00002494266,0.00002504358,0.0006160259,0.000017332,0.0000091851025,0.000027273825,0.000026805135,0.9940246,0.0011572847,0.0026525813,0.00018309533,0.0012358528],"study_design_scores_gemma":[0.0000052302107,0.000008423059,0.0000885647,0.0000011972843,0.0000018549774,0.000004198394,0.0000034688273,0.9988558,0.00041602916,0.00032451036,0.0002887254,0.0000020594425],"about_ca_topic_score_codex":0.023917422,"about_ca_topic_score_gemma":0.010655798,"teacher_disagreement_score":0.023917422,"about_ca_system_score_codex":0.0015645123,"about_ca_system_score_gemma":0.0024541367,"threshold_uncertainty_score":0.04755646},"labels":[],"label_agreement":null},{"id":"W2012042319","doi":"10.1007/s00453-001-0109-4","title":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm; Binary logarithm; Parallel computing; Parallel algorithm; Theory of computation; Overhead (engineering); Spanning tree; Computation; Tree (set theory); Combinatorics; Mathematics","score_opus":0.0279442320030997,"score_gpt":0.2374121101943307,"score_spread":0.209467878191231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012042319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064417005,0.00084471505,0.9191627,0.0011700772,0.00016060931,0.00016614053,0.0002572788,0.0026909197,0.0111305835],"genre_scores_gemma":[0.340504,0.00058214803,0.64767504,0.00021627473,0.00009168343,0.00023006347,0.00064170815,0.00039018097,0.009668946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.00016422493,0.000026458369,0.00011024931,0.00015031832,0.000101666716],"domain_scores_gemma":[0.99865216,0.000635706,0.00010437117,0.00034315523,0.00017960742,0.00008491371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070647796,0.0008701195,0.0010392917,0.0010512077,0.0012626011,0.0014240416,0.0015778218,0.0010137255,0.0064699445],"category_scores_gemma":[0.0040133763,0.0005830022,0.0006170845,0.0020311668,0.0009878281,0.0025530874,0.0015380556,0.0014082406,0.0010234207],"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.00020491438,0.000114006034,0.00080882944,0.00020587949,0.00004839848,0.00007586534,0.00011926406,0.74534625,0.003649169,0.07354121,0.011273195,0.16461304],"study_design_scores_gemma":[0.00002969889,0.000017309783,0.00017217529,0.0000062022573,0.0000103050415,0.000017027322,0.000032534095,0.9178963,0.00084356725,0.07853391,0.0024350742,0.000005978582],"about_ca_topic_score_codex":0.014404842,"about_ca_topic_score_gemma":0.03113026,"teacher_disagreement_score":0.014404842,"about_ca_system_score_codex":0.0014939095,"about_ca_system_score_gemma":0.0023548263,"threshold_uncertainty_score":0.028641999},"labels":[],"label_agreement":null},{"id":"W2012642399","doi":"10.1109/tvlsi.2015.2405933","title":"Efficient Dynamic Virtual Channel Organization and Architecture for NoC Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Virtual channel; Computer science; Microarchitecture; Scalability; Latency (audio); Port (circuit theory); Network on a chip; Throughput; Embedded system; Flow control (data); Channel (broadcasting); Computer network; Operating system; Engineering; Wireless","score_opus":0.011880877671856397,"score_gpt":0.2244742166411257,"score_spread":0.21259333896926932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012642399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114559345,0.0029453263,0.86803406,0.0002934761,0.00015701313,0.00011746849,0.00014435886,0.0025318605,0.011217136],"genre_scores_gemma":[0.82883024,0.0007772005,0.16661471,0.000093584895,0.00004452739,0.000121955556,0.0002469606,0.0000840674,0.0031867926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997631,0.0000614304,0.000013656012,0.000031934782,0.000080966194,0.000048884103],"domain_scores_gemma":[0.99974173,0.00004948022,0.00003483384,0.00006152056,0.000092213966,0.000020165166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027949698,0.00025219994,0.00018047332,0.00046717416,0.00030342693,0.00048613144,0.0006813078,0.00022417963,0.0013513216],"category_scores_gemma":[0.00056202564,0.00014301405,0.00012099342,0.00041662928,0.00022986761,0.0006842271,0.00034239414,0.00024382123,0.00020779292],"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.00025822324,0.000102500104,0.0021259764,0.00029105134,0.000053885746,0.0001862684,0.0001081754,0.46952328,0.10706376,0.06263922,0.00815729,0.34949037],"study_design_scores_gemma":[0.00003094469,0.0001709705,0.00080518844,0.000025290257,0.00003118067,0.00016683375,0.000033647662,0.9401241,0.02855021,0.009723576,0.020310411,0.000027698195],"about_ca_topic_score_codex":0.001270257,"about_ca_topic_score_gemma":0.0025971963,"teacher_disagreement_score":0.0013513216,"about_ca_system_score_codex":0.00057599327,"about_ca_system_score_gemma":0.0009003914,"threshold_uncertainty_score":0.0045206547},"labels":[],"label_agreement":null},{"id":"W2012753472","doi":"10.1016/j.tcs.2014.09.008","title":"On the conditional diagnosability of matching composition networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Composition (language); Matching (statistics); Mathematics; Computer science; Arithmetic; Algorithm; Discrete mathematics; Theoretical computer science; Statistics; Linguistics; Philosophy","score_opus":0.00697799373161165,"score_gpt":0.2244925295369179,"score_spread":0.21751453580530625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2273521,0.00044919766,0.7529498,0.0017312211,0.00012457994,0.00010781607,0.00037238398,0.0008980017,0.01601495],"genre_scores_gemma":[0.9603324,0.00037650266,0.033885363,0.00028931096,0.0001628388,0.00011836341,0.00046119688,0.00014597528,0.004228135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997124,0.00086116913,0.00014472772,0.0006150995,0.00079992315,0.00045492177],"domain_scores_gemma":[0.9531989,0.038088348,0.002386515,0.002584036,0.0023307404,0.0014114442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037778586,0.0007928904,0.0009833926,0.0016129523,0.0010019075,0.0022379232,0.0022147927,0.001603551,0.006761282],"category_scores_gemma":[0.035219513,0.0006793905,0.0011790072,0.001226556,0.004366497,0.006759592,0.0030243923,0.0037981884,0.00033458756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005158624,0.000112891394,0.002153163,0.00020852966,0.00007005897,0.0002872101,0.00043065473,0.113015115,0.005165943,0.8526759,0.0013972223,0.023967303],"study_design_scores_gemma":[0.00004182618,0.000055875596,0.0004756705,0.00003107123,0.000034635792,0.000100097815,0.000055638327,0.27014458,0.0022528025,0.7261911,0.0005969136,0.000019883955],"about_ca_topic_score_codex":0.0022630696,"about_ca_topic_score_gemma":0.0017796304,"teacher_disagreement_score":0.006761282,"about_ca_system_score_codex":0.0022156802,"about_ca_system_score_gemma":0.0018801956,"threshold_uncertainty_score":0.02261877},"labels":[],"label_agreement":null},{"id":"W2013272814","doi":"10.1145/2658260.2658272","title":"Efficient and programmable ethernet switching with a NoC-enhanced FPGA","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Network switch; Embedded system; Ethernet; Network on a chip; Transceiver; Network packet; Bandwidth (computing); Computer architecture; Computer network; Wireless; Telecommunications","score_opus":0.006026772452686495,"score_gpt":0.19825227418172334,"score_spread":0.19222550172903685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013272814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6220186,0.0017231385,0.27645564,0.0005784567,0.00049041485,0.00020187772,0.00030384443,0.0046225768,0.093605466],"genre_scores_gemma":[0.92693985,0.00030093855,0.06489216,0.000079597485,0.0000321251,0.000037578684,0.0001601831,0.00004220172,0.007515311],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984765,0.00002475811,0.000009236338,0.000020362746,0.00005560098,0.000042470907],"domain_scores_gemma":[0.99989927,0.00001921812,0.0000110724395,0.000028334363,0.000028685834,0.000013401907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021934665,0.000221665,0.00015478875,0.00030905087,0.00018980064,0.00036262308,0.00045304358,0.0001393719,0.0028045226],"category_scores_gemma":[0.00025663743,0.00008787091,0.00010552915,0.00023377269,0.00013270971,0.0003559617,0.00025138637,0.00024088642,0.00029160987],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0010524066,0.00044424625,0.0041052615,0.0004541099,0.000081301034,0.00086881773,0.00013042531,0.10174619,0.41854626,0.044167034,0.012222791,0.41618118],"study_design_scores_gemma":[0.00017617729,0.0010307081,0.005068939,0.00008096226,0.00008588062,0.00085536885,0.00007854573,0.6721341,0.25647855,0.0061888094,0.057765435,0.000056517852],"about_ca_topic_score_codex":0.0006312642,"about_ca_topic_score_gemma":0.0013419752,"teacher_disagreement_score":0.0028045226,"about_ca_system_score_codex":0.00034451144,"about_ca_system_score_gemma":0.00023682146,"threshold_uncertainty_score":0.009382069},"labels":[],"label_agreement":null},{"id":"W2013795044","doi":"10.1145/2435227.2435252","title":"Moths","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bottleneck; Thread (computing); Latency (audio); Network packet; Cache; Computer network; Chip; Embedded system; Distributed computing; Operating system; Telecommunications","score_opus":0.0161443342360505,"score_gpt":0.23681141493736435,"score_spread":0.22066708070131386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013795044","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023843085,0.00396425,0.22072126,0.005018884,0.0051892516,0.0009294105,0.047476318,0.3443343,0.3485232],"genre_scores_gemma":[0.13007168,0.003986501,0.24229139,0.0051578726,0.0009993911,0.0015474547,0.12918669,0.059855822,0.4269033],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998882,0.00012734995,0.00006592516,0.0002490995,0.0005228174,0.0001527471],"domain_scores_gemma":[0.998776,0.00020372267,0.000075864904,0.00032693334,0.00040289492,0.00021453205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013108167,0.0011336139,0.0007487108,0.0012042411,0.0008584891,0.0022839124,0.0025147651,0.0012086469,0.12716259],"category_scores_gemma":[0.0039672717,0.000650531,0.0009868462,0.0008731326,0.0004874836,0.0021427087,0.0030598117,0.0015623121,0.10074216],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0008699543,0.00016069975,0.0023294785,0.00083323644,0.00008105127,0.00039854902,0.00024684824,0.002726382,0.019426772,0.021448696,0.68135744,0.2701209],"study_design_scores_gemma":[0.00012513802,0.00011649028,0.0014714962,0.00010840157,0.000032270167,0.00037631326,0.00006867796,0.008852227,0.00939476,0.0074353656,0.9719661,0.00005269058],"about_ca_topic_score_codex":0.0017796532,"about_ca_topic_score_gemma":0.002594575,"teacher_disagreement_score":0.12716259,"about_ca_system_score_codex":0.0006869484,"about_ca_system_score_gemma":0.0014163932,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2013962395","doi":"10.1145/2512470","title":"A constraint programming approach for integrated spatial and temporal scheduling for clustered architectures","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Parallel computing; Gang scheduling; Dynamic priority scheduling; Two-level scheduling; Compiler; Fair-share scheduling; Distributed computing; Schedule; Programming language; Mathematical optimization","score_opus":0.02470379012322059,"score_gpt":0.25886038508071835,"score_spread":0.23415659495749774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013962395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002710427,0.0001070843,0.9945478,0.00015155815,0.00001816674,0.00006618756,0.000072216106,0.00012991662,0.0021966354],"genre_scores_gemma":[0.057121925,0.00025088168,0.9400693,0.0001373658,0.000033634344,0.0003521286,0.00019843403,0.00011247249,0.0017238604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887794,0.0004148703,0.000045982983,0.0001554217,0.00040323165,0.000102598424],"domain_scores_gemma":[0.9979139,0.0014780539,0.00012807907,0.0001109681,0.0003035408,0.00006539312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017117334,0.0011679889,0.0006514545,0.0006715194,0.00071253633,0.0010534268,0.0016272003,0.0009190299,0.0032406268],"category_scores_gemma":[0.003995328,0.00079980155,0.0012208556,0.0018425506,0.00080746703,0.0010875101,0.00087757065,0.0021317117,0.00039816924],"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.000031141728,0.00005946828,0.0001952413,0.00008978243,0.000046084744,0.00007710356,0.000063302075,0.93340015,0.0016400086,0.03469188,0.0017978797,0.027907938],"study_design_scores_gemma":[0.000017297527,0.000026059943,0.000052110066,0.000010536512,0.000012070243,0.000019868665,0.000016297461,0.9870072,0.0006801187,0.00938069,0.0027703047,0.000007434006],"about_ca_topic_score_codex":0.013097694,"about_ca_topic_score_gemma":0.020466885,"teacher_disagreement_score":0.013097694,"about_ca_system_score_codex":0.0011963357,"about_ca_system_score_gemma":0.0028992007,"threshold_uncertainty_score":0.026042938},"labels":[],"label_agreement":null},{"id":"W2014624009","doi":"10.1007/s11265-013-0811-x","title":"Self-Adapting Resource Escalation for Resilient Signal Processing Architectures","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Control reconfiguration; Computer science; Latency (audio); Redundancy (engineering); Real-time computing; Encoder; Benchmark (surveying); Throughput; Embedded system; Distributed computing; Telecommunications","score_opus":0.015822678617420947,"score_gpt":0.24012969827369834,"score_spread":0.2243070196562774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014624009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34718826,0.0006677318,0.6366911,0.00077905477,0.00026985802,0.00012870172,0.000083342515,0.0025404482,0.011651576],"genre_scores_gemma":[0.97850966,0.000068231595,0.01941682,0.000084197105,0.000024815974,0.00002911559,0.000030405052,0.00003997614,0.0017967147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963844,0.00008043035,0.000024975445,0.00007393088,0.000075956705,0.000106243526],"domain_scores_gemma":[0.9990676,0.0002571369,0.000116199626,0.0002815384,0.00020393943,0.000073589305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005749086,0.0005372188,0.00045375762,0.0005114183,0.00069557934,0.00085667084,0.0012296706,0.00049362896,0.0030104234],"category_scores_gemma":[0.002392647,0.00022143434,0.00026049273,0.00035760674,0.00049399753,0.0011272405,0.0010816209,0.0008346344,0.00037663034],"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.00070575275,0.0003222416,0.0018387244,0.0001476267,0.00010723787,0.0004671737,0.00036572022,0.64643717,0.079368226,0.04955493,0.0061591053,0.21452604],"study_design_scores_gemma":[0.0000145928325,0.000092482056,0.00022378878,0.000006659851,0.000017544464,0.000078353965,0.000043976655,0.9809194,0.00596429,0.0116090905,0.001017701,0.0000121153635],"about_ca_topic_score_codex":0.00076984445,"about_ca_topic_score_gemma":0.0014482649,"teacher_disagreement_score":0.0030104234,"about_ca_system_score_codex":0.00050531735,"about_ca_system_score_gemma":0.0005135936,"threshold_uncertainty_score":0.01007086},"labels":[],"label_agreement":null},{"id":"W2015447234","doi":"10.1109/vlsit.2012.6242504","title":"Designing in scaled technologies: 32 nm and beyond","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Very-large-scale integration; Interconnection; Node (physics); Scaling; Computer science; Voltage; Electronic engineering; Integrated circuit design; Electrical engineering; Embedded system; Engineering; Telecommunications","score_opus":0.015794331755562906,"score_gpt":0.2289736788825344,"score_spread":0.21317934712697148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015447234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21054445,0.04948769,0.44089168,0.037091475,0.0030529492,0.0003524152,0.00026890356,0.0026978063,0.25561267],"genre_scores_gemma":[0.598243,0.023385108,0.3412917,0.00441177,0.00063280936,0.00032190664,0.00015380543,0.0005731893,0.030986704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950826,0.00013601374,0.000027295493,0.00006802883,0.0001896203,0.00007081114],"domain_scores_gemma":[0.99941266,0.00014048764,0.00005177225,0.00014391223,0.0001865429,0.000064506734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087014516,0.00047929725,0.0002670723,0.0002467993,0.00061010575,0.001318693,0.000537657,0.0009126502,0.004864762],"category_scores_gemma":[0.0017940276,0.00036620235,0.0002048576,0.00025632296,0.0008276748,0.0031021852,0.000752595,0.00095784455,0.0014371312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001875298,0.00011954739,0.0018688503,0.00089366373,0.00005089954,0.00089511333,0.0020001596,0.020881686,0.14149112,0.48600292,0.0372443,0.30836424],"study_design_scores_gemma":[0.000098153534,0.0004330824,0.0015221401,0.00048824982,0.00007266968,0.0007507574,0.0008451762,0.042883094,0.027610695,0.29126835,0.6339597,0.000067969064],"about_ca_topic_score_codex":0.0009958494,"about_ca_topic_score_gemma":0.0018648418,"teacher_disagreement_score":0.004864762,"about_ca_system_score_codex":0.00075650564,"about_ca_system_score_gemma":0.0009654629,"threshold_uncertainty_score":0.016274214},"labels":[],"label_agreement":null},{"id":"W2015684375","doi":"10.1109/dft.2013.6653621","title":"Reconfigurable distributed fault tolerant routing algorithm for on-chip networks","year":2013,"lang":"en","type":"article","venue":"","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":"University of Saskatchewan","funders":"","keywords":"Computer science; Static routing; Multipath routing; Distributed computing; Policy-based routing; Bottleneck; Link-state routing protocol; Routing table; Computer network; Network on a chip; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Dynamic Source Routing; Deadlock; Parallel computing; Embedded system; Routing protocol","score_opus":0.01699679361675176,"score_gpt":0.22936809880635017,"score_spread":0.2123713051895984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015684375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040772967,0.00032243592,0.95503104,0.00017243574,0.00006615867,0.000049495342,0.00004411322,0.0011188375,0.0024225514],"genre_scores_gemma":[0.49933943,0.0002740691,0.49562094,0.00011133424,0.000029682971,0.0001262002,0.00023981938,0.00011255758,0.004145832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998264,0.000040069037,0.0000100503,0.000046963807,0.00005225245,0.000024461193],"domain_scores_gemma":[0.99987423,0.00004136045,0.000021266711,0.000023273933,0.000030834068,0.000009012367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022626625,0.00041375466,0.00039328024,0.0005956809,0.00046157397,0.0005442667,0.0009486204,0.00055714464,0.0015964031],"category_scores_gemma":[0.00056904054,0.00015835406,0.00037257926,0.00038669197,0.00027529197,0.0005905894,0.000435913,0.0003810539,0.0002404587],"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.00024697898,0.00008417915,0.0008014943,0.00009191267,0.000059873317,0.0001277736,0.00010338968,0.61476594,0.023805294,0.018639136,0.0033660617,0.33790794],"study_design_scores_gemma":[0.000039488226,0.00009106381,0.00018826476,0.0000061459723,0.000015713309,0.00006512011,0.00001701842,0.9865645,0.0048127254,0.005697949,0.0024925955,0.0000094283405],"about_ca_topic_score_codex":0.002399245,"about_ca_topic_score_gemma":0.0026857594,"teacher_disagreement_score":0.002399245,"about_ca_system_score_codex":0.00075662317,"about_ca_system_score_gemma":0.00053700246,"threshold_uncertainty_score":0.005489707},"labels":[],"label_agreement":null},{"id":"W2016545789","doi":"10.1109/icassp.2014.6855234","title":"Cluster-based associative memories built from unreliable storage","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Computer science; Associative property; Content-addressable memory; Parallel computing; Implementation; Content-addressable storage; Theoretical computer science; Artificial neural network; Artificial intelligence; Programming language; Mathematics","score_opus":0.02022434441918968,"score_gpt":0.252992510535256,"score_spread":0.23276816611606632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016545789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79175013,0.00078108057,0.19922319,0.00024203277,0.00007786993,0.00006063088,0.00020893279,0.00046378997,0.0071923467],"genre_scores_gemma":[0.9825659,0.00031238323,0.015248232,0.000029372412,0.000017843511,0.000036386566,0.00005862212,0.000018347528,0.0017129118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991655,0.000015147241,0.000004117959,0.000013344162,0.000030267178,0.00002050362],"domain_scores_gemma":[0.9996743,0.00010901969,0.000060166494,0.000059317703,0.00007805997,0.000019082061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013074723,0.0002527136,0.00029046668,0.0003648188,0.00034353245,0.00038549522,0.0010075436,0.00037916203,0.0011886865],"category_scores_gemma":[0.00077648496,0.00015773378,0.00017913556,0.00076932745,0.0004575152,0.00077221356,0.00045981188,0.0002802655,0.00015532871],"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.00034068114,0.00007648271,0.0015302672,0.00022836505,0.00008261122,0.000590185,0.0001348476,0.8489062,0.029627176,0.094368115,0.0016700989,0.022444949],"study_design_scores_gemma":[0.000029019715,0.00011720615,0.00047857565,0.000011670973,0.00004802783,0.00013807809,0.000052431034,0.961991,0.012170554,0.02347038,0.0014768585,0.00001616571],"about_ca_topic_score_codex":0.0011699871,"about_ca_topic_score_gemma":0.0013642885,"teacher_disagreement_score":0.0011886865,"about_ca_system_score_codex":0.00034590947,"about_ca_system_score_gemma":0.00030125445,"threshold_uncertainty_score":0.0039765835},"labels":[],"label_agreement":null},{"id":"W2017025131","doi":"10.1109/2.955095","title":"Shifting paradigms with the application service provider model","year":2001,"lang":"en","type":"article","venue":"Computer","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":82,"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; Service provider; Component (thermodynamics); Outsourcing; Granularity; Service (business); Cloud computing; Utility computing; Distributed computing; Computer security; World Wide Web; Computer network; Operating system; Cloud computing security","score_opus":0.018160129447723425,"score_gpt":0.22366742587703153,"score_spread":0.2055072964293081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017025131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021411434,0.004261749,0.53500265,0.08523465,0.0027805455,0.00038924508,0.00016910785,0.000899569,0.34985104],"genre_scores_gemma":[0.6289307,0.0089332815,0.24539159,0.024874844,0.0048749624,0.0015266377,0.00026546273,0.00082716043,0.08437531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877685,0.0045739654,0.00042476357,0.0014181178,0.0050004823,0.0008142066],"domain_scores_gemma":[0.99197984,0.002444593,0.0003666384,0.0018441989,0.0021804352,0.001184291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008764237,0.0011579611,0.0009385358,0.0023109138,0.004411334,0.012180275,0.0027983978,0.007234757,0.007734272],"category_scores_gemma":[0.01237413,0.0011306744,0.0014360271,0.0022638256,0.01255995,0.03176028,0.009160632,0.014943126,0.0050735245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016028342,0.000026073869,0.00010051073,0.000024717245,0.0000057009006,0.00006144063,0.00047226175,0.00052921934,0.00028206466,0.98930967,0.0028406065,0.0063316952],"study_design_scores_gemma":[0.00004534245,0.000071622446,0.00012976956,0.00006866168,0.000016159825,0.0003150426,0.00063040253,0.008856109,0.0004282557,0.8383502,0.15104531,0.000043132957],"about_ca_topic_score_codex":0.005211906,"about_ca_topic_score_gemma":0.0036364808,"teacher_disagreement_score":0.012180275,"about_ca_system_score_codex":0.0061301445,"about_ca_system_score_gemma":0.006430728,"threshold_uncertainty_score":0.04635024},"labels":[],"label_agreement":null},{"id":"W2017275473","doi":"10.1145/1117201.1117253","title":"The routability of multiprocessor network topologies in FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Network topology; Field-programmable gate array; Computer science; Routing (electronic design automation); Hypercube; Interconnection; Embedded system; Multiprocessing; Key (lock); Topology (electrical circuits); Process (computing); Network on a chip; Parallel computing; Computer network; Engineering; Electrical engineering","score_opus":0.006079957557155406,"score_gpt":0.21100580747706527,"score_spread":0.20492584991990986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017275473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82016736,0.000610725,0.16221116,0.00018381327,0.000035477475,0.00006684102,0.00017576825,0.0004664863,0.016082352],"genre_scores_gemma":[0.96063316,0.00024837683,0.03754715,0.000018698674,0.000008777032,0.00005081266,0.00012214633,0.000042417116,0.001328456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995178,0.00018443895,0.000033769014,0.00006882718,0.00013598015,0.00005926703],"domain_scores_gemma":[0.99799323,0.0011459012,0.00034388018,0.00030973856,0.00016940723,0.00003794875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900196,0.0002878428,0.00025646866,0.0005583402,0.000318935,0.0007852696,0.00037804822,0.00035365362,0.001746708],"category_scores_gemma":[0.0036214325,0.00021526117,0.00020565414,0.0005005849,0.00033240835,0.001279781,0.0002494377,0.00025890287,0.00015688389],"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.00027957378,0.000055626795,0.0035377522,0.00018389689,0.000028298356,0.0005213896,0.00010243529,0.8824557,0.034319688,0.025555717,0.00047835,0.05248155],"study_design_scores_gemma":[0.000047391546,0.00048330709,0.0053986544,0.000036254565,0.000033982935,0.0007084371,0.00015600858,0.9417945,0.028951518,0.018411051,0.003958439,0.000020436648],"about_ca_topic_score_codex":0.0010216691,"about_ca_topic_score_gemma":0.001448045,"teacher_disagreement_score":0.001746708,"about_ca_system_score_codex":0.00063817366,"about_ca_system_score_gemma":0.0002854929,"threshold_uncertainty_score":0.0058433414},"labels":[],"label_agreement":null},{"id":"W2017442846","doi":"10.1109/cjece.2014.2326054","title":"A Novel Modeling Approach for System-Level Application Mapping Targeted for Configurable Architecture","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"SystemC; Computer science; Executable; Design space exploration; Architecture; Computer architecture; Petri net; Embedded system; Computer engineering; Distributed computing; Programming language","score_opus":0.015124267500809736,"score_gpt":0.17433292553666038,"score_spread":0.15920865803585066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017442846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019829914,0.00005620425,0.9953418,0.0000670583,0.000025821912,0.000052699004,0.000046679557,0.00036933174,0.0020574383],"genre_scores_gemma":[0.13990241,0.0005442018,0.85262084,0.000098837365,0.000035741294,0.00045376495,0.00024037495,0.00018763765,0.0059162616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950755,0.00013149281,0.000034575864,0.000083458144,0.000194258,0.000048676713],"domain_scores_gemma":[0.9996604,0.00011336409,0.000037012345,0.000093792216,0.00007456888,0.000020799675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073829904,0.00089287205,0.00039857693,0.0006956228,0.0004971284,0.0012055029,0.0012888783,0.0008002224,0.0022868195],"category_scores_gemma":[0.00096564135,0.0005245456,0.0013314013,0.0005151324,0.0006405453,0.0013389718,0.0008647635,0.0015028657,0.0005692941],"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.00006514558,0.000085035805,0.0007496463,0.00029410707,0.00006176547,0.00042424566,0.0003461511,0.65220314,0.03386077,0.25682652,0.0017378809,0.05334558],"study_design_scores_gemma":[0.000008729528,0.00005169212,0.00011496728,0.00003071341,0.000036674894,0.00013942904,0.00001988239,0.9535025,0.0066402117,0.025361577,0.014074915,0.000018706869],"about_ca_topic_score_codex":0.003903212,"about_ca_topic_score_gemma":0.0058473684,"teacher_disagreement_score":0.003903212,"about_ca_system_score_codex":0.0008295303,"about_ca_system_score_gemma":0.0020397294,"threshold_uncertainty_score":0.0077610016},"labels":[],"label_agreement":null},{"id":"W2019913009","doi":"10.1117/12.498809","title":"Switch-based interconnect architecture for future systems on chip","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Interconnection Networks and Systems","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Interconnection; Embedded system; Synchronization (alternating current); System on a chip; Block (permutation group theory); Throughput; Computer network; Network on a chip; Computer architecture; Distributed computing; Telecommunications; Channel (broadcasting); Wireless","score_opus":0.011136652955453163,"score_gpt":0.21776886817756413,"score_spread":0.20663221522211098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019913009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029883733,0.017876517,0.75207907,0.0044103833,0.0029544136,0.00030310513,0.0009133982,0.01010951,0.18146984],"genre_scores_gemma":[0.3807555,0.015647952,0.49047232,0.0029040596,0.0011410168,0.00069759734,0.0028774068,0.00076578173,0.1047383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000029496226,0.000011685643,0.000031058284,0.00008875021,0.000022494933],"domain_scores_gemma":[0.9998522,0.000015036125,0.000013279941,0.000042523257,0.0000611994,0.000015880116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027060296,0.000373917,0.00019377164,0.00042822582,0.000446579,0.001286132,0.00067816756,0.0006334948,0.009307476],"category_scores_gemma":[0.00028935113,0.00013544728,0.00022518756,0.0005646459,0.00033094684,0.0010466689,0.0005372275,0.00085437944,0.002948371],"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.00009476153,0.00007280448,0.0005155939,0.0005569585,0.00006101716,0.00024355708,0.00023921124,0.028529966,0.055370677,0.50584143,0.0849721,0.323502],"study_design_scores_gemma":[0.0000298401,0.00023699805,0.0006294097,0.0001127455,0.00005010667,0.00035898542,0.0000759062,0.08230868,0.010707268,0.102919966,0.80253035,0.000039798393],"about_ca_topic_score_codex":0.0010248427,"about_ca_topic_score_gemma":0.0023152218,"teacher_disagreement_score":0.009307476,"about_ca_system_score_codex":0.00078509306,"about_ca_system_score_gemma":0.0006208387,"threshold_uncertainty_score":0.031136572},"labels":[],"label_agreement":null},{"id":"W2021482139","doi":"10.1109/dft.2011.34","title":"Debug Aware AXI-based Network Interface","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Debugging; Background debug mode interface; Computer science; Embedded system; Interface (matter); TRACE (psycholinguistics); Operating system","score_opus":0.03772800090250825,"score_gpt":0.22773782136549764,"score_spread":0.1900098204629894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021482139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10325012,0.0013552101,0.8168803,0.0004895614,0.00033679328,0.00033747073,0.00082216144,0.03156001,0.044968374],"genre_scores_gemma":[0.79986584,0.0006726506,0.16627923,0.00055737817,0.00010506057,0.0003832854,0.0016559517,0.000564641,0.029916026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.000077422366,0.000031232787,0.00008422862,0.00012056486,0.00004559324],"domain_scores_gemma":[0.99955374,0.00009088965,0.000052927764,0.00010710408,0.0001634989,0.00003180835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003847668,0.00043174365,0.00023235672,0.0005671565,0.00022212877,0.0007225588,0.0012319296,0.00038935343,0.007819372],"category_scores_gemma":[0.0008955494,0.00019188086,0.00015712251,0.00030945745,0.00021929627,0.0010688886,0.00071222975,0.000535451,0.001087187],"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.0023387377,0.000373201,0.014763801,0.0012356369,0.00016126296,0.0011847852,0.0009592573,0.04116029,0.26258227,0.080756485,0.051704288,0.5427799],"study_design_scores_gemma":[0.0003191002,0.0012660202,0.0063732606,0.00014110027,0.00023945034,0.0023694423,0.00022957087,0.50214225,0.2693612,0.011251182,0.20616725,0.00014006565],"about_ca_topic_score_codex":0.000730225,"about_ca_topic_score_gemma":0.0010706374,"teacher_disagreement_score":0.007819372,"about_ca_system_score_codex":0.00046865738,"about_ca_system_score_gemma":0.0004588283,"threshold_uncertainty_score":0.026158452},"labels":[],"label_agreement":null},{"id":"W2021626512","doi":"10.1109/fpl.2014.6927440","title":"Using an OpenCL framework to evaluate interconnect implementations on FPGAs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Toronto","funders":"","keywords":"Implementation; Computer science; Field-programmable gate array; Interconnection; Parallel computing; Computer architecture; Embedded system; Programming language; Telecommunications","score_opus":0.11771843861178889,"score_gpt":0.3980517955604776,"score_spread":0.2803333569486887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021626512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8926564,0.00074854895,0.07377162,0.00020325354,0.00031365722,0.0002465107,0.0013398586,0.01022848,0.020491615],"genre_scores_gemma":[0.9265878,0.00018699457,0.06705861,0.000079223275,0.00003360134,0.00023128523,0.0016731182,0.0012856681,0.0028637752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872607,0.00033970556,0.00009828145,0.0001354628,0.00043467467,0.0002657905],"domain_scores_gemma":[0.9947196,0.002846198,0.00031396307,0.0005305248,0.0014097873,0.0001798964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413647,0.0010825632,0.0004963649,0.0016917904,0.0006670204,0.0011205102,0.0016864255,0.0008968543,0.005160475],"category_scores_gemma":[0.00643931,0.00030323898,0.00053537905,0.0013313721,0.0006471345,0.0015283272,0.00082911464,0.00093659776,0.00063301256],"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.0016608071,0.0012155458,0.008568639,0.0011329452,0.00020637698,0.0008116067,0.00041017923,0.808329,0.032328892,0.018616704,0.014593193,0.112126105],"study_design_scores_gemma":[0.00018149213,0.0010658628,0.0026536684,0.000037006826,0.00003775998,0.000118598386,0.00020288254,0.9594633,0.027101869,0.0029188853,0.00617581,0.00004284953],"about_ca_topic_score_codex":0.0061347536,"about_ca_topic_score_gemma":0.005306295,"teacher_disagreement_score":0.0061347536,"about_ca_system_score_codex":0.0013848388,"about_ca_system_score_gemma":0.0008138973,"threshold_uncertainty_score":0.017263532},"labels":[],"label_agreement":null},{"id":"W2021931635","doi":"10.1016/j.ipl.2010.10.002","title":"Developing fault-tolerant distributed loops","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Circulant matrix; Computer science; Fault tolerance; Loop (graph theory); Distributed computing; Node (physics); Theoretical computer science; Mathematics; Algorithm; Combinatorics; Engineering","score_opus":0.010280794861545104,"score_gpt":0.2269768062843992,"score_spread":0.2166960114228541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021931635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09267981,0.000116877476,0.90232426,0.00015214577,0.0000606168,0.000087843095,0.000021479464,0.0009292373,0.003627788],"genre_scores_gemma":[0.8483037,0.00010945372,0.14783627,0.00010288474,0.000030828647,0.0001084461,0.00006584755,0.00011055842,0.0033320733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975103,0.000052681058,0.00001477717,0.000057833113,0.0000772686,0.000046474735],"domain_scores_gemma":[0.9987172,0.00062961446,0.00014642619,0.0001850404,0.00025534502,0.00006632111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535,0.00040131746,0.00046117266,0.00033967756,0.00034606666,0.0005049259,0.0010564327,0.00066076696,0.0021185684],"category_scores_gemma":[0.002754756,0.0002842037,0.00024166674,0.00024431993,0.0005132684,0.0008155762,0.0010706976,0.0006000615,0.00029142536],"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.00019597163,0.00016227727,0.0010035139,0.00019274358,0.00003422315,0.00022840589,0.00031545333,0.75873107,0.04599388,0.0438986,0.0014605324,0.14778326],"study_design_scores_gemma":[0.000034581815,0.0001632784,0.00006492034,0.000008328893,0.000012470116,0.00003343248,0.000029712783,0.9701376,0.011324762,0.016649181,0.0015370728,0.0000047586805],"about_ca_topic_score_codex":0.0005149969,"about_ca_topic_score_gemma":0.0006801981,"teacher_disagreement_score":0.0021185684,"about_ca_system_score_codex":0.00045173182,"about_ca_system_score_gemma":0.00047808234,"threshold_uncertainty_score":0.0070872903},"labels":[],"label_agreement":null},{"id":"W2022077517","doi":"10.1016/j.camwa.2009.01.043","title":"Chromatic sets of power graphs and their application to resource placement in multicomputer networks","year":2009,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hypercube; Chromatic scale; Mathematics; Computer science; Graph; Resource (disambiguation); Power of two; Topology (electrical circuits); Scheme (mathematics); Theoretical computer science; Mathematical optimization; Discrete mathematics; Algorithm; Combinatorics; Computer network","score_opus":0.006573041864612613,"score_gpt":0.2215367928411838,"score_spread":0.2149637509765712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022077517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27179825,0.0018109583,0.69095576,0.001713802,0.00027997716,0.00017049155,0.0007579611,0.0006026045,0.031910207],"genre_scores_gemma":[0.87716633,0.0017373117,0.10770089,0.00024568426,0.0003080453,0.00016302761,0.0004475668,0.00027718232,0.0119538875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995597,0.00015185805,0.000019268879,0.00006892552,0.00012248599,0.00007775881],"domain_scores_gemma":[0.99144816,0.006538395,0.00072900276,0.00032883746,0.00050974323,0.00044583535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014116485,0.00078318425,0.0008917239,0.0049023298,0.0018745332,0.003031659,0.0021688691,0.0013115698,0.0069515924],"category_scores_gemma":[0.011753969,0.0011107445,0.00089474686,0.003765859,0.00235811,0.0030110418,0.0014508602,0.0017164864,0.00029605703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013129618,0.000074866126,0.0014858431,0.00011335766,0.000036534886,0.000097005446,0.00038130325,0.30130553,0.0013031246,0.66073424,0.004702254,0.029634671],"study_design_scores_gemma":[0.00001929135,0.000017700748,0.0005655128,0.000028231168,0.00001677488,0.00004800223,0.00010629284,0.6149624,0.00048321884,0.38193062,0.0017973426,0.000024646406],"about_ca_topic_score_codex":0.009454376,"about_ca_topic_score_gemma":0.010807672,"teacher_disagreement_score":0.009454376,"about_ca_system_score_codex":0.002890114,"about_ca_system_score_gemma":0.0011971992,"threshold_uncertainty_score":0.023255408},"labels":[],"label_agreement":null},{"id":"W2023406382","doi":"10.1016/s0166-218x(00)00329-2","title":"Optimal embeddings of odd ladders into a hypercube","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Mathematics; Hypercube; Combinatorics; Discrete mathematics","score_opus":0.016393960639763266,"score_gpt":0.2266928977100116,"score_spread":0.21029893707024835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023406382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5538081,0.00045727828,0.41053444,0.0007077738,0.00017250961,0.000079868296,0.0003455034,0.0006564123,0.03323805],"genre_scores_gemma":[0.84061384,0.00072763726,0.14297333,0.00017289908,0.000038541853,0.00008674953,0.00039898427,0.00028304124,0.014704966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977905,0.00007378793,0.000014869969,0.00003484016,0.000038740007,0.000058683007],"domain_scores_gemma":[0.9993678,0.0001682838,0.000113241884,0.00013211896,0.00006817884,0.00015035486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029265098,0.0004898275,0.00043041757,0.00046591004,0.0004336245,0.001345415,0.0006795352,0.0005089083,0.005934579],"category_scores_gemma":[0.0015206713,0.0003972949,0.0002916074,0.00050077983,0.00061473524,0.0020880895,0.0018083552,0.000989082,0.00084877276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010774236,0.0002710057,0.0018170369,0.00036248352,0.000054809974,0.00040148688,0.000549983,0.1557106,0.037033267,0.6498812,0.0077868863,0.14505394],"study_design_scores_gemma":[0.000093633236,0.00021430837,0.000648859,0.00007803283,0.000028756815,0.00014597816,0.00039053735,0.27863514,0.0073470064,0.700196,0.012195824,0.00002595629],"about_ca_topic_score_codex":0.00052582234,"about_ca_topic_score_gemma":0.0009893455,"teacher_disagreement_score":0.005934579,"about_ca_system_score_codex":0.00061728596,"about_ca_system_score_gemma":0.00034944926,"threshold_uncertainty_score":0.019853115},"labels":[],"label_agreement":null},{"id":"W2023910678","doi":"10.1109/iccd.2012.6378689","title":"The performance of hypermesh NoCs in FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"","keywords":"Hypercube; Computer science; Router; Parallel computing; Traverse; Network packet; Network topology; Latency (audio); Bipartite graph; Topology (electrical circuits); Graph; Computer network; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01217924133305221,"score_gpt":0.21707524745028203,"score_spread":0.20489600611722983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023910678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815197,0.00040465876,0.006523432,0.000060159946,0.00004920912,0.000022429891,0.00022003117,0.00051156705,0.0040565],"genre_scores_gemma":[0.99398637,0.0001567201,0.0046345554,0.000014276639,0.000005101364,0.000016883307,0.00022755195,0.000015903823,0.00094256026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999577,0.000086086104,0.000037148402,0.000060618262,0.00013383444,0.00010536],"domain_scores_gemma":[0.99906594,0.0003693499,0.00010029434,0.00015137509,0.00025088192,0.000062124454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041227957,0.0004026938,0.0003415836,0.00063438807,0.0003118282,0.00055343105,0.0005430419,0.00031981678,0.0029705667],"category_scores_gemma":[0.0016536815,0.00016777092,0.00011609378,0.0006959533,0.00022400635,0.00079224235,0.00029017855,0.00013487902,0.0002572918],"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.0043221316,0.00048652134,0.011844392,0.00070898095,0.000181321,0.0010845426,0.00031798767,0.63622177,0.19617638,0.004249057,0.0033939234,0.14101306],"study_design_scores_gemma":[0.00017384812,0.0053505176,0.0189169,0.000079017766,0.00009939871,0.0005781838,0.00038705437,0.7436071,0.2230744,0.0019090979,0.0057514072,0.000073103045],"about_ca_topic_score_codex":0.0021690002,"about_ca_topic_score_gemma":0.0017757363,"teacher_disagreement_score":0.0029705667,"about_ca_system_score_codex":0.0005621604,"about_ca_system_score_gemma":0.00023009173,"threshold_uncertainty_score":0.009937584},"labels":[],"label_agreement":null},{"id":"W2026304802","doi":"10.1016/j.jda.2014.11.008","title":"The shortest path problem in the Knödel graph","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Shortest path problem; Distance; Graph; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.009150218732017937,"score_gpt":0.23360562131199245,"score_spread":0.2244554025799745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026304802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16051131,0.0011261803,0.8040934,0.004375333,0.00022682104,0.00016454705,0.0019009341,0.00047729784,0.02712417],"genre_scores_gemma":[0.74035037,0.002204319,0.21129216,0.00060878263,0.00023479102,0.0002750285,0.0027874347,0.0004150989,0.041832045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.0002797831,0.00003115842,0.00021462784,0.00009950063,0.00010442504],"domain_scores_gemma":[0.99701333,0.0020758216,0.00028988477,0.00019863973,0.00018269138,0.00023962284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008497714,0.00072252273,0.0014041569,0.0010594517,0.0011534095,0.0023173487,0.0018453195,0.0024290818,0.009590401],"category_scores_gemma":[0.0067308815,0.0006311411,0.00080142356,0.0016546241,0.0010676023,0.0062609483,0.0017151247,0.0018219948,0.00086680823],"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.00029187105,0.00016699078,0.0010923459,0.00044399162,0.00008407875,0.00033572517,0.00026204102,0.56380826,0.002238631,0.37632364,0.012116076,0.042836413],"study_design_scores_gemma":[0.000052373456,0.00004813825,0.0002530054,0.00003633835,0.000023627763,0.000099641235,0.0001634112,0.5576121,0.00068396225,0.4360774,0.0049266657,0.000023374057],"about_ca_topic_score_codex":0.007337636,"about_ca_topic_score_gemma":0.008314552,"teacher_disagreement_score":0.009590401,"about_ca_system_score_codex":0.0017834047,"about_ca_system_score_gemma":0.0018652679,"threshold_uncertainty_score":0.032083035},"labels":[],"label_agreement":null},{"id":"W2026844540","doi":"10.1145/2629442","title":"Networks-on-Chip for FPGAs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Interconnection; Embedded system; Network on a chip; System on a chip; Bandwidth (computing); Overhead (engineering); Floorplan; Computer hardware; Computer network","score_opus":0.018185483411747826,"score_gpt":0.23334014965975391,"score_spread":0.21515466624800608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026844540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014610275,0.021651242,0.5912306,0.0072414484,0.0035309775,0.0004104434,0.0026260864,0.015961586,0.34273744],"genre_scores_gemma":[0.22835791,0.019211031,0.47260153,0.0029254141,0.0007072906,0.000712473,0.0043577836,0.0013289222,0.26979762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.000068717534,0.000017705474,0.00004280806,0.00015730187,0.000035300473],"domain_scores_gemma":[0.9997427,0.000054451404,0.000016638365,0.0000713055,0.00008908921,0.000025667332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026089564,0.0005718875,0.00029308852,0.00045574253,0.00027889272,0.001070647,0.0006201527,0.0005715766,0.04375031],"category_scores_gemma":[0.00091568794,0.00022595342,0.00021832615,0.00042164949,0.00024082397,0.0010450712,0.00065934495,0.0011724628,0.011386932],"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.00016808437,0.000074473544,0.0007990524,0.00065876136,0.00006888676,0.00037180868,0.00008738717,0.033861496,0.025484493,0.17184643,0.18502367,0.5815554],"study_design_scores_gemma":[0.000046759047,0.00012302415,0.00065996946,0.00024351303,0.000027531276,0.00026530624,0.000044314722,0.06162809,0.007911922,0.037790343,0.89122623,0.00003296867],"about_ca_topic_score_codex":0.0012698615,"about_ca_topic_score_gemma":0.0028740843,"teacher_disagreement_score":0.04375031,"about_ca_system_score_codex":0.0006866611,"about_ca_system_score_gemma":0.0005401593,"threshold_uncertainty_score":0.14635938},"labels":[],"label_agreement":null},{"id":"W2028193069","doi":"10.1109/aspdac.2014.6742875","title":"Bounding buffer space requirements for real-time priority-aware networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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 Waterloo","funders":"","keywords":"Computer science; Buffer (optical fiber); Router; Computer network; Bounding overwatch; Latency (audio); Write buffer; Distributed computing; CPU cache; Cache; Cache algorithms","score_opus":0.017489874758477776,"score_gpt":0.2620925448516181,"score_spread":0.24460267009314032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028193069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0797403,0.0019706842,0.91291094,0.00029463752,0.000101576006,0.000051287556,0.000100686964,0.0017267962,0.0031031964],"genre_scores_gemma":[0.7645196,0.0009097289,0.23207867,0.00014193566,0.00006072333,0.00012408286,0.00019914155,0.00030070986,0.0016654555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978125,0.0004914098,0.00014486356,0.00025440767,0.0009673398,0.000329445],"domain_scores_gemma":[0.9947673,0.0030057966,0.0006797941,0.0007376555,0.0006739419,0.00013551442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015739864,0.0012086568,0.00063630065,0.0014314887,0.000641226,0.0022338128,0.001836192,0.00064820395,0.0020039387],"category_scores_gemma":[0.008010713,0.0005432656,0.0005064293,0.000984307,0.00072710053,0.0037855802,0.0009940545,0.0009077075,0.00033810447],"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.0007185327,0.00013048387,0.002108256,0.00034164888,0.00006944263,0.00015664696,0.00020133903,0.72727597,0.10136844,0.043321803,0.0023315288,0.121975966],"study_design_scores_gemma":[0.000016879572,0.00006411002,0.00019919338,0.000018382829,0.000021406486,0.000048968537,0.000030096542,0.95519656,0.032863833,0.009857169,0.0016661781,0.000017269727],"about_ca_topic_score_codex":0.0022590978,"about_ca_topic_score_gemma":0.0035618914,"teacher_disagreement_score":0.0022590978,"about_ca_system_score_codex":0.0017271208,"about_ca_system_score_gemma":0.002599905,"threshold_uncertainty_score":0.012531161},"labels":[],"label_agreement":null},{"id":"W2028884430","doi":"10.1007/s00373-011-1091-5","title":"On Superconnectivity of (4, g)-Cages","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Cage; Graph; Vertex (graph theory); Graph power; Vertex-transitive graph; Discrete mathematics; Line graph","score_opus":0.023230265293499048,"score_gpt":0.19621133058195483,"score_spread":0.17298106528845578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028884430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90034384,0.0007376557,0.040044267,0.0007625819,0.000104875864,0.000066868495,0.00029906057,0.00013837649,0.057502538],"genre_scores_gemma":[0.9719363,0.0009795708,0.016583866,0.0003284933,0.000112178226,0.00010487869,0.0006417997,0.0000941483,0.009218809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951553,0.00014971154,0.00002435981,0.00009456131,0.00010717519,0.000108717286],"domain_scores_gemma":[0.99682,0.0017436518,0.00051220047,0.00025399783,0.00029978078,0.00037036595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163473,0.00043663062,0.0006648042,0.0014268414,0.0022860025,0.0017682381,0.0010863779,0.00095493725,0.0076053366],"category_scores_gemma":[0.0028254932,0.0005121705,0.00055074674,0.0013348699,0.0019093824,0.002144911,0.001887306,0.0009764973,0.0004590258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026847675,0.00007508345,0.003948779,0.00017548613,0.00003867738,0.0005033114,0.0012153797,0.012758192,0.0048469943,0.95020175,0.0049400385,0.021027934],"study_design_scores_gemma":[0.00008147594,0.00009469961,0.0043737045,0.000092194554,0.00006270213,0.0006415428,0.0016452792,0.0403232,0.0033282991,0.9399188,0.009396713,0.000041353083],"about_ca_topic_score_codex":0.0027322685,"about_ca_topic_score_gemma":0.0038554934,"teacher_disagreement_score":0.0076053366,"about_ca_system_score_codex":0.0006191089,"about_ca_system_score_gemma":0.00043724853,"threshold_uncertainty_score":0.025442421},"labels":[],"label_agreement":null},{"id":"W2028981459","doi":"10.1142/s0129054110007350","title":"COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hierarchy; Class (philosophy); Overhead (engineering); Resolution (logic); Collision; Theoretical computer science; Process (computing); Constant (computer programming); Parallel computing; Distributed computing; Programming language; Artificial intelligence","score_opus":0.022076746715674115,"score_gpt":0.2932556143907607,"score_spread":0.2711788676750866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028981459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46067622,0.0011306867,0.48500046,0.0017576693,0.00010348944,0.00017370353,0.00015246398,0.0006838483,0.05032149],"genre_scores_gemma":[0.9006106,0.00069174764,0.09150804,0.00021693918,0.00011372606,0.00018260448,0.00012521911,0.00010499482,0.0064460905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874264,0.00035549182,0.000067510526,0.00017033081,0.00042259644,0.00024151677],"domain_scores_gemma":[0.99711007,0.0012330319,0.00022671951,0.00089896645,0.00028385193,0.00024742712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595252,0.0006590205,0.0007571811,0.00071608706,0.0011640211,0.0020463667,0.0015312028,0.0007603206,0.0045514726],"category_scores_gemma":[0.0047031376,0.0005912492,0.0011041899,0.0007959491,0.0022985472,0.005346846,0.0038397904,0.002056841,0.0005134074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011413138,0.00009813607,0.001197471,0.00015517115,0.00004616543,0.00025713627,0.0004350845,0.16870582,0.003948897,0.80407685,0.0010486627,0.019916411],"study_design_scores_gemma":[0.00003629923,0.000078294775,0.0002298378,0.000024766769,0.000029889188,0.00009217359,0.00010567351,0.48352292,0.0011939701,0.5104174,0.0042502335,0.000018496316],"about_ca_topic_score_codex":0.0018241918,"about_ca_topic_score_gemma":0.0016867475,"teacher_disagreement_score":0.0045514726,"about_ca_system_score_codex":0.0009375138,"about_ca_system_score_gemma":0.0009079138,"threshold_uncertainty_score":0.015226185},"labels":[],"label_agreement":null},{"id":"W2029075328","doi":"10.1016/j.micpro.2014.11.005","title":"Statically adaptive multi FIFO buffer architecture for network on chip","year":2014,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; FIFO (computing and electronics); Network packet; Router; Virtual channel; Network on a chip; Latency (audio); Embedded system; Parallel computing; Channel (broadcasting); Operating system","score_opus":0.014687958709174016,"score_gpt":0.23029006767872887,"score_spread":0.21560210896955484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029075328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1922061,0.0065974565,0.77840835,0.0005157233,0.0009930361,0.00014171306,0.00050416926,0.007380146,0.013253329],"genre_scores_gemma":[0.8907422,0.0006833377,0.09554258,0.00031212825,0.00012015256,0.000076678596,0.00044070688,0.00011042771,0.011971811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999821,0.00002100917,0.000013693555,0.00005317934,0.00005078349,0.000040294486],"domain_scores_gemma":[0.9996921,0.00005137186,0.000036132555,0.000060282666,0.00013722383,0.000023057624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023970447,0.00039220642,0.00028957715,0.00054201676,0.0005303439,0.00069268787,0.0018055841,0.00034336053,0.003980513],"category_scores_gemma":[0.0005110245,0.00021479616,0.00015119756,0.00043057802,0.00017523623,0.0010374848,0.00043927203,0.00045790526,0.0005216644],"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.0016136102,0.00031264307,0.0040083965,0.0004843516,0.00012364193,0.00033096562,0.00023811978,0.05176296,0.32020482,0.026764518,0.020897137,0.5732589],"study_design_scores_gemma":[0.00012101843,0.0010781072,0.002495847,0.000075468524,0.00021584835,0.0005888309,0.000105940904,0.72861797,0.22736225,0.010154254,0.029096002,0.00008840541],"about_ca_topic_score_codex":0.0024915743,"about_ca_topic_score_gemma":0.0055227084,"teacher_disagreement_score":0.003980513,"about_ca_system_score_codex":0.0006544109,"about_ca_system_score_gemma":0.0008064854,"threshold_uncertainty_score":0.0133161545},"labels":[],"label_agreement":null},{"id":"W2030615194","doi":"10.1016/j.parco.2009.04.001","title":"A distributed Key Message algorithm to optimize the communication in clusters","year":2009,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Alberta","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Message passing; Algorithm; Computer security","score_opus":0.014883835777013717,"score_gpt":0.2570849466904719,"score_spread":0.24220111091345817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030615194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015623413,0.0002958212,0.98003846,0.00023992751,0.00013611338,0.0000748676,0.00005965199,0.0011083841,0.0024232955],"genre_scores_gemma":[0.30681333,0.00022620948,0.68659145,0.00014476538,0.00011670203,0.00031379674,0.0002363479,0.00039000605,0.005167394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.00012483602,0.000025067482,0.00006311937,0.00014466615,0.00006582752],"domain_scores_gemma":[0.9993979,0.00027119825,0.000039029703,0.00010551698,0.00014996828,0.000036335718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095203,0.00071611325,0.0011459052,0.0006758496,0.0009917855,0.0007403698,0.0014879756,0.0009209513,0.003079939],"category_scores_gemma":[0.0025934181,0.00038820948,0.000451489,0.0011404749,0.000554365,0.0013374973,0.0011236453,0.0009512745,0.0007099257],"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.00062734104,0.00016146783,0.0005627961,0.00014326269,0.000079572616,0.00007439291,0.00014087746,0.6554799,0.010535549,0.038305957,0.013157304,0.28073165],"study_design_scores_gemma":[0.00008133499,0.00005306973,0.00008306702,0.000004023082,0.000013768923,0.000016019352,0.000015556903,0.98428404,0.0018758489,0.0119846985,0.0015795351,0.000008973958],"about_ca_topic_score_codex":0.0032564434,"about_ca_topic_score_gemma":0.003902836,"teacher_disagreement_score":0.0032564434,"about_ca_system_score_codex":0.00088961923,"about_ca_system_score_gemma":0.0015344693,"threshold_uncertainty_score":0.010303438},"labels":[],"label_agreement":null},{"id":"W2034249462","doi":"10.1016/j.jneumeth.2011.04.010","title":"Default network correlations analyzed on native surfaces","year":2011,"lang":"en","type":"article","venue":"Journal of Neuroscience Methods","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Institute of Neurological Disorders and Stroke; National Institute of General Medical Sciences; National Institute on Aging; University of California, San Diego; National Institutes of Health","keywords":"Default mode network; Psychology; Neuroscience; Functional connectivity","score_opus":0.11812881526777529,"score_gpt":0.37016671631644277,"score_spread":0.25203790104866747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034249462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187164,0.00008594728,0.078866,0.000022614558,0.0000072343223,0.000039133825,0.00029741804,0.00041394957,0.0015513246],"genre_scores_gemma":[0.98625505,0.000030140636,0.013090643,0.000003548285,0.0000044513445,0.000029653209,0.00026177889,0.00006334257,0.00026141093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996524,0.00009904728,0.000017532524,0.000094621166,0.000088938126,0.000047508274],"domain_scores_gemma":[0.9984849,0.0009784792,0.00012154333,0.00017315103,0.00020358678,0.000038472186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009540442,0.00029623826,0.00030177963,0.0013473378,0.00020502391,0.0005564985,0.00021629788,0.00019400679,0.0020696132],"category_scores_gemma":[0.005162248,0.00018116191,0.00030413218,0.0008835143,0.00036517394,0.0006753812,0.00038766582,0.00021961871,0.00016583769],"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.0020549013,0.00022843627,0.11404046,0.00036224758,0.00047623875,0.00150448,0.0029027876,0.23987937,0.28852722,0.02687879,0.0038342732,0.3193108],"study_design_scores_gemma":[0.000025263571,0.00019157412,0.2509941,0.0000133594,0.00006791131,0.0010691027,0.00033549947,0.6965014,0.036305424,0.012768323,0.0016744606,0.000053627362],"about_ca_topic_score_codex":0.002021348,"about_ca_topic_score_gemma":0.0017999293,"teacher_disagreement_score":0.0020696132,"about_ca_system_score_codex":0.0003367001,"about_ca_system_score_gemma":0.00026753359,"threshold_uncertainty_score":0.0069235563},"labels":[],"label_agreement":null},{"id":"W2034822545","doi":"10.1109/micro.2014.61","title":"NoC Architectures for Silicon Interposer Systems: Why Pay for more Wires when you Can Get them (from your interposer) for Free?","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada); University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interposer; Dram; Computer science; Network on a chip; Through-silicon via; Routing (electronic design automation); Exploit; Stacking; Chip; Embedded system; Computer network; Computer architecture; Silicon; Materials science; Computer hardware; Nanotechnology; Optoelectronics; Layer (electronics); Telecommunications","score_opus":0.025309581830153992,"score_gpt":0.24833570086443016,"score_spread":0.22302611903427616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034822545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24011882,0.15921868,0.3623595,0.087476924,0.0047618463,0.00021438161,0.0004964862,0.0023312564,0.14302208],"genre_scores_gemma":[0.72439474,0.07530478,0.14587738,0.0051770885,0.0012052674,0.00016334077,0.0003855335,0.0002871864,0.04720474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970204,0.000055619555,0.000012500331,0.000036987807,0.00015498813,0.00003781446],"domain_scores_gemma":[0.9995086,0.00011481134,0.00005848848,0.00007588928,0.00018304454,0.000059202255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049249583,0.00039499544,0.00020392043,0.0003211425,0.00056448154,0.0010764339,0.000601254,0.0007482144,0.003736178],"category_scores_gemma":[0.0014699034,0.00015913662,0.0001443599,0.0005995698,0.00050746195,0.0022214877,0.00043480002,0.00065485074,0.0009960339],"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.00017057791,0.000111067595,0.0044160574,0.0013103838,0.000097043994,0.00027540242,0.00029576416,0.033586953,0.04700955,0.22504465,0.04511145,0.642571],"study_design_scores_gemma":[0.000069809175,0.0005220372,0.0046345415,0.0008186383,0.00016524816,0.0009813167,0.0009381778,0.12399338,0.031520404,0.25795886,0.57830375,0.00009375906],"about_ca_topic_score_codex":0.0010940555,"about_ca_topic_score_gemma":0.003428763,"teacher_disagreement_score":0.003736178,"about_ca_system_score_codex":0.0007127187,"about_ca_system_score_gemma":0.00055285316,"threshold_uncertainty_score":0.012498736},"labels":[],"label_agreement":null},{"id":"W2034824620","doi":"10.1109/aina.2014.63","title":"New Heuristic for Message Broadcasting in Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Heuristic; Computer science; Consistent heuristic; Internet topology; Broadcasting (networking); Hypercube; Path (computing); Shortest path problem; Null-move heuristic; The Internet; Cube (algebra); Theoretical computer science; Network topology; Distributed computing; Algorithm; Computer network; Incremental heuristic search; Mathematics; Parallel computing; Graph; Combinatorics; Search algorithm; Artificial intelligence","score_opus":0.012737896695389054,"score_gpt":0.2318084501069536,"score_spread":0.21907055341156456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034824620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024727242,0.0005329965,0.964655,0.00034675663,0.0001471863,0.00021652882,0.000114628805,0.0011775226,0.008082056],"genre_scores_gemma":[0.3179736,0.0004541776,0.6744391,0.0002539482,0.00012339499,0.00048752848,0.00052515016,0.00035413614,0.005388991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00040243016,0.000044407443,0.00013159562,0.0002911616,0.00015699097],"domain_scores_gemma":[0.9981186,0.0011303952,0.00010752188,0.00034017206,0.00019670496,0.00010663591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905894,0.00059067016,0.00086047256,0.0012526123,0.0010818806,0.0009290543,0.0017288284,0.001117814,0.0042531164],"category_scores_gemma":[0.0041663554,0.0003835513,0.00046547697,0.0011371565,0.0010218852,0.0016408641,0.0010683206,0.0008979218,0.0008340716],"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.0006080018,0.00025386727,0.00094495504,0.00041576696,0.000092625116,0.00030040287,0.00053262495,0.5391026,0.01610424,0.11670362,0.01887452,0.30606678],"study_design_scores_gemma":[0.00018211926,0.00013840033,0.00016624297,0.000041251,0.000046211488,0.00020514488,0.00012801804,0.9213905,0.007423383,0.05324068,0.01700389,0.000034260825],"about_ca_topic_score_codex":0.0019557823,"about_ca_topic_score_gemma":0.0018527146,"teacher_disagreement_score":0.0042531164,"about_ca_system_score_codex":0.0016908402,"about_ca_system_score_gemma":0.0013906374,"threshold_uncertainty_score":0.014228106},"labels":[],"label_agreement":null},{"id":"W2035138544","doi":"10.1142/s0219265901000464","title":"HIGHER DIMENSIONAL HONEYCOMB NETWORKS","year":2001,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Honeycomb; Interconnection; Generalization; Honeycomb structure; Degree (music); Voronoi diagram; Hexagonal crystal system; Computer science; Materials science; Mathematics; Geometry; Physics; Telecommunications; Composite material; Mathematical analysis; Chemistry","score_opus":0.013946881794750452,"score_gpt":0.2327738769313161,"score_spread":0.21882699513656564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035138544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18819319,0.0043496247,0.6806831,0.0010528933,0.00080504024,0.00015248428,0.000519502,0.0008476752,0.123396635],"genre_scores_gemma":[0.8182459,0.002981124,0.15381478,0.0005036287,0.0002042212,0.00018257678,0.00047883706,0.000086118074,0.023502765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979144,0.00005016299,0.000011576183,0.00003741388,0.00006421961,0.00004522376],"domain_scores_gemma":[0.99966097,0.000085064115,0.000043155,0.00009108493,0.000075840864,0.000044010772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012842828,0.00022712024,0.00028336444,0.0005370757,0.0004545555,0.0012752429,0.0004818591,0.00058122096,0.0039826655],"category_scores_gemma":[0.0008289101,0.0001654635,0.0003365297,0.0004703155,0.0005513358,0.0014988048,0.0009339347,0.0005226987,0.00067223684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344851,0.00003119423,0.0005216536,0.00009045981,0.000019558343,0.00026870382,0.00012668363,0.046249837,0.007346204,0.9015117,0.005518258,0.038281318],"study_design_scores_gemma":[0.000019857576,0.00005800111,0.0007579412,0.000035183944,0.000015561052,0.000646844,0.000097205666,0.2844424,0.004891912,0.6427098,0.06629094,0.000034351313],"about_ca_topic_score_codex":0.0007059618,"about_ca_topic_score_gemma":0.0008752467,"teacher_disagreement_score":0.0039826655,"about_ca_system_score_codex":0.00032322103,"about_ca_system_score_gemma":0.0001700518,"threshold_uncertainty_score":0.013323307},"labels":[],"label_agreement":null},{"id":"W2035420994","doi":"10.1109/aspdac.2015.7058980","title":"A novel approach using a minimum cost maximum flow algorithm for fault-tolerant topology reconfiguration in NoC architectures","year":2015,"lang":"en","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Control reconfiguration; Spare part; Computer science; Network topology; Topology (electrical circuits); Fault tolerance; Maximum flow problem; Logical topology; Minimum-cost flow problem; Network on a chip; Distributed computing; Flow network; Algorithm; Embedded system; Computer network; Mathematical optimization; Engineering; Mathematics","score_opus":0.06941511974427564,"score_gpt":0.2886170239665886,"score_spread":0.21920190422231298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035420994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026940887,0.00010233435,0.9960438,0.000061741564,0.000033159573,0.00003224073,0.0000108147815,0.00022747323,0.00079440756],"genre_scores_gemma":[0.08203115,0.00017763009,0.91566443,0.00007724592,0.00005675114,0.0001666659,0.00009765096,0.00011460177,0.0016137377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.00009502968,0.000023192499,0.0000687952,0.00013415808,0.000036487374],"domain_scores_gemma":[0.9996573,0.00015858945,0.000041061696,0.000038017897,0.000085429,0.000019607036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052346825,0.0008893158,0.0007870203,0.0011436412,0.00065866887,0.0007728084,0.0013191138,0.0010877516,0.0024615675],"category_scores_gemma":[0.0013899965,0.000449909,0.0005924656,0.00095508056,0.0004185259,0.0014364811,0.00070787064,0.0009714734,0.0004126317],"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.00012948684,0.00017186641,0.00036168657,0.0001935524,0.00007539486,0.00013325401,0.00009238981,0.5535822,0.019555017,0.032321043,0.0037320727,0.38965204],"study_design_scores_gemma":[0.000018847926,0.000044391014,0.00005016651,0.000007598855,0.000009077724,0.000048420137,0.00000792571,0.9897597,0.0020557267,0.006081241,0.0019065628,0.000010293083],"about_ca_topic_score_codex":0.0015287815,"about_ca_topic_score_gemma":0.0017862344,"teacher_disagreement_score":0.0024615675,"about_ca_system_score_codex":0.0007582703,"about_ca_system_score_gemma":0.00082540733,"threshold_uncertainty_score":0.008234799},"labels":[],"label_agreement":null},{"id":"W2035607164","doi":"10.1504/ijcnds.2008.020258","title":"Low jitter guaranteed-rate communications for cluster computing systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Networks and Distributed Systems","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"","keywords":"Computer science; Jitter; Cluster (spacecraft); Computer network; Telecommunications; Real-time computing","score_opus":0.0254555375885376,"score_gpt":0.27185076865052865,"score_spread":0.24639523106199104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035607164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088546835,0.0054499237,0.9658974,0.001161911,0.0006546891,0.00013011556,0.000099788194,0.0026316375,0.015119833],"genre_scores_gemma":[0.52186996,0.0068349247,0.44541815,0.00052152557,0.0011030209,0.0005084152,0.0004986332,0.000734935,0.022510363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991844,0.0002445161,0.000037180656,0.000071876086,0.00039339252,0.00006854762],"domain_scores_gemma":[0.9987552,0.0005286997,0.0000935224,0.00026768504,0.00028995037,0.00006489918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058405,0.0006420886,0.00048319757,0.00056952535,0.0010373208,0.0019786356,0.0010903002,0.00086407247,0.004574485],"category_scores_gemma":[0.004615308,0.0002548414,0.00022205932,0.0010911407,0.0006124761,0.0011509313,0.00093996094,0.0013352055,0.0016702716],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031391083,0.000058316426,0.00059805263,0.00049493526,0.000034590375,0.0002590177,0.00024746242,0.18480867,0.0141061125,0.49394065,0.037343413,0.2677949],"study_design_scores_gemma":[0.00004775916,0.00008884216,0.00024881776,0.0000823134,0.000022719907,0.00017577533,0.000043213025,0.80842286,0.0068771555,0.109327376,0.07462369,0.000039518814],"about_ca_topic_score_codex":0.0017633598,"about_ca_topic_score_gemma":0.0022408757,"teacher_disagreement_score":0.004574485,"about_ca_system_score_codex":0.0013837947,"about_ca_system_score_gemma":0.0015257413,"threshold_uncertainty_score":0.015303135},"labels":[],"label_agreement":null},{"id":"W2035709574","doi":"10.1145/2512429","title":"Designing on-chip networks for throughput accelerators","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center; National Research Foundation of Korea; National IT Industry Promotion Agency; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Computer science; Dram; Throughput; Network on a chip; Embedded system; Bandwidth (computing); Parallel computing; Graphics processing unit; Chip; Computer architecture; Computer hardware; Computer network; Operating system; Wireless","score_opus":0.019053741046177793,"score_gpt":0.2342818736979202,"score_spread":0.2152281326517424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035709574","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20451772,0.0019177111,0.7638718,0.0011948165,0.00034203872,0.00032859584,0.00019249092,0.0026708695,0.024963945],"genre_scores_gemma":[0.755731,0.00111121,0.23589663,0.00034571165,0.0000841493,0.0002254909,0.00023840631,0.00021021273,0.006157181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00010378583,0.000014517519,0.000042144027,0.000113234724,0.000084339306],"domain_scores_gemma":[0.99951684,0.000137299,0.000091911075,0.000071824325,0.00014219753,0.00004004907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055827666,0.0004565785,0.00029418844,0.0003890807,0.0004559133,0.00084270135,0.0012205795,0.00046947543,0.002597804],"category_scores_gemma":[0.0012983833,0.0003469821,0.0002184569,0.000407144,0.0003205399,0.0011673344,0.00056543434,0.00047993456,0.0005584885],"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.00027505038,0.00021319799,0.003585148,0.00040893903,0.00011816701,0.00019540594,0.00017075661,0.7128719,0.06994476,0.047047146,0.010876649,0.15429297],"study_design_scores_gemma":[0.000036874837,0.0002806118,0.0010139686,0.000033552038,0.000051895095,0.00007437203,0.000113665286,0.9470239,0.019885238,0.01264008,0.018824534,0.0000213369],"about_ca_topic_score_codex":0.0018998275,"about_ca_topic_score_gemma":0.005133115,"teacher_disagreement_score":0.002597804,"about_ca_system_score_codex":0.0010364022,"about_ca_system_score_gemma":0.00086409017,"threshold_uncertainty_score":0.008690536},"labels":[],"label_agreement":null},{"id":"W2037231037","doi":"10.1109/iccchina.2012.6356997","title":"Performance evaluation of three Network-on-Chip (NoC) architectures (Invited)","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Hypercube; Interconnection; Network on a chip; Scalability; Latency (audio); Grid network; System on a chip; Network topology; Microprocessor; Parallel computing; Computer network; Embedded system; Telecommunications","score_opus":0.05176820587926124,"score_gpt":0.26884750641718846,"score_spread":0.21707930053792723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037231037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9780954,0.001753583,0.010662297,0.0001273049,0.000091548194,0.00014675822,0.00083599344,0.00061597367,0.0076710545],"genre_scores_gemma":[0.99098736,0.00046964406,0.006600646,0.000021663065,0.000013583654,0.0000713377,0.00077276706,0.000039721774,0.0010232321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986665,0.00025496393,0.000105452425,0.00015586284,0.0005918666,0.00022524747],"domain_scores_gemma":[0.99682033,0.0011319931,0.0003814577,0.00026342453,0.0011920112,0.00021079471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644044,0.0009897377,0.0006215394,0.0013590669,0.0004888335,0.00078298873,0.00077738933,0.0006125184,0.0021170448],"category_scores_gemma":[0.0029146967,0.0001638817,0.0004047864,0.0016156881,0.00037577498,0.0007257485,0.000468034,0.0002984711,0.00027388142],"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.0044059237,0.0010524894,0.02010959,0.0014403724,0.0003251669,0.0005140643,0.00018740734,0.7390933,0.08428304,0.0025050447,0.004008685,0.14207494],"study_design_scores_gemma":[0.00011464738,0.0070375097,0.017381424,0.00005040823,0.00022129125,0.000362133,0.00016387294,0.8824036,0.08825491,0.000925233,0.0030094415,0.00007553948],"about_ca_topic_score_codex":0.0025608721,"about_ca_topic_score_gemma":0.002090598,"teacher_disagreement_score":0.0025608721,"about_ca_system_score_codex":0.0011739917,"about_ca_system_score_gemma":0.00048569604,"threshold_uncertainty_score":0.008517921},"labels":[],"label_agreement":null},{"id":"W2037748535","doi":"10.5555/2555692.2555698","title":"Embedded supercomputing in FPGAs with the VectorBlox MXP matrix processor","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Verilog; Supercomputer; Embedded system; Computer hardware; Computer architecture","score_opus":0.005729434201983001,"score_gpt":0.21077512080960834,"score_spread":0.20504568660762534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037748535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19643252,0.0021072065,0.6087855,0.00094007293,0.0003666568,0.00032376425,0.0007958742,0.027160546,0.16308786],"genre_scores_gemma":[0.54761565,0.0007953145,0.413881,0.0002393794,0.00010993064,0.00018158877,0.0012723661,0.0005429564,0.03536178],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973744,0.000056301065,0.000014583447,0.000039955085,0.000119591954,0.000032232834],"domain_scores_gemma":[0.9998091,0.000039449696,0.000017215783,0.000049977454,0.000057975416,0.000026415579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027136435,0.00041091512,0.00015159282,0.00051567325,0.00025158658,0.0006951072,0.0006234296,0.00019648085,0.010114043],"category_scores_gemma":[0.0005923166,0.00020972505,0.00013854798,0.00064667675,0.00022629992,0.0007040389,0.0004701647,0.0004533959,0.0025359024],"study_design_candidate":"bench_or_experimental","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.0013473285,0.00028716456,0.006981594,0.00042504328,0.00009961929,0.00084408355,0.000516739,0.06482966,0.14711577,0.107443415,0.105020896,0.5650887],"study_design_scores_gemma":[0.00036017882,0.0012422585,0.006377027,0.00013439442,0.000056617115,0.0011926056,0.00018611278,0.54284734,0.12182341,0.01806959,0.30760917,0.000101262674],"about_ca_topic_score_codex":0.0016490199,"about_ca_topic_score_gemma":0.0023942923,"teacher_disagreement_score":0.010114043,"about_ca_system_score_codex":0.0005243214,"about_ca_system_score_gemma":0.00043651974,"threshold_uncertainty_score":0.033834875},"labels":[],"label_agreement":null},{"id":"W2038675933","doi":"10.1016/j.compeleceng.2013.06.004","title":"Multi-hop communications on wireless network-on-chip using optimized phased-array antennas","year":2013,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Iran Telecommunication Research Center","keywords":"Wireless; Phased array; Chip; Hop (telecommunications); Computer science; Electronic engineering; Telecommunications; Engineering; Antenna (radio)","score_opus":0.028582885759264227,"score_gpt":0.2475793822362835,"score_spread":0.21899649647701927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038675933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25947842,0.0009050189,0.719542,0.0005161552,0.00020299047,0.000041015388,0.000103475184,0.0011057929,0.018105155],"genre_scores_gemma":[0.8787805,0.0002851944,0.11600197,0.00010835035,0.000047809724,0.0000318626,0.0000730794,0.0000451877,0.004626192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.00007954348,0.0000083116065,0.000026527709,0.000072877876,0.00002983811],"domain_scores_gemma":[0.99974686,0.00010074686,0.000029832307,0.00003998836,0.000071667186,0.000010972191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015395194,0.00031885624,0.00030875934,0.00019690694,0.00021303314,0.0005053407,0.0003481924,0.0003143993,0.0016886427],"category_scores_gemma":[0.00048234695,0.00017020007,0.00015549897,0.00031786677,0.0001392769,0.0005393503,0.00030864362,0.00028749584,0.00037866912],"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.0005464779,0.00022731586,0.0020491837,0.00017058667,0.00016069242,0.00021462496,0.00010367317,0.4811445,0.26723433,0.037132815,0.0070935483,0.20392221],"study_design_scores_gemma":[0.000026696694,0.00018499835,0.00042601617,0.000008618369,0.00003246663,0.00009227551,0.000023524592,0.9574434,0.034582715,0.0037927825,0.0033680843,0.000018364282],"about_ca_topic_score_codex":0.00038810345,"about_ca_topic_score_gemma":0.0018329605,"teacher_disagreement_score":0.0016886427,"about_ca_system_score_codex":0.00034351574,"about_ca_system_score_gemma":0.00031834262,"threshold_uncertainty_score":0.00564903},"labels":[],"label_agreement":null},{"id":"W2039231323","doi":"10.1007/s10617-008-9031-1","title":"CAD tool for hardware software co-synthesis of heterogeneous multiple processor embedded architectures","year":2008,"lang":"en","type":"article","venue":"Design Automation for Embedded Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multiprocessing; Parallel computing; Scheduling (production processes); Network topology; Software; Embedded system; Hypercube; MPSoC; Encoder; High-level synthesis; Computer architecture; Distributed computing; Topology (electrical circuits); Field-programmable gate array; Computer network; Operating system","score_opus":0.04081424692975949,"score_gpt":0.2669109783302871,"score_spread":0.2260967314005276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039231323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007183415,0.00022822543,0.97200656,0.00005919268,0.00009556691,0.00011822092,0.00036111352,0.010541772,0.009405995],"genre_scores_gemma":[0.18154937,0.00040683046,0.8051846,0.00014732132,0.000042834447,0.00071247516,0.0014383954,0.0020539183,0.008464262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959916,0.00007126827,0.000026439995,0.000041387815,0.00021189237,0.000049855767],"domain_scores_gemma":[0.99940336,0.00028455633,0.000038176982,0.000098559925,0.00015865096,0.000016672262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551237,0.00085602095,0.0006379274,0.00090478075,0.00044096718,0.00070023554,0.0011060417,0.0007124185,0.015221652],"category_scores_gemma":[0.0014139458,0.0007533872,0.0007425227,0.0005715594,0.00026141628,0.00047604056,0.0004498029,0.0011622594,0.0018478885],"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.00024237795,0.00015842171,0.0011114331,0.000968679,0.00017959444,0.00057209464,0.00026183398,0.4073186,0.077313304,0.051544663,0.032391813,0.42793724],"study_design_scores_gemma":[0.00015271587,0.0001804542,0.00046795543,0.000084434934,0.00008085333,0.00032704527,0.000033852575,0.8835721,0.04563572,0.010350998,0.05907571,0.000038124937],"about_ca_topic_score_codex":0.0020597351,"about_ca_topic_score_gemma":0.0035863635,"teacher_disagreement_score":0.015221652,"about_ca_system_score_codex":0.00047727846,"about_ca_system_score_gemma":0.0011420959,"threshold_uncertainty_score":0.0509215},"labels":[],"label_agreement":null},{"id":"W2039459165","doi":"10.1109/mcsoc.2015.12","title":"Dynamic VC Organization for Efficient NoC Communication","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Virtual channel; Queue; Throughput; Computer network; Port (circuit theory); Architecture; Key (lock); Queueing theory; Embedded system; Computer architecture; Distributed computing; Wireless; Operating system; Engineering; Telecommunications","score_opus":0.019487411086779434,"score_gpt":0.24857505381220685,"score_spread":0.22908764272542742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039459165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1050644,0.0011067333,0.8834903,0.00018904585,0.00019942633,0.00012424609,0.000103668826,0.0016426774,0.008079552],"genre_scores_gemma":[0.8509119,0.00034088152,0.14465162,0.00012959792,0.000060282422,0.00011988431,0.00015940086,0.000075758486,0.0035506834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997434,0.000049801085,0.000021043674,0.000044404856,0.000077175086,0.00006405207],"domain_scores_gemma":[0.99959487,0.00008433758,0.000054139527,0.0000647631,0.00016534353,0.000036577097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033400877,0.00026740198,0.00024266001,0.000674399,0.0005098811,0.00062878075,0.00082003325,0.0002517334,0.0017546279],"category_scores_gemma":[0.0006398756,0.00016530423,0.00016140631,0.0005354418,0.00027332918,0.00073310465,0.00052365236,0.00034280794,0.00023983407],"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.00027720575,0.00019055908,0.003127184,0.00041864463,0.00006910483,0.00035832764,0.00030198536,0.1553088,0.37336612,0.08530394,0.0066011017,0.3746771],"study_design_scores_gemma":[0.000049884817,0.00032337682,0.0011890142,0.000037991034,0.00005070979,0.00035793628,0.000090636335,0.8470697,0.11308544,0.014710522,0.022981893,0.000052930962],"about_ca_topic_score_codex":0.001184047,"about_ca_topic_score_gemma":0.002246981,"teacher_disagreement_score":0.0017546279,"about_ca_system_score_codex":0.0007270118,"about_ca_system_score_gemma":0.0009957047,"threshold_uncertainty_score":0.0058698654},"labels":[],"label_agreement":null},{"id":"W2041436280","doi":"10.1109/isqed.2012.6187557","title":"Analysis and evaluation of greedy thread swapping based dynamic power management for MPSoC platforms","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"MPSoC; Frequency scaling; Computer science; Thread (computing); Power management; Power budget; Embedded system; Parallel computing; Field-programmable gate array; System on a chip; Power (physics); Voltage; Electric power system; Operating system; Engineering","score_opus":0.03066029500228371,"score_gpt":0.29645584185717416,"score_spread":0.26579554685489043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041436280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6303263,0.000778579,0.36365563,0.00017432835,0.000034374687,0.00010593058,0.000037359197,0.0010755893,0.003811861],"genre_scores_gemma":[0.9674209,0.00007832999,0.032123737,0.000016119864,0.000005066316,0.000026908378,0.000022854665,0.000033643944,0.0002724623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992072,0.00025535605,0.000036897643,0.00008017453,0.0003222248,0.000098165394],"domain_scores_gemma":[0.9979061,0.0012456153,0.00022844122,0.0002142273,0.00034167964,0.00006401622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924349,0.00060790934,0.00040493655,0.00043276843,0.00022301497,0.00042587667,0.00071464584,0.00032270682,0.0006177751],"category_scores_gemma":[0.004234886,0.0001580284,0.00022921759,0.00042319373,0.00043024222,0.00051657844,0.00028204187,0.00030109452,0.00006517953],"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.00031702587,0.000090590496,0.0020511923,0.00014504194,0.000039871244,0.000064077365,0.000050181305,0.8875044,0.04199212,0.0043704095,0.00034987574,0.06302522],"study_design_scores_gemma":[0.000009097843,0.00009185131,0.00026849585,0.0000021740655,0.000007508617,0.000013155168,0.0000074250747,0.9925608,0.0065868245,0.00031458613,0.000135774,0.0000022981942],"about_ca_topic_score_codex":0.0016307863,"about_ca_topic_score_gemma":0.0012270304,"teacher_disagreement_score":0.0016307863,"about_ca_system_score_codex":0.00080401584,"about_ca_system_score_gemma":0.0010328453,"threshold_uncertainty_score":0.005833626},"labels":[],"label_agreement":null},{"id":"W2046105216","doi":"10.1109/mm.2013.131","title":"The Case for Embedded Networks on Chip on Field-Programmable Gate Arrays","year":2014,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"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":"Field-programmable gate array; Computer science; Embedded system; Compiler; Interconnection; Reconfigurable computing; Computer architecture; Interface (matter); System on a chip; Computer hardware; Parallel computing; Operating system; Computer network","score_opus":0.01603753696633828,"score_gpt":0.2480177592848653,"score_spread":0.23198022231852702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046105216","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01220387,0.05562327,0.107133366,0.28406423,0.018592589,0.0001285013,0.00025306075,0.0009219733,0.52107924],"genre_scores_gemma":[0.40014258,0.08645791,0.12479764,0.07732469,0.015627813,0.0004721668,0.0003314877,0.00048678904,0.29435894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878556,0.00030291633,0.000037497626,0.00019965394,0.0005213415,0.00015294543],"domain_scores_gemma":[0.9981881,0.00073553866,0.000121514495,0.00040174832,0.0003770065,0.00017621087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001521586,0.00035899255,0.0003071012,0.0003510217,0.0011294704,0.0029637292,0.0011100301,0.0043617855,0.014142058],"category_scores_gemma":[0.0041896203,0.00027885844,0.0003081594,0.00044420717,0.0017939722,0.006999601,0.0015597214,0.0046733087,0.004720336],"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.00005043868,0.000037431546,0.0006362881,0.00036245096,0.000018284902,0.0013683805,0.00023139169,0.0018039538,0.0024123746,0.7913371,0.11498754,0.08675439],"study_design_scores_gemma":[0.000013336384,0.00003381422,0.00032558243,0.0002591095,0.000009672316,0.001369841,0.00022950927,0.0031365335,0.0008077347,0.12927666,0.86451805,0.00002017003],"about_ca_topic_score_codex":0.0014154089,"about_ca_topic_score_gemma":0.0024305983,"teacher_disagreement_score":0.014142058,"about_ca_system_score_codex":0.00082089374,"about_ca_system_score_gemma":0.000762263,"threshold_uncertainty_score":0.047309935},"labels":[],"label_agreement":null},{"id":"W2046170949","doi":"10.1142/s0218126610006347","title":"INFLUENCE OF TRAFFIC CORRELATION ON THE PERFORMANCE OF NETWORK-ON-CHIP DESIGNS","year":2010,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Network on a chip; Computer science; Traffic generation model; Point (geometry); Chip; Poisson distribution; Bernoulli's principle; System on a chip; Embedded system; Engineering; Computer network; Telecommunications; Mathematics","score_opus":0.0175064226868097,"score_gpt":0.21157916318156383,"score_spread":0.19407274049475415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046170949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98223454,0.00055998086,0.015171584,0.0001285145,0.000026812259,0.000022876728,0.00006533738,0.00022676706,0.0015636514],"genre_scores_gemma":[0.9976794,0.00012769093,0.0019898077,0.000016007427,0.000009982145,0.000008636875,0.00004639927,0.000024680543,0.00009741415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664825,0.0014838517,0.00020545127,0.00031519853,0.00094527326,0.00040196837],"domain_scores_gemma":[0.9689446,0.021475585,0.0043792073,0.0020175218,0.0026529955,0.0005300696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031758707,0.00077181635,0.0005171854,0.00076017895,0.0004542302,0.0007376141,0.0005478698,0.00046528736,0.00048399274],"category_scores_gemma":[0.019402724,0.00042544634,0.00022844263,0.0008976426,0.00046486637,0.0010090037,0.00049480365,0.0005264372,0.00016938604],"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.0008759437,0.00020992315,0.020969631,0.0001230955,0.00009714605,0.0004520118,0.00008160781,0.90384364,0.033916824,0.0017012527,0.00054502755,0.03718391],"study_design_scores_gemma":[0.000030525047,0.0007981139,0.0081554875,0.000021312315,0.00010484868,0.00040043207,0.000055141936,0.9321036,0.056905083,0.00093637145,0.0004586952,0.000030314259],"about_ca_topic_score_codex":0.0008237978,"about_ca_topic_score_gemma":0.0009147823,"teacher_disagreement_score":0.0031758707,"about_ca_system_score_codex":0.0009144141,"about_ca_system_score_gemma":0.000994278,"threshold_uncertainty_score":0.016795814},"labels":[],"label_agreement":null},{"id":"W2046276825","doi":"10.1016/j.camwa.2005.03.017","title":"Applying fault-tolerant solutions of circulant graphs to multidimensional meshes","year":2005,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Circulant matrix; Polygon mesh; Circulant graph; Fault tolerance; Graph; Mathematics; Degree (music); Computer science; Node (physics); Theoretical computer science; Algorithm; Distributed computing; Line graph; Voltage graph; Geometry","score_opus":0.020721715930032605,"score_gpt":0.2413841866759612,"score_spread":0.2206624707459286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046276825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12375293,0.00036105845,0.86305475,0.00064873707,0.00047702985,0.00007710393,0.000036099027,0.00041830484,0.011173977],"genre_scores_gemma":[0.832513,0.0003867389,0.16238557,0.00018975054,0.00010665074,0.00007083046,0.00005536483,0.000086773114,0.004205358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998128,0.00006752855,0.000010369092,0.000025450508,0.000053270374,0.000030668765],"domain_scores_gemma":[0.99947137,0.00021769501,0.00006184552,0.00009584186,0.00011184155,0.000041419797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033028936,0.00048306724,0.00056662725,0.0007781668,0.00065312086,0.00082055706,0.00082084053,0.0009399645,0.002352653],"category_scores_gemma":[0.0031355585,0.0002359524,0.00044565237,0.00063534384,0.0006052843,0.00070991257,0.0012953547,0.00065055484,0.00021839091],"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.00016383601,0.000078746845,0.00039366027,0.00013884746,0.000047029735,0.0002055219,0.00018840336,0.7400321,0.018049566,0.15918145,0.0021648963,0.0793559],"study_design_scores_gemma":[0.000017759387,0.000036966998,0.000048647657,0.000008863444,0.0000067835554,0.000025968711,0.000040697763,0.930553,0.0022597702,0.06582125,0.0011732345,0.0000069757057],"about_ca_topic_score_codex":0.0024578366,"about_ca_topic_score_gemma":0.0026418024,"teacher_disagreement_score":0.0024578366,"about_ca_system_score_codex":0.00066043396,"about_ca_system_score_gemma":0.00054617104,"threshold_uncertainty_score":0.007870436},"labels":[],"label_agreement":null},{"id":"W2046692948","doi":"10.1016/j.jda.2004.04.004","title":"Computing input multiplicity in anonymous synchronous networks with dynamic faults","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypercube; Multiplicity (mathematics); Computer science; Discrete mathematics; Function (biology); Network topology; Parity (physics); Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Parallel computing; Computer network","score_opus":0.005700822171285885,"score_gpt":0.23666292599654382,"score_spread":0.23096210382525792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046692948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383973,0.00014520624,0.45655823,0.00053194887,0.00011336274,0.00006344293,0.0001429759,0.0012319164,0.002815686],"genre_scores_gemma":[0.96029663,0.00004688295,0.038385674,0.000034145465,0.000036164438,0.000027490607,0.00006737367,0.0000748095,0.0010308452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.00042569562,0.000120082404,0.00036361755,0.00038892045,0.00028917912],"domain_scores_gemma":[0.98213446,0.0118689835,0.0016676693,0.0020400903,0.0013419697,0.0009468393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481187,0.0006779178,0.0014978017,0.0013028652,0.0012301854,0.0028347056,0.0020602567,0.0011166938,0.0023994767],"category_scores_gemma":[0.020005904,0.00061845395,0.00052016287,0.0014761686,0.0014455367,0.005477477,0.0028989813,0.0013242667,0.00024396634],"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.0017915906,0.00017796023,0.006505658,0.00014204622,0.000072046714,0.0003343758,0.0002992003,0.88078576,0.0052911155,0.055234548,0.0013469955,0.0480187],"study_design_scores_gemma":[0.000030961917,0.00005047032,0.00020553739,0.000005403638,0.00001432292,0.000029779281,0.000045833607,0.96047795,0.0024589554,0.036528874,0.00014273757,0.00000908318],"about_ca_topic_score_codex":0.0016255511,"about_ca_topic_score_gemma":0.0026242237,"teacher_disagreement_score":0.0028347056,"about_ca_system_score_codex":0.0017549052,"about_ca_system_score_gemma":0.0010182293,"threshold_uncertainty_score":0.013121963},"labels":[],"label_agreement":null},{"id":"W2047736902","doi":"10.1080/17445760903225700","title":"A (4<i>n</i> − 9)/3 diagnosis algorithm for generalised cube networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Hypercube; Multiprocessing; Computer science; Cube (algebra); Algorithm; Set (abstract data type); Component (thermodynamics); Mathematics; Combinatorics; Parallel computing","score_opus":0.014032721603146303,"score_gpt":0.2623787811987453,"score_spread":0.248346059595599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047736902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020613475,0.00013599504,0.97403777,0.00032746716,0.000051530147,0.00018051155,0.00010451133,0.0017852078,0.0027635433],"genre_scores_gemma":[0.14186057,0.0000923639,0.85508734,0.00013029086,0.000020098343,0.00018849748,0.0003235532,0.000119217664,0.0021781113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995074,0.00008804249,0.000054821885,0.00012872931,0.00013367769,0.00008732701],"domain_scores_gemma":[0.9987386,0.000662085,0.00012564087,0.000201588,0.00020184461,0.00007039129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743095,0.0007669101,0.0005519841,0.00080974086,0.00067755644,0.0007992153,0.0012336234,0.0010157673,0.004530128],"category_scores_gemma":[0.003030813,0.00030257707,0.0006591703,0.0006809835,0.0007488975,0.0014989967,0.0017020815,0.0010400708,0.0008290325],"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.0005278511,0.00014457977,0.002731394,0.00041043392,0.00008699736,0.0004183834,0.00041305617,0.22898357,0.024160191,0.036337327,0.010678171,0.69510806],"study_design_scores_gemma":[0.00013312256,0.00013563507,0.000484825,0.000029582607,0.000034140743,0.00044492545,0.00012717482,0.9440832,0.0121946195,0.037175156,0.005122194,0.000035307763],"about_ca_topic_score_codex":0.0047784843,"about_ca_topic_score_gemma":0.006498436,"teacher_disagreement_score":0.0047784843,"about_ca_system_score_codex":0.0012127825,"about_ca_system_score_gemma":0.0017491332,"threshold_uncertainty_score":0.015154779},"labels":[],"label_agreement":null},{"id":"W2047772825","doi":"10.1006/jpdc.2001.1812","title":"A Parallel Algorithm for Lagrange Interpolation on the Star Graph","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Initialization; Algorithm; Computation; Star (game theory); Lagrange polynomial; Interpolation (computer graphics); Multiplication (music); Graph; Parallel computing; Theoretical computer science; Mathematics; Class (philosophy)","score_opus":0.031095339842299796,"score_gpt":0.24343438412987287,"score_spread":0.21233904428757308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047772825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004360712,0.000060715087,0.9933123,0.00008967744,0.000067303605,0.000043409906,0.000051869007,0.00046284893,0.0015511455],"genre_scores_gemma":[0.058511112,0.00010279248,0.9369697,0.000056978985,0.000059734877,0.00013569927,0.00020828673,0.00024315983,0.003712597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.00012405112,0.000023390616,0.00009012869,0.0001596991,0.000060501057],"domain_scores_gemma":[0.99918073,0.00036317535,0.000035885972,0.00016794755,0.00019288145,0.000059482903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507001,0.00078843004,0.0013587355,0.0011102706,0.000938107,0.00080391,0.0018099119,0.00093248975,0.0092824465],"category_scores_gemma":[0.0026099514,0.0006128314,0.0009375017,0.0018448286,0.0007544664,0.0015005578,0.00242259,0.0018450632,0.0022054361],"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.00057205063,0.0002116853,0.0006848118,0.00019599257,0.00010489367,0.00015674457,0.0001922033,0.32701918,0.008551396,0.113151014,0.011744279,0.5374158],"study_design_scores_gemma":[0.00009567458,0.000059074122,0.00008411305,0.0000097546745,0.000013341237,0.00004086937,0.000024529305,0.9540817,0.0020761564,0.039645895,0.0038532978,0.00001555441],"about_ca_topic_score_codex":0.006565074,"about_ca_topic_score_gemma":0.009356464,"teacher_disagreement_score":0.0092824465,"about_ca_system_score_codex":0.00081107643,"about_ca_system_score_gemma":0.0018609928,"threshold_uncertainty_score":0.031052828},"labels":[],"label_agreement":null},{"id":"W2047788454","doi":"10.1109/hpcc.2014.188","title":"Two New Multicast Algorithms in 3D Mesh and Torus Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Computer network; Distributed computing; Source-specific multicast; Xcast; Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Algorithm; Scalability; Shortest path problem; Parallel computing; Theoretical computer science; Graph","score_opus":0.01295150233348884,"score_gpt":0.2430024045768433,"score_spread":0.23005090224335445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047788454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016867632,0.00075757573,0.9762657,0.00045737994,0.00020325245,0.00015754031,0.000099764766,0.00050362584,0.004687463],"genre_scores_gemma":[0.13367204,0.00081218814,0.8594939,0.00030648604,0.0001715531,0.00031911247,0.0002749984,0.00006349433,0.0048862617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949265,0.00013648366,0.000043651307,0.00007884634,0.00019327867,0.00005508967],"domain_scores_gemma":[0.99943894,0.0002085806,0.00007843323,0.00008582217,0.000152905,0.000035373738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069522223,0.00051408017,0.0005238241,0.0010152347,0.00069338636,0.0006328823,0.0012011245,0.0011412579,0.0016811803],"category_scores_gemma":[0.0020239835,0.00026757488,0.0006406087,0.0010243737,0.00043273566,0.001913069,0.001105673,0.0008247922,0.00028055476],"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.00043378372,0.00019377901,0.0015278297,0.00035067188,0.0000955113,0.00020174036,0.00029183342,0.18430254,0.017529877,0.18182337,0.013716281,0.59953284],"study_design_scores_gemma":[0.00013764542,0.00028362093,0.00053165335,0.000037654074,0.000044222234,0.00046765065,0.000110790694,0.90428716,0.008548234,0.056487914,0.029028295,0.000035127086],"about_ca_topic_score_codex":0.0011592308,"about_ca_topic_score_gemma":0.0014853892,"teacher_disagreement_score":0.0016811803,"about_ca_system_score_codex":0.0011262617,"about_ca_system_score_gemma":0.0008276938,"threshold_uncertainty_score":0.008171618},"labels":[],"label_agreement":null},{"id":"W2047797996","doi":"10.1016/j.dam.2003.04.003","title":"The average connectivity of a digraph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Tree (set theory); Discrete mathematics","score_opus":0.011225174986959772,"score_gpt":0.22210074871429863,"score_spread":0.21087557372733887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047797996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72282624,0.0014405175,0.24931136,0.0015246389,0.00015973316,0.00003703411,0.0013927225,0.00051272573,0.022794923],"genre_scores_gemma":[0.98170555,0.0012617344,0.01250328,0.00014501956,0.00021115177,0.000061258856,0.00061070913,0.00008157506,0.0034197716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995503,0.000112860704,0.000021732541,0.00016029454,0.00009185368,0.00006297714],"domain_scores_gemma":[0.99438226,0.0037362338,0.0006287458,0.00034675916,0.00041806058,0.00048795086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059391925,0.0005290925,0.00093079446,0.0023573842,0.00094312534,0.0022212965,0.0014074476,0.0009908245,0.003996953],"category_scores_gemma":[0.0065329117,0.0004558186,0.00046865182,0.0024176924,0.0013757907,0.003844402,0.0008746448,0.0009445745,0.000312985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019122263,0.00005761197,0.0049914406,0.00028080872,0.000115027906,0.0004068801,0.00051377545,0.14244975,0.0063665677,0.80315,0.005211071,0.036265764],"study_design_scores_gemma":[0.000028975612,0.00006794703,0.0027851788,0.000034437955,0.00006852875,0.0004400233,0.00013406061,0.26333675,0.0010999151,0.7284456,0.0035275477,0.00003115854],"about_ca_topic_score_codex":0.0016790088,"about_ca_topic_score_gemma":0.0016672036,"teacher_disagreement_score":0.003996953,"about_ca_system_score_codex":0.0010871321,"about_ca_system_score_gemma":0.0005203159,"threshold_uncertainty_score":0.01337111},"labels":[],"label_agreement":null},{"id":"W2048203318","doi":"10.1109/bsc.2010.5472932","title":"Control messages delivery protocol","year":2010,"lang":"en","type":"article","venue":"","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; Forward error correction; Error detection and correction; Selective Repeat ARQ; Automatic repeat request; Computer network; Hybrid automatic repeat request; Protocol (science); Mechanism (biology); Channel (broadcasting); Control (management); Word error rate; Real-time computing; Decoding methods; Telecommunications; Telecommunications link; Algorithm; Artificial intelligence","score_opus":0.006393500963431628,"score_gpt":0.23739724162527875,"score_spread":0.23100374066184712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048203318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086927805,0.004063645,0.8508973,0.0031034315,0.004039353,0.0046163406,0.003572471,0.014935933,0.106078744],"genre_scores_gemma":[0.20135118,0.009751258,0.52589214,0.004469315,0.0026041304,0.008109785,0.01341848,0.0018516891,0.23255198],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971814,0.0004084446,0.0003279878,0.00032946467,0.0014712042,0.0002815463],"domain_scores_gemma":[0.99738187,0.0005164242,0.00022361572,0.00049524836,0.0012083548,0.00017448526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001836145,0.0008253267,0.0007350704,0.0016922446,0.0012763604,0.002540061,0.0023397629,0.0018059245,0.017270295],"category_scores_gemma":[0.0047300817,0.00036887577,0.00039162062,0.0014576744,0.00065776904,0.0022558223,0.0023698807,0.0018632902,0.01048171],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077301223,0.00048978545,0.0009190022,0.0015424871,0.000120118704,0.0014427617,0.0006801201,0.007328522,0.044357184,0.16329752,0.21232753,0.566722],"study_design_scores_gemma":[0.00024535862,0.0003095465,0.00047352642,0.00020520743,0.00008240553,0.0012165138,0.00013419754,0.025928453,0.027253496,0.018474242,0.92557436,0.000102705286],"about_ca_topic_score_codex":0.0019094107,"about_ca_topic_score_gemma":0.0010635995,"teacher_disagreement_score":0.017270295,"about_ca_system_score_codex":0.0011849136,"about_ca_system_score_gemma":0.0017557298,"threshold_uncertainty_score":0.0577749},"labels":[],"label_agreement":null},{"id":"W2048279535","doi":"10.1145/2513228.2513310","title":"Fault-tolerant circulant digraphs networks","year":2013,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Circulant matrix; Digraph; Spare part; Node (physics); Computer science; Fault tolerance; Degree (music); Theoretical computer science; Distributed computing; Mathematics; Algorithm; Discrete mathematics; Engineering","score_opus":0.007466104014031573,"score_gpt":0.18960600798108648,"score_spread":0.1821399039670549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048279535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15652189,0.0005693428,0.8311662,0.00044430667,0.000168792,0.00007328344,0.00025231807,0.00049838744,0.010305393],"genre_scores_gemma":[0.88856566,0.00046270096,0.104398645,0.00018645346,0.00008847797,0.00008054989,0.0002513815,0.00005045955,0.00591568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996692,0.000100503064,0.000015454962,0.00007169914,0.000067721085,0.00007539337],"domain_scores_gemma":[0.9991381,0.00038908102,0.0001378893,0.00009764658,0.0001434492,0.000093766284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039432556,0.00054726435,0.00046920747,0.0005214879,0.000516628,0.0006500321,0.00097342033,0.00071630575,0.0019402667],"category_scores_gemma":[0.001513666,0.00020352865,0.00027354897,0.0008393256,0.00043508108,0.0007835511,0.00042158156,0.00045761006,0.0002911254],"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.0001572884,0.00008621398,0.00059479027,0.00016468913,0.00004265794,0.00063335866,0.000076619915,0.77661115,0.01506652,0.14274362,0.0037821576,0.060040887],"study_design_scores_gemma":[0.000022723769,0.00007281779,0.00015046081,0.0000074843765,0.000017667813,0.00014110471,0.000015509393,0.95191044,0.0020791404,0.042212464,0.003359754,0.0000104026685],"about_ca_topic_score_codex":0.0025884642,"about_ca_topic_score_gemma":0.0036130766,"teacher_disagreement_score":0.0025884642,"about_ca_system_score_codex":0.0009825854,"about_ca_system_score_gemma":0.0005736863,"threshold_uncertainty_score":0.0071291924},"labels":[],"label_agreement":null},{"id":"W2048460015","doi":"10.1016/s0012-365x(01)00180-7","title":"The average connectivity of a graph","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Discrete mathematics","score_opus":0.021246706973682777,"score_gpt":0.22796406053922214,"score_spread":0.20671735356553936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048460015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6651569,0.002931633,0.2994997,0.0030387444,0.00033820415,0.000046102232,0.001805839,0.00081515947,0.02636773],"genre_scores_gemma":[0.9792494,0.0021109232,0.013597539,0.0002077498,0.00053756183,0.00009009298,0.0008508129,0.00016046115,0.0031953503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00023775244,0.000037254104,0.00028326927,0.00016941984,0.00009043915],"domain_scores_gemma":[0.9907505,0.0064423964,0.0010263727,0.0006080222,0.0006112798,0.00056138524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081368943,0.0006799278,0.0011922158,0.0029265622,0.00096560956,0.0025206555,0.0017375778,0.0014697795,0.0046922173],"category_scores_gemma":[0.010166778,0.0005209369,0.00056321186,0.0030387957,0.002019058,0.0057789916,0.0011441697,0.0012346021,0.00048476798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022946017,0.000070491405,0.0056195003,0.00044271688,0.00016574151,0.0004050651,0.00057701196,0.14051205,0.00814627,0.7906434,0.0074703842,0.045717888],"study_design_scores_gemma":[0.0000268195,0.000080753656,0.0033698191,0.00004392502,0.00008457416,0.00053935597,0.00014453067,0.21368645,0.0015267053,0.775949,0.004509504,0.00003851063],"about_ca_topic_score_codex":0.0010895925,"about_ca_topic_score_gemma":0.0008698592,"teacher_disagreement_score":0.0046922173,"about_ca_system_score_codex":0.00095543603,"about_ca_system_score_gemma":0.0004510732,"threshold_uncertainty_score":0.015697062},"labels":[],"label_agreement":null},{"id":"W2048767501","doi":"10.1002/dac.505","title":"IP router architectures: an overview","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Router; Terabit; Computer network; Next-generation network; Throughput; The Internet; Core router; Interconnection; IP forwarding; Telecommunications; Routing (electronic design automation); Routing protocol; World Wide Web; Wireless; Wavelength-division multiplexing","score_opus":0.06361439239088819,"score_gpt":0.33882874125252754,"score_spread":0.27521434886163937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048767501","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016135639,0.6937252,0.20381531,0.002485989,0.0012517676,0.00020718787,0.00019620231,0.002090407,0.08009231],"genre_scores_gemma":[0.10572751,0.6865731,0.16664927,0.0012306,0.002458554,0.000323183,0.0009024568,0.00021977836,0.035915595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993648,0.0001016986,0.00007010819,0.00012233535,0.00026637525,0.00007474024],"domain_scores_gemma":[0.99944013,0.00013197554,0.000038375547,0.000031175572,0.00030278115,0.000055559292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096211216,0.00084945036,0.00048258217,0.0025904002,0.00045661657,0.002830109,0.0011326094,0.0019433082,0.0034489513],"category_scores_gemma":[0.00083831965,0.00084683957,0.00031249394,0.002796905,0.00034552568,0.004492859,0.0007831664,0.0012323017,0.002953239],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016078564,0.000177571,0.0022062776,0.002822892,0.00006838429,0.00037055416,0.00019726226,0.014263911,0.008197174,0.082199074,0.03181081,0.85752517],"study_design_scores_gemma":[0.000053245385,0.0006169659,0.0020055398,0.0016158666,0.00016216432,0.0026520572,0.00020699357,0.054384246,0.006150965,0.041135434,0.8909412,0.00007538637],"about_ca_topic_score_codex":0.00063850975,"about_ca_topic_score_gemma":0.00051952444,"teacher_disagreement_score":0.0034489513,"about_ca_system_score_codex":0.00053958636,"about_ca_system_score_gemma":0.0004941169,"threshold_uncertainty_score":0.0115379095},"labels":[],"label_agreement":null},{"id":"W2048808499","doi":"10.1145/1370256.1370293","title":"A new method for generating compressed representation of transitive closure","year":2008,"lang":"en","type":"article","venue":"","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 Winnipeg","funders":"","keywords":"Transitive closure; Combinatorics; Reachability; Digraph; Mathematics; Directed graph; Path (computing); Discrete mathematics; Transitive reduction; Node (physics); Bounded function; Transitive relation; Closure (psychology); Graph; Computer science; Physics; Line graph","score_opus":0.050890649370775316,"score_gpt":0.3230154300042722,"score_spread":0.2721247806334969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048808499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034849722,0.00030186606,0.9422986,0.00035948528,0.00021165109,0.00038311683,0.0035378947,0.014313984,0.0037437011],"genre_scores_gemma":[0.17200935,0.00022419456,0.8131104,0.00020706114,0.00013295839,0.0010415108,0.008384989,0.001108783,0.0037808218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884194,0.00012964552,0.000112903945,0.00020925472,0.00060421805,0.00010208137],"domain_scores_gemma":[0.99659204,0.0011035986,0.00028051986,0.0013856901,0.0005349923,0.00010328344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047507932,0.0008964835,0.00090108305,0.002081752,0.000661281,0.0014748143,0.0016046131,0.0005926591,0.0063285227],"category_scores_gemma":[0.0058108675,0.0006088176,0.00083176716,0.003183237,0.0006627628,0.0037985004,0.0017854288,0.001173749,0.0015364498],"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.0011288048,0.00032839147,0.0018031739,0.0005447245,0.00009798045,0.00062089565,0.0007355718,0.034186564,0.079635546,0.053876694,0.031612266,0.79542935],"study_design_scores_gemma":[0.00045281436,0.00061525573,0.0011777638,0.00014147305,0.00010709103,0.0014974566,0.00042367968,0.6794708,0.1526527,0.08481764,0.078479715,0.00016364182],"about_ca_topic_score_codex":0.0021528967,"about_ca_topic_score_gemma":0.0027595153,"teacher_disagreement_score":0.0063285227,"about_ca_system_score_codex":0.00081391935,"about_ca_system_score_gemma":0.0016042107,"threshold_uncertainty_score":0.021171033},"labels":[],"label_agreement":null},{"id":"W2049343987","doi":"10.1109/micro.2014.19","title":"Dodec: Random-Link, Low-Radix On-Chip Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Computer science; Router; Computer network; Scalability; Distributed computing; Topology (electrical circuits); Engineering","score_opus":0.009447924426987957,"score_gpt":0.21133832778427758,"score_spread":0.2018904033572896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049343987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14146543,0.00080619735,0.83284706,0.00053981575,0.00016722952,0.0002888952,0.00044354348,0.00330132,0.020140583],"genre_scores_gemma":[0.76633817,0.0004889947,0.22527431,0.00036858284,0.000042730895,0.00026174425,0.0006376033,0.00017634308,0.006411429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00008109987,0.000016283999,0.000054147175,0.000106021704,0.000051171734],"domain_scores_gemma":[0.99920505,0.00024375189,0.00013035195,0.00019195465,0.00018049056,0.000048469305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041217628,0.00032835914,0.00022686506,0.0004537366,0.00044455135,0.0005880943,0.0009393959,0.00031915156,0.0019558289],"category_scores_gemma":[0.0017873829,0.00018191141,0.00013360665,0.00036073395,0.00039578075,0.00075410487,0.00057575695,0.00048359798,0.00045428774],"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.00053205324,0.00028908162,0.0032535382,0.00048394178,0.00006752265,0.00042266946,0.00013018484,0.5219429,0.094383046,0.12021575,0.02092452,0.2373548],"study_design_scores_gemma":[0.000115773786,0.0006344797,0.00112617,0.000039702092,0.000041663498,0.0005273799,0.00007785809,0.84779596,0.06534543,0.031207634,0.053043276,0.00004469006],"about_ca_topic_score_codex":0.0005770483,"about_ca_topic_score_gemma":0.0017106509,"teacher_disagreement_score":0.0019558289,"about_ca_system_score_codex":0.00058934046,"about_ca_system_score_gemma":0.00043779865,"threshold_uncertainty_score":0.006542921},"labels":[],"label_agreement":null},{"id":"W2050463416","doi":"10.1142/s1793830915500093","title":"Searching for majority with k-tuple queries","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Interconnection Networks and Systems","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":"Carleton University","funders":"","keywords":"Oracle; Tuple; Computer science; Colored; Set (abstract data type); Sequence (biology); Theoretical computer science; Property (philosophy); Ball (mathematics); Algorithm; Mathematics; Discrete mathematics; Programming language","score_opus":0.03332369886006615,"score_gpt":0.2834356569589292,"score_spread":0.25011195809886305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050463416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21173985,0.0007504116,0.78048074,0.0012036513,0.000092340626,0.00023406191,0.00036760545,0.0031599205,0.0019713503],"genre_scores_gemma":[0.71696204,0.00019152234,0.2795125,0.00044499268,0.000118947275,0.00019237243,0.00071812765,0.00037658447,0.0014829163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091804,0.0029619152,0.0011316983,0.0018858778,0.0019209892,0.0011815435],"domain_scores_gemma":[0.9619114,0.027215935,0.0026377891,0.00525918,0.0022804402,0.0006952702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006763393,0.0014668774,0.0038628464,0.0013444383,0.0015388913,0.004053579,0.0044099772,0.0028051308,0.0026112527],"category_scores_gemma":[0.03880521,0.00090569584,0.0017781993,0.0018661319,0.0018249464,0.008809676,0.0047387388,0.0017989915,0.0013217523],"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.006139163,0.00092787086,0.024834847,0.0010816851,0.0007068901,0.0013100185,0.0023076464,0.38471738,0.0410908,0.06266193,0.008818546,0.4654032],"study_design_scores_gemma":[0.00019135285,0.00043166062,0.00080983306,0.000039957707,0.00013129308,0.00047539664,0.0005689801,0.8767795,0.022354664,0.096251026,0.0018917024,0.00007468258],"about_ca_topic_score_codex":0.0012720986,"about_ca_topic_score_gemma":0.0011014359,"teacher_disagreement_score":0.006763393,"about_ca_system_score_codex":0.000958863,"about_ca_system_score_gemma":0.0018154217,"threshold_uncertainty_score":0.035768688},"labels":[],"label_agreement":null},{"id":"W2050926039","doi":"10.1109/nocs.2014.7008785","title":"A novel non-minimal/minimal turn model for highly adaptive routing in 2D NoCs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Saskatchewan","funders":"","keywords":"Bottleneck; Computer science; Dependency (UML); Deadlock; Routing (electronic design automation); Network on a chip; Dependency graph; Distributed computing; Directed acyclic graph; Computer network; Parallel computing; Graph; Theoretical computer science; Embedded system; Algorithm","score_opus":0.03259003822288714,"score_gpt":0.24843856270841638,"score_spread":0.21584852448552924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050926039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16409613,0.00059648824,0.81616837,0.00029125458,0.000091469636,0.00005031303,0.00015746403,0.00025290667,0.01829558],"genre_scores_gemma":[0.94540673,0.00042582324,0.04885325,0.00009657526,0.000040856718,0.00008123514,0.00013822241,0.00004909768,0.0049081435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986625,0.00003111118,0.0000052127534,0.00003374414,0.0000345299,0.00002902736],"domain_scores_gemma":[0.99986684,0.000047093898,0.000023369017,0.00001817967,0.000020848463,0.000023698733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011243924,0.00040979087,0.0003147019,0.0003186873,0.00032843646,0.00062099256,0.0006004975,0.00054603023,0.0013307736],"category_scores_gemma":[0.00033749788,0.00021122415,0.00043373424,0.00018729494,0.00056293176,0.0006441867,0.00060709496,0.0004416003,0.00015100594],"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.000088757566,0.00004222617,0.00066104654,0.000068080706,0.000018354804,0.00039630954,0.00010312725,0.8507566,0.017828539,0.117690735,0.00080210983,0.011544172],"study_design_scores_gemma":[0.00001172309,0.000071424685,0.00015894738,0.000007929592,0.000012817494,0.00009433923,0.000023535107,0.967623,0.00130831,0.02849142,0.00218576,0.000010757261],"about_ca_topic_score_codex":0.0016315565,"about_ca_topic_score_gemma":0.002250319,"teacher_disagreement_score":0.0016315565,"about_ca_system_score_codex":0.0004671603,"about_ca_system_score_gemma":0.00039487478,"threshold_uncertainty_score":0.004451871},"labels":[],"label_agreement":null},{"id":"W2051443115","doi":"10.1016/j.sysarc.2013.09.001","title":"High performance NoC synthesis using analytical modeling and simulation with optimal power and minimal IC area","year":2013,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Tabu search; Deadlock; Network topology; Power (physics); Computer architecture; Process (computing); Computer engineering; Distributed computing; Parallel computing; Algorithm; Computer network","score_opus":0.016029207948177707,"score_gpt":0.22100770103324885,"score_spread":0.20497849308507116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051443115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24488296,0.00056635577,0.71887153,0.00053520943,0.00009602092,0.000114314025,0.00021874039,0.001363327,0.033351567],"genre_scores_gemma":[0.927771,0.00014450772,0.069647074,0.00004170587,0.000016830201,0.00007982308,0.0000724999,0.000114436414,0.0021121693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998342,0.000042144493,0.0000058890737,0.000017517912,0.000073255804,0.000027020178],"domain_scores_gemma":[0.9996556,0.0001718148,0.000047868485,0.000038994967,0.000075629985,0.000009975292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028837347,0.00047490158,0.00040347787,0.000411802,0.0003204223,0.00047866465,0.0006297214,0.0004601267,0.0016308157],"category_scores_gemma":[0.0012512304,0.000388662,0.00041943195,0.00038441006,0.00027101117,0.0006398924,0.00026091828,0.0003217229,0.00022513582],"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.000016733717,0.000018472561,0.00016878759,0.00002787024,0.000008453556,0.00002331559,0.000016343509,0.9867215,0.004002692,0.0041023837,0.00023390788,0.004659519],"study_design_scores_gemma":[0.0000036973802,0.000010513076,0.000029375751,0.00000173658,0.0000033715855,0.000004732775,0.0000026798002,0.99804014,0.0009361364,0.0007716949,0.0001944692,0.0000014846038],"about_ca_topic_score_codex":0.0035275766,"about_ca_topic_score_gemma":0.006015496,"teacher_disagreement_score":0.0035275766,"about_ca_system_score_codex":0.00088510884,"about_ca_system_score_gemma":0.0012288059,"threshold_uncertainty_score":0.007014096},"labels":[],"label_agreement":null},{"id":"W2051967074","doi":"10.1109/csitechnol.2013.6710338","title":"Broadcasting in the Kno&amp;#x00A8;del graph","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Graph; Combinatorics; Computer science; Mathematics; Discrete mathematics","score_opus":0.029122728272211174,"score_gpt":0.23712492948985248,"score_spread":0.2080022012176413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051967074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22260155,0.000932235,0.59837216,0.004474459,0.00032884895,0.00068491744,0.011498548,0.00893937,0.1521679],"genre_scores_gemma":[0.53122616,0.0013860676,0.29110023,0.0012159288,0.00012725077,0.0006075335,0.014428879,0.0023218528,0.15758611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909806,0.00013841804,0.0000383638,0.00030536347,0.00019435794,0.00022546346],"domain_scores_gemma":[0.99841475,0.0005374692,0.0002007521,0.00041446844,0.00028808095,0.00014447267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040006055,0.0005079178,0.00045932995,0.0008402338,0.0013267562,0.0017671181,0.0011020268,0.00064087776,0.016917577],"category_scores_gemma":[0.0026481182,0.00048281203,0.00043745682,0.0012167848,0.0008963716,0.0026385856,0.0011028649,0.0008046945,0.0038707166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014545465,0.00031247418,0.0024916306,0.0008580052,0.000074476215,0.0006757554,0.0010472509,0.10969283,0.019668933,0.47615352,0.13351087,0.25405976],"study_design_scores_gemma":[0.00020549493,0.0001980977,0.0023885653,0.00016768664,0.00007453287,0.0006150634,0.00079720916,0.26299027,0.023331603,0.36402455,0.34510672,0.00010014259],"about_ca_topic_score_codex":0.025719669,"about_ca_topic_score_gemma":0.032396264,"teacher_disagreement_score":0.025719669,"about_ca_system_score_codex":0.0027859968,"about_ca_system_score_gemma":0.0019417123,"threshold_uncertainty_score":0.056594968},"labels":[],"label_agreement":null},{"id":"W2052030919","doi":"10.1109/systems.2008.4519008","title":"System-Level Modeling of a NoC-Based H.264 Decoder","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"CMC Microsystems (Canada)","funders":"","keywords":"Computer science; Concurrency; Multiprocessing; Embedded system; Network on a chip; Computer architecture; Field-programmable gate array; Latency (audio); System on a chip; Key (lock); Architecture; Software; Parallel computing; Distributed computing; Operating system","score_opus":0.07040216740999194,"score_gpt":0.2371587828171946,"score_spread":0.16675661540720266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052030919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30313078,0.0007360663,0.6549196,0.00047489017,0.0000829092,0.00022924584,0.0009515256,0.001780002,0.03769501],"genre_scores_gemma":[0.9294881,0.00045894994,0.059496537,0.000095551855,0.000023307399,0.00020465232,0.00038696287,0.000106761116,0.009739144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998721,0.000030769876,0.0000069835028,0.000020348025,0.000052963056,0.000016774102],"domain_scores_gemma":[0.9998846,0.000039674156,0.000017091868,0.000012299438,0.000040023056,0.0000062697886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014995174,0.00035602023,0.00034794834,0.0002622638,0.0003317391,0.0004669529,0.0008409571,0.0005944901,0.002762326],"category_scores_gemma":[0.00039733257,0.0002341068,0.00039473758,0.00019738724,0.00033259415,0.00052968616,0.00020845154,0.000351131,0.00036632526],"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.000051179213,0.000016194088,0.00037422538,0.000041962707,0.000014848813,0.0001097879,0.000035299865,0.98112077,0.008339703,0.0061747045,0.00026800265,0.0034533862],"study_design_scores_gemma":[0.0000051543643,0.000025849507,0.00013458074,0.0000031135364,0.0000072226458,0.0000156778,0.000005464474,0.9975979,0.0010972937,0.00062660844,0.0004782342,0.000002956872],"about_ca_topic_score_codex":0.012005184,"about_ca_topic_score_gemma":0.008688581,"teacher_disagreement_score":0.012005184,"about_ca_system_score_codex":0.0007231692,"about_ca_system_score_gemma":0.00094591867,"threshold_uncertainty_score":0.023870587},"labels":[],"label_agreement":null},{"id":"W2052326735","doi":"10.1006/jpdc.2000.1625","title":"Optimal Broadcasting in Faulty Trees","year":2000,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Fault tolerance; Vulnerability (computing); Tree (set theory); Distributed computing; Algorithm; Upper and lower bounds; Computer network; Computer security; Mathematics; Combinatorics","score_opus":0.014055091223624768,"score_gpt":0.2458713300918413,"score_spread":0.23181623886821653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052326735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5878224,0.0031930218,0.36879936,0.0051147556,0.00042982254,0.00015241002,0.000610689,0.0011412312,0.032736246],"genre_scores_gemma":[0.943496,0.0011662563,0.046181235,0.00027518228,0.00021265047,0.00007622045,0.00033118445,0.00025498838,0.008006215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.0003336467,0.000047263617,0.00012898556,0.0002280952,0.00025483014],"domain_scores_gemma":[0.9859044,0.010653759,0.0008117398,0.0011164116,0.0008975108,0.0006160814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017665094,0.00055076304,0.0020235607,0.0013432301,0.0021071476,0.0021826178,0.0017977426,0.0016371094,0.0042607],"category_scores_gemma":[0.016765049,0.0009776801,0.000499366,0.002169279,0.002271036,0.0030435885,0.001992374,0.0015736348,0.0003996773],"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.002044567,0.00020037331,0.002363189,0.00048531865,0.00009640044,0.00029382214,0.00067135954,0.5376086,0.009206243,0.3673132,0.01772631,0.061990697],"study_design_scores_gemma":[0.00019654396,0.00007239536,0.0004309041,0.000034328335,0.000052258325,0.000090757196,0.00016405522,0.6247976,0.0018910033,0.37060097,0.0016515368,0.00001769559],"about_ca_topic_score_codex":0.005091954,"about_ca_topic_score_gemma":0.007448672,"teacher_disagreement_score":0.005091954,"about_ca_system_score_codex":0.003100892,"about_ca_system_score_gemma":0.0020442323,"threshold_uncertainty_score":0.022498608},"labels":[],"label_agreement":null},{"id":"W2053017877","doi":"","title":"Real-time Scheduling of Concurrent\\nTransactions in Multi-domain Ring Buses","year":2010,"lang":"en","type":"article","venue":"Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Testbed; Database transaction; Distributed computing; Parallel computing; Schedule; Concurrency; Concurrency control; Algorithm; Computer network; Mathematical optimization; Operating system; Mathematics; Programming language","score_opus":0.022934781337809972,"score_gpt":0.23940569261451966,"score_spread":0.2164709112767097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053017877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52423036,0.00048408133,0.4700573,0.00017951036,0.000057824152,0.0001015192,0.000053915155,0.0006123758,0.004223201],"genre_scores_gemma":[0.9206899,0.00016475908,0.07732393,0.000019183102,0.00001627268,0.00005180989,0.000054414177,0.000029551593,0.0016502241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997478,0.000076309334,0.000015250822,0.000053897787,0.000044456112,0.00006231169],"domain_scores_gemma":[0.9994561,0.00019051651,0.000106143234,0.0000951342,0.00008304862,0.00006902855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004925717,0.00024943508,0.00030177762,0.0002260435,0.00037735613,0.00046012056,0.00087200856,0.00023884665,0.0016887336],"category_scores_gemma":[0.0009248842,0.00016202773,0.00016986123,0.00033285454,0.00035651063,0.0007177838,0.0004464275,0.00031918776,0.00028470246],"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.0007547413,0.00024158471,0.0024475027,0.00019066688,0.000044039418,0.0005129334,0.00028362585,0.7524475,0.066668674,0.02784181,0.0020200422,0.14654699],"study_design_scores_gemma":[0.00003902799,0.00021736264,0.00028261056,0.000002940089,0.0000070393394,0.000049219503,0.0000605035,0.9834252,0.011086478,0.0033771596,0.0014438126,0.00000868442],"about_ca_topic_score_codex":0.0014245721,"about_ca_topic_score_gemma":0.002272815,"teacher_disagreement_score":0.0016887336,"about_ca_system_score_codex":0.00035149473,"about_ca_system_score_gemma":0.00058704504,"threshold_uncertainty_score":0.005649328},"labels":[],"label_agreement":null},{"id":"W2054681864","doi":"10.1016/s0166-218x(99)00161-4","title":"Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Injective function; Neighbourhood (mathematics); Graph; Discrete mathematics","score_opus":0.008419413781472318,"score_gpt":0.21658444924436557,"score_spread":0.20816503546289325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054681864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50247616,0.0010298647,0.44315195,0.0009734034,0.00023745012,0.00008809936,0.0007409226,0.00037841828,0.05092376],"genre_scores_gemma":[0.8962595,0.0009876672,0.075090215,0.00026365172,0.00015857565,0.00013791081,0.00074509677,0.00022929776,0.026128158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964404,0.00009552533,0.000021901933,0.00008534146,0.00008864415,0.00006446828],"domain_scores_gemma":[0.99869365,0.00041538855,0.00027992495,0.00019784448,0.00016272164,0.00025047432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032338162,0.00061353913,0.00054818,0.0006505858,0.00066715805,0.002071971,0.00095367985,0.00074089813,0.0055026524],"category_scores_gemma":[0.002570895,0.0005884113,0.0005094623,0.0009065455,0.0012375544,0.004168065,0.0020585917,0.001899944,0.0005836461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011322269,0.000029238581,0.00041286598,0.000074212265,0.000012625791,0.0001273819,0.00035683223,0.01669047,0.0016534503,0.96719086,0.0018119103,0.011526785],"study_design_scores_gemma":[0.000028790651,0.000038126796,0.00048446143,0.000022939488,0.000010018854,0.00015565148,0.00015088618,0.039091345,0.00062873616,0.9541683,0.005207018,0.000013752467],"about_ca_topic_score_codex":0.0007220891,"about_ca_topic_score_gemma":0.0008552696,"teacher_disagreement_score":0.0055026524,"about_ca_system_score_codex":0.0007106192,"about_ca_system_score_gemma":0.0002998452,"threshold_uncertainty_score":0.01840818},"labels":[],"label_agreement":null},{"id":"W2054749661","doi":"10.1109/fpt.2012.6412115","title":"Small virtual channel routers on FPGAs through block RAM sharing","year":2012,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Computer science; Virtual channel; Router; Field-programmable gate array; Block (permutation group theory); Shared resource; Throughput; Embedded system; Network on a chip; Latency (audio); Reduction (mathematics); Computer network; Channel (broadcasting); Parallel computing; Operating system; Wireless","score_opus":0.058000516365356476,"score_gpt":0.2498556264242562,"score_spread":0.19185511005889974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054749661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7894238,0.0008341805,0.19323185,0.00012419175,0.000060050228,0.00010747512,0.00012491514,0.0033937944,0.012699657],"genre_scores_gemma":[0.9224494,0.00015880034,0.07465653,0.000038568065,0.000010821235,0.000041041556,0.00011723897,0.000049019323,0.002478616],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998473,0.00004384686,0.000009215727,0.00002789001,0.000039191487,0.000032520675],"domain_scores_gemma":[0.99973756,0.00007961508,0.0000703177,0.000068240304,0.00002912169,0.000015158547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017434424,0.00035822982,0.000204637,0.00032055276,0.000121981,0.00035344635,0.00069274363,0.00014585783,0.0023488598],"category_scores_gemma":[0.0003402757,0.00014908193,0.00014421131,0.00026715684,0.00017523539,0.0006454025,0.00022352907,0.00018019922,0.00035788436],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0011121843,0.00022513967,0.006488563,0.00034744275,0.00011108485,0.0003848875,0.00014793508,0.19412482,0.44951487,0.012785021,0.0032390093,0.3315191],"study_design_scores_gemma":[0.00024548193,0.002968113,0.0068457653,0.00006456393,0.00015484226,0.00076727883,0.00012645936,0.61033255,0.34454122,0.0069688433,0.026922774,0.00006212772],"about_ca_topic_score_codex":0.00073270546,"about_ca_topic_score_gemma":0.0018242612,"teacher_disagreement_score":0.0023488598,"about_ca_system_score_codex":0.00025984755,"about_ca_system_score_gemma":0.000275208,"threshold_uncertainty_score":0.00785774},"labels":[],"label_agreement":null},{"id":"W2054816762","doi":"10.1002/dac.856","title":"Design and implementation of a scalable switch architecture for efficient high‐speed data multicasting","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Scalability; Distributed computing; Crossover switch; Unicast; Modular design; Xcast; Protocol Independent Multicast; Computer architecture; Telecommunications; Crossbar switch; Operating system","score_opus":0.04456907255686074,"score_gpt":0.3276142108132741,"score_spread":0.2830451382564133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054816762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49565408,0.00049050373,0.48095068,0.0004885257,0.00020039604,0.00021540085,0.00018241917,0.0031446402,0.018673336],"genre_scores_gemma":[0.90943784,0.00013076907,0.087151244,0.00010087796,0.000041777614,0.000084418454,0.00014442357,0.00003806087,0.0028706642],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000016481474,0.0000052991063,0.00001912935,0.000053312353,0.000026220334],"domain_scores_gemma":[0.9998801,0.000021688025,0.000016147385,0.000015774025,0.00004675722,0.000019611294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020250175,0.00018978672,0.00013338542,0.00028860397,0.00027685837,0.00039868313,0.0006078647,0.0002148781,0.0016189003],"category_scores_gemma":[0.00019198626,0.000114020135,0.00016081423,0.00020550811,0.000201778,0.0003191771,0.00023584781,0.00023706318,0.00027175766],"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.00035271328,0.00018354312,0.0019398988,0.0001912199,0.00008911195,0.00044762884,0.00017018388,0.061321292,0.7342023,0.020652536,0.0063153026,0.17413431],"study_design_scores_gemma":[0.00035089097,0.0011951867,0.0037697651,0.000033907974,0.000109515175,0.00041323027,0.00010035043,0.69217414,0.26721463,0.007509631,0.027085034,0.000043720866],"about_ca_topic_score_codex":0.0009376907,"about_ca_topic_score_gemma":0.0013840754,"teacher_disagreement_score":0.0016189003,"about_ca_system_score_codex":0.0004843486,"about_ca_system_score_gemma":0.00051479955,"threshold_uncertainty_score":0.0054157376},"labels":[],"label_agreement":null},{"id":"W2055264929","doi":"10.1142/s0218126606002952","title":"ON THE REDUCTION OF INTERCONNECT EFFECTS IN DEEP SUBMICRON IMPLEMENTATIONS OF DIGITAL MULTIPLICATION ARCHITECTURES","year":2006,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"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 Calgary; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Fudan University; CMC Microsystems","keywords":"Computer science; Interconnection; Control reconfiguration; Multiplier (economics); Computer engineering; Reduction (mathematics); Implementation; Multiplication (music); Computer architecture; Embedded system; Telecommunications; Mathematics","score_opus":0.009719138777889436,"score_gpt":0.22633850555766885,"score_spread":0.21661936677977942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055264929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2610953,0.0032207777,0.7065601,0.0010005824,0.00011952042,0.00006818068,0.000053930984,0.0009248308,0.026956895],"genre_scores_gemma":[0.74225146,0.0016488387,0.24997514,0.00017388174,0.00010349794,0.000054011984,0.00006722323,0.0001234611,0.0056024706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997534,0.00006787972,0.000013614295,0.000016982833,0.00012044005,0.000027645365],"domain_scores_gemma":[0.9990632,0.0005751994,0.00012039111,0.000110642206,0.00011462072,0.000015961898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038208353,0.00036762844,0.00020576105,0.00037016562,0.0004398677,0.000635362,0.00031696772,0.0002033079,0.0017409796],"category_scores_gemma":[0.002688434,0.00017485267,0.00012692413,0.00056271366,0.00042518423,0.0010591601,0.00027718084,0.00043368211,0.00028389177],"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.00032860524,0.00008836753,0.002767808,0.00040764126,0.000037832313,0.00035011052,0.00039054296,0.38873583,0.10487545,0.21048269,0.00298277,0.2885524],"study_design_scores_gemma":[0.000028572487,0.00034284318,0.0014398148,0.00005879491,0.00003865953,0.0002979426,0.00008620026,0.90641576,0.033962946,0.043544084,0.013764947,0.000019450916],"about_ca_topic_score_codex":0.0006902513,"about_ca_topic_score_gemma":0.0032314998,"teacher_disagreement_score":0.0017409796,"about_ca_system_score_codex":0.0004933397,"about_ca_system_score_gemma":0.0004484904,"threshold_uncertainty_score":0.0058242083},"labels":[],"label_agreement":null},{"id":"W2055727154","doi":"10.4271/2012-01-2123","title":"An AFDX Switch Fabric Hardware Core for Avionic Network Prototyping and Characterization","year":2012,"lang":"en","type":"article","venue":"SAE International Journal of Aerospace","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"Thales Group; Mitacs; Consortium de Recherche et d’innovation en Aérospatiale au Québec; Bombardier","keywords":"Avionics; Rapid prototyping; Core (optical fiber); Embedded system; Characterization (materials science); Computer hardware; Computer science; Engineering; Telecommunications; Aerospace engineering; Materials science; Nanotechnology; Mechanical engineering","score_opus":0.024009913313764595,"score_gpt":0.290334873992977,"score_spread":0.2663249606792124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055727154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5525508,0.0005200911,0.40626013,0.00023271109,0.00033134976,0.00088974775,0.0010722027,0.005792162,0.032350834],"genre_scores_gemma":[0.8340452,0.00019500934,0.15498722,0.00007634571,0.000021547075,0.0004071583,0.0006571336,0.0003191205,0.009291237],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997004,0.000043079523,0.000015980153,0.00004398096,0.00014256328,0.000054084398],"domain_scores_gemma":[0.999595,0.00008130028,0.00005229758,0.000089120316,0.00014223116,0.00003999495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339476,0.00047483458,0.00020385609,0.0004500787,0.00015232716,0.00037149346,0.00065146317,0.0002346194,0.005839725],"category_scores_gemma":[0.0005775771,0.00012814607,0.00016737432,0.00017350774,0.00018199401,0.0003444131,0.00025970512,0.0002857336,0.00083542016],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00080638926,0.00028877193,0.005300786,0.0010725225,0.00006120643,0.0011166618,0.0004242847,0.033752587,0.7479072,0.011414128,0.008450283,0.18940525],"study_design_scores_gemma":[0.0002011041,0.0028210836,0.0115791075,0.00011208789,0.00008391713,0.0014172778,0.00011918218,0.12532066,0.77213275,0.0009585402,0.08518698,0.00006730936],"about_ca_topic_score_codex":0.0005387127,"about_ca_topic_score_gemma":0.0005532114,"teacher_disagreement_score":0.005839725,"about_ca_system_score_codex":0.00039944152,"about_ca_system_score_gemma":0.00052706955,"threshold_uncertainty_score":0.01953584},"labels":[],"label_agreement":null},{"id":"W2056928920","doi":"10.1145/605440.605443","title":"Reduction design for generic universal switch blocks","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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 Lethbridge; University of Victoria","funders":"","keywords":"Computer science; Routing (electronic design automation); Scalability; Field-programmable gate array; Reduction (mathematics); Block (permutation group theory); Parallel computing; Embedded system; Mathematics","score_opus":0.0452735509172989,"score_gpt":0.23657897590068347,"score_spread":0.19130542498338457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056928920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10117181,0.00026877422,0.8798111,0.000085052634,0.000029822875,0.00006852641,0.0001463995,0.00049909466,0.017919375],"genre_scores_gemma":[0.6987574,0.00033605774,0.2932516,0.00009709512,0.000032744785,0.00015257183,0.00050034176,0.00014745437,0.0067247013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997131,0.000052502968,0.000016425793,0.000055167915,0.0001018587,0.00006082649],"domain_scores_gemma":[0.9998585,0.000035608813,0.000025111838,0.000035432386,0.000034348832,0.000010998206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021782919,0.0004196235,0.00032882462,0.00048185958,0.00024211346,0.00039746612,0.00050113915,0.00027712033,0.0024045762],"category_scores_gemma":[0.00038435456,0.0002387376,0.0006553893,0.00037654958,0.0003444914,0.00058419484,0.00057203136,0.00036998215,0.00041097918],"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.00018302428,0.0000901106,0.00097030913,0.0003931529,0.00005245694,0.00029779127,0.00019491883,0.4519955,0.13410114,0.23736405,0.0038784374,0.17047912],"study_design_scores_gemma":[0.00002984449,0.00022057479,0.0007879156,0.00002717465,0.000041060408,0.0002278954,0.00006597514,0.9002508,0.027526015,0.05230218,0.018498909,0.000021655915],"about_ca_topic_score_codex":0.00084338215,"about_ca_topic_score_gemma":0.0014762221,"teacher_disagreement_score":0.0024045762,"about_ca_system_score_codex":0.0005494195,"about_ca_system_score_gemma":0.00036550115,"threshold_uncertainty_score":0.008044064},"labels":[],"label_agreement":null},{"id":"W2057397262","doi":"10.1109/tit.2011.2170918","title":"Large Deviations for Re-Sequencing Buffer Size","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Interconnection Networks and Systems","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":"Carleton University","funders":"","keywords":"Computer science; Limit (mathematics); Network packet; Algorithm; Mathematics; Computer network","score_opus":0.02783067493420179,"score_gpt":0.23097838903289905,"score_spread":0.20314771409869725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057397262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033848066,0.002584126,0.9478439,0.0026247804,0.00049692835,0.0000964495,0.00019506183,0.0011319894,0.011178676],"genre_scores_gemma":[0.84618753,0.004096518,0.12745652,0.002298734,0.0009442793,0.0007745131,0.00057577464,0.0012749595,0.016391221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886026,0.0026648848,0.00058240915,0.0029955092,0.0036503125,0.0015043352],"domain_scores_gemma":[0.89004564,0.07828783,0.008824379,0.008463814,0.01028348,0.0040948517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014132003,0.0026700012,0.0023058073,0.0030015563,0.0018394347,0.00431257,0.004617304,0.0028809893,0.006051286],"category_scores_gemma":[0.09558368,0.0012911046,0.0027090749,0.001629588,0.0057732956,0.01096542,0.005355442,0.008405487,0.0013956805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007128798,0.0002513557,0.0052812104,0.000598862,0.00024328542,0.0011716945,0.00061539793,0.22974356,0.016785553,0.7005579,0.0077213636,0.036316905],"study_design_scores_gemma":[0.000047117133,0.00022932014,0.0009957476,0.00013892319,0.00008021494,0.00064127136,0.00011497887,0.7721292,0.0089437,0.21402697,0.0025291739,0.00012336057],"about_ca_topic_score_codex":0.0017345183,"about_ca_topic_score_gemma":0.0010802118,"teacher_disagreement_score":0.014132003,"about_ca_system_score_codex":0.004536209,"about_ca_system_score_gemma":0.0038357617,"threshold_uncertainty_score":0.074738085},"labels":[],"label_agreement":null},{"id":"W2059124748","doi":"10.1007/s10586-008-0065-8","title":"Efficient shared memory and RDMA based collectives on multi-rail QsNetII SMP clusters","year":2008,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Parallel computing; Operating system","score_opus":0.029210776239220186,"score_gpt":0.24045570847511624,"score_spread":0.21124493223589605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059124748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7325435,0.0007668219,0.24770704,0.0006748136,0.00025326165,0.0001309027,0.00021624606,0.0052515334,0.012455862],"genre_scores_gemma":[0.9352425,0.000078184166,0.057173193,0.00003478897,0.00003256069,0.00006672361,0.00018486126,0.000106495965,0.0070807245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951506,0.00011456511,0.000029697216,0.00007812372,0.00015540326,0.00010724467],"domain_scores_gemma":[0.9988738,0.00029370317,0.000056957535,0.0004231746,0.00024984835,0.0001026396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083014823,0.00036745184,0.0008545874,0.00047232804,0.0013688437,0.0012432188,0.0015802898,0.00051636604,0.003204743],"category_scores_gemma":[0.001653658,0.0003396183,0.00029763137,0.00077499286,0.0005415889,0.0012250784,0.0012771209,0.00052255194,0.00055722165],"study_design_candidate":"bench_or_experimental","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.0035722065,0.0004813193,0.005775887,0.00030693616,0.00020251083,0.00050981814,0.0013896291,0.5210101,0.15496266,0.03770709,0.018321902,0.25575984],"study_design_scores_gemma":[0.00015264895,0.00027172238,0.0009391169,0.000009817047,0.00003685684,0.00005420178,0.00021310779,0.96576035,0.021928329,0.006617231,0.003990841,0.000025716996],"about_ca_topic_score_codex":0.0044219266,"about_ca_topic_score_gemma":0.0077692866,"teacher_disagreement_score":0.0044219266,"about_ca_system_score_codex":0.000920553,"about_ca_system_score_gemma":0.0008655154,"threshold_uncertainty_score":0.010720909},"labels":[],"label_agreement":null},{"id":"W2059613731","doi":"10.1007/s11227-012-0793-7","title":"Improving performance of multi-core NUCA coherent systems using NoC-assisted mechanisms","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; Cache; Network packet; Computer network; Multicast; Power consumption; Architecture; Routing (electronic design automation); Wormhole; Scalability; Embedded system; Distributed computing; Power (physics); CPU cache; Cache algorithms; Operating system","score_opus":0.06753242563293141,"score_gpt":0.26676867722085074,"score_spread":0.19923625158791933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059613731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9067458,0.0016215038,0.07899563,0.00028750356,0.00011973449,0.00003641513,0.00006894421,0.0009900968,0.011134426],"genre_scores_gemma":[0.9866436,0.00014383135,0.011921094,0.000030491536,0.00001656535,0.000010263866,0.000046433597,0.00001819844,0.0011694159],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997758,0.00006583217,0.000013271129,0.000026424426,0.00007276402,0.000045890374],"domain_scores_gemma":[0.99920684,0.0002504499,0.00008240535,0.00010981069,0.0002942949,0.000056142802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005149394,0.0003560501,0.0002953449,0.0003460546,0.000447764,0.0005189241,0.0006370282,0.00028639607,0.0021006675],"category_scores_gemma":[0.0015042794,0.00013537923,0.00010694903,0.00044069177,0.00016625172,0.0007447994,0.000483024,0.00029280726,0.00023193794],"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.002624883,0.00053352024,0.008996263,0.00040488297,0.00013714327,0.00035639832,0.0002861991,0.32471064,0.37714192,0.013809612,0.0050716456,0.265927],"study_design_scores_gemma":[0.00006202206,0.00080330437,0.0028114147,0.000023284838,0.00007726289,0.00012228923,0.00006969265,0.9155688,0.075925484,0.0019155843,0.002599624,0.00002127538],"about_ca_topic_score_codex":0.00075508637,"about_ca_topic_score_gemma":0.0023446833,"teacher_disagreement_score":0.0021006675,"about_ca_system_score_codex":0.0004037857,"about_ca_system_score_gemma":0.0005043977,"threshold_uncertainty_score":0.007027447},"labels":[],"label_agreement":null},{"id":"W2059923406","doi":"10.1016/j.osn.2006.10.001","title":"16000–64000 B pMTU experiments with simulation: The case for super jumbo frames at Supercomputing ’05","year":2006,"lang":"en","type":"article","venue":"Optical Switching and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Goddard Space Flight Center","keywords":"Supercomputer; InfiniBand; Myrinet; Computer science; Ethernet; Gigabit Ethernet; Parallel computing; Frame (networking); Router; Operating system; Computer network; Message passing","score_opus":0.019367338587900535,"score_gpt":0.25680082551091643,"score_spread":0.23743348692301589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059923406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96198815,0.00016477595,0.0074076876,0.0012337406,0.00022732424,0.000046982866,0.00044446485,0.0012430595,0.027243955],"genre_scores_gemma":[0.99590045,0.000025985755,0.0025380894,0.00008421818,0.000016381682,0.00001603035,0.00026143037,0.00010208268,0.0010553412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996363,0.00013098704,0.000010941889,0.000045383153,0.00008180357,0.00009455722],"domain_scores_gemma":[0.9984711,0.00072135555,0.000042238502,0.00030758206,0.00025905328,0.00019870925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009927994,0.00026923828,0.00057543354,0.00025416148,0.00092428166,0.00076572085,0.0010185975,0.000978254,0.0065508485],"category_scores_gemma":[0.0036410568,0.00025618222,0.00020586092,0.0006272736,0.00087679835,0.0013653367,0.0006650019,0.0014677941,0.0005755652],"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.01865013,0.0039702673,0.025719887,0.00024580854,0.0002414111,0.001225106,0.00174222,0.69436026,0.08624002,0.042454608,0.062776804,0.062373437],"study_design_scores_gemma":[0.0004952705,0.0005738086,0.0056734835,0.000017293296,0.00002634352,0.000044704866,0.00021694181,0.9543581,0.027133027,0.006285993,0.005140258,0.000034802637],"about_ca_topic_score_codex":0.010317941,"about_ca_topic_score_gemma":0.005782187,"teacher_disagreement_score":0.010317941,"about_ca_system_score_codex":0.00086355605,"about_ca_system_score_gemma":0.0005149409,"threshold_uncertainty_score":0.02191478},"labels":[],"label_agreement":null},{"id":"W2060161795","doi":"10.1109/cads.2013.6714252","title":"A novel test strategy and fault-tolerant routing algorithm for NoC routers","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Router; Computer science; Network on a chip; Latency (audio); Network packet; Computer network; One-armed router; Routing algorithm; Network routing; Core router; Deadlock; Routing (electronic design automation); Metrics; Routing protocol; Routing table; Distributed computing; Embedded system","score_opus":0.01952716305254308,"score_gpt":0.2342883320369422,"score_spread":0.21476116898439912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060161795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019037496,0.00027563272,0.9780212,0.0001289297,0.000061751874,0.00007210595,0.000032360433,0.001145251,0.0012252751],"genre_scores_gemma":[0.32413828,0.0002278361,0.67211765,0.00019903704,0.000041511714,0.00013985613,0.00021515577,0.000111325055,0.0028094326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996898,0.000063904765,0.000027464132,0.00006122624,0.00012149253,0.00003622943],"domain_scores_gemma":[0.99955744,0.00012869168,0.00006547122,0.00006801596,0.00015529162,0.000025214456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030173935,0.0005198246,0.00043036483,0.0007702527,0.00039558913,0.0005508027,0.0014199675,0.0007295791,0.0013066554],"category_scores_gemma":[0.0011360602,0.0001692096,0.00026934274,0.00047482303,0.00037729446,0.001153304,0.00045887224,0.00045415113,0.00027482992],"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.0003190318,0.0002224138,0.001864864,0.0003007345,0.000098654964,0.0003157361,0.00014560402,0.18582802,0.09274825,0.032428276,0.0054772007,0.6802512],"study_design_scores_gemma":[0.000059784637,0.00034012663,0.0004995096,0.000020246138,0.00004817025,0.00049017393,0.0000387188,0.94725084,0.033858128,0.009261901,0.008102883,0.0000295569],"about_ca_topic_score_codex":0.0009845007,"about_ca_topic_score_gemma":0.0012850423,"teacher_disagreement_score":0.0014199675,"about_ca_system_score_codex":0.0005943023,"about_ca_system_score_gemma":0.00061167806,"threshold_uncertainty_score":0.004371166},"labels":[],"label_agreement":null},{"id":"W2060212507","doi":"10.1109/dft.2011.12","title":"A Fault Tolerant Hierarchical Network on Chip Router Architecture","year":2011,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Retransmission; Network on a chip; Computer science; Virtual channel; Redundancy (engineering); Fault tolerance; Router; Latency (audio); Computer network; Network packet; Embedded system; Energy consumption; Distributed computing; Engineering; Channel (broadcasting)","score_opus":0.025914570114323212,"score_gpt":0.21890658128660875,"score_spread":0.19299201117228554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060212507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12765466,0.0021251808,0.8446239,0.0005704101,0.00029524436,0.00020221087,0.00033324474,0.007834097,0.016360965],"genre_scores_gemma":[0.61630404,0.00055545697,0.37297657,0.00028498133,0.000059181482,0.00010570352,0.0005101483,0.00007262977,0.009131195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998541,0.000029109342,0.000010609778,0.000034714416,0.000049646216,0.00002176599],"domain_scores_gemma":[0.9998772,0.000014101191,0.000019290446,0.00003144911,0.00004358352,0.000014258747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014958074,0.00023413247,0.00023704828,0.00032845963,0.00026659403,0.00040231837,0.0008431748,0.0004333728,0.0019358856],"category_scores_gemma":[0.0002524263,0.0001075589,0.0002120778,0.0002670998,0.00014931269,0.00041489454,0.00022768092,0.00022122964,0.00050131715],"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.00041841748,0.00021139975,0.0017964096,0.00042405957,0.00018442747,0.00065988215,0.00013341515,0.20381774,0.293821,0.044054218,0.01723873,0.43724024],"study_design_scores_gemma":[0.00008487099,0.0006492315,0.0020275023,0.000028987919,0.00013856824,0.0006514341,0.0000327809,0.90063584,0.047373608,0.008911346,0.039410032,0.000055731296],"about_ca_topic_score_codex":0.0015098045,"about_ca_topic_score_gemma":0.0032544986,"teacher_disagreement_score":0.0019358856,"about_ca_system_score_codex":0.00036869105,"about_ca_system_score_gemma":0.000455064,"threshold_uncertainty_score":0.0064762235},"labels":[],"label_agreement":null},{"id":"W2060429008","doi":"10.1109/dsd.2004.29","title":"Automatic mapping of parallel applications onto multi-processor platforms: a multimedia application","year":2004,"lang":"en","type":"article","venue":"Digital Systems Design","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":"STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Video Graphics Array; Component (thermodynamics); Encoder; Computer architecture; Programming paradigm; Embedded system; Programming language; Operating system; Field-programmable gate array","score_opus":0.0341921410563524,"score_gpt":0.24081355483475997,"score_spread":0.20662141377840756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060429008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17873412,0.0012309471,0.8067042,0.0003918851,0.000056774097,0.00014619732,0.00006593853,0.0033050347,0.009364909],"genre_scores_gemma":[0.48075122,0.00073976046,0.5124521,0.00007686004,0.00003007905,0.00006416099,0.000113496586,0.00017288371,0.005599339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998864,0.000017339198,0.000007696776,0.000027254257,0.000045597655,0.000015602353],"domain_scores_gemma":[0.99986804,0.00003922049,0.000015013222,0.00003293361,0.00003309781,0.000011600899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014835063,0.00030978836,0.00015419595,0.0002614342,0.00030812676,0.00040720825,0.00039231285,0.00026416456,0.001991302],"category_scores_gemma":[0.0005571255,0.00014326232,0.00013184923,0.00027094994,0.00018819806,0.0005204967,0.0004351234,0.0002806457,0.00042546034],"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.00018093883,0.0000684312,0.0011300043,0.00017570776,0.000017796883,0.0005579466,0.00024732915,0.033043634,0.2184219,0.009918215,0.0025780404,0.7336601],"study_design_scores_gemma":[0.0000583656,0.00039448892,0.0034696322,0.000058176658,0.000047751782,0.0013703359,0.00025273414,0.61684775,0.29051933,0.017437492,0.06950808,0.000035893765],"about_ca_topic_score_codex":0.0008657054,"about_ca_topic_score_gemma":0.001498301,"teacher_disagreement_score":0.001991302,"about_ca_system_score_codex":0.00024282758,"about_ca_system_score_gemma":0.00032658176,"threshold_uncertainty_score":0.006661594},"labels":[],"label_agreement":null},{"id":"W2060918709","doi":"10.1155/2010/169140","title":"Design of an IPTV Multicast System for Internet Backbone Networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Bell (Canada)","funders":"","keywords":"Computer network; Computer science; Multicast; IPTV; Internet Group Management Protocol; Quality of service; Jitter; Distributed computing; Distance Vector Multicast Routing Protocol; Xcast; Telecommunications","score_opus":0.025309118947399237,"score_gpt":0.26652302621526597,"score_spread":0.24121390726786673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060918709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31030732,0.00034905394,0.66551703,0.00038114324,0.000063259264,0.00046149112,0.00013535458,0.0010495578,0.021735858],"genre_scores_gemma":[0.94610757,0.00012284017,0.05142348,0.000047759644,0.00001120851,0.00023841775,0.00007129181,0.000027280912,0.0019502786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99984956,0.00004472456,0.0000047651533,0.000016548924,0.00006207601,0.000022294469],"domain_scores_gemma":[0.999877,0.000040794657,0.000014429284,0.000009338627,0.000044558725,0.000013926487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025920544,0.00027645295,0.0003143783,0.00018378913,0.00047557682,0.00046447973,0.000554533,0.00059249304,0.0014374782],"category_scores_gemma":[0.00056621176,0.00016685518,0.0002068942,0.00014843285,0.00031959396,0.00041705786,0.00025539208,0.00027539226,0.00017653932],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007773108,0.00004456379,0.0012281918,0.00007830025,0.000026012625,0.00018800565,0.000088879766,0.9559702,0.0148526635,0.006550778,0.00078237103,0.02011217],"study_design_scores_gemma":[0.000022933078,0.00007508187,0.00020304187,0.0000040937894,0.00000971307,0.000030383217,0.000014435076,0.9961582,0.00171867,0.00077547465,0.000983711,0.0000043190526],"about_ca_topic_score_codex":0.0026270284,"about_ca_topic_score_gemma":0.0014476817,"teacher_disagreement_score":0.0026270284,"about_ca_system_score_codex":0.0007673143,"about_ca_system_score_gemma":0.00074578094,"threshold_uncertainty_score":0.0055673122},"labels":[],"label_agreement":null},{"id":"W2060927838","doi":"10.4028/www.scientific.net/amr.268-270.2101","title":"A High-Performance Scheduling Algorithm for Buffered Crossbar Switch","year":2011,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Faculty of Graduate Studies and Research, University of Alberta","keywords":"Computer science; Scheduling (production processes); Weighted fair queueing; Scalability; Round-robin scheduling; Quality of service; Maximum throughput scheduling; Queueing theory; Crossbar switch; Distributed computing; Fair queuing; Dynamic priority scheduling; Algorithm; Computer network; Mathematical optimization; Mathematics; Operating system","score_opus":0.08750407750242112,"score_gpt":0.34081573258705605,"score_spread":0.25331165508463493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060927838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012024746,0.00022061699,0.9850189,0.00009858927,0.00008641431,0.00007177168,0.000040908588,0.00081630785,0.0016218245],"genre_scores_gemma":[0.35629833,0.00029500166,0.63904005,0.00009842936,0.000078985206,0.000196859,0.00022358097,0.0001101916,0.0036585056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974614,0.00005007602,0.000019016323,0.000065476146,0.00008024524,0.00003897716],"domain_scores_gemma":[0.9998092,0.000047209443,0.000020456207,0.000021857744,0.00008122291,0.000020123705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538091,0.0006493225,0.00044947327,0.0006748864,0.00079962244,0.000779632,0.0010842356,0.00048454714,0.002884228],"category_scores_gemma":[0.0008814126,0.00028796907,0.00024722886,0.00077053136,0.00032620557,0.0008084506,0.0005916195,0.0004697409,0.00047162577],"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.00042875015,0.0001234559,0.000683259,0.00015823354,0.000060925915,0.00012843101,0.00017985664,0.52713925,0.029273652,0.044955727,0.0062971218,0.39057124],"study_design_scores_gemma":[0.000047818063,0.000044169097,0.000078506506,0.000005451916,0.000008699202,0.000027246404,0.000012090692,0.9889264,0.0032583629,0.005506671,0.002075923,0.0000086506725],"about_ca_topic_score_codex":0.0037061856,"about_ca_topic_score_gemma":0.0029626894,"teacher_disagreement_score":0.0037061856,"about_ca_system_score_codex":0.0011611698,"about_ca_system_score_gemma":0.0012082619,"threshold_uncertainty_score":0.00964874},"labels":[],"label_agreement":null},{"id":"W2061025271","doi":"10.1109/cse.2014.245","title":"Conditional Connectivity with Distance Requirement on Hypercube","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Novelis (Canada)","funders":"","keywords":"Combinatorics; Hypercube; Cardinality (data modeling); Discrete mathematics; Computer science; Mathematics; Data mining","score_opus":0.013715763230349544,"score_gpt":0.21999901200384803,"score_spread":0.2062832487734985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061025271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20054391,0.0024583354,0.7445202,0.0021851913,0.0004631318,0.00023582605,0.0027920913,0.0010915806,0.045709766],"genre_scores_gemma":[0.84971815,0.0018502984,0.13214758,0.0005420368,0.0006863409,0.0006726918,0.0036651706,0.00029534037,0.010422347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997359,0.00060936424,0.0002021757,0.0006031078,0.0008906384,0.00033574138],"domain_scores_gemma":[0.99393684,0.0021985902,0.0010679229,0.00088427815,0.001291495,0.0006209338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011217587,0.00081914914,0.0009165149,0.0022016629,0.0011944746,0.0022380129,0.0022697407,0.0013132079,0.00825877],"category_scores_gemma":[0.008705305,0.00047194056,0.0008633442,0.0028302881,0.0013979005,0.0069648735,0.0029852025,0.0019498216,0.0009754457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032675551,0.00007347727,0.002572164,0.00037994128,0.00005182804,0.00043374833,0.0003185698,0.07799481,0.0061755194,0.8720702,0.008450652,0.031152317],"study_design_scores_gemma":[0.00006507229,0.0002809125,0.0021285017,0.00009821408,0.000044242723,0.0011372396,0.00029285604,0.29606152,0.0043813917,0.6731192,0.022305826,0.000085041625],"about_ca_topic_score_codex":0.0012769415,"about_ca_topic_score_gemma":0.0009651428,"teacher_disagreement_score":0.00825877,"about_ca_system_score_codex":0.0015433267,"about_ca_system_score_gemma":0.00077543646,"threshold_uncertainty_score":0.027628303},"labels":[],"label_agreement":null},{"id":"W2062106556","doi":"10.1145/2002962.2002971","title":"Extending a distributed loop network to tolerate node failures","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Spare part; Node (physics); Fault tolerance; Computer science; Very-large-scale integration; Loop (graph theory); Distributed computing; Degree (music); Topology (electrical circuits); Parallel computing; Mathematics; Embedded system; Engineering","score_opus":0.034923519276746876,"score_gpt":0.23463398432336752,"score_spread":0.19971046504662066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062106556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15369263,0.0002688014,0.84208995,0.00017211394,0.000033927823,0.000043129923,0.000030996307,0.00028113113,0.0033872942],"genre_scores_gemma":[0.90634996,0.00025106515,0.09008088,0.00005120168,0.000038092414,0.00006681959,0.000058293695,0.000046058074,0.003057588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.00005480263,0.0000071167196,0.000049374205,0.000042461746,0.000046429952],"domain_scores_gemma":[0.9992811,0.00036786444,0.000092575305,0.00008728044,0.00011517557,0.000055958968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059999287,0.00044497082,0.00043215769,0.00031318798,0.00037247964,0.0003514694,0.0009458106,0.00064649404,0.0018218663],"category_scores_gemma":[0.0018261968,0.00015134209,0.00030762955,0.0004266345,0.00048996194,0.0011658531,0.0008313908,0.00045785483,0.0002549408],"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.00007776179,0.000044521956,0.00024211631,0.000045493474,0.000009139726,0.000089931425,0.00005568616,0.9514138,0.007478953,0.0060254815,0.0003444709,0.034172643],"study_design_scores_gemma":[0.000019335195,0.0001316182,0.00006587299,0.0000033252388,0.000008085269,0.00004706406,0.000016984624,0.9874724,0.0019699614,0.009244791,0.0010150699,0.0000053677304],"about_ca_topic_score_codex":0.0008246318,"about_ca_topic_score_gemma":0.0006739856,"teacher_disagreement_score":0.0018218663,"about_ca_system_score_codex":0.00038126463,"about_ca_system_score_gemma":0.00026262464,"threshold_uncertainty_score":0.0060947537},"labels":[],"label_agreement":null},{"id":"W2062309559","doi":"10.5539/nct.v1n1p7","title":"New Approach Construction for Wireless ZigBee Sensor Based on Embedding Pancake Graphs","year":2012,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless sensor network; Topology control; Hypercube; NeuRFon; Distributed computing; Network topology; Computer network; Embedding; Topology (electrical circuits); Scheduling (production processes); Wireless network; Logical topology; Key distribution in wireless sensor networks; Wireless; Parallel computing; Mathematics","score_opus":0.02396202903471166,"score_gpt":0.2537846073790579,"score_spread":0.22982257834434622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062309559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249017,0.00022460493,0.9164861,0.00019418259,0.00009305643,0.00009489171,0.000088300214,0.00051200954,0.009816733],"genre_scores_gemma":[0.50638586,0.000529295,0.4850026,0.000083666244,0.000042602976,0.00021066875,0.00026116433,0.00008463229,0.0073994584],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980015,0.000040169416,0.000012640288,0.000056342997,0.00007446388,0.00001619262],"domain_scores_gemma":[0.99984276,0.000025032969,0.000027324584,0.000045568624,0.0000441273,0.000015167054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010047706,0.0003419948,0.0001835954,0.00044280037,0.0003789407,0.00032898612,0.0004760333,0.000241262,0.0014369929],"category_scores_gemma":[0.0003426457,0.00020005085,0.000311816,0.00039689385,0.00032993403,0.0008963533,0.0008278634,0.00035871146,0.00026732247],"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.00022160012,0.00009493138,0.002241788,0.00039259056,0.000068505615,0.0009458784,0.000525473,0.1451462,0.33381277,0.20335157,0.0046539744,0.30854473],"study_design_scores_gemma":[0.000044747012,0.0005999659,0.00235462,0.000043846976,0.00007687689,0.0019651516,0.00029576916,0.76064134,0.10534599,0.06878504,0.059768617,0.000078152494],"about_ca_topic_score_codex":0.00044840557,"about_ca_topic_score_gemma":0.0005842803,"teacher_disagreement_score":0.0014369929,"about_ca_system_score_codex":0.00024398934,"about_ca_system_score_gemma":0.0002475907,"threshold_uncertainty_score":0.004807174},"labels":[],"label_agreement":null},{"id":"W2062616902","doi":"10.1109/fpt.2013.6718360","title":"Maximizing speed and density of tiled FPGA overlays via partitioning","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Overlay; Computer science; Field-programmable gate array; Parallel computing; Embedded system; Computer hardware; Computer architecture; Operating system","score_opus":0.011564871064020191,"score_gpt":0.19953598903197384,"score_spread":0.18797111796795365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062616902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108783,0.00024507218,0.078548126,0.00006678015,0.000032913395,0.000031010077,0.000107305976,0.0016445856,0.008445993],"genre_scores_gemma":[0.9559849,0.000064727246,0.04288678,0.0000127250005,0.0000048621646,0.000023233595,0.00014114518,0.00011216111,0.0007693962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975187,0.00005267889,0.0000145960275,0.000042933305,0.00008021318,0.000057741952],"domain_scores_gemma":[0.9992279,0.00034985706,0.00008271187,0.00017793091,0.00011755098,0.000044113247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003150222,0.00039774983,0.00033354547,0.0006863794,0.00026459963,0.0005490224,0.00052036025,0.00026266096,0.0019763552],"category_scores_gemma":[0.0019775124,0.00023494399,0.00020840723,0.00051287375,0.0003524104,0.00062551274,0.0007943022,0.00025028744,0.00039686865],"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.0007409298,0.000102740254,0.008722497,0.00018534438,0.00006633327,0.00027442497,0.00023397614,0.7441732,0.13938607,0.006914624,0.0018853381,0.09731454],"study_design_scores_gemma":[0.000031928354,0.00019425577,0.0024548268,0.000018277406,0.00002844814,0.0000852862,0.0000978914,0.93874717,0.05385343,0.0021986247,0.0022767857,0.000013005169],"about_ca_topic_score_codex":0.0014362877,"about_ca_topic_score_gemma":0.002098693,"teacher_disagreement_score":0.0019763552,"about_ca_system_score_codex":0.00055148086,"about_ca_system_score_gemma":0.000343777,"threshold_uncertainty_score":0.006611526},"labels":[],"label_agreement":null},{"id":"W2063488795","doi":"10.1109/fpt.2012.6412146","title":"VENICE: A compact vector processor for FPGA applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":34,"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 British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Field-programmable gate array; Parallel computing; Las vegas; Throughput; Block (permutation group theory); Multiprocessing; Scale (ratio); Parallelism (grammar); Embedded system; Operating system; Mathematics","score_opus":0.029430734469102257,"score_gpt":0.29015715415069665,"score_spread":0.2607264196815944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063488795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18743059,0.009198045,0.64051986,0.0007180979,0.001177005,0.0005755625,0.001691769,0.042346857,0.11634228],"genre_scores_gemma":[0.59208155,0.002490452,0.32805833,0.00067576085,0.00026531605,0.00027841498,0.0056289667,0.0019184428,0.06860277],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976355,0.00002196354,0.000014311875,0.00004147642,0.000120721284,0.00003802397],"domain_scores_gemma":[0.999843,0.00002635568,0.000016367096,0.000026927577,0.00005236776,0.000035080917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019246097,0.0005079761,0.00029179678,0.00045890638,0.00018618032,0.0005727641,0.00107727,0.0002415451,0.010194975],"category_scores_gemma":[0.00043385001,0.00021513231,0.00023564797,0.00040672853,0.00023148638,0.00097084604,0.0006477059,0.0005601536,0.0020647477],"study_design_candidate":"bench_or_experimental","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.001156806,0.00016992315,0.0015992776,0.0006752099,0.000082472114,0.0004537831,0.00013870878,0.019339232,0.17872265,0.019229824,0.0734841,0.70494807],"study_design_scores_gemma":[0.00063682767,0.0032601955,0.0054509556,0.00015641312,0.00014466788,0.0023573337,0.000109465254,0.1805204,0.21653329,0.0075137,0.5831315,0.00018521099],"about_ca_topic_score_codex":0.0006235901,"about_ca_topic_score_gemma":0.0016567932,"teacher_disagreement_score":0.010194975,"about_ca_system_score_codex":0.0002477017,"about_ca_system_score_gemma":0.0005492697,"threshold_uncertainty_score":0.03410566},"labels":[],"label_agreement":null},{"id":"W2065123179","doi":"10.1109/ispa.2014.39","title":"Efficient Multicast Algorithms for Mesh and Torus Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Distributed computing; Computer network; Source-specific multicast; Xcast; Network topology; Distance Vector Multicast Routing Protocol; Torus; Parallel computing; Node (physics); Algorithm; Mathematics","score_opus":0.015680799518579057,"score_gpt":0.24369549319062017,"score_spread":0.2280146936720411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065123179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021769831,0.0012905984,0.96755624,0.00048125724,0.00013709527,0.00017394713,0.00016770404,0.00053020095,0.007893092],"genre_scores_gemma":[0.2973876,0.0016977711,0.69213337,0.00022912688,0.00023964568,0.00051408884,0.0006256962,0.00020698603,0.006965805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992841,0.00021985997,0.000053559834,0.00008774707,0.00023160687,0.00012311415],"domain_scores_gemma":[0.9988728,0.00061245175,0.000118165844,0.00012695856,0.00023002713,0.000039580602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010772557,0.0007189908,0.00085723476,0.0014466151,0.0011648468,0.00097180763,0.0014034143,0.0013217209,0.0038193986],"category_scores_gemma":[0.004702961,0.00033870162,0.00083968433,0.0015223817,0.00047949285,0.0028092805,0.0012369839,0.0008623637,0.00060502643],"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.0004347176,0.00017914617,0.0009972935,0.00039798566,0.00010589773,0.00019869633,0.0003237431,0.55076265,0.006095747,0.14374363,0.016447539,0.280313],"study_design_scores_gemma":[0.00007431641,0.00007742762,0.00017249002,0.000022789918,0.000025948093,0.00014127276,0.0000716139,0.9291166,0.001560724,0.061570197,0.007153619,0.000013145503],"about_ca_topic_score_codex":0.0015983667,"about_ca_topic_score_gemma":0.0020744237,"teacher_disagreement_score":0.0038193986,"about_ca_system_score_codex":0.0013981848,"about_ca_system_score_gemma":0.0008526183,"threshold_uncertainty_score":0.012777209},"labels":[],"label_agreement":null},{"id":"W2065289416","doi":"10.4108/icst.simutools.2014.254626","title":"Power and Chip-Area Aware Network-on-Chip Modeling for System on Chip Simulation","year":2014,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Chip; Network on a chip; System on a chip; Computer science; Embedded system; Power (physics); Power network design; Computer architecture; Telecommunications","score_opus":0.028001529830460108,"score_gpt":0.24944884261145522,"score_spread":0.2214473127809951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065289416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013262797,0.000627673,0.9704552,0.0003048791,0.00011683371,0.00010742255,0.00055138173,0.0012523722,0.013321507],"genre_scores_gemma":[0.5681878,0.0033332421,0.40358064,0.00043921993,0.00013995523,0.001064067,0.0011400889,0.0007989141,0.021316087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977297,0.000072109266,0.000010148426,0.00002090671,0.00009446171,0.000029379673],"domain_scores_gemma":[0.9997174,0.00012755496,0.000021492633,0.000059397025,0.0000620393,0.000012017957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030600434,0.00062385696,0.00044307398,0.0004027898,0.00036786124,0.0006417209,0.0012856153,0.0007627648,0.004103747],"category_scores_gemma":[0.0010956529,0.00041480814,0.000625094,0.0006233877,0.00037844374,0.000941142,0.00050285435,0.0009527721,0.0006908512],"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.000005904466,0.000009995675,0.00013659088,0.000034423683,0.00001167735,0.000021171,0.000013986238,0.98068744,0.0015105576,0.011956609,0.000829245,0.004782372],"study_design_scores_gemma":[0.0000021958301,0.0000068882264,0.00004199285,0.000003376195,0.000004177159,0.000006947463,0.000002636957,0.9948515,0.0004341668,0.0021155444,0.002528276,0.0000023560515],"about_ca_topic_score_codex":0.0067366892,"about_ca_topic_score_gemma":0.00871943,"teacher_disagreement_score":0.0067366892,"about_ca_system_score_codex":0.0007875117,"about_ca_system_score_gemma":0.0011427745,"threshold_uncertainty_score":0.01372844},"labels":[],"label_agreement":null},{"id":"W2065914858","doi":"10.1109/mdat.2014.2322995","title":"Architecture and Design of Multichannel Millimeter-Wave Wireless NoC","year":2014,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":98,"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 British Columbia","funders":"Joint Center for Aerospace Technology Innovation; CMC Microsystems; National Science Foundation","keywords":"Interconnection; Computer science; Latency (audio); Network on a chip; Wireless; Power consumption; Architecture; Physical layer; Computer architecture; Embedded system; Low latency (capital markets); Design methods; Computer network; Power (physics); Engineering; Telecommunications","score_opus":0.03119964464886537,"score_gpt":0.21374049046005433,"score_spread":0.18254084581118896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065914858","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073045045,0.0011436285,0.9005498,0.00027498222,0.00014570724,0.00021243123,0.00012284251,0.0006911332,0.023814462],"genre_scores_gemma":[0.57053334,0.0010138146,0.4174778,0.00011739932,0.000042909134,0.0003493047,0.00016657315,0.000058542926,0.010240352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99987745,0.000019980884,0.000011960248,0.000026718617,0.000044275064,0.00001970949],"domain_scores_gemma":[0.99991167,0.000008806999,0.000016512982,0.000010082359,0.000045316672,0.000007534764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016434287,0.00021765272,0.00016296623,0.00020797727,0.00023265311,0.00040271683,0.00058338634,0.00027956069,0.0010839604],"category_scores_gemma":[0.00018072352,0.00015963284,0.00020756124,0.00017843388,0.00012818322,0.00022777774,0.00020491153,0.00020753118,0.0002834401],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015426154,0.00009955629,0.0022730122,0.0006846529,0.00009715441,0.0004879533,0.0002235699,0.43598995,0.26680788,0.047457404,0.0035794664,0.24214508],"study_design_scores_gemma":[0.00004307473,0.0006603797,0.001964351,0.00007494991,0.00008234127,0.0006009999,0.0000763956,0.8727632,0.07278213,0.0054855375,0.045429572,0.000037053782],"about_ca_topic_score_codex":0.0012054627,"about_ca_topic_score_gemma":0.0018953587,"teacher_disagreement_score":0.0012054627,"about_ca_system_score_codex":0.00038036052,"about_ca_system_score_gemma":0.0006366549,"threshold_uncertainty_score":0.0036262274},"labels":[],"label_agreement":null},{"id":"W2066007382","doi":"10.1145/2591513.2591581","title":"Highly adaptive and congestion-aware routing for 3D NoCs","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Saskatchewan","funders":"UK-India Education and Research Initiative","keywords":"Computer science; Deadlock; Virtual channel; Polygon mesh; Computer network; Distributed computing; Network packet; Channel (broadcasting); Dependency (UML); Routing (electronic design automation); Airfield traffic pattern; Network congestion; Algorithm","score_opus":0.018048588330509853,"score_gpt":0.2278339226344989,"score_spread":0.20978533430398905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066007382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033195987,0.00033036052,0.96372706,0.00011183777,0.000061838364,0.000028426704,0.00003833572,0.0006413242,0.0018648031],"genre_scores_gemma":[0.49169335,0.00038904487,0.505387,0.000106081185,0.000044345292,0.0000700575,0.00014985091,0.00010033561,0.002059911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998073,0.0000421313,0.000014039717,0.00003809896,0.00007767355,0.000020697298],"domain_scores_gemma":[0.9996885,0.00010231824,0.00005668837,0.00006763635,0.000066151144,0.000018636418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020971967,0.00032540946,0.00024868466,0.00043259392,0.0003636655,0.00044717925,0.0007879745,0.00041111987,0.0006763783],"category_scores_gemma":[0.00068205915,0.00018513888,0.00033388525,0.00032684248,0.00028655562,0.0007021514,0.00063581904,0.00042133025,0.0001473931],"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.00013330378,0.00004601288,0.0021137674,0.00016119424,0.000084356274,0.0002311385,0.00011484843,0.5929102,0.13264592,0.022879893,0.002515747,0.24616367],"study_design_scores_gemma":[0.000009714138,0.000058711223,0.00056905113,0.000008397623,0.0000199914,0.00016744502,0.000021274038,0.96885735,0.016155321,0.008483286,0.0056254943,0.000023888635],"about_ca_topic_score_codex":0.0010702708,"about_ca_topic_score_gemma":0.002239896,"teacher_disagreement_score":0.0010702708,"about_ca_system_score_codex":0.00037964343,"about_ca_system_score_gemma":0.00035397612,"threshold_uncertainty_score":0.0027544498},"labels":[],"label_agreement":null},{"id":"W2066855748","doi":"10.1587/transfun.e95.a.1018","title":"Long-Range Asynchronous On-Chip Link Based on Multiple-Valued Single-Track Signaling","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Interconnection Networks and 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":"McGill University","funders":"","keywords":"Asynchronous communication; Computer science; Latency (audio); Dissipation; CMOS; Interconnection; Chip; Electronic engineering; Computer hardware; Computer network; Engineering; Telecommunications; Physics","score_opus":0.04264054113096736,"score_gpt":0.27778298967924525,"score_spread":0.2351424485482779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066855748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41530606,0.0010672275,0.56581765,0.00038009044,0.00031731784,0.00015551431,0.00014549875,0.0017539137,0.015056705],"genre_scores_gemma":[0.88304615,0.0003086179,0.112354375,0.00010051595,0.0000526269,0.000070572096,0.00011346799,0.000035430083,0.0039182627],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969673,0.000043832148,0.000015839867,0.00004243288,0.00016135444,0.000039809118],"domain_scores_gemma":[0.9996226,0.000070365495,0.00007529379,0.00006021447,0.00013404034,0.0000373929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024704201,0.00025012737,0.0002495252,0.00033721083,0.00032574407,0.0006485166,0.0008783763,0.00046891815,0.001841722],"category_scores_gemma":[0.00044386578,0.00012298567,0.00017040792,0.00037723078,0.0002106156,0.00081155926,0.00043729504,0.00045143667,0.00052334275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00021652579,0.0002862194,0.0017063394,0.00043669684,0.000056129236,0.00052520144,0.00015781593,0.051130414,0.78421885,0.03390691,0.0026922065,0.12466678],"study_design_scores_gemma":[0.00008683757,0.0016144409,0.0012944901,0.000037776914,0.00006810104,0.0006957478,0.000045706183,0.50489146,0.46554813,0.0032841328,0.022352627,0.00008053565],"about_ca_topic_score_codex":0.00043246162,"about_ca_topic_score_gemma":0.0009287826,"teacher_disagreement_score":0.001841722,"about_ca_system_score_codex":0.0003634296,"about_ca_system_score_gemma":0.00043485654,"threshold_uncertainty_score":0.0061611533},"labels":[],"label_agreement":null},{"id":"W2066877252","doi":"10.1002/net.20076","title":"Reliable broadcasting in double loop networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Broadcasting (networking); Atomic broadcast; Construct (python library); Broadcast communication network; Broadcast domain; Computer network; Tree (set theory); Interconnection; Distributed computing; Tree network; Loop (graph theory); Port (circuit theory); Broadcast radiation; Mathematics; Algorithm; Time complexity","score_opus":0.016738661673204744,"score_gpt":0.23666142579852317,"score_spread":0.21992276412531842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066877252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16761516,0.001822761,0.81012267,0.00044486427,0.00011269384,0.000047079764,0.00015963588,0.00068046997,0.018994661],"genre_scores_gemma":[0.94627523,0.00094213156,0.047933083,0.00007892434,0.00008732072,0.00006432586,0.00013721948,0.00008132234,0.0044003674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952793,0.00009238339,0.000020247811,0.00008672659,0.00018807499,0.00008471022],"domain_scores_gemma":[0.9992422,0.000302398,0.0001343895,0.00012515779,0.00015853978,0.000037414367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045399,0.00021490516,0.00039826948,0.0004617029,0.0004159305,0.0009841514,0.00055599085,0.00049281237,0.001234114],"category_scores_gemma":[0.002048541,0.00022648426,0.00016438942,0.0005349577,0.00079042464,0.0012894253,0.0006023421,0.000523884,0.00034908866],"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.00022382745,0.000033194956,0.0009605972,0.00022100688,0.000023891289,0.0001656399,0.0002819132,0.37790433,0.018910205,0.5138881,0.003728151,0.08365915],"study_design_scores_gemma":[0.000037132293,0.000106907515,0.00032886866,0.000022929837,0.000018599934,0.000121261364,0.000050067036,0.61601496,0.0068976055,0.3657693,0.0106116235,0.000020772892],"about_ca_topic_score_codex":0.0009526554,"about_ca_topic_score_gemma":0.000620378,"teacher_disagreement_score":0.001234114,"about_ca_system_score_codex":0.0006064325,"about_ca_system_score_gemma":0.00038862976,"threshold_uncertainty_score":0.004400015},"labels":[],"label_agreement":null},{"id":"W2068006581","doi":"10.1007/s00224-005-1269-4","title":"A Simple 3-Edge-Connected Component Algorithm","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Simple (philosophy); Component (thermodynamics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Mathematics; Artificial intelligence; Physics","score_opus":0.014381375958604416,"score_gpt":0.238066302380063,"score_spread":0.22368492642145857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068006581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015991217,0.00027658787,0.9709132,0.000263293,0.00022356962,0.00021075558,0.0001924185,0.0023815336,0.009547544],"genre_scores_gemma":[0.09815446,0.00018444861,0.8917364,0.00015451259,0.00007709881,0.00023869764,0.00048037778,0.00039764526,0.008576305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.000084680745,0.000031962736,0.00010365155,0.00014547746,0.000056602457],"domain_scores_gemma":[0.999446,0.00013577653,0.0000254224,0.0001690506,0.00017554592,0.000048345617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044189402,0.0009880385,0.0012018249,0.0009969805,0.0008268893,0.0012966131,0.0022193096,0.0014738834,0.017022515],"category_scores_gemma":[0.0023424816,0.00046767274,0.0006606867,0.0016219205,0.000473067,0.0021263366,0.0015545343,0.0008879149,0.004810193],"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.0007771446,0.00031888232,0.0006545711,0.00035201953,0.00010314642,0.00014478479,0.00009993337,0.10420443,0.011671568,0.067913786,0.0241256,0.78963405],"study_design_scores_gemma":[0.00033558562,0.00016119458,0.00046044512,0.000037490212,0.00007709913,0.00022151788,0.000037062127,0.89678276,0.0068716067,0.07532586,0.019648131,0.00004119167],"about_ca_topic_score_codex":0.0020555377,"about_ca_topic_score_gemma":0.0031635857,"teacher_disagreement_score":0.017022515,"about_ca_system_score_codex":0.0005658179,"about_ca_system_score_gemma":0.0012681367,"threshold_uncertainty_score":0.05694598},"labels":[],"label_agreement":null},{"id":"W2068832492","doi":"10.1109/mwscas.1993.343104","title":"Performance evaluation of a deflection routing strategy in supra-high-speed packet switching networks","year":2002,"lang":"en","type":"article","venue":"","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 Windsor","funders":"","keywords":"Deflection routing; Digraph; Computer science; Topology (electrical circuits); Network packet; Network topology; Communication source; Computer network; Routing (electronic design automation); Node (physics); Packet switching; Routing protocol; Algorithm; Mathematics; Discrete mathematics; Static routing; Engineering","score_opus":0.05309859081305905,"score_gpt":0.2689694435975202,"score_spread":0.2158708527844611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068832492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6951079,0.00030965693,0.29988855,0.00012721997,0.000021655722,0.000033934917,0.000033610584,0.0004264277,0.0040509854],"genre_scores_gemma":[0.99278945,0.000051707946,0.0069497856,0.0000069246116,0.0000023256362,0.0000056883214,0.000013791684,0.0000075564994,0.00017277653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923325,0.0003484009,0.000023034867,0.00005364017,0.00025338898,0.00008836241],"domain_scores_gemma":[0.9982639,0.0010495881,0.00015737773,0.000116867894,0.00035676433,0.000055629396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400027,0.0004654371,0.00027672693,0.00056288746,0.0001784783,0.0004507904,0.0004068356,0.00039921977,0.00055718684],"category_scores_gemma":[0.0031076446,0.00009350984,0.00013382021,0.00035627044,0.0004970943,0.0006423481,0.00028092627,0.00022012352,0.00009959583],"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.0005090788,0.000085453226,0.006078952,0.00006666754,0.00004438518,0.00010570557,0.000096799435,0.8976218,0.030110318,0.0068135397,0.0003354647,0.058131855],"study_design_scores_gemma":[0.0000032323967,0.00015532035,0.0005858584,0.0000021415262,0.0000058584365,0.00002237162,0.000015035904,0.9935859,0.005083068,0.0004588737,0.00007866329,0.0000037692607],"about_ca_topic_score_codex":0.0011953766,"about_ca_topic_score_gemma":0.0008241679,"teacher_disagreement_score":0.001400027,"about_ca_system_score_codex":0.0008489689,"about_ca_system_score_gemma":0.00029904785,"threshold_uncertainty_score":0.0074041486},"labels":[],"label_agreement":null},{"id":"W2070389616","doi":"10.1109/socc.2012.6398325","title":"A power-area analysis of NoCs in FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"","keywords":"Crossbar switch; Router; Computer science; Field-programmable gate array; Parallel computing; Network topology; Hypercube; Computer architecture; Topology (electrical circuits); Dynamic demand; Power (physics); Sizing; Embedded system; Computer network; Engineering","score_opus":0.018352337645698113,"score_gpt":0.24709516927840636,"score_spread":0.22874283163270825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070389616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15017325,0.003366101,0.8148254,0.0004903871,0.00008667617,0.00004272008,0.00030884764,0.00062769995,0.03007891],"genre_scores_gemma":[0.93283755,0.0025515272,0.057624567,0.000091495865,0.000055957622,0.00007050497,0.0001650383,0.00011175382,0.006491631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982494,0.000031710475,0.0000062229515,0.000017717804,0.00009552576,0.00002404431],"domain_scores_gemma":[0.9997402,0.00015409749,0.00002448576,0.000028140128,0.000048190977,0.000004949418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019575027,0.00056734844,0.0002658896,0.0005007772,0.00025395633,0.00036224735,0.0003602985,0.00025510878,0.0022554111],"category_scores_gemma":[0.0013613272,0.00022070335,0.00032451536,0.0003610441,0.00034797256,0.0009861605,0.0001933855,0.00033798974,0.00034801272],"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.000010312419,0.0000065183735,0.00022364003,0.000046595138,0.000008561493,0.00005383303,0.000023795292,0.9610342,0.003405365,0.02387238,0.00039719456,0.010917613],"study_design_scores_gemma":[0.0000021854262,0.000016370997,0.00017222569,0.000007851625,0.000004090451,0.000038114642,0.000011505438,0.98771024,0.0011308207,0.009240987,0.0016626545,0.0000029401],"about_ca_topic_score_codex":0.0022467736,"about_ca_topic_score_gemma":0.0017996876,"teacher_disagreement_score":0.0022554111,"about_ca_system_score_codex":0.00050801627,"about_ca_system_score_gemma":0.0003153416,"threshold_uncertainty_score":0.0075451136},"labels":[],"label_agreement":null},{"id":"W2070458953","doi":"10.1016/s0166-218x(02)00572-3","title":"Bounds on the average connectivity of a graph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Discrete mathematics; Planar graph; Disjoint sets; Cograph; Graph; Clique number; Upper and lower bounds; Split graph; Cartesian product; 1-planar graph; Chordal graph","score_opus":0.018037644797928777,"score_gpt":0.2266575634988209,"score_spread":0.20861991870089214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070458953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26304734,0.01588283,0.63681716,0.011967373,0.0007910648,0.0000975462,0.0029514874,0.002478027,0.06596724],"genre_scores_gemma":[0.9371758,0.008164917,0.04237354,0.0010225883,0.0017322819,0.00033746255,0.0019177117,0.0008782763,0.006397352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720925,0.0007390552,0.0001128982,0.00072925305,0.0007342146,0.00047533048],"domain_scores_gemma":[0.9148856,0.070710205,0.003285832,0.0045755175,0.00368763,0.0028551915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038213981,0.0022558672,0.0026361446,0.0056853946,0.0021927112,0.0049449676,0.0043139197,0.0028329229,0.01109816],"category_scores_gemma":[0.040703703,0.00120403,0.0014615413,0.0051533394,0.003927615,0.011046747,0.0039071646,0.0056880857,0.0011914127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000919098,0.00018390655,0.004807671,0.0011108567,0.00030703977,0.00044065507,0.00089034514,0.27961275,0.013058455,0.62066376,0.015612417,0.062392984],"study_design_scores_gemma":[0.00005485401,0.00016101713,0.002602657,0.00017586828,0.00015878846,0.00038164057,0.00016616134,0.43117946,0.0032045469,0.5571088,0.0047367834,0.00006935102],"about_ca_topic_score_codex":0.0020071599,"about_ca_topic_score_gemma":0.002639321,"teacher_disagreement_score":0.01109816,"about_ca_system_score_codex":0.0032637694,"about_ca_system_score_gemma":0.0009449683,"threshold_uncertainty_score":0.037127018},"labels":[],"label_agreement":null},{"id":"W2070774400","doi":"10.1142/s0219265909002510","title":"A GENERATING FUNCTION APPROACH TO THE SURFACE AREAS OF SOME INTERCONNECTION NETWORKS","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Chordal graph; Interconnection; Vertex (graph theory); Combinatorics; Indifference graph; Star (game theory); Mathematics; Surface (topology); Function (biology); Metric dimension; 1-planar graph; Computer science; Graph; Discrete mathematics; Geometry; Telecommunications; Mathematical analysis","score_opus":0.014167981880614784,"score_gpt":0.22609117503705403,"score_spread":0.21192319315643926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070774400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16717562,0.0015734178,0.79295796,0.00072737207,0.00013058461,0.000044832675,0.00019222521,0.00030936964,0.036888573],"genre_scores_gemma":[0.920841,0.001602771,0.06406546,0.00017151983,0.00055792223,0.00014883821,0.0002875053,0.00023995843,0.012084962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000088150555,0.000009587565,0.00003883138,0.00006489124,0.000039219107],"domain_scores_gemma":[0.9987204,0.00079403305,0.000107470216,0.00009380229,0.00021518378,0.000069093614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000616244,0.00066936517,0.0005169139,0.0025641383,0.00054613693,0.0011485246,0.0009225805,0.0008201731,0.004953269],"category_scores_gemma":[0.0032813232,0.00029319193,0.000628247,0.0011969119,0.0011745906,0.0026972292,0.0005828244,0.0011548024,0.00068969536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008301488,0.000013041754,0.00025307032,0.00003476886,0.0000075942203,0.00007307487,0.00009374976,0.024408417,0.0018585296,0.96076113,0.0007674724,0.011720834],"study_design_scores_gemma":[0.0000060986226,0.000021024853,0.00028906984,0.000012233738,0.000006981577,0.00014454575,0.000034058754,0.2333876,0.00085721986,0.7624382,0.0027905307,0.000012527997],"about_ca_topic_score_codex":0.00043372184,"about_ca_topic_score_gemma":0.0002791074,"teacher_disagreement_score":0.004953269,"about_ca_system_score_codex":0.0008072305,"about_ca_system_score_gemma":0.00024265262,"threshold_uncertainty_score":0.01657033},"labels":[],"label_agreement":null},{"id":"W2071906280","doi":"10.1002/cpe.663","title":"Providing soft real‐time quality of service guarantees for Java threads","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Computer science; Java; Operating system; Thread (computing); Quality of service; Scheduling (production processes); Virtual machine; Java concurrency; Overhead (engineering); Java applet; Distributed computing; Computer network","score_opus":0.051123579222311144,"score_gpt":0.35901710646179386,"score_spread":0.3078935272394827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071906280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32411796,0.0006314237,0.6549715,0.0003092802,0.00025974677,0.00013436,0.00008285467,0.013848835,0.005644045],"genre_scores_gemma":[0.9141123,0.00015296151,0.08151098,0.00012769582,0.00011061517,0.000101112484,0.00013528462,0.0009526457,0.0027963284],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974082,0.00064588507,0.00031771528,0.00030266627,0.0008818774,0.00044361278],"domain_scores_gemma":[0.9908387,0.0032082233,0.00121427,0.0022452646,0.0016518701,0.0008416812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043912916,0.00056815386,0.00068413164,0.00068871834,0.0006393608,0.0031046234,0.0020428046,0.00077170087,0.0018094822],"category_scores_gemma":[0.014069117,0.00065217353,0.00036352873,0.00036413834,0.0008064743,0.0023798463,0.0022436013,0.0012547259,0.00055480975],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075720707,0.0009560995,0.03181898,0.000744046,0.0003367273,0.0010125232,0.0021102212,0.112761386,0.3044927,0.100203015,0.020190272,0.41780198],"study_design_scores_gemma":[0.00049509306,0.00033683202,0.0019132235,0.00004146387,0.00008847608,0.00018615881,0.000065776185,0.9159246,0.04652869,0.020502565,0.013853326,0.000063776424],"about_ca_topic_score_codex":0.0017746018,"about_ca_topic_score_gemma":0.0014791857,"teacher_disagreement_score":0.0043912916,"about_ca_system_score_codex":0.00069690443,"about_ca_system_score_gemma":0.0011230551,"threshold_uncertainty_score":0.023223698},"labels":[],"label_agreement":null},{"id":"W2072920387","doi":"10.1145/2536747.2536751","title":"An analytical model for on-chip interconnects in multimedia embedded systems","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Interconnection Networks and Systems","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":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; National High-tech Research and Development Program; Ministry of Science and Technology of the People's Republic of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Computer science; Interconnection; Chip; Network on a chip; Multimedia; Embedded system; Computer network; Telecommunications","score_opus":0.040460587334683426,"score_gpt":0.29666669400507356,"score_spread":0.2562061066703901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072920387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02352444,0.0035498182,0.94317013,0.0010914237,0.00025959633,0.00015713002,0.00041512895,0.0005336908,0.027298648],"genre_scores_gemma":[0.8231527,0.009657255,0.1150249,0.0006951562,0.0003754943,0.00077632046,0.0005521673,0.00027868545,0.04948727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.000106418156,0.000017580453,0.000059124584,0.00017020889,0.000062439605],"domain_scores_gemma":[0.99969304,0.0001316977,0.000048371083,0.000022846552,0.000090387955,0.000013704447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043335816,0.00089103973,0.0007195834,0.00083677017,0.0007384106,0.001251032,0.0021428312,0.002197664,0.0029899022],"category_scores_gemma":[0.0020287123,0.0004348715,0.0007049472,0.0015827465,0.0006699769,0.001954689,0.0006841766,0.0010406624,0.001208746],"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.000017584123,0.000029710032,0.00021687117,0.00009463582,0.000011991375,0.00024175967,0.00009121535,0.92562073,0.0038750004,0.06078638,0.0016869185,0.007327193],"study_design_scores_gemma":[0.0000026382545,0.000012992385,0.000041566633,0.000007411795,0.0000053575345,0.00004129239,0.00001045091,0.9927908,0.00017337527,0.0052650133,0.0016454597,0.000003636627],"about_ca_topic_score_codex":0.0054370575,"about_ca_topic_score_gemma":0.0042742332,"teacher_disagreement_score":0.0054370575,"about_ca_system_score_codex":0.0014262368,"about_ca_system_score_gemma":0.0010512763,"threshold_uncertainty_score":0.010810792},"labels":[],"label_agreement":null},{"id":"W2073360418","doi":"10.1137/050624376","title":"The Linking Probability of Deep Spider-Web Networks","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Random variable; Path (computing); Crossbar switch; Infinity; Idle; Statistics; Computer science; Mathematical analysis; Graph; Telecommunications","score_opus":0.01440824035959683,"score_gpt":0.2358730037668926,"score_spread":0.22146476340729576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073360418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833867,0.0013358815,0.14531748,0.0010730952,0.0000684715,0.00006476893,0.00033120444,0.00041143355,0.017530572],"genre_scores_gemma":[0.9893895,0.0007602985,0.004327647,0.0001113347,0.00006733601,0.000080530575,0.00019288347,0.00007385962,0.0049966467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.00017199248,0.000022424165,0.000116364055,0.00011822775,0.00015402962],"domain_scores_gemma":[0.99179614,0.0049897344,0.0013651515,0.00030296756,0.00043311503,0.0011129022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017884977,0.0007232788,0.0008555468,0.0023187392,0.0009839325,0.0024196277,0.0014585563,0.0017264878,0.004545654],"category_scores_gemma":[0.013122069,0.0008637741,0.000529485,0.0010413299,0.0022210577,0.0040991525,0.002008466,0.0013194185,0.000499497],"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.0002122087,0.00011105054,0.006550286,0.00020462296,0.00007985659,0.00048019306,0.0004599246,0.5870595,0.0041312375,0.3833883,0.0029987306,0.014324038],"study_design_scores_gemma":[0.000020511907,0.000043303655,0.001085424,0.000034881712,0.000021570633,0.0001226556,0.00007262662,0.84527075,0.0006540933,0.15182376,0.00082232384,0.000028138804],"about_ca_topic_score_codex":0.0016023353,"about_ca_topic_score_gemma":0.0012268856,"teacher_disagreement_score":0.004545654,"about_ca_system_score_codex":0.0015246004,"about_ca_system_score_gemma":0.0004658123,"threshold_uncertainty_score":0.015206754},"labels":[],"label_agreement":null},{"id":"W2073887468","doi":"10.1016/j.jss.2004.09.002","title":"Worst case constant time priority queue","year":2004,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Priority queue; Queue; Constant (computer programming); Computer science; Discrete time and continuous time; Topology (electrical circuits); Data structure; Distributed computing; Real-time computing; Computer network; Mathematics; Operating system; Combinatorics","score_opus":0.010786132188702259,"score_gpt":0.22381069664331485,"score_spread":0.2130245644546126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073887468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083244674,0.0023042264,0.8805689,0.0033973176,0.001572506,0.00026594146,0.00071602396,0.0058327066,0.022097657],"genre_scores_gemma":[0.8111683,0.000746095,0.16162239,0.000819601,0.00068475027,0.00010643666,0.0006300817,0.00048335706,0.02373894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954674,0.0007042382,0.00028006782,0.0008288819,0.0016518914,0.0010675666],"domain_scores_gemma":[0.98162144,0.0076560043,0.0011133834,0.0039922437,0.004303647,0.0013131318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052602957,0.0014429664,0.0017120905,0.0014372043,0.0036805158,0.008370446,0.0051872195,0.0020114502,0.016785765],"category_scores_gemma":[0.018900504,0.0009955709,0.0006030719,0.0021374025,0.0013663,0.005710806,0.0020177278,0.0032286735,0.0024946753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012823862,0.0015687797,0.00734412,0.00090835744,0.00040611203,0.0011856505,0.0008370687,0.23649184,0.042386863,0.31908116,0.07524856,0.30171767],"study_design_scores_gemma":[0.00048077543,0.0004539873,0.0003732087,0.000031750733,0.0001770289,0.0006232445,0.00016213758,0.88623303,0.01124466,0.09047165,0.009681586,0.00006696454],"about_ca_topic_score_codex":0.005873716,"about_ca_topic_score_gemma":0.007745815,"teacher_disagreement_score":0.016785765,"about_ca_system_score_codex":0.0040456844,"about_ca_system_score_gemma":0.0071492614,"threshold_uncertainty_score":0.056154013},"labels":[],"label_agreement":null},{"id":"W2074936929","doi":"10.1109/iscc.2011.5983963","title":"Performance evaluation of crosspoint queued switch under the heavy traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Telus (Canada)","funders":"","keywords":"Computer science; Latency (audio); Scheduling (production processes); Queueing theory; Queue; Throughput; Computer network; Airfield traffic pattern; Parallel computing; Real-time computing; Mathematical optimization; Operating system; Mathematics; Wireless","score_opus":0.07731104316888525,"score_gpt":0.27121689140621963,"score_spread":0.19390584823733437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074936929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832322,0.00018937803,0.015375688,0.000030384052,0.000021974804,0.000016900422,0.00006139749,0.00029031717,0.00078175083],"genre_scores_gemma":[0.9982994,0.000036549485,0.0013760102,0.000009441018,0.0000048484594,0.000003772881,0.00005208699,0.000010146427,0.00020778998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.00015221194,0.000035215653,0.0001724654,0.00020836596,0.00021633494],"domain_scores_gemma":[0.99867564,0.0005913236,0.00011943419,0.00012301691,0.0003652125,0.00012534346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011487791,0.0006067004,0.0005087922,0.0006555101,0.0005601971,0.0009063745,0.0006537374,0.0003352162,0.0021179707],"category_scores_gemma":[0.0015301876,0.00012237654,0.0002768053,0.00059869984,0.00031880912,0.00053928606,0.00037010972,0.00032691166,0.00017480632],"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.0062391423,0.00070214213,0.028514067,0.00029262595,0.0003659726,0.0007792671,0.00042130717,0.6317738,0.2559154,0.0036399467,0.000996667,0.07035951],"study_design_scores_gemma":[0.00006931675,0.0016706613,0.008169668,0.000006221497,0.00007548065,0.00018294711,0.00009157668,0.93257314,0.056138556,0.0006464776,0.0003455524,0.00003030273],"about_ca_topic_score_codex":0.004295544,"about_ca_topic_score_gemma":0.0017137774,"teacher_disagreement_score":0.004295544,"about_ca_system_score_codex":0.0013655924,"about_ca_system_score_gemma":0.0006834643,"threshold_uncertainty_score":0.00990808},"labels":[],"label_agreement":null},{"id":"W2076069927","doi":"10.1109/fpl.2013.6645496","title":"The power of communication: Energy-efficient NOCS for FPGAS","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":26,"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":"Field-programmable gate array; Computer science; Embedded system; Power (physics); Efficient energy use; Energy (signal processing); Computer architecture; Electrical engineering; Engineering","score_opus":0.012699351644659839,"score_gpt":0.22503363967283327,"score_spread":0.21233428802817342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076069927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.393148,0.0100086555,0.52158874,0.003853265,0.0006173434,0.00007219475,0.00020739004,0.0015963649,0.06890817],"genre_scores_gemma":[0.917097,0.0015620581,0.069356404,0.0003384989,0.00009793263,0.000040337847,0.00012672131,0.000106475316,0.011274665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998479,0.00003736963,0.000009417046,0.000018241184,0.000055649583,0.00003136149],"domain_scores_gemma":[0.99973506,0.00012277356,0.000031483265,0.00004309905,0.00005159167,0.000016048349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002032709,0.00035093407,0.0001623474,0.00029322016,0.00026178992,0.00063212664,0.00046122537,0.00021611834,0.0035805034],"category_scores_gemma":[0.0009862249,0.00016110031,0.00011337007,0.0002971726,0.00027755686,0.0010815478,0.00035838215,0.00033752574,0.00044247127],"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.0005756607,0.00013068576,0.004898796,0.00068595883,0.00009180819,0.0005536128,0.00015832383,0.2263416,0.18913601,0.12196901,0.012105561,0.44335303],"study_design_scores_gemma":[0.00013559803,0.000649307,0.0060034245,0.00020561474,0.0001304551,0.00073428144,0.00021353511,0.6664807,0.13460185,0.099927105,0.09084897,0.000069225265],"about_ca_topic_score_codex":0.00036297433,"about_ca_topic_score_gemma":0.0011154216,"teacher_disagreement_score":0.0035805034,"about_ca_system_score_codex":0.00028962604,"about_ca_system_score_gemma":0.00017054545,"threshold_uncertainty_score":0.01197803},"labels":[],"label_agreement":null},{"id":"W2076983944","doi":"10.1007/s00224-002-1033-y","title":"Routing in Series Parallel Networks","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Series (stratigraphy); Computer science; Routing (electronic design automation); Parallel computing; Computer network; Geology","score_opus":0.014618892094267057,"score_gpt":0.22344835629857523,"score_spread":0.20882946420430817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076983944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08610388,0.0048447675,0.8560532,0.0020663505,0.0009252579,0.00009216256,0.00024110865,0.00089883833,0.04877447],"genre_scores_gemma":[0.82138443,0.007894067,0.11622857,0.0005344949,0.0009901065,0.00023105796,0.00059449713,0.000336843,0.051805798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996848,0.00009239956,0.000022550195,0.00007225945,0.00009154054,0.000036517995],"domain_scores_gemma":[0.9991252,0.00041346933,0.00012511009,0.0001290105,0.00014854016,0.000058793812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051237975,0.00045200036,0.0006435862,0.0008338419,0.00063967897,0.0016922115,0.0007394052,0.0007159314,0.0049871034],"category_scores_gemma":[0.0026541776,0.000418169,0.0004182864,0.0011952348,0.0007580442,0.001986197,0.00066247163,0.00081315427,0.00067230285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121813384,0.000053171276,0.0004894658,0.0001674784,0.000037946094,0.000107606604,0.000112033245,0.20980398,0.0037999982,0.701299,0.008378066,0.07562946],"study_design_scores_gemma":[0.000023155844,0.000035483135,0.0001609652,0.000018771498,0.000026022877,0.000097451266,0.00003020028,0.36707157,0.0010161566,0.61972404,0.011784879,0.000011319253],"about_ca_topic_score_codex":0.0010065454,"about_ca_topic_score_gemma":0.00094532844,"teacher_disagreement_score":0.0049871034,"about_ca_system_score_codex":0.0008290913,"about_ca_system_score_gemma":0.0005385289,"threshold_uncertainty_score":0.01668346},"labels":[],"label_agreement":null},{"id":"W2078539900","doi":"10.1109/fpl.2013.6645624","title":"NetThreads-10G: Software packet processing on NetFPGA-10G in a virtualized networking environment demonstration abstract","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Computer science; Software; Network packet; Software-defined networking; Packet processing; Computer network; Operating system; Embedded system","score_opus":0.018555762854359666,"score_gpt":0.22387421557828907,"score_spread":0.2053184527239294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078539900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380741,0.0004489867,0.245442,0.0006842888,0.0004999822,0.00046883326,0.0011547649,0.06421065,0.049016338],"genre_scores_gemma":[0.8664333,0.00017520801,0.112618275,0.00024988817,0.000037399226,0.0002287376,0.0012759771,0.0023546133,0.016626587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998055,0.000034188644,0.0000058295523,0.000026409465,0.00007546854,0.00005268493],"domain_scores_gemma":[0.9997696,0.0000688884,0.000016653832,0.000033676268,0.000045005156,0.00006603171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044158788,0.0006862918,0.0002782829,0.0002887622,0.0002126198,0.00041985017,0.0010396116,0.00041944196,0.0067851683],"category_scores_gemma":[0.00032111094,0.00015769499,0.00020953218,0.00016880511,0.00028367585,0.00050719135,0.0004139825,0.00076361385,0.00096076383],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.004126358,0.0019857935,0.006401939,0.0006454968,0.00014749051,0.0034900089,0.0009468777,0.07006049,0.52329725,0.020491133,0.096626535,0.27178064],"study_design_scores_gemma":[0.00057277107,0.003179409,0.011158235,0.000093238035,0.000044574732,0.0011007724,0.00012469824,0.55266273,0.32720628,0.0031979347,0.10054022,0.00011907041],"about_ca_topic_score_codex":0.0014536711,"about_ca_topic_score_gemma":0.0012636387,"teacher_disagreement_score":0.0067851683,"about_ca_system_score_codex":0.00038073672,"about_ca_system_score_gemma":0.00026310357,"threshold_uncertainty_score":0.022698581},"labels":[],"label_agreement":null},{"id":"W2078655426","doi":"10.1142/s0219265912500077","title":"A UNIFIED APPROACH TO THE CONDITIONAL DIAGNOSABILITY OF INTERCONNECTION NETWORKS","year":2012,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Dual (grammatical number); Computer science; Cayley graph; Theoretical computer science; Discrete mathematics; Mathematics; Computer network; Graph","score_opus":0.01871149027825394,"score_gpt":0.24298892823241747,"score_spread":0.22427743795416352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078655426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007230835,0.00011925599,0.9898775,0.000110019886,0.000020332038,0.000012567679,0.000034386394,0.00008453097,0.002510564],"genre_scores_gemma":[0.77141696,0.0008801102,0.22358502,0.00018120976,0.00021424404,0.00017126679,0.00023718814,0.00009766028,0.0032163817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988846,0.00026968695,0.00006467983,0.00021773636,0.00043526536,0.00012804662],"domain_scores_gemma":[0.9971818,0.00171647,0.00018761063,0.00040727144,0.0004137312,0.000093224866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017106151,0.0007743923,0.00073196256,0.0015296121,0.0004724069,0.0013460041,0.002004823,0.0008954266,0.0028602143],"category_scores_gemma":[0.006960555,0.00042617254,0.0009168626,0.0011792284,0.0025706491,0.004410103,0.0021268458,0.0025513978,0.00019618263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017603694,0.000018145925,0.0002973262,0.00006437941,0.00001970163,0.00013738584,0.00007394297,0.22840601,0.002782163,0.7558367,0.0004031914,0.011943418],"study_design_scores_gemma":[0.0000066531716,0.00002762477,0.000107326065,0.000011696373,0.000011077864,0.000070479255,0.000015087102,0.6436732,0.0011829219,0.35400945,0.00087156094,0.000012909003],"about_ca_topic_score_codex":0.00093425374,"about_ca_topic_score_gemma":0.0010266795,"teacher_disagreement_score":0.0028602143,"about_ca_system_score_codex":0.0014560721,"about_ca_system_score_gemma":0.0011387776,"threshold_uncertainty_score":0.010564566},"labels":[],"label_agreement":null},{"id":"W2079080010","doi":"10.1109/sarnof.2009.4850287","title":"Bounds on end-to-end delay and jitter in input-buffered and internally-buffered IP networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); McMaster University","funders":"","keywords":"Jitter; Computer science; Computer network; End-to-end delay; Token bucket; Queueing theory; Quality of service; Queue; Voice over IP; Bounded function; Topology (electrical circuits); Real-time computing; Algorithm; Network packet; Mathematics; Telecommunications; Electrical engineering; Engineering","score_opus":0.010672804039854735,"score_gpt":0.23214991677857166,"score_spread":0.22147711273871692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079080010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049841087,0.004043723,0.93391025,0.00029184204,0.00014847776,0.000053279517,0.00020458046,0.0007086985,0.010798074],"genre_scores_gemma":[0.85213023,0.0038009253,0.13921627,0.00015136054,0.00020369593,0.00021429943,0.0004227276,0.00027925245,0.00358124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983094,0.00029230138,0.00010371451,0.00017724393,0.00075419206,0.00036323204],"domain_scores_gemma":[0.9903086,0.0068205334,0.0004626785,0.00065922376,0.0014761414,0.00027284055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037204765,0.0018566975,0.0007468712,0.0013369648,0.0009183419,0.0030428518,0.0023945258,0.0009513462,0.0018321187],"category_scores_gemma":[0.019544866,0.0005784547,0.0004138448,0.0011404391,0.0014672778,0.0034297444,0.0015501443,0.0019482225,0.00040205132],"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.00051461754,0.00008299749,0.001265694,0.00026822597,0.00005133232,0.00017480967,0.00017283554,0.8476171,0.015226929,0.07882311,0.001278697,0.05452357],"study_design_scores_gemma":[0.000011558019,0.000077935845,0.0003190619,0.0000478421,0.00003074629,0.00006390122,0.00003608774,0.97321856,0.007429148,0.017609637,0.0011391925,0.000016340415],"about_ca_topic_score_codex":0.0037479105,"about_ca_topic_score_gemma":0.0030915856,"teacher_disagreement_score":0.0037479105,"about_ca_system_score_codex":0.0028453574,"about_ca_system_score_gemma":0.001910767,"threshold_uncertainty_score":0.020644665},"labels":[],"label_agreement":null},{"id":"W2079133422","doi":"10.1145/2786572.2786593","title":"Data Criticality in Network-On-Chip Design","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Criticality; Computer science; Network on a chip; Energy (signal processing); Embedded system; Chip; Word (group theory); System on a chip; Computer network; Telecommunications","score_opus":0.26901365446310094,"score_gpt":0.33705001683382213,"score_spread":0.06803636237072119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079133422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055089414,0.029268472,0.86794627,0.0043731774,0.00082550035,0.00028068884,0.00016541274,0.0009046561,0.041146405],"genre_scores_gemma":[0.5807129,0.017475503,0.3884439,0.0014873976,0.0003846557,0.00038695935,0.00015914891,0.00026500635,0.010684535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992448,0.00022308678,0.000050704395,0.00010627778,0.00030368543,0.00007150534],"domain_scores_gemma":[0.9989905,0.00045193284,0.00010220313,0.00014223235,0.00027464205,0.000038506278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011991063,0.0005015035,0.00026705343,0.00045637813,0.0004428046,0.0012580113,0.0008936432,0.0005426795,0.0017521473],"category_scores_gemma":[0.002731858,0.0003883494,0.00016301921,0.0004696437,0.0008805576,0.0016742208,0.0006101243,0.00087213854,0.0003511121],"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.00016992068,0.000076025266,0.0022631278,0.0018660588,0.00007155835,0.00047786365,0.00048263487,0.1887774,0.034531623,0.4032385,0.01165574,0.3563894],"study_design_scores_gemma":[0.000077476354,0.00064365764,0.00089617807,0.00066480046,0.00017192209,0.0009200369,0.00033230468,0.28539634,0.05665715,0.32396418,0.3301871,0.00008884385],"about_ca_topic_score_codex":0.00094245165,"about_ca_topic_score_gemma":0.0020615405,"teacher_disagreement_score":0.0017521473,"about_ca_system_score_codex":0.0010202447,"about_ca_system_score_gemma":0.0010977383,"threshold_uncertainty_score":0.0074023604},"labels":[],"label_agreement":null},{"id":"W2079204292","doi":"10.5555/1400549.1400621","title":"Fault-tolerance and reconfiguration of circulant graphs and hypercubes","year":2008,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Interconnection Networks and Systems","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":"Dalhousie University","funders":"","keywords":"Hypercube; Circulant matrix; Control reconfiguration; Computer science; Fault tolerance; Interconnection; Parallel computing; Theoretical computer science; Distributed computing; Algorithm; Computer network; Embedded system","score_opus":0.03581686231883916,"score_gpt":0.2477439115306207,"score_spread":0.21192704921178154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079204292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09115822,0.0011097075,0.88992053,0.00023712341,0.00019347802,0.00005516953,0.00008129738,0.0005433765,0.016701162],"genre_scores_gemma":[0.78769445,0.0015381566,0.20341216,0.00015901106,0.00013776231,0.00012234371,0.00024144832,0.000114896335,0.0065797786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995394,0.00018741359,0.000020938456,0.00006916096,0.00011612552,0.0000669277],"domain_scores_gemma":[0.9995413,0.0001849294,0.000085691914,0.0000877176,0.00006925289,0.000031170013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034869034,0.0004033054,0.0003399866,0.0005672668,0.00041868808,0.0006197072,0.00045749906,0.000540407,0.00139539],"category_scores_gemma":[0.001483483,0.00017967181,0.00040600527,0.0006551994,0.0005497065,0.00075103756,0.0004416203,0.00040527503,0.00025902857],"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.000087886234,0.000042196276,0.0005860336,0.0001301462,0.000038848273,0.0003213657,0.0001167352,0.58992225,0.022140993,0.32845986,0.002688333,0.055465303],"study_design_scores_gemma":[0.00002589206,0.00007389093,0.00040120335,0.000018103141,0.000017448,0.00020016184,0.00004810766,0.8470225,0.008339755,0.13415846,0.009669453,0.000025057947],"about_ca_topic_score_codex":0.0017667414,"about_ca_topic_score_gemma":0.0017596151,"teacher_disagreement_score":0.0017667414,"about_ca_system_score_codex":0.00059764285,"about_ca_system_score_gemma":0.00051395333,"threshold_uncertainty_score":0.0046681166},"labels":[],"label_agreement":null},{"id":"W2079989676","doi":"10.1016/j.disc.2004.09.001","title":"A family of switch equivalent graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets","score_opus":0.023447709108356495,"score_gpt":0.255370136399964,"score_spread":0.23192242729160747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079989676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4726623,0.0013463051,0.36057672,0.0012912885,0.00023566106,0.00017043928,0.0009760115,0.000986331,0.16175511],"genre_scores_gemma":[0.929068,0.0009613638,0.031230958,0.00045115425,0.00009294977,0.00012938699,0.0009593951,0.00015098434,0.03695584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997421,0.00004908404,0.000009623096,0.000081548555,0.00007696323,0.00004062184],"domain_scores_gemma":[0.99937904,0.00023568433,0.000084048974,0.000095083786,0.00011972433,0.000086409054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023620336,0.0005203598,0.00037907218,0.00075625296,0.0008721061,0.0011109493,0.00064237474,0.0006639884,0.008492326],"category_scores_gemma":[0.001341185,0.0002556235,0.0005062657,0.0006593689,0.0005831695,0.0014000969,0.00056012295,0.00089252414,0.00061720295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018726823,0.00007708896,0.0010326811,0.00010446531,0.000045420333,0.0006869914,0.0002952905,0.00882308,0.0068709007,0.9374506,0.0061396654,0.03828656],"study_design_scores_gemma":[0.000065112974,0.00008411327,0.0013253366,0.0000322383,0.00004487359,0.0012178012,0.00015695556,0.05422141,0.0029700988,0.90976083,0.030100854,0.000020340276],"about_ca_topic_score_codex":0.0005912627,"about_ca_topic_score_gemma":0.00044131267,"teacher_disagreement_score":0.008492326,"about_ca_system_score_codex":0.00050054124,"about_ca_system_score_gemma":0.00030127857,"threshold_uncertainty_score":0.02840966},"labels":[],"label_agreement":null},{"id":"W2081883574","doi":"10.1145/2000064.2000113","title":"DBAR","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":174,"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":"National University of Defense Technology","keywords":"Computer science; Computer network; Distributed computing; Adaptive routing; Workload; Routing (electronic design automation); Network congestion; Static routing; Active queue management; Routing protocol","score_opus":0.047213075136786416,"score_gpt":0.1959236349263584,"score_spread":0.14871055978957198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081883574","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063705714,0.009300689,0.07700404,0.008452871,0.014958235,0.00037428894,0.011094421,0.017088512,0.85535634],"genre_scores_gemma":[0.06958779,0.006947506,0.035364855,0.0046442254,0.0032815177,0.00035292053,0.029407874,0.0030797503,0.84733343],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99827623,0.0002001109,0.00011263733,0.00045360022,0.0007128029,0.00024448725],"domain_scores_gemma":[0.9977367,0.0001746782,0.00010112473,0.0005909423,0.0009886648,0.00040796975],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014565199,0.0011176234,0.0010429774,0.002039872,0.0016104173,0.0062880125,0.002348871,0.0021938714,0.31324232],"category_scores_gemma":[0.0032090917,0.00047005084,0.0005806258,0.0018831348,0.0007151718,0.0030782002,0.0038341805,0.0021532788,0.33356088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00037789415,0.00015407782,0.0010030913,0.00047870373,0.000039213348,0.0002256526,0.00009975782,0.0010163232,0.004930855,0.04941633,0.54446715,0.39779088],"study_design_scores_gemma":[0.000032226548,0.000039274593,0.00030070302,0.00007069097,0.000010891442,0.000260756,0.000052037627,0.0016359101,0.0025483964,0.007608679,0.98742175,0.000018600544],"about_ca_topic_score_codex":0.0016789985,"about_ca_topic_score_gemma":0.0018195013,"teacher_disagreement_score":0.6867577,"about_ca_system_score_codex":0.001248126,"about_ca_system_score_gemma":0.0017346796,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2082295213","doi":"10.1109/fpt.2012.6412118","title":"Design tradeoffs for hard and soft FPGA-based Networks-on-Chip","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":47,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Router; Computer science; Interconnection; Application-specific integrated circuit; Embedded system; Crossbar switch; Control reconfiguration; Computer architecture; Computer hardware; Computer network; Telecommunications","score_opus":0.05756283642609154,"score_gpt":0.24970106323424357,"score_spread":0.192138226808152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082295213","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.779228,0.0040630423,0.1677358,0.0012496202,0.00016291942,0.00012250466,0.00016256291,0.00059662794,0.04667895],"genre_scores_gemma":[0.94214857,0.0005928846,0.053148046,0.00021119017,0.000030410756,0.00005081482,0.000085875916,0.00006577105,0.0036663986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989442,0.00031129818,0.00006873116,0.00008360654,0.0004002698,0.00019191515],"domain_scores_gemma":[0.99827933,0.0008817524,0.00026447058,0.00019769151,0.00027688436,0.000099941084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009801904,0.00053181424,0.0002121251,0.00060865254,0.000284798,0.001461382,0.0006188812,0.0004055251,0.0027609435],"category_scores_gemma":[0.003166009,0.00024062383,0.00016408264,0.0004172062,0.00029273107,0.0011518055,0.00041578995,0.00037784284,0.00040467278],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014120996,0.00021451806,0.011829906,0.0009904256,0.00015506824,0.00062377646,0.0002924705,0.211689,0.25210825,0.04861608,0.0037735344,0.46829486],"study_design_scores_gemma":[0.000339221,0.0033916375,0.021224456,0.00030584048,0.0004400631,0.0016643022,0.00073293824,0.65412235,0.2469799,0.034807418,0.03586362,0.00012837406],"about_ca_topic_score_codex":0.0006586356,"about_ca_topic_score_gemma":0.0023278766,"teacher_disagreement_score":0.0027609435,"about_ca_system_score_codex":0.0007352971,"about_ca_system_score_gemma":0.0004910172,"threshold_uncertainty_score":0.009236276},"labels":[],"label_agreement":null},{"id":"W2082805532","doi":"10.5539/cis.v5n1p2","title":"New “Graphiton” Model: a Computational Discrete Space, Self-Encoded as a Trivalent Graph","year":2011,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Theoretical computer science; Graph theory; Redundancy (engineering); Discrete space; Binary number; Topology (electrical circuits); ENCODE; Graph; Computation; Information theory; Algorithm; Mathematics","score_opus":0.015288807676764138,"score_gpt":0.22880253845398968,"score_spread":0.21351373077722555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082805532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1726965,0.0009888376,0.7006044,0.003969195,0.0012408007,0.00014070247,0.0005749962,0.00080531964,0.11897921],"genre_scores_gemma":[0.86630493,0.00085534446,0.09623448,0.0012505772,0.00029491197,0.0002793622,0.000455408,0.00017466457,0.034150295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979097,0.000057903526,0.000008690769,0.00004229163,0.000062465864,0.00003767556],"domain_scores_gemma":[0.9997615,0.00005621196,0.000022024766,0.00005466706,0.000047660546,0.00005784646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028521894,0.00029350907,0.00044831942,0.0007151875,0.00083418965,0.0024477923,0.0009609593,0.0014100081,0.004934896],"category_scores_gemma":[0.00067982054,0.00021887098,0.00069472875,0.0005546728,0.0021115115,0.0030194046,0.0010025894,0.0011985633,0.00075398164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020062163,0.000012606712,0.000057311874,0.0000186455,0.0000058125665,0.000064471955,0.000057206315,0.0053638676,0.0016629304,0.98990834,0.0011271561,0.0017016401],"study_design_scores_gemma":[0.000029385781,0.000049322476,0.00009806776,0.000014564785,0.000012343939,0.00020560207,0.00010070175,0.12923002,0.0013457243,0.8568516,0.012040153,0.000022467519],"about_ca_topic_score_codex":0.00075695344,"about_ca_topic_score_gemma":0.0006384651,"teacher_disagreement_score":0.004934896,"about_ca_system_score_codex":0.0008889303,"about_ca_system_score_gemma":0.00074101525,"threshold_uncertainty_score":0.016508937},"labels":[],"label_agreement":null},{"id":"W2083095768","doi":"10.1109/fpt.2007.4439281","title":"A Case for Soft Vector Processors in FPGAs","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of British Columbia","funders":"","keywords":"Stratix; Computer science; Field-programmable gate array; Benchmark (surveying); Vector processor; Speedup; Parallel computing; Software; Embedded system; Computer architecture; Computer hardware; Operating system","score_opus":0.026097049859528126,"score_gpt":0.27420228948630077,"score_spread":0.24810523962677264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083095768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15133685,0.018117659,0.39690277,0.06718851,0.0043828506,0.00019708264,0.00019020222,0.003379398,0.3583047],"genre_scores_gemma":[0.6977177,0.0056612873,0.20849362,0.0074624945,0.0013536578,0.00016828622,0.00011131178,0.00043107,0.07860049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989222,0.0002820381,0.000054237054,0.00014848902,0.00044377928,0.00014926339],"domain_scores_gemma":[0.9986987,0.00047467774,0.0000923653,0.00037217131,0.00022525473,0.00013681607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012820825,0.00046605975,0.0002826753,0.00050565944,0.0007151084,0.0024999494,0.0009899164,0.0016742981,0.009068812],"category_scores_gemma":[0.0032406207,0.00037582015,0.00036610287,0.00041628093,0.0019150048,0.004070969,0.0011863157,0.002167466,0.0025542693],"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.00033698799,0.00006898305,0.0028477027,0.00036221312,0.000028416895,0.001950869,0.00035613414,0.012219081,0.012712088,0.7488184,0.029682072,0.19061704],"study_design_scores_gemma":[0.0002146989,0.0008213843,0.0027392209,0.0005417294,0.000048790967,0.0053533455,0.0007622183,0.06316278,0.019560099,0.36642903,0.5402637,0.00010293315],"about_ca_topic_score_codex":0.0008998531,"about_ca_topic_score_gemma":0.0011692334,"teacher_disagreement_score":0.009068812,"about_ca_system_score_codex":0.0005465796,"about_ca_system_score_gemma":0.00041545357,"threshold_uncertainty_score":0.030338228},"labels":[],"label_agreement":null},{"id":"W2083551465","doi":"10.1109/wamca.2012.11","title":"Optimal Virtual Channel Insertion for Contention Alleviation and Deadlock Avoidance in Custom NoCs","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deadlock; Computer science; Benchmark (surveying); Virtual channel; Deadlock prevention algorithms; Network on a chip; Performance improvement; Channel (broadcasting); Power (physics); Resource (disambiguation); Embedded system; Distributed computing; Parallel computing; Computer network; Engineering","score_opus":0.02362048649212971,"score_gpt":0.24428830721069436,"score_spread":0.22066782071856464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083551465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5056999,0.0006163023,0.4896356,0.000089739595,0.00005839606,0.00007510928,0.000029995626,0.0014171527,0.002377821],"genre_scores_gemma":[0.92032737,0.00009174957,0.078789726,0.000030148163,0.000011302348,0.00002108114,0.00002805544,0.000045769317,0.0006548163],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961853,0.000101825455,0.000033147004,0.000045645775,0.0001066199,0.00009420252],"domain_scores_gemma":[0.9990145,0.00034117364,0.00022386388,0.00019962259,0.00015594215,0.00006488731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119933,0.0002784976,0.0002869471,0.00057247374,0.0003472801,0.00041924146,0.000838465,0.00019130795,0.0006700468],"category_scores_gemma":[0.0012326767,0.00023346907,0.00017573753,0.00043361806,0.0004018333,0.0006820269,0.00058899156,0.00027138248,0.00008005731],"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.0008415757,0.00045232588,0.0056091826,0.00026716437,0.000057413083,0.00036272622,0.0002934193,0.19662674,0.46233356,0.010036481,0.0013231084,0.3217962],"study_design_scores_gemma":[0.00007248198,0.00046469207,0.0017222187,0.000024636585,0.00005808609,0.00033762955,0.00008055884,0.7685763,0.22291774,0.0028822706,0.0028126838,0.000050719715],"about_ca_topic_score_codex":0.00090950646,"about_ca_topic_score_gemma":0.0023466898,"teacher_disagreement_score":0.00090950646,"about_ca_system_score_codex":0.000424158,"about_ca_system_score_gemma":0.00088307494,"threshold_uncertainty_score":0.003077507},"labels":[],"label_agreement":null},{"id":"W2083663758","doi":"10.1109/icecs.2007.4511159","title":"An Isometric on on-Chip Multiprocessor Architecture","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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; Université de Montréal; Université du Québec","funders":"","keywords":"Computer science; Multiprocessing; Architecture; Bottleneck; Parallel computing; Chip; Computer architecture; Embedded system; Telecommunications","score_opus":0.01668591078219689,"score_gpt":0.2686682837961262,"score_spread":0.2519823730139293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083663758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13539349,0.0019244772,0.790316,0.0007732479,0.00066748593,0.00013806677,0.00020488992,0.002858687,0.06772366],"genre_scores_gemma":[0.6312987,0.0008541107,0.35347736,0.00042051627,0.00014472497,0.00015789444,0.00040827374,0.00011437698,0.013124043],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998629,0.000029158637,0.0000074811765,0.000027933515,0.000044753997,0.000027747501],"domain_scores_gemma":[0.9998468,0.000018624725,0.000009468059,0.00005293576,0.000048229413,0.000023952054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012618463,0.000197264,0.00025534775,0.00022096653,0.00031939204,0.00055803405,0.0008619073,0.00027199145,0.0028363694],"category_scores_gemma":[0.00034285258,0.00011468738,0.000249334,0.0003515207,0.00025215597,0.0006913389,0.00056207716,0.0003810479,0.00044714403],"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.0002984599,0.00018184505,0.0022015471,0.0004358741,0.00012640437,0.00047632004,0.00019863633,0.116471134,0.11191913,0.331358,0.023143994,0.41318873],"study_design_scores_gemma":[0.000057627047,0.00041863183,0.001884252,0.000036813348,0.000089521345,0.00052640063,0.00007208171,0.79230034,0.023325423,0.065839656,0.115396865,0.000052317224],"about_ca_topic_score_codex":0.001141259,"about_ca_topic_score_gemma":0.0017448805,"teacher_disagreement_score":0.0028363694,"about_ca_system_score_codex":0.00033360525,"about_ca_system_score_gemma":0.00062080676,"threshold_uncertainty_score":0.009488642},"labels":[],"label_agreement":null},{"id":"W2085629207","doi":"10.1007/s10836-013-5398-4","title":"A Fault Tolerant Hierarchical Network on Chip Router Architecture","year":2013,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; Network on a chip; Redundancy (engineering); Virtual channel; Fault tolerance; Router; Latency (audio); Computer science; Network packet; Embedded system; Computer network; Distributed computing; Engineering; Channel (broadcasting)","score_opus":0.013691614012416716,"score_gpt":0.22269823189506682,"score_spread":0.2090066178826501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085629207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3091139,0.0013341524,0.65167946,0.0009001245,0.0004100109,0.00027055753,0.0003805962,0.01007674,0.025834514],"genre_scores_gemma":[0.77828646,0.00024454074,0.21248564,0.0002819882,0.000061439176,0.00008786491,0.00033964368,0.00009801206,0.00811432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983287,0.000038497237,0.000011689066,0.000031464217,0.00005333488,0.000032174667],"domain_scores_gemma":[0.9996681,0.00004920404,0.000035095458,0.00010509783,0.000100079065,0.000042428426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002118494,0.000254369,0.00033038226,0.00051151915,0.00050826673,0.00062332593,0.0015360408,0.000479104,0.0037717815],"category_scores_gemma":[0.00043667227,0.00019146726,0.00023695065,0.00039787067,0.00023755779,0.0006567777,0.00047552463,0.0003704784,0.00058532174],"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.000993627,0.0005384462,0.0036527899,0.00049369555,0.0001991707,0.0007266651,0.00023872587,0.25503954,0.22033785,0.07780429,0.026489854,0.41348535],"study_design_scores_gemma":[0.00011065646,0.0010054098,0.0014275812,0.00003038129,0.00015437974,0.0003161543,0.00005992135,0.93646604,0.034182705,0.012833157,0.013364257,0.000049347243],"about_ca_topic_score_codex":0.002254007,"about_ca_topic_score_gemma":0.00558701,"teacher_disagreement_score":0.0037717815,"about_ca_system_score_codex":0.00060293166,"about_ca_system_score_gemma":0.00080125284,"threshold_uncertainty_score":0.012617886},"labels":[],"label_agreement":null},{"id":"W2086236932","doi":"10.1016/j.tcs.2006.10.031","title":"Feasibility and complexity of broadcasting with random transmission failures","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Transmission (telecommunications); Computer science; Theoretical computer science; Distributed computing; Computer network; Telecommunications","score_opus":0.022599235541769923,"score_gpt":0.24212688485675357,"score_spread":0.21952764931498364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086236932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51857543,0.001814225,0.39013284,0.020155841,0.00037981648,0.0004082016,0.002721587,0.0005900552,0.06522208],"genre_scores_gemma":[0.95540935,0.0010925146,0.031294413,0.0005319624,0.00078002806,0.0004532315,0.0011036689,0.00023087114,0.009103846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267393,0.0035272925,0.0003127821,0.0009005826,0.001619275,0.00096607907],"domain_scores_gemma":[0.8340752,0.1511346,0.005430402,0.003921791,0.002829272,0.0026086955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066791833,0.0012564756,0.0028847067,0.0021523691,0.0028468405,0.0074685784,0.005205954,0.004589945,0.012673139],"category_scores_gemma":[0.08304793,0.002730441,0.0021550776,0.0034335242,0.0062362836,0.017018724,0.0047047003,0.006414501,0.0008333435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001568003,0.00025186874,0.0022564023,0.00046863398,0.000107635424,0.00038308,0.0005915835,0.23684269,0.001595482,0.73582387,0.007974481,0.012136254],"study_design_scores_gemma":[0.00021616873,0.00004811234,0.0004408841,0.000026455567,0.000041801562,0.00014989631,0.00011552794,0.27293462,0.00047873633,0.72478217,0.0007264061,0.00003914047],"about_ca_topic_score_codex":0.0039178967,"about_ca_topic_score_gemma":0.0023377512,"teacher_disagreement_score":0.012673139,"about_ca_system_score_codex":0.004272762,"about_ca_system_score_gemma":0.004525759,"threshold_uncertainty_score":0.04239589},"labels":[],"label_agreement":null},{"id":"W2087805842","doi":"10.1016/j.sysarc.2010.03.005","title":"Combining mapping and partitioning exploration for NoC-based embedded systems","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Partition (number theory); Network on a chip; Pipeline (software); Exploit; Computer architecture; Key (lock); Flexibility (engineering); Architecture; Distributed computing; Interconnectivity; Embedded system; Operating system; Artificial intelligence","score_opus":0.022696673123449286,"score_gpt":0.2420556659753158,"score_spread":0.21935899285186652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087805842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52346146,0.0017771041,0.4648923,0.0003334623,0.000050801846,0.00010060061,0.00011750831,0.0015771906,0.0076895645],"genre_scores_gemma":[0.85429716,0.00030793974,0.14375412,0.00005065782,0.000013534948,0.000065435415,0.00015286298,0.00011283487,0.0012453607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.00010009606,0.00001135246,0.00002193821,0.000047471076,0.00002801106],"domain_scores_gemma":[0.9991596,0.0005729632,0.000050136354,0.00007873765,0.00010887827,0.000029737288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005402237,0.00066028757,0.00066849875,0.00092448026,0.00039542757,0.0004754476,0.0005926814,0.00047669944,0.001302091],"category_scores_gemma":[0.0019021436,0.00049489987,0.00038045537,0.0007930838,0.00029944186,0.0010620038,0.0007832723,0.00028949103,0.00011404232],"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.00035092092,0.00013400312,0.0023393568,0.00020227653,0.00008341114,0.00012339765,0.00021586278,0.7053675,0.02211454,0.0022592517,0.00091172784,0.26589772],"study_design_scores_gemma":[0.000017426833,0.00007417449,0.00041801477,0.000008736354,0.000026495545,0.000030450585,0.00005053396,0.9930058,0.003202464,0.0027221409,0.00043789714,0.000005873303],"about_ca_topic_score_codex":0.0025944284,"about_ca_topic_score_gemma":0.0049967645,"teacher_disagreement_score":0.0025944284,"about_ca_system_score_codex":0.00026888732,"about_ca_system_score_gemma":0.00066489517,"threshold_uncertainty_score":0.005158603},"labels":[],"label_agreement":null},{"id":"W2088502728","doi":"10.1145/2362336.2362348","title":"Modeling towards incremental early analyzability of networked avionics systems using virtual integration","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"Division of Computer and Network Systems; National Science Foundation","keywords":"Avionics; Computer science; Latency (audio); Integrated modular avionics; Shared resource; Software; Embedded system; Architecture; Distributed computing; Operating system","score_opus":0.04981730269383431,"score_gpt":0.2894205370019494,"score_spread":0.23960323430811512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088502728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038353045,0.00012883796,0.9581359,0.000057478792,0.000015352512,0.000059754584,0.000048984966,0.000494047,0.002706558],"genre_scores_gemma":[0.78475946,0.0003325513,0.21083556,0.00006283483,0.000029452172,0.00023327788,0.00018017535,0.0002642543,0.003302336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988972,0.00023857199,0.000059512884,0.00016397219,0.00045488772,0.00018583814],"domain_scores_gemma":[0.9978403,0.0012207036,0.0002324426,0.0002732131,0.00036338804,0.00006993951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566004,0.0012303009,0.0005341506,0.0011430548,0.0005097069,0.0015860263,0.0019345761,0.00078444876,0.001917074],"category_scores_gemma":[0.0052147796,0.0008496248,0.0012686067,0.00052854465,0.0013695329,0.0025670535,0.0014561227,0.0020929829,0.00028589164],"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.000037789847,0.000028649292,0.00056847476,0.00004242692,0.000016973188,0.00007243451,0.000108761764,0.96330774,0.005253358,0.023477089,0.0001309772,0.0069552856],"study_design_scores_gemma":[0.000002146624,0.0000115452285,0.00004409716,0.0000032125897,0.0000075602393,0.000007985783,0.000005404956,0.9944106,0.001249969,0.0039888932,0.00026593002,0.0000027275921],"about_ca_topic_score_codex":0.0053581884,"about_ca_topic_score_gemma":0.0031060996,"teacher_disagreement_score":0.0053581884,"about_ca_system_score_codex":0.0014945271,"about_ca_system_score_gemma":0.0013916177,"threshold_uncertainty_score":0.010843575},"labels":[],"label_agreement":null},{"id":"W2089304204","doi":"10.1109/socc.2014.6948913","title":"Design and implementation of novel source synchronous interconnection in modern GPU chips","year":2014,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Clock rate; Data transmission; Interconnection; Embedded system; Chip; Computer hardware; Computer network","score_opus":0.019175616257455588,"score_gpt":0.2533054892125027,"score_spread":0.23412987295504709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089304204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3041434,0.00043387696,0.6724055,0.00031924102,0.0001501548,0.00015443384,0.00017201023,0.0037882295,0.018433183],"genre_scores_gemma":[0.8388934,0.00015824687,0.15622823,0.000102521866,0.00003369556,0.000106819694,0.00012611656,0.00011181974,0.004239025],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998667,0.000027031729,0.000010134269,0.000030246858,0.000044667097,0.000021107697],"domain_scores_gemma":[0.9998311,0.00001950443,0.000039137998,0.000034097502,0.0000598448,0.000016311084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015859568,0.00021672457,0.00013829918,0.00029319865,0.00023026751,0.00044570398,0.0007001551,0.00024561383,0.0015368888],"category_scores_gemma":[0.00026295788,0.00015889645,0.00017582167,0.00026757925,0.00017750784,0.0005056226,0.00020402916,0.00022366253,0.00029242062],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032409726,0.00025519892,0.0054336335,0.0004893069,0.00008786898,0.0007170642,0.0005695406,0.09647011,0.61322796,0.040548705,0.0088571245,0.23301943],"study_design_scores_gemma":[0.00013224772,0.0019572412,0.005014256,0.000040237534,0.00008776298,0.00074240303,0.0001265584,0.6449372,0.29086497,0.0048196525,0.05121311,0.000064435364],"about_ca_topic_score_codex":0.0007734715,"about_ca_topic_score_gemma":0.00162094,"teacher_disagreement_score":0.0015368888,"about_ca_system_score_codex":0.0005953248,"about_ca_system_score_gemma":0.0005412156,"threshold_uncertainty_score":0.0051413774},"labels":[],"label_agreement":null},{"id":"W2089666718","doi":"10.1109/ccece.2008.4564530","title":"Early performance estimation in wormhole-switched Networks-on-Chip","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Transaction-level modeling; Chip; Network on a chip; Range (aeronautics); System on a chip; Database transaction; Real-time computing; Embedded system; Engineering; Telecommunications","score_opus":0.01687834142982154,"score_gpt":0.1867080347099678,"score_spread":0.16982969328014627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089666718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3625749,0.0003797426,0.6314708,0.00012327591,0.000022144435,0.000061158375,0.00013702805,0.0015328956,0.0036980994],"genre_scores_gemma":[0.97286105,0.00013985955,0.025966093,0.000017553504,0.0000043589785,0.00002841457,0.00010016754,0.00007891566,0.00080354774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950325,0.00017231565,0.000021385873,0.00004329832,0.00019388755,0.00006591982],"domain_scores_gemma":[0.99768054,0.0015371176,0.00014913459,0.00022037953,0.00037279897,0.000039892504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008675225,0.0005639381,0.00036297136,0.00045942634,0.00023838574,0.0005179802,0.0009240765,0.0004410801,0.0012365056],"category_scores_gemma":[0.0050619193,0.0003087696,0.00020721817,0.00034052657,0.00036735428,0.0016088601,0.0004263993,0.000541679,0.00017199988],"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.00012854568,0.000032788637,0.0016803824,0.000037375696,0.000014793691,0.000057092857,0.000055145167,0.97334284,0.006125786,0.004119783,0.00018303405,0.0142225595],"study_design_scores_gemma":[0.0000022131708,0.00002956201,0.000118733835,0.0000022719942,0.0000033086906,0.000010533174,0.000007714344,0.99368906,0.005244814,0.000757744,0.0001309993,0.0000030193735],"about_ca_topic_score_codex":0.002158837,"about_ca_topic_score_gemma":0.0016389389,"teacher_disagreement_score":0.002158837,"about_ca_system_score_codex":0.000716919,"about_ca_system_score_gemma":0.0005785945,"threshold_uncertainty_score":0.0052016973},"labels":[],"label_agreement":null},{"id":"W2089762633","doi":"10.1016/s0166-218x(02)00240-8","title":"Tight bounds for synchronous communication of information using bits and silence","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Communication complexity; Mathematics; Upper and lower bounds; Constant (computer programming); Broadcast communication network; Telecommunications network; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm; Computer network","score_opus":0.021449610106186193,"score_gpt":0.23441759657590241,"score_spread":0.2129679864697162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089762633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08932563,0.006449315,0.84020776,0.005404984,0.00073286484,0.00018235612,0.0008826369,0.0014860454,0.055328462],"genre_scores_gemma":[0.9065535,0.004921992,0.06401938,0.0017025002,0.0015299824,0.0007055829,0.00068487914,0.0011270897,0.01875504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923989,0.0017232433,0.00038976135,0.0011525935,0.0022126436,0.0021228348],"domain_scores_gemma":[0.889226,0.09159986,0.004016983,0.006721636,0.0051784283,0.0032570094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008734995,0.0035523758,0.0042885356,0.0042118505,0.0034046455,0.009149347,0.0047234553,0.0032391578,0.01581586],"category_scores_gemma":[0.059871573,0.0020527167,0.00185747,0.0045241606,0.0064085857,0.016365862,0.007885263,0.007924877,0.0022757428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011177062,0.00017961254,0.00055363745,0.0006085394,0.00012676623,0.00023655556,0.00089426985,0.14084247,0.0071496977,0.8111601,0.009361755,0.027769027],"study_design_scores_gemma":[0.00008983751,0.00015341143,0.00028077338,0.00013413646,0.00013956153,0.00013104355,0.00018124012,0.33581513,0.0033947947,0.65588653,0.0037172886,0.0000762345],"about_ca_topic_score_codex":0.0033216132,"about_ca_topic_score_gemma":0.0040487275,"teacher_disagreement_score":0.01581586,"about_ca_system_score_codex":0.006324911,"about_ca_system_score_gemma":0.0038994278,"threshold_uncertainty_score":0.052909315},"labels":[],"label_agreement":null},{"id":"W2089777270","doi":"10.1109/12.980020","title":"Comment on \"Generic universal switch blocks\"","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Combinatorics; Block (permutation group theory); Mathematics; Physics; Discrete mathematics; Arithmetic; Computer science","score_opus":0.026282994847269463,"score_gpt":0.21298827424665834,"score_spread":0.18670527939938888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089777270","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069956775,0.0070581506,0.01039153,0.8615268,0.06528413,0.000064670625,0.0005397238,0.0014174937,0.046721853],"genre_scores_gemma":[0.077083565,0.0036165067,0.004286582,0.86544865,0.030217478,0.00019082267,0.00021140139,0.00028792926,0.018656967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967211,0.00057529146,0.00025044612,0.0007339213,0.0012915323,0.00042763635],"domain_scores_gemma":[0.99248564,0.0037598396,0.0005704838,0.00085600157,0.0018289008,0.0004990718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036827757,0.000895366,0.0008822456,0.00048039015,0.0025068985,0.0015072942,0.004095041,0.012827801,0.010987482],"category_scores_gemma":[0.013900097,0.00046416238,0.0010924096,0.0006827716,0.0073740194,0.0063584317,0.0024750507,0.015310243,0.0058903787],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00019207256,0.000029693978,0.00045284192,0.0004031816,0.000022226912,0.00075760414,0.00031142178,0.00063472055,0.0021916588,0.27325287,0.7091968,0.012554914],"study_design_scores_gemma":[0.0001023025,0.00010725046,0.0006823261,0.0002286884,0.000024296589,0.0010682117,0.00032068105,0.001061528,0.0033030994,0.09610735,0.8969381,0.000056285942],"about_ca_topic_score_codex":0.0027974078,"about_ca_topic_score_gemma":0.0021333385,"teacher_disagreement_score":0.012827801,"about_ca_system_score_codex":0.00253434,"about_ca_system_score_gemma":0.0011882037,"threshold_uncertainty_score":0.036756814},"labels":[],"label_agreement":null},{"id":"W2090342193","doi":"10.1006/jpdc.2001.1772","title":"Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Gray code; Computer science; Routing algorithm; Algorithm; Port (circuit theory); Code (set theory); Path length; Parallel computing; Routing (electronic design automation); Topology (electrical circuits); Combinatorics; Mathematics; Computer network; Routing protocol","score_opus":0.05587485102720893,"score_gpt":0.27069707860352415,"score_spread":0.21482222757631522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090342193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64981115,0.0010809628,0.32244268,0.0007430121,0.00027692725,0.00011598504,0.00020579231,0.0010128617,0.024310606],"genre_scores_gemma":[0.9430163,0.00021680073,0.049359214,0.00017825194,0.00003504871,0.00006273245,0.00017018183,0.00015572296,0.0068058292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967384,0.000070860915,0.000026578291,0.000050942865,0.00010776267,0.000070041235],"domain_scores_gemma":[0.99892884,0.0003595891,0.00014757704,0.00032386745,0.0001727616,0.00006737979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034382095,0.00019203057,0.00038891958,0.00047194975,0.0007543406,0.0009149017,0.0008231547,0.0003254653,0.0044579688],"category_scores_gemma":[0.0024153178,0.0001691583,0.00021755001,0.0011231557,0.0008504008,0.00153134,0.0011668747,0.00043499278,0.0004771315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026351064,0.00014835518,0.0027752938,0.00022344607,0.000047328846,0.0004634789,0.0010684762,0.12994595,0.054236587,0.5658977,0.0072483025,0.23531006],"study_design_scores_gemma":[0.00017135919,0.00064981374,0.002025336,0.000093532886,0.00005402747,0.00064938935,0.0011010226,0.51179224,0.08786439,0.37411118,0.02137424,0.000113324066],"about_ca_topic_score_codex":0.0012897336,"about_ca_topic_score_gemma":0.0023769757,"teacher_disagreement_score":0.0044579688,"about_ca_system_score_codex":0.0007652164,"about_ca_system_score_gemma":0.0006603112,"threshold_uncertainty_score":0.01491344},"labels":[],"label_agreement":null},{"id":"W2090349114","doi":"10.1109/dft.2011.24","title":"A Unified Error Control Coding Scheme to Enhance the Reliability of a Hybrid Wireless Network-on-Chip","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":28,"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":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Computer science; Wireless; Coding (social sciences); Error detection and correction; Reliability (semiconductor); Linear network coding; Wireless network; Network on a chip; Chip; Scheme (mathematics); Forward error correction; Computer network; Electronic engineering; Decoding methods; Telecommunications; Algorithm; Engineering; Mathematics","score_opus":0.02733809080135624,"score_gpt":0.25441913934768196,"score_spread":0.22708104854632571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090349114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12311979,0.00062818883,0.8720455,0.00023641164,0.00015308843,0.0000610289,0.00004414437,0.00053771515,0.003173992],"genre_scores_gemma":[0.86206007,0.0003046882,0.1354824,0.00015345764,0.00004740911,0.000059943482,0.000048328176,0.000036976977,0.0018067871],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997484,0.000055529756,0.000020583626,0.00004346891,0.000096796946,0.00003520787],"domain_scores_gemma":[0.99880755,0.00035977457,0.00016345912,0.00029413973,0.00033883538,0.000036220525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061664,0.00036769907,0.00024984826,0.00042169727,0.0002485882,0.00035771704,0.00062754954,0.00038685105,0.00065544544],"category_scores_gemma":[0.002196609,0.00011107603,0.00018503724,0.0003682314,0.00046690102,0.0007494725,0.0005607297,0.0005701649,0.00011847439],"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.00030071454,0.00017976463,0.0016495202,0.00031677657,0.00009544992,0.00036487248,0.0002737106,0.15177916,0.4087897,0.12528585,0.0022017274,0.3087628],"study_design_scores_gemma":[0.000045385408,0.00041713324,0.00070617726,0.00004871596,0.00008051814,0.0003785504,0.00003437203,0.82612365,0.15546376,0.009999694,0.0066589876,0.000043063043],"about_ca_topic_score_codex":0.00032465803,"about_ca_topic_score_gemma":0.00053962285,"teacher_disagreement_score":0.00065544544,"about_ca_system_score_codex":0.00024862445,"about_ca_system_score_gemma":0.00037474147,"threshold_uncertainty_score":0.0032057166},"labels":[],"label_agreement":null},{"id":"W2091145724","doi":"10.1109/ispass.2014.6844472","title":"Accelerating network-on-chip simulation via sampling","year":2014,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer science; Sampling (signal processing); Design space exploration; Speedup; Network on a chip; Cache; Chip; Architecture; Limit (mathematics); Focus (optics); Range (aeronautics); Computer architecture; Parallel computing; Distributed computing; Computer engineering; Embedded system; Telecommunications","score_opus":0.05449610125289135,"score_gpt":0.2821080577140039,"score_spread":0.22761195646111254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091145724","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09552934,0.00016585874,0.8997596,0.00013135969,0.000030311227,0.00007873509,0.00006849488,0.0021630316,0.0020732826],"genre_scores_gemma":[0.6990458,0.00016604178,0.29960594,0.00007088517,0.000015417214,0.00015226798,0.00018737641,0.0001434908,0.00061283464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991357,0.00039119003,0.00003371756,0.00006260837,0.00031938322,0.00005747925],"domain_scores_gemma":[0.99419713,0.003994954,0.0003863873,0.0006986073,0.0006012173,0.000121703444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869131,0.00063215673,0.00050141866,0.00069393864,0.00035077016,0.0005086949,0.0009312491,0.00055794045,0.0011045018],"category_scores_gemma":[0.009909079,0.00035959895,0.00040387196,0.00069474196,0.0005742224,0.0009165543,0.00060569134,0.0007473365,0.00024605426],"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.000090263435,0.000052380754,0.002436555,0.000043364704,0.000027357943,0.000031065425,0.00004036107,0.96529484,0.0036305329,0.0053186403,0.00030931286,0.022725428],"study_design_scores_gemma":[0.000003379207,0.000008131568,0.00006290782,0.0000010716278,0.000001320412,0.0000032396888,0.0000020628033,0.9986243,0.0006254516,0.0005934326,0.000073594114,0.0000011515082],"about_ca_topic_score_codex":0.0055252337,"about_ca_topic_score_gemma":0.0056846263,"teacher_disagreement_score":0.0055252337,"about_ca_system_score_codex":0.0009188806,"about_ca_system_score_gemma":0.001062401,"threshold_uncertainty_score":0.010986149},"labels":[],"label_agreement":null},{"id":"W2092071486","doi":"10.1007/s11227-005-0157-7","title":"A Hybrid Analysis of an Optimization Approach for Cluster Applications","year":2005,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Overhead (engineering); Distributed computing; Key (lock); Parallel programming model; Cluster (spacecraft); Parallel computing; Computer cluster; Supercomputer; Computation; Programming paradigm; Parallel algorithm; Computer network; Algorithm; Operating system","score_opus":0.017001849029642826,"score_gpt":0.2554606433094504,"score_spread":0.23845879427980757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092071486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046986975,0.0008440166,0.9235337,0.0007846996,0.0002517977,0.00011926067,0.00011183103,0.00036957092,0.026998088],"genre_scores_gemma":[0.7922225,0.00069036585,0.1825837,0.00035043407,0.00037212603,0.00039914405,0.00019753243,0.00062552467,0.022558676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961793,0.00014268071,0.000010288012,0.000032238324,0.00013537705,0.00006148759],"domain_scores_gemma":[0.99939895,0.00036957397,0.000030644413,0.000042821663,0.00012774546,0.000030268364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070002634,0.00076222996,0.0008586694,0.00078614743,0.0007239436,0.0011578193,0.0013215238,0.0011957018,0.0061044088],"category_scores_gemma":[0.0020521444,0.0005435179,0.0011372827,0.0008383436,0.000585926,0.0010345101,0.0010356348,0.00098115,0.00054765336],"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.000058725822,0.000053217937,0.00024203215,0.000054083273,0.000056394696,0.000035739602,0.000023315184,0.95295626,0.0015711313,0.029856816,0.0011237083,0.013968608],"study_design_scores_gemma":[0.000003115838,0.000005832849,0.00004323081,0.0000013802364,0.0000036255653,0.0000023376908,0.0000024562444,0.9971373,0.00009016754,0.0024351033,0.00027334783,0.0000020115137],"about_ca_topic_score_codex":0.0066799615,"about_ca_topic_score_gemma":0.00505923,"teacher_disagreement_score":0.0066799615,"about_ca_system_score_codex":0.0008413783,"about_ca_system_score_gemma":0.0010384633,"threshold_uncertainty_score":0.020421267},"labels":[],"label_agreement":null},{"id":"W2095444497","doi":"10.1142/s0219265900000020","title":"IMPROVED BOUNDS FOR GOSSIPING IN MESH BUS NETWORKS","year":2000,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Gossip; Computer science; Bus network; Computer network; Node (physics); Dimension (graph theory); Protocol (science); Address bus; Distributed computing; Control bus; System bus; Mathematics; Combinatorics; Computer hardware","score_opus":0.010290717569064384,"score_gpt":0.23999110254324385,"score_spread":0.22970038497417947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095444497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051171236,0.013070566,0.8907277,0.0021689914,0.00067478616,0.00012818625,0.00081604876,0.0018894685,0.03935311],"genre_scores_gemma":[0.7496185,0.008957163,0.22421807,0.00071887736,0.0012778043,0.0006862039,0.0012515348,0.0011435619,0.012128326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974612,0.00057239586,0.00015949554,0.0003401822,0.0009127898,0.0005538457],"domain_scores_gemma":[0.9854537,0.009739397,0.000841648,0.0015676935,0.0017944081,0.00060310983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039247787,0.0021736058,0.0015862392,0.0031264857,0.0012076418,0.002966083,0.0028505127,0.0014128395,0.007564873],"category_scores_gemma":[0.01942695,0.00086009514,0.0013729681,0.0024663988,0.0018352161,0.007855227,0.0033311413,0.0049116425,0.0017591654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009427209,0.00016439306,0.0011261178,0.001003095,0.00019937103,0.000369682,0.0006308018,0.5072105,0.018701795,0.37953797,0.016603136,0.07351046],"study_design_scores_gemma":[0.000037055728,0.00011740067,0.00043404603,0.000118562275,0.000087843124,0.00010972476,0.00008792275,0.7659207,0.0040835636,0.22191231,0.007038299,0.00005252506],"about_ca_topic_score_codex":0.0021007343,"about_ca_topic_score_gemma":0.0026185266,"teacher_disagreement_score":0.007564873,"about_ca_system_score_codex":0.0032014893,"about_ca_system_score_gemma":0.001182993,"threshold_uncertainty_score":0.025307},"labels":[],"label_agreement":null},{"id":"W2095622662","doi":"10.1109/12.902749","title":"Hierarchical ring network configuration and performance modeling","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","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":"Queen's University","funders":"University of California, Riverside","keywords":"Computer science; Queueing theory; Network packet; Transmission delay; Processing delay; Parallel computing; Ring (chemistry); Interconnection; CPU cache; Ring network; Cache; Memory hierarchy; Packet switching; Hierarchy; Computer network; Network topology","score_opus":0.022286469883376337,"score_gpt":0.226043798084867,"score_spread":0.20375732820149065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095622662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15027569,0.0013622995,0.80737454,0.00035251817,0.000073605996,0.00015225794,0.0006377797,0.0010937593,0.038677424],"genre_scores_gemma":[0.9425716,0.00076866086,0.04813765,0.000056748646,0.000034760087,0.00012617618,0.00026111846,0.00006287969,0.0079804575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.00012601972,0.000017654304,0.00007322363,0.0001543621,0.00008889879],"domain_scores_gemma":[0.999511,0.00014706282,0.00007423767,0.000082070794,0.00015695252,0.000028721552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056891306,0.00035804987,0.00029741495,0.0005207756,0.00027840628,0.0006532139,0.0013747448,0.0005792925,0.0029551098],"category_scores_gemma":[0.0016404658,0.0002028138,0.00029297342,0.00068260764,0.0003300347,0.0012487195,0.0004358081,0.00037467698,0.0007392925],"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.00002581979,0.000017663271,0.0003373117,0.00002387453,0.0000042943857,0.000032199663,0.000021493624,0.9684645,0.0017287504,0.023537662,0.00055650756,0.0052498356],"study_design_scores_gemma":[0.0000021187873,0.000012828022,0.00011051165,0.0000022669271,0.0000019785107,0.000012269942,0.00000561558,0.99589646,0.00029554547,0.0030190176,0.00063786976,0.0000035909288],"about_ca_topic_score_codex":0.0064167953,"about_ca_topic_score_gemma":0.0038378467,"teacher_disagreement_score":0.0064167953,"about_ca_system_score_codex":0.0014419656,"about_ca_system_score_gemma":0.0007758474,"threshold_uncertainty_score":0.012758911},"labels":[],"label_agreement":null},{"id":"W2096193215","doi":"10.1109/micro.2006.27","title":"In-Network Cache Coherence","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":125,"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":"Princeton University","keywords":"Computer science; MESI protocol; Cache coherence; Scalability; MESIF protocol; Computer network; Directory; Cache; Latency (audio); Distributed computing; Cache algorithms; Operating system; CPU cache","score_opus":0.008895048481095721,"score_gpt":0.21287030964676013,"score_spread":0.2039752611656644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096193215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26570925,0.009706004,0.545069,0.0023361726,0.0006091522,0.00042106584,0.002023411,0.012091188,0.16203472],"genre_scores_gemma":[0.92224693,0.0013685847,0.051240552,0.00043613696,0.00012095001,0.00017149477,0.0020056223,0.0002689665,0.022140706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996138,0.000075278054,0.000026846106,0.00005876291,0.00016065875,0.00006476891],"domain_scores_gemma":[0.99921477,0.000103971455,0.00007684747,0.0002859484,0.00028411762,0.00003432508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806596,0.00027873457,0.00033667567,0.00049305527,0.00060935545,0.0010846003,0.0008508345,0.00032728555,0.005127746],"category_scores_gemma":[0.0013211387,0.00013506398,0.00013527212,0.00078975724,0.00020937959,0.0013416155,0.0007617108,0.00031566044,0.0009925937],"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.0011454728,0.0004897694,0.013935551,0.0013502747,0.00035162937,0.00065881736,0.00089417247,0.06984844,0.12783453,0.096598424,0.087132014,0.5997609],"study_design_scores_gemma":[0.00020987968,0.00058676425,0.0050306176,0.000107306834,0.00033715283,0.0016872359,0.0005610242,0.44409573,0.16857585,0.04828833,0.3304602,0.00005997221],"about_ca_topic_score_codex":0.0019253461,"about_ca_topic_score_gemma":0.006499095,"teacher_disagreement_score":0.005127746,"about_ca_system_score_codex":0.0007177171,"about_ca_system_score_gemma":0.0008092059,"threshold_uncertainty_score":0.017154038},"labels":[],"label_agreement":null},{"id":"W2096400832","doi":"10.1109/etacom.1996.502470","title":"A new shift-register based ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Computer science; Scalability; Shift register; Throughput; Queue; Parallel computing; Computer network; Computer hardware; Operating system; Chip; Wireless","score_opus":0.028077606581124945,"score_gpt":0.21500710558365574,"score_spread":0.1869294990025308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096400832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13262604,0.0046674376,0.76688397,0.0012952723,0.0028987126,0.0003029192,0.0006589736,0.00837755,0.082289144],"genre_scores_gemma":[0.6120307,0.002275704,0.3435352,0.0010285014,0.0010624396,0.00019466697,0.0006489387,0.00014057163,0.039083198],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997534,0.000020600246,0.000015094319,0.00006286595,0.00011302681,0.00003494532],"domain_scores_gemma":[0.9999038,0.0000097436605,0.000009508958,0.000017924616,0.000035744582,0.000023224156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013993424,0.00025294116,0.0003458874,0.00041624345,0.00047037445,0.00080874143,0.0011605213,0.00066100946,0.0060567325],"category_scores_gemma":[0.00015236145,0.00018527008,0.000280169,0.0004695748,0.000279179,0.0012280933,0.00046065115,0.00058145006,0.0015775431],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00043670234,0.00026611987,0.0014571634,0.00045303666,0.000085645515,0.0012706685,0.00012807094,0.011366134,0.47947308,0.082901366,0.02239827,0.39976373],"study_design_scores_gemma":[0.00027486388,0.0014003612,0.0040291287,0.00009451379,0.00039727372,0.006665902,0.0000879394,0.2862348,0.17840466,0.01858952,0.50363445,0.00018655109],"about_ca_topic_score_codex":0.00044026994,"about_ca_topic_score_gemma":0.00059302355,"teacher_disagreement_score":0.0060567325,"about_ca_system_score_codex":0.0003055889,"about_ca_system_score_gemma":0.00037162218,"threshold_uncertainty_score":0.020261765},"labels":[],"label_agreement":null},{"id":"W2096783892","doi":"10.1109/iscas.2005.1464952","title":"Effect of Traffic Localization on Energy Dissipation in NoC-based Interconnect","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"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":"Dissipation; Interconnection; Computer science; Modular design; Throughput; Network on a chip; Exploit; System on a chip; Efficient energy use; Embedded system; Energy (signal processing); Routing (electronic design automation); Locality; Multiprocessing; Metric (unit); Computer architecture; Parallel computing; Computer network; Engineering; Telecommunications; Electrical engineering; Physics","score_opus":0.006609470879935071,"score_gpt":0.23682833749643706,"score_spread":0.23021886661650198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096783892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99052787,0.00030684634,0.0077212113,0.00007071594,0.0000069147827,0.0000050233966,0.000026192984,0.0001138187,0.0012213753],"genre_scores_gemma":[0.99914956,0.000059836977,0.000561764,0.000010740055,0.0000017969326,0.0000031185639,0.000016816371,0.000014916792,0.00018141413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975234,0.00007998177,0.000013528818,0.000027743165,0.00005895939,0.00006740371],"domain_scores_gemma":[0.9982419,0.0011073443,0.00028114213,0.00010286179,0.00020351006,0.000063180625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043934805,0.00037358902,0.00033443287,0.00034413577,0.00024159186,0.00035963152,0.00028027163,0.00028946484,0.00082615524],"category_scores_gemma":[0.002390715,0.00019971332,0.00016249313,0.00042494942,0.00045672737,0.000567703,0.00033694625,0.00023338317,0.00017348888],"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.0009167129,0.00026512853,0.0055861673,0.00012906062,0.000043640182,0.000343748,0.00010077616,0.779435,0.19289488,0.0018161946,0.0002470266,0.018221645],"study_design_scores_gemma":[0.000049895923,0.001015833,0.0074137477,0.000024013681,0.0000880542,0.00017251639,0.00009295296,0.79087037,0.19849525,0.001162352,0.00058578956,0.000029224355],"about_ca_topic_score_codex":0.00047177478,"about_ca_topic_score_gemma":0.0005079207,"teacher_disagreement_score":0.00082615524,"about_ca_system_score_codex":0.00044941227,"about_ca_system_score_gemma":0.00023193199,"threshold_uncertainty_score":0.0032607913},"labels":[],"label_agreement":null},{"id":"W2097050598","doi":"10.1109/glocom.1999.831605","title":"Reducing buffer requirement for VC-merge capable ATM switches","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Label switching; Buffer (optical fiber); Scalability; Router; Merge (version control); Label Distribution Protocol; Distributed computing; Quality of service; Operating system; Parallel computing","score_opus":0.034856695792367484,"score_gpt":0.2565682423466136,"score_spread":0.22171154655424608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097050598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9340993,0.0017583572,0.060221132,0.0001935264,0.0000770256,0.000049619943,0.00007846977,0.00056442927,0.0029580905],"genre_scores_gemma":[0.9877987,0.00018951924,0.011435237,0.000044088065,0.00002199115,0.0000149557145,0.000065333465,0.000015853837,0.0004144294],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960274,0.00008269509,0.0000326987,0.00004610917,0.00013294144,0.00010281299],"domain_scores_gemma":[0.9982332,0.0009540302,0.0003128504,0.00016113513,0.00023576841,0.000103053346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077276095,0.00046866253,0.00037809988,0.0005529715,0.00056272844,0.0011103194,0.0012456012,0.00047882873,0.0011850812],"category_scores_gemma":[0.0024130878,0.00022568344,0.00020235525,0.0004491035,0.00031218457,0.0015319261,0.0006610457,0.00029045477,0.00013061316],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003507764,0.00028880822,0.007392412,0.0005202159,0.00010177748,0.0008660881,0.00028661877,0.075220056,0.78104913,0.015629236,0.0015809886,0.113557],"study_design_scores_gemma":[0.00016024343,0.001145366,0.0045417547,0.00003179252,0.0002114578,0.0006162591,0.00015047666,0.40054348,0.5841994,0.0042937673,0.0040403893,0.00006572891],"about_ca_topic_score_codex":0.0007527203,"about_ca_topic_score_gemma":0.0012340471,"teacher_disagreement_score":0.0012456012,"about_ca_system_score_codex":0.0007523696,"about_ca_system_score_gemma":0.00050345674,"threshold_uncertainty_score":0.0054588914},"labels":[],"label_agreement":null},{"id":"W2097427468","doi":"10.1109/icc.1992.268014","title":"Limited intermediate buffer switch modules and their interconnection networks for B-ISDN","year":2003,"lang":"en","type":"article","venue":"","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":"University of Ottawa","funders":"","keywords":"Computer science; Scheduling (production processes); Interconnection; Crossover switch; Asynchronous communication; Asynchronous Transfer Mode; Packet switching; Computer network; Multistage interconnection networks; Blocking (statistics); Banyan; Speedup; Network packet; Parallel computing; Distributed computing; Crossbar switch; Engineering","score_opus":0.015393678704149063,"score_gpt":0.21852655642270608,"score_spread":0.203132877718557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097427468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05949257,0.0038618315,0.9069635,0.00035044085,0.00010455165,0.00006024142,0.000083235725,0.0003007636,0.028782774],"genre_scores_gemma":[0.80393666,0.0036159395,0.171698,0.00019374232,0.00012097508,0.00020697631,0.00019854514,0.000094881834,0.019934215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991727,0.00002514327,0.0000032071487,0.000012913156,0.000029213275,0.0000122266765],"domain_scores_gemma":[0.99992585,0.000030519634,0.000009762795,0.000008951918,0.00001972041,0.0000052868727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021244957,0.0002113414,0.00011459543,0.0004584237,0.00026864288,0.0005308811,0.00039991146,0.00031753423,0.0032967422],"category_scores_gemma":[0.00038584802,0.0001380782,0.00027260336,0.00046655332,0.00024133216,0.0006988848,0.00018444657,0.0003739947,0.00040855454],"study_design_candidate":"bench_or_experimental","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.00016227047,0.000053838576,0.0010829018,0.00015651349,0.000035543708,0.00026371182,0.00012715321,0.29622963,0.024064282,0.60836005,0.0035866585,0.065877475],"study_design_scores_gemma":[0.000014912905,0.000080580736,0.00068470347,0.000031716678,0.000020591764,0.00017213688,0.000033481287,0.8512241,0.0046061515,0.11872091,0.024396986,0.000013761398],"about_ca_topic_score_codex":0.0012380052,"about_ca_topic_score_gemma":0.0013339409,"teacher_disagreement_score":0.0032967422,"about_ca_system_score_codex":0.00058972003,"about_ca_system_score_gemma":0.00027421795,"threshold_uncertainty_score":0.011028647},"labels":[],"label_agreement":null},{"id":"W2097535429","doi":"10.1109/icdsc.2011.6042903","title":"Optimizing load distribution in camera networks with a hypergraph model of coverage topology","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Computer science; Scheduling (production processes); Representation (politics); Topology (electrical circuits); Heuristic; Basis (linear algebra); Task (project management); Network topology; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Discrete mathematics; Engineering; Computer network; Geometry; Combinatorics","score_opus":0.02051536266860373,"score_gpt":0.20637010619187257,"score_spread":0.18585474352326883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097535429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071453914,0.00022392278,0.9244625,0.00014370157,0.000016434798,0.000032825315,0.00008038182,0.0002440789,0.0033422676],"genre_scores_gemma":[0.9242469,0.0003309785,0.07251799,0.000036342783,0.000025769026,0.000097096985,0.00014390021,0.00012802289,0.002472988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997335,0.00010739236,0.000007121543,0.00004981052,0.000053668613,0.00004855561],"domain_scores_gemma":[0.9995042,0.00030129924,0.00007043732,0.00003666346,0.00004988594,0.000037437818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045666643,0.0007359217,0.0007505289,0.0006174048,0.0003038235,0.0009806359,0.0011111468,0.0007533679,0.0015625769],"category_scores_gemma":[0.0017281924,0.00046640326,0.00039334188,0.0010593482,0.0005340412,0.002037692,0.0006337479,0.00052802294,0.00019066768],"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.000013729297,0.0000066748216,0.00009968364,0.00000844075,0.0000053815334,0.0000131772085,0.000007023844,0.9936172,0.00041437682,0.0021495402,0.00014212872,0.0035226361],"study_design_scores_gemma":[0.0000014141986,0.0000059301974,0.0000317981,6.0715723e-7,0.0000013567466,0.0000031200095,0.0000035681378,0.9987771,0.0001014937,0.0010136751,0.00005882026,0.0000011007572],"about_ca_topic_score_codex":0.0077955252,"about_ca_topic_score_gemma":0.006913931,"teacher_disagreement_score":0.0077955252,"about_ca_system_score_codex":0.0015114438,"about_ca_system_score_gemma":0.00061802764,"threshold_uncertainty_score":0.0155002475},"labels":[],"label_agreement":null},{"id":"W2097780935","doi":"10.1109/infcom.1997.644503","title":"The single queue switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; Queueing theory; Queue; Scheduling (production processes); Crossover switch; Computer network; Asynchronous Transfer Mode; Parallel computing; Distributed computing; Crossbar switch; Engineering; Telecommunications","score_opus":0.027254056395855694,"score_gpt":0.1937975902011445,"score_spread":0.1665435338052888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097780935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014879553,0.004429953,0.9189378,0.0016796176,0.0039200415,0.00027945454,0.0003767414,0.0032113772,0.052285515],"genre_scores_gemma":[0.24889192,0.005414423,0.6736075,0.0037155694,0.0025142082,0.00041383653,0.0006648885,0.00051460415,0.064262986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992969,0.00007164094,0.00003206671,0.00018729382,0.00030019655,0.00011189116],"domain_scores_gemma":[0.9994462,0.00010656757,0.000049301325,0.00012604384,0.00016759166,0.00010418653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624595,0.00051979936,0.0006098932,0.00074765884,0.00089347543,0.0018846707,0.0026780802,0.0007628247,0.016654026],"category_scores_gemma":[0.00074826396,0.00030641333,0.00074033946,0.00057764724,0.0009366781,0.0027598527,0.0014739205,0.0017133655,0.0044409395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032613522,0.00034540714,0.0010955285,0.0004064416,0.000075124284,0.00046878387,0.00020315422,0.008742431,0.04370752,0.48556054,0.03718724,0.4218817],"study_design_scores_gemma":[0.00027236555,0.001047251,0.0009030684,0.00013409965,0.00024321479,0.0026959614,0.00014455062,0.14073911,0.042752218,0.21860841,0.59224826,0.00021158453],"about_ca_topic_score_codex":0.0009882833,"about_ca_topic_score_gemma":0.0012914563,"teacher_disagreement_score":0.016654026,"about_ca_system_score_codex":0.0007747898,"about_ca_system_score_gemma":0.0013944104,"threshold_uncertainty_score":0.055713236},"labels":[],"label_agreement":null},{"id":"W2097959379","doi":"10.1145/1450095.1450107","title":"VESPA","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":96,"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","score_opus":0.023509908162652353,"score_gpt":0.20242537427637386,"score_spread":0.1789154661137215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097959379","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009799171,0.006071906,0.07993914,0.0033373404,0.0031827486,0.00028103022,0.0050866287,0.0215729,0.870729],"genre_scores_gemma":[0.0912499,0.0052291616,0.04273532,0.0016602487,0.00070537825,0.00027787325,0.010708668,0.0034937977,0.8439396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.000068112466,0.000031924155,0.00016536143,0.0002618571,0.00008237004],"domain_scores_gemma":[0.99928683,0.00009079868,0.00003716865,0.00014777783,0.0002979989,0.00013945445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058345386,0.00092757447,0.00054225215,0.0014628494,0.0009312123,0.002517144,0.0013364506,0.0012512786,0.3115645],"category_scores_gemma":[0.0017308532,0.0004081326,0.00043522898,0.00087478274,0.00044442742,0.001864335,0.0019177446,0.0010846567,0.19811869],"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.0004225067,0.00014496056,0.0015654559,0.0006149735,0.00004064129,0.0005223856,0.00028542452,0.002574717,0.019045232,0.047631305,0.2969723,0.6301802],"study_design_scores_gemma":[0.0000310439,0.00006365016,0.00042349976,0.00006657394,0.000011640519,0.0005240128,0.000050939892,0.0022578135,0.005043682,0.0043112873,0.9872011,0.000014614385],"about_ca_topic_score_codex":0.0012558989,"about_ca_topic_score_gemma":0.0013001381,"teacher_disagreement_score":0.3115645,"about_ca_system_score_codex":0.0007035875,"about_ca_system_score_gemma":0.0009503003,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2098038030","doi":"10.1109/newcas.2006.250915","title":"RoC: A Scalable Network on Chip Based on the Token Ring Concept","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"STMicroelectronics (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Scalability; Computer network; Interconnection; Multiprocessing; Token ring; Network on a chip; Network packet; Embedded system; Ring network; Security token; Chip; Computer architecture; Distributed computing; Network topology; Operating system; Telecommunications","score_opus":0.012674327754873359,"score_gpt":0.20442705385641105,"score_spread":0.19175272610153768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098038030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19919774,0.003155366,0.7572674,0.00046662538,0.00050244667,0.00041812117,0.0004305723,0.009760747,0.02880085],"genre_scores_gemma":[0.7473342,0.000944652,0.2427577,0.00019740297,0.00010125275,0.00019236984,0.00047213957,0.000171941,0.00782825],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.000056993373,0.0000128046595,0.000053365875,0.000119486765,0.000051108313],"domain_scores_gemma":[0.99971765,0.000050082042,0.000045753728,0.00006628323,0.00008111569,0.000039080187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000423668,0.00026896707,0.000294938,0.000441607,0.00025192238,0.000599611,0.00092612137,0.00029928688,0.0023858696],"category_scores_gemma":[0.00043549604,0.00012752647,0.00022703472,0.00038098288,0.0003853137,0.001034386,0.00050266983,0.0003240754,0.0005230413],"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.0010369138,0.00024233342,0.0023777618,0.0007764863,0.00019033182,0.00073377707,0.00025786518,0.071831584,0.4317442,0.07824342,0.017573865,0.3949915],"study_design_scores_gemma":[0.00035349498,0.004394106,0.003495601,0.00011104865,0.0003173989,0.0019687419,0.00018805513,0.533774,0.24963489,0.014978723,0.19052115,0.0002627122],"about_ca_topic_score_codex":0.0006677086,"about_ca_topic_score_gemma":0.0010454042,"teacher_disagreement_score":0.0023858696,"about_ca_system_score_codex":0.000339433,"about_ca_system_score_gemma":0.00049247214,"threshold_uncertainty_score":0.007981598},"labels":[],"label_agreement":null},{"id":"W2098087028","doi":"10.1109/icc.1992.268065","title":"Delay and loss control of an output buffered fast packet switch supporting integrated services","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Computer network; Network packet; Computer science; Packet loss; Packet switching; Port (circuit theory); Service (business); Control (management); Real-time computing; Engineering; Electronic engineering","score_opus":0.008700979838780142,"score_gpt":0.2294152256142555,"score_spread":0.22071424577547535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098087028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.547038,0.0005387272,0.4488029,0.00033480345,0.00010210418,0.00003988216,0.000059213693,0.00018721983,0.0028970474],"genre_scores_gemma":[0.9914937,0.00012750906,0.007031547,0.000018830435,0.000016105678,0.000011276758,0.000014762358,0.000009663698,0.0012765757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985266,0.00003753826,0.000005039053,0.000025884323,0.000043766464,0.000035133016],"domain_scores_gemma":[0.99956614,0.00024422654,0.00006294793,0.000013567628,0.000079305,0.000033807188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006974044,0.0005508009,0.0003231061,0.00021942907,0.0003690258,0.001109428,0.0005356713,0.0004615434,0.0009442776],"category_scores_gemma":[0.0011392328,0.00020314127,0.00019765882,0.00021154118,0.000488304,0.0006206506,0.00042886636,0.00039370504,0.000051064108],"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.0006016178,0.00006734874,0.0011431441,0.00007311271,0.000033803248,0.00021490516,0.00011953667,0.946556,0.020618485,0.0090713855,0.00046108573,0.021039631],"study_design_scores_gemma":[0.000022353606,0.0000946233,0.00010577809,0.0000014201022,0.0000081844855,0.000011108798,0.000010986228,0.9975854,0.0011704754,0.0008898823,0.00009677266,0.0000029660991],"about_ca_topic_score_codex":0.0040445263,"about_ca_topic_score_gemma":0.0015039073,"teacher_disagreement_score":0.0040445263,"about_ca_system_score_codex":0.00077660376,"about_ca_system_score_gemma":0.00042904707,"threshold_uncertainty_score":0.008041978},"labels":[],"label_agreement":null},{"id":"W2098156582","doi":"10.1109/tc.2005.134","title":"Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":846,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interconnection; Multiprocessing; Computer architecture; Network on a chip; Modularity (biology); Embedded system; System on a chip; Network topology; Modular design; Throughput; Design flow; Chip; Integrated circuit design; Latency (audio); Distributed computing; Parallel computing; Computer network; Telecommunications; Wireless","score_opus":0.0368473896670903,"score_gpt":0.2626955284532059,"score_spread":0.22584813878611557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098156582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74658805,0.0072669946,0.2293376,0.0005745259,0.00007868697,0.0002698219,0.00031051724,0.00065748976,0.0149163585],"genre_scores_gemma":[0.9560529,0.00077618944,0.04194636,0.000043535067,0.000031427368,0.00010121898,0.00018758705,0.00010185323,0.00075891544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99268264,0.0040870886,0.00040882968,0.00035839024,0.0021090205,0.00035406795],"domain_scores_gemma":[0.9791895,0.015185158,0.0021234879,0.0012134677,0.0020876536,0.00020060567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058719763,0.0015437234,0.00058053696,0.002318168,0.00046982616,0.001105871,0.00077249075,0.0007359154,0.0011118926],"category_scores_gemma":[0.024302043,0.00030100724,0.0004421175,0.002118757,0.00055002753,0.001676023,0.000612785,0.0004952897,0.00018539943],"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.0012489833,0.00034455405,0.012723833,0.000508929,0.00016454121,0.00021259816,0.00014911218,0.747689,0.034761332,0.008640142,0.0011191107,0.19243781],"study_design_scores_gemma":[0.00003671837,0.0012256253,0.005829109,0.00004555781,0.000089332025,0.000247589,0.000097145974,0.9520871,0.034171514,0.0045668436,0.0015673124,0.000036163998],"about_ca_topic_score_codex":0.00080227625,"about_ca_topic_score_gemma":0.0011311587,"teacher_disagreement_score":0.0058719763,"about_ca_system_score_codex":0.0017875895,"about_ca_system_score_gemma":0.0005067156,"threshold_uncertainty_score":0.031054378},"labels":[],"label_agreement":null},{"id":"W2098275358","doi":"10.1109/pccc.1996.493623","title":"A hierarchical fault-tolerant interconnection network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; King Fahd University of Petroleum and Minerals","keywords":"Interconnection; Hypercube; Computer science; Fault tolerance; Locality; Distributed computing; Parallel computing; Node (physics); Torus; Grid network; Computer network; Engineering; Mathematics","score_opus":0.022222749868442953,"score_gpt":0.22041372417001104,"score_spread":0.1981909743015681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098275358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065870784,0.0018586128,0.90727895,0.0009303896,0.00025705187,0.00013216637,0.00051356055,0.002939676,0.020218808],"genre_scores_gemma":[0.70933145,0.0012026527,0.27860776,0.00034528467,0.00010337239,0.0001847949,0.00074951834,0.0000766774,0.009398552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998179,0.0000325527,0.000011991355,0.000039564133,0.00007404937,0.000023944007],"domain_scores_gemma":[0.9998062,0.00003612283,0.000033380576,0.0000404548,0.000059238013,0.000024582609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018940147,0.00021999827,0.00019835566,0.0004001504,0.00051300257,0.0004391117,0.00056026975,0.0004066987,0.0019232349],"category_scores_gemma":[0.00050779845,0.00013017548,0.0002290389,0.0005370831,0.0003352766,0.00077248045,0.00047949693,0.00027803733,0.00053867674],"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.00025717326,0.00007982854,0.0021492406,0.00046625233,0.000075610784,0.000828885,0.0003469294,0.39981195,0.13084532,0.11214022,0.025921429,0.3270772],"study_design_scores_gemma":[0.000056798075,0.00025918207,0.0016155974,0.000039723247,0.000061593084,0.0006825881,0.000080061924,0.85304046,0.017251756,0.046870418,0.07998426,0.000057544148],"about_ca_topic_score_codex":0.0025602204,"about_ca_topic_score_gemma":0.002986788,"teacher_disagreement_score":0.0025602204,"about_ca_system_score_codex":0.00052430993,"about_ca_system_score_gemma":0.00066098396,"threshold_uncertainty_score":0.0064338446},"labels":[],"label_agreement":null},{"id":"W2098351027","doi":"10.1109/cnsr.2005.59","title":"The Design and Implementation of a Cartesian Router","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Dalhousie University","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Routing table; Router; Computer network; Routing (electronic design automation); Network packet; Lookup table; Cartesian coordinate system; Routing domain; IP forwarding; Routing protocol; Distributed computing; Operating system","score_opus":0.012532210992753,"score_gpt":0.25985541327880035,"score_spread":0.24732320228604734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098351027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031540465,0.0008319139,0.93347824,0.00033209342,0.00024528333,0.00039626326,0.00013273954,0.00567674,0.027366199],"genre_scores_gemma":[0.3371357,0.00065950747,0.6468345,0.00016982079,0.00008368663,0.00024118292,0.00026758685,0.000079293684,0.014528794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995933,0.00006275203,0.000033773176,0.00008968964,0.00016929448,0.000051249644],"domain_scores_gemma":[0.9995592,0.00004080192,0.000042941778,0.0000706123,0.00025620134,0.00003025446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003899929,0.00035280857,0.00032601092,0.00044616312,0.00035099898,0.0008314997,0.0010743006,0.0004697178,0.0041290573],"category_scores_gemma":[0.0005559946,0.00026413787,0.00021861694,0.00030685184,0.00026536157,0.0006435114,0.00039590587,0.00033912977,0.0017613574],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076918904,0.00018523778,0.004242347,0.0007433415,0.00009649056,0.0007259389,0.0005081319,0.06883541,0.19056863,0.07861543,0.017607467,0.6371024],"study_design_scores_gemma":[0.00027705173,0.0034314154,0.0038345002,0.00013940484,0.0002828234,0.0035975862,0.00019850532,0.4907204,0.22072735,0.009869882,0.26677495,0.00014619902],"about_ca_topic_score_codex":0.0019175318,"about_ca_topic_score_gemma":0.0013706518,"teacher_disagreement_score":0.0041290573,"about_ca_system_score_codex":0.000438874,"about_ca_system_score_gemma":0.0010497071,"threshold_uncertainty_score":0.013813078},"labels":[],"label_agreement":null},{"id":"W2098656685","doi":"10.1109/iwsoc.2003.1213053","title":"High-throughput switch-based interconnect for future SoCs","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":65,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interconnection; Scalability; Computer science; Throughput; Embedded system; Synchronization (alternating current); System on a chip; Network on a chip; Chip; Computer architecture; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.011682871694682233,"score_gpt":0.23323058254903256,"score_spread":0.22154771085435032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098656685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14972976,0.011135663,0.7236903,0.0058085956,0.0011537157,0.00020851112,0.0011255773,0.0148815485,0.09226638],"genre_scores_gemma":[0.7879954,0.004655921,0.18388397,0.0006111227,0.0006610728,0.00020284954,0.001572047,0.00060349883,0.019814186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966013,0.000061407096,0.000016866863,0.00004513398,0.0001587179,0.000057649664],"domain_scores_gemma":[0.9992423,0.00016936145,0.000058877467,0.00015949368,0.00028875287,0.00008123409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542622,0.0004281115,0.0003224402,0.0006342648,0.0005945593,0.001408059,0.00069398695,0.0005921797,0.008132028],"category_scores_gemma":[0.0010891323,0.0002136226,0.00020873318,0.0008576734,0.00033957718,0.0016501081,0.0005085684,0.0006789332,0.0015757281],"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.0008740991,0.00018059087,0.0023570107,0.00084391824,0.00007600691,0.0007919536,0.00029108571,0.15908277,0.20177826,0.18153213,0.06678073,0.38541144],"study_design_scores_gemma":[0.00016573198,0.0005433494,0.0024610448,0.00013169162,0.00012001183,0.0007450812,0.00018460742,0.57347214,0.07446384,0.09131046,0.2563337,0.00006835734],"about_ca_topic_score_codex":0.0009347342,"about_ca_topic_score_gemma":0.0017924766,"teacher_disagreement_score":0.008132028,"about_ca_system_score_codex":0.0009789398,"about_ca_system_score_gemma":0.0008276472,"threshold_uncertainty_score":0.027204394},"labels":[],"label_agreement":null},{"id":"W2099031847","doi":"10.1109/ccece.2002.1013010","title":"Distributed recovery block based fault-tolerant routing in hypercube networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Successor cardinal; Computer science; Distributed computing; Static routing; Routing table; Routing (electronic design automation); Node (physics); Computer network; Dynamic Source Routing; Parallel computing; Topology (electrical circuits); Routing protocol; Engineering; Mathematics; Combinatorics","score_opus":0.012364477710359176,"score_gpt":0.212505282137315,"score_spread":0.20014080442695584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099031847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11610232,0.0009121912,0.8781892,0.0002285273,0.00006121692,0.00009785001,0.000054147684,0.0015298028,0.002824756],"genre_scores_gemma":[0.71058136,0.0004630351,0.28404796,0.00006947524,0.000038379,0.00014078635,0.00017893301,0.000080957216,0.0043990514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.00007929677,0.000012123939,0.00003247989,0.000077322584,0.000024520454],"domain_scores_gemma":[0.9996543,0.000117153395,0.00005632366,0.00008339178,0.0000670298,0.000021825408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003689043,0.00023281376,0.00038227296,0.0002544881,0.00037494197,0.00040480032,0.00090088433,0.00037457113,0.0010685923],"category_scores_gemma":[0.00061508425,0.00015400318,0.00014241731,0.00027882226,0.00035429513,0.0007740385,0.00045277484,0.00030601633,0.00035665208],"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.0008653186,0.00016236797,0.0012905793,0.0002070688,0.00005352316,0.00025775243,0.00021556343,0.6074289,0.07597576,0.026888918,0.0034913686,0.28316283],"study_design_scores_gemma":[0.00006823102,0.00020737143,0.00025450482,0.0000065160684,0.0000121507455,0.000092803384,0.000019719448,0.976646,0.014477378,0.005179283,0.0030260792,0.0000099812905],"about_ca_topic_score_codex":0.0014872412,"about_ca_topic_score_gemma":0.0015737795,"teacher_disagreement_score":0.0014872412,"about_ca_system_score_codex":0.00036231743,"about_ca_system_score_gemma":0.000380051,"threshold_uncertainty_score":0.0035747886},"labels":[],"label_agreement":null},{"id":"W2099048211","doi":"10.1109/hpcs.2005.35","title":"Netzwerk: Migration of a Packet-Switching Network Simulation Environment from MS Windows PC to Linux PC and to HPC","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"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; Porting; Operating system; POSIX Threads; Network packet; POSIX; Focus (optics); Embedded system; Parallel computing; Computer network; Software; Thread (computing)","score_opus":0.01301998348100621,"score_gpt":0.2292573046746707,"score_spread":0.21623732119366448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099048211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1172442,0.00010593276,0.7996538,0.00045378532,0.00021438242,0.0005663446,0.0023060993,0.046310924,0.033144504],"genre_scores_gemma":[0.48623782,0.00037255677,0.47835723,0.00019999327,0.00003955404,0.00088668143,0.005547587,0.00454613,0.023812443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998117,0.000038929415,0.000013743089,0.00002813656,0.00008152616,0.000026009558],"domain_scores_gemma":[0.9997296,0.00006853376,0.000020594784,0.00007114724,0.00007053017,0.000039538532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048457092,0.0004121554,0.00030719375,0.00031536142,0.0003335671,0.00067035726,0.0010678301,0.00032931875,0.00588986],"category_scores_gemma":[0.0010731964,0.0003292616,0.00038895293,0.00032116272,0.00030302655,0.00069656246,0.0006314393,0.00096825545,0.0013447771],"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.00034855172,0.00032674058,0.0067707067,0.0002304487,0.00011798343,0.00024985956,0.00034586762,0.8226697,0.027116729,0.032546367,0.021836521,0.087440446],"study_design_scores_gemma":[0.00005136209,0.00004286559,0.00044798516,0.000007771084,0.000009856735,0.000034299344,0.000015245401,0.9654838,0.010189296,0.002514278,0.02118961,0.000013631969],"about_ca_topic_score_codex":0.004635235,"about_ca_topic_score_gemma":0.0035043876,"teacher_disagreement_score":0.00588986,"about_ca_system_score_codex":0.00056719244,"about_ca_system_score_gemma":0.00096066954,"threshold_uncertainty_score":0.019703567},"labels":[],"label_agreement":null},{"id":"W2099546942","doi":"10.1109/jsac.2010.100602","title":"Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS","year":2010,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Computer science; Computer network; Quality of service; Token bucket; Voice over IP; The Internet; Jitter; Backbone network; Backup; Provisioning; Queueing theory; Distributed computing; Telecommunications; Operating system","score_opus":0.01582757175042726,"score_gpt":0.27776643564655895,"score_spread":0.2619388638961317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099546942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5581569,0.00040862485,0.4352353,0.00034710907,0.00004373859,0.00010797277,0.00006680161,0.00070927513,0.00492423],"genre_scores_gemma":[0.98029894,0.00012535963,0.019130437,0.00002637457,0.0000076114234,0.000017604087,0.00003726526,0.0000171052,0.00033931245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996916,0.000060159335,0.000013292202,0.000039013295,0.00010223371,0.00009367054],"domain_scores_gemma":[0.99935967,0.00026625654,0.0001000625,0.000068979774,0.00015521738,0.000049812366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053848576,0.00041843115,0.00030564572,0.00039897856,0.0005724917,0.0007523492,0.0005363973,0.00041637025,0.00080414995],"category_scores_gemma":[0.002078349,0.00018283671,0.00014622869,0.0004237979,0.0005764263,0.000846813,0.00047211556,0.0004050317,0.00010752301],"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.00015515937,0.000055134115,0.0013090582,0.000049702092,0.000017904224,0.00009844563,0.00008127897,0.94385505,0.015508706,0.009064931,0.0007050258,0.029099658],"study_design_scores_gemma":[0.000010253764,0.00003799667,0.00020466794,0.0000024874603,0.0000042557845,0.000021459093,0.000028895343,0.9953473,0.001957741,0.0020317507,0.00034909477,0.0000042101597],"about_ca_topic_score_codex":0.005063687,"about_ca_topic_score_gemma":0.004196274,"teacher_disagreement_score":0.005063687,"about_ca_system_score_codex":0.0010908465,"about_ca_system_score_gemma":0.001107292,"threshold_uncertainty_score":0.010068417},"labels":[],"label_agreement":null},{"id":"W2099653084","doi":"10.1109/asap.2007.4429957","title":"Transaction Specific Virtual Channel Allocation in QoS Supported On-chip Communication","year":2007,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Router; Virtual channel; Quality of service; Channel (broadcasting); Benchmark (surveying); Computer network; Channel allocation schemes; Scheme (mathematics); Embedded system; Distributed computing; Operating system; Wireless","score_opus":0.02834661194922972,"score_gpt":0.2508203990909653,"score_spread":0.2224737871417356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099653084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29637736,0.0017255315,0.69510555,0.00023973577,0.00017207766,0.00012604486,0.000058692323,0.0014195717,0.004775456],"genre_scores_gemma":[0.9354205,0.00017096374,0.06311665,0.000059307105,0.0000264209,0.000053323656,0.00004714452,0.000040045583,0.0010656563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991534,0.00033508395,0.000055941997,0.00009238647,0.00020285006,0.00016028424],"domain_scores_gemma":[0.99820435,0.0006158502,0.00019196223,0.0005425276,0.0003239865,0.000121284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079709897,0.00039101162,0.0004095831,0.0004079235,0.00048256878,0.00080816983,0.0018344903,0.0004004406,0.0015115385],"category_scores_gemma":[0.0023258042,0.00019803499,0.00018627035,0.00074868836,0.0006793724,0.0012883554,0.0006878564,0.0005863919,0.0002513998],"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.0014155895,0.00040438672,0.0048354026,0.0002313388,0.00010063763,0.00028978402,0.0002926176,0.42500386,0.09889194,0.029895904,0.0034744167,0.4351641],"study_design_scores_gemma":[0.00005269429,0.00042023754,0.00079003116,0.0000085812535,0.000050739727,0.00018058823,0.00006594498,0.94946307,0.04029395,0.004925629,0.003721799,0.000026755633],"about_ca_topic_score_codex":0.0012117225,"about_ca_topic_score_gemma":0.0020505923,"teacher_disagreement_score":0.0018344903,"about_ca_system_score_codex":0.00045140422,"about_ca_system_score_gemma":0.00076676643,"threshold_uncertainty_score":0.0050566196},"labels":[],"label_agreement":null},{"id":"W2099711142","doi":"10.1109/wescan.1993.270567","title":"Integration of telecommunications switching on SCS hypercube packet switches","year":2002,"lang":"en","type":"article","venue":"","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 Saskatchewan","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Network packet; Scalability; Hypercube; Quality of service; Interconnection; Dynamic bandwidth allocation; Distributed computing; Packet switching; Parallel computing; Operating system","score_opus":0.05278419267326284,"score_gpt":0.24980448032546365,"score_spread":0.1970202876522008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099711142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18588766,0.0013819413,0.6807612,0.0010402189,0.00048596808,0.00025551548,0.00013932736,0.002512891,0.12753527],"genre_scores_gemma":[0.78641707,0.0011339344,0.18930575,0.00022458595,0.00021418148,0.00015028717,0.00030838072,0.00009054711,0.02215525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.00007489617,0.000015061716,0.000027281776,0.00011442772,0.00004570302],"domain_scores_gemma":[0.99977106,0.00005494229,0.0000117773325,0.00004904017,0.00008507811,0.000028075241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029731827,0.00025642145,0.0002607509,0.0003560187,0.00042898575,0.001125402,0.00053735985,0.00041140724,0.0029430687],"category_scores_gemma":[0.00046081273,0.0001616734,0.00033543006,0.0005885221,0.00043346558,0.00089560536,0.00066275586,0.00048589607,0.00057447015],"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.00085338525,0.00026337264,0.004522142,0.0002427675,0.00013724498,0.001109947,0.00030609535,0.19159389,0.08844887,0.39021936,0.006745218,0.31555772],"study_design_scores_gemma":[0.00010798101,0.00049731275,0.0016511887,0.000050349674,0.00009305412,0.00072771264,0.00013848794,0.80212176,0.03906864,0.08943888,0.066057764,0.00004688024],"about_ca_topic_score_codex":0.0015035341,"about_ca_topic_score_gemma":0.0023235946,"teacher_disagreement_score":0.0029430687,"about_ca_system_score_codex":0.00067481113,"about_ca_system_score_gemma":0.0008406834,"threshold_uncertainty_score":0.009845555},"labels":[],"label_agreement":null},{"id":"W2099719587","doi":"10.1109/infcom.1995.515933","title":"The fat banyan ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"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":"Banyan; Multistage interconnection networks; Computer network; Computer science; Throughput; Routing (electronic design automation); Telecommunications","score_opus":0.019902025259012066,"score_gpt":0.2021325051492251,"score_spread":0.18223047989021302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099719587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0575704,0.0021137628,0.91270214,0.00057174155,0.00036001593,0.000095741154,0.00011398345,0.0010503609,0.025421849],"genre_scores_gemma":[0.7099968,0.002225969,0.27266935,0.00049918576,0.00024809578,0.00014547583,0.00016556698,0.000055648565,0.013993881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997869,0.000050042257,0.000009687664,0.00004944604,0.00007374271,0.000030237637],"domain_scores_gemma":[0.99979335,0.000045492212,0.000019287503,0.000051509225,0.0000683907,0.0000219478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031728396,0.0002955922,0.00027770828,0.00038266345,0.0005606055,0.00077957066,0.00095127005,0.0004940192,0.0023152626],"category_scores_gemma":[0.0006207766,0.00020298173,0.0002549255,0.00039739755,0.00056527863,0.001391001,0.000759207,0.0007271435,0.00051201356],"study_design_candidate":"bench_or_experimental","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.00038698482,0.0001482104,0.0013072888,0.00036092525,0.00009605179,0.00050721195,0.00021281162,0.08302748,0.09904323,0.44011006,0.008182225,0.36661744],"study_design_scores_gemma":[0.000085311076,0.00056928623,0.0009883022,0.00006698188,0.000116255986,0.0018137539,0.00010480032,0.69686687,0.041855052,0.16087955,0.096573435,0.00008035403],"about_ca_topic_score_codex":0.00073238014,"about_ca_topic_score_gemma":0.0006759527,"teacher_disagreement_score":0.0023152626,"about_ca_system_score_codex":0.000411612,"about_ca_system_score_gemma":0.00072779827,"threshold_uncertainty_score":0.007745266},"labels":[],"label_agreement":null},{"id":"W2099932596","doi":"10.1109/icvd.1996.489630","title":"A multilevel factorization technique for pass transistor logic","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Windsor","funders":"","keywords":"Computer science; Logic synthesis; Logic gate; Logic family; Factorization; Logic optimization; Transistor; Computer architecture; Electronic engineering; Theoretical computer science; Parallel computing; Algorithm; Electrical engineering; Engineering","score_opus":0.05510649641304809,"score_gpt":0.24575382654304748,"score_spread":0.1906473301299994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099932596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014015908,0.0005205143,0.9737979,0.00018420383,0.000069919755,0.0000681932,0.00010899758,0.00048738156,0.010746897],"genre_scores_gemma":[0.27178556,0.0008778879,0.7193483,0.00018721499,0.00008277302,0.00010399146,0.00018165946,0.00007638152,0.0073561985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998087,0.000026200729,0.000008942073,0.000038039183,0.00008824651,0.000029946637],"domain_scores_gemma":[0.9998357,0.00004472974,0.000021742044,0.00004086805,0.000045731776,0.000011138829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017835632,0.00039167778,0.0003058022,0.00047886476,0.00065022573,0.00051920884,0.00031966012,0.0003966699,0.005934759],"category_scores_gemma":[0.00062210776,0.00021633996,0.0006607975,0.0004635566,0.00041687783,0.00088184647,0.000555467,0.00072054274,0.0014374891],"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.00024233408,0.00006472063,0.00035835739,0.00041255352,0.00006443415,0.00038955864,0.0003813123,0.037728425,0.30753434,0.20251495,0.0068289097,0.44348004],"study_design_scores_gemma":[0.00013104902,0.00097279274,0.0007609397,0.00026255648,0.00019145508,0.0022451235,0.00018143967,0.44916287,0.24412656,0.17326388,0.12859459,0.000106754575],"about_ca_topic_score_codex":0.0010812496,"about_ca_topic_score_gemma":0.002200717,"teacher_disagreement_score":0.005934759,"about_ca_system_score_codex":0.00046058968,"about_ca_system_score_gemma":0.00045755247,"threshold_uncertainty_score":0.019853711},"labels":[],"label_agreement":null},{"id":"W2100494081","doi":"10.1006/jctb.2000.1987","title":"On the Dissection of Rectangles into Right-Angled Isosceles Triangles","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isosceles triangle; Rectangle; Digraph; Generalization; Combinatorics; Mathematics; Square (algebra); Geometry; Mathematical analysis","score_opus":0.006297096261391931,"score_gpt":0.21416959232477364,"score_spread":0.2078724960633817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2078202,0.0009930814,0.55056036,0.0008952089,0.00070356,0.00022411492,0.0003210402,0.00047150222,0.23801099],"genre_scores_gemma":[0.5625293,0.0021868227,0.33072308,0.00061441865,0.0002779031,0.00014005498,0.0010661046,0.0006285428,0.10183377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949086,0.00012688503,0.000030373749,0.0001053678,0.00013816325,0.00010823635],"domain_scores_gemma":[0.9990416,0.0004968684,0.000076341435,0.00015692714,0.00013464036,0.00009349347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504634,0.0006234581,0.0006324481,0.0008750103,0.001110295,0.0019852994,0.0012049611,0.0008593881,0.017913578],"category_scores_gemma":[0.002587781,0.0006917488,0.00069687987,0.0007986127,0.0016179942,0.0034214535,0.0024147262,0.0023825262,0.0034484745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027336917,0.000055836997,0.0005463263,0.00013991976,0.000015357384,0.00043170864,0.00086462527,0.011547423,0.009658521,0.887864,0.0073178005,0.08128508],"study_design_scores_gemma":[0.00006460436,0.000107008804,0.00050534005,0.00009307306,0.00002198965,0.00048280307,0.0006299822,0.035223793,0.0042732633,0.9144731,0.04409065,0.000034332264],"about_ca_topic_score_codex":0.001309219,"about_ca_topic_score_gemma":0.0017151707,"teacher_disagreement_score":0.017913578,"about_ca_system_score_codex":0.00059744413,"about_ca_system_score_gemma":0.0002877152,"threshold_uncertainty_score":0.059926867},"labels":[],"label_agreement":null},{"id":"W2100655974","doi":"10.1007/978-3-540-85097-7_29","title":"The Robot Cleans Up","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Eulerian path; Enhanced Data Rates for GSM Evolution; Robot; Weighting; Property (philosophy); Graph; Artificial intelligence; Theoretical computer science; Mathematics; Lagrangian; Physics","score_opus":0.020224242576590497,"score_gpt":0.23309797980103883,"score_spread":0.21287373722444833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100655974","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02058106,0.003995913,0.29039922,0.019511128,0.006917065,0.0001526315,0.00037571794,0.007170333,0.6508969],"genre_scores_gemma":[0.20568064,0.0032413804,0.08206431,0.0060747424,0.0010999949,0.0002011149,0.00045260412,0.0019627227,0.6992224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960834,0.000059770842,0.000008942992,0.00010605841,0.0001474358,0.00006949168],"domain_scores_gemma":[0.9996636,0.000061027367,0.000018265917,0.00012482857,0.000066703615,0.00006562809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042406967,0.0008852856,0.00070020615,0.00063540286,0.0018753409,0.0024534445,0.0010026103,0.0018969805,0.04036276],"category_scores_gemma":[0.0011891904,0.0005344689,0.00081200636,0.00030741552,0.0038524366,0.0041618804,0.0031423953,0.0032771106,0.023795325],"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.00022561359,0.000100905054,0.0005130981,0.00034620916,0.00006054364,0.0005488866,0.0014900896,0.00414636,0.02675641,0.5783152,0.14726594,0.24023068],"study_design_scores_gemma":[0.000026716565,0.00022500982,0.00050939486,0.00013931593,0.000030172718,0.00052519207,0.00077799143,0.004728956,0.008585434,0.11849987,0.865881,0.00007094963],"about_ca_topic_score_codex":0.0015506446,"about_ca_topic_score_gemma":0.0012391219,"teacher_disagreement_score":0.04036276,"about_ca_system_score_codex":0.00050913513,"about_ca_system_score_gemma":0.0011359141,"threshold_uncertainty_score":0.13502681},"labels":[],"label_agreement":null},{"id":"W2101822710","doi":"10.1109/icci.1992.227619","title":"Fault-tolerance for multistage interconnection networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Multistage interconnection networks; Interconnection; Fault tolerance; Computer science; Scheme (mathematics); Reliability (semiconductor); Spare part; Routing (electronic design automation); Process (computing); Fault (geology); Distributed computing; Parallel computing; Embedded system; Computer network; Reliability engineering; Engineering; Operating system; Mathematics","score_opus":0.015382435749211438,"score_gpt":0.24294235612885676,"score_spread":0.22755992037964531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101822710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053461842,0.0017516167,0.93780965,0.00032227518,0.00016930953,0.00006077121,0.00008536646,0.0008175968,0.005521498],"genre_scores_gemma":[0.74144393,0.0012705596,0.24884945,0.00018126499,0.00009827107,0.00010412041,0.0002677666,0.000055320932,0.007729158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997279,0.00004893518,0.000024057297,0.000039869097,0.0001265056,0.00003276285],"domain_scores_gemma":[0.9997427,0.000054389486,0.000044906836,0.00006906883,0.00007220583,0.000016650525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018535931,0.00026988593,0.00023900591,0.00045083935,0.00041376433,0.0004964754,0.0006493949,0.0004206033,0.0016587544],"category_scores_gemma":[0.0006546907,0.00013795239,0.00032286963,0.0004861261,0.00026137417,0.00074946147,0.0004884781,0.00040748532,0.00025184744],"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.00033953253,0.00007449956,0.0012355712,0.00064987846,0.00009142085,0.00049416744,0.0002632658,0.2873989,0.14295913,0.1457228,0.0075914524,0.4131794],"study_design_scores_gemma":[0.00005804078,0.00035232166,0.0009738871,0.00005915918,0.0000685762,0.0006964466,0.000035269648,0.8481691,0.052220237,0.057008088,0.040312372,0.000046487923],"about_ca_topic_score_codex":0.0006488996,"about_ca_topic_score_gemma":0.0010321941,"teacher_disagreement_score":0.0016587544,"about_ca_system_score_codex":0.0005579779,"about_ca_system_score_gemma":0.00029638634,"threshold_uncertainty_score":0.005549133},"labels":[],"label_agreement":null},{"id":"W2101970413","doi":"10.1109/icc.1993.397364","title":"Bridged shuffle-exchange network: A high performance self-routing ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Asynchronous Transfer Mode; Computer science; Routing (electronic design automation); Asynchronous communication; Computer network; Routing algorithm; Interconnection; Throughput; Routing protocol; Topology (electrical circuits); Distributed computing; Engineering; Telecommunications; Electrical engineering","score_opus":0.01998178285162159,"score_gpt":0.19952607470553,"score_spread":0.1795442918539084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101970413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5219736,0.0011983565,0.44986928,0.0004405072,0.00028647378,0.0001969111,0.00043771358,0.0032231698,0.022374006],"genre_scores_gemma":[0.89938676,0.00035276773,0.09150595,0.00013132328,0.00007052436,0.0000821855,0.00047906776,0.000039930826,0.007951515],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999186,0.000020843854,0.0000047877265,0.000014777997,0.000027059028,0.000014000843],"domain_scores_gemma":[0.9999039,0.000017199838,0.000011177131,0.000019901614,0.000026350148,0.00002146741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194265,0.00016226861,0.00019009132,0.00044543343,0.00033592482,0.00041723065,0.0006413678,0.00029100248,0.0020413587],"category_scores_gemma":[0.0001487637,0.000093763425,0.00011815568,0.00035819225,0.00020150923,0.00059215294,0.00033610358,0.00016816876,0.00042522154],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0011132701,0.00059288624,0.0037503294,0.0004107731,0.00010577613,0.0008842559,0.00013408912,0.081123225,0.47307646,0.082564116,0.014312272,0.34193256],"study_design_scores_gemma":[0.00025258565,0.0014701323,0.0046998854,0.000030019255,0.00009857099,0.0014488979,0.00004142562,0.78901726,0.13905476,0.020928493,0.042875145,0.00008283501],"about_ca_topic_score_codex":0.0003041278,"about_ca_topic_score_gemma":0.0006146219,"teacher_disagreement_score":0.0020413587,"about_ca_system_score_codex":0.00027768817,"about_ca_system_score_gemma":0.0002742972,"threshold_uncertainty_score":0.006829083},"labels":[],"label_agreement":null},{"id":"W2102325484","doi":"10.1109/fccm.2012.55","title":"VENICE: A Compact Vector Processor for FPGA Applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TRIUMF; University of British Columbia Hospital","funders":"","keywords":"Field-programmable gate array; Las vegas; Computer science; Parallel computing; Block (permutation group theory); Logic block; Computer hardware; Embedded system; Arithmetic; Mathematics","score_opus":0.029430734469102257,"score_gpt":0.29015715415069665,"score_spread":0.2607264196815944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102325484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19722375,0.008721305,0.50791866,0.0006804182,0.0010206565,0.00091261696,0.0051796995,0.081283554,0.1970593],"genre_scores_gemma":[0.63469285,0.0019277156,0.23119158,0.0006107894,0.00018930092,0.00036975835,0.01271701,0.002874576,0.11542633],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975604,0.000026014362,0.000013681857,0.0000424852,0.00011995171,0.000041905267],"domain_scores_gemma":[0.9998217,0.000025672936,0.0000175263,0.00003148335,0.00006630543,0.000037310325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024962303,0.0006319435,0.00032508885,0.000556971,0.00018763883,0.00057716627,0.0011104796,0.00027124616,0.019068256],"category_scores_gemma":[0.0005558425,0.00023063995,0.00022513604,0.0005966639,0.00022629689,0.0009719937,0.00064569013,0.00047463522,0.003491397],"study_design_candidate":"bench_or_experimental","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.0014984462,0.00017765688,0.0016168687,0.0007110855,0.00008259647,0.00041593052,0.0001503282,0.012818052,0.16438916,0.019055508,0.15976165,0.6393228],"study_design_scores_gemma":[0.0010084674,0.0033720222,0.007343883,0.00017284573,0.00014372388,0.0031444393,0.00011470682,0.11478501,0.20746675,0.008246771,0.6539752,0.00022613267],"about_ca_topic_score_codex":0.0009036457,"about_ca_topic_score_gemma":0.0020985652,"teacher_disagreement_score":0.019068256,"about_ca_system_score_codex":0.0002921456,"about_ca_system_score_gemma":0.0006150039,"threshold_uncertainty_score":0.063789725},"labels":[],"label_agreement":null},{"id":"W2102714269","doi":"10.1109/tpds.2008.108","title":"Detecting Threats in Star Graphs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"University of Sydney; University of Glasgow","keywords":"Computer science; Star (game theory); Network topology; Interconnection; Distributed computing; Computer network; Star network; Software; Software-defined networking; Topology (electrical circuits); Operating system","score_opus":0.02119606659481043,"score_gpt":0.24409235923687436,"score_spread":0.22289629264206393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102714269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22403333,0.0012193703,0.76426977,0.0013151654,0.00011827196,0.0002686928,0.00038910436,0.0010124238,0.0073738047],"genre_scores_gemma":[0.86029506,0.000905651,0.1346053,0.00041252197,0.000091791786,0.00012614271,0.0006557446,0.00008472383,0.0028231516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997424,0.0009817557,0.00012254479,0.00054148916,0.0006333896,0.0002968412],"domain_scores_gemma":[0.98827446,0.006720233,0.0019031499,0.0011148803,0.0012811632,0.0007061056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020626846,0.000923043,0.001219259,0.002269054,0.0016345746,0.0018758676,0.0016714656,0.0023222598,0.001212902],"category_scores_gemma":[0.012550929,0.00071597815,0.00083933637,0.0015353682,0.001796285,0.0060608643,0.0036532225,0.0011864998,0.00044799477],"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.0011178805,0.00027961395,0.029416494,0.00076883275,0.00042594722,0.0023225467,0.0016901519,0.56119806,0.012222853,0.23159279,0.010454286,0.14851058],"study_design_scores_gemma":[0.00004240437,0.0002198992,0.0016123204,0.000047005804,0.00006664505,0.0008195011,0.00069853105,0.7737601,0.0037087188,0.21368013,0.0053097038,0.000035029094],"about_ca_topic_score_codex":0.001969923,"about_ca_topic_score_gemma":0.0015113673,"teacher_disagreement_score":0.0023222598,"about_ca_system_score_codex":0.0009357281,"about_ca_system_score_gemma":0.00077493413,"threshold_uncertainty_score":0.010908604},"labels":[],"label_agreement":null},{"id":"W2102916448","doi":"10.1109/pccc.1995.472485","title":"A framework for optimal communication on a subclass of the Cayley graph based networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"Instituto de Telecomunicações","keywords":"Cayley graph; Graph; Subclass; Computer science; Theoretical computer science; Node (physics); Combinatorics; Discrete mathematics; Mathematics; Engineering","score_opus":0.034554647385322886,"score_gpt":0.24871251088311958,"score_spread":0.2141578634977967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102916448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011494756,0.0005824092,0.96259665,0.0005886426,0.00007148125,0.00005302282,0.00016609381,0.00016214169,0.024284912],"genre_scores_gemma":[0.52029586,0.003096847,0.45631376,0.00072529534,0.00052090123,0.0005133876,0.00063333637,0.00021131556,0.017689362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946576,0.00019059105,0.000022638073,0.00012477698,0.00012325367,0.00007302211],"domain_scores_gemma":[0.9992803,0.0003175324,0.000068478264,0.00013460564,0.000121487814,0.00007757251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081143086,0.00060391624,0.0005655416,0.0008303865,0.00097635464,0.0015150034,0.0012201582,0.0009875289,0.0056069996],"category_scores_gemma":[0.0018872558,0.00029247664,0.0006548267,0.0009373772,0.0013488419,0.0031520098,0.0012638994,0.0016241495,0.00067146274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042753722,0.0000056411886,0.000034907636,0.000016248552,0.0000034946627,0.000026645677,0.000035162167,0.017875522,0.00041768656,0.97585845,0.0013816954,0.004340301],"study_design_scores_gemma":[0.000010723489,0.000020830974,0.00007582944,0.000013899651,0.0000067299757,0.000057140183,0.000033454246,0.16988902,0.00026831822,0.81814975,0.011464825,0.000009445296],"about_ca_topic_score_codex":0.0029341914,"about_ca_topic_score_gemma":0.003508598,"teacher_disagreement_score":0.0056069996,"about_ca_system_score_codex":0.0015128598,"about_ca_system_score_gemma":0.0008763081,"threshold_uncertainty_score":0.018757343},"labels":[],"label_agreement":null},{"id":"W2103197839","doi":"10.1109/iscc.2006.54","title":"Constructing Service Matrices for Agile All-Optical Cores","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Computer science; Star network; Matrix (chemical analysis); Algorithm; Bandwidth (computing); Multiplexing; Mathematics; Theoretical computer science; Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Network topology; Telecommunications","score_opus":0.018892145161291254,"score_gpt":0.24785540341105006,"score_spread":0.2289632582497588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103197839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015161942,0.000022516,0.9832598,0.000036095527,0.000013710486,0.00003419862,0.000018892739,0.0001761307,0.0012767628],"genre_scores_gemma":[0.26697528,0.00013363057,0.7285908,0.000057299156,0.000033413282,0.00018259979,0.00016170209,0.0001614808,0.0037037814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996413,0.00010198453,0.000011919898,0.00003412251,0.00016741765,0.00004326793],"domain_scores_gemma":[0.9993291,0.00024675668,0.000058449208,0.000073802774,0.00022158101,0.00007033195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049585226,0.0007774016,0.0003601477,0.0006703355,0.0005362644,0.00082615647,0.00068642816,0.00042902277,0.0026464285],"category_scores_gemma":[0.0022942328,0.00043401195,0.0006381879,0.000502279,0.0006936491,0.0009017921,0.00097462547,0.0010040748,0.0009854161],"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.0001847055,0.00014333881,0.0010012876,0.00018624098,0.000032984502,0.00026160674,0.00035485547,0.5189285,0.036017854,0.25433713,0.0033637853,0.1851877],"study_design_scores_gemma":[0.000008931879,0.000029744948,0.000066444714,0.000005151191,0.0000023208056,0.000045387995,0.000033298853,0.9666453,0.004293241,0.027628398,0.0012339433,0.000007899808],"about_ca_topic_score_codex":0.0021184122,"about_ca_topic_score_gemma":0.0020762873,"teacher_disagreement_score":0.0026464285,"about_ca_system_score_codex":0.0006229509,"about_ca_system_score_gemma":0.0013896034,"threshold_uncertainty_score":0.0088531375},"labels":[],"label_agreement":null},{"id":"W2103265299","doi":"10.1109/icpads.1997.652622","title":"Universally fault-tolerant broadcasting in trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Fault tolerance; Computer science; Vulnerability (computing); Upper and lower bounds; Tree (set theory); Binary logarithm; Constant (computer programming); Time complexity; Scheme (mathematics); Distributed computing; Node (physics); Computer network; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Computer security; Physics","score_opus":0.024452535491018376,"score_gpt":0.20542534327725442,"score_spread":0.18097280778623603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103265299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28093755,0.00081908196,0.7115583,0.00055950077,0.000041514082,0.00012562185,0.0001980881,0.00080174365,0.004958649],"genre_scores_gemma":[0.8484434,0.0005814708,0.14834036,0.000098874865,0.000037273283,0.00008591373,0.00016884576,0.000063945474,0.0021799281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905306,0.00022232087,0.000063393905,0.0001489901,0.00022015824,0.00029203604],"domain_scores_gemma":[0.9961838,0.0020207455,0.00054243155,0.00070397323,0.00036450525,0.00018450906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011742125,0.0003272004,0.0007494318,0.00049738056,0.0012483794,0.0010167036,0.0010222996,0.0007270489,0.0010204916],"category_scores_gemma":[0.0058896504,0.00024611526,0.00042328975,0.0012590117,0.0011614044,0.0028322092,0.0012339831,0.0007191652,0.00025210044],"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.0009753898,0.000091675756,0.0026694974,0.00044641056,0.00007870055,0.00045461243,0.0015486936,0.5173787,0.0527663,0.29420844,0.0030885632,0.12629305],"study_design_scores_gemma":[0.000076177654,0.00031100272,0.00069758995,0.000035532816,0.00006616333,0.00044080152,0.00024624707,0.7713975,0.020314675,0.19880165,0.0075754854,0.000037236725],"about_ca_topic_score_codex":0.0031554895,"about_ca_topic_score_gemma":0.0028182568,"teacher_disagreement_score":0.0031554895,"about_ca_system_score_codex":0.0014699986,"about_ca_system_score_gemma":0.00096225657,"threshold_uncertainty_score":0.010665655},"labels":[],"label_agreement":null},{"id":"W2103466822","doi":"10.1109/shpcc.1994.296619","title":"An efficient single copy cache coherence protocol for multiprocessors with multistage interconnection networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"York University","funders":"","keywords":"Computer science; Cache coherence; MESI protocol; Interconnection; Cache; MESIF protocol; Parallel computing; Protocol (science); Shared memory; Bus sniffing; Multiprocessing; Scalability; Overhead (engineering); Distributed shared memory; Distributed computing; Multistage interconnection networks; Computer network; Cache algorithms; CPU cache; Memory management; Uniform memory access; Operating system; Overlay","score_opus":0.043499619113528364,"score_gpt":0.28114997814522713,"score_spread":0.23765035903169876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103466822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18576893,0.0009486929,0.80537456,0.00071248657,0.00011355173,0.00034644784,0.0001868007,0.0017658538,0.0047826516],"genre_scores_gemma":[0.8546995,0.0003479219,0.13961568,0.00013402868,0.000041044055,0.00033581068,0.00032304932,0.00005068941,0.0044522113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953616,0.00012455332,0.00003974105,0.000047006495,0.0002132569,0.000039235376],"domain_scores_gemma":[0.9993261,0.00019627281,0.00008038222,0.00018487548,0.00018180316,0.000030507614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059597654,0.00023422424,0.00024050595,0.00036879192,0.0005733575,0.00047589786,0.00090142054,0.00047552463,0.0012240508],"category_scores_gemma":[0.0018819906,0.00018512369,0.00017467636,0.0004925482,0.00040632626,0.0014495288,0.0006579737,0.00042100865,0.00014368356],"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.0009943516,0.00038998754,0.0031525777,0.00060453254,0.00018908846,0.0008036692,0.00081127015,0.30271786,0.19372246,0.07007707,0.016471237,0.4100659],"study_design_scores_gemma":[0.00023615517,0.00078211905,0.0012184007,0.000023659059,0.00008297783,0.00035481295,0.000097625874,0.921937,0.04920686,0.01092855,0.0150722675,0.000059499118],"about_ca_topic_score_codex":0.0020501085,"about_ca_topic_score_gemma":0.0045552053,"teacher_disagreement_score":0.0020501085,"about_ca_system_score_codex":0.0005030979,"about_ca_system_score_gemma":0.0008564673,"threshold_uncertainty_score":0.004094839},"labels":[],"label_agreement":null},{"id":"W2103577716","doi":"10.1109/ispan.1996.509020","title":"Ring reconfiguration in presence of close fault cuts","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Carleton University","funders":"","keywords":"Subring; Control reconfiguration; Ring (chemistry); Partition (number theory); Topology (electrical circuits); Computer science; Ring network; Betweenness centrality; Fault (geology); Mathematics; Algorithm; Combinatorics; Network topology; Computer network; Embedded system; Chemistry","score_opus":0.0266790136192026,"score_gpt":0.23657442468884432,"score_spread":0.2098954110696417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103577716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7382153,0.00077569415,0.25621012,0.00028537415,0.00005442302,0.000041370367,0.00008429411,0.0004594777,0.0038739091],"genre_scores_gemma":[0.9729672,0.00013173862,0.025746921,0.000036591635,0.000038463444,0.000019664176,0.000106786785,0.000027557775,0.0009251644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882525,0.0003429346,0.000070902315,0.00022105151,0.0003428591,0.00019712],"domain_scores_gemma":[0.9938392,0.0038921298,0.00102906,0.00054197945,0.00038261298,0.00031511296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079134,0.00034451703,0.0008755974,0.0005158819,0.0005059502,0.00095129537,0.0007997584,0.00095858955,0.0012025594],"category_scores_gemma":[0.00717102,0.00040534785,0.00028687323,0.00042926127,0.00080061593,0.0021526683,0.0011030209,0.00077425165,0.00018041379],"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.002477951,0.00012154658,0.0056888913,0.00040466385,0.00014351083,0.0041856975,0.0006885895,0.7315822,0.06251638,0.08326111,0.0028837952,0.106045656],"study_design_scores_gemma":[0.00009246287,0.00047243678,0.0022712157,0.0000188818,0.00005230329,0.0014244645,0.00022414471,0.9166008,0.020875255,0.05547295,0.0024663631,0.000028808965],"about_ca_topic_score_codex":0.00026000245,"about_ca_topic_score_gemma":0.00018973894,"teacher_disagreement_score":0.0012025594,"about_ca_system_score_codex":0.00039212848,"about_ca_system_score_gemma":0.000113253605,"threshold_uncertainty_score":0.0057070255},"labels":[],"label_agreement":null},{"id":"W2103615835","doi":"10.1109/dtis.2009.4938035","title":"A reliability-aware design methodology for Networks-on-Chip applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":19,"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; University of Victoria","funders":"","keywords":"Computer science; Reliability (semiconductor); Network topology; Network on a chip; Interconnection; Probabilistic logic; Key (lock); Reliability engineering; Network planning and design; Network architecture; System on a chip; Distributed computing; Computer architecture; Embedded system; Computer network; Engineering; Artificial intelligence","score_opus":0.09836426496471656,"score_gpt":0.3256888478572911,"score_spread":0.2273245828925745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103615835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018444492,0.0002630914,0.9966208,0.00006877616,0.000026529384,0.00007669097,0.00002575822,0.00030242847,0.00077152875],"genre_scores_gemma":[0.09033111,0.00093785307,0.9059375,0.00011266639,0.000048957205,0.0005364612,0.00013262616,0.00017201412,0.001790811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890065,0.00034393443,0.00007030985,0.000102423226,0.0005302235,0.00005245304],"domain_scores_gemma":[0.9988657,0.00039475918,0.00015130494,0.00019218342,0.000370709,0.000025283472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016749072,0.0010396556,0.00054050336,0.000904964,0.0004192505,0.0007228877,0.0017949817,0.0007862763,0.0014772128],"category_scores_gemma":[0.002811888,0.00062728673,0.0010595991,0.00054494437,0.00047190636,0.0010215178,0.00063176104,0.0012726942,0.00049388834],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024094421,0.0000602196,0.00038617384,0.00046569793,0.00014155096,0.00019581353,0.00013176547,0.77307,0.023593714,0.061031047,0.0025593282,0.1383406],"study_design_scores_gemma":[0.000016260201,0.00009899782,0.00012721261,0.0000514868,0.00007323273,0.00019298376,0.000018780887,0.9608203,0.007855096,0.017847616,0.012879284,0.000018706456],"about_ca_topic_score_codex":0.0010944939,"about_ca_topic_score_gemma":0.0019508139,"teacher_disagreement_score":0.0017949817,"about_ca_system_score_codex":0.00068920484,"about_ca_system_score_gemma":0.0013161679,"threshold_uncertainty_score":0.008857846},"labels":[],"label_agreement":null},{"id":"W2103676114","doi":"10.82308/8676","title":"Time-slotted scheduling for agile all-photonics networks : performance and complexity","year":2007,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","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":"McGill University","funders":"","keywords":"Bottleneck; Computer science; Scheduling (production processes); Computational complexity theory; Computer network; Distributed computing; Embedded system; Algorithm; Engineering","score_opus":0.03370454087243413,"score_gpt":0.24547152443850212,"score_spread":0.211766983566068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103676114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5418061,0.00046080482,0.4508688,0.0002778227,0.00006761404,0.000096445976,0.000076093325,0.000499092,0.0058472315],"genre_scores_gemma":[0.90193325,0.00013725283,0.09708099,0.0000300077,0.00002616914,0.000041844378,0.000042135583,0.000024500849,0.0006837934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994254,0.00023233144,0.00002087482,0.000049821538,0.00021310296,0.000058489917],"domain_scores_gemma":[0.9977229,0.001538999,0.00020122249,0.00025682192,0.00021507243,0.000064941385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013354205,0.00026443417,0.00024863158,0.00033949464,0.00040492418,0.00079323235,0.000598689,0.00018991505,0.0009016053],"category_scores_gemma":[0.0034043058,0.00016125663,0.00018230942,0.00040348156,0.00031352259,0.0008414432,0.00034688946,0.00044939146,0.000092619106],"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.00057262613,0.00013286794,0.002733522,0.00007763611,0.000040622177,0.000061431616,0.00008884655,0.83763134,0.017651526,0.016308175,0.000882912,0.12381855],"study_design_scores_gemma":[0.000015124562,0.00006317649,0.00027225452,0.000002332421,0.0000042056513,0.000015617265,0.000010812203,0.9951114,0.0024075778,0.0018837982,0.00021074984,0.0000030642022],"about_ca_topic_score_codex":0.0026570268,"about_ca_topic_score_gemma":0.00373448,"teacher_disagreement_score":0.0026570268,"about_ca_system_score_codex":0.0012134949,"about_ca_system_score_gemma":0.0017950519,"threshold_uncertainty_score":0.00880456},"labels":[],"label_agreement":null},{"id":"W2103679044","doi":"10.1109/icecs.2008.4675098","title":"Implementation of large-integer hardware multiplier in Xilinx FPGA","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Field-programmable gate array; Multiplier (economics); Computer science; Integer (computer science); Reconfigurable computing; Embedded system; Computer hardware; Parallel computing; Operating system","score_opus":0.021789087593911398,"score_gpt":0.2907820548157207,"score_spread":0.2689929672218093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103679044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2035051,0.00090307806,0.7523919,0.00021886484,0.00017185617,0.0003181335,0.00072632206,0.013904128,0.027860707],"genre_scores_gemma":[0.6083002,0.0005183409,0.3756861,0.00010097408,0.000026641907,0.00023938442,0.0011285085,0.00045213496,0.013547592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990535,0.00001825485,0.00000839637,0.000019870919,0.000029648496,0.00001855092],"domain_scores_gemma":[0.9999232,0.00002243689,0.000010372818,0.000017656661,0.000021927719,0.000004365889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001732419,0.00046944525,0.00018878575,0.0003349868,0.00015818758,0.00040282088,0.0003723371,0.00017219187,0.0087767765],"category_scores_gemma":[0.00026192074,0.00016283295,0.0001346571,0.00021804738,0.00008925532,0.00033282628,0.00013598018,0.00022777407,0.0011481893],"study_design_candidate":"bench_or_experimental","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.0009956318,0.00015841887,0.003336875,0.0012768483,0.00009157064,0.00087807735,0.00046742777,0.08473068,0.35100108,0.035125624,0.0216389,0.5002989],"study_design_scores_gemma":[0.00033077714,0.0014606833,0.004049689,0.00016054665,0.00006748771,0.0013378524,0.00014308882,0.4148811,0.48047385,0.006466129,0.09058371,0.00004502747],"about_ca_topic_score_codex":0.00040759548,"about_ca_topic_score_gemma":0.00071509543,"teacher_disagreement_score":0.0087767765,"about_ca_system_score_codex":0.00028317538,"about_ca_system_score_gemma":0.0003009926,"threshold_uncertainty_score":0.029361248},"labels":[],"label_agreement":null},{"id":"W2103833312","doi":"10.13053/cys-16-2-1384","title":"System-Level Fault Diagnosis with Dynamic Mesh Optimization","year":2012,"lang":"es","type":"article","venue":"Redalyc (Universidad Autónoma del Estado de México)","topic":"Interconnection Networks and Systems","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":"University of Ottawa","funders":"","keywords":"Computer science; Exploit; Convergence (economics); Identification (biology); Set (abstract data type); Task (project management); Scheme (mathematics); Distributed computing; Fault (geology); Software; Optimization problem; Fault detection and isolation; Algorithm; Artificial intelligence; Engineering; Mathematics","score_opus":0.016171843999864686,"score_gpt":0.22920285920845185,"score_spread":0.21303101520858717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103833312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025399392,0.00018623068,0.97168905,0.00019663971,0.00002626187,0.00004575144,0.000052369614,0.00030540008,0.002098926],"genre_scores_gemma":[0.7597399,0.00014990018,0.23826776,0.00009230363,0.000021257649,0.00013910513,0.0001420304,0.00005529739,0.0013924378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977463,0.000094367315,0.0000090224075,0.000036283887,0.000057531972,0.000028109796],"domain_scores_gemma":[0.9992508,0.0005406931,0.00007250227,0.000052363455,0.00006571908,0.00001778701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290895,0.00050114206,0.00055853266,0.0005667396,0.00024775887,0.00044544108,0.00058560463,0.00061409496,0.0013467516],"category_scores_gemma":[0.0021718536,0.00022340828,0.0004539064,0.00040032112,0.0005562548,0.00057318626,0.0007923688,0.0005470622,0.0001341955],"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.000035796773,0.00001198158,0.00048681165,0.000025287667,0.00001557316,0.000014872121,0.000013350902,0.97075033,0.0008833451,0.004398948,0.00025449754,0.023109121],"study_design_scores_gemma":[0.000003326056,0.000006625056,0.000040532297,0.000001712316,0.0000017523356,0.0000033061704,0.000002306323,0.9974517,0.0001968953,0.002166019,0.00012484362,9.1351126e-7],"about_ca_topic_score_codex":0.0030690767,"about_ca_topic_score_gemma":0.0020657945,"teacher_disagreement_score":0.0030690767,"about_ca_system_score_codex":0.0007013508,"about_ca_system_score_gemma":0.00060560106,"threshold_uncertainty_score":0.0061024427},"labels":[],"label_agreement":null},{"id":"W2104376464","doi":"10.1109/nocs.2012.16","title":"Synthesis of NoC Interconnects for Custom MPSoC Architectures","year":2012,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MPSoC; Computer science; Network on a chip; Benchmark (surveying); Multiprocessing; Embedded system; Asynchronous communication; Computer architecture; System on a chip; Queueing theory; Network topology; Parallel computing; Computer network","score_opus":0.01869181315280996,"score_gpt":0.2506252529036445,"score_spread":0.23193343975083455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104376464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15751138,0.00025224904,0.8286874,0.0001049731,0.00008576173,0.00025014643,0.00021334969,0.0017656564,0.011128965],"genre_scores_gemma":[0.56711775,0.00029203185,0.42768043,0.000035797486,0.00002369513,0.00023831114,0.00037548284,0.00035838014,0.0038781506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981326,0.000036229205,0.000016340811,0.00002732315,0.00008487342,0.000021965052],"domain_scores_gemma":[0.9995969,0.00012599168,0.00008789885,0.00007238316,0.000098916156,0.000017872933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028557618,0.00040966002,0.00018004121,0.00048291488,0.00029664976,0.00029879564,0.00037910853,0.00020020637,0.0015219765],"category_scores_gemma":[0.00085627096,0.0002516703,0.0003118151,0.00032283145,0.00019644582,0.00027941758,0.00031317218,0.00028363257,0.00021319305],"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.00006915177,0.00009634701,0.0012392413,0.0004333191,0.00004487043,0.00038086507,0.00019563641,0.60941035,0.24262401,0.017609932,0.0017722693,0.12612389],"study_design_scores_gemma":[0.000025860552,0.00021153752,0.0006379564,0.000025340105,0.000031314914,0.00016748476,0.0000623299,0.87378746,0.107246846,0.004688582,0.013097265,0.000018114282],"about_ca_topic_score_codex":0.0007896278,"about_ca_topic_score_gemma":0.002381597,"teacher_disagreement_score":0.0015219765,"about_ca_system_score_codex":0.0004453445,"about_ca_system_score_gemma":0.0006357521,"threshold_uncertainty_score":0.0050914884},"labels":[],"label_agreement":null},{"id":"W2104442249","doi":"10.1109/glocom.1997.632603","title":"A new design of central queueing ATM switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Queueing theory; Asynchronous Transfer Mode; Scheduling (production processes); Multicast; Distributed computing; ATM adaptation layer; Routing (electronic design automation); Engineering","score_opus":0.0414667774955918,"score_gpt":0.21289041867815775,"score_spread":0.17142364118256595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104442249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018157646,0.0013408954,0.96053064,0.00027143193,0.0009197699,0.00016171148,0.00008801084,0.0028360088,0.015693791],"genre_scores_gemma":[0.41684398,0.0012190798,0.56153196,0.0008268871,0.0007101569,0.00034885964,0.00024788166,0.0002626496,0.018008607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991297,0.000120573895,0.000060382667,0.00024423865,0.0003144811,0.00013067319],"domain_scores_gemma":[0.9991811,0.000118314194,0.00007229967,0.00017165137,0.0003616132,0.000094990544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091090804,0.000585668,0.0005995416,0.00063998357,0.0008709186,0.0022096427,0.0029694326,0.00080262334,0.006154246],"category_scores_gemma":[0.0011680205,0.00049109163,0.0004954554,0.0006061722,0.0006609616,0.001959802,0.0010715598,0.0014411844,0.0015127647],"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.00059819664,0.00040825983,0.0011273527,0.0004864088,0.00013055142,0.000386498,0.0003688686,0.0370784,0.21284743,0.35157764,0.015646461,0.379344],"study_design_scores_gemma":[0.00040175175,0.0013705909,0.0010591611,0.00011846999,0.00040631133,0.0018988597,0.000118468066,0.50793165,0.14479965,0.06616451,0.2755678,0.00016280788],"about_ca_topic_score_codex":0.00073322514,"about_ca_topic_score_gemma":0.0009646198,"teacher_disagreement_score":0.006154246,"about_ca_system_score_codex":0.0012186064,"about_ca_system_score_gemma":0.001627697,"threshold_uncertainty_score":0.02058798},"labels":[],"label_agreement":null},{"id":"W2104568504","doi":"10.1109/icdcs.1992.235109","title":"Optimal coteries for rings and related networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Simon Fraser University","funders":"","keywords":"Computer science; Graph; Ring (chemistry); Combinatorics; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Mathematics; Artificial intelligence; Chemistry","score_opus":0.009202712511090125,"score_gpt":0.21225615548577542,"score_spread":0.2030534429746853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104568504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29675868,0.0014084529,0.66394436,0.00068900397,0.00020032005,0.00024020477,0.0005434703,0.0008860415,0.03532944],"genre_scores_gemma":[0.6532864,0.0010837053,0.31637368,0.000198189,0.000076150056,0.00021202193,0.00060111133,0.0003303991,0.027838388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994816,0.0001299673,0.000032051357,0.00015431673,0.00009416815,0.000108004075],"domain_scores_gemma":[0.99874437,0.00044701013,0.00020262883,0.000212433,0.00018228222,0.00021120581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010131085,0.0007234318,0.00070198777,0.0010642983,0.0008008121,0.0013184614,0.00073441997,0.00094281905,0.010937936],"category_scores_gemma":[0.0034821616,0.00037888903,0.0005243836,0.00090762624,0.0007439623,0.0028497686,0.0014312406,0.0009589983,0.0010282422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004915908,0.00023056894,0.0015229493,0.00035021754,0.0000620667,0.0002988427,0.00031618885,0.24676456,0.015200575,0.5684416,0.013620685,0.15270016],"study_design_scores_gemma":[0.00008959222,0.00043918786,0.000896409,0.00011597335,0.000043636206,0.00042076316,0.0003089358,0.5528052,0.011044291,0.408996,0.024777308,0.000062804866],"about_ca_topic_score_codex":0.0017016393,"about_ca_topic_score_gemma":0.004301487,"teacher_disagreement_score":0.010937936,"about_ca_system_score_codex":0.0011951091,"about_ca_system_score_gemma":0.00068649,"threshold_uncertainty_score":0.036590993},"labels":[],"label_agreement":null},{"id":"W2104626533","doi":"10.1142/s1793830914500517","title":"The number of shortest paths in the (n, k)-star graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Voltage graph; Hypercube graph; Butterfly graph; Path graph; Star (game theory); Graph; Graph power; Complement graph; Line graph","score_opus":0.011004096710846642,"score_gpt":0.25656988590816376,"score_spread":0.2455657891973171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104626533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61125135,0.00096575654,0.37127566,0.00071394286,0.00019480177,0.00008033972,0.0023282468,0.0003062354,0.012883574],"genre_scores_gemma":[0.75696117,0.00092673406,0.23289575,0.00008532911,0.00012490893,0.00013915196,0.001941417,0.00013064154,0.006794978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923694,0.00015405797,0.00010200494,0.00024153701,0.00016466335,0.0001008452],"domain_scores_gemma":[0.9964194,0.0017727546,0.00071347476,0.0003130775,0.0004453592,0.0003359373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061812164,0.0006055759,0.0006789817,0.0018988377,0.0007828041,0.0012285098,0.00093597337,0.0006540013,0.0033830532],"category_scores_gemma":[0.004404922,0.00024345929,0.00039092908,0.0018540414,0.0010956367,0.003711542,0.0007795384,0.00052950147,0.00053754967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011573433,0.00020352493,0.02153069,0.0013135603,0.00027565876,0.00059016707,0.0008269018,0.16535775,0.055081036,0.5389595,0.011615369,0.20308857],"study_design_scores_gemma":[0.000055534467,0.00036752192,0.0073743393,0.0000910013,0.00011129431,0.0015543969,0.00050754944,0.28849947,0.019694094,0.6637416,0.017889503,0.00011367569],"about_ca_topic_score_codex":0.0005675617,"about_ca_topic_score_gemma":0.0010042771,"teacher_disagreement_score":0.0033830532,"about_ca_system_score_codex":0.00056785124,"about_ca_system_score_gemma":0.00053918664,"threshold_uncertainty_score":0.011317372},"labels":[],"label_agreement":null},{"id":"W2104746706","doi":"10.1109/date.2011.5763084","title":"Multi-objective Tabu Search based topology generation technique for application-specific Network-on-Chip architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tabu search; Floorplan; Computer science; Benchmark (surveying); Bottleneck; Network topology; Network on a chip; Queueing theory; Topology (electrical circuits); Power (physics); Distributed computing; Embedded system; Engineering; Algorithm; Computer network","score_opus":0.06212076051847469,"score_gpt":0.2787861224682258,"score_spread":0.2166653619497511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104746706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032565553,0.0004093794,0.9620794,0.000112073285,0.00002673764,0.0001498181,0.000092858514,0.0011509097,0.003413254],"genre_scores_gemma":[0.23737292,0.0002407542,0.7594382,0.000083801504,0.000015627802,0.00048836815,0.00029534937,0.0002579441,0.0018069701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959964,0.00020819379,0.000014363357,0.00004220961,0.00010349194,0.000032024647],"domain_scores_gemma":[0.999209,0.00046606458,0.00008800159,0.00007342074,0.00014195149,0.000021517604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010988023,0.00084175117,0.000693459,0.00121982,0.00056549604,0.00049674686,0.0010994356,0.00070091884,0.0033644675],"category_scores_gemma":[0.0023954588,0.0005106469,0.0006876365,0.0009629563,0.00043301293,0.0005737358,0.00050623453,0.00074252806,0.0004408993],"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.000052918873,0.00006273105,0.00055903784,0.000119655415,0.000057235433,0.00004897422,0.000078804165,0.88108903,0.0043274434,0.00459532,0.0012333771,0.107775465],"study_design_scores_gemma":[0.000023032364,0.000049112234,0.00012890465,0.000009255219,0.000014302892,0.000023352583,0.00001808355,0.9955806,0.0015124705,0.0017779202,0.0008568541,0.000006023302],"about_ca_topic_score_codex":0.0022296177,"about_ca_topic_score_gemma":0.0036161987,"teacher_disagreement_score":0.0033644675,"about_ca_system_score_codex":0.00071316474,"about_ca_system_score_gemma":0.0010271256,"threshold_uncertainty_score":0.011255264},"labels":[],"label_agreement":null},{"id":"W2104922264","doi":"10.1109/icc.1998.682841","title":"Design of per-VC queueing ATM switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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; Asynchronous Transfer Mode; Computer network; Queueing theory; Multicast; Scheduling (production processes); ATM adaptation layer; Distributed computing; Routing (electronic design automation); Engineering","score_opus":0.04967615910630086,"score_gpt":0.2192959819233023,"score_spread":0.16961982281700144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104922264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03458652,0.00081023393,0.9545184,0.00024514113,0.0002504758,0.0002851565,0.0001076597,0.0011101337,0.008086311],"genre_scores_gemma":[0.6682946,0.0005075075,0.32671633,0.00036330748,0.00012979923,0.00028307585,0.00012482384,0.000055915785,0.0035246753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.00012875348,0.000047365305,0.00012541613,0.00019993697,0.00011802988],"domain_scores_gemma":[0.9995572,0.00007120156,0.000047393292,0.000053618995,0.00022192346,0.000048686416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079623586,0.00036221315,0.00043156403,0.00037693905,0.0005095692,0.0012031519,0.0022948615,0.0005612955,0.002111623],"category_scores_gemma":[0.0007645816,0.00030243202,0.00026658078,0.0003405665,0.00033477737,0.00059428846,0.00045913254,0.00051827036,0.0005650987],"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.0007539858,0.00043650606,0.0029137437,0.0005272202,0.00024135139,0.00045789438,0.00025508934,0.2920585,0.17933649,0.17298003,0.009795241,0.34024405],"study_design_scores_gemma":[0.00012424447,0.00038936068,0.0005436802,0.000027285969,0.00010906438,0.0003251676,0.00004067645,0.9145904,0.050456658,0.015464453,0.017892038,0.000036931928],"about_ca_topic_score_codex":0.0008185113,"about_ca_topic_score_gemma":0.00090163224,"teacher_disagreement_score":0.0022948615,"about_ca_system_score_codex":0.0010642944,"about_ca_system_score_gemma":0.0010159323,"threshold_uncertainty_score":0.0077220798},"labels":[],"label_agreement":null},{"id":"W2105113657","doi":"10.1109/glocomw.2010.5700359","title":"Memory requirements for future Internet routers with essentially-perfect QoS guarantees","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McMaster University","funders":"","keywords":"Computer network; Quality of service; Computer science; Router; Network packet; Multiprotocol Label Switching; Core router; Scheduling (production processes); Token bucket; Internet traffic; The Internet; Engineering; Operating system","score_opus":0.008782036418544253,"score_gpt":0.2314083937987104,"score_spread":0.22262635738016615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105113657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61961526,0.014819154,0.3125434,0.003203791,0.00042576896,0.00010769366,0.0008977318,0.0031687042,0.045218512],"genre_scores_gemma":[0.9791308,0.0011176589,0.015681544,0.00018211141,0.00009814856,0.000067176996,0.00028159365,0.00007464178,0.0033662692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934703,0.000090985835,0.000059818674,0.000085392465,0.0002046106,0.00021205135],"domain_scores_gemma":[0.99753356,0.0012808491,0.00025469286,0.00034106546,0.00045182323,0.00013792572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086493,0.0004381483,0.0006409187,0.0006805975,0.0005816885,0.0020876077,0.0015477601,0.00071242865,0.0054109534],"category_scores_gemma":[0.0063910396,0.00030341392,0.00019984362,0.0007142683,0.00053822534,0.0032168617,0.0010852675,0.0005263113,0.0008421005],"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.00260808,0.00023415494,0.0060860473,0.0012898183,0.0001295775,0.0011507757,0.0007896511,0.40688854,0.10388914,0.21705191,0.016239336,0.24364287],"study_design_scores_gemma":[0.00022152497,0.00087301177,0.0028693995,0.00017185154,0.00022236379,0.0013150919,0.00047115242,0.7883569,0.05621679,0.116540484,0.032630656,0.00011075979],"about_ca_topic_score_codex":0.0012458593,"about_ca_topic_score_gemma":0.0012466486,"teacher_disagreement_score":0.0054109534,"about_ca_system_score_codex":0.00094301254,"about_ca_system_score_gemma":0.00076309993,"threshold_uncertainty_score":0.018101394},"labels":[],"label_agreement":null},{"id":"W2105238901","doi":"10.1109/aspdac.2012.6165004","title":"Using link-level latency analysis for path selection for real-time communication on NoCs","year":2012,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Multiprocessing; Latency (audio); Network on a chip; Computer network; Routing (electronic design automation); Interconnection; Distributed computing; Parallel computing","score_opus":0.11154086630268079,"score_gpt":0.32208713127012506,"score_spread":0.21054626496744427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105238901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027005063,0.00031352884,0.970682,0.00008299389,0.00002922548,0.00003105422,0.000025168338,0.0009111441,0.00091976445],"genre_scores_gemma":[0.51536787,0.000385016,0.48226637,0.000081222286,0.000064169384,0.00012137107,0.00012432551,0.00024027485,0.0013494327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993625,0.00018919854,0.0000359114,0.00006977565,0.00026088115,0.000081724414],"domain_scores_gemma":[0.99711454,0.0017879407,0.00038598807,0.00021890925,0.00042979277,0.000062794075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891655,0.0010511737,0.0004194873,0.0017688619,0.0006885897,0.0008535156,0.00070963963,0.0004087328,0.0016787777],"category_scores_gemma":[0.0044495496,0.00037803757,0.00046441483,0.00084290456,0.00048757935,0.0013106539,0.0005079773,0.0006104291,0.00032015936],"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.00016288448,0.00008865424,0.00272966,0.00013839471,0.0000902085,0.000090291294,0.00012379527,0.7424187,0.03346099,0.009606144,0.0010321051,0.2100582],"study_design_scores_gemma":[0.000011345702,0.00005542074,0.00017426566,0.000006561018,0.000018223467,0.00002741734,0.000012031155,0.9895036,0.006434126,0.0031205548,0.0006244679,0.0000119644255],"about_ca_topic_score_codex":0.0026914096,"about_ca_topic_score_gemma":0.0033519764,"teacher_disagreement_score":0.0026914096,"about_ca_system_score_codex":0.0009696586,"about_ca_system_score_gemma":0.0013712667,"threshold_uncertainty_score":0.0070354342},"labels":[],"label_agreement":null},{"id":"W2105498643","doi":"10.1109/icpads.2005.217","title":"Parallel Self-Diagnosis of Large Multiprocessor Systems Under the Generalized Comparison Model","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Computer architecture","score_opus":0.03358374897849159,"score_gpt":0.2857906140517308,"score_spread":0.2522068650732392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105498643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3183277,0.00036190037,0.67842066,0.00029319272,0.00003258383,0.000086022184,0.000035975052,0.00038897846,0.002052842],"genre_scores_gemma":[0.9561938,0.00012563834,0.042414583,0.000040334206,0.000020050362,0.00006342236,0.000033135733,0.000029261544,0.0010798004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00027079892,0.000025452002,0.00013265369,0.00023918439,0.00009051823],"domain_scores_gemma":[0.9980652,0.0012761228,0.0002858535,0.00014001099,0.00016328343,0.0000695272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014726011,0.00046762993,0.00081982504,0.00046955261,0.00041120665,0.00057916273,0.0009859632,0.0006557513,0.0006353829],"category_scores_gemma":[0.0033160676,0.00023007527,0.000507064,0.0005272168,0.0010466904,0.0011478568,0.0007045352,0.00054043095,0.00004750437],"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.0001206618,0.000026853231,0.0009920369,0.000058523165,0.000041189698,0.00025463282,0.00008419897,0.9576639,0.004750648,0.018236725,0.00017873436,0.017591953],"study_design_scores_gemma":[0.000021490316,0.000034848843,0.00025418113,0.0000017923196,0.0000070566484,0.000045347853,0.000009436888,0.9832153,0.0010866403,0.01513619,0.00018372064,0.0000040901277],"about_ca_topic_score_codex":0.0032426605,"about_ca_topic_score_gemma":0.002008703,"teacher_disagreement_score":0.0032426605,"about_ca_system_score_codex":0.0009936942,"about_ca_system_score_gemma":0.0009830624,"threshold_uncertainty_score":0.0077880025},"labels":[],"label_agreement":null},{"id":"W2106281268","doi":"10.1109/glocom.1991.188428","title":"Performance analysis of output buffered fast packet switches with bursty traffic loading","year":2002,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Markov chain; Computer science; Queueing theory; Markov process; Network packet; Queue; Set (abstract data type); Real-time computing; Algorithm; Moment (physics); Computer network; Mathematics; Statistics; Physics","score_opus":0.023903976114826003,"score_gpt":0.2016830580698071,"score_spread":0.1777790819549811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106281268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506509,0.00024408549,0.04720669,0.00012891972,0.000018702825,0.000011100541,0.0000498821,0.00019474412,0.0014950573],"genre_scores_gemma":[0.9986559,0.000046733483,0.001087493,0.000008695999,0.000005304435,0.0000027056976,0.000018115206,0.000008792585,0.00016620319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951315,0.00013216931,0.000015019376,0.000050263938,0.0001706709,0.00011872272],"domain_scores_gemma":[0.9974202,0.0017175305,0.0002899765,0.0001339753,0.0003406896,0.00009767569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413138,0.00047023976,0.0003190378,0.00042360826,0.00031191474,0.0008611488,0.00039562193,0.00032637792,0.0010711143],"category_scores_gemma":[0.0032155626,0.00014178346,0.00019130777,0.00035760264,0.0004584145,0.0006396235,0.00046013237,0.00037035323,0.00007285524],"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.0010527247,0.00010740155,0.0076057604,0.00008188418,0.00007798941,0.000261461,0.00018229868,0.9199519,0.04064228,0.0061914613,0.00054639636,0.02329846],"study_design_scores_gemma":[0.000008249964,0.000096289965,0.00096276746,0.0000024635447,0.000011467954,0.000021820915,0.000017116623,0.9943376,0.0037573297,0.00073454704,0.000046357636,0.000004039679],"about_ca_topic_score_codex":0.0022320908,"about_ca_topic_score_gemma":0.0009731784,"teacher_disagreement_score":0.0022320908,"about_ca_system_score_codex":0.0010112441,"about_ca_system_score_gemma":0.0005351928,"threshold_uncertainty_score":0.0073370934},"labels":[],"label_agreement":null},{"id":"W2106537325","doi":"10.1109/icc.2004.1312866","title":"Credit-based fair scheduling for input-queued switches","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McMaster University","funders":"","keywords":"Weighted fair queueing; Computer science; Computer network; Proportionally fair; Scheduling (production processes); Queueing theory; Crossbar switch; Fair queuing; Granularity; Internet traffic; Distributed computing; The Internet; Quality of service; Round-robin scheduling; Fair-share scheduling; Mathematical optimization; Operating system; Telecommunications","score_opus":0.023148057680241908,"score_gpt":0.25154971551499605,"score_spread":0.22840165783475413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106537325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014694964,0.00022531167,0.98151875,0.00016280118,0.00013440227,0.00007295717,0.00007485766,0.0005665761,0.0025492923],"genre_scores_gemma":[0.61639935,0.0002935379,0.37920696,0.000117906304,0.00013112719,0.00013203721,0.00017384955,0.00009697635,0.0034482488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00011742225,0.00004042392,0.00009025514,0.0002561025,0.00009635881],"domain_scores_gemma":[0.9985121,0.00057648355,0.000092334754,0.00027773366,0.00043017667,0.00011109246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013498109,0.00049745623,0.00041737367,0.0004950572,0.00084198813,0.0011693905,0.0019848703,0.00046874434,0.0027160211],"category_scores_gemma":[0.0053241965,0.00023983727,0.00026320168,0.0008104622,0.0007715961,0.001226407,0.00065603387,0.0010804922,0.00030564543],"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.0006864655,0.0002620792,0.0028239319,0.0001930339,0.000056356796,0.00019906234,0.00026161975,0.4780879,0.032606192,0.18577369,0.0077773086,0.2912724],"study_design_scores_gemma":[0.000056679135,0.00004065207,0.00015642373,0.0000072122684,0.000013338168,0.00003353823,0.0000065119766,0.95909625,0.009141017,0.027923975,0.0035106624,0.000013755636],"about_ca_topic_score_codex":0.0063963677,"about_ca_topic_score_gemma":0.005372242,"teacher_disagreement_score":0.0063963677,"about_ca_system_score_codex":0.0019903071,"about_ca_system_score_gemma":0.002543388,"threshold_uncertainty_score":0.014440715},"labels":[],"label_agreement":null},{"id":"W2106644240","doi":"10.1109/glocom.1992.276639","title":"A general unified model for performance analysis of multicast switching","year":2003,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Network packet; Scheme (mathematics); Measure (data warehouse); Computer network; Packet switching; Theoretical computer science; Data mining; Mathematics","score_opus":0.034233935578398135,"score_gpt":0.2630982690043612,"score_spread":0.22886433342596305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106644240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063340655,0.0007956583,0.97875917,0.0003673491,0.0001291825,0.000057015037,0.00015794855,0.00030317603,0.013096362],"genre_scores_gemma":[0.74016905,0.0045271064,0.21266256,0.0007142973,0.0009321063,0.0009798134,0.00068763364,0.00038437065,0.03894305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00015364443,0.00002081232,0.00007535312,0.00024334423,0.00009299226],"domain_scores_gemma":[0.9996736,0.000115334595,0.000038257363,0.000056689794,0.00009668647,0.00001946546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007756781,0.0012174724,0.0008905936,0.0009922202,0.00042650578,0.0015016433,0.0017748887,0.0015912842,0.0046299794],"category_scores_gemma":[0.0020998288,0.00037714557,0.0011084097,0.0009794417,0.00071101723,0.0021146648,0.000848468,0.001334704,0.0015095558],"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.0000315725,0.00003860041,0.00016139341,0.0000869129,0.000030170222,0.00013327872,0.000094857205,0.6307421,0.0056445063,0.35000658,0.0032514774,0.009778612],"study_design_scores_gemma":[0.000004594862,0.000016315978,0.00003495208,0.0000059911267,0.0000056601802,0.00002745166,0.0000066740686,0.95473224,0.0002134799,0.04284611,0.002100027,0.0000065284853],"about_ca_topic_score_codex":0.0025450785,"about_ca_topic_score_gemma":0.0012237588,"teacher_disagreement_score":0.0046299794,"about_ca_system_score_codex":0.0013631241,"about_ca_system_score_gemma":0.0008803319,"threshold_uncertainty_score":0.015488803},"labels":[],"label_agreement":null},{"id":"W2106668017","doi":"10.1109/ccece.2009.5090313","title":"HW/SW co-design architecture exploration for VLSI maze routing","year":2009,"lang":"en","type":"article","venue":"","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 Guelph","funders":"","keywords":"MicroBlaze; Computer science; Field-programmable gate array; Embedded system; Routing (electronic design automation); FIFO (computing and electronics); Very-large-scale integration; Computer hardware; Computer architecture; Lookup table; Operating system","score_opus":0.049432966916888116,"score_gpt":0.28149380858654366,"score_spread":0.23206084166965554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106668017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23122479,0.0008920107,0.74803555,0.00020796663,0.000044970533,0.000104541476,0.00004842898,0.0011441329,0.018297618],"genre_scores_gemma":[0.7119732,0.00028767617,0.28290856,0.000059883394,0.000014689507,0.000120959376,0.000113854374,0.00009765805,0.0044234237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998932,0.000033760567,0.000005308151,0.000010518653,0.000038502792,0.000018650297],"domain_scores_gemma":[0.99986804,0.000048260707,0.00001836927,0.000027571674,0.000030484125,0.0000072683642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019368556,0.0003481745,0.00012989649,0.00026804674,0.00017656137,0.00027424542,0.00034400471,0.00013424683,0.0031105147],"category_scores_gemma":[0.0003287052,0.00013365812,0.0002364582,0.00024104633,0.00014549849,0.00030976415,0.00020806633,0.00023324904,0.0004017942],"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.00032572314,0.00016782759,0.0026795608,0.00042268285,0.00009039056,0.0003416927,0.00019387557,0.16426538,0.21451943,0.025485037,0.0033066126,0.58820176],"study_design_scores_gemma":[0.00010343481,0.0011522399,0.0018598915,0.00004058438,0.00008657546,0.000553695,0.00009293561,0.8735358,0.08219796,0.014494032,0.02585884,0.000024126166],"about_ca_topic_score_codex":0.00032405686,"about_ca_topic_score_gemma":0.0011226326,"teacher_disagreement_score":0.0031105147,"about_ca_system_score_codex":0.00016600998,"about_ca_system_score_gemma":0.0003620174,"threshold_uncertainty_score":0.010405779},"labels":[],"label_agreement":null},{"id":"W2107123311","doi":"10.1109/iv.2007.84","title":"New Construction of Broardcast Graphs","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Interconnection Networks and 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","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Neighbourhood (mathematics); Mathematics; Wheel graph; Upper and lower bounds; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.00969365831663892,"score_gpt":0.22205340350710445,"score_spread":0.21235974519046552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107123311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03424086,0.00042703815,0.9434886,0.0007176716,0.00022302859,0.0002657687,0.00042974003,0.001176602,0.019030625],"genre_scores_gemma":[0.2535416,0.0010539619,0.7206152,0.0004364062,0.00015759988,0.0004100187,0.0014788028,0.00055873767,0.021747714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913543,0.00019556392,0.000045139208,0.00018739844,0.00030306983,0.00013338184],"domain_scores_gemma":[0.9981572,0.00055100705,0.00015569349,0.00049701665,0.0004452858,0.00019386498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068467617,0.00041171638,0.00065406144,0.0012229997,0.0014136785,0.0011049717,0.0014556291,0.00066809944,0.0050616814],"category_scores_gemma":[0.0033091733,0.0006009183,0.00071022083,0.0009964482,0.0010508116,0.0027002273,0.0017835381,0.002307381,0.0009011248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003591457,0.00017351008,0.0012619043,0.00044755946,0.00006777868,0.0003150748,0.0006970748,0.057993453,0.035556674,0.66816396,0.021930795,0.21303312],"study_design_scores_gemma":[0.00019742038,0.00028447222,0.0015895952,0.000116048046,0.000113184695,0.0006580196,0.00041808924,0.34595343,0.046559576,0.45559117,0.1484197,0.00009932327],"about_ca_topic_score_codex":0.002040343,"about_ca_topic_score_gemma":0.004278156,"teacher_disagreement_score":0.0050616814,"about_ca_system_score_codex":0.0013041775,"about_ca_system_score_gemma":0.0009729235,"threshold_uncertainty_score":0.016933024},"labels":[],"label_agreement":null},{"id":"W2107380086","doi":"10.1109/icc.1992.268157","title":"Call scheduling in multicasting packet switching","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Network packet; Multicast; Packet switching; Round-robin scheduling; Fair-share scheduling; Quality of service; Engineering","score_opus":0.021002099259584073,"score_gpt":0.2492907095033256,"score_spread":0.22828861024374153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107380086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26673585,0.002578001,0.7052433,0.00044809878,0.00020159064,0.000099663725,0.00005148619,0.0013039549,0.023338063],"genre_scores_gemma":[0.92148834,0.00066398736,0.07544554,0.000096217205,0.00009256498,0.000038071827,0.0000339154,0.00004075888,0.00210055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994869,0.000277029,0.000013149581,0.00002710648,0.0001224069,0.0000734565],"domain_scores_gemma":[0.9994918,0.00035124962,0.000030416968,0.00004474925,0.00006203327,0.000019739879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087237504,0.00020618741,0.00017958447,0.00033891434,0.0005213025,0.000650544,0.0004999716,0.0004900598,0.00093627523],"category_scores_gemma":[0.0016498215,0.00013791517,0.00014120588,0.00041938157,0.00040271244,0.0006739329,0.00024470806,0.0003602092,0.0001254437],"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.00055734895,0.0001442245,0.0018760777,0.00022976562,0.00003661308,0.0003568035,0.00039188768,0.3965507,0.062182494,0.2777384,0.004323289,0.25561234],"study_design_scores_gemma":[0.000032042055,0.00020870267,0.0005776855,0.00001689825,0.000031058153,0.00014923148,0.000057929774,0.93684715,0.019435538,0.033628855,0.00899428,0.000020650337],"about_ca_topic_score_codex":0.0014961888,"about_ca_topic_score_gemma":0.0014153725,"teacher_disagreement_score":0.0014961888,"about_ca_system_score_codex":0.0006952682,"about_ca_system_score_gemma":0.0003294032,"threshold_uncertainty_score":0.0050445795},"labels":[],"label_agreement":null},{"id":"W2107454418","doi":"10.1109/ipps.1995.395892","title":"Efficient routing and message bounds for optimal parallel algorithms","year":2002,"lang":"en","type":"article","venue":"","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":"York University","funders":"","keywords":"Computer science; Routing algorithm; Routing (electronic design automation); Parallel algorithm; Algorithm; Ranking (information retrieval); Parallel computing; Message passing; Distributed computing; Theoretical computer science; Computer network; Routing protocol; Artificial intelligence","score_opus":0.02560494294952462,"score_gpt":0.2396294557583928,"score_spread":0.2140245128088682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107454418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016738763,0.0013976126,0.9545177,0.0012250394,0.00016664411,0.00013206064,0.00017726759,0.0017045211,0.023940401],"genre_scores_gemma":[0.27615997,0.0015606609,0.7042523,0.00055620976,0.00060571043,0.0011851941,0.0008311725,0.0016352646,0.01321361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933596,0.0020555474,0.00038880578,0.0006551722,0.0026982217,0.0008426766],"domain_scores_gemma":[0.9819795,0.011587904,0.0010758281,0.0028956777,0.0020879868,0.0003730905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004074824,0.00180315,0.0013725295,0.0023899146,0.0018899451,0.005288651,0.002704383,0.0018287463,0.010629028],"category_scores_gemma":[0.033715278,0.0012161279,0.0008643286,0.0028791598,0.0025442638,0.008726076,0.004025551,0.0036775253,0.0031252734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043661112,0.0001607033,0.0004235794,0.00027212506,0.000033357886,0.0000633501,0.00017398687,0.36567816,0.0047196476,0.51501113,0.0108058145,0.10222151],"study_design_scores_gemma":[0.000071238064,0.000049285343,0.000112802576,0.000042453812,0.000021823193,0.000036351998,0.000038895556,0.66936857,0.0029772343,0.31936935,0.007894266,0.000017677765],"about_ca_topic_score_codex":0.0019354572,"about_ca_topic_score_gemma":0.00270396,"teacher_disagreement_score":0.010629028,"about_ca_system_score_codex":0.0037436862,"about_ca_system_score_gemma":0.0029679819,"threshold_uncertainty_score":0.035557628},"labels":[],"label_agreement":null},{"id":"W2107862735","doi":"10.1109/wescan.1988.27662","title":"VLSI design network communication","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":true,"ca_institutions":"Memorial University of Newfoundland; University of British Columbia; University of Saskatchewan","funders":"","keywords":"Very-large-scale integration; Corporation; Computer science; Microelectronics; Field (mathematics); Enhanced Data Rates for GSM Evolution; Engineering; Telecommunications; Electrical engineering; Embedded system; Business","score_opus":0.029973247656902388,"score_gpt":0.22870866000529458,"score_spread":0.1987354123483922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107862735","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029438925,0.017487917,0.37975585,0.0037908182,0.0046662916,0.00034650453,0.0024236285,0.0062412587,0.5823439],"genre_scores_gemma":[0.12433788,0.01963544,0.14549807,0.002664491,0.0023690476,0.00052962627,0.006171292,0.0010284934,0.69776565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994598,0.00006737088,0.000026393536,0.00007600704,0.0003081913,0.000062199],"domain_scores_gemma":[0.9995121,0.000048974518,0.000018124132,0.00007385417,0.00032093917,0.00002599212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029043123,0.0005474,0.00039321388,0.00097571017,0.0005965016,0.0018795764,0.0011515465,0.0008477754,0.06274106],"category_scores_gemma":[0.0010482416,0.00022843065,0.00021349675,0.0013235745,0.00036382675,0.0008663665,0.0005915003,0.0008147369,0.03652686],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007853329,0.000029311457,0.00024796737,0.0003931686,0.000023052422,0.00019272273,0.000102923565,0.01113891,0.013476361,0.11157983,0.39034158,0.47239557],"study_design_scores_gemma":[0.000010299677,0.000040651525,0.00012657413,0.000046301077,0.000010212363,0.00019865202,0.000021186113,0.01198605,0.0043638353,0.013699077,0.96948147,0.000015790014],"about_ca_topic_score_codex":0.004638199,"about_ca_topic_score_gemma":0.008308613,"teacher_disagreement_score":0.06274106,"about_ca_system_score_codex":0.0016696333,"about_ca_system_score_gemma":0.0010381195,"threshold_uncertainty_score":0.20988977},"labels":[],"label_agreement":null},{"id":"W2108063243","doi":"10.1002/net.20396","title":"Nonadaptive broadcasting in trees","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Upper and lower bounds; Tree (set theory); Combinatorics; Time complexity; Graph; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Computer network","score_opus":0.008583573358192428,"score_gpt":0.2169697974588081,"score_spread":0.20838622410061566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108063243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06428947,0.0032477034,0.91442215,0.00070723245,0.00017050724,0.00017308122,0.0002679635,0.0005405013,0.016181404],"genre_scores_gemma":[0.6246461,0.0060134213,0.35158274,0.00047252153,0.00040238033,0.0004265856,0.0008739632,0.0004038096,0.015178472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989116,0.00030994878,0.000067574256,0.00023523958,0.00024730817,0.00022837131],"domain_scores_gemma":[0.9941539,0.0034835583,0.00068613974,0.0009404239,0.0005313221,0.00020467809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009776349,0.0005896658,0.00089483726,0.0008044235,0.001525206,0.001885025,0.0017208019,0.0008585214,0.0041022566],"category_scores_gemma":[0.005781096,0.0004405101,0.00079051015,0.0018182823,0.0012807974,0.0045534954,0.0013745184,0.0016645256,0.0010594775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032353713,0.00017626044,0.0015161979,0.0008620592,0.00008886985,0.00043543987,0.00092841184,0.20954184,0.022793632,0.6161122,0.010998044,0.13622357],"study_design_scores_gemma":[0.00007907128,0.00027711707,0.0006106826,0.00007257533,0.00008792953,0.0006080437,0.0002550828,0.4734296,0.009019933,0.4800264,0.03549383,0.00003971611],"about_ca_topic_score_codex":0.0017964245,"about_ca_topic_score_gemma":0.0020195032,"teacher_disagreement_score":0.0041022566,"about_ca_system_score_codex":0.0012736522,"about_ca_system_score_gemma":0.00076705153,"threshold_uncertainty_score":0.013723433},"labels":[],"label_agreement":null},{"id":"W2108448045","doi":"10.1109/icc.1991.162511","title":"Fairness for broadband integrated switch architectures under backpressure mechanisms","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Interconnection; Broadband; Computer network; Service (business); Point (geometry); Selection (genetic algorithm); Broadband networks; Distributed computing; Telecommunications; Mathematics; Business; Artificial intelligence","score_opus":0.024125069202981693,"score_gpt":0.22645014456263146,"score_spread":0.20232507535964978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108448045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31277758,0.0016518219,0.6683121,0.0008833815,0.00025147037,0.0001374635,0.00008601845,0.0005200643,0.015380155],"genre_scores_gemma":[0.97098833,0.00026696714,0.025939856,0.00008317191,0.0001381522,0.0000547812,0.000026771326,0.000022435683,0.0024795535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824643,0.00060712785,0.00006264751,0.00017889915,0.0006135561,0.00029136232],"domain_scores_gemma":[0.9963658,0.0022475265,0.0002722799,0.00043104013,0.00052517175,0.00015818776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030065277,0.00028688772,0.0003796972,0.00041941635,0.0010898333,0.0021931264,0.00087239296,0.00077994226,0.0020316048],"category_scores_gemma":[0.008576358,0.00021705421,0.00027189864,0.0003993029,0.0012515093,0.0019342703,0.00096067315,0.0007817366,0.00020089687],"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.0020756805,0.00018717066,0.003348059,0.0001618858,0.00007138994,0.00037659326,0.0005895256,0.37099978,0.023084043,0.48526168,0.0028073885,0.11103681],"study_design_scores_gemma":[0.00008741107,0.00018379174,0.00096576073,0.00001760606,0.000037875587,0.00012232769,0.00004647173,0.89689034,0.0043199304,0.09489648,0.0024051908,0.00002687124],"about_ca_topic_score_codex":0.0026543038,"about_ca_topic_score_gemma":0.0016853461,"teacher_disagreement_score":0.0030065277,"about_ca_system_score_codex":0.0017586055,"about_ca_system_score_gemma":0.0016852827,"threshold_uncertainty_score":0.015900254},"labels":[],"label_agreement":null},{"id":"W2109595435","doi":"10.1007/s00453-014-9928-y","title":"An $$O(n^4)$$ O ( n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Theory of computation; Grid; Partition (number theory); Combinatorics; Vertex connectivity; Bisection; Algorithm; Bisection method; Computer science; Graph theory; Mathematics; Graph; Discrete mathematics","score_opus":0.006196863000501695,"score_gpt":0.2343314605366172,"score_spread":0.22813459753611548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109595435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038962252,0.000488289,0.9385949,0.0012049904,0.00035475136,0.00027179866,0.00080970273,0.006747813,0.012565524],"genre_scores_gemma":[0.15658706,0.00026349674,0.83197933,0.00042372808,0.00012364173,0.00050188426,0.0018259563,0.0008816962,0.0074132252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989592,0.00018258156,0.00005535136,0.0003184953,0.00030961377,0.00017477121],"domain_scores_gemma":[0.9971462,0.0013639869,0.00020521389,0.0006896698,0.00035339172,0.00024156689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011630956,0.0018557141,0.0011425469,0.0017626456,0.0010710092,0.0026308657,0.003370751,0.0015580687,0.018657466],"category_scores_gemma":[0.005906946,0.0008263888,0.0015435705,0.0023345794,0.0011307881,0.004686291,0.0035685364,0.003504942,0.0036706373],"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.0016854407,0.000708638,0.0034437529,0.0009838375,0.00036361188,0.00015031698,0.00037555833,0.16414595,0.024002057,0.07380313,0.059600115,0.6707377],"study_design_scores_gemma":[0.00060757913,0.00021559713,0.001227961,0.00007427142,0.0001397805,0.00014628182,0.00018796827,0.86522955,0.010192949,0.108798675,0.013109111,0.00007020901],"about_ca_topic_score_codex":0.005629838,"about_ca_topic_score_gemma":0.014388272,"teacher_disagreement_score":0.018657466,"about_ca_system_score_codex":0.0024726794,"about_ca_system_score_gemma":0.003573975,"threshold_uncertainty_score":0.06241548},"labels":[],"label_agreement":null},{"id":"W2109770287","doi":"10.1109/glocom.1998.775985","title":"Expansion of multiple ring MANs","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Polytechnique Montréal; Bell (Canada)","funders":"","keywords":"Computer science; Topology (electrical circuits); Heuristic; Tabu search; Ring (chemistry); Modular design; Network topology; Ring network; Star (game theory); Scheme (mathematics); Local area network; Computer network; Mathematical optimization; Distributed computing; Algorithm; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03015665781114622,"score_gpt":0.21750583026890002,"score_spread":0.18734917245775382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109770287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23903206,0.00064934604,0.7377688,0.0003718931,0.000102033795,0.00025266336,0.0001706751,0.0005275704,0.021124873],"genre_scores_gemma":[0.64549845,0.00048461015,0.34167516,0.000086339336,0.00005074655,0.0001597907,0.00016517586,0.00009284872,0.0117868595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960214,0.00014020171,0.000016570282,0.00006691568,0.00007656514,0.000097549775],"domain_scores_gemma":[0.999198,0.00032936333,0.00014198337,0.00013869617,0.00011365852,0.00007832254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081666687,0.00043545806,0.00047322485,0.00055835035,0.0005171702,0.0005896175,0.0010473302,0.00053943024,0.006339667],"category_scores_gemma":[0.0016985089,0.00028381465,0.0005715164,0.0007346621,0.00047672787,0.0017673707,0.0010547503,0.00074272614,0.00061641907],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022203091,0.00015405306,0.0011865608,0.00021184256,0.00004109404,0.0003872358,0.00015334378,0.7774607,0.01201625,0.05155748,0.0020795488,0.1545299],"study_design_scores_gemma":[0.000030379804,0.0003061704,0.00029523665,0.000026719164,0.000037738748,0.0002826867,0.00011060663,0.9580226,0.009711742,0.019880155,0.011279547,0.000016505277],"about_ca_topic_score_codex":0.00096652546,"about_ca_topic_score_gemma":0.0015308479,"teacher_disagreement_score":0.006339667,"about_ca_system_score_codex":0.00054002006,"about_ca_system_score_gemma":0.0005005899,"threshold_uncertainty_score":0.021208286},"labels":[],"label_agreement":null},{"id":"W2109901338","doi":"10.1109/bss.1997.658923","title":"Efficient multicast copy network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 British Columbia","funders":"","keywords":"Banyan; Multicast; Computer science; Computer network; Network packet; Multistage interconnection networks; Distributed computing; Routing (electronic design automation)","score_opus":0.021819993868427347,"score_gpt":0.21524330795021954,"score_spread":0.1934233140817922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109901338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048770033,0.0013340372,0.92560816,0.0003572093,0.00018675411,0.00013821908,0.000115741714,0.0017902502,0.021699578],"genre_scores_gemma":[0.6329898,0.0013469998,0.34616026,0.00026966908,0.00027234064,0.00020052512,0.0003470792,0.00019465387,0.01821861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943036,0.0001270671,0.000020165826,0.000074784075,0.00027346454,0.00007417989],"domain_scores_gemma":[0.99947613,0.00015467525,0.000037535647,0.00016910715,0.00013379249,0.000028750612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528333,0.00039564513,0.0006637764,0.0007990112,0.0008044242,0.00078343804,0.0017192143,0.00065108173,0.004296074],"category_scores_gemma":[0.0010520231,0.00022123363,0.00029802351,0.0005995964,0.0005133166,0.0024096337,0.0016330291,0.0007085196,0.0009908075],"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.00071587577,0.00024886767,0.0010003753,0.0003749295,0.00011235846,0.0005931893,0.00024059555,0.09329577,0.09484388,0.22891629,0.014607918,0.5650499],"study_design_scores_gemma":[0.00010154577,0.00043789213,0.0006000106,0.000048236096,0.000113854796,0.0014865992,0.00007844889,0.7828314,0.06359847,0.079640575,0.07098893,0.00007406235],"about_ca_topic_score_codex":0.00041990803,"about_ca_topic_score_gemma":0.0006133629,"teacher_disagreement_score":0.004296074,"about_ca_system_score_codex":0.00057268195,"about_ca_system_score_gemma":0.00041846925,"threshold_uncertainty_score":0.014371753},"labels":[],"label_agreement":null},{"id":"W2110049733","doi":"10.1109/ftdcs.1993.344147","title":"Congestion avoidance is interconnected local area networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Asynchronous communication; Network congestion; Gateway (web page); Network packet; Scheme (mathematics); Default gateway; Local area network; Backbone network; Asynchronous Transfer Mode; Internetworking; Packet loss; The Internet; Operating system; Mathematics","score_opus":0.02303623684475173,"score_gpt":0.202137824042399,"score_spread":0.17910158719764727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110049733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05096605,0.010714914,0.79022694,0.0032639569,0.0012682091,0.00048726518,0.00020915504,0.00451473,0.13834886],"genre_scores_gemma":[0.77846825,0.0075596594,0.16356565,0.0012218395,0.0010270454,0.00045554244,0.00044306644,0.00034376248,0.04691521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946207,0.000116452335,0.000022487537,0.000083242194,0.0002473097,0.00006839765],"domain_scores_gemma":[0.99957055,0.00010931642,0.00005680409,0.00008836847,0.00014592247,0.000028918932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473302,0.00044571864,0.00033342018,0.0006913231,0.0005199106,0.0013993698,0.0007821547,0.0005736393,0.0050565545],"category_scores_gemma":[0.0017034659,0.00019437821,0.00019374114,0.00090365036,0.00080581824,0.0018879097,0.0008360262,0.0007390618,0.001016939],"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.00024391057,0.00014477073,0.0010777296,0.00052024133,0.00009944862,0.00055576774,0.00043073267,0.048047833,0.032517962,0.49330094,0.036420655,0.38663995],"study_design_scores_gemma":[0.00013378117,0.0003629786,0.001363829,0.0002083139,0.00015460068,0.001082841,0.000235769,0.22080989,0.025416473,0.32167873,0.42846724,0.00008553181],"about_ca_topic_score_codex":0.00090728386,"about_ca_topic_score_gemma":0.0008696297,"teacher_disagreement_score":0.0050565545,"about_ca_system_score_codex":0.00060506596,"about_ca_system_score_gemma":0.0005220521,"threshold_uncertainty_score":0.016915858},"labels":[],"label_agreement":null},{"id":"W2110346975","doi":"10.1109/icpads.2009.16","title":"Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Computer science; Prefix; Algorithm; Butterfly graph; Circle graph; Graph; Combinatorics; Theoretical computer science; Line graph; Voltage graph; Mathematics","score_opus":0.02552053463220725,"score_gpt":0.24122073121736923,"score_spread":0.21570019658516199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110346975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06344312,0.0007512446,0.91045636,0.0006524176,0.00013668115,0.00013214644,0.0003059141,0.0016791822,0.022442864],"genre_scores_gemma":[0.25595617,0.0010980107,0.7269587,0.00021791177,0.00018596974,0.00018739222,0.00086704624,0.00032087427,0.0142079815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933773,0.00014019471,0.00004204566,0.0001419554,0.00023431156,0.00010366068],"domain_scores_gemma":[0.9992513,0.00027731335,0.00009268941,0.00018770155,0.00013374262,0.000057164776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251832,0.0005950505,0.0006544976,0.0010675184,0.0012331106,0.0013355858,0.0011000119,0.00068649,0.004231499],"category_scores_gemma":[0.002191587,0.0003282236,0.00046526184,0.0030434174,0.0010464396,0.0030913136,0.0011690897,0.0011809934,0.00087307976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024970117,0.00017675757,0.0007236186,0.00022422924,0.000040995823,0.000120179204,0.00018270069,0.105936535,0.013763738,0.44521526,0.011923559,0.42144284],"study_design_scores_gemma":[0.00008182619,0.00016948459,0.0005556735,0.000026895907,0.000064681335,0.0004329794,0.0001180809,0.4004188,0.017967423,0.5548192,0.025299793,0.00004509297],"about_ca_topic_score_codex":0.0026528703,"about_ca_topic_score_gemma":0.0040869555,"teacher_disagreement_score":0.004231499,"about_ca_system_score_codex":0.001331949,"about_ca_system_score_gemma":0.0014768626,"threshold_uncertainty_score":0.014155805},"labels":[],"label_agreement":null},{"id":"W2110678168","doi":"10.1145/1531542.1531658","title":"Reliability aware NoC router architecture using input channel buffer sharing","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Router; Virtual channel; Network on a chip; Computer science; Computer network; Network packet; Latency (audio); Transpose; One-armed router; Reliability (semiconductor); Channel (broadcasting)","score_opus":0.02365788082643522,"score_gpt":0.25449822329992494,"score_spread":0.23084034247348972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110678168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20157644,0.0013317402,0.7860885,0.00025040278,0.0002054938,0.000083870334,0.000105293424,0.0050434507,0.0053146607],"genre_scores_gemma":[0.8860819,0.00022230804,0.11174471,0.00006992538,0.000045850575,0.00005209612,0.00008550768,0.000043424527,0.0016542933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.00006189688,0.000022263908,0.00006373952,0.00008868924,0.00005144799],"domain_scores_gemma":[0.9994236,0.00009884318,0.000082401064,0.00010905473,0.00024825416,0.000037744023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003826917,0.00039971538,0.0003788343,0.00046970215,0.0003039145,0.000651231,0.001550021,0.00035503207,0.000874005],"category_scores_gemma":[0.0007742237,0.00020799847,0.000233995,0.00032642894,0.0002791806,0.0006735101,0.0004511749,0.00040403346,0.00014385766],"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.000602089,0.00020312106,0.003673576,0.00041489545,0.00018009341,0.00043403587,0.00020126457,0.37691703,0.34787193,0.030316075,0.0042098723,0.23497607],"study_design_scores_gemma":[0.00003806709,0.0002677707,0.00065527135,0.000010883982,0.000094618365,0.00017604914,0.000016054586,0.92330176,0.070463076,0.0019105318,0.003032206,0.000033829812],"about_ca_topic_score_codex":0.0013459271,"about_ca_topic_score_gemma":0.0021576036,"teacher_disagreement_score":0.001550021,"about_ca_system_score_codex":0.00052160444,"about_ca_system_score_gemma":0.0007291353,"threshold_uncertainty_score":0.0037844777},"labels":[],"label_agreement":null},{"id":"W2111106757","doi":"10.1016/j.dam.2008.01.014","title":"On routing in VLSI design and communication networks","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Very-large-scale integration; Routing (electronic design automation); Mathematics; Theoretical computer science; Arithmetic; Computer network; Computer science; Embedded system","score_opus":0.02662654992573895,"score_gpt":0.23293808351134665,"score_spread":0.2063115335856077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111106757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104724765,0.059009906,0.8542865,0.009132946,0.005340713,0.00009945143,0.00019494664,0.00032094528,0.061142158],"genre_scores_gemma":[0.34055787,0.1555443,0.3831294,0.0059934226,0.012231221,0.00061155064,0.0009500451,0.0009205712,0.10006162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860245,0.0005753408,0.00008673029,0.00019151335,0.000424611,0.00011932844],"domain_scores_gemma":[0.9979201,0.0014066761,0.00010892037,0.00026716036,0.00023228856,0.00006474963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015899453,0.0016165745,0.0015566546,0.0014840453,0.0007949788,0.0024143402,0.001710216,0.0022183615,0.0065669646],"category_scores_gemma":[0.0059593534,0.0007063931,0.00075519795,0.0031899924,0.002708235,0.005311933,0.0018221108,0.002858648,0.0017183495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062234285,0.000043926317,0.00022402284,0.00048988557,0.00004115527,0.0000897978,0.00015396098,0.040712006,0.001422611,0.82220054,0.01888852,0.11567143],"study_design_scores_gemma":[0.000021165293,0.000043251788,0.00017475162,0.00013322693,0.000034883757,0.00011758973,0.000053891206,0.07121565,0.00061037135,0.86855954,0.05901989,0.000015718184],"about_ca_topic_score_codex":0.0009916382,"about_ca_topic_score_gemma":0.0012079087,"teacher_disagreement_score":0.0065669646,"about_ca_system_score_codex":0.0014353455,"about_ca_system_score_gemma":0.00076668354,"threshold_uncertainty_score":0.021968722},"labels":[],"label_agreement":null},{"id":"W2111219592","doi":"10.1002/cta.662","title":"Improving Networks‐on‐Chip performability: A topology‐based approach","year":2010,"lang":"en","type":"article","venue":"International Journal of Circuit Theory and Applications","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 Victoria","funders":"","keywords":"Computer science; Network topology; Metric (unit); Topology (electrical circuits); Performance metric; Logical topology; Power (physics); Embedded system; Computer network; Engineering","score_opus":0.011557751830115327,"score_gpt":0.24697893822642666,"score_spread":0.23542118639631135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111219592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06701885,0.00061923516,0.9265814,0.00026666216,0.000026945667,0.000096541895,0.00009667042,0.00046339314,0.004830286],"genre_scores_gemma":[0.8333982,0.00052866986,0.1642209,0.00005317474,0.000031289976,0.00018731583,0.00015280662,0.000117811425,0.0013097713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987631,0.00056498306,0.00005419434,0.000098381315,0.0004355371,0.00008387495],"domain_scores_gemma":[0.9980217,0.0008219368,0.0003655938,0.00034851188,0.0003793574,0.000062803636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518779,0.001197603,0.0006587749,0.0021213626,0.00034826147,0.0011249899,0.0011350326,0.00079855794,0.0012887365],"category_scores_gemma":[0.004059062,0.0003776435,0.00078044744,0.0010590925,0.000729069,0.0021020782,0.00091794645,0.00058830844,0.0002037902],"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.000035725156,0.000042714335,0.0006386565,0.00005453377,0.00003796357,0.00003530811,0.000022144146,0.9546865,0.0058171717,0.00827979,0.00020577632,0.030143667],"study_design_scores_gemma":[0.000008269877,0.000081845006,0.00037275717,0.000011414498,0.000022100545,0.000042066764,0.000013233222,0.98830205,0.0037882032,0.006615047,0.00073460606,0.000008352451],"about_ca_topic_score_codex":0.001274393,"about_ca_topic_score_gemma":0.0014792546,"teacher_disagreement_score":0.0021213626,"about_ca_system_score_codex":0.0012424783,"about_ca_system_score_gemma":0.0008178054,"threshold_uncertainty_score":0.009014845},"labels":[],"label_agreement":null},{"id":"W2111327755","doi":"10.1109/newcas.2006.250953","title":"Implementation of a Configurable Crossbar Switch for Prototyping of Single-Chip Multiprocessors","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossbar switch; Computer science; Parallel computing; VHDL; Router; Embedded system; Interconnection; Arbiter; Overhead (engineering); Logic synthesis; Computer architecture; Multiprocessing; System on a chip; Computer hardware; Logic gate; Field-programmable gate array; Computer network; Operating system; Telecommunications","score_opus":0.0213754101620404,"score_gpt":0.27769260240866417,"score_spread":0.25631719224662375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111327755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29538038,0.00027545248,0.6861979,0.00014122589,0.00017109122,0.00029595086,0.00014069783,0.0049063712,0.012490937],"genre_scores_gemma":[0.7061387,0.00013143064,0.2907229,0.00004416058,0.00001649531,0.0001652648,0.00014628112,0.00019314082,0.002441587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962115,0.00008420286,0.000028952962,0.00006137074,0.00014203685,0.000062220955],"domain_scores_gemma":[0.9993994,0.00018591456,0.000076139775,0.00015508285,0.0001224173,0.000060930524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040152465,0.0004621472,0.00024433903,0.0004317027,0.0002882979,0.0005620666,0.0013953827,0.0003607929,0.0036208646],"category_scores_gemma":[0.00096521084,0.00029535897,0.00025777947,0.00023021678,0.0002467306,0.00048373008,0.00034660817,0.00042735573,0.0004346587],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00055175606,0.00027321733,0.0026492665,0.00039331988,0.00007567951,0.0015487957,0.00046436538,0.1350106,0.6137822,0.01681773,0.002446203,0.22598688],"study_design_scores_gemma":[0.0001574981,0.0014247772,0.0028934525,0.00005748514,0.00006741936,0.0011220106,0.00013114519,0.39737022,0.5680102,0.0030522384,0.025631307,0.00008221897],"about_ca_topic_score_codex":0.00045084878,"about_ca_topic_score_gemma":0.000635836,"teacher_disagreement_score":0.0036208646,"about_ca_system_score_codex":0.0003453161,"about_ca_system_score_gemma":0.0004204371,"threshold_uncertainty_score":0.012112975},"labels":[],"label_agreement":null},{"id":"W2111720816","doi":"10.1109/pacrim.2009.5291299","title":"Characterization of single-port and multi-port collective communication operations on the Cell BE processor","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Thread (computing); Copying; Message passing; Latency (audio); Computer network; Computer architecture; Distributed computing; Embedded system; Operating system; Telecommunications","score_opus":0.03724277747105838,"score_gpt":0.24545660564803293,"score_spread":0.20821382817697454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111720816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900181,0.00007523439,0.007601786,0.00003582442,0.0000072080475,0.000010663629,0.000028853454,0.00010401711,0.0021181703],"genre_scores_gemma":[0.9975145,0.000028039829,0.0018411063,0.0000052911005,0.0000019110973,0.000015556692,0.000041427065,0.0000106228745,0.0005416486],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985564,0.000016415886,0.0000061288006,0.000019708346,0.0000626115,0.000039558985],"domain_scores_gemma":[0.9992223,0.0003433822,0.000108639695,0.000113318194,0.00014113534,0.00007124188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017161998,0.00019041405,0.00023875944,0.0003233403,0.00032967338,0.00043021166,0.0003492198,0.00026288794,0.0013446594],"category_scores_gemma":[0.0010927244,0.000086282984,0.00009590459,0.0003720112,0.00035125017,0.000448206,0.00016059651,0.00024334468,0.00013771081],"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.0017600678,0.0005929218,0.018676126,0.00017234204,0.000039835006,0.0008823163,0.0006328843,0.18895558,0.728167,0.025584415,0.0012451849,0.033291362],"study_design_scores_gemma":[0.000046398047,0.0006030436,0.009584655,0.000005107493,0.000021283942,0.00020265508,0.0001924753,0.7047277,0.28085145,0.0020673873,0.0016747905,0.000023043913],"about_ca_topic_score_codex":0.00092912285,"about_ca_topic_score_gemma":0.0007637073,"teacher_disagreement_score":0.0013446594,"about_ca_system_score_codex":0.00031473156,"about_ca_system_score_gemma":0.00029598788,"threshold_uncertainty_score":0.004498303},"labels":[],"label_agreement":null},{"id":"W2113075285","doi":"10.1109/icpp.1997.622653","title":"Performance and configuration of hierarchical ring networks for multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Queueing theory; Parallel computing; Ring (chemistry); CPU cache; Cache; Interconnection; Queue; Memory hierarchy; Distributed computing; Computer network","score_opus":0.022465954307461924,"score_gpt":0.22661245293907253,"score_spread":0.2041464986316106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113075285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89747113,0.00073411374,0.09487404,0.00014879774,0.0000331234,0.000053969456,0.00013293189,0.0009157093,0.0056361714],"genre_scores_gemma":[0.9907969,0.00007750354,0.008544217,0.000009464059,0.000004931334,0.000012975173,0.0000686642,0.000017182887,0.00046806966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933404,0.00028907336,0.000025815345,0.00009043516,0.0001305442,0.00012995518],"domain_scores_gemma":[0.99836224,0.0007652726,0.00019126579,0.00030249613,0.00026866974,0.00011005867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014393007,0.000283305,0.0002641152,0.0003807133,0.0003569683,0.0005530825,0.0008743581,0.0004123938,0.0014775067],"category_scores_gemma":[0.00490296,0.00020981427,0.00017084525,0.0003254268,0.00037740165,0.0011275413,0.00044807955,0.00022085974,0.0002821196],"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.00042258133,0.000098773904,0.0039212788,0.00005644496,0.000020738342,0.000069731,0.000076912285,0.951911,0.013236255,0.008960473,0.00090935495,0.020316457],"study_design_scores_gemma":[0.000017422119,0.0001482423,0.00097556174,0.000004249107,0.000008473084,0.0000373572,0.000024432857,0.9929066,0.003640183,0.0018351593,0.00039349214,0.000008913117],"about_ca_topic_score_codex":0.0019974208,"about_ca_topic_score_gemma":0.0016767835,"teacher_disagreement_score":0.0019974208,"about_ca_system_score_codex":0.0010400926,"about_ca_system_score_gemma":0.0004210867,"threshold_uncertainty_score":0.0076118708},"labels":[],"label_agreement":null},{"id":"W2113143036","doi":"10.1093/comjnl/bxs136","title":"Design Automation Framework for Reconfigurable Interconnection Networks","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","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":"Wilfrid Laurier University","funders":"","keywords":"Interconnection; Automation; Library science; Computer science; Media studies; Telecommunications; Sociology; Engineering","score_opus":0.043824665053283585,"score_gpt":0.2694400138377506,"score_spread":0.22561534878446704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113143036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014446961,0.00020326098,0.9908626,0.000075004646,0.000026054648,0.00008646709,0.00008612802,0.0010247345,0.006191113],"genre_scores_gemma":[0.064541176,0.00071549363,0.9272189,0.00010506524,0.00003847261,0.00057981274,0.00048948254,0.00025370286,0.006057844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.00020627349,0.000059629885,0.000105197556,0.00035332117,0.00009300258],"domain_scores_gemma":[0.9996927,0.000110052206,0.000035611563,0.00007237292,0.00007635068,0.000012875237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119888,0.00097319833,0.00050162117,0.0007475723,0.00045618822,0.001268649,0.0013741226,0.0006051995,0.0044818125],"category_scores_gemma":[0.0009686522,0.00047026508,0.0012297531,0.0005634798,0.0006574165,0.00077641953,0.0006621813,0.0012680775,0.0013829772],"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.00004514509,0.000052321197,0.00023754526,0.0004176658,0.00005245319,0.0004117923,0.00021490954,0.29878223,0.016866082,0.52633697,0.0057237195,0.15085913],"study_design_scores_gemma":[0.00008620513,0.00014195863,0.0001994492,0.0001745325,0.00005929828,0.00037318526,0.00006135672,0.62942487,0.01507194,0.16736266,0.18700454,0.000039932394],"about_ca_topic_score_codex":0.0021317138,"about_ca_topic_score_gemma":0.003177695,"teacher_disagreement_score":0.0044818125,"about_ca_system_score_codex":0.0010262649,"about_ca_system_score_gemma":0.0012405219,"threshold_uncertainty_score":0.014993191},"labels":[],"label_agreement":null},{"id":"W2113182920","doi":"10.1109/tvlsi.2008.2001427","title":"Programmable Logic Core Enhancements for High-Speed On-Chip Interfaces","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","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 British Columbia","funders":"","keywords":"Programmable logic device; Reconfigurability; Computer science; Simple programmable logic device; Programmable logic array; Debugging; Embedded system; Logic family; Logic synthesis; Macrocell array; Complex programmable logic device; Programmable Array Logic; System on a chip; Overhead (engineering); Erasable programmable logic device; Computer architecture; Logic gate","score_opus":0.03172584739497335,"score_gpt":0.27498772279995876,"score_spread":0.2432618754049854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113182920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6871398,0.0012453313,0.2874858,0.0003295026,0.00022880816,0.00019451724,0.00007491231,0.0028844618,0.020416869],"genre_scores_gemma":[0.83379334,0.00026559547,0.16108829,0.00020101096,0.000055256136,0.000055528883,0.00010916806,0.000119203556,0.0043126335],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996105,0.000084305604,0.00002663598,0.000038581504,0.00015700077,0.000082868544],"domain_scores_gemma":[0.9993413,0.00016621339,0.000104210085,0.00016932476,0.00018502964,0.000033828506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040677915,0.0003985091,0.00014998621,0.00022204722,0.0001293139,0.00042616017,0.0007057882,0.000254169,0.0038696264],"category_scores_gemma":[0.0013820891,0.00015092087,0.00023188598,0.00022891226,0.00015836477,0.0010146603,0.000289852,0.0004781133,0.0004284267],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0011708036,0.00041638734,0.0032487605,0.00040929022,0.000062813786,0.00047580825,0.00011886758,0.026473518,0.620253,0.021499673,0.004393286,0.32147774],"study_design_scores_gemma":[0.00028826177,0.0025659115,0.004990378,0.000043930693,0.00016207759,0.0009282031,0.000052697986,0.2901811,0.65171033,0.0056872675,0.043347996,0.000041936437],"about_ca_topic_score_codex":0.00024921447,"about_ca_topic_score_gemma":0.00073450815,"teacher_disagreement_score":0.0038696264,"about_ca_system_score_codex":0.00029646434,"about_ca_system_score_gemma":0.00027765852,"threshold_uncertainty_score":0.012945175},"labels":[],"label_agreement":null},{"id":"W2113298137","doi":"10.1109/icc.2008.1063","title":"Performance Modeling of a Reconfigurable Shared Buffer for High-Speed Switch/Router","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Router; Network packet; Dram; Buffer (optical fiber); Computer network; Circular buffer; Static random-access memory; Port (circuit theory); Shared resource; Computer hardware; Operating system; Electronic engineering; Engineering","score_opus":0.04283657146406072,"score_gpt":0.22581251569499045,"score_spread":0.18297594423092972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113298137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51805395,0.00091283885,0.44644743,0.0006065672,0.00008066326,0.000112898655,0.0003064997,0.0012469962,0.032232158],"genre_scores_gemma":[0.99097353,0.0001238992,0.0063110297,0.000025163608,0.000008094627,0.000030439696,0.000029842795,0.000020268584,0.0024775502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974424,0.0000649404,0.000008472204,0.00004607512,0.00006533524,0.000070989416],"domain_scores_gemma":[0.9996785,0.00010795316,0.00006888902,0.0000332908,0.00008327539,0.000028133078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030481693,0.0005636995,0.0004196677,0.00040638808,0.0004535059,0.0008944081,0.0013772472,0.0010237894,0.0027609605],"category_scores_gemma":[0.00086543325,0.00027457217,0.00049472327,0.00038325947,0.0005187538,0.00091771164,0.00036390894,0.00040349696,0.00037085987],"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.000066576584,0.000023446457,0.00040661352,0.000014542876,0.000010960006,0.000073874544,0.000030785974,0.9877121,0.0049747806,0.004433191,0.00020324558,0.0020500275],"study_design_scores_gemma":[0.000002791599,0.000009698499,0.000042830852,9.4171776e-7,0.0000028010204,0.000008092988,0.000003415866,0.99916744,0.00051078724,0.00019604823,0.000053695294,0.0000015784075],"about_ca_topic_score_codex":0.009922075,"about_ca_topic_score_gemma":0.003555701,"teacher_disagreement_score":0.009922075,"about_ca_system_score_codex":0.0016480514,"about_ca_system_score_gemma":0.0009865706,"threshold_uncertainty_score":0.01972866},"labels":[],"label_agreement":null},{"id":"W2113337910","doi":"10.1109/glocom.1993.318258","title":"The closed loop bridged shuffle-exchange network: a high performance self-routing ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Canada; Australian Government","keywords":"Interconnection; Routing (electronic design automation); Computer science; Set (abstract data type); Computer network; Ideal (ethics); Multistage interconnection networks; Limit (mathematics); Routing algorithm; Topology (electrical circuits); Asynchronous Transfer Mode; Architecture; Banyan; Throughput; Routing protocol; Mathematics; Combinatorics; Telecommunications","score_opus":0.018380488488760793,"score_gpt":0.20243141359069852,"score_spread":0.18405092510193774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113337910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50145626,0.0013549579,0.46065006,0.00041815182,0.00030041081,0.00016708879,0.00039134518,0.0031925298,0.03206911],"genre_scores_gemma":[0.9117071,0.00027748922,0.07733739,0.00013860158,0.00006343567,0.000061199586,0.0003358942,0.00004529753,0.01003354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998977,0.000027086475,0.0000042055885,0.00002215789,0.00003343713,0.000015314225],"domain_scores_gemma":[0.9998765,0.000026947722,0.000011880026,0.000018272125,0.000037893737,0.000028432514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018224076,0.00012757938,0.00015086806,0.00035493917,0.00033283202,0.0004468807,0.0006451913,0.0003548972,0.0025113237],"category_scores_gemma":[0.00027849895,0.00007802936,0.00009008501,0.00033692148,0.0003277277,0.0007684515,0.00038815435,0.00018468892,0.00041421226],"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.0022573848,0.00047498086,0.0040051294,0.0002435613,0.00006260411,0.0009026732,0.00017959169,0.06393974,0.37940282,0.10868769,0.015309287,0.42453453],"study_design_scores_gemma":[0.00032013704,0.0016265251,0.0053224904,0.000026771253,0.00007325547,0.0021039569,0.000067400295,0.731978,0.14875941,0.041738078,0.06790288,0.00008104783],"about_ca_topic_score_codex":0.0004343909,"about_ca_topic_score_gemma":0.0005531563,"teacher_disagreement_score":0.0025113237,"about_ca_system_score_codex":0.00027134962,"about_ca_system_score_gemma":0.00027942823,"threshold_uncertainty_score":0.008401215},"labels":[],"label_agreement":null},{"id":"W2113634042","doi":"10.1007/s10878-012-9590-8","title":"The edge-centered surface area of the arrangement graph","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Surface (topology); Interconnection; Edge cover; Graph; Theory of computation; Mathematics; Combinatorics; Edge contraction; Geometry; Computer science; Line graph; Voltage graph; Algorithm; Telecommunications","score_opus":0.011125182015517042,"score_gpt":0.2056278399757366,"score_spread":0.19450265796021957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113634042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.715075,0.0012956492,0.16929796,0.0011662283,0.0002775666,0.00006723018,0.0010473413,0.00049441674,0.11127862],"genre_scores_gemma":[0.97683185,0.0005390311,0.012259688,0.0000962637,0.00028737634,0.00005434051,0.00035463998,0.00013446265,0.009442403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979144,0.000059716604,0.000006527427,0.000051229552,0.00006235822,0.000028733692],"domain_scores_gemma":[0.9991374,0.00034714918,0.00012805132,0.000056753273,0.00021726392,0.00011338434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023430331,0.00040156543,0.00047207464,0.0014243299,0.00042611422,0.0011553273,0.00074576674,0.0006957975,0.008956203],"category_scores_gemma":[0.0017033531,0.00020642563,0.00019768387,0.00078856305,0.00076149305,0.0014267816,0.0006196092,0.00046850066,0.0011812616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028088895,0.00009246936,0.0040295646,0.00021323,0.000057637782,0.0002723217,0.00028020938,0.053279,0.024907002,0.8092096,0.01028351,0.09709449],"study_design_scores_gemma":[0.000035756762,0.00015809698,0.009379622,0.00004668954,0.000036784408,0.0008146891,0.00026562682,0.2667296,0.005199937,0.7034097,0.013867146,0.000056353154],"about_ca_topic_score_codex":0.00033142994,"about_ca_topic_score_gemma":0.00032421044,"teacher_disagreement_score":0.008956203,"about_ca_system_score_codex":0.000282235,"about_ca_system_score_gemma":0.0002028405,"threshold_uncertainty_score":0.029961467},"labels":[],"label_agreement":null},{"id":"W2113683092","doi":"10.1109/iscas.2008.4542037","title":"Improving the scalability of checkpoint recovery for networks-on-chip","year":2008,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Latency (audio); Synchronization (alternating current); Protocol (science); Computer network; Reduction (mathematics); Distributed computing; Embedded system; Operating system; Telecommunications","score_opus":0.026640830296228664,"score_gpt":0.2262771087078155,"score_spread":0.19963627841158685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113683092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16166973,0.0035360416,0.8216175,0.0008419365,0.00016318087,0.00017081275,0.00008507985,0.0047326377,0.0071829893],"genre_scores_gemma":[0.867428,0.0012195966,0.12794901,0.00009619203,0.00010045426,0.00016595941,0.000160178,0.00024885676,0.0026318564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992873,0.0001360305,0.000038399106,0.00007696535,0.00034491403,0.000116492614],"domain_scores_gemma":[0.99825794,0.0007686532,0.000096078256,0.0003358553,0.00047755652,0.00006401839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007348323,0.00064803165,0.00056976965,0.00074479973,0.0005963589,0.00048397266,0.0010629457,0.00046420022,0.0022546945],"category_scores_gemma":[0.0033348459,0.00017950588,0.00029475923,0.0005445023,0.00045729545,0.0016054078,0.001009534,0.0009630045,0.00037971308],"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.0005351971,0.0003214987,0.002496425,0.0006039765,0.00010363175,0.00034185633,0.0003017454,0.24894345,0.28063723,0.018321328,0.0059195375,0.44147414],"study_design_scores_gemma":[0.00008138538,0.00034878406,0.0012638019,0.000048277765,0.00008288347,0.0002272158,0.00015287813,0.8730379,0.11158358,0.006128623,0.007001691,0.000043022344],"about_ca_topic_score_codex":0.0017204767,"about_ca_topic_score_gemma":0.0018382794,"teacher_disagreement_score":0.0022546945,"about_ca_system_score_codex":0.00057803694,"about_ca_system_score_gemma":0.00085359375,"threshold_uncertainty_score":0.0075427294},"labels":[],"label_agreement":null},{"id":"W2114138625","doi":"10.1145/1629911.1630068","title":"Serial reconfigurable mismatch-tolerant clock distribution","year":2009,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Digital clock manager; Clock skew; Clock domain crossing; Timing failure; CPU multiplier; Clock network; Computer science; Flexibility (engineering); Skew; Modular design; Process (computing); Routing (electronic design automation); Static timing analysis; Embedded system; Synchronous circuit; Clock gating; Debugging; Clock signal; Telecommunications; Jitter; Operating system","score_opus":0.011025411997833103,"score_gpt":0.218542285817184,"score_spread":0.20751687381935088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114138625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44238982,0.0004541167,0.52828014,0.0003728568,0.00030991941,0.00008290445,0.00039269167,0.004148019,0.023569532],"genre_scores_gemma":[0.9307246,0.000107483684,0.060478512,0.00013697408,0.00004981961,0.000028414446,0.00021009032,0.00017088091,0.008093187],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998209,0.000020297137,0.000011575288,0.000058589394,0.00005934202,0.00002933743],"domain_scores_gemma":[0.999665,0.000032893407,0.00009416559,0.00011145039,0.00007113871,0.000025360403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001316324,0.00032194625,0.00015941303,0.00034360893,0.00029604882,0.00041174958,0.0008513774,0.00018684827,0.002982819],"category_scores_gemma":[0.00041754916,0.00012476752,0.00009441038,0.00046461212,0.00023080625,0.0004552167,0.00047322238,0.00024558645,0.0006853405],"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.00084536325,0.00018465072,0.003704613,0.00012100536,0.000030802632,0.00036547563,0.00013339386,0.062506825,0.69770557,0.015735224,0.0049973726,0.21366973],"study_design_scores_gemma":[0.00013952666,0.0007842816,0.00218565,0.000016456313,0.0000428046,0.0011121697,0.00003707766,0.2760464,0.6830366,0.003352313,0.03319598,0.00005060844],"about_ca_topic_score_codex":0.0005999411,"about_ca_topic_score_gemma":0.0010779758,"teacher_disagreement_score":0.002982819,"about_ca_system_score_codex":0.00047998602,"about_ca_system_score_gemma":0.00025658068,"threshold_uncertainty_score":0.009978533},"labels":[],"label_agreement":null},{"id":"W2114181278","doi":"10.1145/1331897.1331903","title":"A Synthesizable Datapath-Oriented Embedded FPGA Fabric for Silicon Debug Applications","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Research Grants Council, University Grants Committee","keywords":"Datapath; Computer science; Computer architecture; Embedded system; Application-specific integrated circuit; Field-programmable gate array; Debugging; Benchmark (surveying); Routing (electronic design automation); Flexibility (engineering); System on a chip; Computer hardware; Operating system","score_opus":0.02411537067229806,"score_gpt":0.24105679984606193,"score_spread":0.21694142917376386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114181278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27552518,0.00069698907,0.6997405,0.0001930419,0.00018356073,0.0001585911,0.00031657945,0.006154322,0.017031161],"genre_scores_gemma":[0.6954088,0.0003247882,0.29855895,0.00008594107,0.000028747063,0.00007791714,0.00028623577,0.0002067303,0.0050218673],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99993086,0.000011425726,0.0000047366607,0.000010983823,0.000026220203,0.000015682293],"domain_scores_gemma":[0.9998765,0.00002997681,0.000023159162,0.000030810268,0.00002852181,0.000011075092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012562145,0.00030535244,0.00013845223,0.00025454804,0.00016042324,0.00032007057,0.0004603638,0.0001775246,0.0020461036],"category_scores_gemma":[0.00025565957,0.0001513672,0.00016859778,0.00016696278,0.00012330824,0.00029623826,0.00015414848,0.00025457767,0.000389261],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00041584065,0.00017341191,0.002255163,0.000457111,0.00006353615,0.00075414614,0.00012760414,0.13035268,0.61443037,0.026031518,0.0047004092,0.22023828],"study_design_scores_gemma":[0.00016341529,0.0011759261,0.0021318262,0.00007944692,0.00009973489,0.0007865868,0.000044238903,0.4933311,0.44702965,0.0050521744,0.05005975,0.000046138524],"about_ca_topic_score_codex":0.0003492719,"about_ca_topic_score_gemma":0.000755154,"teacher_disagreement_score":0.0020461036,"about_ca_system_score_codex":0.00024681765,"about_ca_system_score_gemma":0.0003127619,"threshold_uncertainty_score":0.006844938},"labels":[],"label_agreement":null},{"id":"W2114279899","doi":"10.1109/cicc.1999.777361","title":"The μPP ASIC: design, methodologies and tools for a pay phone system-on-a-chip based on an ARM core and design reuse","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"New Brunswick Innovation Foundation","keywords":"Application-specific integrated circuit; Embedded system; Reuse; Microprocessor; Microcontroller; System on a chip; ARM architecture; Computer science; Phone; Chip; Power consumption; Architecture; Computer hardware; Computer architecture; Engineering; Power (physics); Telecommunications","score_opus":0.21170524840977548,"score_gpt":0.3264259004347683,"score_spread":0.11472065202499285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114279899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025641313,0.0034003933,0.9339707,0.00038482918,0.00026940287,0.00038808942,0.00013843477,0.005903683,0.029903235],"genre_scores_gemma":[0.23868874,0.0024815113,0.71227384,0.0005955593,0.00019942557,0.0009088443,0.00053685234,0.0011502177,0.043164995],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994411,0.00012611088,0.000029672201,0.000060361803,0.00028651356,0.00005624413],"domain_scores_gemma":[0.99971133,0.000042342464,0.000038863443,0.00006321729,0.00011943611,0.00002476196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039604568,0.0005960972,0.00038047638,0.00041419629,0.00030321526,0.0012794756,0.0014486008,0.0005679395,0.0047790534],"category_scores_gemma":[0.00066146575,0.00033947523,0.00033225789,0.00045664184,0.0002922152,0.0007707433,0.00037715473,0.00069242617,0.0030891967],"study_design_candidate":"bench_or_experimental","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.00032045203,0.0002138365,0.001135008,0.0013404894,0.00018721202,0.000648951,0.0005104728,0.02718708,0.2735561,0.062755324,0.040042885,0.5921022],"study_design_scores_gemma":[0.00021859,0.00232089,0.001956656,0.00017953625,0.00035349178,0.0032977317,0.00020620547,0.14025198,0.26741228,0.0141856475,0.5695254,0.000091543916],"about_ca_topic_score_codex":0.0006229221,"about_ca_topic_score_gemma":0.0008269945,"teacher_disagreement_score":0.0047790534,"about_ca_system_score_codex":0.00054560724,"about_ca_system_score_gemma":0.0008808874,"threshold_uncertainty_score":0.015987456},"labels":[],"label_agreement":null},{"id":"W2114341006","doi":"10.1142/s0218126607004027","title":"QUEUE MODELING AND IMPLEMENTATION FOR NETWORKS-ON-CHIP ROUTERS","year":2007,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Queueing theory; Queue; Throughput; Network packet; Abstraction; Network on a chip; Chip; Embedded system; Computer network; Operating system; Telecommunications","score_opus":0.02367571815816178,"score_gpt":0.27389160012294184,"score_spread":0.25021588196478006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114341006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028150352,0.00019928483,0.99452704,0.00011941517,0.00006919734,0.000058620986,0.00007786457,0.0007864422,0.0013471156],"genre_scores_gemma":[0.24410553,0.0010528311,0.7458195,0.00026000987,0.000086554515,0.0005204057,0.00043871498,0.00036084699,0.007355644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00015732597,0.000052938114,0.000064756365,0.00020011913,0.000055919074],"domain_scores_gemma":[0.9995067,0.00016394054,0.000052338262,0.000086561806,0.00016764816,0.000022770084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595489,0.0005613699,0.0005552018,0.0004808671,0.0004190235,0.0011664085,0.0016997189,0.00095695705,0.0031480044],"category_scores_gemma":[0.0024475,0.0004216123,0.0007298593,0.0005948123,0.00029332892,0.00136147,0.0006231988,0.0013145268,0.0010376964],"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.00013323978,0.00014712897,0.00079151714,0.00019302848,0.0000607046,0.00013324727,0.00009803137,0.78134483,0.012983083,0.12781465,0.0051503186,0.07115023],"study_design_scores_gemma":[0.000012562395,0.000019565854,0.000037188678,0.0000068810386,0.000008111773,0.000010890942,0.0000044486424,0.990226,0.0015048158,0.005678644,0.002484967,0.000005957184],"about_ca_topic_score_codex":0.0066128867,"about_ca_topic_score_gemma":0.0061747567,"teacher_disagreement_score":0.0066128867,"about_ca_system_score_codex":0.0011154732,"about_ca_system_score_gemma":0.001547335,"threshold_uncertainty_score":0.013148785},"labels":[],"label_agreement":null},{"id":"W2114748893","doi":"10.1109/glocom.1993.318186","title":"Performance evaluation of a source service node architecture under random traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Ontario","keywords":"Computer science; Asynchronous Transfer Mode; Computer network; Multiplexing; Blocking (statistics); Node (physics); Service (business); Asynchronous communication; Real-time computing; Telecommunications; Engineering","score_opus":0.03461609309081163,"score_gpt":0.23583483419130002,"score_spread":0.2012187411004884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114748893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96865976,0.0001962489,0.023774829,0.00015689703,0.000037660244,0.000072219555,0.00012930145,0.0015723639,0.005400799],"genre_scores_gemma":[0.99366546,0.000054349788,0.0048982827,0.000021344196,0.000007915027,0.00001540629,0.00012807117,0.000044638586,0.0011645749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.00023747241,0.000032517823,0.0001075684,0.0002525071,0.00019642913],"domain_scores_gemma":[0.99711466,0.0011239494,0.00016932785,0.00021664302,0.0011901648,0.00018516752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096937467,0.0006450305,0.00031252464,0.00069422176,0.0004203297,0.0005853525,0.0007916673,0.00049545587,0.003937954],"category_scores_gemma":[0.0027369473,0.00013538917,0.00021034788,0.00042964504,0.00042103673,0.00069287873,0.00033746313,0.0002977114,0.00047777462],"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.0057348525,0.0007104315,0.008646833,0.0003503504,0.00014239532,0.00040372182,0.00032454164,0.7554573,0.12837568,0.0052793655,0.0044566235,0.09011797],"study_design_scores_gemma":[0.000106497515,0.0015544022,0.0017611225,0.000008388791,0.0000493951,0.00008556786,0.00006843516,0.9566866,0.03867909,0.0005372795,0.0004464589,0.000016725524],"about_ca_topic_score_codex":0.0063317954,"about_ca_topic_score_gemma":0.0043374845,"teacher_disagreement_score":0.0063317954,"about_ca_system_score_codex":0.0013359955,"about_ca_system_score_gemma":0.0006555742,"threshold_uncertainty_score":0.013173759},"labels":[],"label_agreement":null},{"id":"W2115203306","doi":"10.1109/atm.1998.675111","title":"Multipriority packet switching on the HYPER switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Quality of service; Queue; Scheme (mathematics); Asynchronous Transfer Mode; Network packet; Queueing theory; Distributed computing","score_opus":0.04633324723934579,"score_gpt":0.20750303391138528,"score_spread":0.1611697866720395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115203306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6304043,0.0019069018,0.3266776,0.0005739808,0.0004315521,0.00012711922,0.000101426784,0.0015453021,0.038231827],"genre_scores_gemma":[0.96659,0.00045224396,0.026472732,0.00012324494,0.0000920597,0.000030344174,0.000059852995,0.000031913558,0.0061475234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998596,0.000035236208,0.000007102242,0.000021582518,0.00003754704,0.0000389289],"domain_scores_gemma":[0.9996755,0.00009622185,0.000026934213,0.000088228604,0.000052495234,0.00006057142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035995894,0.00016997724,0.00016622571,0.00026343216,0.00035448518,0.00063306745,0.00038497115,0.0002005977,0.0021261496],"category_scores_gemma":[0.00075703755,0.00009382827,0.000101599995,0.00024740526,0.00034349103,0.0008546896,0.00054344424,0.00043517465,0.0002355487],"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.0009516452,0.00025338668,0.005938825,0.0001367924,0.000038210073,0.00077000307,0.0002380166,0.1501414,0.16799127,0.30802912,0.0055029043,0.36000845],"study_design_scores_gemma":[0.00006917658,0.00031786587,0.0038289581,0.000029197858,0.000046456866,0.00046686662,0.000068819274,0.8663591,0.04724882,0.05313861,0.02838758,0.00003858078],"about_ca_topic_score_codex":0.0006204226,"about_ca_topic_score_gemma":0.0010881564,"teacher_disagreement_score":0.0021261496,"about_ca_system_score_codex":0.00048106082,"about_ca_system_score_gemma":0.00040213604,"threshold_uncertainty_score":0.007112682},"labels":[],"label_agreement":null},{"id":"W2115230934","doi":"10.1109/ispa.2008.95","title":"Broadcasting in Weighted-Vertex Graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Generalization; Computer science; Computation; Vertex cover; Theoretical computer science; Feedback vertex set; Graph; Algorithm; Discrete mathematics; Mathematics; Computer network","score_opus":0.02176873663128862,"score_gpt":0.2163213212918822,"score_spread":0.19455258466059358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115230934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025659198,0.0005694356,0.96687204,0.0006327255,0.00008013241,0.00007197087,0.00030852502,0.0002699568,0.005535893],"genre_scores_gemma":[0.6437119,0.0031426763,0.33090377,0.00047143156,0.00025185876,0.00032530312,0.0014626911,0.00023445257,0.019495893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989619,0.00033973233,0.000041253254,0.0002253949,0.0002793275,0.000152346],"domain_scores_gemma":[0.9986507,0.0006844874,0.00017049193,0.00022525119,0.00018340687,0.00008559589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066922925,0.0006108688,0.0008964617,0.00086195866,0.00080871256,0.0017839576,0.0021058717,0.0010935919,0.0027228312],"category_scores_gemma":[0.0031582997,0.00038999438,0.0006222884,0.0020088234,0.0008303987,0.0045653316,0.00090642885,0.0013285428,0.0005868599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014287731,0.000051857493,0.00045173857,0.0001955227,0.000042549666,0.00019370773,0.00020380609,0.31279427,0.004609773,0.64274573,0.005641226,0.032926925],"study_design_scores_gemma":[0.000030080893,0.00003565054,0.00010215275,0.000014791507,0.00002457813,0.00011675659,0.00005206452,0.60504407,0.0011026764,0.38403597,0.009426732,0.00001457458],"about_ca_topic_score_codex":0.0049153385,"about_ca_topic_score_gemma":0.0041687475,"teacher_disagreement_score":0.0049153385,"about_ca_system_score_codex":0.002116085,"about_ca_system_score_gemma":0.0009030049,"threshold_uncertainty_score":0.015353322},"labels":[],"label_agreement":null},{"id":"W2115493560","doi":"10.1109/newcas.2008.4606373","title":"Generic crossbar network on chip for FPGA MPSoCs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Crossbar switch; PowerPC; Field-programmable gate array; Scalability; Network on a chip; Throughput; Embedded system; Computer architecture; System on a chip; Bandwidth (computing); Flexibility (engineering); Computer network; Wireless; Software; Operating system; Telecommunications","score_opus":0.045064013048226735,"score_gpt":0.247252258733367,"score_spread":0.20218824568514027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115493560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34166983,0.003531921,0.6353319,0.00017895704,0.00015162329,0.00016557009,0.0003567437,0.002299825,0.016313583],"genre_scores_gemma":[0.7963762,0.0010630101,0.19744368,0.00006844507,0.000035407793,0.00015996654,0.0004658092,0.00008871128,0.0042987727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999785,0.00006278801,0.0000091300835,0.000035270525,0.00007540556,0.000032358304],"domain_scores_gemma":[0.99980205,0.00005901701,0.000031083142,0.00005029856,0.000046960246,0.000010605949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018498978,0.0005076949,0.00026849154,0.000415199,0.00023517842,0.00037981084,0.00047294344,0.00034006912,0.0023218563],"category_scores_gemma":[0.00040191316,0.00013815933,0.00022683477,0.0005130791,0.00017224508,0.00037462503,0.00018910896,0.00029948782,0.00020973846],"study_design_candidate":"bench_or_experimental","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.0003628774,0.00012555714,0.0030047137,0.0006696422,0.000109729706,0.0006204345,0.00008740993,0.65614283,0.13042568,0.042823415,0.004740988,0.16088673],"study_design_scores_gemma":[0.000035896257,0.00038655137,0.0020803292,0.000030082163,0.00004137012,0.00040802543,0.000024547711,0.94793844,0.030597527,0.00562855,0.012804621,0.000024087567],"about_ca_topic_score_codex":0.0006507502,"about_ca_topic_score_gemma":0.0015893581,"teacher_disagreement_score":0.0023218563,"about_ca_system_score_codex":0.00048533158,"about_ca_system_score_gemma":0.00034121616,"threshold_uncertainty_score":0.007767439},"labels":[],"label_agreement":null},{"id":"W2115831076","doi":"10.1109/icc.1994.368914","title":"CAM-based single-chip shared buffer ATM switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":34,"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; Buffer (optical fiber); Shared memory; Computer hardware; Chip; Write buffer; Embedded system; Computer network; Asynchronous Transfer Mode; Asynchronous communication; Interface (matter); Parallel computing; Telecommunications","score_opus":0.04617861807959403,"score_gpt":0.21028342004876113,"score_spread":0.1641048019691671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115831076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5706323,0.005039035,0.34907928,0.0006308274,0.0016695205,0.00020929985,0.0011815465,0.009044859,0.06251338],"genre_scores_gemma":[0.9226467,0.00045691655,0.067743815,0.00016930979,0.00013195873,0.000075737786,0.00054340425,0.000046214824,0.00818594],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998,0.00002402542,0.000007596315,0.000054183958,0.000079092635,0.000034966015],"domain_scores_gemma":[0.9997781,0.000034780103,0.000023035253,0.00004285613,0.00009092097,0.000030374946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016345801,0.00027656395,0.00042492998,0.00044198817,0.00035431844,0.0007779114,0.001601414,0.0005358791,0.005941232],"category_scores_gemma":[0.00034852533,0.00014904868,0.00021833926,0.00042135734,0.0001982545,0.0008604168,0.00048425994,0.00039724508,0.0011547024],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0013780592,0.0003332039,0.003112092,0.00062894647,0.000103909966,0.00091014686,0.00014606843,0.04488886,0.52635723,0.028678326,0.02471783,0.36874536],"study_design_scores_gemma":[0.000339963,0.0018110337,0.0036265901,0.000059699825,0.00021337491,0.0017814877,0.000081132624,0.7000784,0.22111219,0.0069019874,0.06389439,0.00009968449],"about_ca_topic_score_codex":0.00088148145,"about_ca_topic_score_gemma":0.0014035458,"teacher_disagreement_score":0.005941232,"about_ca_system_score_codex":0.00040250825,"about_ca_system_score_gemma":0.000551034,"threshold_uncertainty_score":0.019875407},"labels":[],"label_agreement":null},{"id":"W2117513650","doi":"10.1145/502109.502110","title":"Packet delay in models of data networks","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"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; Brock University","funders":"","keywords":"Routing table; Computer science; Network packet; Table (database); Routing (electronic design automation); Processing delay; Network delay; End-to-end delay; Computer network; Scalability; Source routing; Routing protocol; Transmission delay; Data mining","score_opus":0.08770757930442849,"score_gpt":0.2956826076131928,"score_spread":0.20797502830876433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117513650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33259904,0.0037323255,0.6356395,0.002892235,0.00044941102,0.00023303997,0.0012111218,0.00057604123,0.022667302],"genre_scores_gemma":[0.9661973,0.0024057936,0.01975974,0.00025867773,0.0001793347,0.00023778659,0.0003187683,0.00012909778,0.010513562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994685,0.00018361256,0.000020563228,0.00010136472,0.00011958488,0.00010633949],"domain_scores_gemma":[0.99694675,0.00214024,0.0003186811,0.00014742234,0.00026854483,0.00017838446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010307742,0.0009550497,0.00083298347,0.00078246393,0.0007686463,0.0019047046,0.0014621094,0.0014108643,0.0021373772],"category_scores_gemma":[0.0074643833,0.00061118155,0.0005588812,0.001043722,0.0012702474,0.0031209057,0.0010549297,0.0010170382,0.0004054306],"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.00009627005,0.000039127994,0.00058302406,0.000058224643,0.00001935689,0.00009025503,0.00008479727,0.9178781,0.0010547375,0.077238105,0.0009006298,0.0019574384],"study_design_scores_gemma":[0.000016395523,0.000032385116,0.00007228423,0.0000056447125,0.000009879022,0.00001929103,0.000021812475,0.9739328,0.00020802347,0.024836555,0.00083641725,0.0000083576415],"about_ca_topic_score_codex":0.0057003694,"about_ca_topic_score_gemma":0.0023452144,"teacher_disagreement_score":0.0057003694,"about_ca_system_score_codex":0.0024047957,"about_ca_system_score_gemma":0.0009657471,"threshold_uncertainty_score":0.017448068},"labels":[],"label_agreement":null},{"id":"W2117584697","doi":"10.1109/ccece.2011.6030434","title":"Flexible simulation and modeling for 2D topology NoC system design","year":2011,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"SystemC; Network on a chip; Network topology; Computer science; Routing (electronic design automation); Key (lock); System on a chip; Embedded system; Computer architecture; Topology (electrical circuits); Engineering; Computer network","score_opus":0.1671424557327281,"score_gpt":0.2999062784499369,"score_spread":0.1327638227172088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117584697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041494515,0.0002757326,0.9462848,0.00020839923,0.000076926815,0.00011654005,0.00045885998,0.0009653773,0.0101188],"genre_scores_gemma":[0.6896398,0.0006901118,0.30217463,0.0001316088,0.000052909345,0.0008764064,0.00068901747,0.00027389347,0.005471694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967957,0.00012847807,0.000014297181,0.000031618296,0.000113050795,0.00003299757],"domain_scores_gemma":[0.9996216,0.00018019477,0.00003679773,0.00006650207,0.000078904806,0.000015884541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998078,0.0004691878,0.00040341346,0.00045150513,0.0003067021,0.00046479286,0.00077001797,0.0008044572,0.0024916728],"category_scores_gemma":[0.0013774696,0.00030344923,0.0006230649,0.00043821664,0.00033951193,0.00064284814,0.0005051278,0.0005265714,0.00033832132],"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.000008989687,0.000006467302,0.00020294839,0.000017096661,0.000007041123,0.000030824187,0.000018175468,0.9886834,0.0012503193,0.006389135,0.0002617154,0.0031238405],"study_design_scores_gemma":[0.0000029455662,0.0000051933434,0.00003973391,0.0000015328512,0.0000013222399,0.000006271033,0.0000019080553,0.9977348,0.00029063423,0.0011521025,0.0007617842,0.0000017669412],"about_ca_topic_score_codex":0.0033271017,"about_ca_topic_score_gemma":0.002032,"teacher_disagreement_score":0.0033271017,"about_ca_system_score_codex":0.0004929251,"about_ca_system_score_gemma":0.0005315601,"threshold_uncertainty_score":0.008335531},"labels":[],"label_agreement":null},{"id":"W2118134890","doi":"10.1109/lcn.2003.1243183","title":"An optoelectronic multi-terabit cmos switch core for local area networks","year":2004,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Terabit; Crossbar switch; CMOS; Gigabit; Computer science; Optoelectronics; Optical switch; Multiplexer; Very-large-scale integration; Electrical engineering; Electronic engineering; Physics; Multiplexing; Wavelength-division multiplexing; Engineering; Embedded system; Telecommunications","score_opus":0.03170556780234375,"score_gpt":0.2788448751900996,"score_spread":0.24713930738775586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118134890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4855352,0.0051009436,0.45927688,0.0006262739,0.00025934624,0.0003101376,0.00052729854,0.0030105843,0.04535334],"genre_scores_gemma":[0.7730324,0.0010614608,0.21221943,0.00028020973,0.00007428155,0.00008879017,0.0003524032,0.00008474906,0.012806238],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999443,0.0000067321016,0.0000031645511,0.000012765614,0.00002314753,0.000009865066],"domain_scores_gemma":[0.9999268,0.000015368292,0.00001685758,0.000008571872,0.000024532079,0.000007832508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093873015,0.00019179433,0.00010154255,0.00016077759,0.00022850298,0.00032111953,0.00037846414,0.00016652475,0.002986595],"category_scores_gemma":[0.00017049813,0.00009046878,0.00013453068,0.00016240515,0.000110946894,0.0003221787,0.00013394635,0.00017348838,0.00048394132],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00023452105,0.0000789152,0.0014547794,0.00027030625,0.000033684293,0.00019241437,0.00008024552,0.0067875227,0.75821495,0.014970414,0.003363018,0.21431918],"study_design_scores_gemma":[0.0001334709,0.001891102,0.0059817876,0.000066223016,0.0001782825,0.0015505406,0.00009704863,0.09697125,0.760345,0.005053968,0.12769468,0.000036670102],"about_ca_topic_score_codex":0.0004634658,"about_ca_topic_score_gemma":0.00159385,"teacher_disagreement_score":0.002986595,"about_ca_system_score_codex":0.0004066012,"about_ca_system_score_gemma":0.00032069764,"threshold_uncertainty_score":0.009991109},"labels":[],"label_agreement":null},{"id":"W2118345845","doi":"10.5555/982792.982935","title":"Bipartite roots of graphs","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Complete bipartite graph; Graph isomorphism; Discrete mathematics; Time complexity; Graph; Line graph","score_opus":0.010987273196709698,"score_gpt":0.24195675283213933,"score_spread":0.23096947963542963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118345845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1337395,0.0014539111,0.7986434,0.0021045452,0.0003843393,0.0006063419,0.0035432754,0.0033591588,0.056165565],"genre_scores_gemma":[0.5805346,0.0010792473,0.39058816,0.0008957904,0.00036057294,0.00042506502,0.005355821,0.00061370747,0.020147072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.000302075,0.0000816515,0.00048878556,0.0003319984,0.00020934765],"domain_scores_gemma":[0.99765885,0.0011188254,0.0002526527,0.00046920602,0.0003495653,0.00015099593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044615436,0.00054822135,0.00063515676,0.0010999318,0.00085255207,0.0016560506,0.0009256362,0.0011974318,0.008853654],"category_scores_gemma":[0.0044545075,0.0004579611,0.00062191125,0.0014220224,0.0014974267,0.0034647752,0.002095833,0.0017808125,0.002129119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029192772,0.00013212749,0.0024090356,0.0006649781,0.0000674459,0.0004680116,0.0008334397,0.019145941,0.026612809,0.77793413,0.027516777,0.1439233],"study_design_scores_gemma":[0.000050815965,0.00008692762,0.0012644463,0.00007243001,0.000027902082,0.00081080414,0.00031370722,0.054720122,0.00800672,0.87439144,0.060219757,0.000034828812],"about_ca_topic_score_codex":0.0010851936,"about_ca_topic_score_gemma":0.0013732727,"teacher_disagreement_score":0.008853654,"about_ca_system_score_codex":0.0009971746,"about_ca_system_score_gemma":0.0006399765,"threshold_uncertainty_score":0.029618382},"labels":[],"label_agreement":null},{"id":"W2118673979","doi":"10.1016/j.sysarc.2007.09.002","title":"Energy reduction through crosstalk avoidance coding in networks on chip","year":2007,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"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; Network packet; Dissipation; Embedded system; Crosstalk; Network on a chip; Signal integrity; Chip; Efficient energy use; System on a chip; Coding (social sciences); Computer hardware; Electronic engineering; Computer network; Telecommunications; Electrical engineering; Interconnection; Engineering","score_opus":0.013082455736030863,"score_gpt":0.24374451552424825,"score_spread":0.23066205978821738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118673979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39733496,0.000854428,0.57896787,0.0007530987,0.00016792944,0.00003411541,0.00011027796,0.0007502721,0.021027064],"genre_scores_gemma":[0.9526516,0.0002281355,0.041590717,0.00014553573,0.000046057416,0.000021595304,0.00006443515,0.000057239904,0.0051945266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000054425764,0.000007741552,0.000030056131,0.000075065655,0.00005649392],"domain_scores_gemma":[0.99940515,0.0003261409,0.000048304475,0.00008266377,0.000114802846,0.000023010285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021595787,0.00043162415,0.00024742223,0.00037666247,0.00040575012,0.0004259012,0.0005698742,0.000397714,0.0021228478],"category_scores_gemma":[0.0007992663,0.00014147704,0.00018815104,0.0005344735,0.00037412645,0.0006427728,0.00039221055,0.0003992751,0.00016708572],"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.0007180588,0.00034519882,0.0016751266,0.00022059817,0.00009490654,0.00027976054,0.00020207936,0.44504216,0.1977277,0.14361545,0.004157564,0.20592144],"study_design_scores_gemma":[0.000029373414,0.0001859494,0.0007193853,0.000021559617,0.000046887893,0.00014829873,0.0000455899,0.9163499,0.05050621,0.029760674,0.0021640058,0.000022131717],"about_ca_topic_score_codex":0.00096892496,"about_ca_topic_score_gemma":0.0031288604,"teacher_disagreement_score":0.0021228478,"about_ca_system_score_codex":0.00045374656,"about_ca_system_score_gemma":0.00048774527,"threshold_uncertainty_score":0.007101655},"labels":[],"label_agreement":null},{"id":"W2118812633","doi":"10.1109/aina.2008.83","title":"Near Optimal Broadcasting in Optimal Triple Loop Graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Loop (graph theory); Mathematics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.026902826697085824,"score_gpt":0.2363748432827748,"score_spread":0.20947201658568898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118812633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45086733,0.0015905225,0.5222893,0.0008804813,0.00007062792,0.00009600927,0.00047597915,0.00102137,0.02270839],"genre_scores_gemma":[0.8966409,0.0009098705,0.09828063,0.00020250982,0.00006671165,0.0000923483,0.00055323547,0.00018191925,0.003071806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920243,0.00017466294,0.00003730009,0.0001571516,0.00017198046,0.0002565345],"domain_scores_gemma":[0.9959929,0.0027749161,0.00032488292,0.0003878895,0.00029916034,0.00022016751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073687715,0.00043299538,0.00089878123,0.00068136654,0.0009969106,0.0012846012,0.00097338273,0.0006805255,0.0025653082],"category_scores_gemma":[0.0064071016,0.0004244207,0.00041250171,0.0011464008,0.0008166361,0.0026588773,0.0013199043,0.0009507005,0.00040313092],"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.0010827477,0.00019227124,0.0024933696,0.0006651275,0.00007777274,0.00042738757,0.0007809102,0.5822561,0.055785593,0.23262714,0.01290329,0.11070831],"study_design_scores_gemma":[0.00006645327,0.00015317264,0.0006909919,0.000038621558,0.00003726678,0.0002476455,0.00022160578,0.76610637,0.017570106,0.21009131,0.0047517517,0.000024735953],"about_ca_topic_score_codex":0.0022390063,"about_ca_topic_score_gemma":0.0029411232,"teacher_disagreement_score":0.0025653082,"about_ca_system_score_codex":0.0014463596,"about_ca_system_score_gemma":0.00085720164,"threshold_uncertainty_score":0.010494173},"labels":[],"label_agreement":null},{"id":"W2119420156","doi":"10.1109/icpads.2009.48","title":"Broadcasting in Fully Connected Trees","year":2009,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Vertex (graph theory); Computer network; Graph; Node (physics); Tree (set theory); Theoretical computer science; Binary logarithm; Class (philosophy); Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.013129528589562662,"score_gpt":0.23191824466894223,"score_spread":0.21878871607937958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119420156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3046932,0.00607762,0.64185494,0.0013556568,0.00017944066,0.00029084017,0.0020938094,0.0014755701,0.041978784],"genre_scores_gemma":[0.8406411,0.0028223905,0.14640291,0.00029730776,0.000112185284,0.00018296768,0.0014576741,0.00014948618,0.0079339715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995468,0.00010825883,0.000027104847,0.00010783327,0.000106078485,0.00010392659],"domain_scores_gemma":[0.9985513,0.00074872875,0.00018445276,0.00019106244,0.00024209399,0.00008227655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027150332,0.00019603697,0.0004562948,0.000541701,0.0007862853,0.0011481149,0.0006383343,0.00064890116,0.0028303487],"category_scores_gemma":[0.0027242764,0.0002928539,0.00035465826,0.001362398,0.00043313968,0.0020729671,0.000624431,0.00048805436,0.0004420065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005553106,0.00009393177,0.0017402705,0.0011667088,0.0000988798,0.00046054015,0.0008447501,0.23084469,0.027374003,0.46446425,0.022698281,0.2496584],"study_design_scores_gemma":[0.000105561616,0.0001777323,0.001276036,0.00010858342,0.000051324547,0.00065633556,0.00023816529,0.55718553,0.0072067585,0.39315486,0.039800406,0.000038745646],"about_ca_topic_score_codex":0.0028243607,"about_ca_topic_score_gemma":0.0025662442,"teacher_disagreement_score":0.0028303487,"about_ca_system_score_codex":0.0008050258,"about_ca_system_score_gemma":0.0006459136,"threshold_uncertainty_score":0.009468496},"labels":[],"label_agreement":null},{"id":"W2119476394","doi":"10.1109/tpds.2013.166","title":"Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"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 Toronto","funders":"National High-tech Research and Development Program; University of Toronto; Natural Sciences and Engineering Research Council of Canada; National University of Defense Technology; National Natural Science Foundation of China","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Distributed computing; Deadlock; Computer network; Dynamic Source Routing; Routing (electronic design automation); Link-state routing protocol; Policy-based routing; Multipath routing; Destination-Sequenced Distance Vector routing; Network packet; Routing table; Cache; Routing protocol","score_opus":0.02305488258008939,"score_gpt":0.22512577546573054,"score_spread":0.20207089288564115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119476394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0985622,0.0005958108,0.8958082,0.00016455184,0.00008831149,0.000056873352,0.00006450497,0.0011787056,0.0034807732],"genre_scores_gemma":[0.7695806,0.00023253018,0.22758196,0.0001754552,0.00006419424,0.000093373215,0.000109165165,0.000059486945,0.0021031636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.000051637016,0.000027973854,0.00006198947,0.00009537301,0.000034367436],"domain_scores_gemma":[0.9993881,0.0001617793,0.00009242554,0.00012980154,0.00019849553,0.000029344788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039770623,0.0003074589,0.00020874114,0.00045067674,0.00033613623,0.0005248754,0.00095954846,0.00027716337,0.00076205743],"category_scores_gemma":[0.0008644126,0.00019470729,0.00019362166,0.0003205876,0.00039338332,0.00078227534,0.00037021752,0.00036312954,0.00010862581],"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.0003022676,0.000167551,0.0025999136,0.00022728337,0.000069002104,0.00022139102,0.000243051,0.21098699,0.30015612,0.050331973,0.003902981,0.4307916],"study_design_scores_gemma":[0.00003985806,0.00023074314,0.0006089144,0.000018599678,0.000030333838,0.0001663241,0.000017961462,0.9440061,0.040253095,0.008836153,0.0057545733,0.000037303038],"about_ca_topic_score_codex":0.0012043471,"about_ca_topic_score_gemma":0.0024046712,"teacher_disagreement_score":0.0012043471,"about_ca_system_score_codex":0.00052486645,"about_ca_system_score_gemma":0.0005659277,"threshold_uncertainty_score":0.0038081408},"labels":[],"label_agreement":null},{"id":"W2119773485","doi":"10.1109/icc.1993.397362","title":"Performance of a prioritized nonblocking switch under hotspot traffic conditions with head of line resolution","year":2002,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Speedup; Computer science; Hotspot (geology); Baseband; Real-time computing; High resolution; Computer network; Bandwidth (computing); Parallel computing; Remote sensing; Physics","score_opus":0.030285375421790342,"score_gpt":0.24268861138224007,"score_spread":0.21240323596044974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119773485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804253,0.00016729157,0.015946535,0.00006757907,0.000025717432,0.000024255745,0.00008365795,0.0010846048,0.0021750994],"genre_scores_gemma":[0.9961428,0.000048189926,0.0029172862,0.000024937479,0.0000068423305,0.000008188487,0.000089863795,0.00003201758,0.0007299823],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999569,0.00008434232,0.000018876079,0.000059631562,0.00012748397,0.00014068004],"domain_scores_gemma":[0.9989887,0.0004866634,0.00010407332,0.000103505656,0.00020264997,0.00011430566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357699,0.0005229962,0.00033453043,0.00047086613,0.0005250333,0.00073050335,0.000720893,0.0002904426,0.0037974832],"category_scores_gemma":[0.0010102243,0.00015111512,0.000162464,0.0004145399,0.00031244688,0.0005723597,0.00022877679,0.0003252764,0.0003286933],"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.010107686,0.00091390556,0.017867252,0.00040389315,0.00029077296,0.000855612,0.00061731297,0.3637036,0.48333535,0.0031998043,0.0032947338,0.11541018],"study_design_scores_gemma":[0.00025032272,0.0022831617,0.009724582,0.0000136820945,0.00014057534,0.00026124218,0.00015986602,0.81857425,0.1665043,0.00077586266,0.0012643158,0.000047825844],"about_ca_topic_score_codex":0.005706773,"about_ca_topic_score_gemma":0.0044325762,"teacher_disagreement_score":0.005706773,"about_ca_system_score_codex":0.0008248204,"about_ca_system_score_gemma":0.0005475855,"threshold_uncertainty_score":0.012703836},"labels":[],"label_agreement":null},{"id":"W2119888753","doi":"10.1109/icpads.2008.119","title":"An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube","year":2008,"lang":"en","type":"article","venue":"","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":"Brock University","funders":"","keywords":"Disjoint sets; Hypercube; Algorithm; Routing (electronic design automation); Computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","score_opus":0.026631936208769056,"score_gpt":0.2457065118465992,"score_spread":0.21907457563783014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119888753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008114768,0.0012121565,0.9778685,0.0005410501,0.0002369369,0.0002434916,0.0004484943,0.0030558284,0.008278836],"genre_scores_gemma":[0.04324193,0.0009571909,0.9471069,0.00016677401,0.00009967406,0.00035852852,0.0012284938,0.00034107012,0.006499531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876153,0.0003208576,0.00009230164,0.00029292837,0.00041382032,0.00011854998],"domain_scores_gemma":[0.9991492,0.0002468396,0.000071338705,0.00023635999,0.00024323947,0.000052975105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085825066,0.0014600451,0.0010209826,0.0012454635,0.0011706951,0.001728938,0.0018798906,0.0011919786,0.0076598222],"category_scores_gemma":[0.002674252,0.000647278,0.0010255856,0.0019230566,0.00068100396,0.0042979084,0.0020748756,0.0014032151,0.0035827649],"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.0005374367,0.0003006168,0.000630684,0.0008743606,0.0001794002,0.000277679,0.0002923461,0.22307914,0.017590052,0.06808029,0.04375739,0.6444006],"study_design_scores_gemma":[0.00032704315,0.00037099828,0.0003618933,0.00008430339,0.000085173335,0.00046184298,0.00021108969,0.79289585,0.014480358,0.10649946,0.084117785,0.0001042013],"about_ca_topic_score_codex":0.0029971502,"about_ca_topic_score_gemma":0.0040996643,"teacher_disagreement_score":0.0076598222,"about_ca_system_score_codex":0.001078656,"about_ca_system_score_gemma":0.0023145392,"threshold_uncertainty_score":0.025624633},"labels":[],"label_agreement":null},{"id":"W2120769788","doi":"10.1142/s0129626403001446","title":"TRADE-OFFS BETWEEN LOAD AND DEGREE IN VIRTUAL PATH LAYOUTS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Université du Québec en Outaouais","funders":"","keywords":"Network packet; Degree (music); Computer science; Upper and lower bounds; Path (computing); Routing (electronic design automation); Path length; Topology (electrical circuits); Mathematics; Distributed computing; Computer network; Combinatorics","score_opus":0.030558346507360036,"score_gpt":0.24207847059098714,"score_spread":0.2115201240836271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120769788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59983045,0.0011206744,0.38386977,0.0013507933,0.00006316979,0.000109005305,0.00022392794,0.0004820354,0.0129502015],"genre_scores_gemma":[0.9499425,0.00095579325,0.046130296,0.00010836801,0.00008873625,0.000063815896,0.00012395895,0.00020030157,0.0023861548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977964,0.0007892537,0.00012508903,0.00033685807,0.00044773042,0.0005046534],"domain_scores_gemma":[0.9668024,0.02391861,0.0030466989,0.0034217376,0.0014540401,0.0013566063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025274435,0.00102081,0.00094728416,0.0011805581,0.0014812103,0.002543355,0.0015047925,0.0010417541,0.0029305567],"category_scores_gemma":[0.026708167,0.0007515208,0.00048971054,0.0012325805,0.0023560512,0.008362561,0.002295403,0.0011089778,0.00056582683],"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.000950755,0.0002515344,0.009699838,0.0003403663,0.00008589056,0.0003126074,0.0008969921,0.70903033,0.04020724,0.17070478,0.0018688815,0.065650746],"study_design_scores_gemma":[0.00013961701,0.00070023775,0.0031326967,0.000073749536,0.00009450916,0.000899148,0.00061717024,0.7221793,0.025733436,0.2417771,0.004557684,0.000095299285],"about_ca_topic_score_codex":0.0005929004,"about_ca_topic_score_gemma":0.0012203923,"teacher_disagreement_score":0.0029305567,"about_ca_system_score_codex":0.0014919101,"about_ca_system_score_gemma":0.00059118884,"threshold_uncertainty_score":0.01336658},"labels":[],"label_agreement":null},{"id":"W2120917950","doi":"10.1109/pacrim.2011.6033002","title":"Collection and characterization of BCNET BGP traffic","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"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","funders":"Canarie","keywords":"Computer network; Border Gateway Protocol; Computer science; Transmission Control Protocol; Routing protocol; Interior gateway protocol; Network packet; Reachability; Default gateway; Internet Protocol; Internet protocol suite; Protocol (science); The Internet; Operating system; Link-state routing protocol","score_opus":0.022047545689087057,"score_gpt":0.1943999075981533,"score_spread":0.17235236190906622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120917950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9171458,0.00014609573,0.050650153,0.000118947624,0.000060547864,0.0006743329,0.014840987,0.0028565691,0.013506571],"genre_scores_gemma":[0.8801194,0.00046683327,0.07154439,0.00015745628,0.000052689014,0.0008833023,0.036748394,0.0004931718,0.009534345],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993691,0.000044412966,0.000037762555,0.000089050984,0.000359891,0.0000998362],"domain_scores_gemma":[0.99899215,0.000107692686,0.000042955453,0.00013157964,0.00066498516,0.000060653325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036879245,0.000397148,0.0003464828,0.002830202,0.0007404072,0.00046152752,0.00039508825,0.00026451488,0.0023188917],"category_scores_gemma":[0.00084345124,0.00012000549,0.00008331223,0.0026949956,0.00022432095,0.00037650022,0.0003754411,0.00041098997,0.0009368187],"study_design_candidate":"observational","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.00061839167,0.0007428446,0.05457428,0.000207376,0.00003344961,0.00054127583,0.00055623753,0.0069804327,0.8273745,0.0023861649,0.009631678,0.09635335],"study_design_scores_gemma":[0.000039835333,0.00052789855,0.22658503,0.000032328004,0.0000458749,0.0008892657,0.00038208833,0.086727865,0.65618837,0.0013705507,0.027136171,0.000074743984],"about_ca_topic_score_codex":0.006049437,"about_ca_topic_score_gemma":0.006356064,"teacher_disagreement_score":0.006049437,"about_ca_system_score_codex":0.00068087195,"about_ca_system_score_gemma":0.00063630217,"threshold_uncertainty_score":0.012028396},"labels":[],"label_agreement":null},{"id":"W2121023672","doi":"10.1109/icpads.2009.113","title":"Evaluation of ConnectX Virtual Protocol Interconnect for Data Centers","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"InfiniBand; Computer science; Data center; Computer network; Ethernet; Remote direct memory access; Adapter (computing); Latency (audio); Interconnection; Operating system; Network interface; Throughput; Bandwidth (computing); Network interface controller; Wireless; Telecommunications","score_opus":0.13286785953945243,"score_gpt":0.3810867606471738,"score_spread":0.24821890110772135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121023672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99314004,0.000099368364,0.0036822634,0.000058780115,0.000017960394,0.000046104935,0.00015124725,0.0007084035,0.0020957089],"genre_scores_gemma":[0.99607927,0.00004276678,0.0029699788,0.000012715931,0.0000045507913,0.000022866052,0.0003056828,0.00004224081,0.0005199366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998519,0.00048338316,0.000081530925,0.0001443591,0.00058925,0.00018249413],"domain_scores_gemma":[0.99725014,0.001102295,0.00022045427,0.00034530114,0.0009193079,0.00016254533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014728212,0.00085450517,0.00031959216,0.0008295837,0.0004025021,0.0005455264,0.0008125664,0.0003660701,0.0012645327],"category_scores_gemma":[0.004675019,0.00021716703,0.00019325905,0.00085541717,0.0004984012,0.0009425303,0.0004265855,0.0004078125,0.00017482933],"study_design_candidate":"bench_or_experimental","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.0047432175,0.0012385636,0.0524959,0.0005993033,0.00027533542,0.00070278,0.00058205076,0.70136094,0.12235011,0.005338927,0.005721557,0.1045914],"study_design_scores_gemma":[0.00024146108,0.010520023,0.028496148,0.000024868332,0.00010814019,0.00044621044,0.0004613854,0.7876114,0.16750796,0.0007408883,0.0037848286,0.000056743578],"about_ca_topic_score_codex":0.0025707788,"about_ca_topic_score_gemma":0.0019717454,"teacher_disagreement_score":0.0025707788,"about_ca_system_score_codex":0.0009731395,"about_ca_system_score_gemma":0.0004942366,"threshold_uncertainty_score":0.0077890754},"labels":[],"label_agreement":null},{"id":"W2121031403","doi":"10.1002/net.10088","title":"Broadcasting in generalized chordal rings","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","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":"Simon Fraser University","funders":"","keywords":"Chordal graph; Broadcasting (networking); Undirected graph; Mathematics; Node (physics); Combinatorics; Ring (chemistry); Link (geometry); Graph; Treewidth; Discrete mathematics; Computer science; Pathwidth; Computer network; Line graph","score_opus":0.012615665083055854,"score_gpt":0.22121145617798488,"score_spread":0.208595791094929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121031403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6716507,0.0022180371,0.29747263,0.0006400499,0.00012213767,0.00016610962,0.0003504837,0.000572188,0.026807753],"genre_scores_gemma":[0.96351576,0.0004710006,0.034340795,0.000057502544,0.00004798308,0.00004441444,0.0000960805,0.000018257313,0.0014082316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993261,0.00016413633,0.000042830834,0.00013753671,0.00013597391,0.00019343806],"domain_scores_gemma":[0.99737954,0.0011405023,0.0004697748,0.00049903267,0.0003573698,0.00015379918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161454,0.00015623377,0.00042759822,0.00031831377,0.0006266414,0.0010188562,0.0006541184,0.00028586466,0.0014456229],"category_scores_gemma":[0.003239512,0.0001506122,0.00022244755,0.00051393005,0.0007287692,0.0013782536,0.0007361191,0.00040488923,0.00019340854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001040851,0.000060621463,0.0028039424,0.0005509172,0.000074482596,0.00030939732,0.0006759838,0.19944924,0.04298833,0.654271,0.004464362,0.0933109],"study_design_scores_gemma":[0.0001820216,0.00045799348,0.0018005214,0.00004988434,0.00008205547,0.0007461121,0.0005481715,0.5328988,0.026256546,0.41236728,0.024546992,0.000063610874],"about_ca_topic_score_codex":0.0017946664,"about_ca_topic_score_gemma":0.0013774945,"teacher_disagreement_score":0.0017946664,"about_ca_system_score_codex":0.00085414166,"about_ca_system_score_gemma":0.00045645816,"threshold_uncertainty_score":0.006197214},"labels":[],"label_agreement":null},{"id":"W2121235810","doi":"10.1109/hicss.1995.375502","title":"Embeddings of complete binary trees into star graphs with congestion 1","year":2002,"lang":"en","type":"article","venue":"","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":"Combinatorics; Star (game theory); Binary tree; Vertex (graph theory); Upper and lower bounds; Binary number; Mathematics; Dilation (metric space); Binary search tree; Discrete mathematics; Graph; Arithmetic","score_opus":0.022054841265978554,"score_gpt":0.21499599041991893,"score_spread":0.19294114915394037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121235810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24974947,0.0002707104,0.70324004,0.00046434597,0.00012539799,0.00014645097,0.00039682066,0.0009780172,0.04462875],"genre_scores_gemma":[0.6518147,0.0004529865,0.3302078,0.00020825786,0.00005296022,0.00017538358,0.00083512865,0.00026228477,0.015990447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977785,0.000049961407,0.000015880525,0.000052791456,0.00007118808,0.00003240424],"domain_scores_gemma":[0.9993643,0.00019546159,0.000113269474,0.0001331692,0.000107528125,0.00008620958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018881906,0.000374739,0.00028628198,0.00035662233,0.000551789,0.00062561076,0.00038661493,0.000381989,0.003619119],"category_scores_gemma":[0.0012754495,0.00039862117,0.00047690966,0.00039208474,0.0006998646,0.0020750663,0.0015373337,0.00085178873,0.0007343633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021211887,0.000106395724,0.0013455512,0.00016752451,0.000027271497,0.00032612437,0.0005714231,0.056524295,0.02627498,0.8224089,0.006181675,0.08585378],"study_design_scores_gemma":[0.000063732106,0.0003569955,0.0028993639,0.00006130746,0.000052172178,0.00090578216,0.00038425188,0.27690277,0.03314827,0.6277385,0.057417527,0.00006938934],"about_ca_topic_score_codex":0.0006768529,"about_ca_topic_score_gemma":0.0012864224,"teacher_disagreement_score":0.003619119,"about_ca_system_score_codex":0.00063217786,"about_ca_system_score_gemma":0.0002939465,"threshold_uncertainty_score":0.012107134},"labels":[],"label_agreement":null},{"id":"W2121524100","doi":"10.1016/s0304-3975(02)00640-0","title":"Analysis of edge deletion processes on faulty random regular graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Enhanced Data Rates for GSM Evolution; Degree (music); Expander graph; Random regular graph; Mathematics; Fault tolerance; Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Chordal graph; Graph; 1-planar graph; Distributed computing; Artificial intelligence","score_opus":0.00983825410962391,"score_gpt":0.24056285942636824,"score_spread":0.23072460531674432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121524100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5119367,0.00069258915,0.48030743,0.0013520761,0.00009100731,0.00012492972,0.00028100907,0.00064939493,0.0045648934],"genre_scores_gemma":[0.9778153,0.00037957547,0.016335407,0.00009554519,0.0000789473,0.00008399168,0.00021543006,0.00014065774,0.004855247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828714,0.00061592215,0.00007426736,0.00027680362,0.0003941642,0.0003516558],"domain_scores_gemma":[0.9575714,0.031442184,0.004250198,0.0026791987,0.0027223972,0.0013345752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042217155,0.00087214523,0.0015540074,0.0021774035,0.00087876845,0.0020587044,0.00395626,0.0021323033,0.0043028635],"category_scores_gemma":[0.027487116,0.00091140025,0.0009980862,0.0013672803,0.0026651009,0.0029525722,0.0016319131,0.0016833688,0.00043010482],"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.0005106214,0.0001282621,0.0051815333,0.00015850266,0.00008772971,0.0005732531,0.0003337473,0.7640548,0.0045695,0.21168426,0.0018210353,0.010896681],"study_design_scores_gemma":[0.000029509327,0.000030111958,0.00040254177,0.0000093896015,0.000022966398,0.00008209373,0.00005310109,0.9330143,0.0009549322,0.06512633,0.00026238844,0.000012359644],"about_ca_topic_score_codex":0.002544092,"about_ca_topic_score_gemma":0.0018270062,"teacher_disagreement_score":0.0043028635,"about_ca_system_score_codex":0.0019625793,"about_ca_system_score_gemma":0.0010725076,"threshold_uncertainty_score":0.022326887},"labels":[],"label_agreement":null},{"id":"W2121663390","doi":"10.1109/icc.2006.254807","title":"Performance Modelling of the Multicast Balanced Gamma Switch","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Unicast; Xcast; Source-specific multicast; Protocol Independent Multicast; Pragmatic General Multicast; Distributed computing","score_opus":0.10975263391100584,"score_gpt":0.29517420692971386,"score_spread":0.185421573018708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121663390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21874563,0.0008121863,0.73325646,0.00052667555,0.0000649016,0.00009600731,0.0002878403,0.00080214394,0.04540813],"genre_scores_gemma":[0.9832525,0.0004923459,0.010468438,0.0000635492,0.000026060774,0.000059154772,0.00009100364,0.000058049187,0.0054888898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968934,0.00006445067,0.000006964258,0.000038182516,0.00013224936,0.00006880723],"domain_scores_gemma":[0.9997944,0.000079926496,0.000029705487,0.000017325307,0.00006425172,0.000014428409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041271746,0.0007719362,0.00038999718,0.00051359704,0.00032856548,0.0009532215,0.00082296564,0.00072073395,0.0023662164],"category_scores_gemma":[0.0009588475,0.00023381368,0.0003190822,0.00035112497,0.00040905163,0.00083618076,0.0004896972,0.00040314166,0.0006098519],"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.00008265858,0.000022477538,0.00049928774,0.000024291685,0.000009222063,0.00012427212,0.00006814052,0.9628482,0.008864657,0.021249931,0.00042735453,0.0057794712],"study_design_scores_gemma":[0.000003353879,0.000019299487,0.00007704166,0.0000025754425,0.000003365192,0.000022354385,0.000006359235,0.9966074,0.0007017871,0.0021626411,0.00039104634,0.000002762791],"about_ca_topic_score_codex":0.0038867283,"about_ca_topic_score_gemma":0.00096646236,"teacher_disagreement_score":0.0038867283,"about_ca_system_score_codex":0.0010882445,"about_ca_system_score_gemma":0.00069441303,"threshold_uncertainty_score":0.007915795},"labels":[],"label_agreement":null},{"id":"W2121963474","doi":"10.1109/hicss.1995.375508","title":"Efficient reconfiguration technique for redundant ring networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Carleton University","funders":"","keywords":"Subring; Control reconfiguration; Ring (chemistry); Partition (number theory); Computer science; Node (physics); Component (thermodynamics); Construct (python library); Set (abstract data type); Topology (electrical circuits); Theoretical computer science; Mathematics; Discrete mathematics; Computer network; Combinatorics; Embedded system; Engineering; Physics","score_opus":0.025119369936202864,"score_gpt":0.231118584250944,"score_spread":0.20599921431474114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121963474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14405394,0.00096482475,0.8410683,0.00019154191,0.00006616198,0.00009015207,0.000109098466,0.0019380231,0.01151791],"genre_scores_gemma":[0.7079218,0.0003375441,0.2879286,0.00006819869,0.000038975573,0.0000968397,0.00026183375,0.00009585691,0.003250343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.00006733788,0.000014941693,0.000044622717,0.00008562583,0.000056733934],"domain_scores_gemma":[0.9997174,0.000087722685,0.00004958781,0.00008688536,0.00004490836,0.000013491407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017990479,0.00030710676,0.00035299698,0.0006140978,0.00030849068,0.00037488583,0.00046875663,0.00027306093,0.0017182924],"category_scores_gemma":[0.0006607229,0.00018845897,0.00022167516,0.0006362916,0.00028510366,0.0007065689,0.00043407423,0.00027645295,0.00039461927],"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.00037083452,0.00009419202,0.00078783924,0.00025387612,0.00005905369,0.0005083511,0.000300538,0.26769257,0.15293242,0.049878724,0.006810807,0.5203108],"study_design_scores_gemma":[0.00008938684,0.00023108341,0.0008584218,0.000024891995,0.000040176306,0.0007496183,0.00007420074,0.9066263,0.046716627,0.029432382,0.015129837,0.000026947513],"about_ca_topic_score_codex":0.00047032227,"about_ca_topic_score_gemma":0.0007723773,"teacher_disagreement_score":0.0017182924,"about_ca_system_score_codex":0.00036934484,"about_ca_system_score_gemma":0.00021825454,"threshold_uncertainty_score":0.0057482123},"labels":[],"label_agreement":null},{"id":"W2121987854","doi":"10.1109/pimrc.1997.627013","title":"Interconnection strategies for wireless access networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Computer science; Network topology; Computer network; Robustness (evolution); Interconnection; Wireless network; Distributed computing; Wireless; Star network; Bus network; Telecommunications; System bus; Computer hardware","score_opus":0.04774223182350818,"score_gpt":0.27286167779440934,"score_spread":0.22511944597090117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121987854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041728638,0.005177101,0.85607797,0.0013939926,0.00028296665,0.00011881327,0.00013855327,0.0004484188,0.09463347],"genre_scores_gemma":[0.756265,0.0049930434,0.19608603,0.00031222313,0.00021757146,0.00039712872,0.00030469947,0.00008967439,0.041334603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999211,0.000025924042,0.0000057046386,0.000011769498,0.000025187357,0.000010386902],"domain_scores_gemma":[0.99993753,0.000019666495,0.000008254944,0.000008166837,0.000020714253,0.0000056435792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013559357,0.00030477595,0.00015931274,0.0003159814,0.0003045561,0.0005699209,0.00036774605,0.00033667297,0.005059962],"category_scores_gemma":[0.00044695337,0.00009565314,0.0001464056,0.000368177,0.00025781954,0.0008833138,0.0003759065,0.00025470415,0.00065202935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033137723,0.00002192579,0.00017060888,0.00018125284,0.00002088876,0.00020278845,0.00013766506,0.060044583,0.009364684,0.7327218,0.011069698,0.18603098],"study_design_scores_gemma":[0.000027611106,0.00011513211,0.0002236682,0.000058825713,0.000024698043,0.00035824935,0.00012783425,0.32305336,0.0032162655,0.58952427,0.0832532,0.000016939188],"about_ca_topic_score_codex":0.00043278077,"about_ca_topic_score_gemma":0.0009313679,"teacher_disagreement_score":0.005059962,"about_ca_system_score_codex":0.00035785793,"about_ca_system_score_gemma":0.00024215873,"threshold_uncertainty_score":0.016927242},"labels":[],"label_agreement":null},{"id":"W2122049872","doi":"10.1007/s10951-011-0259-4","title":"Routing equal-size messages on a slotted ring","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Diagonal; Routing (electronic design automation); Network packet; Computer science; Combinatorics; Approximation algorithm; Scheduling (production processes); Time complexity; Mathematics; Discrete mathematics; Mathematical optimization; Computer network; Geometry","score_opus":0.04730897912991058,"score_gpt":0.25423519513089304,"score_spread":0.20692621600098246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122049872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5845093,0.00067867845,0.40562135,0.00048690056,0.00043536755,0.00020975292,0.00024380042,0.0013736296,0.00644113],"genre_scores_gemma":[0.9214326,0.00016850956,0.074235305,0.00006766076,0.000076305114,0.00006822878,0.000096647105,0.00005558578,0.003799119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00030793028,0.00009705594,0.00016042034,0.00016455931,0.00022128152],"domain_scores_gemma":[0.9961701,0.0018798722,0.00046719343,0.0007956537,0.0004079866,0.00027911083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760396,0.0003698984,0.0010649073,0.00081931666,0.0011018619,0.0015412618,0.0017385209,0.00069072546,0.0038121608],"category_scores_gemma":[0.0037547788,0.0005032178,0.00041210395,0.00092051964,0.000631706,0.0020802836,0.0012622325,0.00045557966,0.0003731487],"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.010294516,0.0007202416,0.0030352492,0.0005009059,0.00032383914,0.000584815,0.00052616035,0.6377121,0.09332301,0.072570205,0.0076346123,0.1727743],"study_design_scores_gemma":[0.00026929853,0.00068733504,0.0003435767,0.0000108281565,0.00006839652,0.000084310195,0.000071037,0.9657312,0.013175108,0.01702067,0.0025063723,0.000031882042],"about_ca_topic_score_codex":0.0011135621,"about_ca_topic_score_gemma":0.0022283802,"teacher_disagreement_score":0.0038121608,"about_ca_system_score_codex":0.00093077443,"about_ca_system_score_gemma":0.00076310395,"threshold_uncertainty_score":0.01275295},"labels":[],"label_agreement":null},{"id":"W2122099560","doi":"10.1109/glocom.1991.188518","title":"16*16 limited intermediate buffer switch module for ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"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; Scheduling (production processes); Computer network; Network packet; Crossover switch; Packet switching; Network switch; Buffer (optical fiber); Throughput; Real-time computing; Crossbar switch; Engineering; Operating system; Telecommunications; Wireless","score_opus":0.02616009864915497,"score_gpt":0.22537958724394677,"score_spread":0.1992194885947918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122099560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73271394,0.0019972816,0.23109606,0.0003090519,0.0002943129,0.0002706771,0.00077502447,0.0049039028,0.027639795],"genre_scores_gemma":[0.9199877,0.00039244376,0.0652797,0.00007450378,0.00004803894,0.00011518493,0.00057026604,0.00009079764,0.013441354],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999355,0.000015378206,0.000004465635,0.000008565139,0.000024447629,0.000011671485],"domain_scores_gemma":[0.99990785,0.000017693472,0.000015170067,0.000023061766,0.000024609315,0.000011640792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021954416,0.00017626146,0.00014330565,0.00022460174,0.00019954848,0.00033118107,0.00059511344,0.0001431075,0.00831386],"category_scores_gemma":[0.00030555538,0.00008307266,0.0001366036,0.00023911074,0.000111426336,0.0004898954,0.0002468647,0.00019486515,0.0007895499],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0016354477,0.00039992825,0.0037895802,0.00046858442,0.00005695407,0.00050295336,0.00016504005,0.034295335,0.63126653,0.031151427,0.008929876,0.28733835],"study_design_scores_gemma":[0.0003536959,0.0038260338,0.011207038,0.00009077792,0.00014100458,0.0018288306,0.00009890567,0.29259574,0.5321993,0.018246097,0.13933483,0.00007770795],"about_ca_topic_score_codex":0.00038953198,"about_ca_topic_score_gemma":0.00048381236,"teacher_disagreement_score":0.00831386,"about_ca_system_score_codex":0.0002676086,"about_ca_system_score_gemma":0.00029240694,"threshold_uncertainty_score":0.02781266},"labels":[],"label_agreement":null},{"id":"W2122508807","doi":"10.1109/ccece.2003.1226074","title":"Distributed recovery block based fault-tolerant multicasting","year":2004,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Successor cardinal; Computer science; Multicast; Node (physics); Block (permutation group theory); Computer network; Header; Distributed computing; Fault tolerance; Network topology; Hypercube; Parallel computing; Engineering; Mathematics","score_opus":0.016089032215750945,"score_gpt":0.22749952322609468,"score_spread":0.21141049101034373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122508807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07705741,0.00037673744,0.9168501,0.00016635352,0.00006325712,0.00008654935,0.000044683697,0.0019350118,0.0034199299],"genre_scores_gemma":[0.76695,0.00016662022,0.22804953,0.00007123605,0.000045071265,0.00011337844,0.000116940195,0.00010407633,0.0043830397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962234,0.00009917645,0.00001456923,0.000050566676,0.00016994629,0.00004343012],"domain_scores_gemma":[0.9994497,0.00016628264,0.000073226234,0.00014686909,0.00012918797,0.00003469786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037324298,0.00023575382,0.0005220671,0.0003367781,0.00046939243,0.0003316632,0.0013337822,0.0004895439,0.0016777806],"category_scores_gemma":[0.00094519346,0.00013778912,0.00019763017,0.00027365956,0.00031173785,0.00067212153,0.0006582726,0.0004264891,0.00044352742],"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.00119212,0.00026571524,0.0015431674,0.00023306221,0.000073416195,0.00036805653,0.00037486723,0.2950402,0.1682608,0.028017273,0.004857814,0.49977347],"study_design_scores_gemma":[0.00009095157,0.00022031924,0.0003332305,0.000006897802,0.0000199271,0.00016446492,0.000024953219,0.96388984,0.024741955,0.0042465357,0.0062440103,0.000016845623],"about_ca_topic_score_codex":0.0012245242,"about_ca_topic_score_gemma":0.0011165135,"teacher_disagreement_score":0.0016777806,"about_ca_system_score_codex":0.00034655776,"about_ca_system_score_gemma":0.00030388928,"threshold_uncertainty_score":0.005612731},"labels":[],"label_agreement":null},{"id":"W2122643450","doi":"10.1109/mnrc.2008.4683372","title":"A comparison of two multistage ring architectures for NoC using high-level simulation models","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McGill University","funders":"","keywords":"SystemC; Bandwidth (computing); Ring (chemistry); Computer science; Bisection; Parallel computing; Architecture; Computer architecture; Bisection method; Computer network; Algorithm; Mathematics","score_opus":0.2188537813100765,"score_gpt":0.3789628974970106,"score_spread":0.16010911618693413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122643450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7135883,0.0009020527,0.2618198,0.00040462523,0.000104990046,0.0002416689,0.000608333,0.001597452,0.020732723],"genre_scores_gemma":[0.94562274,0.00030578682,0.05201084,0.000027690778,0.000006131074,0.000118988304,0.0002654083,0.000076047065,0.0015664438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956256,0.00017629928,0.000026297126,0.000032293647,0.00016334417,0.000039096194],"domain_scores_gemma":[0.9985707,0.0008533333,0.00008771571,0.0001907368,0.00025396564,0.000043579654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009860529,0.0004151404,0.0004925604,0.00062272267,0.00031628128,0.0006269526,0.0007535334,0.0006426487,0.0022269324],"category_scores_gemma":[0.003102542,0.00029021202,0.00050013914,0.00061982387,0.00018817456,0.0011340854,0.00031640977,0.00039987412,0.0002101402],"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.00024295865,0.00008233961,0.0013906332,0.000078776386,0.000031712643,0.000038073726,0.000040976483,0.97621685,0.0064453133,0.0031562874,0.00027307952,0.012002982],"study_design_scores_gemma":[0.000008633389,0.00009303899,0.00033354654,0.0000042193515,0.000006984081,0.000007033108,0.0000071783584,0.9971951,0.0017989309,0.00022650049,0.0003122635,0.000006571859],"about_ca_topic_score_codex":0.00556345,"about_ca_topic_score_gemma":0.005418747,"teacher_disagreement_score":0.00556345,"about_ca_system_score_codex":0.0009458966,"about_ca_system_score_gemma":0.00086326274,"threshold_uncertainty_score":0.011062086},"labels":[],"label_agreement":null},{"id":"W2122810858","doi":"10.1109/glocom.1990.116633","title":"Delay analysis of timed-token protocol and its application to a hybrid switching system","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Computer science; Token ring; Network packet; Latency (audio); Frame (networking); Transmission delay; Computer network; Processing delay; Low latency (capital markets); Security token; Fiber Distributed Data Interface; Packet analyzer; Real-time computing; Packet switching; Algorithm; Local area network; Telecommunications","score_opus":0.013982759765439832,"score_gpt":0.24554994481326717,"score_spread":0.23156718504782733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122810858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10160707,0.0005114086,0.89249766,0.00009326625,0.00003381615,0.00003487442,0.00007261339,0.00024047431,0.0049089263],"genre_scores_gemma":[0.9723965,0.00036427463,0.024236742,0.000015705882,0.000019338253,0.000037212372,0.000042191765,0.000031422085,0.0028565547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998667,0.000029735214,0.000006226132,0.000019375515,0.000057210727,0.000020685662],"domain_scores_gemma":[0.9997079,0.00015505527,0.000033343855,0.000016625001,0.00007858815,0.000008550459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032530216,0.00025097613,0.00022235041,0.00041787987,0.00020370413,0.00051741843,0.00030517083,0.00022291059,0.0015800701],"category_scores_gemma":[0.0010115765,0.00009572979,0.00017396927,0.00035767833,0.00036767175,0.00054088293,0.00024449048,0.0002742483,0.0001437936],"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.00008320012,0.000014119942,0.00055064,0.00005910004,0.000017058592,0.00014429259,0.00011112127,0.83403987,0.011981109,0.13374794,0.0004937056,0.018757878],"study_design_scores_gemma":[0.0000021693743,0.000009686755,0.00004926965,0.0000016372297,0.0000021090038,0.000019777399,0.0000071328036,0.99328893,0.00064247794,0.005616595,0.00035745814,0.0000027318422],"about_ca_topic_score_codex":0.0037032466,"about_ca_topic_score_gemma":0.0012627941,"teacher_disagreement_score":0.0037032466,"about_ca_system_score_codex":0.00089863,"about_ca_system_score_gemma":0.0003858921,"threshold_uncertainty_score":0.007363379},"labels":[],"label_agreement":null},{"id":"W2122900653","doi":"10.1145/2678373.2665691","title":"SynFull","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":79,"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; Speedup; Pace; Cache coherence; Workload; Power consumption; Cache; Computer architecture; Distributed computing; Power (physics); Cache algorithms; CPU cache; Computer network; Parallel computing","score_opus":0.009785753314016484,"score_gpt":0.22203810495940685,"score_spread":0.21225235164539036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122900653","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023284947,0.0010241666,0.2635357,0.0023592974,0.0029975942,0.0010211944,0.041713983,0.21897079,0.4450923],"genre_scores_gemma":[0.17983384,0.0012951243,0.18780892,0.0022492327,0.00040251962,0.0015455846,0.13111849,0.0406272,0.4551191],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988477,0.00015803346,0.00007065712,0.00021138384,0.00062002265,0.000092223105],"domain_scores_gemma":[0.99712926,0.0005757159,0.00012227664,0.0008813487,0.0011044967,0.00018686472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016934219,0.0008067456,0.00052964274,0.0014352717,0.00076730957,0.0017892,0.0026239005,0.0010604549,0.17613599],"category_scores_gemma":[0.005119788,0.0007388832,0.0005864269,0.0010584848,0.00045066793,0.0028271016,0.0019949833,0.0011622062,0.06651783],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0006234543,0.00014195505,0.0025238583,0.00056856964,0.00006561991,0.0002900247,0.00021238805,0.011591704,0.015038672,0.024099817,0.6952759,0.24956807],"study_design_scores_gemma":[0.00018006486,0.00018958408,0.0016524491,0.00007984365,0.000034015036,0.00045999067,0.00007817153,0.05357359,0.019471502,0.0109888,0.91323227,0.00005973635],"about_ca_topic_score_codex":0.0025584677,"about_ca_topic_score_gemma":0.004213905,"teacher_disagreement_score":0.17613599,"about_ca_system_score_codex":0.0009762369,"about_ca_system_score_gemma":0.0014251195,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2123516116","doi":"10.1109/ccece.2006.277609","title":"Performance Analysis of Dynamic Reconfigurable Queues for High Speed Routers","year":2006,"lang":"en","type":"article","venue":"","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Router; Dram; Computer network; Queue; Static random-access memory; Network packet; Queueing theory; Embedded system; Computer hardware","score_opus":0.008563606117940145,"score_gpt":0.21882169401282,"score_spread":0.21025808789487987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123516116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8369662,0.0014293166,0.1520915,0.00030924598,0.000104885796,0.000049277736,0.00015172303,0.0010211057,0.007876791],"genre_scores_gemma":[0.9959269,0.0000940166,0.0032312416,0.000019057581,0.0000118504,0.0000083851955,0.000036161004,0.000022068802,0.000650237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.00012911342,0.000026394497,0.000121977915,0.00024763469,0.0002235118],"domain_scores_gemma":[0.99847835,0.0007093605,0.000197943,0.00022233308,0.00029749723,0.00009456575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000782966,0.00044089975,0.00031325486,0.00056859246,0.00040902063,0.0010372477,0.0010384886,0.00039100027,0.0021909613],"category_scores_gemma":[0.0029159773,0.00021428846,0.00027702708,0.0005791611,0.00037336734,0.0010584852,0.00034124707,0.00041378682,0.0002663943],"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.0021814376,0.00028911093,0.0077160024,0.00015491658,0.00012902674,0.00034657912,0.00012347351,0.8047951,0.08813086,0.044817626,0.002438548,0.048877265],"study_design_scores_gemma":[0.000017305565,0.00011682812,0.0005947054,0.0000022604352,0.000015411806,0.00003301838,0.000010823042,0.9894031,0.0082874205,0.0012800748,0.0002299049,0.00000906807],"about_ca_topic_score_codex":0.0022714746,"about_ca_topic_score_gemma":0.0014385442,"teacher_disagreement_score":0.0022714746,"about_ca_system_score_codex":0.0016938677,"about_ca_system_score_gemma":0.00086545676,"threshold_uncertainty_score":0.012290001},"labels":[],"label_agreement":null},{"id":"W2123915480","doi":"10.1109/ismvl.2006.20","title":"Embedding and Assembling Techniques for Spatial Computing Structure Design using Decision Trees and Diagrams","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Calgary","funders":"","keywords":"Embedding; Voronoi diagram; Computer science; Topology (electrical circuits); Data structure; Theoretical computer science; Network topology; Mathematics; Artificial intelligence; Geometry","score_opus":0.02554118042059866,"score_gpt":0.29012281677865587,"score_spread":0.2645816363580572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123915480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018626595,0.000110650944,0.9794152,0.000058271315,0.000012190789,0.00004680642,0.00002390702,0.00020619234,0.0015000964],"genre_scores_gemma":[0.27401194,0.00024994573,0.7242737,0.00002869472,0.000016492204,0.00014642745,0.000095461524,0.000081463484,0.0010957674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989134,0.0003943596,0.000100592915,0.00014950911,0.00038440773,0.000057738274],"domain_scores_gemma":[0.9981628,0.0010085495,0.00020113753,0.0003444786,0.00021246121,0.00007058282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017535,0.0004776822,0.00045017223,0.00091627444,0.00051375857,0.00095442025,0.0005480577,0.00036003994,0.0022072184],"category_scores_gemma":[0.0037515908,0.00034200525,0.00055527774,0.0007960265,0.000926102,0.0016735619,0.00088750257,0.00074443396,0.0003667068],"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.00010547777,0.00013513886,0.0008421189,0.00032678823,0.00005093071,0.00010629428,0.00057935034,0.37105933,0.024234844,0.29518145,0.0010579193,0.3063204],"study_design_scores_gemma":[0.000054389977,0.00022160073,0.00021864043,0.000042718875,0.00004091402,0.00012504571,0.000106574014,0.8033514,0.021827733,0.15967686,0.014307088,0.00002708154],"about_ca_topic_score_codex":0.00070415664,"about_ca_topic_score_gemma":0.0008579768,"teacher_disagreement_score":0.0022072184,"about_ca_system_score_codex":0.0005821344,"about_ca_system_score_gemma":0.0005453143,"threshold_uncertainty_score":0.007383883},"labels":[],"label_agreement":null},{"id":"W2124706286","doi":"10.1007/s11227-014-1085-1","title":"Deriving length two path centered surface area for the arrangement graph: a generating function approach","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Path (computing); Graph; Scalability; Path length; Surface (topology); Focus (optics); Algorithm; Combinatorics; Theoretical computer science; Mathematics; Geometry; Physics","score_opus":0.03476657181284009,"score_gpt":0.23308848152644016,"score_spread":0.19832190971360006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124706286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04297561,0.0001991177,0.9503113,0.00016152054,0.00004389375,0.000043671782,0.00019455244,0.00033567724,0.005734699],"genre_scores_gemma":[0.7304813,0.0007172883,0.2538153,0.00021437956,0.00029017057,0.0002955468,0.0010231514,0.00095162063,0.012211275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997106,0.00009457452,0.000010416267,0.00007427084,0.00007464542,0.00003554658],"domain_scores_gemma":[0.9969829,0.0020223164,0.00020194225,0.000294661,0.0003744896,0.00012370173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070453045,0.0006796618,0.00075312203,0.0026267834,0.00050497235,0.0009593181,0.0018515915,0.001401485,0.0064828526],"category_scores_gemma":[0.0045459303,0.00053616444,0.0008840523,0.0013221464,0.0009939593,0.002086706,0.0009682651,0.00134785,0.0012111546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036377092,0.00010666748,0.0024670127,0.00015013576,0.00003730715,0.00027178737,0.00020112123,0.30104953,0.00496531,0.6094773,0.004954538,0.07628291],"study_design_scores_gemma":[0.0000033838965,0.000014033865,0.00035146685,0.000010746784,0.000007808697,0.000063113046,0.000021274616,0.8369945,0.00056620024,0.16097112,0.0009870108,0.000009191475],"about_ca_topic_score_codex":0.0012363401,"about_ca_topic_score_gemma":0.00143367,"teacher_disagreement_score":0.0064828526,"about_ca_system_score_codex":0.00081366114,"about_ca_system_score_gemma":0.0005412199,"threshold_uncertainty_score":0.02168727},"labels":[],"label_agreement":null},{"id":"W2124753511","doi":"10.1109/iv.2003.1217992","title":"A heuristic for k-broadcasting in arbitrary networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Heuristic; Broadcasting (networking); Graph; Computer science; Upper and lower bounds; Algorithm; Combinatorics; Lattice graph; Torus; Grid network; Discrete mathematics; Mathematics; Theoretical computer science; Grid; Line graph; Voltage graph; Artificial intelligence; Computer network","score_opus":0.01466419256370825,"score_gpt":0.23545509168448683,"score_spread":0.2207908991207786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124753511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060547467,0.000503441,0.9215682,0.00039791336,0.00009143144,0.00023138584,0.00020342565,0.002532621,0.013924111],"genre_scores_gemma":[0.367368,0.00026257118,0.62614584,0.00017541308,0.00003312906,0.00023091855,0.0004822149,0.0003790455,0.004922846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946123,0.00016971015,0.000026287917,0.000093227914,0.00009211937,0.00015738732],"domain_scores_gemma":[0.9988343,0.00055513415,0.00010585023,0.00024334794,0.00016190954,0.00009944998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045407476,0.000567926,0.0007194212,0.00055923715,0.0012487598,0.00068853685,0.0016478741,0.00078654685,0.006073445],"category_scores_gemma":[0.0021991283,0.00044542408,0.00045007656,0.0010472265,0.00077121204,0.0014416827,0.00097586546,0.00071994046,0.0012798914],"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.000683712,0.00025038928,0.0012568943,0.0003711199,0.00007672726,0.0003337125,0.00053796556,0.56619513,0.025492746,0.045784954,0.024425518,0.33459115],"study_design_scores_gemma":[0.00012540582,0.00012012351,0.00026876142,0.000023941586,0.000034068635,0.00024491528,0.00019562192,0.955251,0.009191333,0.02545246,0.009060755,0.00003164077],"about_ca_topic_score_codex":0.0060969177,"about_ca_topic_score_gemma":0.0072596977,"teacher_disagreement_score":0.0060969177,"about_ca_system_score_codex":0.0013647921,"about_ca_system_score_gemma":0.001648691,"threshold_uncertainty_score":0.020317674},"labels":[],"label_agreement":null},{"id":"W2125231919","doi":"10.1109/dftvs.2005.45","title":"Methodologies and algorithms for testing switch-based NoC interconnects","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":53,"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":"FIFO (computing and electronics); Computer science; Interconnection; Network on a chip; Network topology; Parallel computing; Banyan; Logic synthesis; Parallelism (grammar); Logic gate; Computer architecture; Cover (algebra); Embedded system; Algorithm; Engineering; Computer hardware; Computer network","score_opus":0.11425746879607449,"score_gpt":0.31362857436238256,"score_spread":0.19937110556630808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125231919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024128165,0.00022502258,0.99627846,0.00005212004,0.000012414211,0.00009655008,0.000031496962,0.00044384645,0.000447219],"genre_scores_gemma":[0.045962326,0.0003576014,0.9526114,0.00006884525,0.000027969216,0.00030171167,0.0002148717,0.000082359824,0.00037302228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995271,0.0017276224,0.00049225474,0.000686585,0.001625696,0.00019685044],"domain_scores_gemma":[0.98529774,0.010858499,0.0012429596,0.001131616,0.0013129147,0.00015627994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00369977,0.001912632,0.00089124986,0.0024779874,0.00049016025,0.0017422687,0.0025657206,0.00134289,0.001832206],"category_scores_gemma":[0.01868925,0.0007278121,0.0009228825,0.0012656684,0.0015513323,0.0021894106,0.0012098034,0.0013483379,0.00060045166],"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.00018817873,0.00022932242,0.0025760813,0.0011719011,0.00023341292,0.00033506742,0.0003332462,0.31840545,0.020827714,0.113474,0.002435187,0.53979045],"study_design_scores_gemma":[0.00013935158,0.00026540796,0.00063812616,0.00023890991,0.00010565883,0.00069264707,0.00011947073,0.82862693,0.025951276,0.1339661,0.009183161,0.00007307683],"about_ca_topic_score_codex":0.0011174653,"about_ca_topic_score_gemma":0.0009431321,"teacher_disagreement_score":0.00369977,"about_ca_system_score_codex":0.0011350461,"about_ca_system_score_gemma":0.001317176,"threshold_uncertainty_score":0.019566476},"labels":[],"label_agreement":null},{"id":"W2125630897","doi":"10.1109/icm.2003.238564","title":"High-speed system bus for a SoC network processing platform","year":2003,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Interconnection; Computer science; Embedded system; System on a chip; Computer architecture; Architecture; Compatibility (geochemistry); Bandwidth (computing); CMOS; Throughput; Flexibility (engineering); Chip; Cadence; Network on a chip; Computer hardware; Electronic engineering; Engineering; Computer network; Operating system; Wireless; Telecommunications","score_opus":0.02300254083013773,"score_gpt":0.2318645393746874,"score_spread":0.20886199854454968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125630897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10357101,0.0016410584,0.8162508,0.0013630098,0.00065249286,0.00045765314,0.000900322,0.011483743,0.063679814],"genre_scores_gemma":[0.62135243,0.0008816841,0.33096707,0.00045564078,0.00027323264,0.00042069255,0.002473585,0.00048045372,0.04269519],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997955,0.0000721733,0.000014833458,0.000021058824,0.00007123877,0.000025182078],"domain_scores_gemma":[0.99970347,0.000040433748,0.000026008827,0.000047188965,0.00014844595,0.000034364995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031243704,0.00028249237,0.00013050385,0.00042364968,0.0004935504,0.00074009533,0.0005409884,0.00035179927,0.012101537],"category_scores_gemma":[0.0006174166,0.00011575465,0.00014438124,0.0003681977,0.00018836698,0.00074136496,0.00045855367,0.00059197855,0.0026715712],"study_design_candidate":"bench_or_experimental","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.0007858799,0.00019638437,0.001900794,0.00072334195,0.0000844116,0.00065781246,0.0003143428,0.024005992,0.1574035,0.24029276,0.076059565,0.4975752],"study_design_scores_gemma":[0.00028515395,0.001116678,0.0027339219,0.0001627975,0.000116031224,0.0010407615,0.00022260207,0.3242851,0.119225666,0.041693,0.50904274,0.00007553745],"about_ca_topic_score_codex":0.0010887542,"about_ca_topic_score_gemma":0.001972409,"teacher_disagreement_score":0.012101537,"about_ca_system_score_codex":0.00040123443,"about_ca_system_score_gemma":0.00059409474,"threshold_uncertainty_score":0.040483654},"labels":[],"label_agreement":null},{"id":"W2126066730","doi":"10.1109/rsp.2006.7","title":"An Embedded Java Virtual Machine Using Network-on-Chip Design","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 New Brunswick","funders":"","keywords":"Computer science; Embedded system; Virtual machine; Field-programmable gate array; Java; Operating system; Reuse; Software; Computer hardware; Computer architecture","score_opus":0.029254694686833775,"score_gpt":0.25571802097844204,"score_spread":0.22646332629160826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126066730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012401665,0.0005012233,0.96950644,0.00019146038,0.00023874281,0.00014555706,0.000054530097,0.006175465,0.010784833],"genre_scores_gemma":[0.29972705,0.0006910406,0.6815145,0.00039680814,0.00008727415,0.00047911739,0.0003339613,0.000660547,0.016109675],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994568,0.00011971996,0.000043066186,0.00008047051,0.00024289264,0.000057056695],"domain_scores_gemma":[0.99939144,0.00015591738,0.000059701477,0.0001363724,0.0001931644,0.000063474785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231679,0.00038916993,0.00032142125,0.00028420615,0.00033797606,0.0013157442,0.0012973747,0.00058403955,0.0023025484],"category_scores_gemma":[0.001524832,0.0003020525,0.00032963,0.00023531345,0.00039564853,0.0010568339,0.0006191118,0.00085776375,0.00061717065],"study_design_candidate":"bench_or_experimental","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.00070702087,0.0004828149,0.0028269615,0.0008364867,0.00017466646,0.00078003126,0.00039488293,0.10106054,0.17075033,0.14190152,0.025729325,0.5543555],"study_design_scores_gemma":[0.00021838618,0.00055767025,0.0010428011,0.00009881859,0.00011612027,0.0008205704,0.000037551687,0.7151549,0.0962121,0.021483934,0.16416039,0.00009684277],"about_ca_topic_score_codex":0.00087470014,"about_ca_topic_score_gemma":0.0012765548,"teacher_disagreement_score":0.0023025484,"about_ca_system_score_codex":0.00041790656,"about_ca_system_score_gemma":0.0011071265,"threshold_uncertainty_score":0.0077028275},"labels":[],"label_agreement":null},{"id":"W2126473895","doi":"10.1016/j.comgeo.2014.05.001","title":"Theta-3 is connected","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Graph; Graph theory; Context (archaeology); Path (computing); Set (abstract data type)","score_opus":0.011925380737211073,"score_gpt":0.22918335958953945,"score_spread":0.21725797885232837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126473895","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38597468,0.00061247725,0.1037096,0.0045363065,0.0014658696,0.00023838964,0.0020491008,0.0012973188,0.5001162],"genre_scores_gemma":[0.85973895,0.000645753,0.015408807,0.0011086308,0.00039895275,0.00022354243,0.0027457476,0.00048549564,0.11924405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995559,0.000059348702,0.000020436284,0.00012215597,0.00011174653,0.00013036291],"domain_scores_gemma":[0.99913305,0.00024846214,0.00012637368,0.000093692426,0.00018629589,0.00021222261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029726158,0.0012726954,0.0011186779,0.001839763,0.002368678,0.003463175,0.0011758445,0.001083453,0.027695362],"category_scores_gemma":[0.0010738883,0.0005722294,0.0009836105,0.001422485,0.0024969024,0.0030169985,0.002771274,0.0034954967,0.0057859165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018388327,0.000048405334,0.0004176637,0.000074364376,0.00003530636,0.00030497625,0.00030593725,0.0007064434,0.0021548565,0.9814098,0.006187737,0.008170536],"study_design_scores_gemma":[0.000059395825,0.000038815047,0.00046427513,0.00002079249,0.000027062764,0.0002836885,0.00027918274,0.0014146264,0.0017209222,0.9761603,0.019514902,0.00001597794],"about_ca_topic_score_codex":0.00097318203,"about_ca_topic_score_gemma":0.0008986947,"teacher_disagreement_score":0.027695362,"about_ca_system_score_codex":0.0011443294,"about_ca_system_score_gemma":0.00057744415,"threshold_uncertainty_score":0.092650175},"labels":[],"label_agreement":null},{"id":"W2127112256","doi":"10.1109/pi.1999.806403","title":"On worst case analysis of permutation routing on data manipulators","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Time complexity; Routing (electronic design automation); Computer science; Upper and lower bounds; Computational complexity theory; Asymptotically optimal algorithm; Mathematics; Algorithm; Mathematical optimization","score_opus":0.06592905243281275,"score_gpt":0.29828028347111624,"score_spread":0.2323512310383035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127112256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09699008,0.0024063068,0.86407995,0.002754471,0.00021183639,0.0001918389,0.000527171,0.0011019692,0.031736378],"genre_scores_gemma":[0.837726,0.0019747962,0.14185274,0.0008084095,0.00049331196,0.00049102097,0.00084483624,0.00088588084,0.014922945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924124,0.002550515,0.00032904616,0.0013806176,0.0016079178,0.0017195236],"domain_scores_gemma":[0.96425605,0.029218866,0.0021669795,0.0021100095,0.0014965804,0.0007514583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065501253,0.002144216,0.0019595565,0.0018985693,0.002251468,0.0053090844,0.0035632674,0.0024263137,0.012828797],"category_scores_gemma":[0.030469723,0.0012713082,0.0020031102,0.002986964,0.0043348595,0.010373613,0.0026769992,0.0040868972,0.0014000656],"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.00075927656,0.00014716301,0.0013925177,0.00035238222,0.000111389774,0.0003486128,0.0002049997,0.8036845,0.0030600482,0.1608699,0.0046325778,0.024436668],"study_design_scores_gemma":[0.000030579595,0.00007324073,0.00017984095,0.000025739917,0.000045948767,0.00011512135,0.000056548302,0.8682661,0.0014046344,0.12827098,0.0015104252,0.0000207671],"about_ca_topic_score_codex":0.0043628686,"about_ca_topic_score_gemma":0.003958395,"teacher_disagreement_score":0.012828797,"about_ca_system_score_codex":0.0040141423,"about_ca_system_score_gemma":0.0023825841,"threshold_uncertainty_score":0.042916596},"labels":[],"label_agreement":null},{"id":"W2127431051","doi":"10.1109/ipdps.2008.4536467","title":"A linear solver for benchmarking partitioners","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Interconnection Networks and 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":"University of New Brunswick","funders":"","keywords":"Computer science; Graph partition; Benchmarking; Partition (number theory); Parallel computing; Solver; Workload; Benchmark (surveying); Graph; Theoretical computer science; Mathematics; Programming language","score_opus":0.032850772555789165,"score_gpt":0.2692368145060563,"score_spread":0.23638604195026713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127431051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1347528,0.001258435,0.73426455,0.0016176681,0.0007672693,0.001096324,0.009020941,0.050699145,0.06652291],"genre_scores_gemma":[0.28492033,0.0005508926,0.6858361,0.00042336216,0.00009359428,0.0012938473,0.014484683,0.00388883,0.008508324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966858,0.0011893499,0.00024688538,0.00032373125,0.0012142799,0.00033995535],"domain_scores_gemma":[0.99451774,0.0024889987,0.00029851563,0.00082289526,0.0016063087,0.00026553264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031469977,0.0016277318,0.00073874736,0.0014467314,0.00082700956,0.0015317147,0.002484618,0.0016121238,0.009514645],"category_scores_gemma":[0.0117292525,0.0005510941,0.00082327,0.0034384648,0.00074667693,0.0017274003,0.0014453207,0.0020172526,0.002134163],"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.00092635315,0.0011750249,0.004545284,0.0013166479,0.00020188723,0.00031467603,0.00044839896,0.58683836,0.018405402,0.069995746,0.10142449,0.2144078],"study_design_scores_gemma":[0.0003363715,0.00028919737,0.0006841056,0.00005364168,0.000026580754,0.00008333754,0.00014435474,0.94727695,0.014967427,0.011633472,0.024473434,0.000031151598],"about_ca_topic_score_codex":0.0064651524,"about_ca_topic_score_gemma":0.0063305385,"teacher_disagreement_score":0.009514645,"about_ca_system_score_codex":0.0012679066,"about_ca_system_score_gemma":0.0029709337,"threshold_uncertainty_score":0.031829715},"labels":[],"label_agreement":null},{"id":"W2127468091","doi":"10.1109/bsc.2006.1644641","title":"VLSI Design and Implementation of a High-Speed Multicast Switch Fabric","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Very-large-scale integration; Application-specific integrated circuit; Computer network; Unicast; Modular design; Interconnection; Multistage interconnection networks; Embedded system; Computer architecture; Operating system","score_opus":0.013862369377536028,"score_gpt":0.25135135453849394,"score_spread":0.23748898516095793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127468091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24134737,0.0016286558,0.71732867,0.00055133534,0.00039290753,0.00024312983,0.00025011663,0.0023535376,0.035904262],"genre_scores_gemma":[0.7591786,0.00050522026,0.23519395,0.00014847473,0.000094220246,0.00010069092,0.00021655667,0.00004956363,0.0045128805],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998927,0.00001296135,0.0000059663075,0.000016096805,0.000043745185,0.000028474873],"domain_scores_gemma":[0.99989533,0.000020938802,0.000014281691,0.0000138601235,0.00004524304,0.000010294381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015483717,0.00020166897,0.00013525717,0.00024571456,0.00021345932,0.0004869551,0.0007580662,0.00027601814,0.0021889596],"category_scores_gemma":[0.00019289895,0.00015549942,0.00018970639,0.00016641444,0.00013592457,0.00028971746,0.00014269422,0.00024517538,0.0005503312],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023584349,0.00017309528,0.0022075372,0.0003673721,0.00012565621,0.00043198056,0.00015325742,0.026849221,0.7058841,0.019753506,0.0045911353,0.23922732],"study_design_scores_gemma":[0.00039105,0.002578261,0.0064344103,0.00007904246,0.00032656098,0.0014782322,0.0001073837,0.35449016,0.52818704,0.0063954582,0.09947153,0.00006090635],"about_ca_topic_score_codex":0.0008110223,"about_ca_topic_score_gemma":0.0011933146,"teacher_disagreement_score":0.0021889596,"about_ca_system_score_codex":0.00042259286,"about_ca_system_score_gemma":0.00043659273,"threshold_uncertainty_score":0.0073227882},"labels":[],"label_agreement":null},{"id":"W2127941216","doi":"10.1109/ccece.1993.332410","title":"Input-output-buffered ATM switches with delayed backpressure mechanisms","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Queue; Computer science; SIGNAL (programming language); Control theory (sociology); Real-time computing; Value (mathematics); Control (management); Computer network; Artificial intelligence","score_opus":0.020578151953902574,"score_gpt":0.19434878511142237,"score_spread":0.17377063315751978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127941216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93702966,0.00078226626,0.05935266,0.000082251565,0.000116771,0.000049236816,0.00007803413,0.00034187752,0.00216729],"genre_scores_gemma":[0.9883123,0.00022616304,0.010638035,0.000023025921,0.000041253785,0.000013394255,0.00003755684,0.000010884167,0.0006975141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994492,0.00011937177,0.00003601432,0.00006791254,0.00021592402,0.00011162692],"domain_scores_gemma":[0.99892455,0.00054348324,0.00018071976,0.000110289446,0.0001840716,0.000056812652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000629993,0.00052756467,0.0003333007,0.00026288268,0.00035740054,0.0010049107,0.0013089366,0.0003339126,0.0011451194],"category_scores_gemma":[0.0016487389,0.00022758282,0.00022802288,0.00042172702,0.00042713198,0.0011396267,0.0004115314,0.00057426817,0.00010634822],"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.0036215307,0.0005888157,0.008160518,0.00057027244,0.00020511753,0.0009668875,0.00022035762,0.46372336,0.42444438,0.014997771,0.00086132553,0.08163971],"study_design_scores_gemma":[0.00012889973,0.0010424377,0.0021288933,0.000013018461,0.00013502922,0.00018486904,0.000032723412,0.8615029,0.13173285,0.0017440474,0.0013331964,0.000021029002],"about_ca_topic_score_codex":0.0015032114,"about_ca_topic_score_gemma":0.0014568786,"teacher_disagreement_score":0.0015032114,"about_ca_system_score_codex":0.0006949556,"about_ca_system_score_gemma":0.00044324342,"threshold_uncertainty_score":0.0050423145},"labels":[],"label_agreement":null},{"id":"W2127953020","doi":"10.1109/icc.1996.541267","title":"Efficient design of scalable shared-memory packet switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 British Columbia","funders":"","keywords":"Computer science; Banyan; Scalability; Multistage interconnection networks; Computer network; Packet switching; Bandwidth (computing); Network packet; Routing (electronic design automation); Buffer (optical fiber); Distributed computing; Telecommunications","score_opus":0.03750162167118042,"score_gpt":0.21718446749240086,"score_spread":0.17968284582122043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127953020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07821202,0.0004513208,0.9132113,0.00014312277,0.000040760704,0.00010023484,0.00013923956,0.0006304703,0.0070715128],"genre_scores_gemma":[0.84788007,0.00043527543,0.14888805,0.000047423473,0.000022447775,0.00020367999,0.00018332606,0.00005537607,0.0022844353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998586,0.000030976356,0.0000058471337,0.00002227841,0.00005780421,0.000024500549],"domain_scores_gemma":[0.9999149,0.000026518914,0.000011710064,0.000015638834,0.000022510905,0.00000874436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023676074,0.0003456733,0.0004018272,0.0001597836,0.00022442215,0.00046885,0.000929049,0.00027758122,0.001294315],"category_scores_gemma":[0.0005049488,0.0002143371,0.00020192756,0.00024641698,0.00023670362,0.00058365666,0.00040652117,0.00032933097,0.00018373656],"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.00006971607,0.000025438205,0.00030185017,0.00009862053,0.000024908008,0.00010895215,0.000032105,0.9009087,0.020921359,0.04358864,0.0010950054,0.032824744],"study_design_scores_gemma":[0.000010018991,0.000021083333,0.000042335556,0.0000026597656,0.0000052063665,0.000014792091,0.00000589656,0.9907884,0.0022363248,0.0058875615,0.0009839834,0.0000018173953],"about_ca_topic_score_codex":0.0006119183,"about_ca_topic_score_gemma":0.00093938695,"teacher_disagreement_score":0.001294315,"about_ca_system_score_codex":0.0005287913,"about_ca_system_score_gemma":0.00065883965,"threshold_uncertainty_score":0.00432992},"labels":[],"label_agreement":null},{"id":"W2128282831","doi":"10.1109/iv.2006.29","title":"Broadcasting in Optimal Bipartite Double Loop Graphs","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Bipartite graph; Vertex (graph theory); Combinatorics; Computer science; Complete bipartite graph; Graph; Algorithm; Discrete mathematics; Mathematics; Topology (electrical circuits)","score_opus":0.016526791523523817,"score_gpt":0.23176797476757774,"score_spread":0.21524118324405392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128282831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71283853,0.0007573695,0.26245084,0.000588974,0.0000381884,0.00010025958,0.00084807206,0.00067655963,0.021701265],"genre_scores_gemma":[0.9519204,0.00051073974,0.041226264,0.00014142442,0.000039124443,0.00009980835,0.0011336575,0.00012105476,0.0048075956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930155,0.00019573321,0.000029709649,0.00014750024,0.00014684114,0.00017861833],"domain_scores_gemma":[0.998445,0.00070621265,0.0002854873,0.00016039315,0.00022985801,0.00017305824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005113271,0.00026654243,0.00046225046,0.0006995761,0.00074815203,0.0009855166,0.0005718812,0.0005416498,0.00211973],"category_scores_gemma":[0.0034187473,0.00038194147,0.00027883906,0.0010015344,0.00069502176,0.00153774,0.0007621043,0.00045920172,0.00034157108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014097489,0.00024742793,0.0037747168,0.00041805205,0.000062736726,0.00038468087,0.0006211185,0.40465316,0.036413446,0.45830947,0.01224067,0.08146476],"study_design_scores_gemma":[0.0001441125,0.00019581961,0.0016783902,0.00004501957,0.0000353716,0.00027760086,0.00027525818,0.5587895,0.008728317,0.42008108,0.0097118085,0.00003778456],"about_ca_topic_score_codex":0.0032000062,"about_ca_topic_score_gemma":0.0025760368,"teacher_disagreement_score":0.0032000062,"about_ca_system_score_codex":0.0015719075,"about_ca_system_score_gemma":0.00075983745,"threshold_uncertainty_score":0.011405051},"labels":[],"label_agreement":null},{"id":"W2128290386","doi":"10.1109/ipps.1992.222969","title":"The odd-even expansion storage scheme and its implementation issues","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Alberta","funders":"","keywords":"Scheme (mathematics); Computer science; Routing (electronic design automation); Simple (philosophy); Hypercube; Diagonal; Realization (probability); Power of two; Constant (computer programming); Row and column spaces; Row; Cover (algebra); Parallel computing; Algorithm; Computer network; Mathematics","score_opus":0.019138254531911713,"score_gpt":0.2913215435581634,"score_spread":0.2721832890262517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128290386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07453971,0.0009521307,0.8861605,0.0011924687,0.0003256079,0.0001614288,0.00016905853,0.0019159327,0.034583174],"genre_scores_gemma":[0.48405227,0.00094287307,0.48508304,0.0003359067,0.00014232981,0.00023515348,0.00027603147,0.00024779243,0.028684514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996743,0.00006967724,0.000032697797,0.00004687649,0.000107735905,0.00006872186],"domain_scores_gemma":[0.9994535,0.000083049985,0.00003311389,0.0002861632,0.00012107707,0.000023135193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043137194,0.00029272857,0.00029359947,0.00036428502,0.0006121738,0.0011906005,0.001301982,0.00032924654,0.0064824903],"category_scores_gemma":[0.0009997787,0.00027347176,0.00020825765,0.0007652343,0.00068251137,0.0030537972,0.00084141956,0.0005153782,0.0014134598],"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.00051739643,0.00009213878,0.00090272375,0.000243604,0.000022071335,0.00019751994,0.00044590724,0.016969975,0.050306197,0.51404935,0.009948092,0.40630504],"study_design_scores_gemma":[0.00017498658,0.00043160602,0.0010878937,0.00010732213,0.000051304094,0.0012650691,0.0004310879,0.29907987,0.20128146,0.29413047,0.20184304,0.00011591873],"about_ca_topic_score_codex":0.001449676,"about_ca_topic_score_gemma":0.0012699105,"teacher_disagreement_score":0.0064824903,"about_ca_system_score_codex":0.0006947407,"about_ca_system_score_gemma":0.0009158197,"threshold_uncertainty_score":0.021686077},"labels":[],"label_agreement":null},{"id":"W2128537388","doi":"10.1109/spdp.1993.395464","title":"Optimal communication algorithms on the star interconnection network","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"Instituto de Telecomunicações","keywords":"Interconnection; Star (game theory); Node (physics); Computer science; Star network; Link (geometry); Computer network; Telecommunications network; A* search algorithm; Algorithm; Theoretical computer science; Distributed computing; Network topology; Topology (electrical circuits); Mathematics; Combinatorics; Engineering","score_opus":0.03584981227663083,"score_gpt":0.2278909888305391,"score_spread":0.19204117655390826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128537388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03333058,0.00048532645,0.956115,0.00050381914,0.000050441115,0.000056395067,0.00009306624,0.00034704123,0.009018265],"genre_scores_gemma":[0.51337975,0.0011912661,0.47436494,0.00029097672,0.000120719786,0.00036133055,0.00050005096,0.00024658468,0.0095444145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882025,0.00044531352,0.000059725142,0.00024349283,0.00023944046,0.00019169474],"domain_scores_gemma":[0.9971523,0.0019448448,0.00023543923,0.00023138316,0.0003217039,0.00011423359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590795,0.0007507374,0.0010875092,0.00081862404,0.00084450154,0.0015236862,0.0012304444,0.0013447048,0.0038341626],"category_scores_gemma":[0.006052996,0.00049616955,0.00049957744,0.0014774316,0.0011539579,0.0028517162,0.0016820586,0.00094129134,0.0006171671],"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.00013171331,0.000058557955,0.00026215563,0.000100473015,0.000020332343,0.00004019428,0.00017957155,0.78469825,0.0007354125,0.15907522,0.004660427,0.05003775],"study_design_scores_gemma":[0.00003766732,0.000027620228,0.00005336621,0.000007372987,0.000004956187,0.000017171933,0.000038400354,0.892653,0.000304152,0.105528004,0.0013223528,0.000005978223],"about_ca_topic_score_codex":0.0031665678,"about_ca_topic_score_gemma":0.0025287154,"teacher_disagreement_score":0.0038341626,"about_ca_system_score_codex":0.0016722096,"about_ca_system_score_gemma":0.0017766561,"threshold_uncertainty_score":0.012826562},"labels":[],"label_agreement":null},{"id":"W2129006062","doi":"10.1109/ccece.1993.332352","title":"Overflow control in multicast networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Multicast; Computer science; Computer network; FIFO (computing and electronics); Protocol Independent Multicast; Distributed computing; Source-specific multicast; Network packet; Throughput; Pragmatic General Multicast; Queue; Operating system","score_opus":0.014303364079814349,"score_gpt":0.2014767225863346,"score_spread":0.18717335850652023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129006062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06865686,0.004248883,0.9160114,0.0006949701,0.00032456376,0.00010137908,0.00006198219,0.0010684299,0.0088315355],"genre_scores_gemma":[0.9212875,0.0010997554,0.07369592,0.00028924545,0.00032882125,0.000091800015,0.000050911225,0.000065356966,0.0030907267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879587,0.00041045668,0.00007520333,0.00015683529,0.0003927703,0.00016881085],"domain_scores_gemma":[0.99826056,0.0009442294,0.00020392302,0.00020481175,0.00028841494,0.00009796321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020695315,0.00046293705,0.00057091477,0.00070973736,0.0011516387,0.001348221,0.0011572802,0.00082123006,0.0015195813],"category_scores_gemma":[0.006246783,0.00026407416,0.00029822078,0.0006314667,0.0010209248,0.0023340087,0.0016258399,0.00086062995,0.00017337082],"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.00087217323,0.00015088331,0.0026986154,0.0004936429,0.00010584607,0.00057788123,0.00082061614,0.2412962,0.037048772,0.339793,0.009168047,0.3669743],"study_design_scores_gemma":[0.00006441312,0.00016758767,0.0004275642,0.00004790202,0.000065116175,0.00021742396,0.000069683665,0.8598224,0.013811677,0.114148624,0.011116511,0.00004108264],"about_ca_topic_score_codex":0.0017607464,"about_ca_topic_score_gemma":0.0013450544,"teacher_disagreement_score":0.0020695315,"about_ca_system_score_codex":0.001415636,"about_ca_system_score_gemma":0.0007708009,"threshold_uncertainty_score":0.010944843},"labels":[],"label_agreement":null},{"id":"W2129096864","doi":"10.1007/978-94-007-1125-9_10","title":"MpAssign: A Framework for Solving the Many-Core Platform Mapping Problem","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Heuristics; Distributed computing; Context (archaeology); Evolutionary algorithm; Many core; Core (optical fiber); Architecture; Theoretical computer science; Parallel computing; Artificial intelligence","score_opus":0.09382994263407259,"score_gpt":0.2542815642784419,"score_spread":0.16045162164436932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129096864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017401419,0.00028060356,0.98743045,0.00019285288,0.00010376869,0.00005223538,0.00007582018,0.001497254,0.008626769],"genre_scores_gemma":[0.051626068,0.0006332054,0.93634874,0.00016896326,0.00007540005,0.00024682394,0.00030679267,0.00068088237,0.009912995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00010301342,0.000016426144,0.0000527214,0.00014370056,0.000056412795],"domain_scores_gemma":[0.9997485,0.00009666605,0.000015729951,0.00007310626,0.00004630535,0.000019605497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006497267,0.0013683302,0.00082989444,0.00052611565,0.00094553793,0.0014222425,0.0025338312,0.0012814153,0.012213388],"category_scores_gemma":[0.0016203113,0.00060515676,0.0010616062,0.0008652869,0.00077675993,0.0021287824,0.0021863824,0.0030848458,0.0035140421],"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.00008911657,0.00009905548,0.00024970298,0.0005596912,0.000072735376,0.00018547132,0.00014702736,0.20830376,0.0062773917,0.33651856,0.04227698,0.40522048],"study_design_scores_gemma":[0.000037946196,0.00003758958,0.00009285419,0.000057454195,0.000023910945,0.00015987117,0.000049339567,0.58053124,0.0039472636,0.36454993,0.050490055,0.000022532238],"about_ca_topic_score_codex":0.0021018141,"about_ca_topic_score_gemma":0.004198028,"teacher_disagreement_score":0.012213388,"about_ca_system_score_codex":0.0004646914,"about_ca_system_score_gemma":0.0013589652,"threshold_uncertainty_score":0.04085785},"labels":[],"label_agreement":null},{"id":"W2129464866","doi":"10.1109/pacrim.1989.48327","title":"A mesh-like array processor with fully connected rows and columns","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Simon Fraser University","funders":"","keywords":"Row; Interconnection; Computer science; Diagonal; Parallel computing; Row and column spaces; Node (physics); Bandwidth (computing); Column (typography); Very-large-scale integration; Embedded system; Computer network; Mathematics; Engineering","score_opus":0.007705003486400694,"score_gpt":0.1920300041681733,"score_spread":0.18432500068177263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129464866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037574034,0.00041396669,0.9382307,0.00032088967,0.00035844764,0.00010696633,0.000502345,0.0055116136,0.016981093],"genre_scores_gemma":[0.2034575,0.00031918712,0.7786483,0.00027210973,0.00009231415,0.00023699699,0.0010471853,0.00017933168,0.01574713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99990094,0.000016754855,0.000009383845,0.000024606754,0.000031261236,0.000016990249],"domain_scores_gemma":[0.99984086,0.000023296649,0.000013727587,0.000046022258,0.000056779743,0.000019334351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010024117,0.0002599452,0.00033770743,0.0002886857,0.00029334877,0.00058703497,0.0012920303,0.00045165105,0.0070419395],"category_scores_gemma":[0.00030826606,0.00020429233,0.00037831732,0.0005554037,0.00021826162,0.0008540603,0.0006659301,0.0003629359,0.0021291098],"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.00056566345,0.00017916605,0.001646589,0.0005592799,0.00017763991,0.0007237886,0.00018387282,0.07544018,0.23180217,0.07899562,0.044205364,0.56552064],"study_design_scores_gemma":[0.00023225605,0.001306066,0.0016246814,0.00006331858,0.00019751186,0.0014090557,0.00010776175,0.7044567,0.104677945,0.03295973,0.1528394,0.00012557206],"about_ca_topic_score_codex":0.0008651595,"about_ca_topic_score_gemma":0.0014204957,"teacher_disagreement_score":0.0070419395,"about_ca_system_score_codex":0.00026146864,"about_ca_system_score_gemma":0.0003700587,"threshold_uncertainty_score":0.023557603},"labels":[],"label_agreement":null},{"id":"W2129470935","doi":"10.1109/isqed.2011.5770788","title":"ERAVC: Enhanced reliability aware NoC router","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Retransmission; Router; Network on a chip; Virtual channel; Computer science; Redundancy (engineering); Latency (audio); Embedded system; Network packet; Reliability (semiconductor); Energy consumption; Fault tolerance; Computer network; Engineering; Channel (broadcasting); Distributed computing","score_opus":0.02670110769862937,"score_gpt":0.2156677374220231,"score_spread":0.18896662972339373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129470935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28228122,0.007488184,0.642959,0.0005989622,0.00095277466,0.00036071177,0.000606159,0.028295374,0.03645764],"genre_scores_gemma":[0.76642555,0.0010491795,0.21505202,0.0003039104,0.00011557942,0.0001180013,0.0008222258,0.00020904315,0.015904576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996946,0.000052902113,0.000018437244,0.000055107685,0.00012297905,0.000055944765],"domain_scores_gemma":[0.9996524,0.000039491693,0.00004038089,0.000066746776,0.00017709113,0.000023907714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026450478,0.00034842052,0.00031139652,0.0006572307,0.00018623215,0.00046961286,0.00113365,0.0004895488,0.002045833],"category_scores_gemma":[0.00058826467,0.00018516571,0.00018341746,0.00035926196,0.00012622435,0.0005334426,0.00035557823,0.00036457722,0.0005741819],"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.00091381144,0.00022993854,0.003117097,0.00058276125,0.00012649474,0.00086366164,0.00008272067,0.14165436,0.27254358,0.01356493,0.027653519,0.5386671],"study_design_scores_gemma":[0.00016318254,0.0010225249,0.0029910556,0.000056351375,0.00015637836,0.0015397618,0.000033562923,0.811576,0.119163446,0.0025552693,0.06066681,0.00007574175],"about_ca_topic_score_codex":0.0008907146,"about_ca_topic_score_gemma":0.0019330464,"teacher_disagreement_score":0.002045833,"about_ca_system_score_codex":0.00032444266,"about_ca_system_score_gemma":0.0004978466,"threshold_uncertainty_score":0.0068440437},"labels":[],"label_agreement":null},{"id":"W2129515205","doi":"10.1109/glocom.1991.188682","title":"A comparative study of shuffle-exchange, Manhattan street and supercube network for lightwave applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de Recherche du Québec - Santé","keywords":"Interconnection; Computer science; Network topology; Computer network; Graph; Topology (electrical circuits); Network simulation; Graph theory; Network analysis; Theoretical computer science; Distributed computing; Engineering; Mathematics","score_opus":0.05364002113077332,"score_gpt":0.28009711768149487,"score_spread":0.22645709655072155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129515205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93409306,0.0020850422,0.037904833,0.00046984933,0.000081758684,0.00012461124,0.000393695,0.0003770315,0.024470208],"genre_scores_gemma":[0.9816996,0.001005123,0.013785795,0.000042967757,0.000028513063,0.000040639563,0.00039550944,0.00003264048,0.00296927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.00016371807,0.000015738524,0.000040740175,0.00012480721,0.00007102022],"domain_scores_gemma":[0.9972005,0.0015542721,0.00017587679,0.00018999829,0.0007689169,0.00011041243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008238107,0.00026532463,0.00026488333,0.001468854,0.0005110976,0.0006617031,0.00041291537,0.00031765076,0.0026843192],"category_scores_gemma":[0.0032808618,0.000099663375,0.0001879194,0.0019403793,0.00025733403,0.0017291156,0.00025111088,0.00019011744,0.00018984282],"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.0016778093,0.00034131168,0.018254558,0.00054820545,0.00018276338,0.0006612961,0.00047116147,0.6423393,0.022311704,0.07155679,0.012525006,0.22913006],"study_design_scores_gemma":[0.000045445384,0.0012949229,0.009732984,0.000038421564,0.00010505328,0.0004961678,0.0005418136,0.9495067,0.016015705,0.01059863,0.011584297,0.00003990542],"about_ca_topic_score_codex":0.0058178217,"about_ca_topic_score_gemma":0.0081712175,"teacher_disagreement_score":0.0058178217,"about_ca_system_score_codex":0.0012484025,"about_ca_system_score_gemma":0.00040628485,"threshold_uncertainty_score":0.01156795},"labels":[],"label_agreement":null},{"id":"W2129800463","doi":"10.1109/aiccsa.2006.205118","title":"Architecture and Performance Analysis of the Multicast Balanced Gamma Switch for Broadband Communications1","year":2006,"lang":"en","type":"article","venue":"IEEE International Conference on Computer Systems and Applications, 2006.","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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Unicast; Xcast; Source-specific multicast; Crossover switch; Protocol Independent Multicast; Broadband; Distributed computing; Crossbar switch; Telecommunications","score_opus":0.026296364505163837,"score_gpt":0.2675626157563001,"score_spread":0.24126625125113624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129800463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79655,0.00036598614,0.19390035,0.00012533854,0.000022616872,0.000036414523,0.00010654604,0.0005608975,0.008331801],"genre_scores_gemma":[0.99089164,0.000060756876,0.00817312,0.0000129874325,0.000007188338,0.000009583093,0.000057879708,0.000010735103,0.0007761432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998336,0.000047743277,0.00000420149,0.000020453856,0.000055827873,0.000038214184],"domain_scores_gemma":[0.9998047,0.00006866976,0.000020691325,0.000018039016,0.00007504654,0.000012858506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325184,0.0002998175,0.00015993298,0.00034546523,0.00025121003,0.000463455,0.00030982294,0.00018936247,0.0016343023],"category_scores_gemma":[0.0003689646,0.0001085846,0.0001274534,0.00020651046,0.00017068503,0.00034193907,0.000171757,0.00018121063,0.00017292933],"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.0016741306,0.00018515435,0.015564324,0.00012185943,0.000091445276,0.0004278005,0.00020743642,0.47286803,0.40010816,0.027899304,0.0027172992,0.07813503],"study_design_scores_gemma":[0.000020320029,0.00036837303,0.0020532685,0.000004667629,0.000022440307,0.0001489325,0.000019760562,0.9593046,0.03397582,0.0028735101,0.0012005043,0.000007852822],"about_ca_topic_score_codex":0.0012491256,"about_ca_topic_score_gemma":0.0007409556,"teacher_disagreement_score":0.0016343023,"about_ca_system_score_codex":0.00080350303,"about_ca_system_score_gemma":0.00032618502,"threshold_uncertainty_score":0.005829811},"labels":[],"label_agreement":null},{"id":"W2130150993","doi":"10.1109/tpds.2006.34","title":"Efficient algorithms for minimum congestion hypergraph embedding in a cycle","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","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":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Algorithm; Node (physics); Computational complexity theory; Approximation algorithm; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Time complexity; Mathematics; Discrete mathematics","score_opus":0.015379917932781342,"score_gpt":0.24755556444552337,"score_spread":0.23217564651274203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130150993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041942526,0.0007260432,0.9468988,0.00043959662,0.0000752229,0.00028975567,0.0003468556,0.0029290307,0.006352044],"genre_scores_gemma":[0.19709587,0.00046253117,0.7963168,0.00009444489,0.00004151711,0.00036778598,0.001248043,0.00035279564,0.0040202425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00024459165,0.00006533335,0.00020434758,0.00024272593,0.00017389524],"domain_scores_gemma":[0.99844605,0.000642052,0.00017837336,0.00037203438,0.00026453746,0.00009690253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676701,0.0011802398,0.0010521851,0.0014884114,0.0008025886,0.0015453765,0.0016436998,0.0012001342,0.0061179404],"category_scores_gemma":[0.0041767824,0.00071077736,0.0007363721,0.0022657907,0.00062602706,0.003553208,0.0023466172,0.0012604888,0.0012719053],"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.0004621517,0.00029540044,0.0011403619,0.00045989465,0.00008528718,0.00016671847,0.00040096891,0.38072765,0.01013762,0.076293156,0.019920968,0.5099098],"study_design_scores_gemma":[0.00011441865,0.0000718335,0.000230821,0.000028548222,0.000022117043,0.0001202644,0.00012246144,0.91110367,0.0038371256,0.07792909,0.0063976864,0.000021984959],"about_ca_topic_score_codex":0.0033505843,"about_ca_topic_score_gemma":0.004502552,"teacher_disagreement_score":0.0061179404,"about_ca_system_score_codex":0.0014237942,"about_ca_system_score_gemma":0.0017508726,"threshold_uncertainty_score":0.020466566},"labels":[],"label_agreement":null},{"id":"W2130363857","doi":"10.1109/icdcs.1989.37942","title":"Fault-tolerant extensions of complete multipartite networks","year":2003,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Multipartite; Graph; Computer science; Fault tolerance; Exponential function; Extension (predicate logic); Discrete mathematics; Theoretical computer science; Mathematics; Combinatorics; Distributed computing; Quantum","score_opus":0.025859700481699652,"score_gpt":0.23330939425339636,"score_spread":0.2074496937716967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130363857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49033323,0.00070771744,0.49993974,0.00025693502,0.000058175374,0.000108989916,0.00017326731,0.00017122483,0.008250794],"genre_scores_gemma":[0.91311306,0.00035508058,0.08122197,0.00009425439,0.000040508705,0.000096635435,0.0001757478,0.000050692364,0.0048522167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00006790365,0.0000114289805,0.000050772975,0.000043385207,0.000035239715],"domain_scores_gemma":[0.9992687,0.00032164014,0.00011662105,0.0000983117,0.00010945854,0.00008527591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042178915,0.00037280805,0.00031691423,0.00031883162,0.0003752822,0.0003605615,0.00042523694,0.0003048861,0.0012309168],"category_scores_gemma":[0.0019307138,0.0002599303,0.00040920314,0.00032162905,0.0004281148,0.0011847471,0.0006641178,0.0005558583,0.0001221188],"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.0003917281,0.000120575554,0.0012046546,0.00023737267,0.00006493767,0.0002876261,0.00032385337,0.76799816,0.034123614,0.12032571,0.0017920352,0.0731298],"study_design_scores_gemma":[0.000045894685,0.00046358266,0.0010290492,0.000043772598,0.000044544086,0.0002480232,0.00012705738,0.83847946,0.015899535,0.13269049,0.010893784,0.000034776396],"about_ca_topic_score_codex":0.00038896294,"about_ca_topic_score_gemma":0.000661752,"teacher_disagreement_score":0.0012309168,"about_ca_system_score_codex":0.00037414805,"about_ca_system_score_gemma":0.00024035877,"threshold_uncertainty_score":0.0041178465},"labels":[],"label_agreement":null},{"id":"W2130820665","doi":"10.1109/micro.2010.50","title":"Throughput-Effective On-Chip Networks for Manycore Accelerators","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":161,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dram; Parallel computing; Throughput; Network on a chip; Router; Embedded system; Bandwidth (computing); Cache; Memory bandwidth; Chip; Computer hardware; Computer network; Operating system; Wireless","score_opus":0.01646543584706128,"score_gpt":0.2615666678568878,"score_spread":0.24510123200982653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130820665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6207971,0.002616038,0.35772687,0.0007081807,0.00015797159,0.00008426219,0.00013561755,0.0013422527,0.016431672],"genre_scores_gemma":[0.9584582,0.00039238617,0.03922704,0.00007369266,0.000019956717,0.00003051036,0.00007321261,0.000071458904,0.0016535206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997539,0.00007685624,0.000009862238,0.000026403115,0.00008346566,0.00004955109],"domain_scores_gemma":[0.99948126,0.00021334078,0.00009454895,0.00008107115,0.00009772737,0.000032058986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722828,0.0003362592,0.00023439,0.00023296365,0.00026957656,0.0005307885,0.0005859868,0.00025191854,0.0014294895],"category_scores_gemma":[0.0011522169,0.00017449126,0.00016204828,0.0002660278,0.00029431022,0.0008326204,0.00035721765,0.00030660708,0.00014501192],"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.00027291363,0.00011809122,0.0022634456,0.0002177198,0.00004972573,0.00011667758,0.00007139421,0.8600675,0.052350566,0.015702805,0.0023227688,0.06644639],"study_design_scores_gemma":[0.000017789118,0.00021895008,0.0009626998,0.0000105841755,0.000029296843,0.000040087136,0.000042955326,0.97430396,0.015742112,0.0058662575,0.002754983,0.000010357586],"about_ca_topic_score_codex":0.0013904282,"about_ca_topic_score_gemma":0.0040024826,"teacher_disagreement_score":0.0014294895,"about_ca_system_score_codex":0.00090872473,"about_ca_system_score_gemma":0.00061761466,"threshold_uncertainty_score":0.0065932274},"labels":[],"label_agreement":null},{"id":"W2131745302","doi":"10.1109/tbc.2008.2007455","title":"Internet Multicasting of IPTV With Essentially-Zero Delay Jitter","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Multicast; Computer science; Jitter; IPTV; Router; Optical IP Switching; Network packet; End-to-end delay; Real-time computing; Internet Protocol; The Internet; Telecommunications; Operating system","score_opus":0.0224588079182566,"score_gpt":0.23452490246981958,"score_spread":0.21206609455156297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131745302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88677746,0.00026774956,0.0981632,0.00031142528,0.000034139142,0.00007256658,0.00007750617,0.000264815,0.014031124],"genre_scores_gemma":[0.99302495,0.0000827635,0.0061750403,0.000021322363,0.0000049879945,0.00002685101,0.00003158932,0.000010920162,0.0006216081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998264,0.000061947845,0.000004088191,0.000010761154,0.00006368223,0.000033234275],"domain_scores_gemma":[0.999567,0.00028039343,0.000038380596,0.000031483854,0.000057791374,0.000024931729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000387937,0.00023683411,0.00032739385,0.00019822427,0.00038713016,0.00040109045,0.00042266378,0.0005183887,0.0006853702],"category_scores_gemma":[0.0018308844,0.00014660509,0.0002539309,0.00023085314,0.00042004316,0.0008299616,0.00026442384,0.00038273094,0.000071010196],"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.00008770967,0.000048232934,0.001211921,0.000034989524,0.00001551301,0.00017663414,0.000048769296,0.9780767,0.0052067167,0.010350804,0.00029246346,0.0044494774],"study_design_scores_gemma":[0.000027815388,0.00006890739,0.0002771362,0.000002951571,0.000006943714,0.000042491294,0.000013768774,0.9956118,0.0013136566,0.0022612845,0.00036876596,0.0000044805493],"about_ca_topic_score_codex":0.0031500044,"about_ca_topic_score_gemma":0.0014866854,"teacher_disagreement_score":0.0031500044,"about_ca_system_score_codex":0.00076210976,"about_ca_system_score_gemma":0.0004647122,"threshold_uncertainty_score":0.0062633753},"labels":[],"label_agreement":null},{"id":"W2131775127","doi":"10.1109/icc.1994.368781","title":"Distributed multicast contention resolution using content addressable FIFOs","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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; Blocking (statistics); Multicast; Computer network; Latency (audio); FIFO (computing and electronics); Stencil; HOL; Overhead (engineering); Reservation; Distributed computing; Parallel computing; Computer hardware; Operating system; Telecommunications; Programming language","score_opus":0.1887301468087545,"score_gpt":0.2606104792359532,"score_spread":0.07188033242719871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131775127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027298033,0.002888351,0.960595,0.00033402676,0.00035850896,0.00012480578,0.000052951127,0.0012776394,0.0070707733],"genre_scores_gemma":[0.5637823,0.0014833623,0.42299175,0.0002544581,0.00047834046,0.00024039259,0.00019303491,0.00013606438,0.010440356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947065,0.00015769033,0.00004395345,0.00007102273,0.00020612094,0.000050516883],"domain_scores_gemma":[0.9987087,0.00064832106,0.00008947389,0.0001894838,0.00030889738,0.000055011667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201237,0.0004107158,0.00041410764,0.0010687562,0.0007785933,0.0011486133,0.0015062805,0.0006554614,0.0021051292],"category_scores_gemma":[0.0023948755,0.000239358,0.00035380878,0.00057599763,0.0003737935,0.0014646581,0.00059195457,0.00050369336,0.00030810974],"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.0011707483,0.00025328447,0.0020071238,0.00042158776,0.00016535992,0.0004478507,0.00068179134,0.047594782,0.063414425,0.11939632,0.011712782,0.752734],"study_design_scores_gemma":[0.00054632063,0.00071155385,0.000917566,0.0001271725,0.00030128538,0.0007008443,0.00016965998,0.7155918,0.11018983,0.05281584,0.11783604,0.00009208643],"about_ca_topic_score_codex":0.0010508157,"about_ca_topic_score_gemma":0.0009871922,"teacher_disagreement_score":0.0021051292,"about_ca_system_score_codex":0.001020619,"about_ca_system_score_gemma":0.0005360112,"threshold_uncertainty_score":0.007405162},"labels":[],"label_agreement":null},{"id":"W2131906162","doi":"10.1109/icdcs.1990.89258","title":"Performance evaluation of the backtrack-to-the-origin-and retry routing for hypercycle-based interconnection networks","year":2002,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Interconnection; Computer science; Routing (electronic design automation); Router; Block (permutation group theory); Degree (music); Class (philosophy); Theoretical computer science; Computer network; Topology (electrical circuits); Distributed computing; Mathematics; Combinatorics","score_opus":0.04980466831571903,"score_gpt":0.2600378284650948,"score_spread":0.2102331601493758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131906162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9243483,0.001603457,0.057147156,0.00036664997,0.00013507904,0.00019647305,0.00031609883,0.0024818883,0.013404811],"genre_scores_gemma":[0.9828304,0.00028078657,0.01508927,0.000034850917,0.000011476797,0.000039686685,0.00028201356,0.00005747611,0.0013740415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892694,0.00040901036,0.00006305309,0.00013553504,0.0002937622,0.00017176899],"domain_scores_gemma":[0.9962649,0.0018678459,0.00029213622,0.00036472478,0.00096793904,0.00024251669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015247966,0.0008713881,0.00056553085,0.00094626076,0.0005765282,0.0008839639,0.0011109081,0.0006435365,0.0022218663],"category_scores_gemma":[0.004062205,0.00015273833,0.00021564655,0.0010104164,0.00053179974,0.0014052894,0.00055725244,0.00036339933,0.00033065895],"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.0013550506,0.00032332077,0.0032557473,0.00027465142,0.00011855801,0.00014488207,0.00013304678,0.8949393,0.013733254,0.004606682,0.0035738738,0.077541634],"study_design_scores_gemma":[0.00003647781,0.0008306964,0.0005828626,0.00001051837,0.000022151786,0.00005684247,0.000040670195,0.9856377,0.011559604,0.00064840936,0.00055688387,0.00001722439],"about_ca_topic_score_codex":0.005596067,"about_ca_topic_score_gemma":0.0045584263,"teacher_disagreement_score":0.005596067,"about_ca_system_score_codex":0.0019666185,"about_ca_system_score_gemma":0.0006426071,"threshold_uncertainty_score":0.014268935},"labels":[],"label_agreement":null},{"id":"W2131922657","doi":"10.1109/fmpc.1992.234863","title":"Routing algorithms on a mesh-connected computer","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Calgary","funders":"","keywords":"Computer science; Queue; Sorting; Routing (electronic design automation); Algorithm; Sorting algorithm; Parallel computing; Computer network","score_opus":0.018231217096129668,"score_gpt":0.2318996016848249,"score_spread":0.21366838458869525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131922657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020305153,0.0016949278,0.94616127,0.0008877242,0.0002973243,0.00016061774,0.00019633597,0.0025888323,0.027707754],"genre_scores_gemma":[0.20291114,0.0019041772,0.77147293,0.00028879827,0.00015337857,0.00033869813,0.00061500334,0.00037183677,0.021944072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995173,0.00011003038,0.0000346153,0.00010208087,0.00017447838,0.000061468265],"domain_scores_gemma":[0.99933666,0.00024350098,0.000048058188,0.00014696369,0.00019699572,0.00002784675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038997096,0.0005851625,0.00045101906,0.0011039501,0.0009576898,0.0014137177,0.0013172074,0.0010319769,0.009843055],"category_scores_gemma":[0.0020697874,0.00038114926,0.00060468976,0.0017784348,0.0005493715,0.0019779492,0.0012537158,0.0007582042,0.0019022768],"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.0001274994,0.00006375532,0.00053559185,0.00027994427,0.00005592093,0.00011247672,0.00017237494,0.33158198,0.0055220276,0.24676438,0.019003129,0.39578095],"study_design_scores_gemma":[0.00007694605,0.0000574802,0.00023167746,0.000048418227,0.000027704938,0.00012351689,0.00006454123,0.6943018,0.004342062,0.24804242,0.052661918,0.000021585847],"about_ca_topic_score_codex":0.0026277595,"about_ca_topic_score_gemma":0.0027904105,"teacher_disagreement_score":0.009843055,"about_ca_system_score_codex":0.0013376564,"about_ca_system_score_gemma":0.00089920516,"threshold_uncertainty_score":0.032928288},"labels":[],"label_agreement":null},{"id":"W2131978583","doi":"10.1145/1289816.1289874","title":"Reliable multiprocessor system-on-chip synthesis","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":48,"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":"MPSoC; Multiprocessing; Floorplan; Computer science; Redundancy (engineering); Scheduling (production processes); Parallel computing; Schedule; System on a chip; High-level synthesis; Embedded system; Mean time between failures; Job shop scheduling; Multiprocessor scheduling; Chip; Field-programmable gate array; Failure rate; Reliability engineering; Engineering; Mathematical optimization; Routing (electronic design automation); Mathematics","score_opus":0.015303863865532166,"score_gpt":0.23217807947215738,"score_spread":0.2168742156066252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131978583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016391108,0.00063360925,0.97264963,0.0001441586,0.00009108294,0.00014720405,0.00015008649,0.0019832873,0.0078098704],"genre_scores_gemma":[0.28508133,0.0005768999,0.7097524,0.00009309191,0.00004567757,0.0003548042,0.000313533,0.0003184396,0.0034638166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943644,0.00012358042,0.000030326884,0.000077545585,0.00025836303,0.00007365235],"domain_scores_gemma":[0.9994721,0.00016784649,0.0000593585,0.00013630539,0.00014692279,0.00001753906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059018703,0.0005735029,0.0004927966,0.00044023682,0.00035967852,0.0005162162,0.00088242517,0.000378057,0.0023828142],"category_scores_gemma":[0.0014183201,0.00035065998,0.000496315,0.0003392206,0.00028605442,0.0004816302,0.00046234304,0.0005023324,0.0006153355],"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.00007223459,0.000045222783,0.00044324528,0.0003461802,0.00005440305,0.00018167066,0.000083776096,0.7772283,0.04073235,0.043038834,0.0036888665,0.13408494],"study_design_scores_gemma":[0.000041360967,0.00010917864,0.00014593938,0.000026727757,0.000033746637,0.000071287825,0.000015047863,0.95764923,0.018605437,0.012010305,0.011279979,0.000011759232],"about_ca_topic_score_codex":0.0010562208,"about_ca_topic_score_gemma":0.002317449,"teacher_disagreement_score":0.0023828142,"about_ca_system_score_codex":0.0004943329,"about_ca_system_score_gemma":0.0012422423,"threshold_uncertainty_score":0.007971287},"labels":[],"label_agreement":null},{"id":"W2132293592","doi":"10.1109/ccece.1993.332262","title":"Performance of FDDI used in network interconnections","year":2002,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Fiber Distributed Data Interface; Token ring; File transfer; Computer science; Computer network; Security token; Network packet; Transmission (telecommunications); Transfer (computing); Service (business); Ring (chemistry); Theoretical computer science; Local area network; Operating system; Telecommunications","score_opus":0.02557216108546925,"score_gpt":0.21315343056506147,"score_spread":0.18758126947959222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132293592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98079133,0.0006861482,0.013831096,0.00009924669,0.000049041308,0.00001395791,0.000108501576,0.00036204673,0.004058797],"genre_scores_gemma":[0.99704045,0.00010362744,0.0021219815,0.000012632174,0.0000054849033,0.00000489658,0.0000798493,0.000009827303,0.0006212433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995135,0.00009604794,0.000025699459,0.00006912474,0.00015029032,0.00014535358],"domain_scores_gemma":[0.99810433,0.0009185435,0.00019033616,0.00028164865,0.00042169992,0.0000833595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066755083,0.00041293527,0.00030141504,0.0004747988,0.00054555474,0.00071256276,0.0006468688,0.00048668525,0.0016687616],"category_scores_gemma":[0.002836066,0.00013447322,0.00011545591,0.0009414451,0.00036975156,0.00077325775,0.00034597266,0.00024779522,0.00028785516],"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.00403755,0.00042883385,0.030683842,0.0007351291,0.00015741274,0.00085871154,0.0006548246,0.5598142,0.21054444,0.010435003,0.0051022717,0.17654774],"study_design_scores_gemma":[0.00008101922,0.0012661978,0.0078395475,0.000028175884,0.00009781352,0.00039884116,0.0002209498,0.8365024,0.14704788,0.0018091156,0.0046693003,0.000038805367],"about_ca_topic_score_codex":0.0031435785,"about_ca_topic_score_gemma":0.0023016022,"teacher_disagreement_score":0.0031435785,"about_ca_system_score_codex":0.0015262724,"about_ca_system_score_gemma":0.00037496255,"threshold_uncertainty_score":0.011073887},"labels":[],"label_agreement":null},{"id":"W2133416890","doi":"10.1109/mascot.1995.378647","title":"Modeling ATM networks: a case study","year":2002,"lang":"en","type":"article","venue":"","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 Alberta","funders":"","keywords":"Computer science; Implementation; Asynchronous Transfer Mode; Object (grammar); Computer network; Theoretical computer science; Programming language; Distributed computing; Artificial intelligence","score_opus":0.05098233091699444,"score_gpt":0.24856390503323306,"score_spread":0.1975815741162386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133416890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68341595,0.0022030773,0.23745935,0.0060276478,0.00024955007,0.00050752895,0.0015574927,0.0013121727,0.06726725],"genre_scores_gemma":[0.9255429,0.0012534099,0.06395384,0.00016527,0.0000710814,0.00021344025,0.00038630242,0.00007631094,0.008337534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00033656572,0.000025082802,0.000052270767,0.00011260323,0.000064154],"domain_scores_gemma":[0.9985216,0.0011206584,0.00006606562,0.000076064265,0.000119691795,0.00009588145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333778,0.00077979953,0.00045692292,0.0004989219,0.0012930545,0.0016578924,0.0015708595,0.0031549027,0.0040166327],"category_scores_gemma":[0.0026741147,0.00036420499,0.000682417,0.0012415863,0.00080153655,0.0017317176,0.0009758613,0.0012304509,0.00030769908],"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.00015892544,0.00029371277,0.0043418203,0.00019492334,0.000042803214,0.0029372328,0.0006071117,0.9044141,0.0017454453,0.06684183,0.003680916,0.014741143],"study_design_scores_gemma":[0.00006723568,0.00009255951,0.0005286574,0.000034092463,0.0000261102,0.00034713923,0.00032974358,0.97726554,0.0013464544,0.010395285,0.009550045,0.000017140414],"about_ca_topic_score_codex":0.015790777,"about_ca_topic_score_gemma":0.013147601,"teacher_disagreement_score":0.015790777,"about_ca_system_score_codex":0.0014450874,"about_ca_system_score_gemma":0.0008314541,"threshold_uncertainty_score":0.03139776},"labels":[],"label_agreement":null},{"id":"W2133441988","doi":"10.1109/ccece.1993.332398","title":"Performance evaluation of different buffering schemes for balanced-gamma networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Banyan; Computer science; Throughput; Computer network; Asynchronous Transfer Mode; Asynchronous communication; Interconnection; Network packet; Telecommunications","score_opus":0.04787477326675873,"score_gpt":0.25513095622312465,"score_spread":0.20725618295636591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133441988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679348,0.0017063454,0.025497548,0.0001381915,0.000051518713,0.000100183664,0.00018067677,0.00068822305,0.0037026994],"genre_scores_gemma":[0.99080515,0.00036783025,0.007943246,0.0000308002,0.000011900181,0.000026090805,0.00015611293,0.00003040922,0.0006284488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.00030234575,0.00006237467,0.00013758312,0.00024627935,0.0002495032],"domain_scores_gemma":[0.9957188,0.002521252,0.00038679494,0.00024064643,0.0009223539,0.00021013088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015123888,0.0010129155,0.00041908224,0.0010933392,0.00057705486,0.0010153721,0.00092820136,0.00043282102,0.0015776784],"category_scores_gemma":[0.005452248,0.00019490399,0.00019472121,0.0009419934,0.0004960986,0.0012493738,0.00046600177,0.00024049127,0.0001667588],"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.012336106,0.00093156914,0.019776795,0.0009100024,0.00042728655,0.00032641675,0.0007266216,0.53574944,0.1501492,0.017405357,0.0041347654,0.25712654],"study_design_scores_gemma":[0.0003177488,0.0038871798,0.003561132,0.00006953008,0.0002966895,0.00020193664,0.00028984726,0.8384675,0.14778623,0.0026348005,0.002416138,0.000071161965],"about_ca_topic_score_codex":0.0029620754,"about_ca_topic_score_gemma":0.0021081916,"teacher_disagreement_score":0.0029620754,"about_ca_system_score_codex":0.0019688406,"about_ca_system_score_gemma":0.00055435335,"threshold_uncertainty_score":0.014285028},"labels":[],"label_agreement":null},{"id":"W2133703501","doi":"10.1016/j.dam.2012.05.023","title":"On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Mathematics; Hamiltonian path; Digraph; Combinatorics; Directed acyclic graph; Hamiltonian (control theory); Path (computing); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.041477261284386294,"score_gpt":0.2545653371370211,"score_spread":0.21308807585263484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133703501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61246103,0.0006034856,0.346184,0.00046008267,0.00015127836,0.00015042553,0.00037986698,0.00028368074,0.039326135],"genre_scores_gemma":[0.94873846,0.0004649341,0.043781426,0.00013303166,0.000048389666,0.00010224201,0.0002811702,0.000138537,0.006311741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00011975628,0.000027787755,0.000072079114,0.000108107444,0.00011817035],"domain_scores_gemma":[0.9954106,0.0029464152,0.0004327655,0.00038644907,0.00041154475,0.00041221367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008840574,0.00032535923,0.0006024127,0.0011488873,0.0013656359,0.0020480528,0.0009876394,0.0009776996,0.0068768086],"category_scores_gemma":[0.00630558,0.00052790245,0.00055468845,0.0008428399,0.0022545455,0.0026433973,0.0015657546,0.0013527161,0.00041147196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018441952,0.00006635735,0.0010778662,0.00013095699,0.000024833867,0.00018319371,0.00044722366,0.035675187,0.0027222943,0.9382624,0.0012604663,0.01996489],"study_design_scores_gemma":[0.000044765606,0.00006783182,0.00047350064,0.000046061345,0.000015628688,0.00006938288,0.0002179469,0.08288744,0.0012677881,0.9133875,0.0014961426,0.000026071633],"about_ca_topic_score_codex":0.0013966052,"about_ca_topic_score_gemma":0.0021518418,"teacher_disagreement_score":0.0068768086,"about_ca_system_score_codex":0.0007140304,"about_ca_system_score_gemma":0.0007591213,"threshold_uncertainty_score":0.023005188},"labels":[],"label_agreement":null},{"id":"W2134443501","doi":"10.1145/1057661.1057761","title":"FPGA implementation of a modular and pipelined WF scheduler for high speed OC192 networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Computer science; Modular design; PHY; Field-programmable gate array; Synchronous optical networking; Network packet; Scheduling (production processes); Queueing theory; Computer network; Embedded system; Operating system; Physical layer; Wireless","score_opus":0.013476075895527781,"score_gpt":0.26773101409953065,"score_spread":0.25425493820400286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134443501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17507367,0.0004023114,0.8024179,0.00014195096,0.00022870548,0.00022907682,0.00021255335,0.0057756035,0.01551828],"genre_scores_gemma":[0.74905246,0.00015269594,0.24383622,0.00007695826,0.00004876631,0.00007719591,0.00023690778,0.000094874835,0.006423864],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987113,0.000016881191,0.000007651752,0.000022323884,0.000039997296,0.0000419512],"domain_scores_gemma":[0.999877,0.000022934284,0.000019666859,0.00002530125,0.000035899437,0.000019188425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019556558,0.0003533195,0.00016161206,0.00032748905,0.00029254274,0.00039122603,0.00081510376,0.0001847141,0.004250246],"category_scores_gemma":[0.00026594792,0.00015050052,0.00018502628,0.0002178726,0.00013588647,0.00031681635,0.00015131496,0.0002737812,0.0007214149],"study_design_candidate":"bench_or_experimental","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.0012215774,0.00032618002,0.0059604067,0.00035643525,0.00013824798,0.0006138489,0.00022398213,0.13736936,0.26896596,0.023199748,0.010868738,0.5507555],"study_design_scores_gemma":[0.0002705357,0.0012722373,0.005387395,0.000043338045,0.00010962712,0.00050996547,0.00006461527,0.7531819,0.18984446,0.0038224673,0.045417063,0.00007646648],"about_ca_topic_score_codex":0.0033421924,"about_ca_topic_score_gemma":0.0043966845,"teacher_disagreement_score":0.004250246,"about_ca_system_score_codex":0.00056343334,"about_ca_system_score_gemma":0.00065284944,"threshold_uncertainty_score":0.014218509},"labels":[],"label_agreement":null},{"id":"W2134535928","doi":"10.1109/infcom.1988.12936","title":"Performance of buffered Banyan networks under nonuniform patterns","year":2003,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Banyan; Computer science; Network packet; Throughput; Computer network; Packet switching; Network topology; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics","score_opus":0.012849796174521746,"score_gpt":0.20538971080308985,"score_spread":0.1925399146285681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134535928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90306026,0.0004424058,0.09116556,0.00013089119,0.000047544556,0.000036102098,0.000112885,0.00050712615,0.0044971546],"genre_scores_gemma":[0.99460226,0.00010838383,0.0046691056,0.000012951777,0.0000046739433,0.000013000299,0.000045669844,0.000014298461,0.000529589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993467,0.0001993341,0.000040036408,0.00009985272,0.0001772899,0.00013688488],"domain_scores_gemma":[0.9978656,0.0010836403,0.00025590777,0.00017534624,0.0005444107,0.00007509919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088697,0.0005191608,0.00040736978,0.00056610955,0.0004884611,0.0009556031,0.0007263903,0.0003899827,0.0011127859],"category_scores_gemma":[0.0044251774,0.00019984115,0.00017728559,0.0006107428,0.0006375004,0.0015017913,0.0006327445,0.00030062525,0.00014373755],"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.0014754507,0.00012418226,0.004381966,0.000097190146,0.00009062022,0.00016104207,0.00018252479,0.9074797,0.04106666,0.011761299,0.000803129,0.032376315],"study_design_scores_gemma":[0.000014316518,0.00024626392,0.00046501518,0.000007660105,0.000021972006,0.000041404808,0.000039351635,0.9778371,0.019312017,0.0017940445,0.0002081904,0.000012789297],"about_ca_topic_score_codex":0.004841815,"about_ca_topic_score_gemma":0.0024633855,"teacher_disagreement_score":0.004841815,"about_ca_system_score_codex":0.0015049084,"about_ca_system_score_gemma":0.00053229043,"threshold_uncertainty_score":0.010918975},"labels":[],"label_agreement":null},{"id":"W2135113048","doi":"10.1016/j.disc.2012.06.016","title":"Upper bounds on the broadcast function using minimum dominating sets","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Dominating set; Upper and lower bounds; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.04128615133262544,"score_gpt":0.2757651594480155,"score_spread":0.23447900811539005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135113048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05412986,0.021487577,0.85503954,0.007662689,0.0010579433,0.00026003833,0.0013812013,0.0016118422,0.05736925],"genre_scores_gemma":[0.71883637,0.021076018,0.22006509,0.0026516886,0.0029618507,0.0013164659,0.002262213,0.0017114508,0.029118922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479973,0.0015749009,0.00017603225,0.0005957122,0.0018957893,0.00095789676],"domain_scores_gemma":[0.94352543,0.04741704,0.0014772299,0.0032031345,0.0027212843,0.0016558524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008502825,0.0042760437,0.00466605,0.0053785266,0.002307831,0.00696277,0.0061181546,0.0034294429,0.008723972],"category_scores_gemma":[0.04361828,0.0017112219,0.0024134377,0.005157839,0.003799143,0.011343999,0.00617651,0.007588724,0.0022433246],"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.00190246,0.00045415555,0.0015523235,0.0019777247,0.00030412053,0.00021873027,0.00077156874,0.41202506,0.009586444,0.3944196,0.031650033,0.14513776],"study_design_scores_gemma":[0.00013104425,0.00023581285,0.0008345857,0.00042346524,0.00025800487,0.00027853687,0.00017923706,0.67242634,0.004778752,0.30991858,0.010455967,0.000079683705],"about_ca_topic_score_codex":0.0024356723,"about_ca_topic_score_gemma":0.003496502,"teacher_disagreement_score":0.008773074,"about_ca_system_score_codex":0.008773074,"about_ca_system_score_gemma":0.0029889643,"threshold_uncertainty_score":0.06365341},"labels":[],"label_agreement":null},{"id":"W2135218079","doi":"10.1109/tc.2012.121","title":"DART: A Programmable Architecture for NoC Simulation on FPGAs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":37,"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; Field-programmable gate array; Virtex; Embedded system; Network on a chip; Computer architecture; Routing (electronic design automation); Network packet; Parallel computing; Computer network","score_opus":0.028082194922674473,"score_gpt":0.27110447984074343,"score_spread":0.24302228491806896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135218079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04044125,0.0003933999,0.9206373,0.00017567811,0.00015359449,0.0003516336,0.000986295,0.026077723,0.010783086],"genre_scores_gemma":[0.3325514,0.0005743363,0.65798306,0.00017521062,0.000040392362,0.00088201853,0.00179403,0.0016281289,0.0043713334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00008060972,0.000020803485,0.000034182372,0.000112930844,0.000033879252],"domain_scores_gemma":[0.99963534,0.00016735407,0.0000310889,0.000058718233,0.00007730249,0.000030177514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156693,0.0008481543,0.00039227895,0.00056701375,0.00038718976,0.0006035411,0.0018268854,0.00053284067,0.0081752725],"category_scores_gemma":[0.0013818147,0.0004432996,0.00056042575,0.00033834856,0.00036965165,0.000511955,0.00058091886,0.0008680608,0.0009452254],"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.0002742304,0.000093591116,0.0023811571,0.0003457501,0.0001292712,0.0003093912,0.00014234513,0.8799539,0.013313726,0.016140936,0.011809963,0.07510582],"study_design_scores_gemma":[0.000059519658,0.000059077935,0.00018150141,0.000018212728,0.000011522566,0.000041394123,0.000009783833,0.9857604,0.0050605317,0.0017843276,0.007001195,0.000012525724],"about_ca_topic_score_codex":0.0037503329,"about_ca_topic_score_gemma":0.003573323,"teacher_disagreement_score":0.0081752725,"about_ca_system_score_codex":0.0005835963,"about_ca_system_score_gemma":0.0007984012,"threshold_uncertainty_score":0.027349055},"labels":[],"label_agreement":null},{"id":"W2136355110","doi":"10.1109/isvlsi.2004.1339532","title":"Low power 2.5 Gb/s serializer for SOC applications","year":2004,"lang":"en","type":"article","venue":"IEEE Computer Society Annual Symposium on VLSI","topic":"Interconnection Networks and 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":"Simon Fraser University","funders":"","keywords":"Synchronous optical networking; InfiniBand; CMOS; Chip; Computer science; Low-power electronics; System on a chip; Application-specific integrated circuit; Power (physics); Embedded system; Electrical engineering; Engineering; Telecommunications; Power consumption; Computer network; Physics","score_opus":0.009329874792076077,"score_gpt":0.2375327720283653,"score_spread":0.22820289723628923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136355110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34077975,0.0033331995,0.5877672,0.00067831785,0.0009158832,0.000654156,0.0011341382,0.025105746,0.0396317],"genre_scores_gemma":[0.7771764,0.0010531232,0.176324,0.0006645712,0.0003365621,0.00024863426,0.001409276,0.0004982713,0.042289242],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981743,0.00003233292,0.000012036123,0.00003720953,0.000060344642,0.000040752566],"domain_scores_gemma":[0.9997955,0.000041302643,0.000035037057,0.000028270963,0.00008003597,0.000019767318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022147846,0.0008203213,0.00034500082,0.0006392471,0.00034627342,0.00073071086,0.0008224545,0.00041338863,0.014322248],"category_scores_gemma":[0.0003870726,0.00024650767,0.0001806131,0.0006241249,0.00015286,0.0007082765,0.00034811674,0.0004767408,0.0024888855],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0007390978,0.00017871923,0.0026330147,0.00048705522,0.00007078409,0.0007003676,0.00018871545,0.002777682,0.6857209,0.0047422727,0.014054887,0.2877065],"study_design_scores_gemma":[0.00027148242,0.0045872363,0.008766489,0.00011807862,0.00023749575,0.004661114,0.00024087162,0.080180325,0.7604966,0.0018355446,0.13849394,0.00011075229],"about_ca_topic_score_codex":0.0004463141,"about_ca_topic_score_gemma":0.0016009437,"teacher_disagreement_score":0.014322248,"about_ca_system_score_codex":0.00029516302,"about_ca_system_score_gemma":0.00041715725,"threshold_uncertainty_score":0.047912717},"labels":[],"label_agreement":null},{"id":"W2136382225","doi":"10.1109/infcom.1998.665103","title":"A multicast single-queue switch with a novel copy mechanism","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Multicast; Computer network; Computer science; Unicast; Source-specific multicast; Xcast; Queue management system; Pragmatic General Multicast; Queue; Distributed computing","score_opus":0.036570896763054625,"score_gpt":0.20469360254943164,"score_spread":0.168122705786377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136382225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052593783,0.0017267693,0.927134,0.00035794626,0.00081173686,0.00032759213,0.00027571822,0.0066696648,0.010102749],"genre_scores_gemma":[0.32805884,0.0006253061,0.65839386,0.00044426662,0.000570054,0.00030119324,0.0004764276,0.00020569519,0.010924316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995472,0.000046430396,0.000037525286,0.00009782827,0.00021199555,0.00005896197],"domain_scores_gemma":[0.9995728,0.0000611185,0.00004820948,0.00011997811,0.00011935125,0.000078447396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046722623,0.00042238526,0.00072132424,0.0007528738,0.0006775642,0.0011927088,0.0030338056,0.0006851083,0.00395574],"category_scores_gemma":[0.00054383755,0.00036286376,0.00046517205,0.00059176,0.00040600027,0.001681349,0.0009080422,0.0007975199,0.0010287552],"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.0007634621,0.0005502374,0.0017700869,0.0005074151,0.00018763522,0.0006028704,0.00017713576,0.021369182,0.32134753,0.08332605,0.017218215,0.5521801],"study_design_scores_gemma":[0.0005553986,0.0018337517,0.0017795175,0.0000712569,0.0004199543,0.003210859,0.00005694711,0.66609937,0.17007394,0.02809182,0.12760195,0.00020522389],"about_ca_topic_score_codex":0.0006390812,"about_ca_topic_score_gemma":0.0007441598,"teacher_disagreement_score":0.00395574,"about_ca_system_score_codex":0.00062629976,"about_ca_system_score_gemma":0.0006261667,"threshold_uncertainty_score":0.013233304},"labels":[],"label_agreement":null},{"id":"W2136907605","doi":"","title":"On Dense Triple-Loop Networks.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Loop (graph theory); Mathematics; Combinatorics","score_opus":0.01157568349192068,"score_gpt":0.23056799942518202,"score_spread":0.21899231593326135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136907605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120073065,0.0038105818,0.72267264,0.0012659624,0.0005364496,0.00009067966,0.00082209765,0.00071588263,0.15001258],"genre_scores_gemma":[0.88032395,0.004192521,0.06104378,0.0005300664,0.0003838556,0.000225153,0.000984629,0.00020698809,0.05210906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997254,0.00006941331,0.000013248445,0.00004748479,0.000079928985,0.00006450329],"domain_scores_gemma":[0.999038,0.0004180181,0.0001347979,0.00012928744,0.00015768145,0.00012224088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177986,0.00041868392,0.00048067185,0.0010167501,0.000662086,0.0012130239,0.00063876,0.00057755254,0.012662415],"category_scores_gemma":[0.0022697558,0.00026345276,0.00031984728,0.0009943651,0.0009357517,0.0028648148,0.0013297074,0.0011037572,0.0018393445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006359294,0.000021043888,0.00029749368,0.00012792494,0.000020373538,0.0001557652,0.00011455171,0.023126261,0.001944418,0.9343236,0.007293686,0.0325113],"study_design_scores_gemma":[0.0000116842775,0.000027580287,0.00017813228,0.000034101213,0.000008662753,0.0001536487,0.000060378585,0.052953158,0.0006981494,0.9343997,0.011466696,0.000008115367],"about_ca_topic_score_codex":0.00069659273,"about_ca_topic_score_gemma":0.0013022033,"teacher_disagreement_score":0.012662415,"about_ca_system_score_codex":0.00065110374,"about_ca_system_score_gemma":0.00029305974,"threshold_uncertainty_score":0.042360008},"labels":[],"label_agreement":null},{"id":"W2137437152","doi":"10.1109/tcad.2010.2043587","title":"Energy Optimization for Many-Core Platforms: Communication and PVT Aware Voltage-Island Formation and Voltage Selection Algorithm","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","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 British Columbia","funders":"","keywords":"Selection (genetic algorithm); Core (optical fiber); Voltage; Computer science; Energy (signal processing); Algorithm; Electrical engineering; Telecommunications; Engineering; Mathematics; Artificial intelligence; Statistics","score_opus":0.024776539198103742,"score_gpt":0.22823246854126591,"score_spread":0.20345592934316217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137437152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049025357,0.00022493744,0.9468438,0.00018245807,0.000031087267,0.00005652492,0.000025595087,0.00056123536,0.0030490335],"genre_scores_gemma":[0.5620817,0.00014434547,0.43358442,0.00010609216,0.000035290388,0.00020458558,0.000124115,0.00013448551,0.0035850168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984527,0.0000396375,0.000006600482,0.000025166742,0.00005940921,0.000024023115],"domain_scores_gemma":[0.9998191,0.00008567087,0.000020953767,0.000018308192,0.000045859942,0.000010117545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306803,0.0005310757,0.00058445515,0.00038568967,0.00031376418,0.00033339698,0.0008619094,0.0004722756,0.0012259026],"category_scores_gemma":[0.0005905702,0.00024020001,0.0003858684,0.00036396773,0.00027097474,0.0005027166,0.00046128038,0.00047724682,0.00018427343],"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.00006800929,0.00007961738,0.0006942829,0.000050798546,0.000038289247,0.00005598791,0.00004239729,0.85937476,0.00839697,0.0036613378,0.0014086728,0.12612894],"study_design_scores_gemma":[0.000015125498,0.000020547384,0.00009529208,0.0000015187935,0.000004513377,0.000011325634,0.000007095489,0.9970872,0.0014354597,0.0009629511,0.00035649486,0.0000023759771],"about_ca_topic_score_codex":0.0017780183,"about_ca_topic_score_gemma":0.0032195493,"teacher_disagreement_score":0.0017780183,"about_ca_system_score_codex":0.0004350755,"about_ca_system_score_gemma":0.0007507041,"threshold_uncertainty_score":0.0041009784},"labels":[],"label_agreement":null},{"id":"W2137942529","doi":"10.1109/tmag.2009.2012620","title":"Enhancing the Performance of Electromagnetic Applications on Clustered Architectures","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Computer science; Cluster analysis; Power consumption; Computation; Power (physics); Electromagnetics; Computer architecture; Embedded system; Electronic engineering; Computational science; Distributed computing; Algorithm; Physics; Artificial intelligence","score_opus":0.007918537147337725,"score_gpt":0.21820524213337952,"score_spread":0.2102867049860418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137942529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6772291,0.00090136996,0.27404597,0.0006464879,0.0001556821,0.00011808695,0.00013869477,0.0063152323,0.040449373],"genre_scores_gemma":[0.90230423,0.00028078037,0.09147663,0.00010922712,0.000046189547,0.000057883153,0.00017472963,0.00029062468,0.005259754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996619,0.00007173672,0.000015885786,0.000040010902,0.00013737996,0.00007310292],"domain_scores_gemma":[0.99877566,0.00034087597,0.00008423207,0.0002114339,0.0005280232,0.000059745318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044083482,0.00067259447,0.00037995316,0.0005308836,0.00043541385,0.0005211182,0.0010850079,0.00048769696,0.0029984873],"category_scores_gemma":[0.0020769492,0.00016013364,0.000183677,0.0009598827,0.00024470504,0.0009668496,0.0005258895,0.0004526512,0.0008590512],"study_design_candidate":"bench_or_experimental","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.0008822216,0.00050927233,0.0030832111,0.00047683853,0.000091617665,0.0002965484,0.00018164275,0.3775732,0.28696674,0.018734075,0.012995541,0.29820907],"study_design_scores_gemma":[0.00008071181,0.00079421775,0.0016060763,0.00002434348,0.000046245004,0.0001959851,0.00008050472,0.7810328,0.19990067,0.006456875,0.009740645,0.000040849623],"about_ca_topic_score_codex":0.0009946754,"about_ca_topic_score_gemma":0.0023861693,"teacher_disagreement_score":0.0029984873,"about_ca_system_score_codex":0.0005936346,"about_ca_system_score_gemma":0.00048699314,"threshold_uncertainty_score":0.010030985},"labels":[],"label_agreement":null},{"id":"W2138097871","doi":"10.5555/968878.968966","title":"A system level exploration platform and methodology for network applications based on configurable processors","year":2004,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer architecture; Software; Embedded system; Network processor; Field-programmable gate array; Distributed computing; Operating system; Computer network","score_opus":0.14316803111295476,"score_gpt":0.2939937064503968,"score_spread":0.15082567533744204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138097871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010870066,0.00013056672,0.98399276,0.00008538304,0.000011594525,0.00011607575,0.000017602553,0.0006549795,0.004121051],"genre_scores_gemma":[0.15873252,0.0002742149,0.8361058,0.00006302956,0.000013846259,0.0003047498,0.00006594841,0.0002003104,0.0042395173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959654,0.0001406917,0.00002089232,0.000056313693,0.00014408444,0.000041512067],"domain_scores_gemma":[0.99971634,0.00011560482,0.000027214042,0.000074611395,0.000046718633,0.000019482562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188812,0.00046790903,0.0002893553,0.00043584697,0.00035074475,0.0009472399,0.0007691035,0.00036152508,0.003578651],"category_scores_gemma":[0.0007830801,0.00033172898,0.00046705347,0.00027209547,0.00094340293,0.0010850643,0.0007319305,0.00089562935,0.00063808035],"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.00018321237,0.00014825731,0.0017223526,0.0007328688,0.00007428428,0.0009999209,0.001034188,0.15993531,0.15073033,0.37714443,0.0028746927,0.30442008],"study_design_scores_gemma":[0.00009471906,0.00054963375,0.0013173705,0.00027021382,0.00009028084,0.001608274,0.00029328998,0.65001386,0.09485176,0.15565485,0.09517157,0.00008411281],"about_ca_topic_score_codex":0.00046400752,"about_ca_topic_score_gemma":0.00076393515,"teacher_disagreement_score":0.003578651,"about_ca_system_score_codex":0.00032072517,"about_ca_system_score_gemma":0.0008801197,"threshold_uncertainty_score":0.011971831},"labels":[],"label_agreement":null},{"id":"W2138116305","doi":"10.1109/conect.2002.1039252","title":"Feedback output queuing: a novel architecture for efficient switching systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Quality of service; Scalability; Speedup; Queueing theory; Computer network; Network packet; Packet switching; Distributed computing; Parallel computing","score_opus":0.02385842420071575,"score_gpt":0.23657806250823665,"score_spread":0.21271963830752091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138116305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03132028,0.0006971594,0.9620549,0.0003390588,0.00017251907,0.00005849197,0.000044807162,0.0011406377,0.004172078],"genre_scores_gemma":[0.6625391,0.0011245083,0.32923597,0.0002296377,0.00029045335,0.00015074047,0.0001250969,0.000104767976,0.006199716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999772,0.000043951568,0.000012209521,0.000026126112,0.00010864557,0.000037033882],"domain_scores_gemma":[0.99981683,0.000064979075,0.00002006805,0.000030095242,0.000049082137,0.00001895943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041267535,0.00037911301,0.0003130208,0.00027836516,0.00041186318,0.00077557616,0.0010338234,0.00042905935,0.0021082307],"category_scores_gemma":[0.00062373333,0.00018539307,0.00020450029,0.0003706676,0.00048434603,0.0011533145,0.00047004054,0.000572653,0.00032284408],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042515743,0.000230274,0.0010002074,0.0003271012,0.000077732446,0.00033608064,0.0003025786,0.33831245,0.1249572,0.29315463,0.010335545,0.23054107],"study_design_scores_gemma":[0.000060239367,0.00018600741,0.00013624696,0.000014573854,0.000029497718,0.00007369589,0.000015962909,0.94664973,0.009934602,0.030967604,0.011917674,0.000014038922],"about_ca_topic_score_codex":0.00090251584,"about_ca_topic_score_gemma":0.0010935304,"teacher_disagreement_score":0.0021082307,"about_ca_system_score_codex":0.0005236005,"about_ca_system_score_gemma":0.00055927975,"threshold_uncertainty_score":0.00705266},"labels":[],"label_agreement":null},{"id":"W2138204585","doi":"10.1109/ccece.2004.1344998","title":"A new graph structure for hardware-software partitioning of heterogeneous systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Directed acyclic graph; Parallel computing; Graph; Dependency graph; Software; Dependency (UML); Graph partition; Software system; Theoretical computer science; Algorithm; Programming language","score_opus":0.014427099980339062,"score_gpt":0.22751139664791195,"score_spread":0.2130842966675729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138204585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032369632,0.00033586315,0.9923413,0.00018003315,0.00008190355,0.000088632114,0.00027225315,0.00067364227,0.0027895372],"genre_scores_gemma":[0.041911438,0.00060069497,0.9541125,0.00011674319,0.00006182565,0.00022001025,0.0009154108,0.0001993257,0.001861966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.00015022785,0.000043721255,0.00011644367,0.00015300802,0.00003454153],"domain_scores_gemma":[0.9993955,0.00020604607,0.0000718102,0.00016417261,0.00012048618,0.00004201863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048596578,0.0006901089,0.000404125,0.0014158167,0.00059459865,0.001100005,0.00096282974,0.00062703417,0.002772066],"category_scores_gemma":[0.0015598922,0.00038547115,0.00084627373,0.0016071597,0.0006731485,0.0022163813,0.0009417865,0.0009715553,0.0008154009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012741904,0.0001172463,0.00094107905,0.00080940314,0.00009799986,0.0004995198,0.0004212635,0.17641714,0.0286105,0.40506187,0.01459182,0.37230468],"study_design_scores_gemma":[0.00008690572,0.00024358173,0.0008895971,0.0002097997,0.00013799303,0.000858107,0.00015078341,0.5000176,0.01671509,0.3001285,0.18045944,0.00010257619],"about_ca_topic_score_codex":0.0025119581,"about_ca_topic_score_gemma":0.003961747,"teacher_disagreement_score":0.002772066,"about_ca_system_score_codex":0.00075749896,"about_ca_system_score_gemma":0.0011189316,"threshold_uncertainty_score":0.009273469},"labels":[],"label_agreement":null},{"id":"W2138560839","doi":"10.1109/siecpc.2013.6550775","title":"A new CDMA transmitter for high-speed serial links","year":2013,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"Serial communication; Code division multiple access; Transmitter; Computer science; CMOS; Electronic engineering; Serial port; Channel (broadcasting); IBM; Voltage; Computer hardware; Electrical engineering; Engineering; Telecommunications; Physics","score_opus":0.013528061084205895,"score_gpt":0.21731355876706865,"score_spread":0.20378549768286275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138560839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15870103,0.0016620464,0.8077193,0.0007202501,0.0006816278,0.00018595309,0.00008448871,0.0011803817,0.029064976],"genre_scores_gemma":[0.51624405,0.0005876367,0.4660178,0.00035974887,0.0002671941,0.00009200191,0.0000743338,0.00003693823,0.016320184],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997702,0.000045649696,0.000012672837,0.00003680348,0.00011489924,0.000019837637],"domain_scores_gemma":[0.9997143,0.000062027386,0.000043878004,0.000045179793,0.000111326815,0.00002325885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025255152,0.00027244433,0.0001997535,0.0003614181,0.00045952288,0.00071979535,0.00053294736,0.0004167185,0.0016401995],"category_scores_gemma":[0.0003929641,0.00022157584,0.00015391187,0.00038395665,0.00029961063,0.00079104444,0.00032229483,0.00070066005,0.00047986544],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032107797,0.00017632036,0.0021048456,0.0002944998,0.000050714345,0.00036988672,0.0002659242,0.016058188,0.73335755,0.09537943,0.0038268787,0.14779465],"study_design_scores_gemma":[0.00021652188,0.001513744,0.0021615291,0.000096187534,0.00015236338,0.0025295778,0.00011121839,0.37030622,0.4913684,0.008411606,0.12301489,0.00011777447],"about_ca_topic_score_codex":0.00020378613,"about_ca_topic_score_gemma":0.00073782925,"teacher_disagreement_score":0.0016401995,"about_ca_system_score_codex":0.00041779084,"about_ca_system_score_gemma":0.00058238965,"threshold_uncertainty_score":0.005487025},"labels":[],"label_agreement":null},{"id":"W2139093700","doi":"10.1109/rsp.2005.6","title":"A HyperTransport Chip-to-Chip Interconnect Tunnel Developed Using SystemC","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"CMC Microsystems","keywords":"SystemC; Embedded system; Interconnection; Computer science; System on a chip; Computer architecture; CMOS; Chip; Implementation; Integrated circuit design; MPSoC; Computer hardware; Electronic engineering; Engineering; Telecommunications; Software engineering","score_opus":0.030972316688477223,"score_gpt":0.241889503424916,"score_spread":0.21091718673643878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139093700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4403088,0.0009932995,0.524071,0.00027610577,0.00043455392,0.0008164696,0.0004673439,0.0081645325,0.024467923],"genre_scores_gemma":[0.66495925,0.00026772448,0.32590756,0.00010841435,0.000022022961,0.00026209254,0.0004275099,0.00028469556,0.0077606784],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997141,0.000053848857,0.000014189224,0.000035244957,0.00013012737,0.00005253943],"domain_scores_gemma":[0.9994711,0.00007622189,0.00004744506,0.00010360908,0.0002400878,0.000061550374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046936134,0.00024793134,0.00028391829,0.00044118226,0.0004987241,0.00041724698,0.0006483946,0.00041809442,0.002432935],"category_scores_gemma":[0.0006354501,0.0002100022,0.00020698793,0.00031713487,0.0004519525,0.0006048699,0.00045954413,0.00073039375,0.000458245],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0005047028,0.00023945596,0.0032722277,0.0007524785,0.00006117093,0.0006591445,0.0004927836,0.028145632,0.7334838,0.04001151,0.008932529,0.18344449],"study_design_scores_gemma":[0.00018414568,0.0028219253,0.0033088538,0.00008556059,0.00006754247,0.0021609622,0.00010974648,0.14969344,0.71096677,0.0021767314,0.12830357,0.00012069143],"about_ca_topic_score_codex":0.0009687348,"about_ca_topic_score_gemma":0.0014766663,"teacher_disagreement_score":0.002432935,"about_ca_system_score_codex":0.00054805283,"about_ca_system_score_gemma":0.0009768881,"threshold_uncertainty_score":0.008139014},"labels":[],"label_agreement":null},{"id":"W2139138074","doi":"10.1109/hpcs.2006.19","title":"Designing and Reconfiguring Fault-Tolerant Hypercubes","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Hypercube; Circulant matrix; Computer science; Fault tolerance; Control reconfiguration; Interconnection; Parallel computing; Polygon mesh; Distributed computing; Theoretical computer science; Algorithm; Computer network; Embedded system","score_opus":0.010991140676186204,"score_gpt":0.1982808404465857,"score_spread":0.1872896997703995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139138074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13637333,0.0010369511,0.8470262,0.00030587552,0.0001942834,0.0001402322,0.00009842902,0.00103511,0.013789567],"genre_scores_gemma":[0.62924534,0.0013235707,0.36374405,0.00016699349,0.000102171936,0.00025826943,0.000272285,0.00013159096,0.0047557936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.000105826985,0.000020769186,0.0000486537,0.000060724626,0.00003801217],"domain_scores_gemma":[0.9996774,0.00008508044,0.000059634167,0.00007218019,0.00007408954,0.00003166766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034399703,0.00031624417,0.00031303454,0.00048782828,0.0004583616,0.0006171824,0.00061653485,0.0004047847,0.0010871999],"category_scores_gemma":[0.0008552615,0.00023509905,0.00024262577,0.00049439183,0.0003486523,0.0008249725,0.0005765117,0.00030954715,0.00042425364],"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.00019950433,0.000084434774,0.0013957465,0.0003344834,0.00006912692,0.00047218462,0.00030320894,0.57387984,0.13582678,0.07245574,0.003683522,0.21129535],"study_design_scores_gemma":[0.000050408526,0.00018319067,0.00067893736,0.00003068769,0.00003198107,0.00026624487,0.00015843008,0.8867441,0.0533818,0.036445048,0.021995522,0.00003363695],"about_ca_topic_score_codex":0.00064540317,"about_ca_topic_score_gemma":0.0009332409,"teacher_disagreement_score":0.0010871999,"about_ca_system_score_codex":0.00038187995,"about_ca_system_score_gemma":0.00037064144,"threshold_uncertainty_score":0.0036370158},"labels":[],"label_agreement":null},{"id":"W2140085060","doi":"10.1109/fpt.2009.5377628","title":"The effect of node size, heterogeneity, and network size on FPGA based NoCs","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Node (physics); Network on a chip; Interconnection; Network topology; Embedded system; Homogeneous; Application-specific integrated circuit; System on a chip; Multiprocessing; Topology (electrical circuits); Routing (electronic design automation); Computer network; Parallel computing; Engineering","score_opus":0.007319762284279431,"score_gpt":0.23457153477853906,"score_spread":0.22725177249425962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140085060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907873,0.00053841044,0.0060172128,0.00010414053,0.000029458992,0.000019244744,0.00008722595,0.00014127686,0.0022757817],"genre_scores_gemma":[0.99821717,0.00010622408,0.0013590913,0.00001154544,0.000007864406,0.000007286953,0.000048950267,0.000021170488,0.00022061818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992429,0.0002265342,0.000057824283,0.000109553774,0.0002290911,0.00013414324],"domain_scores_gemma":[0.98872924,0.008656091,0.00086828077,0.0007024665,0.0008121333,0.0002318636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080729165,0.0003876503,0.0003169354,0.00044693972,0.00030441908,0.00041998664,0.0004653632,0.00023924415,0.0012267599],"category_scores_gemma":[0.0073462683,0.00021974836,0.00015517742,0.00046980003,0.0003294569,0.0010163501,0.00032634928,0.00027535812,0.00011645913],"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.0014351427,0.0001885,0.02809171,0.00041386147,0.00012583552,0.00082356506,0.00024307279,0.7546012,0.14292811,0.004087945,0.0012333381,0.06582777],"study_design_scores_gemma":[0.00016309087,0.0029477368,0.058762096,0.000098191944,0.000340206,0.0010650796,0.0005498703,0.7263985,0.20114726,0.004114721,0.004305677,0.00010745858],"about_ca_topic_score_codex":0.0013017011,"about_ca_topic_score_gemma":0.0022522982,"teacher_disagreement_score":0.0013017011,"about_ca_system_score_codex":0.0004970604,"about_ca_system_score_gemma":0.00026322628,"threshold_uncertainty_score":0.0042693615},"labels":[],"label_agreement":null},{"id":"W2140226378","doi":"10.1109/iv.2005.93","title":"On Two Properties of the Minimum Broadcast Time Function","year":2006,"lang":"en","type":"article","venue":"Ninth International Conference on Information Visualisation (IV'05)","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Vertex (graph theory); Computer science; Constant (computer programming); Function (biology); Graph; Node (physics); Conjecture; Mathematics; Discrete mathematics; Combinatorics; Theoretical computer science; Computer network","score_opus":0.03368389815948562,"score_gpt":0.2617593772471393,"score_spread":0.2280754790876537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140226378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12915073,0.0043894537,0.8215544,0.0037441747,0.00022634075,0.00014398416,0.000590299,0.00062093086,0.03957972],"genre_scores_gemma":[0.8235499,0.0048000645,0.15826121,0.0011982971,0.0010668401,0.0006978922,0.00092495966,0.0010317828,0.008468998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967777,0.001062236,0.00016042184,0.00072043476,0.0006609137,0.00061832357],"domain_scores_gemma":[0.93760544,0.052087434,0.0034435613,0.0030869045,0.002286911,0.0014896662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044405707,0.0015624714,0.0019946035,0.0025724263,0.0014007717,0.0030642485,0.002243835,0.002969016,0.004586905],"category_scores_gemma":[0.051078692,0.0008299826,0.001622991,0.0028619028,0.005371748,0.010285359,0.0021572977,0.004928905,0.0010156193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047206768,0.00013173043,0.0018941713,0.00022155764,0.000044284447,0.000197593,0.000553292,0.050530102,0.0032593664,0.90261143,0.004594883,0.03548961],"study_design_scores_gemma":[0.000115976436,0.00021235931,0.001384319,0.000117451455,0.00005473226,0.00056379655,0.0002034689,0.18997379,0.00389391,0.7938908,0.009514875,0.00007456233],"about_ca_topic_score_codex":0.0013882853,"about_ca_topic_score_gemma":0.00061297073,"teacher_disagreement_score":0.004586905,"about_ca_system_score_codex":0.003266738,"about_ca_system_score_gemma":0.0013770754,"threshold_uncertainty_score":0.023701966},"labels":[],"label_agreement":null},{"id":"W2140382682","doi":"10.5555/603095.603174","title":"Color permutation: an iterative algorithm for memory packing","year":2001,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Computer science; Algorithm; Graph; Theoretical computer science","score_opus":0.10433357160945161,"score_gpt":0.325073103365216,"score_spread":0.22073953175576438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140382682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009448192,0.00016495163,0.9844248,0.00011199559,0.00003954462,0.00010132356,0.000037517224,0.0019763045,0.0036952698],"genre_scores_gemma":[0.074854776,0.00012048962,0.92128426,0.00007371362,0.000022083317,0.00018442918,0.00018341083,0.00026649874,0.0030103677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994338,0.00016348629,0.000027197271,0.000078197714,0.00020770039,0.00008964942],"domain_scores_gemma":[0.9993531,0.00023644725,0.000047355334,0.0001306766,0.00020461749,0.00002763551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822562,0.0009666313,0.0007183614,0.0011431451,0.0007176214,0.0006367335,0.001712948,0.00080581673,0.0050374493],"category_scores_gemma":[0.0020260601,0.00046789792,0.0005688735,0.001919284,0.00080245786,0.0012321672,0.0012313988,0.00085905363,0.0018036385],"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.00030583036,0.00012801647,0.0008187755,0.00012037096,0.000044854693,0.000109383494,0.00022503769,0.13635615,0.012488754,0.02315631,0.010348265,0.81589824],"study_design_scores_gemma":[0.00007897663,0.00010881607,0.00021760444,0.000012376075,0.000017918792,0.00014000646,0.00004769043,0.9641004,0.009590297,0.01700116,0.008661785,0.000022936149],"about_ca_topic_score_codex":0.0053333105,"about_ca_topic_score_gemma":0.004953779,"teacher_disagreement_score":0.0053333105,"about_ca_system_score_codex":0.0007694044,"about_ca_system_score_gemma":0.0013309106,"threshold_uncertainty_score":0.016851962},"labels":[],"label_agreement":null},{"id":"W2141282318","doi":"10.1109/tnet.2012.2186979","title":"Providing Performance Guarantees in Multipass Network Processors","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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 Waterloo","funders":"","keywords":"Computer science; Computer network; Parallel computing","score_opus":0.033253282176561545,"score_gpt":0.2510242015594304,"score_spread":0.21777091938286885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141282318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2843762,0.0015130346,0.7020045,0.0008961266,0.00009543681,0.00007566669,0.00012772488,0.001300506,0.009610887],"genre_scores_gemma":[0.9646123,0.0006148074,0.03184645,0.00010731623,0.00004692893,0.000054439544,0.000058448793,0.00007558442,0.002583692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884915,0.00025151085,0.000058375914,0.00014007713,0.00043413762,0.00026678096],"domain_scores_gemma":[0.9968951,0.0017190264,0.00037886013,0.0004089409,0.00043745572,0.0001606813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013227194,0.00071551156,0.00085232256,0.0004683091,0.0008955342,0.0026419268,0.0012597985,0.0011090873,0.0024171234],"category_scores_gemma":[0.005677176,0.00050773675,0.00031446404,0.0005997936,0.0008949601,0.0035087115,0.0015442204,0.0010616579,0.00041025833],"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.0005249668,0.00013840605,0.0015475382,0.0001737982,0.000034037854,0.00023410312,0.0002959829,0.8342343,0.021016048,0.10243019,0.0029169968,0.03645364],"study_design_scores_gemma":[0.00001328601,0.00004753789,0.00007913629,0.000007578122,0.0000047350322,0.000026610222,0.000030123898,0.983557,0.0024415085,0.0128514245,0.0009349026,0.000006256701],"about_ca_topic_score_codex":0.002612803,"about_ca_topic_score_gemma":0.0030730944,"teacher_disagreement_score":0.0026419268,"about_ca_system_score_codex":0.0015744398,"about_ca_system_score_gemma":0.0017995421,"threshold_uncertainty_score":0.011423409},"labels":[],"label_agreement":null},{"id":"W2142295403","doi":"10.1109/pdcat.2007.67","title":"Two Tree-Based Algorithms for Network Spare Capacity Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Spare part; Survivability; Backup; Computer science; Algorithm; Tree (set theory); Steiner tree problem; Mathematical optimization; Computer network; Mathematics; Engineering; Combinatorics; Database","score_opus":0.08022670335958362,"score_gpt":0.28586982161120844,"score_spread":0.20564311825162482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142295403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014672839,0.00015965098,0.99693954,0.00006584655,0.000030173525,0.000036474332,0.00003059735,0.00021946675,0.001051044],"genre_scores_gemma":[0.047729123,0.00039028085,0.94898254,0.000094873256,0.000044188884,0.00023535297,0.00020526834,0.00009710237,0.0022213995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991793,0.00022595751,0.000061228064,0.00014440788,0.00030474475,0.00008435279],"domain_scores_gemma":[0.9990037,0.00050035305,0.000057651607,0.0001295565,0.00027155835,0.000037274753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954784,0.0008669094,0.000589295,0.0013622612,0.0004952342,0.00082418916,0.0013738007,0.00093464414,0.0055096997],"category_scores_gemma":[0.0036602148,0.0003630906,0.0009077486,0.0015629489,0.00057520624,0.0015817417,0.0010016813,0.0010853078,0.0009478529],"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.00015825873,0.00009738495,0.0003497995,0.0001819111,0.000047251717,0.000043926662,0.00013467438,0.3759277,0.0035423823,0.08368082,0.0072741346,0.5285618],"study_design_scores_gemma":[0.000049861916,0.000086481705,0.00008497828,0.000019357594,0.000020081794,0.00007417956,0.000020322075,0.95240825,0.002841396,0.034521524,0.009856001,0.000017607363],"about_ca_topic_score_codex":0.0022662447,"about_ca_topic_score_gemma":0.0030442874,"teacher_disagreement_score":0.0055096997,"about_ca_system_score_codex":0.00124383,"about_ca_system_score_gemma":0.0013671513,"threshold_uncertainty_score":0.018431783},"labels":[],"label_agreement":null},{"id":"W2142401138","doi":"10.1109/its.1990.175585","title":"Performance analysis of two nonblocking space-division packet switches","year":2002,"lang":"en","type":"article","venue":"SBT/IEEE International Symposium on Telecommunications","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Division (mathematics); Computer science; Network packet; Computer network; Space (punctuation); Packet switching; Topology (electrical circuits); Theoretical computer science; Mathematics; Arithmetic; Combinatorics","score_opus":0.03765619736184454,"score_gpt":0.286091086933876,"score_spread":0.24843488957203147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142401138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8744736,0.0007436108,0.11370973,0.00029235389,0.000050446317,0.00004232292,0.00008389686,0.00035255766,0.010251464],"genre_scores_gemma":[0.99521494,0.00011168391,0.0034219157,0.000019006835,0.000010430601,0.000008097627,0.00003441306,0.000011331577,0.001168201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994407,0.00013734303,0.000017519485,0.000060545524,0.00020207725,0.00014183756],"domain_scores_gemma":[0.9982956,0.000978109,0.00016336881,0.00011197771,0.0003479021,0.000103094186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007635873,0.00050379685,0.00032907864,0.0006752757,0.00038983888,0.0010822467,0.00055511185,0.00044738752,0.0023892224],"category_scores_gemma":[0.0020427397,0.00013842517,0.00028687294,0.0005271826,0.00051258586,0.00056143006,0.00041061224,0.00038323898,0.00019996999],"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.0016007428,0.00024923115,0.0048169224,0.00012196236,0.0001051656,0.00023712275,0.00024736425,0.8658414,0.051392928,0.034364585,0.0010942958,0.039928354],"study_design_scores_gemma":[0.000018085942,0.00021044757,0.00090700306,0.0000029800638,0.000019830151,0.000035865123,0.00003188934,0.99126583,0.005409366,0.0018007145,0.00028923602,0.0000086926975],"about_ca_topic_score_codex":0.0042056353,"about_ca_topic_score_gemma":0.0014888884,"teacher_disagreement_score":0.0042056353,"about_ca_system_score_codex":0.0015317446,"about_ca_system_score_gemma":0.0006840106,"threshold_uncertainty_score":0.011113703},"labels":[],"label_agreement":null},{"id":"W2142628816","doi":"10.1145/2145694.2145706","title":"Saturating the transceiver bandwidth","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"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":"Transceiver; Bandwidth (computing); Field-programmable gate array; Computer science; Chip; Electronic engineering; Electrical engineering; Computer hardware; Telecommunications; Engineering; Wireless","score_opus":0.01358203359028443,"score_gpt":0.21409251314091807,"score_spread":0.20051047955063364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142628816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8044109,0.0075729582,0.11584918,0.0020888988,0.00086525525,0.000038831597,0.00019722401,0.0013803012,0.06759645],"genre_scores_gemma":[0.9873978,0.0016491796,0.0072716866,0.00029105737,0.00011071688,0.000023143642,0.0000545938,0.00008065901,0.0031211043],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997577,0.000026454607,0.0000076151127,0.000057897458,0.000072888746,0.0000774128],"domain_scores_gemma":[0.9995376,0.00021715745,0.00006301689,0.000066058084,0.00007061213,0.00004549437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481833,0.0003254259,0.00037715439,0.00032354443,0.00039562912,0.0008217452,0.0007035194,0.00054616976,0.003929048],"category_scores_gemma":[0.0009931192,0.00026620287,0.00019861628,0.00024404451,0.00051810883,0.0018443028,0.00060280727,0.0007141141,0.0008249548],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000334876,0.00008752913,0.0018265061,0.00042238316,0.00006587447,0.0003223435,0.00025125334,0.012483051,0.87138695,0.058801,0.002345714,0.051672418],"study_design_scores_gemma":[0.000068567395,0.0010619333,0.0028159413,0.00013610935,0.00013543628,0.0011087651,0.00037895868,0.090298675,0.78806365,0.039143883,0.07669908,0.00008901012],"about_ca_topic_score_codex":0.00021068912,"about_ca_topic_score_gemma":0.00033211376,"teacher_disagreement_score":0.003929048,"about_ca_system_score_codex":0.00041389433,"about_ca_system_score_gemma":0.00024507628,"threshold_uncertainty_score":0.013143957},"labels":[],"label_agreement":null},{"id":"W2142822795","doi":"10.1109/glocom.1991.188409","title":"Head of line arbitration in ATM switches with input-output buffering and backpressure control","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Queue; Selection (genetic algorithm); Computer network; Control (management)","score_opus":0.021613004142364212,"score_gpt":0.2214502140984958,"score_spread":0.19983720995613158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142822795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86231244,0.00093417044,0.1313459,0.00023380914,0.00009463704,0.000052987984,0.000044301756,0.00055396324,0.004427756],"genre_scores_gemma":[0.99368,0.00008850083,0.005513346,0.000027497868,0.000027479256,0.000010119606,0.00001196071,0.000008397413,0.00063263293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993517,0.00026805466,0.000033465843,0.000063861706,0.00015693918,0.00012608625],"domain_scores_gemma":[0.9987997,0.00071245234,0.00015947716,0.000102216065,0.00014326394,0.00008291622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009404527,0.00022172272,0.00031373216,0.00034998404,0.00053594424,0.0011301549,0.0007453056,0.00032514028,0.0013724994],"category_scores_gemma":[0.0025865494,0.00018113153,0.00013408513,0.0004264517,0.0006084707,0.00094869046,0.0005357879,0.00033495904,0.00011663873],"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.0062757973,0.0006648537,0.018063031,0.00036753566,0.00014344935,0.0012380603,0.0008886767,0.4324026,0.17789388,0.055890128,0.0029516213,0.3032204],"study_design_scores_gemma":[0.00013563574,0.0005107241,0.001984728,0.0000078454395,0.00006335059,0.00017824375,0.00006386462,0.9619823,0.025562515,0.008399437,0.0010892055,0.000022101147],"about_ca_topic_score_codex":0.0014768983,"about_ca_topic_score_gemma":0.0015217693,"teacher_disagreement_score":0.0014768983,"about_ca_system_score_codex":0.0004664842,"about_ca_system_score_gemma":0.0005764417,"threshold_uncertainty_score":0.00497365},"labels":[],"label_agreement":null},{"id":"W2143459860","doi":"10.1109/tvlsi.2005.844285","title":"Power complexity of multiplexer-based optoelectronic crossbar switches","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"University of Waterloo; McMaster University; CMC Microsystems","keywords":"Crossbar switch; Multiplexer; CMOS; Computer science; Power (physics); Dissipation; Optical switch; Chip; Electronic engineering; Electrical engineering; Optoelectronics; Multiplexing; Physics; Engineering; Telecommunications","score_opus":0.021140788073509345,"score_gpt":0.25210384450570167,"score_spread":0.23096305643219234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143459860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88892347,0.00074038625,0.1002512,0.00023867539,0.000023569177,0.000019711197,0.00015574331,0.00024336566,0.009403924],"genre_scores_gemma":[0.9863127,0.00022110995,0.010697656,0.000028605336,0.000010924748,0.000021124762,0.00009249287,0.000024531739,0.0025909373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998629,0.00002256183,0.000006156566,0.000025224135,0.000057115543,0.000026003845],"domain_scores_gemma":[0.9995447,0.0003249197,0.000044865286,0.000026742551,0.00004825407,0.0000103941675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015776191,0.00017474883,0.00017175733,0.00021895696,0.00018896548,0.00056400854,0.00030742958,0.0001575088,0.0024169337],"category_scores_gemma":[0.0008298774,0.00015701409,0.00013573158,0.00025456966,0.00022846964,0.0007067032,0.00013771922,0.00020769647,0.00013563663],"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.00061091443,0.00012441484,0.004647109,0.0002578848,0.0000674709,0.0004708681,0.0001762226,0.47706538,0.33121413,0.06465048,0.0016607017,0.119054385],"study_design_scores_gemma":[0.000027361448,0.00026132652,0.0034271097,0.000011086054,0.000036930083,0.00021312461,0.000037556714,0.9153466,0.06449571,0.013819171,0.0023099394,0.000013975768],"about_ca_topic_score_codex":0.00046256566,"about_ca_topic_score_gemma":0.0007307818,"teacher_disagreement_score":0.0024169337,"about_ca_system_score_codex":0.00059923733,"about_ca_system_score_gemma":0.0002828233,"threshold_uncertainty_score":0.008085489},"labels":[],"label_agreement":null},{"id":"W2143983117","doi":"10.1109/iccd.1988.25677","title":"A class of fault-tolerant cellular permutation networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Université de Montréal","funders":"","keywords":"Permutation (music); Overhead (engineering); Multistage interconnection networks; Fault tolerance; Computer science; Interconnection; Class (philosophy); USable; Distributed computing; Theoretical computer science; Computer network; Algorithm; Artificial intelligence","score_opus":0.010922209060470138,"score_gpt":0.21199361347952933,"score_spread":0.20107140441905919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143983117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06865642,0.00052795175,0.9034436,0.00031201585,0.00015226378,0.0001725052,0.0003688252,0.0011643443,0.025202075],"genre_scores_gemma":[0.75651973,0.0008106937,0.21271344,0.00030238685,0.000068184265,0.00027959264,0.00091750856,0.00012216216,0.028266221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997683,0.000040060746,0.000015663289,0.000047820857,0.00008155544,0.00004662781],"domain_scores_gemma":[0.99967337,0.00006592984,0.000047028727,0.00011880587,0.00006994428,0.000024890192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017400461,0.0003258292,0.00026594513,0.00044933427,0.0005443793,0.0007861692,0.0007314633,0.00048766533,0.0046228147],"category_scores_gemma":[0.0008560353,0.00012674852,0.0003329212,0.0006146796,0.00047550997,0.0011313774,0.0004777304,0.00044247208,0.0007948834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021905947,0.000051493,0.0008866377,0.00017094072,0.000030415395,0.0005264017,0.00013458864,0.14902325,0.024412494,0.57519484,0.0066430867,0.24270678],"study_design_scores_gemma":[0.000049694034,0.00019797304,0.0005981804,0.000031065123,0.000026432956,0.0009389784,0.000059486174,0.6261878,0.014687582,0.30147502,0.055711728,0.000036076955],"about_ca_topic_score_codex":0.0014785201,"about_ca_topic_score_gemma":0.0012759349,"teacher_disagreement_score":0.0046228147,"about_ca_system_score_codex":0.0006493482,"about_ca_system_score_gemma":0.00047412247,"threshold_uncertainty_score":0.015464842},"labels":[],"label_agreement":null},{"id":"W2144241285","doi":"10.1145/2831235","title":"The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Steiner tree problem; Discrete mathematics; Cograph; Vertex (graph theory); Disjoint sets; Time complexity; Graph; 1-planar graph; Chordal graph","score_opus":0.0288699914690636,"score_gpt":0.24982395916565947,"score_spread":0.22095396769659587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144241285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10828248,0.0005496306,0.877617,0.0014679352,0.00006341361,0.00033171364,0.0011873407,0.0005199688,0.009980578],"genre_scores_gemma":[0.6251795,0.0010404742,0.36538544,0.00025905936,0.00009453431,0.000475418,0.0016224994,0.00016065285,0.0057823234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00021619255,0.000027869955,0.00016529475,0.00010651925,0.00009848236],"domain_scores_gemma":[0.9989287,0.0006586044,0.0001726318,0.00007686549,0.000089934656,0.00007317579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071044016,0.0012189368,0.00095905305,0.00074845616,0.00051694026,0.0010604853,0.0013389011,0.00150615,0.004586848],"category_scores_gemma":[0.003650981,0.0005932864,0.0007660898,0.001423957,0.0007116931,0.0022894265,0.0012765209,0.00071494485,0.00037081444],"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.0001590052,0.000101067926,0.00076086744,0.00042497047,0.00006368417,0.00025982954,0.0000898322,0.9008273,0.0027700565,0.0375215,0.003556251,0.053465627],"study_design_scores_gemma":[0.000112668335,0.00022628627,0.0004277678,0.000036187535,0.000059826907,0.00031184676,0.00013520753,0.9205226,0.0032603247,0.0679259,0.0069571375,0.000024236266],"about_ca_topic_score_codex":0.0013333167,"about_ca_topic_score_gemma":0.0015526703,"teacher_disagreement_score":0.004586848,"about_ca_system_score_codex":0.0010098654,"about_ca_system_score_gemma":0.0008305063,"threshold_uncertainty_score":0.015344501},"labels":[],"label_agreement":null},{"id":"W2144602970","doi":"10.1109/ccece.1995.528069","title":"Performance evaluation of a window-based approach for ATM cell scheduling","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Scheduling (production processes); Queue; Computer network; Priority inheritance; Priority queue; Window (computing); Distributed computing; Quality of service; Real-time computing; Dynamic priority scheduling; Rate-monotonic scheduling; Operating system; Engineering","score_opus":0.06828952497480882,"score_gpt":0.2529268175178784,"score_spread":0.18463729254306954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144602970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87965727,0.0016517475,0.11130678,0.0001581151,0.00018001704,0.00009940623,0.00012565227,0.0017445132,0.00507644],"genre_scores_gemma":[0.978288,0.00019021479,0.020738658,0.000025648844,0.00002623326,0.00002089829,0.00007110363,0.000037518792,0.000601822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.00024458286,0.00003253559,0.000091881324,0.00029027322,0.00011121639],"domain_scores_gemma":[0.997865,0.0011584723,0.00010719236,0.00017075909,0.0005162912,0.00018230002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018201892,0.00043554234,0.00037580368,0.0005206704,0.00035328767,0.00069445337,0.00090824347,0.0005032111,0.00140626],"category_scores_gemma":[0.0033348429,0.00016111108,0.00019155967,0.0006158231,0.0002958155,0.00077140424,0.0002948663,0.00042909823,0.00021016464],"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.0058025187,0.0007830917,0.008034493,0.00027072502,0.00021749426,0.00017191713,0.000250572,0.6404616,0.078444034,0.0070387777,0.002814401,0.25571036],"study_design_scores_gemma":[0.000056082943,0.00047837367,0.00094169873,0.0000046654136,0.00002976714,0.000029078692,0.000017894885,0.98843676,0.009172568,0.00034629402,0.00047420347,0.000012483044],"about_ca_topic_score_codex":0.0056604184,"about_ca_topic_score_gemma":0.002621122,"teacher_disagreement_score":0.0056604184,"about_ca_system_score_codex":0.0009896694,"about_ca_system_score_gemma":0.0008173664,"threshold_uncertainty_score":0.011254907},"labels":[],"label_agreement":null},{"id":"W2145227258","doi":"10.1109/icc.1994.368984","title":"The expanded delta fast packet switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Canada; Australian Government","keywords":"Computer science; Blocking (statistics); Network packet; Buffer overflow; Sequence (biology); Node (physics); Packet switching; Crossover switch; Computer network; Buffer (optical fiber); Asynchronous Transfer Mode; Real-time computing; Crossbar switch; Engineering; Telecommunications","score_opus":0.021765035180762303,"score_gpt":0.2151411445366752,"score_spread":0.1933761093559129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145227258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20718043,0.0033350051,0.7190235,0.0006488628,0.00080567243,0.00020987297,0.00060105935,0.005557179,0.06263843],"genre_scores_gemma":[0.7360912,0.0024219262,0.22595888,0.0005538544,0.00031463103,0.00017423747,0.0006096438,0.00011943163,0.03375612],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998932,0.000015792597,0.0000038028336,0.000018533417,0.000049390972,0.000019257888],"domain_scores_gemma":[0.99988246,0.000020820493,0.000008293572,0.000028874982,0.000039040435,0.000020336985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021618552,0.00027564392,0.000155182,0.00037586153,0.0002029827,0.00049295166,0.0007110393,0.00026451587,0.0037965307],"category_scores_gemma":[0.00021689349,0.00014305115,0.0001369918,0.00031596693,0.00023584891,0.0007352466,0.0005168688,0.0005272919,0.000548526],"study_design_candidate":"bench_or_experimental","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.0007066619,0.00021610339,0.0028541638,0.00026152254,0.00004030774,0.001080176,0.00014735131,0.064766265,0.1500749,0.10765989,0.02228829,0.6499044],"study_design_scores_gemma":[0.00021090628,0.0011248168,0.0041175024,0.000080125305,0.00010277055,0.0037534467,0.00007564064,0.6173475,0.085524514,0.03936037,0.24820033,0.00010209222],"about_ca_topic_score_codex":0.0006164599,"about_ca_topic_score_gemma":0.0007607351,"teacher_disagreement_score":0.0037965307,"about_ca_system_score_codex":0.00030587104,"about_ca_system_score_gemma":0.0005002431,"threshold_uncertainty_score":0.012700617},"labels":[],"label_agreement":null},{"id":"W2146111009","doi":"10.1109/snpd-sawn.2006.70","title":"The global fault-tolerance of interconnection networks","year":2006,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Hypercube; Interconnection; De Bruijn graph; Computer science; Fault tolerance; De Bruijn sequence; Metric (unit); Theoretical computer science; Graph theory; Graph; Distributed computing; Topology (electrical circuits); Mathematics; Discrete mathematics; Parallel computing; Combinatorics; Computer network; Engineering","score_opus":0.005124988931339464,"score_gpt":0.21067299574338652,"score_spread":0.20554800681204705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146111009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12384942,0.004490719,0.85911644,0.00071771926,0.00018734248,0.00004719841,0.00017592385,0.00039956905,0.011015571],"genre_scores_gemma":[0.93743163,0.0024279102,0.05692532,0.00012519168,0.00013007142,0.00007816564,0.00019227911,0.00011691539,0.00257253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900013,0.00021657834,0.000055432974,0.00023014708,0.00034475114,0.0001529535],"domain_scores_gemma":[0.99847144,0.00047826284,0.0002980529,0.00037397706,0.0002908735,0.00008734756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008062507,0.00070912443,0.00090810505,0.0008371841,0.00059697876,0.0016061057,0.00089212373,0.0008226293,0.0018055367],"category_scores_gemma":[0.0029616205,0.00020991832,0.0005391075,0.0012061899,0.0015634759,0.0033318268,0.001442644,0.0009956107,0.00024739464],"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.00024258705,0.00003324606,0.003329483,0.0008497528,0.00016472457,0.00026892635,0.000426627,0.3437927,0.025887208,0.4485594,0.0021921748,0.1742532],"study_design_scores_gemma":[0.000037967813,0.0007356379,0.003999251,0.0002372694,0.0002350591,0.001111728,0.0005281934,0.3380797,0.045174934,0.5641489,0.04562447,0.00008682013],"about_ca_topic_score_codex":0.00042871656,"about_ca_topic_score_gemma":0.00030739093,"teacher_disagreement_score":0.0018055367,"about_ca_system_score_codex":0.0007264238,"about_ca_system_score_gemma":0.00043558216,"threshold_uncertainty_score":0.006040156},"labels":[],"label_agreement":null},{"id":"W2146157546","doi":"10.1109/hpcs.2005.15","title":"Applying Fault-Tolerant Solutions of Circulant Graphs to Meshes and Hypercubes","year":2005,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Hypercube; Circulant matrix; Polygon mesh; Computer science; Fault tolerance; Theoretical computer science; Parallel computing; Distributed computing; Algorithm","score_opus":0.023415766990690107,"score_gpt":0.23339790996053336,"score_spread":0.20998214296984324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146157546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03324011,0.00097615644,0.9535271,0.00035600096,0.00031132362,0.00006243037,0.000024116225,0.00024619457,0.011256512],"genre_scores_gemma":[0.6007813,0.0032871158,0.3873064,0.0004249681,0.00030929118,0.00019174095,0.00010143352,0.00012989788,0.0074678534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997303,0.00009311366,0.000016139935,0.000032996126,0.00009229271,0.000035205954],"domain_scores_gemma":[0.9996214,0.00014544043,0.00006097813,0.000055995322,0.00009060785,0.00002555461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033384195,0.0005893593,0.000406322,0.0006861289,0.0005909751,0.0006237966,0.00062635384,0.00070221955,0.001542012],"category_scores_gemma":[0.0018463527,0.00020868005,0.00045985266,0.0006745015,0.00050122873,0.0007449924,0.00081174955,0.0005695685,0.00034288818],"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.00007642503,0.00006034732,0.00025048622,0.00027752356,0.000058159836,0.00029123412,0.00019365648,0.49523994,0.035496328,0.34426025,0.0036955003,0.12010018],"study_design_scores_gemma":[0.000034601926,0.00010238318,0.000108108696,0.00003106996,0.000022117794,0.000136654,0.000060517596,0.7833144,0.012064965,0.19407032,0.010030922,0.000023902587],"about_ca_topic_score_codex":0.0011757106,"about_ca_topic_score_gemma":0.001409563,"teacher_disagreement_score":0.001542012,"about_ca_system_score_codex":0.00055132527,"about_ca_system_score_gemma":0.0005395514,"threshold_uncertainty_score":0.005158484},"labels":[],"label_agreement":null},{"id":"W2146701410","doi":"10.1109/iccd.1988.25762","title":"A self-reconfiguration scheme for fault-tolerant VLSI processor arrays","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McGill University","funders":"","keywords":"Control reconfiguration; Very-large-scale integration; Computer science; Interconnection; Overhead (engineering); Modular design; Parallel computing; Fault tolerance; Scheme (mathematics); Embedded system; Process (computing); Application-specific integrated circuit; Computer hardware; Distributed computing; Computer network; Mathematics","score_opus":0.016755482565732463,"score_gpt":0.23959692545019504,"score_spread":0.22284144288446256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146701410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09791334,0.0007307529,0.8869767,0.00022475063,0.00014649551,0.000059416838,0.000077767654,0.00260532,0.011265453],"genre_scores_gemma":[0.8047189,0.00038253987,0.18353158,0.00012359401,0.00007155139,0.00010180983,0.00017612515,0.00013443538,0.010759448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998971,0.000023417646,0.000008733428,0.000019788078,0.000036515095,0.000014461218],"domain_scores_gemma":[0.999835,0.000032223037,0.00002375382,0.000056796256,0.00003730826,0.0000149279795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012261892,0.00019878318,0.00016140229,0.00032795835,0.00036636036,0.0003045825,0.0005480241,0.00025837272,0.0020927747],"category_scores_gemma":[0.0003293046,0.00010771625,0.00015842036,0.00027166647,0.00025302728,0.0006810764,0.00039163948,0.00024822276,0.00036841593],"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.00036471136,0.00008872863,0.00057389087,0.00024574672,0.000048101036,0.00040303203,0.00035148824,0.15271004,0.29782978,0.08197463,0.007785716,0.45762408],"study_design_scores_gemma":[0.00008010807,0.00048591502,0.0007710953,0.000029756875,0.00004717847,0.0006465963,0.00005420895,0.8302237,0.09486482,0.03609036,0.03665511,0.000051246334],"about_ca_topic_score_codex":0.00037546363,"about_ca_topic_score_gemma":0.0007680283,"teacher_disagreement_score":0.0020927747,"about_ca_system_score_codex":0.00033713435,"about_ca_system_score_gemma":0.0001368012,"threshold_uncertainty_score":0.0070010424},"labels":[],"label_agreement":null},{"id":"W2146798765","doi":"10.1109/cnsr.2007.36","title":"Hybrid Maximal Matching for Input Buffered Crossbar Switches","year":2007,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Crossbar switch; Computer science; Scheduling (production processes); Bottleneck; Computer network; Distributed computing; Parallel computing; Embedded system; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.020343743950768305,"score_gpt":0.26091837322507616,"score_spread":0.24057462927430787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146798765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05361082,0.00021528461,0.94201714,0.00011037604,0.00006573342,0.00005254146,0.00006745293,0.0008456104,0.003015051],"genre_scores_gemma":[0.67447454,0.0001551357,0.3222728,0.00008841718,0.00003438327,0.00007681085,0.00013661083,0.0000772556,0.002684068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997094,0.000075326476,0.000019021934,0.000055130684,0.00008591452,0.000055155084],"domain_scores_gemma":[0.9996815,0.0001465287,0.000042052103,0.000043640615,0.000057587265,0.00002875265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068664044,0.00032290717,0.00037207012,0.0004937424,0.00041057507,0.0006726688,0.0009517092,0.000372047,0.0024001626],"category_scores_gemma":[0.00134278,0.00017930643,0.0002807391,0.00065875833,0.00029625068,0.0008593472,0.0006719256,0.0003521224,0.00028363825],"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.00089910976,0.00020739129,0.0016962157,0.00023163964,0.00009659972,0.00015457657,0.00018978243,0.30286998,0.04976515,0.14131364,0.004689486,0.49788633],"study_design_scores_gemma":[0.000053826792,0.00009596487,0.0002656575,0.000010678709,0.00001852026,0.000051238596,0.00002256362,0.9468112,0.01641101,0.034149043,0.0020983976,0.000011878202],"about_ca_topic_score_codex":0.0013310385,"about_ca_topic_score_gemma":0.0011919866,"teacher_disagreement_score":0.0024001626,"about_ca_system_score_codex":0.0008779374,"about_ca_system_score_gemma":0.0007740481,"threshold_uncertainty_score":0.008029342},"labels":[],"label_agreement":null},{"id":"W2146938890","doi":"10.1109/rsp.2008.15","title":"A Multi-MicroBlaze Based SOC System: From SystemC Modeling to FPGA Prototyping","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"CMC Microsystems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"MPSoC; MicroBlaze; SystemC; Field-programmable gate array; Embedded system; Computer science; System on a chip; FPGA prototype; Software prototyping; Computer architecture; Reconfigurability; Virtual prototyping; Software; Simulation; Operating system; Software development","score_opus":0.04853510282047302,"score_gpt":0.23935912304713086,"score_spread":0.19082402022665784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146938890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076833025,0.00082365784,0.87683916,0.00083619903,0.00013893077,0.00040572917,0.0003581326,0.010595611,0.03316956],"genre_scores_gemma":[0.5227626,0.0013564654,0.46045542,0.00023951702,0.000052016705,0.00042730095,0.00045866577,0.00070281915,0.013545154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959,0.000094345036,0.000014583299,0.000040470357,0.00021321165,0.000047536712],"domain_scores_gemma":[0.99974054,0.00009004431,0.00001659475,0.0000542702,0.00007561449,0.000023026307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039563232,0.0005472544,0.00036991533,0.00040940117,0.00037346935,0.0010465397,0.00077333144,0.0005064302,0.004526281],"category_scores_gemma":[0.00084312656,0.0003215702,0.00030141015,0.00020666845,0.00054900226,0.0006678438,0.0004973239,0.0007389421,0.0010073223],"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.0004462632,0.00012750173,0.0018685156,0.00072073564,0.000077857185,0.0012426561,0.00081494363,0.48924103,0.13025776,0.11180286,0.01162976,0.2517701],"study_design_scores_gemma":[0.00009486824,0.00033418025,0.00092757755,0.00010064338,0.000042815922,0.00037662656,0.00006913142,0.8495044,0.07421338,0.008433432,0.06583909,0.00006386067],"about_ca_topic_score_codex":0.0065040383,"about_ca_topic_score_gemma":0.005184853,"teacher_disagreement_score":0.0065040383,"about_ca_system_score_codex":0.0008867824,"about_ca_system_score_gemma":0.0013763189,"threshold_uncertainty_score":0.015141964},"labels":[],"label_agreement":null},{"id":"W2147016284","doi":"10.1109/ccece.1993.332411","title":"A fair and simple mechanism for contention resolution in Batcher-Banyan networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Canada; Australian Government","keywords":"Computer science; Banyan; Overhead (engineering); Computer network; Process (computing); Algorithm; Hypercube; Theoretical computer science; Parallel computing; Programming language","score_opus":0.03231840067360317,"score_gpt":0.22657670300533114,"score_spread":0.19425830233172797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147016284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00551506,0.00034746178,0.98930055,0.00015757437,0.00017466843,0.00022574973,0.00004866654,0.0013123023,0.0029178853],"genre_scores_gemma":[0.251491,0.0005861415,0.7300165,0.0002667596,0.00030796614,0.0005517744,0.00015445414,0.0002407365,0.01638472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772686,0.00058851595,0.00018369876,0.00035716916,0.0008466321,0.0002972668],"domain_scores_gemma":[0.99740183,0.00088602724,0.00018636671,0.0007770743,0.0005887777,0.00016000782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037963972,0.00080677634,0.001000117,0.0015280043,0.0023603735,0.0028734952,0.004123616,0.0014097247,0.0059864675],"category_scores_gemma":[0.0066695567,0.00058708986,0.00066871283,0.0015541859,0.0019283354,0.0041971807,0.0017101013,0.0016773607,0.0013313784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008997878,0.00034858863,0.00064695475,0.00031387102,0.00010256147,0.0003397071,0.0005459501,0.07331882,0.03778665,0.58847153,0.011050423,0.28617522],"study_design_scores_gemma":[0.00028103747,0.0004974425,0.0003924675,0.00006096258,0.00013460517,0.00050798536,0.00008870459,0.63537896,0.056594864,0.25332022,0.05252635,0.00021630514],"about_ca_topic_score_codex":0.0032450813,"about_ca_topic_score_gemma":0.003919112,"teacher_disagreement_score":0.0059864675,"about_ca_system_score_codex":0.0020205113,"about_ca_system_score_gemma":0.002557964,"threshold_uncertainty_score":0.020077527},"labels":[],"label_agreement":null},{"id":"W2147120671","doi":"10.1109/phosst.2010.5553678","title":"Multi-plane optical interconnection for energy-proportional network architectures","year":2010,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Interconnection; Dissipation; Computer science; Network architecture; Metric (unit); Architecture; Power (physics); Energy (signal processing); Forwarding plane; Wavelength; Efficient energy use; Topology (electrical circuits); Electronic engineering; Computer network; Electrical engineering; Physics; Engineering; Optoelectronics","score_opus":0.01392054292810898,"score_gpt":0.24521667239458544,"score_spread":0.23129612946647646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147120671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53448904,0.0018578859,0.44389057,0.00043555684,0.00013268844,0.000057926503,0.00006838507,0.0003490255,0.018718973],"genre_scores_gemma":[0.9515618,0.00040004705,0.045656536,0.000038768874,0.000030091958,0.000022572662,0.000029458442,0.00002000609,0.0022408387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986017,0.000037774123,0.000006154248,0.000018835897,0.000058430764,0.000018575538],"domain_scores_gemma":[0.999833,0.00005646572,0.000039292117,0.000031644086,0.000030790863,0.000008823665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024128525,0.00028562304,0.00015296527,0.00023515263,0.00033156044,0.00054998323,0.0004071419,0.0002126419,0.0018002627],"category_scores_gemma":[0.0003784932,0.00009568069,0.00016330657,0.0003109972,0.00020518075,0.0009283778,0.00024390378,0.00024497887,0.00014214571],"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.00053948874,0.00023826944,0.0015227526,0.0004419588,0.00007107902,0.00038128,0.00014293256,0.44913927,0.25214726,0.13104287,0.0021937885,0.16213912],"study_design_scores_gemma":[0.000020390606,0.00031471168,0.00094171474,0.000018625089,0.000038051603,0.0003137484,0.00004997221,0.92959535,0.04635601,0.014646079,0.0076906676,0.000014783906],"about_ca_topic_score_codex":0.00021606062,"about_ca_topic_score_gemma":0.00061633094,"teacher_disagreement_score":0.0018002627,"about_ca_system_score_codex":0.00031800137,"about_ca_system_score_gemma":0.0001586586,"threshold_uncertainty_score":0.006022513},"labels":[],"label_agreement":null},{"id":"W2147235956","doi":"10.1109/hpca.1997.569606","title":"A performance comparison of hierarchical ring- and mesh-connected multiprocessor networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":53,"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":"Polygon mesh; Computer science; Locality; Router; Parallel computing; Distributed computing; Multiprocessing; Network topology; Locality of reference; Switched mesh; Mesh networking; Computer network; Topology (electrical circuits); Cache; Operating system; Wireless mesh network; Mathematics","score_opus":0.025790067688013646,"score_gpt":0.24378017750566705,"score_spread":0.2179901098176534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147235956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95927864,0.0006269809,0.031204093,0.00017571056,0.00003378156,0.00006437361,0.00020742539,0.0008001725,0.0076089487],"genre_scores_gemma":[0.9919526,0.00012752503,0.007289707,0.000015089326,0.000005596255,0.000018850347,0.00013654795,0.000020467498,0.00043358403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995389,0.00015735542,0.00002473508,0.0000601968,0.00015116857,0.00006758343],"domain_scores_gemma":[0.9984542,0.00083603914,0.0001295942,0.00017792494,0.00031582869,0.00008642449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070379704,0.0002759626,0.00026601003,0.00052343553,0.0002582348,0.00048435896,0.000591542,0.00035581173,0.0013872241],"category_scores_gemma":[0.0035120992,0.00013798449,0.00018436693,0.00073350576,0.00027933874,0.0010716323,0.0004070928,0.00014845011,0.00017916373],"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.0010936962,0.00016752777,0.0089186095,0.00025063587,0.00009255662,0.00011486036,0.00010467436,0.9050954,0.016077435,0.004229208,0.0010985571,0.062756814],"study_design_scores_gemma":[0.000036302343,0.0003292434,0.0023314715,0.000008039005,0.000022298498,0.000029660008,0.000044652475,0.9886097,0.006932816,0.001062559,0.0005829929,0.000010327013],"about_ca_topic_score_codex":0.0032328058,"about_ca_topic_score_gemma":0.0029055467,"teacher_disagreement_score":0.0032328058,"about_ca_system_score_codex":0.0007058655,"about_ca_system_score_gemma":0.00046043357,"threshold_uncertainty_score":0.0064280033},"labels":[],"label_agreement":null},{"id":"W2147776133","doi":"10.1109/glocom.1990.116815","title":"Design and performance analysis of a buffer subsystem for the Batcher-Banyan switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Banyan; Overhead (engineering); Computer science; Network packet; Connection (principal bundle); Packet switching; Computer network; Algorithm; Engineering; Operating system","score_opus":0.046494826033965084,"score_gpt":0.22497568487363812,"score_spread":0.17848085883967302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147776133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25867283,0.0013144612,0.72391146,0.0003962217,0.00010803563,0.00043721544,0.00029212187,0.0063510938,0.008516516],"genre_scores_gemma":[0.914817,0.00032787665,0.07881923,0.00009473353,0.00005341568,0.00015276586,0.00022263815,0.0001426849,0.0053697615],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951625,0.000098253644,0.00002081781,0.00010406195,0.00018380495,0.000076696524],"domain_scores_gemma":[0.999246,0.00029240182,0.000091214584,0.00007426034,0.00024354066,0.00005248719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068759586,0.00065869116,0.00047922277,0.0007627386,0.00071141846,0.001406116,0.001449455,0.00053932023,0.0043350244],"category_scores_gemma":[0.0010043407,0.00034951224,0.00030160043,0.0004813725,0.00038055636,0.0010351046,0.00031151233,0.00050177105,0.00049894734],"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.0026911367,0.00061390095,0.008573291,0.0007952519,0.00031823473,0.00040433183,0.00066150323,0.28001583,0.44245034,0.03903666,0.009555341,0.21488422],"study_design_scores_gemma":[0.000107796266,0.0016073518,0.0025233617,0.000024325285,0.00016224662,0.00020736465,0.00007632362,0.85306907,0.13154507,0.0020247444,0.00859081,0.00006154928],"about_ca_topic_score_codex":0.0071862517,"about_ca_topic_score_gemma":0.005067265,"teacher_disagreement_score":0.0071862517,"about_ca_system_score_codex":0.0017698599,"about_ca_system_score_gemma":0.00186544,"threshold_uncertainty_score":0.0145020485},"labels":[],"label_agreement":null},{"id":"W2147835010","doi":"10.1109/tc.2012.201","title":"Holistic Routing Algorithm Design to Support Workload Consolidation in NoCs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"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; Workload; Distributed computing; Routing (electronic design automation); Consolidation (business); Computer network; Network congestion","score_opus":0.06089908564678301,"score_gpt":0.28574219896270053,"score_spread":0.22484311331591753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147835010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066415675,0.0008232784,0.92676,0.00017780345,0.000086312364,0.00009563662,0.000054852495,0.0013608289,0.004225682],"genre_scores_gemma":[0.5984298,0.00055299455,0.39868048,0.00020883164,0.000053594154,0.00015794393,0.0001667697,0.00017091921,0.0015786209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995746,0.00010046012,0.000044299537,0.000067742396,0.00015249831,0.000060303297],"domain_scores_gemma":[0.9995721,0.000070846676,0.00005717789,0.000090905014,0.00017865066,0.000030298621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063166866,0.0005471386,0.000531123,0.00059182144,0.00025722486,0.0007967876,0.0010712317,0.00034742543,0.00094555103],"category_scores_gemma":[0.0011474054,0.0002696123,0.00033102607,0.00045242647,0.00022774562,0.0010071952,0.00064547977,0.00044460708,0.00032004277],"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.0001785578,0.00012730187,0.0020439974,0.000318919,0.000153318,0.00014713546,0.00010788391,0.5288292,0.1613746,0.015039331,0.0032181859,0.28846157],"study_design_scores_gemma":[0.000035457422,0.00025504598,0.0006306996,0.000018128992,0.00006791319,0.00024240877,0.000041105646,0.96168447,0.026704876,0.0048943055,0.0054005054,0.00002523523],"about_ca_topic_score_codex":0.00049446255,"about_ca_topic_score_gemma":0.0011726705,"teacher_disagreement_score":0.0010712317,"about_ca_system_score_codex":0.00045911115,"about_ca_system_score_gemma":0.0008166155,"threshold_uncertainty_score":0.0033406615},"labels":[],"label_agreement":null},{"id":"W2148030923","doi":"10.1109/ipdps.2007.370480","title":"10-Gigabit iWARP Ethernet: Comparative Performance Analysis with InfiniBand and Myrinet-10G","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"InfiniBand; Myrinet; Gigabit Ethernet; Carrier Ethernet; Remote direct memory access; Computer science; Computer network; Ethernet over PDH; Metro Ethernet; Network interface controller; ATA over Ethernet; Operating system; Synchronous Ethernet; Embedded system; Ethernet; Ethernet flow control; Distributed computing","score_opus":0.017464753628158098,"score_gpt":0.2417803891572879,"score_spread":0.22431563552912978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148030923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9830142,0.0017197478,0.0040759784,0.00013496491,0.000039327853,0.00002561581,0.0003579698,0.00073945255,0.009892762],"genre_scores_gemma":[0.995159,0.00062047684,0.0022131095,0.00001781822,0.000022515063,0.0000132651385,0.00069579174,0.00007099752,0.0011870326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903595,0.00015322938,0.000050310806,0.00010619154,0.00045187713,0.00020260083],"domain_scores_gemma":[0.9982134,0.00084680016,0.00015983546,0.00016977685,0.00049505016,0.00011515591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009831196,0.00044338094,0.00044904955,0.0016361753,0.000269313,0.00066454423,0.0007184809,0.0004997458,0.002538625],"category_scores_gemma":[0.0025142506,0.00012228357,0.00025368697,0.0030062932,0.0002489428,0.0012501618,0.00035956057,0.00037848434,0.0005190314],"study_design_candidate":"bench_or_experimental","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.013167153,0.002060698,0.073963396,0.0015636599,0.00060810026,0.001529288,0.00066388265,0.3836375,0.13155359,0.013291707,0.018505763,0.35945526],"study_design_scores_gemma":[0.00036683478,0.011097202,0.14902867,0.00008896504,0.00050841103,0.0011387106,0.0007760265,0.7099004,0.10985856,0.0028104184,0.0142443,0.0001815477],"about_ca_topic_score_codex":0.0028346747,"about_ca_topic_score_gemma":0.0016346268,"teacher_disagreement_score":0.0028346747,"about_ca_system_score_codex":0.00072055537,"about_ca_system_score_gemma":0.0003911233,"threshold_uncertainty_score":0.008492529},"labels":[],"label_agreement":null},{"id":"W2148137421","doi":"10.1109/pacrim.1991.160694","title":"Hypercycles: a status report","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Interconnection; Degree (music); Routing (electronic design automation); Block (permutation group theory); Router; Class (philosophy); Theoretical computer science; Variety (cybernetics); Dimension (graph theory); Simple (philosophy); Network topology; Point (geometry); Topology (electrical circuits); Computer network; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.02653242437585693,"score_gpt":0.22089191561677612,"score_spread":0.1943594912409192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148137421","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031359788,0.2872051,0.122136086,0.019028783,0.021432636,0.0014809741,0.0061256774,0.008578012,0.502653],"genre_scores_gemma":[0.13696918,0.3099878,0.072897635,0.0057287957,0.007897377,0.0011892623,0.022764985,0.0029514858,0.43961334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.00012850304,0.000081111975,0.00021818723,0.0005835096,0.00021266614],"domain_scores_gemma":[0.99622774,0.0004502809,0.0001554118,0.0003774151,0.0019228738,0.000866239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027281763,0.0008179484,0.0005433422,0.0030461184,0.0011785608,0.0046663163,0.0015212108,0.0020260832,0.03023397],"category_scores_gemma":[0.0038013256,0.0006719621,0.00049729785,0.0039069178,0.0009837811,0.0075668995,0.0027408886,0.0013741447,0.015791133],"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.0002456206,0.00023512954,0.0011673511,0.0011634436,0.00004406159,0.00022261278,0.00024042123,0.004058916,0.0031142728,0.058476035,0.31240445,0.6186276],"study_design_scores_gemma":[0.000013282876,0.00012208942,0.0002991663,0.00021408874,0.000016417109,0.00013003293,0.000060496077,0.0013016742,0.0023244775,0.004970049,0.9905281,0.000020166639],"about_ca_topic_score_codex":0.0041673444,"about_ca_topic_score_gemma":0.002409823,"teacher_disagreement_score":0.03023397,"about_ca_system_score_codex":0.0016269183,"about_ca_system_score_gemma":0.0030818311,"threshold_uncertainty_score":0.101142764},"labels":[],"label_agreement":null},{"id":"W2148378726","doi":"10.1109/ccece.1998.685549","title":"MINDEC: a routing algorithm for distributed communication networks with multiservice flows","year":2002,"lang":"en","type":"article","venue":"","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":"Université TÉLUQ","funders":"","keywords":"Heuristics; Computer science; Distributed computing; Routing (electronic design automation); Network routing; Static routing; Distributed algorithm; Routing algorithm; Link-state routing protocol; Conjunction (astronomy); Destination-Sequenced Distance Vector routing; Computer network; Algorithm; Routing protocol","score_opus":0.019206425929766322,"score_gpt":0.221518346985427,"score_spread":0.20231192105566068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148378726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053691235,0.00014731033,0.99171597,0.00008523448,0.000039457173,0.000058852325,0.000057732406,0.0011428167,0.0013834863],"genre_scores_gemma":[0.10482853,0.00020216484,0.8918287,0.00007689362,0.000022562917,0.0001349637,0.0002363443,0.00017120226,0.0024985655],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974245,0.00006549227,0.000016162543,0.000045833032,0.00009348593,0.000036569134],"domain_scores_gemma":[0.99964726,0.00014430545,0.000038451126,0.000057721267,0.00008616609,0.000026010686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062138366,0.00043835762,0.00041184868,0.00068427215,0.00057298085,0.0007929357,0.0010199604,0.0005892509,0.002464344],"category_scores_gemma":[0.0020725282,0.00027363581,0.0002973228,0.0006402596,0.00040903952,0.0013425268,0.0013314049,0.00087512203,0.0005403401],"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.0003071264,0.00007774019,0.0009380947,0.00020752079,0.00004495731,0.00012680097,0.00016599905,0.35007536,0.010250462,0.07465703,0.010027321,0.5531216],"study_design_scores_gemma":[0.00008644173,0.000070972244,0.00017555666,0.000021772448,0.000015857811,0.00016696502,0.000030099895,0.93919635,0.005607381,0.031752795,0.022854567,0.00002125475],"about_ca_topic_score_codex":0.0014858186,"about_ca_topic_score_gemma":0.00212548,"teacher_disagreement_score":0.002464344,"about_ca_system_score_codex":0.00059912144,"about_ca_system_score_gemma":0.0009263239,"threshold_uncertainty_score":0.008244097},"labels":[],"label_agreement":null},{"id":"W2148439970","doi":"10.1109/icppw.2010.22","title":"Power and Performance Tabu Search Based Multicore Network-on-Chip Design","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Tabu search; Floorplan; Computer science; Benchmark (surveying); Network topology; Network on a chip; Multi-core processor; Power (physics); Topology (electrical circuits); Heuristic; Distributed computing; Embedded system; Parallel computing; Engineering; Computer network; Algorithm","score_opus":0.02380277086340093,"score_gpt":0.2380479295263337,"score_spread":0.21424515866293276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148439970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11017109,0.0015297112,0.86828226,0.00032348593,0.0000797832,0.00022007135,0.0002777782,0.0028518352,0.016263962],"genre_scores_gemma":[0.4893229,0.00041615483,0.50599605,0.0001381911,0.00002065572,0.0003532054,0.0003732112,0.00022395821,0.0031557549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936944,0.00030528658,0.000021085854,0.000058830512,0.00017445456,0.000070923765],"domain_scores_gemma":[0.9991073,0.00044228227,0.00008913657,0.00009694997,0.00023996882,0.000024334886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097227615,0.00065655366,0.0005319922,0.0010381592,0.0005458091,0.0008514459,0.0011589631,0.0005283643,0.0036602847],"category_scores_gemma":[0.0023738265,0.0003211979,0.00043204235,0.0010814329,0.000398096,0.000662813,0.00040901906,0.0004196711,0.00040706233],"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.00012260397,0.000071283364,0.00091121177,0.00013938102,0.000058038477,0.00004603945,0.00005862077,0.8375742,0.0063810092,0.007710834,0.0022101055,0.1447166],"study_design_scores_gemma":[0.000026408326,0.000065098844,0.00022867792,0.000008838665,0.000016087975,0.000024465393,0.000015661166,0.9929269,0.0030230456,0.0024819523,0.0011755502,0.000007241729],"about_ca_topic_score_codex":0.0036583878,"about_ca_topic_score_gemma":0.006375953,"teacher_disagreement_score":0.0036602847,"about_ca_system_score_codex":0.0012081722,"about_ca_system_score_gemma":0.0016553097,"threshold_uncertainty_score":0.01224488},"labels":[],"label_agreement":null},{"id":"W2149121209","doi":"10.1109/icc.1995.524215","title":"ANN approach for congestion control in packet switch OBP satellite","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Network packet; Estimator; Artificial neural network; Traffic intensity; Queue; Frame (networking); Real-time computing; Telecommunications link; Computer network; Network congestion; Throughput; Poisson distribution; Control theory (sociology); Mathematics; Control (management); Artificial intelligence; Telecommunications; Statistics","score_opus":0.02846839035705831,"score_gpt":0.21820733099683504,"score_spread":0.18973894063977673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149121209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17312929,0.0014029194,0.8178141,0.0006785249,0.00014522325,0.000045202152,0.00007596738,0.00057668285,0.0061321226],"genre_scores_gemma":[0.9682101,0.00036259723,0.027409459,0.000070440445,0.00006493395,0.000055334018,0.00004307721,0.000027217468,0.0037567613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999882,0.00003621988,0.000006586776,0.000024181683,0.000027028867,0.00002398092],"domain_scores_gemma":[0.9996811,0.00018394295,0.000032245778,0.000009145909,0.00008060656,0.000013002653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038766474,0.0004099618,0.000430193,0.00036402067,0.00034763318,0.0005851143,0.0004971239,0.00064028095,0.0011522049],"category_scores_gemma":[0.0010640804,0.00025369736,0.0002593095,0.00027162113,0.00033060313,0.00048022333,0.0002646266,0.0006720158,0.00009407939],"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.000037364687,0.000015842508,0.0005588633,0.000018822688,0.000017641449,0.000046772588,0.000017509758,0.97786295,0.0009807879,0.0027407964,0.00021723735,0.017485403],"study_design_scores_gemma":[7.696354e-7,0.000002966135,0.000052451753,7.387266e-7,0.0000012191989,0.000001656906,0.0000011866085,0.99937445,0.00008482898,0.00043904647,0.000039865037,8.4743743e-7],"about_ca_topic_score_codex":0.0123375235,"about_ca_topic_score_gemma":0.0077601066,"teacher_disagreement_score":0.0123375235,"about_ca_system_score_codex":0.00085947366,"about_ca_system_score_gemma":0.00048141583,"threshold_uncertainty_score":0.024531424},"labels":[],"label_agreement":null},{"id":"W2150475116","doi":"10.1109/ipdps.2007.370577","title":"Incorporating Latency in Heterogeneous Graph Partitioning","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 New Brunswick","funders":"","keywords":"Computer science; Polygon mesh; Parallel computing; Latency (audio); Graph partition; Bandwidth (computing); Distributed computing; Graph; Theoretical computer science; Computer network","score_opus":0.015277426100585835,"score_gpt":0.23957869521110695,"score_spread":0.22430126911052112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150475116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21623296,0.0005350497,0.77929324,0.00026417192,0.00007101976,0.000052816373,0.00008222989,0.00091676257,0.0025517372],"genre_scores_gemma":[0.91081333,0.0003082728,0.087118655,0.000057217472,0.000038882303,0.000053882435,0.00010890303,0.00024096094,0.0012599152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.0001926682,0.000021038713,0.00007870074,0.00013000975,0.00009071583],"domain_scores_gemma":[0.9971077,0.0018887818,0.00025151786,0.00034951215,0.00030349608,0.00009902711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011748709,0.00072542625,0.0005283326,0.0007328528,0.00058067916,0.00080428476,0.00085143826,0.0006419858,0.00063433766],"category_scores_gemma":[0.007848652,0.00037153912,0.00038218987,0.0010400133,0.0004994712,0.0022316384,0.00094953825,0.00055515365,0.00013871837],"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.000070670285,0.000022575434,0.0010873891,0.000021647771,0.000012436463,0.00005649699,0.000053955016,0.9701028,0.002837403,0.006126994,0.00019400155,0.019413527],"study_design_scores_gemma":[0.000004894791,0.000013639604,0.00018114131,0.0000020533087,0.0000062891313,0.000012534131,0.0000115754065,0.9938818,0.0013404101,0.0043287063,0.00021203939,0.0000049384957],"about_ca_topic_score_codex":0.008168045,"about_ca_topic_score_gemma":0.008342147,"teacher_disagreement_score":0.008168045,"about_ca_system_score_codex":0.001251526,"about_ca_system_score_gemma":0.0009587768,"threshold_uncertainty_score":0.016241014},"labels":[],"label_agreement":null},{"id":"W2151071289","doi":"10.1109/icwsi.1993.255261","title":"Fault tolerance in a wafer scale environment","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government; CMC Microsystems","keywords":"Computer science; Nondeterministic algorithm; USable; Set (abstract data type); Network packet; Fault tolerance; Routing (electronic design automation); Wafer-scale integration; Scale (ratio); Backplane; Distributed computing; Parallel computing; Very-large-scale integration; Algorithm; Embedded system; Computer network; Computer hardware","score_opus":0.014407723938143572,"score_gpt":0.1918296860628057,"score_spread":0.17742196212466213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151071289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20804054,0.003020876,0.7386732,0.0014395221,0.00038244363,0.00005588478,0.0003124714,0.005545726,0.042529322],"genre_scores_gemma":[0.9070862,0.0015155489,0.07952543,0.00029621364,0.00010160489,0.00008408005,0.00029354292,0.00021915368,0.010878225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998355,0.000027671005,0.000005666835,0.00003142517,0.000065359905,0.00003440167],"domain_scores_gemma":[0.999795,0.0000735489,0.000031729367,0.00005775513,0.000029738556,0.0000121778685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116901065,0.00023895576,0.0003269216,0.00021978043,0.00028326208,0.0006224233,0.00045782997,0.000644079,0.0029189708],"category_scores_gemma":[0.00059642375,0.000119499746,0.0001997177,0.0002978088,0.0003948825,0.000587552,0.00065750006,0.00033774367,0.0010234285],"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.00021774726,0.000070866095,0.0018550085,0.00035400692,0.000055019565,0.0012897506,0.00016824422,0.4697841,0.18427478,0.07332237,0.012415686,0.25619242],"study_design_scores_gemma":[0.000074462594,0.0004839123,0.0022030203,0.00004723125,0.0000453362,0.0011382231,0.0001594041,0.7598877,0.08726272,0.078480706,0.07015823,0.00005905933],"about_ca_topic_score_codex":0.00028499577,"about_ca_topic_score_gemma":0.0003271982,"teacher_disagreement_score":0.0029189708,"about_ca_system_score_codex":0.00027611683,"about_ca_system_score_gemma":0.00022747174,"threshold_uncertainty_score":0.00976491},"labels":[],"label_agreement":null},{"id":"W2151196473","doi":"10.1109/ccece.2007.240","title":"Introducing OperaNP: A Reconfigurable NoC-Based Platform","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Routing (electronic design automation); Computer science; Field-programmable gate array; Computer architecture; Embedded system; Network on a chip; System on a chip; Architecture; Programmable logic device; Network topology; Computer network","score_opus":0.018044244644285022,"score_gpt":0.240570498112564,"score_spread":0.22252625346827898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151196473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08263816,0.0017910991,0.81427425,0.0011366855,0.0011449934,0.00028454885,0.00021585265,0.003927926,0.0945864],"genre_scores_gemma":[0.44639847,0.0015148623,0.5243147,0.00063590443,0.0002480348,0.00024842506,0.0004106115,0.00019679751,0.026032286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982494,0.000025531017,0.000007550683,0.000028525292,0.000077919394,0.000035609686],"domain_scores_gemma":[0.99986815,0.0000324059,0.000014611751,0.000026109046,0.000030216974,0.00002840924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020915613,0.0003761223,0.00020836153,0.00025038555,0.00035449446,0.00071623817,0.0007298287,0.00040178405,0.0030234535],"category_scores_gemma":[0.0004469423,0.00017088842,0.00025111783,0.0001720148,0.00041748228,0.0011356993,0.00092479336,0.00081082067,0.0006694111],"study_design_candidate":"bench_or_experimental","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.00049308,0.00021089625,0.0016393452,0.0006639269,0.00007328791,0.001684726,0.00028992165,0.060188822,0.12895969,0.4131455,0.016538238,0.3761126],"study_design_scores_gemma":[0.00013819658,0.00078333693,0.0013212118,0.00015791338,0.000101388156,0.0019547476,0.00013598322,0.32684013,0.08079857,0.07491282,0.5127368,0.000118961136],"about_ca_topic_score_codex":0.00034490286,"about_ca_topic_score_gemma":0.0005085214,"teacher_disagreement_score":0.0030234535,"about_ca_system_score_codex":0.0002819733,"about_ca_system_score_gemma":0.00049350644,"threshold_uncertainty_score":0.010114431},"labels":[],"label_agreement":null},{"id":"W2151254834","doi":"10.1109/nocs.2007.3","title":"A Hybrid Ring/Mesh Interconnect for Network-on-Chip Using Hierarchical Rings for Global Routing","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Polygon mesh; Interconnection; Parallel computing; SystemC; Mesh networking; Topology (electrical circuits); Shared mesh; Network on a chip; Switched mesh; Network topology; Embedding; System on a chip; Distributed computing; Wireless mesh network; Computer network; Embedded system; Engineering; Telecommunications","score_opus":0.0346280179266182,"score_gpt":0.2960115297002696,"score_spread":0.26138351177365143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151254834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14334826,0.00083728903,0.8379374,0.00028290876,0.00014444481,0.00014021009,0.00028207415,0.004157034,0.012870342],"genre_scores_gemma":[0.49666286,0.00031145106,0.49575293,0.00012243382,0.000047290578,0.00014282438,0.0003631918,0.00012440293,0.0064725257],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998398,0.000035913235,0.000011162215,0.000031155007,0.000062155676,0.000019778943],"domain_scores_gemma":[0.9998416,0.00003134395,0.000018468907,0.000054790813,0.000040175022,0.000013625029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024258925,0.00024580336,0.00018936771,0.00038079426,0.00030274963,0.00036617127,0.00059606397,0.00030145986,0.0017542121],"category_scores_gemma":[0.00029926436,0.00012919572,0.0002863666,0.0004133914,0.00018420597,0.0005285461,0.00040660278,0.0002380698,0.00040102337],"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.0004532882,0.0001868371,0.0023226424,0.00049389363,0.00015790714,0.000500703,0.00018484698,0.19932187,0.3906617,0.06320951,0.011296364,0.33121046],"study_design_scores_gemma":[0.00009370293,0.0011033389,0.002309604,0.000029413208,0.00012476597,0.00075454806,0.000047106638,0.84742576,0.09080487,0.009616181,0.047617443,0.00007336585],"about_ca_topic_score_codex":0.00048607166,"about_ca_topic_score_gemma":0.001307612,"teacher_disagreement_score":0.0017542121,"about_ca_system_score_codex":0.0002931014,"about_ca_system_score_gemma":0.00022316941,"threshold_uncertainty_score":0.0058684945},"labels":[],"label_agreement":null},{"id":"W2151337961","doi":"10.1109/43.924826","title":"Low-power system-level design of VLSI packet switching fabrics","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":42,"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 Waterloo","funders":"","keywords":"Very-large-scale integration; Network packet; Computer science; Dissipation; Design space exploration; Power (physics); Embedded system; Computer network","score_opus":0.049613209952123476,"score_gpt":0.23473861444885805,"score_spread":0.18512540449673456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151337961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08947079,0.00034826214,0.8993003,0.00024153337,0.000035170648,0.00014936517,0.00014088934,0.00066783,0.009645981],"genre_scores_gemma":[0.8757663,0.00038155232,0.12078734,0.00010032562,0.00003124597,0.0002350669,0.0002177973,0.00013196675,0.0023484968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935967,0.00018836425,0.00003109236,0.0000694434,0.00023005322,0.00012137946],"domain_scores_gemma":[0.9996563,0.0001342306,0.000053405114,0.000048054222,0.0000903886,0.000017669461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063932,0.0005477429,0.00049120025,0.0003371893,0.00034488953,0.0011526457,0.0009520457,0.00039117679,0.0018494512],"category_scores_gemma":[0.0011596517,0.00031930738,0.0005316606,0.0002978849,0.0004334577,0.00058516726,0.0003828061,0.00059835333,0.00029884293],"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.000035549263,0.000034636,0.0004558338,0.000101959035,0.000024421955,0.00005580414,0.000036957204,0.94758093,0.01309122,0.017389666,0.00044547895,0.020747578],"study_design_scores_gemma":[0.000009217679,0.000041796175,0.00012365257,0.0000044939234,0.000011443047,0.000013345171,0.00000799579,0.9922386,0.0033652107,0.0032279796,0.00095287093,0.0000034357402],"about_ca_topic_score_codex":0.0014812787,"about_ca_topic_score_gemma":0.0025198932,"teacher_disagreement_score":0.0018494512,"about_ca_system_score_codex":0.0009980834,"about_ca_system_score_gemma":0.001587674,"threshold_uncertainty_score":0.0072416067},"labels":[],"label_agreement":null},{"id":"W2151628509","doi":"10.1109/eit.2009.5189657","title":"NoC prototyping on FPGAs: A case study using an image processing benchmark","year":2009,"lang":"en","type":"article","venue":"","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":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Scalability; Field-programmable gate array; Computer science; Embedded system; Computer architecture; Rapid prototyping; Network on a chip; System on a chip; Engineering","score_opus":0.044519321737892505,"score_gpt":0.3213137912483007,"score_spread":0.27679446951040815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151628509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811937,0.0003760347,0.009626295,0.00026416892,0.00004550302,0.00013587179,0.00018523893,0.00041971248,0.007753424],"genre_scores_gemma":[0.97328126,0.00026499954,0.024243526,0.0000387607,0.00001093425,0.000044296936,0.00017043065,0.000055101988,0.0018907174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.00028100333,0.00004548756,0.000066773864,0.00025682867,0.00011626782],"domain_scores_gemma":[0.99659073,0.0022265844,0.0002056378,0.00024845873,0.0005462876,0.00018232125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951091,0.000671362,0.00041507275,0.00087799935,0.0006408832,0.0006257038,0.0012500094,0.00097042386,0.0022430473],"category_scores_gemma":[0.003516655,0.00023520173,0.00028561894,0.0011508804,0.00055565016,0.00059590465,0.00036328967,0.00036575456,0.00021263865],"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.0021925045,0.001572925,0.021280197,0.0021574819,0.00017291856,0.024358362,0.0018647007,0.59097904,0.076566264,0.010643628,0.009632628,0.2585793],"study_design_scores_gemma":[0.0004255774,0.004040967,0.01795141,0.00013705988,0.00015432072,0.004616483,0.0015186599,0.8117372,0.1355379,0.002760988,0.021009112,0.00011036149],"about_ca_topic_score_codex":0.0048706015,"about_ca_topic_score_gemma":0.006967437,"teacher_disagreement_score":0.0048706015,"about_ca_system_score_codex":0.0008165688,"about_ca_system_score_gemma":0.00045108653,"threshold_uncertainty_score":0.009684503},"labels":[],"label_agreement":null},{"id":"W2151641284","doi":"10.1109/icc.1995.524276","title":"A new theoretical approach for the transient and steady-state analysis of multiserver ATM multiplexers with correlated arrivals","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Multiplexer; Computer science; Markov process; Queue; Transient (computer programming); Markov chain; Superposition principle; Network packet; Joint probability distribution; Probability-generating function; Steady state (chemistry); Queueing theory; Algorithm; Transient analysis; Probability distribution; Moment-generating function; Mathematics; Multiplexing; Computer network; Statistics; Mathematical analysis; Telecommunications","score_opus":0.0185832590018422,"score_gpt":0.21563132049389247,"score_spread":0.19704806149205026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151641284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035782147,0.00017663075,0.9937861,0.000093348994,0.000039110724,0.00002123892,0.00002213371,0.00008915727,0.0021940542],"genre_scores_gemma":[0.65184295,0.0020034313,0.32849172,0.00067501806,0.00057558843,0.0005505227,0.00020665482,0.00030627937,0.015347876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999479,0.00011916763,0.000027650432,0.00007950337,0.00021851952,0.00007620635],"domain_scores_gemma":[0.9988174,0.00068047806,0.00012977656,0.000124721,0.00019603729,0.000051590243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013331402,0.0008641466,0.00068003824,0.0011759995,0.00050272327,0.0013838704,0.0016908563,0.001321483,0.002790376],"category_scores_gemma":[0.0037277318,0.00052834366,0.0013633885,0.0008871627,0.0012703133,0.0023052678,0.0011600063,0.0019523528,0.00058347196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030395784,0.00009658562,0.00049284723,0.00015411687,0.00007994701,0.00028884708,0.00025354678,0.39434394,0.013212412,0.5716968,0.0014900089,0.017860612],"study_design_scores_gemma":[0.0000040664568,0.000029258814,0.00011766005,0.000013643969,0.000012720452,0.00008105991,0.000015266492,0.9345159,0.0010713141,0.06236461,0.0017604622,0.000014044558],"about_ca_topic_score_codex":0.0008244224,"about_ca_topic_score_gemma":0.0005223089,"teacher_disagreement_score":0.002790376,"about_ca_system_score_codex":0.0011937676,"about_ca_system_score_gemma":0.000881502,"threshold_uncertainty_score":0.009334683},"labels":[],"label_agreement":null},{"id":"W2151673292","doi":"10.1109/ccece.2009.5090136","title":"Power analysis of Input-Queued and Crosspoint-Queued crossbar switches","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McMaster University","funders":"","keywords":"Crossbar switch; Computer science; Multiplexer; FIFO (computing and electronics); Queue; Network switch; Scheduling (production processes); Crossover switch; Packet switching; Queueing theory; Topology (electrical circuits); Computer network; Field-programmable gate array; Parallel computing; Multiplexing; Network packet; Computer hardware; Electrical engineering; Telecommunications; Engineering","score_opus":0.008299789978863688,"score_gpt":0.24321495413676922,"score_spread":0.23491516415790553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151673292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2196789,0.0028619815,0.7102515,0.00048970856,0.00010946901,0.00009014779,0.0003817169,0.00044987322,0.0656868],"genre_scores_gemma":[0.97954434,0.00089940033,0.012099662,0.00006603139,0.000060198738,0.000032363485,0.000115455274,0.00007346556,0.007109043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965477,0.000047056703,0.000010147623,0.000047161022,0.00016241739,0.00007842631],"domain_scores_gemma":[0.99914396,0.00050175725,0.0000586868,0.00006472803,0.0002005964,0.000030297952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036098404,0.0006322387,0.0003576047,0.00068192265,0.0002841276,0.000978207,0.0006465994,0.00037922402,0.0047787223],"category_scores_gemma":[0.0017571487,0.00024366782,0.00041124923,0.0006021896,0.00051080174,0.00094777934,0.0004185622,0.00047655834,0.00062027655],"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.00035212128,0.00013304972,0.003331672,0.00016803828,0.00006916802,0.00066160434,0.0001905551,0.7721684,0.03448889,0.113226205,0.0030184765,0.07219183],"study_design_scores_gemma":[0.0000042561987,0.000038812846,0.00057072873,0.000009394313,0.000009198573,0.000087223954,0.00002254578,0.9864137,0.002985582,0.008706389,0.0011471246,0.000005110849],"about_ca_topic_score_codex":0.0013895764,"about_ca_topic_score_gemma":0.0009298632,"teacher_disagreement_score":0.0047787223,"about_ca_system_score_codex":0.0011755785,"about_ca_system_score_gemma":0.0003314979,"threshold_uncertainty_score":0.015986383},"labels":[],"label_agreement":null},{"id":"W2152410894","doi":"10.1109/ccece.2003.1225999","title":"An analysis of different colocated router network topologies within a POP in IP networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"","keywords":"Network topology; Router; Computer science; Context (archaeology); Computer network; Topology (electrical circuits); Distributed computing; Engineering","score_opus":0.012854597842304196,"score_gpt":0.24860881783541777,"score_spread":0.23575421999311358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152410894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25419894,0.00056445657,0.72795385,0.00037850582,0.000023916291,0.00011278295,0.00015226648,0.00008491905,0.016530398],"genre_scores_gemma":[0.9415869,0.000459659,0.055107646,0.000053320484,0.000029750543,0.000102164224,0.00014143952,0.000041824835,0.0024773178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921036,0.00028960846,0.000020888152,0.00010227848,0.00026825152,0.00010863612],"domain_scores_gemma":[0.99677414,0.002272381,0.0003617118,0.00017673691,0.0003175333,0.00009754179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009888017,0.0005657503,0.00049410213,0.00082946674,0.000612933,0.0015278537,0.0009406669,0.0007123384,0.0023595886],"category_scores_gemma":[0.0050185537,0.00040843076,0.00065218133,0.0009568882,0.00096468726,0.0031292734,0.00091378356,0.0006797315,0.0001778884],"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.00008689617,0.000047166122,0.0014880297,0.00008910256,0.000027312733,0.00029752735,0.00009126369,0.8975219,0.0035900034,0.08596598,0.00042334493,0.010371388],"study_design_scores_gemma":[0.0000074560207,0.00005952766,0.00082389556,0.000012540976,0.00002186666,0.00017640239,0.00011326646,0.9650766,0.0015595254,0.030882012,0.0012571416,0.00000981385],"about_ca_topic_score_codex":0.00090225274,"about_ca_topic_score_gemma":0.00082871143,"teacher_disagreement_score":0.0023595886,"about_ca_system_score_codex":0.0010040872,"about_ca_system_score_gemma":0.00046756087,"threshold_uncertainty_score":0.007893622},"labels":[],"label_agreement":null},{"id":"W2152838725","doi":"10.1023/a:1008120609055","title":"On the Dynamic Initialization of Parallel Computers","year":2000,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Polygon mesh; Initialization; Hypercube; Network topology; A priori and a posteriori; Parallel computing; Interconnection; Theoretical computer science; Algorithm; Topology (electrical circuits); Computer network; Mathematics","score_opus":0.014990884043113368,"score_gpt":0.23250163000511262,"score_spread":0.21751074596199926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152838725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103043094,0.0047037476,0.8335335,0.0030037938,0.0012207192,0.00015953407,0.00019396354,0.0029934547,0.05114819],"genre_scores_gemma":[0.8294628,0.0023501776,0.14497103,0.00052380824,0.0006112034,0.00026351068,0.0006631517,0.0017326826,0.019421525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979115,0.0009798085,0.00009032986,0.0002220482,0.0004245305,0.00037170193],"domain_scores_gemma":[0.9944469,0.0025967606,0.0003096255,0.0016665979,0.0006185466,0.00036147248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025935622,0.000915274,0.0012651742,0.0014502889,0.0019510782,0.002808474,0.0022159163,0.0011433973,0.00609751],"category_scores_gemma":[0.015764734,0.0009227488,0.00049950223,0.0020940765,0.0030551518,0.0048287087,0.0049863467,0.0027609093,0.0013724504],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015413191,0.00012547038,0.0024817043,0.000222535,0.00006084607,0.00023085349,0.00051010645,0.28501073,0.005249726,0.5225788,0.0287456,0.15324229],"study_design_scores_gemma":[0.000105101055,0.00005122392,0.00035060072,0.000042927997,0.000026924747,0.00007562951,0.00007425871,0.73489815,0.0026214945,0.24756397,0.014162575,0.000027157044],"about_ca_topic_score_codex":0.0027990923,"about_ca_topic_score_gemma":0.0034224682,"teacher_disagreement_score":0.00609751,"about_ca_system_score_codex":0.001391331,"about_ca_system_score_gemma":0.0013184871,"threshold_uncertainty_score":0.02039814},"labels":[],"label_agreement":null},{"id":"W2153610244","doi":"10.1109/iscas.2008.4541679","title":"VLSI implementation of a shift-enabled reconfigurable array","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Victoria","funders":"","keywords":"Multiplexer; Computer science; Very-large-scale integration; Interconnection; Shift register; Overhead (engineering); Parallel computing; Point (geometry); Array data structure; Power (physics); Electronic engineering; Embedded system; Computer network; Engineering; Multiplexing; Telecommunications; Mathematics; Physics","score_opus":0.023531181228165943,"score_gpt":0.2577542596301029,"score_spread":0.23422307840193696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153610244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24441542,0.00041470886,0.7114354,0.0004084743,0.00021978965,0.00010694136,0.0002575266,0.006660057,0.036081575],"genre_scores_gemma":[0.7946467,0.00013490747,0.19552648,0.00017245403,0.000029463476,0.00004632313,0.00017523495,0.000054002187,0.009214423],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993384,0.000008148167,0.000004058175,0.00001655984,0.000020178795,0.000017310182],"domain_scores_gemma":[0.99993086,0.000013994981,0.000007825596,0.00001954757,0.000019430034,0.000008333228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059081864,0.0001681715,0.00014719185,0.0001853823,0.00023775813,0.00041201085,0.00057784416,0.0002490038,0.0056737834],"category_scores_gemma":[0.00017325199,0.000096589894,0.0001387799,0.0001825491,0.00016564362,0.00038502566,0.00021396363,0.0002369057,0.00087211904],"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.0003764007,0.00012030202,0.0008176411,0.00013573589,0.00003715331,0.0006111416,0.00014445152,0.091324,0.59455657,0.03784661,0.00530298,0.26872697],"study_design_scores_gemma":[0.00009392227,0.0010206776,0.0011425413,0.000023058648,0.000049613547,0.00071387214,0.00007173044,0.5926407,0.3515437,0.009343956,0.04329105,0.00006519258],"about_ca_topic_score_codex":0.0008142022,"about_ca_topic_score_gemma":0.0016260365,"teacher_disagreement_score":0.0056737834,"about_ca_system_score_codex":0.00029696105,"about_ca_system_score_gemma":0.00033853523,"threshold_uncertainty_score":0.018980742},"labels":[],"label_agreement":null},{"id":"W2154588324","doi":"10.1109/hspr.2008.4734422","title":"A distributed and scalable MPLS architecture for next generation routers","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Computer network; Router; Multiprotocol Label Switching; Scalability; Software-defined networking; Distributed computing; Operating system; Quality of service","score_opus":0.049929087932571205,"score_gpt":0.23314818551241606,"score_spread":0.18321909757984486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154588324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08155098,0.0006948287,0.89835113,0.00093069894,0.00013861616,0.00016686849,0.00007533405,0.003455479,0.014636011],"genre_scores_gemma":[0.5942189,0.00035567413,0.39394006,0.00021366135,0.00011091394,0.00015116438,0.00018819762,0.00007955083,0.010741826],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978894,0.00004262345,0.000008233215,0.000030187162,0.000109261295,0.000020787436],"domain_scores_gemma":[0.99977964,0.000020292524,0.00001816945,0.00005782782,0.000102441234,0.000021585896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029413405,0.00023311206,0.00017023449,0.00026999222,0.00036285323,0.00053717324,0.0008451294,0.0005426645,0.0013871106],"category_scores_gemma":[0.00033748598,0.00014565326,0.00019716809,0.00020315059,0.0003356359,0.00063496217,0.0003473852,0.00048720447,0.00034561858],"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.0003417173,0.00031434963,0.0012256154,0.00022293597,0.00006176261,0.00051605474,0.00019828089,0.20998532,0.33222452,0.14852716,0.015418076,0.2909643],"study_design_scores_gemma":[0.00012393725,0.00048371297,0.0013720167,0.000024023675,0.000039972176,0.0004674342,0.000059314858,0.88839954,0.04273423,0.0272283,0.039027628,0.000039853567],"about_ca_topic_score_codex":0.001024914,"about_ca_topic_score_gemma":0.0016586881,"teacher_disagreement_score":0.0013871106,"about_ca_system_score_codex":0.0005630782,"about_ca_system_score_gemma":0.00060946436,"threshold_uncertainty_score":0.0046404004},"labels":[],"label_agreement":null},{"id":"W2155072536","doi":"10.1145/988952.988999","title":"Structured interconnect architecture","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":40,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interconnection; Computer science; Scalability; Embedded system; Computer architecture; Architecture; System on a chip; Computer network","score_opus":0.008219421995769204,"score_gpt":0.21389637861809135,"score_spread":0.20567695662232216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155072536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06853562,0.0021602425,0.79709464,0.0006643015,0.00035224002,0.00022782505,0.00096345524,0.0038614087,0.12614031],"genre_scores_gemma":[0.5811955,0.0026316307,0.35521287,0.0004940636,0.0001675939,0.0003300543,0.0028068477,0.00032295915,0.056838453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998754,0.000020352867,0.000008222031,0.00002940971,0.000044325418,0.000022276088],"domain_scores_gemma":[0.9998053,0.00002385386,0.000022692955,0.000047783695,0.00008204556,0.000018450666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011263777,0.00032218822,0.0001605022,0.00053006294,0.00035628508,0.00079612655,0.0005405551,0.0005323554,0.007708169],"category_scores_gemma":[0.0003867661,0.0001581149,0.0002543171,0.00064569013,0.00025779888,0.00078083575,0.00055543333,0.0003484089,0.0025463777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021267844,0.00011126747,0.0010900814,0.0005190568,0.00006583276,0.0005588399,0.00024218441,0.146514,0.07401846,0.45252335,0.025497664,0.29864666],"study_design_scores_gemma":[0.000104234154,0.0008246827,0.0014630605,0.00014677952,0.00009064367,0.0015383258,0.00017954483,0.45606858,0.029074337,0.24647355,0.26397556,0.00006063283],"about_ca_topic_score_codex":0.00054965157,"about_ca_topic_score_gemma":0.0011918491,"teacher_disagreement_score":0.007708169,"about_ca_system_score_codex":0.0004532112,"about_ca_system_score_gemma":0.00044486567,"threshold_uncertainty_score":0.0257864},"labels":[],"label_agreement":null},{"id":"W2155112903","doi":"10.1109/glsv.1991.143948","title":"An efficient tabu search algorithm for graph bisectioning","year":2002,"lang":"en","type":"article","venue":"","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":"Tabu search; Guided Local Search; Computer science; Graph; Algorithm; Set (abstract data type); Search algorithm; Hill climbing; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.031609241197828986,"score_gpt":0.263572433394145,"score_spread":0.231963192196316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155112903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048342342,0.00054890616,0.9891066,0.00011040131,0.000073467425,0.00012524075,0.00016662503,0.0026575248,0.0023771029],"genre_scores_gemma":[0.046790324,0.00032286395,0.94920856,0.00008652916,0.00003506559,0.00032412235,0.0006479666,0.00041989356,0.0021647771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986759,0.0004905169,0.0000794654,0.00021594756,0.0004026552,0.00013562961],"domain_scores_gemma":[0.9983382,0.00070343644,0.0001355058,0.00024028085,0.00053524785,0.00004732277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011916113,0.001416379,0.0017327236,0.0027722914,0.001440763,0.0018330179,0.0021787756,0.0016638974,0.008312515],"category_scores_gemma":[0.0042351917,0.00088125054,0.0010585402,0.0046056556,0.0009697764,0.0024413501,0.0011486099,0.0015804253,0.002917937],"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.0002768512,0.00016896901,0.00062615203,0.00036534987,0.00013598839,0.00007871913,0.00019076798,0.33222815,0.006181296,0.030045446,0.016430605,0.6132717],"study_design_scores_gemma":[0.00011124786,0.00008764774,0.00017854701,0.000035292764,0.00003159884,0.00011182897,0.00004847598,0.965711,0.004627411,0.019149356,0.009873777,0.000033792086],"about_ca_topic_score_codex":0.0072925254,"about_ca_topic_score_gemma":0.0065142857,"teacher_disagreement_score":0.008312515,"about_ca_system_score_codex":0.00170956,"about_ca_system_score_gemma":0.002354598,"threshold_uncertainty_score":0.02780819},"labels":[],"label_agreement":null},{"id":"W2155120481","doi":"10.1109/infcom.1990.91243","title":"Performance of self-routing ATM switch under nonuniform traffic pattern","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Computer science; Computer network; Asynchronous communication; Routing (electronic design automation); Queueing theory; Blocking (statistics); Network packet; Asynchronous Transfer Mode; Throughput; Crossover switch; Queue; Routing algorithm; Routing protocol; Crossbar switch; Telecommunications","score_opus":0.019076464686623596,"score_gpt":0.20520906483614546,"score_spread":0.18613260014952185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155120481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99607027,0.00006234233,0.0027737862,0.000028753977,0.000015031325,0.0000023088069,0.000036462727,0.00023339385,0.0007776238],"genre_scores_gemma":[0.9992969,0.000024218038,0.00039221908,0.00000612186,0.0000026976095,0.0000011877187,0.000043492146,0.0000068082613,0.0002262129],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998325,0.000031140644,0.000009918864,0.000032981032,0.00004188809,0.000051575495],"domain_scores_gemma":[0.99963546,0.00012660759,0.000053639662,0.00004703381,0.00009811638,0.000039220344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020790985,0.00021857275,0.0002028022,0.00018298268,0.00025890657,0.00027960358,0.0003024121,0.0002052183,0.001524165],"category_scores_gemma":[0.00069639855,0.000060711704,0.00009216748,0.00024342841,0.00020036676,0.00032454383,0.00015613995,0.0001414158,0.00013406812],"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.0037081188,0.00032940783,0.016285555,0.00016158968,0.00011291594,0.0005414654,0.0002790353,0.44461003,0.46736467,0.0028694128,0.0023657773,0.061371997],"study_design_scores_gemma":[0.00006866921,0.0011564586,0.011274672,0.0000074737573,0.00005924914,0.000184464,0.000079606114,0.8514605,0.13441274,0.0006491455,0.00062272936,0.000024316494],"about_ca_topic_score_codex":0.0018462981,"about_ca_topic_score_gemma":0.0007510712,"teacher_disagreement_score":0.0018462981,"about_ca_system_score_codex":0.00035586598,"about_ca_system_score_gemma":0.00020922413,"threshold_uncertainty_score":0.0050988197},"labels":[],"label_agreement":null},{"id":"W2155636896","doi":"10.5555/1898699.1898790","title":"Efficient RDMA-based multi-port collectives on multi-rail QsNet/sup II/ clusters","year":2006,"lang":"en","type":"article","venue":"International Parallel and Distributed Processing Symposium","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Remote direct memory access; Computer science; Data striping; Scalability; Port (circuit theory); Join (topology); Interconnection; Message passing; Parallel computing; Point (geometry); Operating system; Distributed computing; Computer network","score_opus":0.01406072820825603,"score_gpt":0.2495272776196874,"score_spread":0.2354665494114314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155636896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33382732,0.00025376157,0.64994794,0.00029738212,0.00008146638,0.00014418045,0.00010838535,0.009046906,0.006292725],"genre_scores_gemma":[0.75424683,0.00010029407,0.23909879,0.000053193544,0.000027089047,0.00012910909,0.00028577007,0.00021263846,0.0058463006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954575,0.0001224956,0.000030477962,0.00008260486,0.00014898866,0.00006966357],"domain_scores_gemma":[0.99900645,0.0002264091,0.00006988648,0.0003675829,0.00024529343,0.00008429308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007202884,0.00037857384,0.0005558181,0.0005135733,0.0008910677,0.00064052327,0.0010698762,0.00032498286,0.0020062088],"category_scores_gemma":[0.0014202684,0.00028617444,0.00031613265,0.00067919365,0.0004449494,0.00097563205,0.0013017433,0.0004839941,0.0004755242],"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.0020867728,0.0003874514,0.009998404,0.00027913443,0.00017043905,0.0005383541,0.0019129006,0.32546452,0.24586995,0.024586791,0.0124371825,0.3762681],"study_design_scores_gemma":[0.0001098096,0.00020570029,0.0013651509,0.000009144724,0.000030627267,0.00007012544,0.00018538917,0.93491364,0.054839946,0.003210636,0.005032214,0.000027588378],"about_ca_topic_score_codex":0.0036571452,"about_ca_topic_score_gemma":0.004981071,"teacher_disagreement_score":0.0036571452,"about_ca_system_score_codex":0.0005832996,"about_ca_system_score_gemma":0.0004843209,"threshold_uncertainty_score":0.007271707},"labels":[],"label_agreement":null},{"id":"W2156553307","doi":"10.1109/icccn.1995.540157","title":"A case study in local area migration to ATM","year":2002,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"ATM adaptation layer; Multiplexer; Computer network; Asynchronous Transfer Mode; Computer science; Local area network; Server; Backbone network; Interconnection; Distributed computing; Multiplexing; Telecommunications","score_opus":0.051186519262761555,"score_gpt":0.25401786001941007,"score_spread":0.20283134075664852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156553307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532938,0.00031441008,0.016147451,0.0021283622,0.00010351181,0.00018325304,0.00015568867,0.00017206922,0.027501483],"genre_scores_gemma":[0.9866873,0.00023417811,0.007088078,0.00021189362,0.00003367577,0.0000621632,0.00007929766,0.00002485327,0.0055785426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.998923,0.0005121418,0.000030284693,0.00010385272,0.00017336797,0.00025736025],"domain_scores_gemma":[0.998085,0.0010332306,0.00018395952,0.00017201339,0.00020704932,0.00031878098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944381,0.0004037603,0.00028780903,0.0004615621,0.0032861081,0.0014299449,0.0014944673,0.0039739343,0.0046343],"category_scores_gemma":[0.0034842337,0.0002084454,0.0004731518,0.0011246739,0.0010294023,0.0014392957,0.0010088601,0.0012081158,0.0005351839],"study_design_candidate":"case_report","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.0015895654,0.0033118932,0.11400519,0.0006864745,0.00014022175,0.23169565,0.012531604,0.4009997,0.013493159,0.08031363,0.027388003,0.11384487],"study_design_scores_gemma":[0.00065345643,0.003596467,0.042875443,0.00030109443,0.0002241322,0.07127131,0.05112928,0.6003037,0.025200734,0.0328883,0.17126124,0.0002948942],"about_ca_topic_score_codex":0.011597613,"about_ca_topic_score_gemma":0.016329141,"teacher_disagreement_score":0.011597613,"about_ca_system_score_codex":0.0016411602,"about_ca_system_score_gemma":0.0007936641,"threshold_uncertainty_score":0.023060203},"labels":[],"label_agreement":null},{"id":"W2156650099","doi":"10.1109/newcas.2008.4606312","title":"Implementation of a configurable router for embedded network-on-chip support in FPGAs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"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":"Crossbar switch; Router; Field-programmable gate array; Computer science; Embedded system; Programmable Array Logic; Stratix; Network on a chip; Logic synthesis; Routing (electronic design automation); Logic gate; Computer architecture; Computer hardware; Computer network; Logic family","score_opus":0.03232078542708006,"score_gpt":0.2903597945955772,"score_spread":0.25803900916849715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156650099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43401098,0.0008344415,0.5310404,0.000248757,0.00027945175,0.00039928383,0.00029624585,0.011821153,0.021069285],"genre_scores_gemma":[0.81394315,0.00016553934,0.18120617,0.00011964552,0.000028736235,0.00008196418,0.0002825,0.00012518754,0.0040471274],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998192,0.00003495672,0.000016831897,0.000040701758,0.000047721194,0.000040628966],"domain_scores_gemma":[0.9997081,0.000050819417,0.00004852378,0.00008967086,0.00007238797,0.00003051223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001819704,0.0003525396,0.00019919584,0.000369723,0.00021341149,0.00041637226,0.0011368478,0.00027540565,0.003008705],"category_scores_gemma":[0.0004910558,0.00017345596,0.00016763357,0.00018829676,0.00013316251,0.00040003692,0.0001948408,0.00023825644,0.00042656434],"study_design_candidate":"bench_or_experimental","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.0008667719,0.0003897159,0.0085499855,0.0004548109,0.00017635465,0.0018362534,0.00021651822,0.072236866,0.39209756,0.01503573,0.011962086,0.49617732],"study_design_scores_gemma":[0.00038383692,0.0025597608,0.014040947,0.00012329424,0.00022897696,0.0033469019,0.00013325948,0.4656351,0.4429748,0.0024620853,0.067950964,0.0001601593],"about_ca_topic_score_codex":0.00094810943,"about_ca_topic_score_gemma":0.0019828528,"teacher_disagreement_score":0.003008705,"about_ca_system_score_codex":0.00038337146,"about_ca_system_score_gemma":0.000298819,"threshold_uncertainty_score":0.010065079},"labels":[],"label_agreement":null},{"id":"W2156790537","doi":"10.1109/tvlsi.2007.900746","title":"Routability of Network Topologies in FPGAs","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"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 Toronto","funders":"CMC Microsystems","keywords":"Network topology; Field-programmable gate array; Routing (electronic design automation); Computer science; Overhead (engineering); Network on a chip; Embedded system; Logic synthesis; Topology (electrical circuits); Logic gate; Parallel computing; Computer network; Computer architecture; Engineering; Algorithm; Electrical engineering","score_opus":0.015335108836062327,"score_gpt":0.25428863756629777,"score_spread":0.23895352873023545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156790537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63441217,0.0013211423,0.31764325,0.00033286575,0.00012315862,0.00009764704,0.00047982906,0.0018867941,0.0437032],"genre_scores_gemma":[0.9683307,0.00036181952,0.027742408,0.000027945263,0.000016819247,0.000034787598,0.0003061599,0.00007127381,0.00310802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995394,0.00017730599,0.000038152077,0.0000753011,0.00010191931,0.00006799546],"domain_scores_gemma":[0.9984211,0.00081560033,0.0002343571,0.00030287885,0.00017525205,0.00005090795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044275835,0.0002827408,0.00021772766,0.00054820743,0.0003501175,0.0011622643,0.00033681392,0.00027789528,0.0038077831],"category_scores_gemma":[0.002733186,0.00021372407,0.00018843237,0.00043501973,0.0003946488,0.001156252,0.000328335,0.00021390182,0.0003490582],"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.00051343406,0.000053867574,0.0029908826,0.00024322532,0.00003650557,0.00063538866,0.00020208773,0.75474936,0.02734704,0.084234364,0.002119913,0.126874],"study_design_scores_gemma":[0.00006433354,0.0002899542,0.0030342042,0.000055320263,0.000032084277,0.00061359693,0.00016306176,0.91661143,0.01897498,0.04823332,0.011900996,0.000026664657],"about_ca_topic_score_codex":0.0013960514,"about_ca_topic_score_gemma":0.0016299108,"teacher_disagreement_score":0.0038077831,"about_ca_system_score_codex":0.0006344794,"about_ca_system_score_gemma":0.00025435348,"threshold_uncertainty_score":0.012738287},"labels":[],"label_agreement":null},{"id":"W2156839950","doi":"10.1016/j.ic.2012.10.011","title":"Range majority in constant time and linear space","year":2012,"lang":"en","type":"article","venue":"Information and Computation","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University; University of Manitoba","funders":"","keywords":"Range (aeronautics); Range query (database); Linear space; Upper and lower bounds; Constant (computer programming); Logarithm; Mathematics; Space (punctuation); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Search engine; Sargable; Web search query; Information retrieval","score_opus":0.010948765977663364,"score_gpt":0.23301614964241424,"score_spread":0.22206738366475087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156839950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0996931,0.00395467,0.7916876,0.00891772,0.000936194,0.00027980033,0.0010271504,0.005334227,0.08816953],"genre_scores_gemma":[0.7658703,0.0015245562,0.1498967,0.002081435,0.0011406704,0.00047829445,0.0007399895,0.0014398751,0.07682819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99482346,0.0012763215,0.00023711302,0.0011389982,0.0013599223,0.001164232],"domain_scores_gemma":[0.9833107,0.010878952,0.0006352421,0.0032953115,0.0011619586,0.0007177863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028494843,0.001519501,0.002424221,0.0014789293,0.003091029,0.005962445,0.0030900973,0.0021724985,0.019350106],"category_scores_gemma":[0.017343909,0.00081222726,0.0013444576,0.0024539523,0.0040325965,0.016587483,0.005985332,0.004565507,0.0039537903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014401504,0.00018614753,0.00058137416,0.000532905,0.00010386928,0.00016710475,0.0006870504,0.042678684,0.006132907,0.8052534,0.027628982,0.11460742],"study_design_scores_gemma":[0.00013667821,0.000091367576,0.00014085327,0.00004235349,0.00007005609,0.00012519436,0.00014302772,0.0941569,0.0043814844,0.8923277,0.008347589,0.00003675197],"about_ca_topic_score_codex":0.0021349734,"about_ca_topic_score_gemma":0.0034389829,"teacher_disagreement_score":0.019350106,"about_ca_system_score_codex":0.0029141314,"about_ca_system_score_gemma":0.0028421301,"threshold_uncertainty_score":0.06473255},"labels":[],"label_agreement":null},{"id":"W2156957406","doi":"10.1109/icpads.2008.27","title":"Efficient Broadcasting in Networks with Weighted Nodes","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Computation; Process (computing); Computer network; Distributed computing; Theoretical computer science; Algorithm","score_opus":0.014080988443920906,"score_gpt":0.19912706123554166,"score_spread":0.18504607279162075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156957406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082560174,0.0007837215,0.91048443,0.00029175644,0.00003755905,0.00007686579,0.00009689134,0.00041709244,0.005251426],"genre_scores_gemma":[0.6907701,0.001623668,0.29929915,0.0001047888,0.00005966599,0.00018325003,0.0003799833,0.00017667832,0.0074026296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945635,0.00017458458,0.000020545865,0.00009584773,0.00014604737,0.0001066626],"domain_scores_gemma":[0.9989629,0.0006382237,0.00012756034,0.00012178883,0.00010912032,0.000040510517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075257535,0.00047684484,0.00077646866,0.00063332845,0.000712845,0.0009002369,0.0010516063,0.00069411524,0.0018636545],"category_scores_gemma":[0.0028064784,0.00037322467,0.00026885967,0.0012812275,0.0007964726,0.002385761,0.0009674186,0.00058786536,0.00040717737],"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.0004920226,0.00009495689,0.00055374875,0.0004002821,0.000060313792,0.0001535992,0.00042747965,0.7082508,0.038367923,0.13066964,0.003217012,0.117312096],"study_design_scores_gemma":[0.0000993624,0.00014654383,0.00021582411,0.000023994573,0.00004006014,0.00011359691,0.00013966025,0.885896,0.012080006,0.09400119,0.007221733,0.000021987138],"about_ca_topic_score_codex":0.0023758723,"about_ca_topic_score_gemma":0.002941372,"teacher_disagreement_score":0.0023758723,"about_ca_system_score_codex":0.0009563285,"about_ca_system_score_gemma":0.0007028958,"threshold_uncertainty_score":0.006938696},"labels":[],"label_agreement":null},{"id":"W2157008728","doi":"10.5555/1266366.1266600","title":"System level assessment of an optical NoC in an MPSoC platform","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"MPSoC; Interconnection; System on a chip; Computer science; Embedded system; Computer architecture; Integrated circuit; Network on a chip; Telecommunications","score_opus":0.056631651127626186,"score_gpt":0.3263792045090526,"score_spread":0.2697475533814264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157008728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.925741,0.00046186062,0.059939705,0.00019182473,0.00003452369,0.00011552188,0.00016449894,0.00027525044,0.013075754],"genre_scores_gemma":[0.9938199,0.000058572597,0.005032856,0.000016527543,0.000004993225,0.000023277893,0.000032948123,0.00001276055,0.0009982942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996557,0.000088074274,0.000008622374,0.000031909312,0.00016329506,0.000052451458],"domain_scores_gemma":[0.9993704,0.00027933114,0.00007394504,0.000040651452,0.00020873046,0.000026975236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046606726,0.0003526653,0.00021310791,0.00035082418,0.00031705416,0.0005095364,0.00040028544,0.00042222382,0.0021175505],"category_scores_gemma":[0.0014732883,0.00013650699,0.00026280648,0.00020670943,0.00036117146,0.0005106063,0.00026263142,0.00024439796,0.00012504004],"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.00029067294,0.00008833839,0.0027182507,0.00017225693,0.000036632555,0.00014400776,0.000054040207,0.934599,0.044973843,0.0036671285,0.0002806995,0.01297515],"study_design_scores_gemma":[0.000013981719,0.000468576,0.0016573124,0.000008819909,0.000027669314,0.000027955026,0.000037176076,0.9826011,0.013633298,0.0008909067,0.00062324223,0.000009912009],"about_ca_topic_score_codex":0.0030754455,"about_ca_topic_score_gemma":0.0022524097,"teacher_disagreement_score":0.0030754455,"about_ca_system_score_codex":0.00093578966,"about_ca_system_score_gemma":0.0005214553,"threshold_uncertainty_score":0.007083893},"labels":[],"label_agreement":null},{"id":"W2157128070","doi":"10.1109/infcomw.2011.5928934","title":"k-robust network design using resistance distance: Case of RocketFuel and power grids","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Network topology; Computer science; Mathematical optimization; Robust optimization; Optimization problem; Network planning and design; Linear programming; Grid; Interior point method; Topology optimization; Topology (electrical circuits); Distributed computing; Mathematics; Computer network; Engineering","score_opus":0.08063400341921646,"score_gpt":0.23952711975672333,"score_spread":0.15889311633750686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157128070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081624754,0.00040212375,0.9093738,0.00043267355,0.000031856813,0.000048866797,0.00006662453,0.00012432557,0.007894928],"genre_scores_gemma":[0.9326206,0.0002980696,0.06388789,0.000057571277,0.000022352597,0.00005901353,0.000030503352,0.000033423956,0.002990619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937755,0.00021972395,0.000026875723,0.00016607065,0.00014083416,0.000068954636],"domain_scores_gemma":[0.9990662,0.00043566572,0.00024783213,0.00008583526,0.000117054886,0.00004745846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488634,0.00073637767,0.00071032305,0.00046078465,0.00040012712,0.0009813242,0.0007323128,0.0009979944,0.0015938173],"category_scores_gemma":[0.00290834,0.00028195503,0.00048741742,0.00037918607,0.0010318668,0.0017773863,0.0009003647,0.00062950025,0.00016584937],"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.00008365126,0.000012097502,0.00021666057,0.000060673654,0.000026552301,0.00018952249,0.000056110108,0.9390065,0.0033030384,0.045861404,0.00027926816,0.010904472],"study_design_scores_gemma":[0.0000111003155,0.00007234285,0.00010127789,0.000006902269,0.000010234119,0.00006178419,0.000023752622,0.9758369,0.0013110065,0.021708364,0.000847333,0.000009074816],"about_ca_topic_score_codex":0.0018059063,"about_ca_topic_score_gemma":0.0011244237,"teacher_disagreement_score":0.0018059063,"about_ca_system_score_codex":0.00082353246,"about_ca_system_score_gemma":0.0004060167,"threshold_uncertainty_score":0.005975127},"labels":[],"label_agreement":null},{"id":"W2157509797","doi":"10.1109/noms.1996.539627","title":"New resource allocation schemes for SONET/SDH long haul element management networks","year":2002,"lang":"en","type":"article","venue":"","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":"Bell (Canada)","funders":"","keywords":"Synchronous optical networking; Computer network; Computer science; Provisioning; Network element; Quality of service; Interoperability; Multiprotocol Label Switching; Context (archaeology)","score_opus":0.020163378293411204,"score_gpt":0.226160976289409,"score_spread":0.20599759799599782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157509797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017974075,0.0024916627,0.96871144,0.0006451722,0.0005141253,0.00028714258,0.00004830591,0.00069623266,0.008631889],"genre_scores_gemma":[0.34672526,0.0015873084,0.63953197,0.00046109527,0.0006288028,0.0006222011,0.0001679404,0.00010401892,0.0101714535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987257,0.00038276936,0.00017466105,0.00015801386,0.0003957796,0.00016309477],"domain_scores_gemma":[0.9984793,0.00044208855,0.00015908974,0.000449808,0.00038364658,0.000085980995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00317061,0.0004884099,0.00061064475,0.0010132983,0.0011703026,0.0015819797,0.0019419158,0.0008183834,0.0030968853],"category_scores_gemma":[0.0040862956,0.00030722772,0.00030765915,0.0009704373,0.0013704299,0.003342319,0.0016814467,0.0017940036,0.00082270225],"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.00045527355,0.0001545194,0.000566996,0.000291656,0.000048002417,0.00015779033,0.00060332124,0.04012753,0.031757586,0.44278136,0.006413765,0.4766422],"study_design_scores_gemma":[0.0001819081,0.0005197204,0.000845606,0.00017938254,0.0001284683,0.0010624,0.0003839311,0.6731012,0.03104387,0.1659486,0.12646477,0.00014021006],"about_ca_topic_score_codex":0.00048647053,"about_ca_topic_score_gemma":0.001259747,"teacher_disagreement_score":0.00317061,"about_ca_system_score_codex":0.0016601345,"about_ca_system_score_gemma":0.0006333759,"threshold_uncertainty_score":0.016767979},"labels":[],"label_agreement":null},{"id":"W2157697203","doi":"10.1109/ftcs.1991.146673","title":"A multiple-fault tolerant sorting network","year":2002,"lang":"en","type":"article","venue":"","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":"Université de Montréal","funders":"","keywords":"Fault tolerance; Redundancy (engineering); Sorting network; Sorting; Computer science; sort; Sorting algorithm; Theoretical computer science; Algorithm; Distributed computing; Information retrieval; Operating system","score_opus":0.027148919302889773,"score_gpt":0.21909287759544402,"score_spread":0.19194395829255426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157697203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907791,0.00081767095,0.8206628,0.00076436816,0.00023460829,0.00013575263,0.00031308815,0.0016436254,0.016350137],"genre_scores_gemma":[0.69448847,0.00067239907,0.2883434,0.00034153086,0.00008896197,0.00012881923,0.00038827097,0.000057053767,0.015491077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980134,0.00003534191,0.000013557846,0.000055036464,0.00006754497,0.000027155766],"domain_scores_gemma":[0.9996729,0.00006279162,0.000066986504,0.000057444326,0.000109714485,0.000030133784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025564936,0.00027681483,0.0002645903,0.0005067516,0.00051248574,0.0006222685,0.000634898,0.0005002174,0.002478836],"category_scores_gemma":[0.00060235814,0.00013218875,0.00018175556,0.000570515,0.00032723657,0.00090500835,0.0003619137,0.00026533907,0.00052789337],"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.0007500495,0.00016335478,0.0014812818,0.00042302732,0.00007314602,0.00042975706,0.00015714306,0.15151392,0.22330429,0.13677455,0.007199318,0.4777302],"study_design_scores_gemma":[0.00010700293,0.00093820936,0.0011790417,0.000059552982,0.00009978413,0.000810131,0.000058569734,0.71846473,0.13915376,0.08039492,0.058671176,0.00006318842],"about_ca_topic_score_codex":0.0008687198,"about_ca_topic_score_gemma":0.0011758925,"teacher_disagreement_score":0.002478836,"about_ca_system_score_codex":0.0006340134,"about_ca_system_score_gemma":0.0005467002,"threshold_uncertainty_score":0.008292556},"labels":[],"label_agreement":null},{"id":"W2158032238","doi":"10.1109/iscas.2005.1464796","title":"Multiplier-Free Structures for Exact Generation of Natural Powers of Integers","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Natural number; Multiplier (economics); Mathematics; Sequence (biology); Power of two; Discrete mathematics; Arithmetic; Simple (philosophy); Scalability; Algorithm; Computer science","score_opus":0.021788687726922867,"score_gpt":0.25692125996305637,"score_spread":0.2351325722361335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158032238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09047628,0.00064628513,0.87975925,0.00016685358,0.00013069849,0.00007797936,0.00008143536,0.00046370548,0.028197663],"genre_scores_gemma":[0.7447895,0.00073561614,0.23732573,0.00011280271,0.00009568931,0.00020525324,0.000167088,0.00012755588,0.016440757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985087,0.000032208525,0.000014898718,0.000022035683,0.000060327788,0.000019632766],"domain_scores_gemma":[0.9996698,0.00013536328,0.00005333391,0.000061555496,0.00006452936,0.000015484402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002109253,0.00034436022,0.00017528434,0.00033550232,0.00034383617,0.00055702066,0.00053568603,0.00029064566,0.004093579],"category_scores_gemma":[0.0010193115,0.00018891937,0.00022074879,0.00025555916,0.00051986845,0.0009616746,0.00039356528,0.000565798,0.00074115867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080235266,0.000031901724,0.00013163898,0.00014507546,0.000008496362,0.00021932225,0.0001816424,0.023408603,0.05140261,0.8742462,0.0011195116,0.0490249],"study_design_scores_gemma":[0.00005941027,0.00030819513,0.00027092992,0.000060375718,0.00002799227,0.0007073419,0.00005676926,0.25554082,0.111701526,0.6013668,0.029844915,0.0000549571],"about_ca_topic_score_codex":0.00013652052,"about_ca_topic_score_gemma":0.0003850497,"teacher_disagreement_score":0.004093579,"about_ca_system_score_codex":0.00035738622,"about_ca_system_score_gemma":0.0002470347,"threshold_uncertainty_score":0.013694406},"labels":[],"label_agreement":null},{"id":"W2158171428","doi":"10.1109/tpds.2006.64","title":"Providing service guarantees in high-speed switching systems with feedback output queuing","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and 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":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Queueing theory; Computer network; Speedup; Network packet; Packet switching; Distributed computing; Service (business); Parallel computing; Operating system","score_opus":0.012897240487963535,"score_gpt":0.20414071143785217,"score_spread":0.19124347094988864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158171428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36143062,0.00040297533,0.6332759,0.0006011638,0.00009935832,0.000064773914,0.00006224596,0.0006380878,0.0034247744],"genre_scores_gemma":[0.9856592,0.00011071773,0.013349409,0.000035549125,0.000039111652,0.0000274362,0.000020854295,0.000017968527,0.0007398268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00023031964,0.000036708905,0.000096664546,0.00029928453,0.00025406465],"domain_scores_gemma":[0.99739325,0.0017456822,0.0002757775,0.00013793603,0.00031640398,0.0001310156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939076,0.00059557875,0.0006526442,0.00035890716,0.0010589391,0.0013884314,0.001057015,0.0008418735,0.001658819],"category_scores_gemma":[0.004623495,0.0003119974,0.0003116689,0.00055033405,0.0012931334,0.0016116167,0.0009576186,0.0010209486,0.0001654392],"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.00028362975,0.00007780607,0.0010135599,0.00006655188,0.000024724348,0.00019206914,0.00014691145,0.93885446,0.0066569312,0.038807906,0.0006597896,0.013215653],"study_design_scores_gemma":[0.000021383992,0.000026930695,0.0000672991,0.0000014218851,0.0000044164567,0.000008439972,0.000012234146,0.99264646,0.0006073894,0.006474657,0.00012596304,0.000003342745],"about_ca_topic_score_codex":0.0058487905,"about_ca_topic_score_gemma":0.0033926794,"teacher_disagreement_score":0.0058487905,"about_ca_system_score_codex":0.0013136369,"about_ca_system_score_gemma":0.0013782983,"threshold_uncertainty_score":0.011629522},"labels":[],"label_agreement":null},{"id":"W2158204198","doi":"10.1109/waina.2009.148","title":"Efficient Heuristic for Multicasting in Arbitrary Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Multicast; Computer science; Network topology; Heuristic; Computer network; Source-specific multicast; Protocol Independent Multicast; Xcast; Distributed computing; Routing (electronic design automation); Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Artificial intelligence","score_opus":0.015214361960192432,"score_gpt":0.24958291520528322,"score_spread":0.2343685532450908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158204198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18020897,0.0010368244,0.8065974,0.00050834275,0.0001085682,0.00037613977,0.0002508469,0.0010852498,0.0098276315],"genre_scores_gemma":[0.57124066,0.00024976008,0.426167,0.00011111543,0.000027316044,0.0002649349,0.0003131479,0.00009525666,0.0015308119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.00033124196,0.000028544942,0.000066051056,0.00012099486,0.00013986103],"domain_scores_gemma":[0.998516,0.000992227,0.00013724029,0.00014413967,0.00012879283,0.00008161875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257946,0.00067260535,0.00084883627,0.000944885,0.00084650354,0.0007455588,0.0015058739,0.0010638102,0.0021722047],"category_scores_gemma":[0.0033743281,0.0003851881,0.00047148284,0.0010067391,0.00076164724,0.0011094011,0.00073056115,0.00049273507,0.000206064],"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.00015818205,0.00015729138,0.00065917056,0.00010696297,0.000037040085,0.00009518647,0.000096829855,0.9327948,0.0015717929,0.015436667,0.0019429636,0.046943165],"study_design_scores_gemma":[0.000055712677,0.00005950009,0.00009626444,0.0000096642625,0.000014413064,0.000036122583,0.000039997703,0.990803,0.0005698749,0.0071797143,0.0011290666,0.000006766757],"about_ca_topic_score_codex":0.0028890234,"about_ca_topic_score_gemma":0.003000917,"teacher_disagreement_score":0.0028890234,"about_ca_system_score_codex":0.001407601,"about_ca_system_score_gemma":0.0015248844,"threshold_uncertainty_score":0.010212958},"labels":[],"label_agreement":null},{"id":"W2158367821","doi":"10.1109/lcn.1992.228134","title":"A partial-destination-release strategy for the multi-token ring protocol","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Alberta","funders":"","keywords":"Token ring; Fiber Distributed Data Interface; Computer network; Token bus network; Computer science; Frame (networking); Security token; Bandwidth (computing); Ring (chemistry); Protocol (science); Network packet; Token passing; Ring network; Local area network; Network topology; Chemistry","score_opus":0.07314944398907744,"score_gpt":0.3258113011451918,"score_spread":0.25266185715611433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158367821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010925511,0.00040668427,0.98222864,0.00020931059,0.00012087113,0.00031665806,0.000074885866,0.00074507145,0.0049722926],"genre_scores_gemma":[0.5100926,0.00076104235,0.47560784,0.00022975352,0.00010934997,0.00066296285,0.00030219692,0.00021914132,0.012015061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941325,0.00019851208,0.00006646881,0.00009021353,0.00017212899,0.000059388014],"domain_scores_gemma":[0.99933964,0.00020652422,0.00010737616,0.00017565835,0.00010770548,0.000063099236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444564,0.00052003155,0.00049635215,0.0005070275,0.0005331531,0.0011569655,0.0018982186,0.00060915254,0.0026137922],"category_scores_gemma":[0.001895469,0.00022571722,0.00036907996,0.00042367206,0.000765834,0.0016557676,0.0010343381,0.00086875877,0.0009004535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007721431,0.00022559875,0.00085741293,0.00069145777,0.00011326753,0.0010538024,0.0007006357,0.12251748,0.08765658,0.47653073,0.010928501,0.2979524],"study_design_scores_gemma":[0.00016194726,0.0005729686,0.0003255164,0.00006285983,0.00010861537,0.0011601847,0.00013375357,0.8580327,0.036222227,0.056982722,0.046109855,0.00012666044],"about_ca_topic_score_codex":0.00065165473,"about_ca_topic_score_gemma":0.0010978099,"teacher_disagreement_score":0.0026137922,"about_ca_system_score_codex":0.0007250185,"about_ca_system_score_gemma":0.0008962708,"threshold_uncertainty_score":0.008744001},"labels":[],"label_agreement":null},{"id":"W2158373603","doi":"10.1109/mdt.2008.124","title":"A Quality-Driven Design Approach for NoCs","year":2008,"lang":"en","type":"article","venue":"IEEE Design & Test of Computers","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Debugging; Computer science; Computer architecture; Quality (philosophy); Test (biology); Embedded system; Software engineering; Design for testing; Reliability engineering; Engineering; Programming language; Testability","score_opus":0.11945995191426304,"score_gpt":0.2827301218498564,"score_spread":0.16327016993559337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158373603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011849165,0.0013133447,0.97606814,0.006783068,0.0020921263,0.00015530045,0.00006142062,0.00066578656,0.011675744],"genre_scores_gemma":[0.04559074,0.0025080647,0.92256755,0.003190353,0.0015599432,0.00033938338,0.00012223385,0.0004060675,0.023715759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983511,0.00037366233,0.00009909719,0.00009190138,0.0010184679,0.00006565553],"domain_scores_gemma":[0.9971144,0.0007467019,0.00009218282,0.0002812333,0.0016467997,0.00011864219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031770242,0.00070641027,0.00029833138,0.0009869636,0.00054547936,0.0013490026,0.0016671171,0.0009855448,0.0061193723],"category_scores_gemma":[0.0054026092,0.00038722114,0.00074185437,0.00042715194,0.0010484552,0.0011675335,0.00084162847,0.0018271252,0.0016525452],"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.00014219148,0.00010436837,0.0009943036,0.00088963594,0.0001379198,0.00053437595,0.00059687847,0.0851714,0.015514951,0.33797503,0.10533434,0.4526046],"study_design_scores_gemma":[0.00017669727,0.0002964677,0.00030979974,0.0002665674,0.000119396296,0.0006416865,0.00012405487,0.22589219,0.008996954,0.21370645,0.54941666,0.000053134954],"about_ca_topic_score_codex":0.0012276792,"about_ca_topic_score_gemma":0.0038857684,"teacher_disagreement_score":0.0061193723,"about_ca_system_score_codex":0.0011058773,"about_ca_system_score_gemma":0.0011549856,"threshold_uncertainty_score":0.020471334},"labels":[],"label_agreement":null},{"id":"W2158574699","doi":"10.1109/icc.1994.368950","title":"Approximate analysis of a packet switch with finite output buffering and imbalanced correlated traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Bernoulli's principle; Bernoulli process; Computer science; Blocking (statistics); Throughput; Packet switching; Port (circuit theory); Network packet; Process (computing); Transient (computer programming); Transient analysis; Algorithm; Computer network; Topology (electrical circuits); Real-time computing; Mathematics; Electronic engineering; Transient response; Electrical engineering; Telecommunications; Engineering; Combinatorics","score_opus":0.01577113572510781,"score_gpt":0.19773042861922324,"score_spread":0.18195929289411544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158574699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66344523,0.00032128143,0.33114707,0.00023557764,0.000025702302,0.000017176,0.00007389247,0.00018537896,0.004548753],"genre_scores_gemma":[0.9935588,0.00007753864,0.0057268203,0.000014375566,0.000012780591,0.000009423447,0.000022105192,0.00001379582,0.00056438765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998498,0.00004241049,0.000004557361,0.00001764819,0.000054135264,0.0000314788],"domain_scores_gemma":[0.9995111,0.0002549786,0.00008969997,0.000032832842,0.00007310925,0.000038142778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045159465,0.00031520604,0.00030161944,0.00046599776,0.0002686767,0.00059692276,0.00046260929,0.00031927635,0.0006935615],"category_scores_gemma":[0.0014004303,0.00018273876,0.000282019,0.00037998034,0.0006481212,0.00051868724,0.00041306065,0.00036027635,0.000057781926],"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.00006674611,0.000017593755,0.0014972329,0.000019970208,0.000024924582,0.0001529999,0.00005351496,0.9699444,0.006539467,0.018866995,0.0001858917,0.002630308],"study_design_scores_gemma":[0.0000010558422,0.000004111791,0.00011887263,4.7862767e-7,0.0000018117356,0.0000057739544,0.000002453865,0.9987596,0.00012954586,0.0009529475,0.000022510663,8.4802093e-7],"about_ca_topic_score_codex":0.0044134874,"about_ca_topic_score_gemma":0.0015070732,"teacher_disagreement_score":0.0044134874,"about_ca_system_score_codex":0.0010088115,"about_ca_system_score_gemma":0.0004684339,"threshold_uncertainty_score":0.008775592},"labels":[],"label_agreement":null},{"id":"W2158769743","doi":"10.1109/iciea.2015.7334208","title":"Research on delay-dependent stability of parallel DC-DC converter system based on a Wireless communication","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Correctness; Computer science; MATLAB; Electronic engineering; Wireless; Transmission delay; Communications system; Transmission (telecommunications); Engineering; Telecommunications; Algorithm","score_opus":0.12098784043829613,"score_gpt":0.33129370546132625,"score_spread":0.21030586502303011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158769743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15230796,0.0033904037,0.81904405,0.0004294951,0.00018723871,0.00005989168,0.000047558206,0.00028872455,0.02424469],"genre_scores_gemma":[0.97168946,0.0020270748,0.021058436,0.000032477656,0.000058250804,0.000034871995,0.0000317412,0.00002492127,0.0050427527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998883,0.000014437678,0.0000042093484,0.00003312043,0.0000494321,0.000010469562],"domain_scores_gemma":[0.9998307,0.000053491203,0.000021533931,0.000013934532,0.0000724877,0.000007841741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019361077,0.0002892527,0.00022697433,0.0002936051,0.00036875642,0.00046745926,0.00036839012,0.00025490797,0.001411748],"category_scores_gemma":[0.00060852524,0.00015795743,0.00028553072,0.0003045407,0.00037181602,0.0007414246,0.00020710776,0.00044825426,0.00015460246],"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.00020571203,0.00007566673,0.0029844802,0.0006332961,0.000100529425,0.00047207397,0.0005145018,0.594072,0.10620051,0.18339711,0.0016294328,0.10971476],"study_design_scores_gemma":[0.000013731653,0.00010847048,0.0005370705,0.000019022687,0.000025979738,0.00014376966,0.00004910886,0.96729004,0.014070536,0.013703678,0.0040184194,0.000020212983],"about_ca_topic_score_codex":0.0020286534,"about_ca_topic_score_gemma":0.0008904918,"teacher_disagreement_score":0.0020286534,"about_ca_system_score_codex":0.0005818892,"about_ca_system_score_gemma":0.00043668062,"threshold_uncertainty_score":0.0047227144},"labels":[],"label_agreement":null},{"id":"W2159032839","doi":"10.1109/clustr.2009.5289143","title":"Distributed control plane architecture of next generation IP routers","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Computer science; Forwarding plane; Router; Computer network; Scalability; Core router; Terabit; One-armed router; Distributed computing; OpenFlow; IP forwarding; Software-defined networking; Routing protocol; Routing (electronic design automation); Routing table; Network packet; Operating system","score_opus":0.02015084551879793,"score_gpt":0.2173757438369032,"score_spread":0.19722489831810527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159032839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059849262,0.0007199564,0.9237485,0.000444905,0.00019188778,0.00013994203,0.00007702139,0.0024829048,0.012345738],"genre_scores_gemma":[0.77558887,0.0007085538,0.21073662,0.00023482165,0.00012431871,0.00020770483,0.00038821137,0.00008124751,0.011929557],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997011,0.00005527215,0.00001821226,0.00006873891,0.00010525998,0.000051361203],"domain_scores_gemma":[0.9997615,0.000030272184,0.000020733154,0.00006443375,0.000100631,0.000022460235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038748293,0.00030268845,0.00022214191,0.00033371977,0.00033968274,0.0014924173,0.0010681659,0.0005382267,0.0020248834],"category_scores_gemma":[0.00043917674,0.0001289813,0.00028862845,0.00027383288,0.00040448245,0.0009248027,0.0003522018,0.0007562433,0.000448143],"study_design_candidate":"bench_or_experimental","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.00074958603,0.0006016755,0.003257855,0.00027516045,0.00015788723,0.00056055054,0.00041678414,0.26220313,0.09675945,0.30950832,0.010069514,0.31544012],"study_design_scores_gemma":[0.00011349812,0.00027486213,0.00076627167,0.000023422466,0.00006521864,0.00017069509,0.000055574612,0.9166255,0.028234763,0.023274956,0.030373374,0.000021928545],"about_ca_topic_score_codex":0.0019931544,"about_ca_topic_score_gemma":0.0012542867,"teacher_disagreement_score":0.0020248834,"about_ca_system_score_codex":0.0008378277,"about_ca_system_score_gemma":0.00083208544,"threshold_uncertainty_score":0.0067739487},"labels":[],"label_agreement":null},{"id":"W2159795949","doi":"10.1109/tvlsi.2008.2004592","title":"Throughput-Oriented NoC Topology Generation and Analysis for High Performance SoCs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Network topology; Computer science; Throughput; Network on a chip; Process (computing); Logical topology; Topology (electrical circuits); Distributed computing; Embedded system; Computer network; Engineering; Wireless","score_opus":0.017441740138098547,"score_gpt":0.24731343106732276,"score_spread":0.22987169092922421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159795949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500071,0.00022464992,0.9623461,0.000041804647,0.000017278579,0.000044844925,0.000065475506,0.00039294595,0.0018662245],"genre_scores_gemma":[0.73305655,0.0006640232,0.26425976,0.000040150637,0.00004122644,0.00017544336,0.0003270685,0.00018160665,0.0012541709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.000102216705,0.000014866479,0.000025439067,0.00015728951,0.000026100544],"domain_scores_gemma":[0.9990746,0.0004357785,0.00012428667,0.00010754361,0.00023776953,0.000020025573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057133014,0.00053321564,0.00028111247,0.0011238235,0.00029414636,0.0004618508,0.0005725747,0.00028993574,0.001247873],"category_scores_gemma":[0.0026844225,0.00027895177,0.00046646217,0.00070424925,0.00028284514,0.0007964464,0.00023685125,0.0003441305,0.00018259577],"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.000031898693,0.000017348959,0.0006296663,0.000070330796,0.000018394327,0.00007776613,0.000028216808,0.9493351,0.008104012,0.011622021,0.00032310878,0.029742135],"study_design_scores_gemma":[0.00000324791,0.000016997574,0.00018880538,0.0000040880823,0.000005727205,0.000030455692,0.0000069271564,0.99271494,0.0021205419,0.0044731596,0.00043111757,0.0000039566153],"about_ca_topic_score_codex":0.001002065,"about_ca_topic_score_gemma":0.0010653986,"teacher_disagreement_score":0.001247873,"about_ca_system_score_codex":0.0006269066,"about_ca_system_score_gemma":0.00054078473,"threshold_uncertainty_score":0.0045485497},"labels":[],"label_agreement":null},{"id":"W2159903140","doi":"10.1109/ccece.2004.1345244","title":"A dual round-robin arbiter for split-transaction buses in system-on-chip implementations","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arbiter; Computer science; VHDL; Implementation; Dual (grammatical number); System on a chip; Embedded system; Parallel computing; Field-programmable gate array; Programming language","score_opus":0.0274624708730716,"score_gpt":0.2814317057351481,"score_spread":0.2539692348620765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159903140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09561697,0.00064973434,0.8888515,0.00030913766,0.00014582604,0.00023141752,0.0000625187,0.0038068632,0.010326006],"genre_scores_gemma":[0.61734205,0.000238261,0.37303835,0.00019433744,0.0000464498,0.00017254213,0.00011326817,0.00025561085,0.008599104],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993766,0.00020395152,0.000042986823,0.00008046267,0.00019130789,0.00010466625],"domain_scores_gemma":[0.9993142,0.00017673889,0.0000895523,0.00016336357,0.00019218665,0.00006391999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006001453,0.00035724454,0.00031428633,0.00039841203,0.00046683004,0.00088721514,0.001333356,0.00038694034,0.003747193],"category_scores_gemma":[0.0010480753,0.00030756064,0.00019509364,0.0002591128,0.00038876504,0.0008216414,0.0003985849,0.0006687871,0.0009964786],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0019183878,0.00038030493,0.0025036668,0.0008345253,0.00011877402,0.00066623493,0.0005576181,0.062914945,0.47620824,0.09434928,0.008816046,0.35073197],"study_design_scores_gemma":[0.0003141673,0.0014719636,0.0009161582,0.00010028279,0.00018691247,0.0007416604,0.00011859371,0.5571177,0.3630279,0.007853951,0.068011664,0.00013903528],"about_ca_topic_score_codex":0.0011695671,"about_ca_topic_score_gemma":0.003956151,"teacher_disagreement_score":0.003747193,"about_ca_system_score_codex":0.0005880741,"about_ca_system_score_gemma":0.0010089547,"threshold_uncertainty_score":0.012535632},"labels":[],"label_agreement":null},{"id":"W2159919256","doi":"10.1109/ccece.1998.685627","title":"Dimensioning computer network using tabu search","year":2002,"lang":"en","type":"article","venue":"","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Dimensioning; Tabu search; Heuristics; Computer science; Mathematical optimization; Genetic algorithm; Reliability (semiconductor); Network topology; Topology (electrical circuits); Distributed computing; Computer network; Algorithm; Engineering; Mathematics","score_opus":0.057406066165291945,"score_gpt":0.24267994624100434,"score_spread":0.18527388007571238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159919256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054196358,0.0024412968,0.9302869,0.00030597032,0.00006414324,0.00022319568,0.00017602499,0.001818524,0.010487652],"genre_scores_gemma":[0.31055206,0.0012672525,0.6854013,0.00013859608,0.000029673443,0.00043421387,0.000330948,0.00016483886,0.0016811768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994992,0.00027089848,0.000024100378,0.000057887955,0.0000975695,0.00005038168],"domain_scores_gemma":[0.99932384,0.0004066282,0.00007633803,0.000088074856,0.00008382565,0.000021275082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007727602,0.00057311985,0.00081615226,0.0015661444,0.0006548105,0.001089029,0.0006958612,0.0007368652,0.0031847097],"category_scores_gemma":[0.002683126,0.0004330701,0.00052799325,0.0016102669,0.0006388765,0.0011283798,0.00063882815,0.00056616863,0.00049485127],"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.00008919974,0.000052001524,0.00092521636,0.00018737561,0.00007416692,0.00005898532,0.000161215,0.80881613,0.002185195,0.021567198,0.0026916922,0.16319157],"study_design_scores_gemma":[0.00003090827,0.00005825668,0.000144735,0.000033060936,0.000024371746,0.000056818288,0.000054959517,0.98268384,0.0010393388,0.011619484,0.0042413855,0.0000128097245],"about_ca_topic_score_codex":0.003200429,"about_ca_topic_score_gemma":0.0029268072,"teacher_disagreement_score":0.003200429,"about_ca_system_score_codex":0.00068397477,"about_ca_system_score_gemma":0.00083421817,"threshold_uncertainty_score":0.010653913},"labels":[],"label_agreement":null},{"id":"W2160217602","doi":"10.1109/hpsr.2004.1303428","title":"Tracking the behavior of an ideal output queued switch using an input queued switch with unity speedup","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"McMaster University","funders":"","keywords":"Speedup; Computer science; Scheduling (production processes); Network packet; Packet switching; Distributed computing; Parallel computing; Computer network; Mathematical optimization; Mathematics","score_opus":0.05251152412115838,"score_gpt":0.2864712965904053,"score_spread":0.23395977246924693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160217602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49807352,0.00017515656,0.49704927,0.00027352088,0.000035409244,0.000048651327,0.00005125903,0.00056572753,0.0037275706],"genre_scores_gemma":[0.9617559,0.000087478955,0.037697025,0.000033337958,0.00001088893,0.000015145517,0.000025604526,0.000022972728,0.00035164467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995915,0.00008792915,0.00002136764,0.00007090517,0.00014435423,0.00008396204],"domain_scores_gemma":[0.9985374,0.00050526514,0.00034752404,0.00021968124,0.00022747494,0.00016254606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011807543,0.00041313886,0.00029056612,0.0005295592,0.00040232716,0.0010329384,0.0005693994,0.00025748077,0.0005589771],"category_scores_gemma":[0.0031092302,0.0001357673,0.00017742494,0.00042063295,0.0008796934,0.00082845485,0.0004617119,0.0005941316,0.0000837735],"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.00082664436,0.00025152537,0.01005571,0.00008859018,0.00003949782,0.00016766693,0.00028458048,0.80517113,0.08320203,0.053032927,0.00068258744,0.046197105],"study_design_scores_gemma":[0.000018682513,0.00011942078,0.0005689054,0.0000053984545,0.0000127624735,0.000022109316,0.000021489826,0.9778861,0.014824651,0.0060888217,0.00042401822,0.0000077056675],"about_ca_topic_score_codex":0.0024510627,"about_ca_topic_score_gemma":0.001380358,"teacher_disagreement_score":0.0024510627,"about_ca_system_score_codex":0.0012034762,"about_ca_system_score_gemma":0.0010549844,"threshold_uncertainty_score":0.008731902},"labels":[],"label_agreement":null},{"id":"W2161332802","doi":"10.1109/icci.1992.227683","title":"Conflict-free routing on hypercubes","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Alberta","funders":"","keywords":"Computer science; Precomputation; Hypercube; Routing (electronic design automation); Node (physics); Network packet; Computer network; Routing algorithm; Complement (music); Theoretical computer science; Algorithm; Routing protocol; Parallel computing; Engineering","score_opus":0.0265579464962453,"score_gpt":0.23474039203685956,"score_spread":0.20818244554061427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161332802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044855013,0.0005888115,0.93729067,0.00045287402,0.00020177646,0.00016100956,0.0001317535,0.0010462072,0.015271953],"genre_scores_gemma":[0.44120607,0.0006312679,0.5423377,0.00026743356,0.000086746666,0.0003305455,0.0005096635,0.0001653646,0.01446523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917454,0.00031585316,0.00006555983,0.000084086525,0.00026061153,0.00009937747],"domain_scores_gemma":[0.9991561,0.00027562174,0.00007912677,0.00017807701,0.00025436448,0.00005662782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072873937,0.00054303394,0.00049332844,0.00085151446,0.000980598,0.0014959429,0.0013775438,0.00071367534,0.003860832],"category_scores_gemma":[0.0018365609,0.00034174777,0.00039646972,0.0011145057,0.000712756,0.0020319587,0.0014090054,0.00062072783,0.0007727764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005990269,0.00012677826,0.0007414603,0.00023128424,0.00008551415,0.00027602437,0.00039963683,0.31003654,0.013049002,0.40988728,0.0084749805,0.2560924],"study_design_scores_gemma":[0.00013081921,0.00014808017,0.00016945045,0.00003149233,0.000030235777,0.000149826,0.00009468197,0.7450032,0.01799056,0.2091186,0.027090512,0.0000425169],"about_ca_topic_score_codex":0.0015222954,"about_ca_topic_score_gemma":0.0014716148,"teacher_disagreement_score":0.003860832,"about_ca_system_score_codex":0.0008989551,"about_ca_system_score_gemma":0.0008012318,"threshold_uncertainty_score":0.01291579},"labels":[],"label_agreement":null},{"id":"W2161459218","doi":"10.1109/wafer.1989.47567","title":"Extremally fault tolerant arrays","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Spare part; Cover (algebra); USable; Fault tolerance; Row; Dimension (graph theory); Row and column spaces; Metric (unit); Homogeneous; Computer science; Column (typography); Fault (geology); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Engineering; Distributed computing","score_opus":0.016814695620526968,"score_gpt":0.21979753274198596,"score_spread":0.20298283712145898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161459218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09560273,0.0016752235,0.8778173,0.00045157742,0.00013459586,0.000043082688,0.0001933561,0.00077091774,0.023311181],"genre_scores_gemma":[0.88089997,0.0012616809,0.10241464,0.0002691197,0.00021475765,0.0000791049,0.00038703004,0.00020717787,0.014266386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993766,0.00011826367,0.000040000818,0.00014149435,0.00021760089,0.00010603554],"domain_scores_gemma":[0.9983588,0.0007741481,0.00025972936,0.00033008624,0.00019723267,0.00008005147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032723907,0.00048640303,0.0005151284,0.00082663324,0.0005309828,0.0012212861,0.0007607413,0.000530374,0.003103033],"category_scores_gemma":[0.0026266149,0.00025925957,0.00031687465,0.0009511722,0.0010143998,0.0019360533,0.0010350167,0.0007787499,0.00048047467],"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.00041582892,0.00007129778,0.0014247283,0.0002843224,0.00007377066,0.00041622925,0.00038538733,0.35480312,0.035557024,0.43264762,0.007492083,0.16642869],"study_design_scores_gemma":[0.000038996743,0.00051679264,0.0008706816,0.000060029066,0.00006357692,0.001251926,0.0002126746,0.45830187,0.044794746,0.45284495,0.040994644,0.000049140664],"about_ca_topic_score_codex":0.0002638225,"about_ca_topic_score_gemma":0.00031541887,"teacher_disagreement_score":0.003103033,"about_ca_system_score_codex":0.0006045783,"about_ca_system_score_gemma":0.00020351273,"threshold_uncertainty_score":0.010380745},"labels":[],"label_agreement":null},{"id":"W2161887069","doi":"10.1109/hicss.1995.375483","title":"Fault tolerant communication algorithms on the star network using disjoint paths","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Disjoint sets; Computer science; Fault tolerance; Node (physics); Broadcasting (networking); Algorithm; Graph; Directed graph; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Computer network; Distributed computing; Discrete mathematics; Mathematics; Engineering; Artificial intelligence","score_opus":0.059429433530554535,"score_gpt":0.2430585396939682,"score_spread":0.18362910616341366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161887069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018126607,0.0004341937,0.9749839,0.00030594622,0.000052834715,0.00006367749,0.000095764786,0.00078370277,0.005153398],"genre_scores_gemma":[0.32431343,0.0011733859,0.66452193,0.00022967067,0.00009782855,0.00035476196,0.0006028276,0.0002860059,0.008420182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991948,0.00024782718,0.000058662255,0.00014085312,0.0002643985,0.00009345646],"domain_scores_gemma":[0.9985159,0.0006928241,0.00014990152,0.0002624346,0.00030562593,0.00007334477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092203036,0.000667721,0.00079000223,0.0012156316,0.00081841426,0.001143954,0.0011552304,0.0007815567,0.0032134112],"category_scores_gemma":[0.0037577657,0.00037368128,0.00054927624,0.0013963305,0.0009213085,0.002933183,0.0019410602,0.00086286257,0.0009948551],"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.0002587266,0.0000650424,0.0004049935,0.00019770153,0.000050068404,0.00009208875,0.0003741864,0.5007964,0.0038059573,0.31089413,0.008821458,0.17423928],"study_design_scores_gemma":[0.0000881218,0.00006625698,0.00008790491,0.000021432046,0.000014281411,0.000055763867,0.000050537827,0.77479416,0.0028091304,0.21425766,0.007739366,0.000015418871],"about_ca_topic_score_codex":0.0018213808,"about_ca_topic_score_gemma":0.0013683732,"teacher_disagreement_score":0.0032134112,"about_ca_system_score_codex":0.0010897995,"about_ca_system_score_gemma":0.0010571746,"threshold_uncertainty_score":0.010749936},"labels":[],"label_agreement":null},{"id":"W2161914044","doi":"10.1109/ccece.1997.608305","title":"GAUSS multicast ATM switch: analysis and simulation","year":2002,"lang":"en","type":"article","venue":"","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 Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Xcast; Pragmatic General Multicast; Distributed computing; Protocol Independent Multicast; Multimedia Broadcast Multicast Service; Routing (electronic design automation)","score_opus":0.028787094788959945,"score_gpt":0.2478884389371097,"score_spread":0.21910134414814977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161914044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5475633,0.0020227851,0.31179318,0.00081461895,0.000112832975,0.00018251393,0.0011297629,0.0015591701,0.13482173],"genre_scores_gemma":[0.976669,0.00061859784,0.015501154,0.000055246084,0.000035046887,0.00008526044,0.00022551676,0.00006483311,0.0067453226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.000045344652,0.0000058205947,0.000017021068,0.0000732935,0.00004203124],"domain_scores_gemma":[0.9994087,0.00035442822,0.00007186739,0.000029398168,0.000115434086,0.00002015374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038663723,0.00041048505,0.0005100994,0.00076658785,0.00041342134,0.0005354632,0.0007163655,0.0007182012,0.003862747],"category_scores_gemma":[0.0013522344,0.00021976659,0.00045461548,0.000697337,0.0003919323,0.00050412444,0.00032242943,0.00038190672,0.00043192846],"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.000039217968,0.000025254103,0.00054890855,0.000020938822,0.000008212517,0.00004524024,0.000024325947,0.9873466,0.0009043049,0.007050801,0.00046602395,0.0035202638],"study_design_scores_gemma":[0.0000016239853,0.0000042387283,0.000068891466,0.0000012115032,0.0000013963547,0.0000053738163,0.0000027533836,0.99930036,0.000111489135,0.00033734358,0.00016400614,0.0000013062386],"about_ca_topic_score_codex":0.012895186,"about_ca_topic_score_gemma":0.004296284,"teacher_disagreement_score":0.012895186,"about_ca_system_score_codex":0.0010424242,"about_ca_system_score_gemma":0.0005138044,"threshold_uncertainty_score":0.02564025},"labels":[],"label_agreement":null},{"id":"W2162127093","doi":"10.1109/ccece.2009.5090116","title":"Throughput-based network-on-chip topology generation and analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Network topology; Computer science; SystemC; Network on a chip; Throughput; Chip; Bandwidth (computing); Latency (audio); System on a chip; Computer network; Topology (electrical circuits); Embedded system; Computer architecture; Distributed computing; Engineering; Wireless; Telecommunications","score_opus":0.024220511260943194,"score_gpt":0.2578491128584529,"score_spread":0.23362860159750973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162127093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018660933,0.000092977956,0.9779188,0.000040125928,0.000017104043,0.000049427803,0.00009182928,0.0011282776,0.0020004883],"genre_scores_gemma":[0.590046,0.0003350315,0.40692967,0.00003255331,0.000029558492,0.00018427726,0.00048477954,0.000286332,0.0016718133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948174,0.0001438957,0.000019843717,0.00004315179,0.0002728713,0.0000385056],"domain_scores_gemma":[0.9985671,0.00063491665,0.00013500356,0.00025355065,0.00037971712,0.00002971838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006610879,0.0005937803,0.0004272134,0.0014707434,0.00038569886,0.0006680466,0.0008481212,0.00033959548,0.0021763367],"category_scores_gemma":[0.00344136,0.0002738219,0.00039840993,0.0008410633,0.00034492108,0.00097545085,0.00040864764,0.00043184817,0.00035038195],"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.00007612917,0.000046233363,0.0010996372,0.00014570473,0.000044956832,0.000117002375,0.000073999945,0.8331489,0.0201077,0.021687165,0.0014616696,0.12199092],"study_design_scores_gemma":[0.00000662274,0.000027102627,0.00035902017,0.0000060359366,0.000012454641,0.00006912218,0.000012955707,0.98429257,0.009331287,0.004171367,0.0017033066,0.000008165896],"about_ca_topic_score_codex":0.0012593487,"about_ca_topic_score_gemma":0.0016140745,"teacher_disagreement_score":0.0021763367,"about_ca_system_score_codex":0.0008185199,"about_ca_system_score_gemma":0.0006998419,"threshold_uncertainty_score":0.007280588},"labels":[],"label_agreement":null},{"id":"W2162292936","doi":"10.1145/1999946.1999970","title":"DART","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"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; Field-programmable gate array; Network on a chip; Speedup; Embedded system; Routing (electronic design automation); Microarchitecture; Queueing theory; Computer architecture; Software; Parallel computing; Computer network; Operating system","score_opus":0.04970709302125,"score_gpt":0.19941033649492915,"score_spread":0.14970324347367914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162292936","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006011269,0.0032989117,0.15611047,0.005154309,0.0050728116,0.00073519436,0.01306047,0.051273607,0.75928295],"genre_scores_gemma":[0.084135346,0.0042480035,0.13290565,0.0046476065,0.0012622877,0.0011092083,0.040182818,0.012380912,0.71912813],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872166,0.00017671901,0.00006258392,0.00023613498,0.0006485864,0.00015423748],"domain_scores_gemma":[0.99840325,0.00022493888,0.00006554284,0.0004062042,0.00062266795,0.00027731434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013270027,0.0010569219,0.00061051844,0.0013536975,0.0009936558,0.0033100639,0.0023064043,0.0018502313,0.26824743],"category_scores_gemma":[0.0034150146,0.00044491867,0.00075316976,0.0010875621,0.0004723096,0.0028186725,0.003116768,0.0017215426,0.17733908],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00038014777,0.00014480588,0.0012566759,0.00042033603,0.00003475828,0.00039822698,0.00020223645,0.0038809276,0.0062235314,0.06790786,0.5777448,0.34140578],"study_design_scores_gemma":[0.00004582007,0.00004723076,0.00019028298,0.000046747777,0.0000074374207,0.0002800857,0.000031722055,0.004396056,0.0020996744,0.006726167,0.986112,0.000016828733],"about_ca_topic_score_codex":0.0015431467,"about_ca_topic_score_gemma":0.0017453259,"teacher_disagreement_score":0.26824743,"about_ca_system_score_codex":0.0010492717,"about_ca_system_score_gemma":0.0017635714,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2162676381","doi":"10.1109/infcom.1995.515970","title":"Multicast and self-routing in ATM radix trees and banyan networks","year":2002,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Banyan; Computer science; Routing (electronic design automation); Decoding methods; Multicast; Tree (set theory); Radix (gastropod); Computer network; Multistage interconnection networks; Binary tree; Algorithm; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.013278542442291307,"score_gpt":0.20146133104061467,"score_spread":0.18818278859832335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162676381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07367243,0.0030555802,0.87627006,0.00054026494,0.00037652208,0.00011881206,0.000035689332,0.00034260468,0.045587983],"genre_scores_gemma":[0.5456121,0.005039005,0.39961243,0.00053460774,0.0005966091,0.00023042245,0.00009433481,0.00013064283,0.048149906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999726,0.00010316651,0.000012640617,0.000040148163,0.00008415998,0.00003393865],"domain_scores_gemma":[0.99947673,0.0002809353,0.00005047837,0.00006618736,0.00011023334,0.000015480955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036485383,0.00031489064,0.00025309605,0.00071910664,0.0006266626,0.0007419477,0.00039263067,0.0006990986,0.0023818053],"category_scores_gemma":[0.0011730773,0.0002052279,0.00027742144,0.00089383096,0.00057612365,0.0015427433,0.00047863545,0.00043132962,0.00052652525],"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.00024157885,0.00013254218,0.0013628285,0.0003004961,0.000059322392,0.00034186582,0.00041439684,0.053490836,0.01656384,0.55888176,0.0063300603,0.3618805],"study_design_scores_gemma":[0.00004136802,0.0004067693,0.0015988778,0.00009036486,0.000075111755,0.0012023121,0.00040726498,0.49277782,0.030658005,0.37643915,0.09624149,0.00006142281],"about_ca_topic_score_codex":0.00055250316,"about_ca_topic_score_gemma":0.00079239975,"teacher_disagreement_score":0.0023818053,"about_ca_system_score_codex":0.00037177725,"about_ca_system_score_gemma":0.00021650628,"threshold_uncertainty_score":0.007967949},"labels":[],"label_agreement":null},{"id":"W2163189799","doi":"10.1109/hpcs.2008.10","title":"Improving Communication Progress and Overlap in MPI Rendezvous Protocol over RDMA-enabled Interconnects","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings (International Symposium on High Performance Computing Systems and Applications)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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":"Remote direct memory access; Rendezvous; Computer science; InfiniBand; Polling; Message passing; Computer network; Gigabit Ethernet; Latency (audio); Protocol (science); Low latency (capital markets); Ethernet; Distributed computing; Telecommunications","score_opus":0.010187959342711656,"score_gpt":0.23934845149308026,"score_spread":0.2291604921503686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163189799","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82964206,0.00036722966,0.16473788,0.00014487203,0.000035062774,0.000044413206,0.000023172339,0.0018719605,0.0031332464],"genre_scores_gemma":[0.96784693,0.000110044486,0.030787226,0.000008163517,0.000016289729,0.000031470743,0.000041598156,0.000066154294,0.0010921159],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925953,0.0001680127,0.000049623177,0.00010774647,0.0002874423,0.00012755163],"domain_scores_gemma":[0.9983663,0.00062717655,0.00022286258,0.0004283553,0.0002674443,0.00008781039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089896,0.0005242719,0.0005099324,0.000627693,0.00055480265,0.0006123345,0.0009140875,0.00029297287,0.0005688811],"category_scores_gemma":[0.0032584437,0.00021869659,0.00018392499,0.00048325007,0.00073783525,0.0016953683,0.0011617253,0.00062146183,0.00017529503],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019239183,0.00037557504,0.009165935,0.00027104618,0.00006526021,0.0008289415,0.0020413713,0.23819852,0.5446958,0.031867288,0.0010808498,0.16948563],"study_design_scores_gemma":[0.00012184763,0.00068604725,0.0021671585,0.0000107838605,0.00004941547,0.00020723183,0.00022016211,0.64930403,0.33895802,0.0038235332,0.004406204,0.000045585835],"about_ca_topic_score_codex":0.001042533,"about_ca_topic_score_gemma":0.0008039533,"teacher_disagreement_score":0.0013089896,"about_ca_system_score_codex":0.00036332916,"about_ca_system_score_gemma":0.00057805097,"threshold_uncertainty_score":0.006922722},"labels":[],"label_agreement":null},{"id":"W2163835931","doi":"10.1109/jproc.2006.873611","title":"System-on-Chip: Reuse and Integration","year":2006,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":264,"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 British Columbia","funders":"CMC Microsystems","keywords":"Reuse; Computer science; System on a chip; Computer architecture; Embedded system; Block (permutation group theory); Chip; System integration; Network on a chip; Engineering; Telecommunications; Operating system","score_opus":0.009696687300472347,"score_gpt":0.20180127339522264,"score_spread":0.19210458609475028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163835931","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017196072,0.010086025,0.8681735,0.0021301024,0.00036435845,0.0002435349,0.000115607,0.002469604,0.09922125],"genre_scores_gemma":[0.44596317,0.011188876,0.49167237,0.0014108373,0.0004769991,0.00048807057,0.0005043687,0.0006332007,0.047662187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857163,0.00025980902,0.00007045527,0.00013380623,0.00084041606,0.00012388962],"domain_scores_gemma":[0.9992009,0.00015440218,0.000044190412,0.0003024752,0.00025250367,0.000045493616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008303865,0.0006002266,0.00052196207,0.0006857056,0.0003796246,0.0020859535,0.0013706009,0.0009398986,0.0052684783],"category_scores_gemma":[0.0021749642,0.0004499931,0.00041411535,0.0008928605,0.00081445504,0.002485734,0.0017613246,0.001207567,0.002548406],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053586293,0.000095951,0.0011096346,0.00071556744,0.00010675339,0.00051127496,0.0004119081,0.047855128,0.026829617,0.32702923,0.014989404,0.580292],"study_design_scores_gemma":[0.000050808838,0.00042655485,0.0018659309,0.00036834806,0.00016980626,0.0020970243,0.00023321743,0.15904446,0.027266923,0.22076118,0.58763397,0.00008170564],"about_ca_topic_score_codex":0.001412635,"about_ca_topic_score_gemma":0.001341731,"teacher_disagreement_score":0.0052684783,"about_ca_system_score_codex":0.000786554,"about_ca_system_score_gemma":0.0010441078,"threshold_uncertainty_score":0.017624855},"labels":[],"label_agreement":null},{"id":"W2164061165","doi":"10.1007/pl00008936","title":"Distributed computing on oriented anonymous hypercubes with faulty components","year":2001,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Hypercube; Computer science; Asynchronous communication; Parallel computing; Computation; Theory of computation; Lambda; Binary logarithm; Discrete mathematics; Combinatorics; Theoretical computer science; Algorithm; Mathematics; Computer network","score_opus":0.018123442934131442,"score_gpt":0.23799612498200168,"score_spread":0.21987268204787025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164061165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45694467,0.0006691459,0.53090304,0.0005569758,0.00032459063,0.00009834593,0.000111567504,0.00095566537,0.009435943],"genre_scores_gemma":[0.9358534,0.00043717417,0.057496928,0.00007029768,0.00010023057,0.000083085746,0.0001045268,0.000083311155,0.0057711042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917895,0.00031079253,0.000044465996,0.00009161917,0.00026509038,0.00010907525],"domain_scores_gemma":[0.9968252,0.0013385506,0.0002845459,0.00077062286,0.0006001067,0.000180965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011005135,0.0003647046,0.0005988143,0.0006987566,0.0014037777,0.0018081167,0.0012574274,0.0007113859,0.0013505844],"category_scores_gemma":[0.0052442667,0.00038634564,0.00033250058,0.0011404831,0.0013684859,0.0025306635,0.0016966413,0.0006466361,0.0003261667],"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.0012154935,0.00014242885,0.0031248135,0.00024387149,0.00007719986,0.00094615534,0.0007503097,0.6006825,0.017490223,0.3282957,0.0033629132,0.043668445],"study_design_scores_gemma":[0.00009125821,0.00012002567,0.0004379152,0.000015092161,0.000046059995,0.0001508385,0.00016617321,0.8254982,0.011097412,0.15808703,0.004266969,0.000022969909],"about_ca_topic_score_codex":0.0012022149,"about_ca_topic_score_gemma":0.0012520916,"teacher_disagreement_score":0.0018081167,"about_ca_system_score_codex":0.0009862971,"about_ca_system_score_gemma":0.00072791375,"threshold_uncertainty_score":0.007156074},"labels":[],"label_agreement":null},{"id":"W2164095419","doi":"10.1109/tvlsi.2006.878259","title":"Parallel programming models for a multiprocessor SoC platform applied to networking and multimedia","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Multiprocessing; Interoperability; Encoder; Computer architecture; Scheduling (production processes); Programming paradigm; Embedded system; Symmetric multiprocessor system; Operating system; Programming language","score_opus":0.02133919429732502,"score_gpt":0.23892494742592285,"score_spread":0.21758575312859782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164095419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013124938,0.0002812376,0.97673804,0.00023817662,0.0000577353,0.0001069523,0.00013253669,0.0007505279,0.0085699],"genre_scores_gemma":[0.2757408,0.0008991361,0.70375174,0.00019616389,0.000075421354,0.0008537378,0.00040803984,0.00031609592,0.01775886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996941,0.00008182368,0.000025095906,0.000037410446,0.00012696895,0.00003461914],"domain_scores_gemma":[0.9996542,0.00014669124,0.000036592628,0.000047776564,0.000101586214,0.000013251695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005216783,0.0005854141,0.00028563367,0.00032065972,0.00033396322,0.00082737755,0.00083916803,0.00048708875,0.0033445072],"category_scores_gemma":[0.00097567996,0.0002486541,0.00061229867,0.0003771416,0.00036069247,0.00076546945,0.0003938105,0.0008782521,0.00075997465],"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.00011681688,0.000087989676,0.0006769862,0.00024063115,0.000038357266,0.00038558824,0.00023721454,0.5888753,0.012235284,0.33629128,0.004823693,0.055990834],"study_design_scores_gemma":[0.000018720151,0.000034642693,0.00008219769,0.000015012357,0.000009278511,0.0000637331,0.000014843514,0.9564016,0.0019379888,0.030647835,0.010767754,0.000006412374],"about_ca_topic_score_codex":0.00254111,"about_ca_topic_score_gemma":0.0036278698,"teacher_disagreement_score":0.0033445072,"about_ca_system_score_codex":0.0005991854,"about_ca_system_score_gemma":0.0011028101,"threshold_uncertainty_score":0.011188507},"labels":[],"label_agreement":null},{"id":"W2164116916","doi":"10.1109/async.1997.587165","title":"Response time properties of some asynchronous circuits","year":2002,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Handshake; Asynchronous communication; Response time; Computer science; Simple (philosophy); Time complexity; Upper and lower bounds; Mathematics; Computer network; Algorithm","score_opus":0.02748085109517018,"score_gpt":0.19802904903207763,"score_spread":0.17054819793690745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164116916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42905354,0.0007365436,0.5493919,0.0006739743,0.00007064058,0.000104673876,0.00046071972,0.0016382526,0.017869638],"genre_scores_gemma":[0.97622603,0.00018452125,0.020445304,0.00010959141,0.000069508045,0.0001059083,0.00018238612,0.0001492164,0.0025274002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987431,0.00028574964,0.00008870542,0.00022674502,0.00042425387,0.00023156583],"domain_scores_gemma":[0.9884271,0.008135414,0.0012715441,0.0007798238,0.0010585191,0.00032764822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620601,0.0005271459,0.00048006652,0.0008217906,0.00050439197,0.0015467074,0.0009920482,0.00076043,0.004071553],"category_scores_gemma":[0.010964116,0.00031249784,0.0004661739,0.0007534063,0.0007488646,0.0015059083,0.0004419614,0.0009696513,0.0005005651],"study_design_candidate":"bench_or_experimental","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.0014337432,0.00018321832,0.0027906662,0.00042017497,0.000108079126,0.0007013925,0.00048648828,0.28165668,0.11121056,0.55613106,0.0030809573,0.041796982],"study_design_scores_gemma":[0.00010454558,0.00020344867,0.00042901636,0.000016610089,0.000051357576,0.00026110647,0.000049392034,0.8181054,0.020995358,0.1573158,0.0024430435,0.000024912519],"about_ca_topic_score_codex":0.0007565561,"about_ca_topic_score_gemma":0.00047219705,"teacher_disagreement_score":0.004071553,"about_ca_system_score_codex":0.0012722017,"about_ca_system_score_gemma":0.00046326022,"threshold_uncertainty_score":0.013620734},"labels":[],"label_agreement":null},{"id":"W2164323508","doi":"10.1109/hpdc.1999.805312","title":"Using embedded network processors to implement global memory management in a workstation cluster","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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; Host (biology); Workstation; Embedded system; Operating system; Latency (audio); Overhead (engineering); Network processor; Computer network","score_opus":0.03306600072763552,"score_gpt":0.3155103276320261,"score_spread":0.2824443269043906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164323508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7274673,0.0008178607,0.24748898,0.00026652234,0.0001824511,0.00014898782,0.00008606626,0.008333785,0.01520808],"genre_scores_gemma":[0.8431672,0.00026080903,0.14751251,0.00007559398,0.000029830708,0.000053425225,0.00024415046,0.00020181765,0.008454724],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998006,0.000045366898,0.000018230687,0.000034288452,0.00006295921,0.00003860574],"domain_scores_gemma":[0.99956864,0.00008869217,0.000034956523,0.00016885286,0.00010723456,0.000031638316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034168732,0.00025873014,0.00016787526,0.00020295425,0.00018959084,0.0004919729,0.0010439741,0.00022529988,0.002758396],"category_scores_gemma":[0.0011069624,0.00016637477,0.00013599872,0.0003548989,0.0002801191,0.0009162164,0.00047169862,0.0005302813,0.00054675806],"study_design_candidate":"bench_or_experimental","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.0020143376,0.0004998814,0.009817993,0.00031567094,0.0001396025,0.00069571106,0.0007388346,0.14596511,0.2687464,0.013199029,0.0076266043,0.5502408],"study_design_scores_gemma":[0.00057906925,0.0018411123,0.0065446817,0.0000747183,0.00028657055,0.00051717396,0.0002632846,0.5417806,0.37917045,0.00566633,0.06318565,0.00009036734],"about_ca_topic_score_codex":0.0015003684,"about_ca_topic_score_gemma":0.0021962016,"teacher_disagreement_score":0.002758396,"about_ca_system_score_codex":0.00040710502,"about_ca_system_score_gemma":0.00045426894,"threshold_uncertainty_score":0.009227693},"labels":[],"label_agreement":null},{"id":"W2164416844","doi":"10.1109/spdp.1990.143658","title":"Simulating parallel neighbouring communications among square meshes and square toruses","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Unit square; Polygon mesh; Square (algebra); Combinatorics; Torus; Graph; Computer science; Routing (electronic design automation); Upper and lower bounds; Discrete mathematics; Mathematics; Geometry; Computer network","score_opus":0.04711339833428155,"score_gpt":0.2568782318091289,"score_spread":0.20976483347484734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164416844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8358051,0.00007759964,0.15594944,0.00020048063,0.000045886292,0.00008475771,0.00018580777,0.0005538817,0.0070969574],"genre_scores_gemma":[0.9635229,0.000036594924,0.034882367,0.000027945393,0.0000063143784,0.000058105,0.00012523586,0.000035224955,0.0013053007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977356,0.000085912994,0.000011966467,0.000045621473,0.000037936148,0.000045102355],"domain_scores_gemma":[0.99839276,0.0011973749,0.00010822638,0.00014440034,0.00009166712,0.00006564023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041774465,0.00031878392,0.00028948716,0.00027713063,0.00036084538,0.00041120258,0.0009387459,0.0006984417,0.002395837],"category_scores_gemma":[0.0022173992,0.0002588091,0.0004429315,0.00040053795,0.00067672227,0.0006702461,0.0005039758,0.00036515843,0.00012476848],"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.00007514046,0.000028345668,0.0007168459,0.000014753734,0.000009037427,0.000036264,0.000029455105,0.9937489,0.00096282625,0.001808463,0.00018483873,0.002385263],"study_design_scores_gemma":[0.0000117273785,0.000019020734,0.000084687046,7.815058e-7,0.0000018440406,0.0000054865454,0.000012357048,0.9984553,0.00058244227,0.00071286823,0.00011216729,0.0000013648851],"about_ca_topic_score_codex":0.007276488,"about_ca_topic_score_gemma":0.005150917,"teacher_disagreement_score":0.007276488,"about_ca_system_score_codex":0.00073435134,"about_ca_system_score_gemma":0.0005246371,"threshold_uncertainty_score":0.014468253},"labels":[],"label_agreement":null},{"id":"W2164532099","doi":"10.1109/pacrim.1991.160848","title":"Design of robust packet synchronization using standard VLSI input-output devices in packet radio communication","year":2002,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Preamble; Computer science; Network packet; Synchronization (alternating current); Byte; Very-large-scale integration; Channel (broadcasting); Error detection and correction; Throughput; Real-time computing; Computer hardware; Computer network; Embedded system; Algorithm; Wireless; Telecommunications","score_opus":0.06918007443093127,"score_gpt":0.25172114699873577,"score_spread":0.1825410725678045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164532099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05838674,0.0004947087,0.9344169,0.00009569398,0.000071627546,0.00014248423,0.00006629091,0.0010251902,0.00530033],"genre_scores_gemma":[0.7391233,0.0005506359,0.25696623,0.00009555063,0.000058079204,0.00022250303,0.00011359293,0.00007524858,0.0027949137],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999782,0.000047868878,0.000014308292,0.000045329074,0.00008401322,0.000026445412],"domain_scores_gemma":[0.9997665,0.00006687106,0.00006682095,0.000028572003,0.0000631044,0.000008107832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033647162,0.00034105405,0.00022163226,0.0002560821,0.00017555064,0.00057719235,0.00064838096,0.00029132311,0.0010640053],"category_scores_gemma":[0.000629824,0.00016583025,0.00017534722,0.00027072607,0.00025585075,0.00034416447,0.00018898874,0.000241282,0.00032281852],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0004957551,0.0001545147,0.0030672278,0.00088778406,0.00015603415,0.00041582529,0.00028106777,0.22619519,0.4748356,0.0786245,0.003105814,0.21178077],"study_design_scores_gemma":[0.00012197822,0.0013830732,0.0012097583,0.00007153578,0.0001348643,0.00030362647,0.000058044752,0.7679305,0.2057349,0.0051591625,0.017859932,0.000032578668],"about_ca_topic_score_codex":0.00029414412,"about_ca_topic_score_gemma":0.00051602017,"teacher_disagreement_score":0.0010640053,"about_ca_system_score_codex":0.00038891437,"about_ca_system_score_gemma":0.0004911548,"threshold_uncertainty_score":0.0035594702},"labels":[],"label_agreement":null},{"id":"W2164895946","doi":"10.1109/spdp.1994.346163","title":"Optimal polling in communication networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Simon Fraser University","funders":"","keywords":"Polling; Computer science; Polling system; Broadcasting (networking); Node (physics); Computer network; Process (computing); Hypercube; Theoretical computer science; Distributed computing; Parallel computing; Engineering","score_opus":0.02345683752900508,"score_gpt":0.22147989216900005,"score_spread":0.19802305463999498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164895946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038376536,0.0030685693,0.9444778,0.0008244769,0.00017592873,0.00012232758,0.00013326993,0.0006638126,0.012157297],"genre_scores_gemma":[0.7681765,0.0035169208,0.21751297,0.00040760342,0.00027678927,0.000412425,0.0003898042,0.00041402897,0.008892953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979963,0.00062947295,0.00011400821,0.00044669316,0.00041637695,0.0003971214],"domain_scores_gemma":[0.99471325,0.003954262,0.0004260527,0.00045615155,0.00023893215,0.0002112818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018608468,0.00100739,0.0019181389,0.0011380245,0.0017009573,0.0023505352,0.001515525,0.0018270339,0.0032820983],"category_scores_gemma":[0.010708367,0.001001687,0.00075700646,0.0020681156,0.0027827902,0.0041905018,0.0017845919,0.0016565969,0.000502033],"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.00022249774,0.0000670811,0.00057930214,0.00026867597,0.000055360408,0.00009907044,0.00017950941,0.74742806,0.0023857632,0.1976274,0.0045942995,0.046492994],"study_design_scores_gemma":[0.00005649461,0.00006587627,0.00020072369,0.000027865692,0.000023498946,0.000052913743,0.000048492195,0.7310766,0.0010090029,0.26365128,0.0037699747,0.000017296956],"about_ca_topic_score_codex":0.0028935461,"about_ca_topic_score_gemma":0.0021775807,"teacher_disagreement_score":0.0032820983,"about_ca_system_score_codex":0.0027042404,"about_ca_system_score_gemma":0.0017046997,"threshold_uncertainty_score":0.019620776},"labels":[],"label_agreement":null},{"id":"W2164900024","doi":"10.1109/tcad.2005.852438","title":"PowerHerd: a distributed scheme for dynamically satisfying peak-power constraints in interconnection networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"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":"Princeton University","keywords":"Interconnection; Computer science; Router; Power (physics); Power budget; Spare part; Distributed computing; Distributed power; Computer network; Electric power system; Engineering","score_opus":0.022843212074690724,"score_gpt":0.23711593741676754,"score_spread":0.2142727253420768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164900024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024527114,0.0003401401,0.96802384,0.00021239638,0.00010002638,0.00017296727,0.000093909475,0.00405722,0.0024723345],"genre_scores_gemma":[0.6841372,0.00028940727,0.30903852,0.00029654667,0.00013334697,0.00048499607,0.00025106352,0.00055590656,0.004813022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988863,0.0002212179,0.00008691509,0.000305514,0.0003469324,0.00015311645],"domain_scores_gemma":[0.99755543,0.0007016031,0.00029391726,0.00096901314,0.00029416516,0.0001858145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018326263,0.0011115533,0.0011513601,0.0009691986,0.0013700951,0.0012637773,0.0036159772,0.0007894221,0.0041151517],"category_scores_gemma":[0.0044524996,0.000561142,0.00034762142,0.0008229476,0.0010486055,0.002638509,0.003238956,0.0013089604,0.00067165826],"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.0013652691,0.00040417438,0.0014935868,0.00029112893,0.000106845306,0.0003242832,0.00047246055,0.36947644,0.06640123,0.036166035,0.016968977,0.50652957],"study_design_scores_gemma":[0.00021464133,0.0001926638,0.00021087717,0.000012208924,0.000029813033,0.00011522192,0.000038882816,0.956351,0.017530223,0.016509674,0.008754886,0.000039902996],"about_ca_topic_score_codex":0.0012172909,"about_ca_topic_score_gemma":0.0034705456,"teacher_disagreement_score":0.0041151517,"about_ca_system_score_codex":0.001223827,"about_ca_system_score_gemma":0.0011985422,"threshold_uncertainty_score":0.013766587},"labels":[],"label_agreement":null},{"id":"W2165075869","doi":"10.1109/iv.2006.48","title":"Efficient Multicast Algorithms for Mesh-connected Multicomputers","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Xcast; Computer network; Source-specific multicast; Distributed computing; Pragmatic General Multicast; Multicast address; Algorithm; Parallel computing","score_opus":0.0170627452986702,"score_gpt":0.24617470609085193,"score_spread":0.22911196079218174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165075869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07952386,0.00093859545,0.91363096,0.0004040974,0.000057442005,0.00013190958,0.00012137161,0.0007800626,0.0044117905],"genre_scores_gemma":[0.51618856,0.0005521975,0.47908673,0.0001305122,0.00006007699,0.00024166136,0.0002694033,0.00007301568,0.0033978107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.00010220397,0.000021343565,0.00004408307,0.000105841005,0.000051155937],"domain_scores_gemma":[0.99950814,0.00024054201,0.000058972713,0.00006321999,0.00010501429,0.000024195335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057874725,0.0003837014,0.00051624695,0.00072331226,0.0006971472,0.0005097677,0.0009330715,0.00081391516,0.0013988208],"category_scores_gemma":[0.0018911113,0.00027770456,0.00032489645,0.00082539,0.0003325843,0.0011829068,0.00092609186,0.00042129488,0.00021796423],"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.000456495,0.00014732889,0.0013583159,0.00019671269,0.000064399326,0.00010540213,0.00025167712,0.6383149,0.0123344585,0.064608075,0.006398574,0.27576372],"study_design_scores_gemma":[0.00007995641,0.000060296334,0.0001893701,0.000008567847,0.000010293443,0.000044674918,0.00003665576,0.96903336,0.0021596777,0.026041033,0.002330232,0.000005888825],"about_ca_topic_score_codex":0.0014373322,"about_ca_topic_score_gemma":0.0014202684,"teacher_disagreement_score":0.0014373322,"about_ca_system_score_codex":0.00096274714,"about_ca_system_score_gemma":0.0005255468,"threshold_uncertainty_score":0.006985247},"labels":[],"label_agreement":null},{"id":"W2165740957","doi":"10.1109/bss.1997.658922","title":"A RAM-based generic packet switch with scheduling capability","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Queueing theory; Scheduling (production processes); Packet switching; Fair queuing; Unicast; Cut-through switching; Embedded system; Computer hardware; Burst switching; Round-robin scheduling; Transmission delay; Dynamic priority scheduling; Quality of service","score_opus":0.028732162774720568,"score_gpt":0.2141754070282031,"score_spread":0.18544324425348252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165740957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08473183,0.0026995305,0.82923645,0.0003623078,0.00069428986,0.00051572174,0.0010409859,0.035541225,0.045177657],"genre_scores_gemma":[0.5838544,0.0011379444,0.39147124,0.0006175093,0.00033137432,0.00031216512,0.0013328752,0.00040534863,0.020537093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982136,0.000025290337,0.000010400635,0.000043163778,0.00006420359,0.000035631776],"domain_scores_gemma":[0.99987924,0.000014512423,0.000017436245,0.000041260744,0.00002526779,0.000022303808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019481573,0.0004624786,0.00041719308,0.0005388786,0.00027826245,0.00042900047,0.0012892472,0.0005850309,0.0067837383],"category_scores_gemma":[0.00020575164,0.0002199215,0.0003341129,0.00045052686,0.0002624727,0.0006668072,0.0004505036,0.00050935114,0.0021579033],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0008529988,0.0004194687,0.0014351391,0.00086568086,0.0001050771,0.0006503374,0.00011291795,0.020571254,0.4499962,0.1046884,0.025838124,0.39446437],"study_design_scores_gemma":[0.00042253762,0.0030371328,0.004414188,0.00009332856,0.0003702371,0.0049210773,0.000043681102,0.29377413,0.28577095,0.021404479,0.38557455,0.00017367647],"about_ca_topic_score_codex":0.00028702203,"about_ca_topic_score_gemma":0.00026060277,"teacher_disagreement_score":0.0067837383,"about_ca_system_score_codex":0.00028555168,"about_ca_system_score_gemma":0.00025774064,"threshold_uncertainty_score":0.022693813},"labels":[],"label_agreement":null},{"id":"W2165807634","doi":"10.1109/asap.2007.4429997","title":"Latency Reduction of Global Traffic in Wormhole-Routed Meshes Using Hierarchical Rings for Global Routing","year":2007,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Computer science; Computer network; Latency (audio); Wormhole; Distributed computing; SystemC; Hierarchical routing; Scalability; Network topology; Dynamic Source Routing; Mesh networking; Polygon mesh; Static routing; Topology (electrical circuits); Routing protocol; Routing (electronic design automation); Embedded system; Engineering; Telecommunications; Wireless","score_opus":0.025707794315558235,"score_gpt":0.2922342485983668,"score_spread":0.2665264542828085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165807634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84351665,0.0006180684,0.15035298,0.00011365226,0.000057046174,0.000026043943,0.000060525235,0.00056660164,0.0046883663],"genre_scores_gemma":[0.98166806,0.000109183115,0.017477756,0.000012296708,0.000012060191,0.000011894669,0.000034823646,0.000021465014,0.00065244857],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.000048867754,0.000011282422,0.000024001067,0.00004890305,0.00003677078],"domain_scores_gemma":[0.9996377,0.00015020453,0.000055241773,0.00007972299,0.000060125287,0.000016911763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002957447,0.0002446481,0.00021397322,0.00029164992,0.00020952958,0.00026281626,0.00034884227,0.0001868784,0.00069053454],"category_scores_gemma":[0.0007306663,0.00011540517,0.00020283024,0.000255556,0.00020955755,0.00066561124,0.0003837122,0.00013525086,0.00011533146],"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.0011553168,0.00014625254,0.0030927153,0.0003282195,0.000080263,0.00041891632,0.00025267355,0.35877782,0.42178786,0.017508956,0.0019181005,0.19453306],"study_design_scores_gemma":[0.00004811879,0.00076214026,0.0016495876,0.0000126789,0.00007320528,0.00022897091,0.00009465583,0.8878917,0.10190171,0.004558797,0.0027541518,0.000024346726],"about_ca_topic_score_codex":0.00042170574,"about_ca_topic_score_gemma":0.0008804376,"teacher_disagreement_score":0.00069053454,"about_ca_system_score_codex":0.00024590018,"about_ca_system_score_gemma":0.00015111857,"threshold_uncertainty_score":0.0023100376},"labels":[],"label_agreement":null},{"id":"W2165921210","doi":"10.1109/icc.1995.524532","title":"A methodology for designing local area ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Heuristics; Computer science; Logical topology; Topology (electrical circuits); Quality of service; Asynchronous Transfer Mode; Computer network; Local area network; Distributed computing; Engineering","score_opus":0.15863102451961478,"score_gpt":0.28437209362865584,"score_spread":0.12574106910904106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165921210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003707019,0.00013513489,0.9949582,0.000049043676,0.000039838134,0.00014968915,0.000081577295,0.0007636895,0.0034520577],"genre_scores_gemma":[0.0070300177,0.0002641921,0.9888166,0.00006462264,0.000026968002,0.00033603937,0.00019809861,0.00023000012,0.003033433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855334,0.0003218761,0.00013376576,0.00024172927,0.00064984936,0.000099417266],"domain_scores_gemma":[0.99904245,0.00035146,0.00008418863,0.00022270597,0.00025798794,0.00004114083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621651,0.0013787847,0.0006211406,0.0020695825,0.0016056662,0.0018902574,0.0024088626,0.0010436067,0.011341006],"category_scores_gemma":[0.0029977602,0.0011823834,0.0016956531,0.0016553899,0.0015106156,0.0023632743,0.0014031415,0.0018462717,0.006562847],"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.000052630505,0.00014921556,0.0006253896,0.00092395185,0.000112544054,0.00056084036,0.0005639054,0.06538651,0.01994323,0.39427257,0.024213774,0.4931954],"study_design_scores_gemma":[0.0000868508,0.00019425282,0.00035800802,0.00034222897,0.00011414385,0.001487115,0.00016663056,0.17191586,0.024893021,0.24701506,0.5533092,0.00011765512],"about_ca_topic_score_codex":0.0021433819,"about_ca_topic_score_gemma":0.0028915394,"teacher_disagreement_score":0.011341006,"about_ca_system_score_codex":0.00087604724,"about_ca_system_score_gemma":0.0016969563,"threshold_uncertainty_score":0.03793943},"labels":[],"label_agreement":null},{"id":"W2166382761","doi":"10.1109/sicon.1993.515786","title":"HITIBAS-A High-Throughput Input-Buffered ATM Switch","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"Universitat Politècnica de Catalunya","keywords":"Banyan; Computer science; FIFO (computing and electronics); Throughput; Blocking (statistics); Computer network; Network packet; Asynchronous Transfer Mode; Queueing theory; Queue; Packet switching; Port (circuit theory); Parallel computing; Computer hardware; Operating system; Engineering","score_opus":0.022610294085052166,"score_gpt":0.20512524219949646,"score_spread":0.1825149481144443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166382761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32250032,0.0051130103,0.49731234,0.00083806756,0.001176707,0.0005211352,0.0024511726,0.048119713,0.121967465],"genre_scores_gemma":[0.86757475,0.0010432532,0.10067375,0.00032002007,0.00015701538,0.00014179233,0.002057293,0.0002455863,0.027786497],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998078,0.000019244437,0.000006970678,0.000023912957,0.00009426116,0.000047900845],"domain_scores_gemma":[0.99989974,0.00001183701,0.0000095213145,0.000017289001,0.00002848681,0.00003306646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017269683,0.00046175288,0.0004808907,0.0005779846,0.0006025333,0.0009952997,0.001406094,0.0003997285,0.008495025],"category_scores_gemma":[0.00018793516,0.00021352974,0.000225858,0.00063835556,0.00024888513,0.000762591,0.0006755158,0.00048403614,0.0022206497],"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.0024932048,0.0006875843,0.005452847,0.0006909393,0.00016190376,0.0018570867,0.00013393331,0.02909892,0.45325726,0.05826919,0.057232544,0.39066464],"study_design_scores_gemma":[0.00091124634,0.0039682863,0.010653911,0.00009914691,0.00045000034,0.0050349566,0.00016036324,0.37567866,0.379913,0.020692965,0.20211908,0.00031832448],"about_ca_topic_score_codex":0.0014405806,"about_ca_topic_score_gemma":0.0018659685,"teacher_disagreement_score":0.008495025,"about_ca_system_score_codex":0.0005585183,"about_ca_system_score_gemma":0.0005779733,"threshold_uncertainty_score":0.02841872},"labels":[],"label_agreement":null},{"id":"W2166471827","doi":"10.1109/fpt.2008.4762418","title":"An on-chip testbed that emulates runtime traffic and reduces design verification time for FPGA designs","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Simon Fraser University","funders":"","keywords":"Reconfigurability; Testbed; Computer science; Embedded system; Field-programmable gate array; System on a chip; Computer architecture; Leverage (statistics); Design process; Engineering; Work in process; Computer network; Operating system","score_opus":0.0837298513092016,"score_gpt":0.2650669568182533,"score_spread":0.18133710550905172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166471827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78922373,0.00016466771,0.18744323,0.00017102448,0.00017144416,0.00062477455,0.0008122353,0.013115597,0.008273224],"genre_scores_gemma":[0.91507405,0.00006707604,0.081421316,0.0000653095,0.000011505033,0.00027918944,0.0008856948,0.0002713926,0.001924491],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991684,0.0003207129,0.000055115775,0.00013234303,0.00020722921,0.00011611685],"domain_scores_gemma":[0.9978672,0.0006616238,0.00029510018,0.0007003261,0.0002987103,0.00017701242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095113,0.0006823201,0.0003362508,0.00058399996,0.00026670104,0.00040874234,0.0011260343,0.00037495376,0.002664661],"category_scores_gemma":[0.0027794046,0.00022099479,0.00023275583,0.0002826141,0.00037675063,0.00068385457,0.00043158545,0.00039719266,0.0004397874],"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.0020199334,0.0024291778,0.019742917,0.00064094766,0.00013183251,0.0018171403,0.00043508626,0.31313008,0.35868552,0.0120456135,0.011638007,0.27728376],"study_design_scores_gemma":[0.0002563979,0.002928789,0.007965617,0.000034998127,0.00006205096,0.00070378295,0.00010792094,0.7397188,0.23402424,0.0014310046,0.01271343,0.000053041957],"about_ca_topic_score_codex":0.0010789509,"about_ca_topic_score_gemma":0.0011902518,"teacher_disagreement_score":0.002664661,"about_ca_system_score_codex":0.0007446354,"about_ca_system_score_gemma":0.00067081733,"threshold_uncertainty_score":0.008914173},"labels":[],"label_agreement":null},{"id":"W2166523961","doi":"10.1109/infcom.1997.635111","title":"A general purpose cell sequencer/scheduler for ATM switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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; Queue; Scheduling (production processes); Computer network; Quality of service; Schedule; Latency (audio); Modular design; Real-time computing; Operating system","score_opus":0.0359880207985252,"score_gpt":0.22667021686954597,"score_spread":0.19068219607102077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166523961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048572075,0.0022055854,0.8816409,0.00017963836,0.0008741922,0.0012951946,0.0014751031,0.04571109,0.018046236],"genre_scores_gemma":[0.36795443,0.0012996942,0.5843058,0.00078748754,0.000495825,0.0008520795,0.003080329,0.0019291728,0.03929507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971586,0.00003771317,0.000020423344,0.000057348978,0.00011736739,0.000051330866],"domain_scores_gemma":[0.9997441,0.00003129155,0.000027523492,0.000070059454,0.000083812054,0.000043232205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040852398,0.00076399196,0.00069689716,0.0005115655,0.00052898383,0.00051836495,0.0013959423,0.0004616314,0.009358555],"category_scores_gemma":[0.0005623078,0.00039354275,0.0002967482,0.0006162587,0.0002445483,0.0005255383,0.00040609547,0.000745464,0.0048513934],"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.0015657588,0.0004471309,0.0027193155,0.00074866944,0.00010631868,0.00056291034,0.00018829762,0.016906494,0.35339603,0.022403149,0.082909584,0.51804626],"study_design_scores_gemma":[0.0007240811,0.0013179935,0.0045756116,0.00006575983,0.00024635854,0.001832966,0.000041011033,0.30133408,0.35004148,0.006445775,0.33318216,0.00019272945],"about_ca_topic_score_codex":0.0012193414,"about_ca_topic_score_gemma":0.0015625502,"teacher_disagreement_score":0.009358555,"about_ca_system_score_codex":0.0006570989,"about_ca_system_score_gemma":0.00082698785,"threshold_uncertainty_score":0.03130746},"labels":[],"label_agreement":null},{"id":"W2166549081","doi":"10.1109/pacrim.1995.519585","title":"A simulation model for performance analysis of routing algorithms in concurrent systems under realistic load","year":2002,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Computer science; Petri net; Routing (electronic design automation); Distributed computing; Network routing; Probabilistic logic; Constraint (computer-aided design); Discrete event simulation; Static routing; Routing algorithm; Algorithm; Routing protocol; Simulation; Computer network; Engineering; Artificial intelligence","score_opus":0.08413463087532504,"score_gpt":0.29617202421844546,"score_spread":0.21203739334312044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166549081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019797368,0.00015112582,0.9760098,0.00013550048,0.0000395662,0.00015095598,0.00012444069,0.0004992689,0.0030919071],"genre_scores_gemma":[0.7739043,0.00073915784,0.21821684,0.0000998448,0.00007647347,0.001135381,0.00050247443,0.00018580796,0.005139715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.00033240602,0.000049663697,0.00008474725,0.00039415376,0.00007690831],"domain_scores_gemma":[0.9986368,0.000876858,0.00010348834,0.00014879016,0.00018653944,0.00004755991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010548217,0.0007994274,0.00075343327,0.0005573693,0.00052502955,0.0009609084,0.0012588528,0.0010923898,0.001810479],"category_scores_gemma":[0.0041395626,0.0005218158,0.0008339249,0.00055427675,0.00066444447,0.001262143,0.0006077402,0.0013473181,0.00034563243],"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.000036777437,0.00003366504,0.0002421436,0.000028835188,0.000018463392,0.000043438307,0.000033084685,0.96713793,0.0025663383,0.026383253,0.00018194011,0.00329413],"study_design_scores_gemma":[0.000007338332,0.000021571004,0.000032822358,0.000003409974,0.0000063093967,0.000011358139,0.0000028863392,0.99507433,0.00055758056,0.0036005978,0.0006782294,0.0000035753912],"about_ca_topic_score_codex":0.0048437384,"about_ca_topic_score_gemma":0.002750536,"teacher_disagreement_score":0.0048437384,"about_ca_system_score_codex":0.0012503273,"about_ca_system_score_gemma":0.0016616818,"threshold_uncertainty_score":0.009631097},"labels":[],"label_agreement":null},{"id":"W2166582348","doi":"10.1109/infcom.1996.493043","title":"Signaling network architecture and transaction protocols to support realtime connection rerouting in ATM/B-ISDNs","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Signaling protocol; Distributed computing; Unicast; Multicast; Asynchronous Transfer Mode; Handover; Quality of service","score_opus":0.03268515201664486,"score_gpt":0.2625821141523662,"score_spread":0.22989696213572136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166582348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112564586,0.00086071296,0.86477274,0.0006580085,0.00030614177,0.00022933289,0.0000814829,0.0021937876,0.018333238],"genre_scores_gemma":[0.72510093,0.0006858354,0.26660106,0.00022213723,0.00018501199,0.00025948885,0.00020049146,0.00008904664,0.0066560246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955255,0.000121476536,0.000048297916,0.00004592706,0.000188468,0.00004329261],"domain_scores_gemma":[0.99949396,0.000090812646,0.00005703923,0.00010956718,0.00020241804,0.000046172223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092715747,0.0002715525,0.00017947202,0.00042089025,0.00052041904,0.001141813,0.000916037,0.0004984463,0.0013603126],"category_scores_gemma":[0.0009257976,0.00019863028,0.0001797563,0.0004670762,0.0006243221,0.0013290909,0.0004504154,0.0008394307,0.0004145105],"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.0005983694,0.00021892754,0.001586402,0.00020644677,0.0000334064,0.00044611283,0.00037701236,0.09764244,0.16966596,0.52248806,0.0063343504,0.2004026],"study_design_scores_gemma":[0.00010472456,0.00037472113,0.0008519305,0.00003887771,0.00006193964,0.00035466702,0.0001290176,0.8511685,0.050719693,0.04698266,0.049163863,0.000049432485],"about_ca_topic_score_codex":0.0014851961,"about_ca_topic_score_gemma":0.0018267853,"teacher_disagreement_score":0.0014851961,"about_ca_system_score_codex":0.0006783621,"about_ca_system_score_gemma":0.00089399103,"threshold_uncertainty_score":0.0049218535},"labels":[],"label_agreement":null},{"id":"W2166582984","doi":"10.1016/j.tcs.2009.05.007","title":"On the surface area of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-star graph","year":2009,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Graph; Scroll; Node (physics); Surface (topology); Mathematics; Combinatorics; Computer science; Algorithm; Discrete mathematics; Geometry; Physics","score_opus":0.01527671044608049,"score_gpt":0.23081596269499186,"score_spread":0.21553925224891138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166582984","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2708762,0.0032744736,0.22051811,0.005087093,0.0015814701,0.00022694543,0.012771877,0.0022685272,0.4833953],"genre_scores_gemma":[0.8405999,0.0026418488,0.044985045,0.00050227955,0.0009646208,0.00026684566,0.005632683,0.001700305,0.1027065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996375,0.00004455026,0.000009921754,0.00011402071,0.00012999921,0.000064022075],"domain_scores_gemma":[0.99892277,0.00046165797,0.00010133197,0.000085816384,0.00033540287,0.00009292194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030792266,0.00063931476,0.000599491,0.001866569,0.0005836083,0.0017680353,0.0007424138,0.0007961956,0.053738426],"category_scores_gemma":[0.0027822477,0.00018194402,0.00042363774,0.0010863101,0.00083000114,0.0016056569,0.0010197404,0.0009881053,0.010023351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037439112,0.00010666575,0.0050815493,0.00056700804,0.000055641907,0.0003852425,0.0005945087,0.019575737,0.038078867,0.7109146,0.06250317,0.16176258],"study_design_scores_gemma":[0.00008603384,0.00015961986,0.020956684,0.00030423613,0.00006680848,0.0012926378,0.00075679313,0.14759855,0.020769857,0.65883094,0.14907399,0.000103820574],"about_ca_topic_score_codex":0.0013639508,"about_ca_topic_score_gemma":0.0013515552,"teacher_disagreement_score":0.053738426,"about_ca_system_score_codex":0.0006867664,"about_ca_system_score_gemma":0.00036689514,"threshold_uncertainty_score":0.17977297},"labels":[],"label_agreement":null},{"id":"W2166618039","doi":"10.48550/arxiv.1312.5764","title":"Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based Heterogeneous MPSOCs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Emera (Canada)","funders":"","keywords":"Heuristics; Computer science; Dijkstra's algorithm; MPSoC; Heuristic; Routing (electronic design automation); Task (project management); Overhead (engineering); Parallel computing; Distributed computing; Network on a chip; Context (archaeology); Embedded system; Shortest path problem; Multiprocessing; Graph; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.05802660082966534,"score_gpt":0.17902400747790087,"score_spread":0.12099740664823552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166618039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06586028,0.00054932124,0.9294141,0.000094316005,0.000041611016,0.00013113662,0.00006221156,0.00063798815,0.0032090403],"genre_scores_gemma":[0.4754022,0.00036369552,0.5219349,0.00005332894,0.000012685337,0.00019267549,0.0001993006,0.00015641679,0.0016847033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.0001293448,0.000026599793,0.000050419134,0.000101310725,0.00007193632],"domain_scores_gemma":[0.9991997,0.0004321,0.000101224825,0.0000968051,0.00013065543,0.000039452883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067531713,0.0006706317,0.00042544713,0.0007584387,0.00037749376,0.00052209495,0.0007588602,0.00038206656,0.0010170053],"category_scores_gemma":[0.002161129,0.00035719003,0.00042094383,0.00060712564,0.00042418044,0.00061785715,0.0004944142,0.00032190545,0.00018204121],"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.000097904995,0.000048162612,0.00087273127,0.000120254306,0.00003426545,0.00008451359,0.000120157216,0.9009099,0.009219334,0.00817382,0.00092425133,0.07939479],"study_design_scores_gemma":[0.000026773978,0.00009582499,0.00034477425,0.000016965667,0.000021904194,0.00008358426,0.000084090694,0.9840608,0.0056377617,0.0067014825,0.0029099558,0.00001602802],"about_ca_topic_score_codex":0.0026978706,"about_ca_topic_score_gemma":0.0035988495,"teacher_disagreement_score":0.0026978706,"about_ca_system_score_codex":0.0007204095,"about_ca_system_score_gemma":0.0011586264,"threshold_uncertainty_score":0.0053643584},"labels":[],"label_agreement":null},{"id":"W2166741302","doi":"10.1109/soac.1991.143920","title":"On the 2*2 matrix multiplication","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Calgary","funders":"","keywords":"Scalar multiplication; Binary number; Field (mathematics); Finite field; Matrix multiplication; Bilinear interpolation; Multiplication (music); Mathematics; Binary operation; Arithmetic; Multiplication algorithm; Algebra over a field; Matrix (chemical analysis); Computer science; Discrete mathematics; Scalar (mathematics); Algorithm; Combinatorics; Pure mathematics; Statistics","score_opus":0.028048951275374174,"score_gpt":0.23574355389736573,"score_spread":0.20769460262199155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166741302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016710835,0.026063228,0.8616437,0.0028503498,0.004427519,0.00012924417,0.00048664244,0.000730855,0.086957626],"genre_scores_gemma":[0.31068367,0.020375848,0.5978391,0.0030822435,0.0058178236,0.00046073738,0.0011497989,0.00070795615,0.05988282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981937,0.00049034273,0.00015979314,0.00036087155,0.0006416883,0.0001536024],"domain_scores_gemma":[0.9992435,0.00030044658,0.00006993214,0.00016288391,0.00018462799,0.000038646467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410415,0.0015502998,0.0010522372,0.0016564582,0.0013900462,0.0025942544,0.0010052071,0.000918082,0.0143853305],"category_scores_gemma":[0.0040193843,0.0006615124,0.0008993745,0.0028859563,0.003653837,0.005382816,0.0026180882,0.0027288417,0.008170739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007698738,0.000036834263,0.00019846362,0.00020726318,0.000024907198,0.00013768744,0.00027084883,0.0066692857,0.0013149107,0.8431689,0.029788807,0.11810517],"study_design_scores_gemma":[0.000019214787,0.000053170075,0.00013142927,0.000048818227,0.000008295644,0.00030780994,0.00002959829,0.021055568,0.0010925691,0.9101949,0.06702948,0.000029211531],"about_ca_topic_score_codex":0.0011561722,"about_ca_topic_score_gemma":0.001190542,"teacher_disagreement_score":0.0143853305,"about_ca_system_score_codex":0.0008709283,"about_ca_system_score_gemma":0.0008872721,"threshold_uncertainty_score":0.048123777},"labels":[],"label_agreement":null},{"id":"W2167500722","doi":"10.1155/2010/159367","title":"Mechanism of Resource Virtualization in RCS for Multitask Stream Applications","year":2010,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Space Agency; CMC Microsystems; UBS","keywords":"Computer science; Embedded system; Virtualization; Field-programmable gate array; Pipeline (software); Overhead (engineering); Reconfigurable computing; Computer architecture; Cloud computing; Operating system","score_opus":0.012650186944680779,"score_gpt":0.27024696374176044,"score_spread":0.25759677679707965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167500722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39940646,0.0008494443,0.581413,0.00038657052,0.0001983375,0.0002625858,0.0001485565,0.004766128,0.012568925],"genre_scores_gemma":[0.94750464,0.00019229417,0.049431957,0.00005564028,0.000032948206,0.00008702919,0.00008662122,0.00008074517,0.0025281357],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996258,0.00009223714,0.000028798606,0.00006518051,0.00009904191,0.00008887734],"domain_scores_gemma":[0.9993407,0.00017181376,0.0000735096,0.0002461283,0.00010982896,0.00005795433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714194,0.0002736533,0.0003718536,0.00046223,0.0004988729,0.0011764123,0.0010742366,0.00031079858,0.0018509491],"category_scores_gemma":[0.0008967368,0.0001990916,0.00033962817,0.0002993759,0.00040620854,0.00096987345,0.0006965094,0.0004241764,0.00036963084],"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.0013306789,0.00037545877,0.0066276044,0.0004149257,0.00022275436,0.0014609396,0.00083136634,0.13167565,0.50630516,0.1581741,0.0063474705,0.18623391],"study_design_scores_gemma":[0.00008599932,0.00050603214,0.003371817,0.000031045707,0.00011141842,0.0007758267,0.00017173174,0.75132674,0.21203236,0.012960397,0.018551176,0.00007542823],"about_ca_topic_score_codex":0.00070605864,"about_ca_topic_score_gemma":0.0008784165,"teacher_disagreement_score":0.0018509491,"about_ca_system_score_codex":0.0005414196,"about_ca_system_score_gemma":0.00076114957,"threshold_uncertainty_score":0.006192088},"labels":[],"label_agreement":null},{"id":"W2167652430","doi":"10.1109/pacrim.1999.799547","title":"Cost and performance optimization in IP switched-routers","year":2003,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Router; One-armed router; Packet forwarding; Computer science; Computer network; Core router; Network packet; Forwarding plane; Packet processing; Virtual routing and forwarding; IP forwarding; Link state packet; Throughput; Distributed computing; Routing table; Processing delay; Routing protocol; Transmission delay; Operating system; Wireless","score_opus":0.02189230567493151,"score_gpt":0.22917942805554603,"score_spread":0.20728712238061453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167652430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41328597,0.0028240886,0.54822,0.0019423824,0.00007268609,0.00006843298,0.00015124757,0.0003308774,0.03310445],"genre_scores_gemma":[0.978272,0.0007337585,0.016938161,0.000039152954,0.00003185724,0.000038578266,0.000038984206,0.00004691213,0.0038605428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993339,0.0002874215,0.000015241223,0.000057532012,0.00020333883,0.000102506456],"domain_scores_gemma":[0.9989317,0.0007275041,0.00009146625,0.000063473904,0.00015086234,0.000034962446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008817628,0.00064669404,0.00039216044,0.0004993277,0.00032528228,0.0012425097,0.00086645316,0.00063104974,0.0014256096],"category_scores_gemma":[0.003164091,0.00032955082,0.00022446067,0.0006140987,0.0007738545,0.0018135002,0.00043300135,0.00040358,0.00015355845],"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.00006191104,0.000023047023,0.00038043116,0.000028678052,0.000008916325,0.00002946413,0.000016222088,0.94051737,0.0010142428,0.046142463,0.0004177679,0.011359365],"study_design_scores_gemma":[0.000007569701,0.000023521503,0.00023761381,0.0000033752638,0.000007981805,0.000012340787,0.00001559526,0.97651106,0.00047676766,0.02222917,0.00047085038,0.0000041710036],"about_ca_topic_score_codex":0.0029421288,"about_ca_topic_score_gemma":0.0023866508,"teacher_disagreement_score":0.0029421288,"about_ca_system_score_codex":0.0023144798,"about_ca_system_score_gemma":0.000780411,"threshold_uncertainty_score":0.016792774},"labels":[],"label_agreement":null},{"id":"W2167843626","doi":"10.1109/ccece.2004.1345297","title":"Design and implementation of enhanced crossbar CIOQ switch architecture","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Crossbar switch; Speedup; Computer science; Very-large-scale integration; Scheduling (production processes); Queueing theory; Throughput; Architecture; Parallel computing; Standard cell; Embedded system; Computer architecture; Integrated circuit; Computer network; Wireless; Engineering; Operating system; Telecommunications","score_opus":0.011635960135749216,"score_gpt":0.2670482401367384,"score_spread":0.2554122800009892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167843626","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51447445,0.0012035068,0.4520552,0.00042472847,0.00029232336,0.00038368328,0.00032325214,0.0050737956,0.025769144],"genre_scores_gemma":[0.8751807,0.0002918117,0.116168596,0.00021350358,0.00004392688,0.00013478569,0.00031079404,0.0000570663,0.007598898],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998055,0.000020961454,0.000012319337,0.000038711998,0.000066902496,0.000055723485],"domain_scores_gemma":[0.99974877,0.00003130716,0.000023340934,0.0000325327,0.00013238315,0.000031675358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024874895,0.00027211205,0.00019631776,0.00039920412,0.00032175818,0.00076507643,0.0011865427,0.00039247875,0.0035088963],"category_scores_gemma":[0.00032601345,0.00017752105,0.00014660998,0.0004518065,0.00019795494,0.00037793035,0.00026784366,0.000373912,0.0005650344],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008704747,0.000355157,0.0057430295,0.00030349306,0.000119228585,0.0007836577,0.00028990817,0.057945743,0.6293461,0.020928128,0.0062723835,0.27704275],"study_design_scores_gemma":[0.00029726536,0.0016427524,0.008253542,0.000054235003,0.0001896333,0.0012671655,0.00015914078,0.4055213,0.5171204,0.0038883577,0.06153232,0.00007388738],"about_ca_topic_score_codex":0.0023248838,"about_ca_topic_score_gemma":0.0025699537,"teacher_disagreement_score":0.0035088963,"about_ca_system_score_codex":0.00067058794,"about_ca_system_score_gemma":0.0007623981,"threshold_uncertainty_score":0.0117384195},"labels":[],"label_agreement":null},{"id":"W2168039139","doi":"10.1109/socc.2009.5335688","title":"Simultaneous PVT-tolerant voltage-island formation and core placement for thousand-core platforms","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of British Columbia","funders":"","keywords":"Core (optical fiber); Fabrication; Voltage; Many core; Computer science; Limit (mathematics); Multi-core processor; Materials science; Optoelectronics; Electrical engineering; Telecommunications; Parallel computing; Engineering","score_opus":0.02416297564353599,"score_gpt":0.2599061388884798,"score_spread":0.23574316324494382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168039139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2823984,0.00018194667,0.71362877,0.00014529271,0.000046105524,0.000049330498,0.000029347651,0.00070321816,0.002817498],"genre_scores_gemma":[0.900283,0.000053774133,0.09793018,0.000037763202,0.000016071599,0.000026189255,0.000051103012,0.000074157295,0.001527691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998573,0.000021850314,0.0000073699216,0.000027608241,0.00006246411,0.000023377957],"domain_scores_gemma":[0.99980134,0.000040012208,0.000041331496,0.000055238066,0.00004618215,0.000015975336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001409742,0.00021458656,0.00024946692,0.00014926444,0.00032906045,0.0002154737,0.0006906455,0.00020084305,0.00064186647],"category_scores_gemma":[0.00043213338,0.00014378183,0.00013758166,0.00021331954,0.00023313765,0.00041835997,0.0005019818,0.00027033867,0.00015342073],"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.0002635996,0.00012503676,0.002679607,0.00012918969,0.000047406633,0.00040309454,0.0001886587,0.42801344,0.33412752,0.0083629675,0.0015508753,0.22410858],"study_design_scores_gemma":[0.000024725072,0.00025763208,0.0013444462,0.0000037919476,0.000012143366,0.00020755187,0.000055704575,0.8794237,0.11226086,0.004191782,0.0022061726,0.000011409388],"about_ca_topic_score_codex":0.0007072941,"about_ca_topic_score_gemma":0.0024093816,"teacher_disagreement_score":0.0007072941,"about_ca_system_score_codex":0.00024353847,"about_ca_system_score_gemma":0.00033137307,"threshold_uncertainty_score":0.0021471977},"labels":[],"label_agreement":null},{"id":"W2168201176","doi":"10.1109/isqed.2004.1283698","title":"A scalable communication-centric SoC interconnect architecture","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer architecture; Interconnection; Scalability; Architecture; Embedded system; System on a chip; Computer network; Operating system","score_opus":0.012363018027236808,"score_gpt":0.22843509960012973,"score_spread":0.21607208157289293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168201176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13824326,0.0010681457,0.82606816,0.001004491,0.00013280078,0.00014563712,0.00024505248,0.0041838307,0.028908743],"genre_scores_gemma":[0.8048015,0.000780875,0.18701302,0.0002647743,0.00010421024,0.00019553624,0.0003602538,0.00012005992,0.006359783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997863,0.000037206388,0.000010915575,0.00004431627,0.000089040936,0.00003222968],"domain_scores_gemma":[0.9997292,0.000045500834,0.00003123045,0.00006573243,0.0001054255,0.000022839993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029613182,0.00034416432,0.00023851762,0.0003033052,0.0004208088,0.0005209109,0.0007621297,0.00037409243,0.0018063209],"category_scores_gemma":[0.0006473739,0.0001705035,0.00020391519,0.0005526443,0.00038709602,0.00093297457,0.000457713,0.0004569723,0.00043474196],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016287694,0.00009147798,0.0008465524,0.00020001446,0.00003887688,0.0004267614,0.00012503665,0.6761646,0.0661036,0.09566984,0.007993178,0.15217713],"study_design_scores_gemma":[0.000040713723,0.0002611969,0.00047244492,0.000019400892,0.000034631543,0.00018361224,0.000036409194,0.9509205,0.009265342,0.026425093,0.012324545,0.000016031392],"about_ca_topic_score_codex":0.0017182637,"about_ca_topic_score_gemma":0.0041434607,"teacher_disagreement_score":0.0018063209,"about_ca_system_score_codex":0.0007836691,"about_ca_system_score_gemma":0.0011555414,"threshold_uncertainty_score":0.006042719},"labels":[],"label_agreement":null},{"id":"W2169007122","doi":"10.1109/dnsr.2004.1344747","title":"The effectiveness of brute force attacks on RC4","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"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 New Brunswick","funders":"","keywords":"Computer science; RC4; Key (lock); Encryption; Field-programmable gate array; Embedded system; Parallel computing; Stream cipher; Computer network; Operating system","score_opus":0.00937881433919061,"score_gpt":0.24068158400380002,"score_spread":0.23130276966460941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169007122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9162685,0.00076580053,0.06779688,0.00037210895,0.00004287989,0.00009589213,0.0001299341,0.0006645705,0.013863274],"genre_scores_gemma":[0.9844521,0.0002194598,0.014023704,0.000043673168,0.000011694921,0.000040168547,0.0000877555,0.00004721137,0.0010741442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627364,0.0011794365,0.00023823806,0.0003482643,0.0013483778,0.0006120809],"domain_scores_gemma":[0.9707441,0.021310767,0.0027972853,0.0036626463,0.0011909017,0.00029429473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030963582,0.0007437567,0.000735069,0.0016198609,0.00079978973,0.0010836291,0.00069322775,0.0010836548,0.0025449707],"category_scores_gemma":[0.018119864,0.0003701178,0.00054142944,0.00089035445,0.0014592521,0.003230001,0.0009997074,0.00070781563,0.0005735445],"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.0040652254,0.0003605145,0.009147203,0.00045260566,0.00028192555,0.00044836063,0.00025314372,0.6521691,0.15111491,0.061944056,0.0017891888,0.117973745],"study_design_scores_gemma":[0.00011286389,0.001274971,0.0016775129,0.000051000567,0.000063442174,0.0004968754,0.00007738623,0.8195698,0.15852468,0.015134869,0.002967092,0.000049467893],"about_ca_topic_score_codex":0.0011835006,"about_ca_topic_score_gemma":0.0011995038,"teacher_disagreement_score":0.0030963582,"about_ca_system_score_codex":0.0013155801,"about_ca_system_score_gemma":0.0011683996,"threshold_uncertainty_score":0.016375303},"labels":[],"label_agreement":null},{"id":"W2169134333","doi":"10.1109/icpads.2010.110","title":"Broadcasting Algorithm Via Shortest Paths","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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; Heuristic; Broadcasting (networking); Null-move heuristic; Node (physics); Algorithm; Tree (set theory); Consistent heuristic; Shortest path problem; Time complexity; Path (computing); Theoretical computer science; Distributed computing; Computer network; Mathematics; Search algorithm; Incremental heuristic search; Artificial intelligence","score_opus":0.008425689884388299,"score_gpt":0.2190567878399945,"score_spread":0.2106310979556062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169134333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013397363,0.0003876073,0.97318596,0.00031010178,0.00010901804,0.00021179681,0.0002498651,0.0015938327,0.0105544515],"genre_scores_gemma":[0.19060054,0.0005681568,0.79994357,0.00014571505,0.00008738231,0.00037375247,0.00085342827,0.0002853898,0.00714218],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928826,0.00022425286,0.000033450702,0.000118985015,0.00023356287,0.00010150333],"domain_scores_gemma":[0.9991955,0.00039730538,0.0000549942,0.00017412537,0.00012628952,0.00005175088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540765,0.0005035731,0.00074548356,0.0011343845,0.0011002383,0.00085421815,0.001382486,0.0008606079,0.00869356],"category_scores_gemma":[0.0026215108,0.00034601422,0.0004275275,0.0014066383,0.00055668206,0.0013107724,0.0010451906,0.000804181,0.0019486165],"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.00036398106,0.00015718599,0.00055397797,0.00038711238,0.00009231768,0.0001557768,0.00042421848,0.26849708,0.011700022,0.17113686,0.0241205,0.5224109],"study_design_scores_gemma":[0.0002738758,0.00015385106,0.0002090689,0.00005902764,0.000059675964,0.00024940007,0.00014376262,0.8169085,0.008669265,0.13282776,0.04040462,0.00004126354],"about_ca_topic_score_codex":0.0025234853,"about_ca_topic_score_gemma":0.0023381184,"teacher_disagreement_score":0.00869356,"about_ca_system_score_codex":0.000955588,"about_ca_system_score_gemma":0.0014063811,"threshold_uncertainty_score":0.029082835},"labels":[],"label_agreement":null},{"id":"W2169258566","doi":"10.1145/775832.776045","title":"Design of a 17-million gate network processor using a design factory","year":2003,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Network processor; Computer science; Throughput; Factory (object-oriented programming); Key (lock); Embedded system; Transistor; State (computer science); Field-programmable gate array; Network packet; Computer architecture; Electrical engineering; Engineering; Operating system; Computer network","score_opus":0.0800609321650074,"score_gpt":0.26011298079180767,"score_spread":0.18005204862680027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169258566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21455516,0.00036857766,0.7512997,0.0004374072,0.00009886114,0.0004019264,0.00022695828,0.0028521144,0.029759351],"genre_scores_gemma":[0.57751065,0.0002050585,0.40719667,0.00018591702,0.000019668152,0.00032109095,0.00030653764,0.00013497338,0.014119372],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998486,0.00002902433,0.000008166733,0.000028931447,0.000053130218,0.00003209078],"domain_scores_gemma":[0.99989796,0.000024857327,0.000012560745,0.000015339632,0.00003618407,0.00001302747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032404388,0.00027243188,0.00019777645,0.00016464888,0.0002869862,0.00066657236,0.00046615567,0.00034076022,0.0029773617],"category_scores_gemma":[0.00032676334,0.00020925207,0.00032825646,0.00016394688,0.00018084333,0.00032685557,0.00019669849,0.00028971912,0.0008078272],"study_design_candidate":"bench_or_experimental","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.0007608482,0.00039296673,0.0066331993,0.00039711196,0.00023780102,0.0012010903,0.0006523131,0.25814357,0.25738493,0.06488878,0.014310756,0.3949967],"study_design_scores_gemma":[0.0006320149,0.002546051,0.005122429,0.00008392314,0.00021644712,0.0012401836,0.00018389139,0.66495645,0.17500924,0.014654796,0.13526584,0.000088623434],"about_ca_topic_score_codex":0.0015162706,"about_ca_topic_score_gemma":0.0015910009,"teacher_disagreement_score":0.0029773617,"about_ca_system_score_codex":0.0005442148,"about_ca_system_score_gemma":0.0012992029,"threshold_uncertainty_score":0.009960294},"labels":[],"label_agreement":null},{"id":"W2169353951","doi":"10.1049/iet-cdt.2013.0017","title":"Unified multi‐objective mapping and architecture customisation of networks‐on‐chip","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":25,"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; Thompson Rivers University","funders":"","keywords":"Benchmark (surveying); Network on a chip; Reliability (semiconductor); Computer science; Network topology; Routing (electronic design automation); Network architecture; Computer architecture; Chip; Embedded system; Power (physics); Reliability engineering; Topology (electrical circuits); Engineering; Computer network","score_opus":0.013069255694701205,"score_gpt":0.21691017945727575,"score_spread":0.20384092376257454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169353951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07582686,0.00034532184,0.918832,0.000108693246,0.000028051716,0.00014917327,0.000038542617,0.00044452382,0.004226894],"genre_scores_gemma":[0.60095096,0.00023858543,0.39606696,0.00007925104,0.000017024893,0.0003255643,0.0001267062,0.00017935329,0.0020155255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993212,0.00029063004,0.000029669916,0.00008667162,0.00020062702,0.00007124479],"domain_scores_gemma":[0.9991721,0.0004091958,0.00013361436,0.00010859363,0.00015266969,0.000023828343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013734631,0.0008687004,0.0005853806,0.0010569834,0.0002974232,0.00064946857,0.0009134162,0.00060966425,0.0011948],"category_scores_gemma":[0.0026654126,0.0003765237,0.000666191,0.0006183502,0.00051432307,0.00061669643,0.000826562,0.00059607025,0.00015482299],"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.00001732272,0.000032447748,0.0003582916,0.00004495469,0.000026075306,0.000035915662,0.00003428489,0.9458477,0.004550769,0.0024462626,0.0002052512,0.04640074],"study_design_scores_gemma":[0.00000648023,0.00004679486,0.00017259063,0.000008013149,0.0000112416865,0.00001980295,0.000014639315,0.99387336,0.0025463372,0.0026910526,0.00060495606,0.0000047818417],"about_ca_topic_score_codex":0.0013726386,"about_ca_topic_score_gemma":0.0017473184,"teacher_disagreement_score":0.0013734631,"about_ca_system_score_codex":0.0007295471,"about_ca_system_score_gemma":0.00086930406,"threshold_uncertainty_score":0.0072636604},"labels":[],"label_agreement":null},{"id":"W2169603675","doi":"10.1016/j.ipl.2004.08.005","title":"Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Control reconfiguration; Redundancy (engineering); Catastrophic failure; Computer science; Very-large-scale integration; Characterization (materials science); Fault (geology); Parallel computing; Algorithm; Embedded system; Geology; Materials science; Seismology; Nanotechnology","score_opus":0.0072592819552914105,"score_gpt":0.20682085188365668,"score_spread":0.19956156992836527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169603675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97605807,0.000115626004,0.022224573,0.000051433653,0.000015331743,0.000011459459,0.00006570809,0.00019323126,0.0012645079],"genre_scores_gemma":[0.9983205,0.000016363476,0.0013625246,0.0000088003835,0.000002959497,0.000006336853,0.000048562924,0.0000053497806,0.00022855333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998647,0.000019630379,0.000010111563,0.00002129269,0.000059263064,0.000024960047],"domain_scores_gemma":[0.9983139,0.0006184207,0.0005131892,0.00018002013,0.00028474428,0.000089728055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014222815,0.00022950934,0.00016047726,0.0006346947,0.00026176596,0.0003351251,0.00039965592,0.000368355,0.0008235592],"category_scores_gemma":[0.0018125215,0.00013761553,0.00009406208,0.000347725,0.0004164165,0.00040952628,0.00021182356,0.00019484675,0.00009028263],"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.0018747876,0.00029169588,0.046215404,0.00033897551,0.00007749106,0.0025083208,0.000397706,0.21073228,0.6702726,0.018442623,0.0011647112,0.04768348],"study_design_scores_gemma":[0.00005854831,0.0012786053,0.024945451,0.000021711563,0.000051371833,0.0020031543,0.00027974168,0.6401676,0.3211859,0.00845971,0.001498538,0.00004967471],"about_ca_topic_score_codex":0.00023907244,"about_ca_topic_score_gemma":0.00044594263,"teacher_disagreement_score":0.0008235592,"about_ca_system_score_codex":0.00026880915,"about_ca_system_score_gemma":0.0002140383,"threshold_uncertainty_score":0.002755046},"labels":[],"label_agreement":null},{"id":"W2170083217","doi":"10.1109/iv.2004.106","title":"Orderly broadcasting in a 2D torus","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Torus; Computer science; Graph; Upper and lower bounds; Computer network; Theoretical computer science; Mathematics","score_opus":0.01412127312319576,"score_gpt":0.2295767955184648,"score_spread":0.21545552239526905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170083217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26059642,0.0019143361,0.664059,0.0011931476,0.0004852031,0.0001244543,0.0007222958,0.0012050313,0.069700174],"genre_scores_gemma":[0.8776682,0.0013661142,0.10335884,0.00020514023,0.00011572122,0.0001772671,0.00043515,0.00014958424,0.016523946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996247,0.000099778634,0.000021142352,0.000054356628,0.000106605105,0.00009332439],"domain_scores_gemma":[0.99950385,0.00019087718,0.00007322741,0.000098535624,0.00007984081,0.000053628202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024369618,0.000317838,0.00044646006,0.00043962413,0.00091152266,0.0010830361,0.0005184829,0.0006735605,0.0029829722],"category_scores_gemma":[0.0011034916,0.0003108902,0.000347522,0.00089373556,0.0008004039,0.0017131135,0.0007533543,0.0005796611,0.0007532057],"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.00035100404,0.000063326916,0.0009806259,0.00024261595,0.00003212256,0.00070284377,0.00046102412,0.52521855,0.027411206,0.40470195,0.010026184,0.029808503],"study_design_scores_gemma":[0.00008735499,0.0001586599,0.00042501962,0.000019712812,0.000019970666,0.00033483075,0.00020762197,0.80193806,0.006210456,0.17295808,0.017598687,0.000041556723],"about_ca_topic_score_codex":0.0027481057,"about_ca_topic_score_gemma":0.003063714,"teacher_disagreement_score":0.0029829722,"about_ca_system_score_codex":0.0010718952,"about_ca_system_score_gemma":0.0006130286,"threshold_uncertainty_score":0.009979069},"labels":[],"label_agreement":null},{"id":"W2170110577","doi":"10.1109/tnet.2008.926501","title":"Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"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 Waterloo","funders":"Hong Kong University of Science and Technology","keywords":"Speedup; Computer science; Control reconfiguration; Scheduling (production processes); Network packet; Packet switching; Algorithm; Parallel computing; Overhead (engineering); Computer network; Mathematical optimization; Embedded system; Mathematics","score_opus":0.04540626732718292,"score_gpt":0.23710428738030484,"score_spread":0.19169802005312192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170110577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883536,0.00032908516,0.40056437,0.00048595437,0.00005571534,0.00006501254,0.00006600158,0.0004999757,0.009580328],"genre_scores_gemma":[0.9481642,0.00020106946,0.050163236,0.000031375857,0.00003396813,0.00004092691,0.000045518405,0.00006160989,0.00125799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960655,0.00008746004,0.000011770711,0.000052280582,0.00010489231,0.00013713191],"domain_scores_gemma":[0.9994861,0.00025688132,0.00007867434,0.00006822444,0.000050049053,0.000060128557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921789,0.0007078025,0.00043789236,0.00034034046,0.0005207448,0.0006899353,0.0005881139,0.00032405718,0.0015308725],"category_scores_gemma":[0.0018158477,0.00021617686,0.00030000965,0.00043969223,0.00065849157,0.0009179915,0.0006797169,0.00047196058,0.000117797594],"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.00034360666,0.00010646225,0.0010151885,0.00008417208,0.000019045643,0.00012651413,0.000065454704,0.8987339,0.023729408,0.047805782,0.0007556861,0.027214723],"study_design_scores_gemma":[0.000017858169,0.00005249864,0.00019330758,0.0000024479425,0.000005111091,0.000011750628,0.000009504348,0.9901079,0.0023042383,0.007036943,0.00025636976,0.0000021723088],"about_ca_topic_score_codex":0.0011907751,"about_ca_topic_score_gemma":0.0017341858,"teacher_disagreement_score":0.0015308725,"about_ca_system_score_codex":0.0012661477,"about_ca_system_score_gemma":0.0008038097,"threshold_uncertainty_score":0.0091866255},"labels":[],"label_agreement":null},{"id":"W2170154411","doi":"10.1109/soac.1991.143848","title":"An efficient simulated annealing algorithm for graph bisectioning","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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","funders":"","keywords":"Simulated annealing; Computer science; Algorithm; Adaptive simulated annealing; Graph; Random graph; Theoretical computer science","score_opus":0.02459489648272742,"score_gpt":0.2534859118683615,"score_spread":0.22889101538563408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170154411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015900477,0.00013846031,0.9961261,0.000045800924,0.000030313673,0.00005023972,0.00002993458,0.00065948785,0.0013297172],"genre_scores_gemma":[0.0504047,0.00025753668,0.94563556,0.000056414254,0.000026538442,0.00031112763,0.00023648134,0.00022426146,0.002847423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.00039248704,0.00007115801,0.00020869036,0.00036675512,0.00007203224],"domain_scores_gemma":[0.9991001,0.00039286257,0.000059330687,0.0001768023,0.00024144542,0.000029593897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076868874,0.0011241131,0.0014727905,0.0010565993,0.00082627573,0.0010379876,0.0015854593,0.0013393736,0.004541576],"category_scores_gemma":[0.0023680404,0.00079578074,0.0012332263,0.0013711492,0.00074499426,0.0014857989,0.0012102933,0.0014839435,0.0014690057],"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.00009687164,0.0000676079,0.00028020368,0.00016851332,0.0001045909,0.00007238715,0.00011512342,0.73914486,0.00902424,0.036604427,0.0046731336,0.20964816],"study_design_scores_gemma":[0.000031850577,0.00003377007,0.00007659714,0.000010489652,0.000017996554,0.00005875551,0.000011588507,0.97566843,0.0032171179,0.0106209805,0.010238508,0.0000138561945],"about_ca_topic_score_codex":0.0038085626,"about_ca_topic_score_gemma":0.0045148367,"teacher_disagreement_score":0.004541576,"about_ca_system_score_codex":0.0010615339,"about_ca_system_score_gemma":0.00145546,"threshold_uncertainty_score":0.015193105},"labels":[],"label_agreement":null},{"id":"W2170821067","doi":"10.1109/infcom.1988.13024","title":"A subset of the ISDN network layer protocol suitable for implementation in hardware","year":2003,"lang":"en","type":"article","venue":"","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 Alberta","funders":"","keywords":"Computer science; Integrated Services Digital Network; Computer network; Protocol (science); Very-large-scale integration; Channel (broadcasting); Layer (electronics); Application layer; Computer hardware; Computer architecture; Embedded system; Operating system","score_opus":0.02772642176905457,"score_gpt":0.31625458441619275,"score_spread":0.2885281626471382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170821067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026417647,0.0013876917,0.85992384,0.0014858921,0.0025763537,0.0015543513,0.00084947125,0.0029528125,0.1266277],"genre_scores_gemma":[0.09201097,0.009037805,0.6191987,0.0038464663,0.0028789956,0.008028021,0.0056642126,0.0020536068,0.25728127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983896,0.00037746222,0.00018914652,0.00017044735,0.0007217867,0.00015153774],"domain_scores_gemma":[0.9989421,0.00016376733,0.000083359555,0.00040311218,0.00035716197,0.000050615607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214907,0.0010714659,0.00049151405,0.00086386385,0.0011901101,0.0025603399,0.0016446069,0.0013487661,0.02321503],"category_scores_gemma":[0.0028389236,0.0005529217,0.0009472223,0.0012505662,0.00083372626,0.0029411719,0.0010655315,0.0021401106,0.016464267],"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.00014699613,0.00018216354,0.0003414832,0.00092993194,0.000034875273,0.0007491292,0.00028258754,0.0099310335,0.022215169,0.61046195,0.11595357,0.23877117],"study_design_scores_gemma":[0.00002716361,0.00018482706,0.00023378574,0.00021262959,0.00002742275,0.0010453471,0.00009063211,0.02317784,0.006960184,0.06821126,0.89979404,0.000034863868],"about_ca_topic_score_codex":0.0016663126,"about_ca_topic_score_gemma":0.002368348,"teacher_disagreement_score":0.02321503,"about_ca_system_score_codex":0.0011855112,"about_ca_system_score_gemma":0.0016868969,"threshold_uncertainty_score":0.07766199},"labels":[],"label_agreement":null},{"id":"W2171315559","doi":"10.1109/mpcs.1994.367032","title":"A fast algorithm for data exchange in reconfigurable tree structures","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Node (physics); Time complexity; Table (database); Data structure; Feature (linguistics); Routing table; Tree structure; Data exchange; Sequence (biology); Routing (electronic design automation); Theoretical computer science; Parallel computing; Binary tree; Mathematics; Data mining; Computer network; Routing protocol","score_opus":0.07497217069477873,"score_gpt":0.2672321350796171,"score_spread":0.19225996438483833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171315559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003370952,0.00014559262,0.99305266,0.00008057691,0.000044783264,0.00008594767,0.00005505437,0.0016375579,0.001526955],"genre_scores_gemma":[0.040282898,0.0001299619,0.95636564,0.00005859736,0.000026872513,0.00022610533,0.00028318018,0.00024914675,0.0023776041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991166,0.00014609048,0.000074996606,0.0001830972,0.00033475002,0.00014436975],"domain_scores_gemma":[0.99919266,0.0003720989,0.0000748926,0.00014838864,0.00017380633,0.000038171776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072299247,0.0009058736,0.00070347585,0.0010798116,0.0011061433,0.0015825537,0.0019475752,0.0011050534,0.0057979897],"category_scores_gemma":[0.0019468728,0.0005860863,0.0007825606,0.0014593758,0.00084064336,0.0024826606,0.0014694716,0.0012129263,0.002072839],"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.00051007123,0.00013970741,0.00060937804,0.0003526009,0.00007631157,0.00026721577,0.00030741317,0.14397733,0.025642969,0.069062494,0.013976619,0.7450779],"study_design_scores_gemma":[0.00038839225,0.00029076508,0.00030215873,0.000092316724,0.00005291237,0.00039604658,0.00010717491,0.85507375,0.024792284,0.06862779,0.049788654,0.00008779109],"about_ca_topic_score_codex":0.0029478793,"about_ca_topic_score_gemma":0.0024979596,"teacher_disagreement_score":0.0057979897,"about_ca_system_score_codex":0.0011094497,"about_ca_system_score_gemma":0.0016258825,"threshold_uncertainty_score":0.019396186},"labels":[],"label_agreement":null},{"id":"W2171369264","doi":"10.5555/1898699.1898784","title":"Broadcasting and routing in faulty mesh networks","year":2006,"lang":"en","type":"article","venue":"International Parallel and Distributed Processing Symposium","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Distributed computing; Polygon mesh; Routing (electronic design automation); Static routing; Node (physics); Mesh networking; Geographic routing; Dynamic Source Routing; Parallel computing; Routing protocol; Telecommunications; Engineering","score_opus":0.008290898641086652,"score_gpt":0.2297571831614316,"score_spread":0.22146628452034495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171369264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051003948,0.0013603246,0.93904674,0.00082262256,0.00015566873,0.000062162915,0.00011710364,0.0007212348,0.0067101577],"genre_scores_gemma":[0.6839707,0.0026377437,0.30609056,0.00026199923,0.00018432665,0.00016643619,0.0003521813,0.00018284879,0.0061531556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.00024742293,0.000067565,0.0001415121,0.0002991169,0.00012382837],"domain_scores_gemma":[0.9976393,0.0011850325,0.0003021811,0.00046405525,0.00034904678,0.0000603393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007484769,0.00032400773,0.0005125331,0.00069945515,0.0009427498,0.0011975425,0.001022603,0.0009765904,0.0011533019],"category_scores_gemma":[0.0056515415,0.0003339021,0.00034830064,0.0011018416,0.0011581783,0.002239748,0.00093881565,0.0006660837,0.00023826642],"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.00027649914,0.00002471057,0.0019700741,0.00044815874,0.000045790963,0.00051469315,0.00054180785,0.5909071,0.014039175,0.25135386,0.005323986,0.13455412],"study_design_scores_gemma":[0.00003237703,0.000068763016,0.00044553698,0.00004280417,0.00003082472,0.00036003345,0.00020508748,0.79003537,0.007931485,0.18631312,0.014510622,0.00002395623],"about_ca_topic_score_codex":0.0030196873,"about_ca_topic_score_gemma":0.0018376863,"teacher_disagreement_score":0.0030196873,"about_ca_system_score_codex":0.0013410271,"about_ca_system_score_gemma":0.00075748604,"threshold_uncertainty_score":0.009729922},"labels":[],"label_agreement":null},{"id":"W2171377449","doi":"10.1109/newcas.2007.4488020","title":"Blocking-aware task assignment for wormhole routed network-on-chip","year":2007,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Blocking (statistics); Computer science; Wormhole; Network packet; Computer network; SystemC; Network on a chip; Simulated annealing; Distributed computing; Task (project management); Mesh networking; Embedded system; Wireless; Algorithm; Engineering; Telecommunications","score_opus":0.019704054463016086,"score_gpt":0.2554975702544512,"score_spread":0.2357935157914351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171377449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17254665,0.0004190101,0.8232581,0.00012194762,0.00006670482,0.00008952758,0.000035719706,0.00087754824,0.002584766],"genre_scores_gemma":[0.79711205,0.00017839114,0.20044364,0.00004459409,0.0000109364455,0.000103578815,0.000051084873,0.000089093,0.0019666033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998248,0.00005960446,0.000009992035,0.000023026401,0.000051755625,0.00003079646],"domain_scores_gemma":[0.9996265,0.00013779038,0.00006457249,0.00007410308,0.00007482922,0.000022151202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004099651,0.00025362748,0.00022418625,0.00030962744,0.00034635994,0.00025352617,0.0006850848,0.00022115897,0.0011885245],"category_scores_gemma":[0.0010752636,0.0001832002,0.0001638514,0.00025988647,0.0002209657,0.0004520546,0.0002807458,0.00029328893,0.00016513644],"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.0004909308,0.000205949,0.0036865405,0.00035364096,0.0000904586,0.000111287416,0.0002543628,0.56099904,0.1491037,0.01596188,0.0029748918,0.2657673],"study_design_scores_gemma":[0.00004768247,0.00018013534,0.00090740755,0.000010465673,0.000040248786,0.00006523292,0.000041820833,0.9392046,0.050202653,0.0046126917,0.0046714772,0.000015641794],"about_ca_topic_score_codex":0.00154373,"about_ca_topic_score_gemma":0.003771296,"teacher_disagreement_score":0.00154373,"about_ca_system_score_codex":0.0004047409,"about_ca_system_score_gemma":0.0006026904,"threshold_uncertainty_score":0.0039759874},"labels":[],"label_agreement":null},{"id":"W2172041114","doi":"10.1109/spdp.1993.395543","title":"Analysis of multithreaded multiprocessors with distributed shared memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Parallel computing; Queueing theory; Shared memory; Distributed memory; Bandwidth (computing); Computer network","score_opus":0.02334358574079363,"score_gpt":0.22024286691734046,"score_spread":0.19689928117654684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172041114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3030159,0.001209873,0.6874329,0.0005795329,0.00008727021,0.00009976394,0.00009542011,0.0004347102,0.0070446674],"genre_scores_gemma":[0.9745355,0.0002638281,0.021803955,0.000060938823,0.00003494726,0.00010748029,0.00005379176,0.000074124386,0.003065301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909925,0.00024456868,0.000028939005,0.00012223054,0.00033556917,0.00016956264],"domain_scores_gemma":[0.9985109,0.00079037563,0.00021072512,0.00011066365,0.00029139395,0.000085992324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011382721,0.00048435066,0.0006847682,0.00066544005,0.0006790439,0.0012667961,0.0011480788,0.0008037768,0.001820656],"category_scores_gemma":[0.004878778,0.0004939851,0.0006553208,0.0004936838,0.0010795919,0.0020216356,0.0009249825,0.00068107696,0.00015654619],"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.00003671303,0.000030203924,0.0009221508,0.000033739703,0.00003098614,0.00007671,0.00004897684,0.96912676,0.0028181442,0.023416862,0.00021218685,0.0032465453],"study_design_scores_gemma":[0.0000036073022,0.000006885159,0.00010091774,0.0000013729066,0.0000025033994,0.0000054712546,0.000005026373,0.995048,0.000219515,0.0044998387,0.000105318424,0.0000016237799],"about_ca_topic_score_codex":0.007061779,"about_ca_topic_score_gemma":0.0024474359,"teacher_disagreement_score":0.007061779,"about_ca_system_score_codex":0.0015385711,"about_ca_system_score_gemma":0.0016562681,"threshold_uncertainty_score":0.014041364},"labels":[],"label_agreement":null},{"id":"W2172079042","doi":"10.1109/ccece.1998.682728","title":"Cell loss analysis of per-VC queueing ATM switches","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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":"Queueing theory; FIFO (computing and electronics); Computer science; Computer network; Asynchronous Transfer Mode; FIFO and LIFO accounting; Weighted fair queueing; Context (archaeology); Layered queueing network; Port (circuit theory); Real-time computing; Operating system; Engineering; Electrical engineering","score_opus":0.018286256968669132,"score_gpt":0.20873922688797056,"score_spread":0.19045296991930144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172079042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8280886,0.0010290956,0.163143,0.0000976516,0.000051219748,0.000049136226,0.00013531065,0.0004817902,0.006924186],"genre_scores_gemma":[0.9971806,0.00012740552,0.002110258,0.000013815956,0.000008858078,0.0000064520086,0.00004479077,0.000013336184,0.000494542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894005,0.00016460202,0.000025956962,0.00008606966,0.00054272014,0.00024060575],"domain_scores_gemma":[0.9982058,0.0007367632,0.00015753388,0.0001583672,0.00065791915,0.000083584506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858678,0.00047368658,0.00034894157,0.0008499719,0.0003186727,0.0008937581,0.0011079953,0.00037346757,0.0010942641],"category_scores_gemma":[0.0024794822,0.000117569456,0.00022826954,0.00057323073,0.0005342359,0.0006995635,0.00035791285,0.0004313771,0.0001900819],"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.00075147103,0.00015588397,0.0049770796,0.00005129308,0.00005603138,0.00021154231,0.00006474715,0.91221464,0.042636786,0.007996443,0.0008699088,0.030014137],"study_design_scores_gemma":[0.000006065572,0.00011627001,0.0009717066,0.0000022710824,0.000010886039,0.000038579936,0.000012940047,0.9906188,0.007505517,0.00057644513,0.00013410753,0.0000063194916],"about_ca_topic_score_codex":0.004807407,"about_ca_topic_score_gemma":0.0016769441,"teacher_disagreement_score":0.004807407,"about_ca_system_score_codex":0.0020758198,"about_ca_system_score_gemma":0.00049414404,"threshold_uncertainty_score":0.0150612},"labels":[],"label_agreement":null},{"id":"W2177504740","doi":"10.1016/j.ins.2015.11.012","title":"Length two path centered surface areas of the (n, k)-star graph","year":2015,"lang":"en","type":"article","venue":"Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Path (computing); Mathematics; Graph; Star (game theory); Distance; Surface (topology); Path length; Factor-critical graph; Path graph; Distance-hereditary graph; Discrete mathematics; Computer science; Graph power; Geometry; Line graph; Shortest path problem; Mathematical analysis","score_opus":0.045721880698627024,"score_gpt":0.2653010909778355,"score_spread":0.21957921027920846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177504740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9030043,0.0002866407,0.065060735,0.0004146617,0.000047916536,0.00003445685,0.00043916938,0.00019274323,0.030519482],"genre_scores_gemma":[0.9791448,0.00016633318,0.0127691515,0.00004483894,0.00003397644,0.00003934152,0.00032273817,0.00004295545,0.0074358727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998597,0.00003914976,0.00000586547,0.000029933231,0.00003939342,0.000025942978],"domain_scores_gemma":[0.9990864,0.00041647334,0.00014389338,0.00004691151,0.0001463538,0.00016001295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013823352,0.00028257963,0.00031536023,0.0008272471,0.00048517084,0.0009774477,0.0005640566,0.00056846347,0.0059667733],"category_scores_gemma":[0.0012514128,0.00019063041,0.00021312192,0.00053659495,0.000617657,0.0008322468,0.00055984245,0.00044782466,0.0006402654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010776949,0.00013547856,0.0068647643,0.0002882054,0.00005850347,0.0006787324,0.0007404519,0.06599503,0.051763877,0.8051866,0.0070724497,0.060138296],"study_design_scores_gemma":[0.00008513205,0.00023137096,0.009984299,0.00004523162,0.00004079199,0.00074922165,0.00055500783,0.28479308,0.010154845,0.6851587,0.008159491,0.000042733536],"about_ca_topic_score_codex":0.0007649241,"about_ca_topic_score_gemma":0.0009784712,"teacher_disagreement_score":0.0059667733,"about_ca_system_score_codex":0.00039910027,"about_ca_system_score_gemma":0.00031326682,"threshold_uncertainty_score":0.01996088},"labels":[],"label_agreement":null},{"id":"W2178552022","doi":"10.1007/978-3-642-24983-9_5","title":"Common Unfoldings of Polyominoes and Polycubes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyomino; Computer science; Mathematics; Geometry","score_opus":0.01768021704871947,"score_gpt":0.22612820055581212,"score_spread":0.20844798350709265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178552022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530493,0.002602401,0.51669955,0.0013302529,0.0012815105,0.00019802392,0.00068252836,0.000685222,0.23121564],"genre_scores_gemma":[0.76906216,0.0021389152,0.1376226,0.000482528,0.00059660047,0.00025802752,0.00094288087,0.0006791639,0.088217154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999348,0.00012489704,0.00003431754,0.00017297805,0.0001864588,0.00013335104],"domain_scores_gemma":[0.99918145,0.0002403256,0.000091555805,0.00017028688,0.00016072913,0.00015569341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004666908,0.00055140356,0.00068193366,0.0010918316,0.0020438014,0.002575221,0.0008623834,0.00066331506,0.011104714],"category_scores_gemma":[0.001992726,0.0005940435,0.00092198513,0.0011859671,0.0025217612,0.0038575726,0.0019464422,0.0023844219,0.0014104089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032370783,0.00001307409,0.00008825579,0.000037252146,0.0000046822324,0.00007576057,0.0002397822,0.0014633192,0.0009851388,0.9867944,0.0016176912,0.008648227],"study_design_scores_gemma":[0.000006920414,0.000011893305,0.00013320067,0.000013153169,0.00000475143,0.00006870113,0.0001184412,0.003493464,0.00051342516,0.9851933,0.01043493,0.000007772747],"about_ca_topic_score_codex":0.0010452071,"about_ca_topic_score_gemma":0.0016938637,"teacher_disagreement_score":0.011104714,"about_ca_system_score_codex":0.0009649566,"about_ca_system_score_gemma":0.0005468451,"threshold_uncertainty_score":0.037148952},"labels":[],"label_agreement":null},{"id":"W2197062872","doi":"10.1145/2700417","title":"Efficient Fault-Tolerant Topology Reconfiguration Using a Maximum Flow Algorithm","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","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 Alberta","funders":"","keywords":"Control reconfiguration; Computer science; Fault tolerance; Network topology; Topology (electrical circuits); Spare part; Latency (audio); Algorithm; Logical topology; Distributed computing; Embedded system; Computer network; Mathematics","score_opus":0.03427739235105732,"score_gpt":0.25626357519553833,"score_spread":0.22198618284448102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197062872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022802735,0.00019986859,0.9744118,0.000105373474,0.000029228919,0.000059996324,0.000030578696,0.00051103055,0.0018494178],"genre_scores_gemma":[0.4302799,0.00018648215,0.5665461,0.000089538786,0.000041010502,0.00023421318,0.0001990958,0.00009281482,0.0023308324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997478,0.000073613075,0.000014784621,0.000058427428,0.000061116545,0.000044172288],"domain_scores_gemma":[0.9996306,0.00020781797,0.000058497237,0.00002998768,0.00005101057,0.000022146518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660055,0.00084594643,0.00080904126,0.0010677741,0.0005717449,0.00061670376,0.0009945532,0.00090079894,0.0020380788],"category_scores_gemma":[0.0012002045,0.00046153148,0.00064713915,0.00075724174,0.00042964585,0.0009746881,0.0005585763,0.00056555483,0.00025330196],"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.00009458297,0.00006582673,0.00024114815,0.000059488037,0.000023471175,0.00007617464,0.00005313376,0.86684793,0.00539297,0.006624123,0.0011167024,0.119404465],"study_design_scores_gemma":[0.0000135147375,0.000022958733,0.000040994033,0.000002930417,0.0000036043575,0.000017483264,0.000004064649,0.99685043,0.0006181016,0.0020847358,0.00033769596,0.0000035233818],"about_ca_topic_score_codex":0.0023187415,"about_ca_topic_score_gemma":0.0021442906,"teacher_disagreement_score":0.0023187415,"about_ca_system_score_codex":0.0008205468,"about_ca_system_score_gemma":0.00081616704,"threshold_uncertainty_score":0.0068181157},"labels":[],"label_agreement":null},{"id":"W2204817054","doi":"10.1142/s0219265915500073","title":"Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults","year":2015,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Connected component; Vertex connectivity; Upper and lower bounds; Mathematics; Graph; Connectivity; Discrete mathematics; Computer science","score_opus":0.030136330993255644,"score_gpt":0.24994725375267726,"score_spread":0.21981092275942163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204817054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55218786,0.0012141401,0.40862778,0.00069207174,0.000052339,0.00012041994,0.0010567965,0.0003834736,0.03566517],"genre_scores_gemma":[0.97909844,0.00042519547,0.017164899,0.00006717484,0.000032515956,0.000057052643,0.00043457415,0.00004231096,0.0026777016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.000054642172,0.000013451822,0.00006995628,0.00012838838,0.00007264805],"domain_scores_gemma":[0.9975605,0.001122387,0.00046647887,0.0002817283,0.00039597249,0.00017284922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038607116,0.00029688884,0.0003084745,0.0010695613,0.0005642911,0.00059265713,0.0008328105,0.00037982425,0.0038122295],"category_scores_gemma":[0.0040098648,0.0001724416,0.00037354376,0.0010281095,0.00087405246,0.0016158228,0.0008528498,0.00073747284,0.00018993008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027146903,0.000049501166,0.0039299917,0.00029882364,0.000037978883,0.0005119632,0.00037828565,0.40897304,0.006940904,0.5322058,0.003508174,0.04289407],"study_design_scores_gemma":[0.000029287896,0.000084008476,0.0024138414,0.000020624148,0.000023690525,0.00033705405,0.00016865823,0.6470041,0.0021968554,0.34311616,0.004584066,0.00002155622],"about_ca_topic_score_codex":0.005498808,"about_ca_topic_score_gemma":0.003949839,"teacher_disagreement_score":0.005498808,"about_ca_system_score_codex":0.0010936366,"about_ca_system_score_gemma":0.0005848051,"threshold_uncertainty_score":0.012753129},"labels":[],"label_agreement":null},{"id":"W2209962516","doi":"10.1016/j.dam.2015.11.014","title":"A strong connectivity property of the generalized exchanged hypercube","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Mathematics; Combinatorics; Connected component; Hypercube graph; Component (thermodynamics); Graph; Property (philosophy); Discrete mathematics; Line graph; Graph power","score_opus":0.05036968775814813,"score_gpt":0.25133788844885824,"score_spread":0.2009682006907101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209962516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5984554,0.0009990963,0.3260276,0.001301444,0.00026885414,0.00009368502,0.00047533415,0.0002833263,0.0720952],"genre_scores_gemma":[0.98302174,0.00037966308,0.009835884,0.0001727914,0.00012242082,0.0000723161,0.00018381872,0.000039681996,0.006171691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975103,0.00006487344,0.000013160384,0.000065730164,0.000064305146,0.000040904477],"domain_scores_gemma":[0.99900097,0.00039238232,0.00016471931,0.00014724958,0.00017119852,0.00012340296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029538825,0.0002832926,0.00031371423,0.00055062,0.00062128174,0.0011008983,0.00052205287,0.0005501988,0.0045389747],"category_scores_gemma":[0.0019430917,0.0002053148,0.0003072605,0.00057956035,0.00092229224,0.0018062898,0.0009561313,0.0009315308,0.00031414223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012618389,0.000017505696,0.00058588164,0.000119330725,0.000021261025,0.0003641402,0.0002112161,0.010227448,0.01361006,0.9631533,0.0018104543,0.009753228],"study_design_scores_gemma":[0.00006868308,0.00015429956,0.0013830215,0.000040231986,0.000036672638,0.0007987238,0.00025437586,0.084031545,0.007450006,0.8965383,0.009213708,0.000030435496],"about_ca_topic_score_codex":0.0003489451,"about_ca_topic_score_gemma":0.00032690697,"teacher_disagreement_score":0.0045389747,"about_ca_system_score_codex":0.00028913192,"about_ca_system_score_gemma":0.00033961135,"threshold_uncertainty_score":0.0151844025},"labels":[],"label_agreement":null},{"id":"W2215508553","doi":"10.1371/journal.pone.0136264","title":"A Simple Algorithm for Finding All k-Edge-Connected Components","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"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 Windsor","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multigraph; Combinatorics; Biconnected graph; Bound graph; Graph power; Vertex (graph theory); Disjoint sets; Complement graph; Mathematics; Graph; Undirected graph; Time complexity; Discrete mathematics; Edge contraction; Directed graph; Computer science; Line graph","score_opus":0.15315155000510772,"score_gpt":0.2747877479918328,"score_spread":0.12163619798672509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215508553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009409992,0.0003331323,0.97662973,0.00029977775,0.000110723515,0.00080729154,0.00094924186,0.0052376715,0.006222354],"genre_scores_gemma":[0.038720354,0.00018036309,0.9531064,0.00009863177,0.00002205609,0.0004784459,0.002130618,0.00046060074,0.0048025963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923134,0.00007217207,0.00007339633,0.0002886415,0.00023057628,0.000103870305],"domain_scores_gemma":[0.9990414,0.00023622521,0.000084575935,0.00025756558,0.0003213913,0.000058846766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901558,0.0022071083,0.001272473,0.0030826088,0.0014887721,0.0016412673,0.0024791956,0.0013430427,0.019616047],"category_scores_gemma":[0.002774317,0.00090153044,0.001203208,0.0035173884,0.00078034477,0.002993186,0.002242472,0.0011670241,0.0074344887],"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.0004624653,0.00028575907,0.0015068193,0.00076335453,0.00013986228,0.00030204072,0.00038486876,0.025826517,0.02116412,0.028918406,0.036483116,0.88376266],"study_design_scores_gemma":[0.0007453396,0.00051422056,0.0033817966,0.0002663276,0.0003406015,0.0021444676,0.00076642213,0.55919147,0.05882659,0.21308771,0.16049331,0.00024172288],"about_ca_topic_score_codex":0.0035909386,"about_ca_topic_score_gemma":0.006470248,"teacher_disagreement_score":0.019616047,"about_ca_system_score_codex":0.0009854382,"about_ca_system_score_gemma":0.0026906496,"threshold_uncertainty_score":0.06562221},"labels":[],"label_agreement":null},{"id":"W2244188037","doi":"10.14778/2824032.2824046","title":"A scalable distributed graph partitioner","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry","keywords":"Graph partition; Scalability; Partition (number theory); Computer science; Bounded function; Graph; Parallel computing; Space partitioning; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Database","score_opus":0.024293433423822605,"score_gpt":0.2216525087113379,"score_spread":0.19735907528751528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244188037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021062061,0.0005443796,0.942062,0.00026957225,0.00011001547,0.00012826454,0.0005144452,0.028438983,0.00687032],"genre_scores_gemma":[0.15373966,0.00034310357,0.83229715,0.00020004228,0.00005629154,0.00024104175,0.0023897626,0.0023728495,0.008360156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.000064492924,0.000024712986,0.0001384984,0.00019110208,0.000050887633],"domain_scores_gemma":[0.99935097,0.00014989819,0.000035989837,0.0002646371,0.00013036079,0.000068176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005216477,0.00074922544,0.0007121341,0.00072664855,0.0006690453,0.000948431,0.0020131078,0.00074136176,0.010054822],"category_scores_gemma":[0.0016442382,0.0004745163,0.00052883587,0.00094250997,0.0005141895,0.0023926562,0.0022916833,0.0010353304,0.0032297538],"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.00080144114,0.00026046715,0.0014373468,0.00049398525,0.00012639625,0.00031297668,0.00042024098,0.15661241,0.07121822,0.035201803,0.078862295,0.65425235],"study_design_scores_gemma":[0.0002543894,0.00015621413,0.0006796675,0.000029152638,0.000034444412,0.00036035816,0.00013315374,0.8902818,0.024454825,0.029762331,0.053814743,0.000038922615],"about_ca_topic_score_codex":0.0019576102,"about_ca_topic_score_gemma":0.0051076533,"teacher_disagreement_score":0.010054822,"about_ca_system_score_codex":0.00067630416,"about_ca_system_score_gemma":0.00096140517,"threshold_uncertainty_score":0.03363675},"labels":[],"label_agreement":null},{"id":"W2249858037","doi":"10.1109/paap.2015.32","title":"Two Modified Multicast Algorithms for Two Dimensional Mesh and Torus Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Algorithm; Bottleneck; Xcast; Protocol Independent Multicast; Torus; Node (physics); Computer network; Grid network; Distributed computing; Mathematics; Grid; Engineering","score_opus":0.05432161071423089,"score_gpt":0.29854871944523065,"score_spread":0.24422710873099976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249858037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021977112,0.00052529335,0.9724201,0.00032457116,0.0001789325,0.00018589258,0.00011717838,0.0006774564,0.003593491],"genre_scores_gemma":[0.21291743,0.00039766307,0.7809548,0.0002592801,0.00012287288,0.00038237995,0.0003751572,0.00013687318,0.004453524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.00018565262,0.000056890563,0.00011215432,0.00020206944,0.00007555394],"domain_scores_gemma":[0.999102,0.0002909129,0.00012071,0.00022320195,0.00021543195,0.000047786343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754726,0.0006477445,0.00066063664,0.00073783245,0.00059532706,0.0006548258,0.0014776011,0.0010907011,0.0022798423],"category_scores_gemma":[0.0031002231,0.00027229582,0.0007668684,0.0007562808,0.00048767508,0.0018365872,0.0012488514,0.000975082,0.00042032675],"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.0008400671,0.00024382093,0.001472478,0.00038283848,0.00014010121,0.0002777093,0.0003150644,0.32898155,0.026875822,0.12411869,0.015958322,0.5003936],"study_design_scores_gemma":[0.00011433814,0.0002433022,0.00042071496,0.00002158709,0.000039185954,0.00031320986,0.00006230671,0.9417083,0.0070132073,0.0381908,0.011838304,0.00003464086],"about_ca_topic_score_codex":0.0010978982,"about_ca_topic_score_gemma":0.0013307736,"teacher_disagreement_score":0.0022798423,"about_ca_system_score_codex":0.0011839833,"about_ca_system_score_gemma":0.00080650277,"threshold_uncertainty_score":0.00859046},"labels":[],"label_agreement":null},{"id":"W2254317906","doi":"10.14288/1.0072253","title":"Towards scalar synchronization in SIMT architectures","year":2011,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"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":"Synchronization (alternating current); Computer science; Mathematics; Artificial intelligence; Topology (electrical circuits); Combinatorics","score_opus":0.010643307042412424,"score_gpt":0.16551934488392475,"score_spread":0.15487603784151233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254317906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103112206,0.0013924848,0.85825706,0.0014435842,0.0004256895,0.00012731066,0.000111067224,0.003814184,0.031316407],"genre_scores_gemma":[0.54843473,0.0012241048,0.43824467,0.0006290152,0.00025045613,0.00023433632,0.00031308865,0.001046154,0.009623392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979303,0.0005598273,0.000102318554,0.00019662116,0.0010349874,0.00017592948],"domain_scores_gemma":[0.99732673,0.0007033057,0.00027801178,0.00086483255,0.0007092431,0.00011779586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018852323,0.00051403954,0.0004923614,0.0006730962,0.000842127,0.0022271718,0.0016396288,0.0005696103,0.0038694865],"category_scores_gemma":[0.0054999655,0.0005388817,0.00056844886,0.0010830386,0.0016929359,0.0034204328,0.0019964513,0.002000618,0.0011173679],"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.0005651625,0.000148042,0.0046131313,0.00048050474,0.00007743849,0.00036486937,0.0009459904,0.12224686,0.034200594,0.6952315,0.013249729,0.12787631],"study_design_scores_gemma":[0.00012388086,0.00029879058,0.00056705414,0.000103714934,0.000053416188,0.00022071162,0.00021993817,0.6983602,0.061362196,0.18074761,0.05789654,0.00004589436],"about_ca_topic_score_codex":0.0016766032,"about_ca_topic_score_gemma":0.0024474312,"teacher_disagreement_score":0.0038694865,"about_ca_system_score_codex":0.0014394891,"about_ca_system_score_gemma":0.0016876712,"threshold_uncertainty_score":0.012944698},"labels":[],"label_agreement":null},{"id":"W2258787727","doi":"","title":"Déploiement à la volée de réseaux d'acteurs dataflow dynamiques sur plateforme multiprocesseurs hétérogène","year":2014,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Physics","score_opus":0.021663209569165304,"score_gpt":0.23954282334812368,"score_spread":0.21787961377895837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258787727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07257092,0.0002695261,0.92026675,0.00013916074,0.00008904299,0.00010993821,0.00010469199,0.0032069834,0.0032430724],"genre_scores_gemma":[0.40220413,0.0003979518,0.57664675,0.00012137053,0.000049898277,0.00024534526,0.00045850844,0.00076960016,0.019106401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948186,0.00004695045,0.000033752087,0.00013921548,0.00022360409,0.0000747031],"domain_scores_gemma":[0.99903166,0.00033243996,0.000097420394,0.00019110585,0.00029722496,0.000050132945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072545774,0.0009920974,0.0005440776,0.00087074906,0.0006873937,0.0014435105,0.0011701136,0.00054635794,0.004935917],"category_scores_gemma":[0.0016210459,0.00042082404,0.00075821613,0.00050829095,0.00065176276,0.0012370086,0.0009908708,0.00077409233,0.0012014844],"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.00073631346,0.00015058782,0.0050384807,0.00029383536,0.00009817044,0.00049912825,0.0007012514,0.33786124,0.17554866,0.018081665,0.003637644,0.45735303],"study_design_scores_gemma":[0.000044399632,0.00017380723,0.0015878747,0.000028920862,0.00003898031,0.00017963737,0.00013702108,0.84451205,0.13434671,0.005269569,0.013641715,0.00003933657],"about_ca_topic_score_codex":0.00613596,"about_ca_topic_score_gemma":0.0057914266,"teacher_disagreement_score":0.00613596,"about_ca_system_score_codex":0.0010463453,"about_ca_system_score_gemma":0.0011181164,"threshold_uncertainty_score":0.016512275},"labels":[],"label_agreement":null},{"id":"W2259449798","doi":"10.1007/s11432-014-5248-8","title":"Reliability-aware mapping for various NoC topologies and routing algorithms under performance constraints","year":2015,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reliability (semiconductor); Network topology; Network on a chip; Routing (electronic design automation); Flexibility (engineering); Latency (audio); Algorithm; Distributed computing; Parallel computing; Embedded system; Computer network; Mathematics","score_opus":0.04909871482446594,"score_gpt":0.2874868113870192,"score_spread":0.23838809656255328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259449798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64501244,0.0017584956,0.3384446,0.00047243736,0.00008668025,0.00010717781,0.0002241717,0.0007002821,0.013193736],"genre_scores_gemma":[0.9537412,0.00022686576,0.044708177,0.000028172775,0.000011250377,0.00003787097,0.0000896008,0.000060554477,0.0010962249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997156,0.00012097169,0.000012761587,0.000035007874,0.000064457716,0.00005112142],"domain_scores_gemma":[0.9983999,0.0009780022,0.00015123829,0.00013760071,0.00029474232,0.000038485352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080408016,0.00048019353,0.00030159208,0.0005639733,0.00043503797,0.00043212678,0.0006612647,0.00033564007,0.0017176274],"category_scores_gemma":[0.0034182388,0.00020419224,0.0002876801,0.00064111175,0.00017611294,0.0008205073,0.00032626343,0.0003534231,0.00009582889],"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.00017712997,0.00006661482,0.00089391397,0.00015165113,0.000026622416,0.000064816886,0.000078300116,0.9222447,0.0082164435,0.005374388,0.0008566512,0.061848722],"study_design_scores_gemma":[0.000008375705,0.00006448243,0.0005112028,0.000008161148,0.000023812903,0.000033307726,0.000043680917,0.99380976,0.002730983,0.0024848925,0.00027657338,0.0000047183175],"about_ca_topic_score_codex":0.0015214614,"about_ca_topic_score_gemma":0.0034469196,"teacher_disagreement_score":0.0017176274,"about_ca_system_score_codex":0.0005737845,"about_ca_system_score_gemma":0.0010041838,"threshold_uncertainty_score":0.005746007},"labels":[],"label_agreement":null},{"id":"W2268976161","doi":"10.5281/zenodo.1097260","title":"Heuristic For Accelerating Run-Time Task Mapping In Noc-Based Heterogeneous Mpsocs","year":2014,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Interconnection Networks and 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":"Emera (Canada)","funders":"","keywords":"Task (project management); Computer science; Heuristic; Parallel computing; Execution time; MPSoC; Embedded system; Computer architecture; Artificial intelligence; Engineering; Multiprocessing","score_opus":0.03592099454626887,"score_gpt":0.22850325025418877,"score_spread":0.1925822557079199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268976161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107613705,0.000802666,0.886602,0.00012138235,0.00008955919,0.000120550816,0.00005157731,0.0009676997,0.0036308784],"genre_scores_gemma":[0.6536558,0.00032248982,0.34305295,0.0000848953,0.00003313735,0.00012544917,0.00016382283,0.00014139997,0.0024200547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975234,0.000058693862,0.0000155102,0.000039408093,0.00007361383,0.000060445305],"domain_scores_gemma":[0.9995633,0.00022719822,0.000055952463,0.00004989993,0.00006395594,0.000039635164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003829523,0.0006591741,0.000533688,0.0007280567,0.0004825879,0.00044534024,0.0008852413,0.00040193443,0.0018156153],"category_scores_gemma":[0.0010304654,0.00034981957,0.00034734877,0.0006024112,0.00032079947,0.0006398958,0.00051925634,0.00033230064,0.00031522108],"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.00042124052,0.0002522218,0.0016175882,0.00027444423,0.00007842757,0.00027574247,0.00018038331,0.73981756,0.029591722,0.0074282777,0.0026807485,0.21738164],"study_design_scores_gemma":[0.000039133756,0.0001716532,0.00041996004,0.000011473396,0.000028419685,0.00009931665,0.00006130297,0.98936355,0.0053224363,0.0028095604,0.0016618219,0.000011385563],"about_ca_topic_score_codex":0.002057864,"about_ca_topic_score_gemma":0.0020949347,"teacher_disagreement_score":0.002057864,"about_ca_system_score_codex":0.00043939243,"about_ca_system_score_gemma":0.00088343426,"threshold_uncertainty_score":0.0060738325},"labels":[],"label_agreement":null},{"id":"W2275935591","doi":"10.1109/fpt.2015.7393132","title":"Automatic FPGA system and interconnect construction with multicast and customizable topology","year":2015,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Computer science; Interconnection; Multicast; Field-programmable gate array; Embedded system; Construct (python library); Network topology; Computer architecture; Abstraction; Distributed computing; Computer network","score_opus":0.014910057669034367,"score_gpt":0.21825603844912864,"score_spread":0.20334598078009428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275935591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07830259,0.00008082272,0.8903381,0.00011776965,0.000036428195,0.00014473624,0.00029460798,0.010223709,0.020461146],"genre_scores_gemma":[0.49528423,0.000120344055,0.4960001,0.000060222235,0.000012449969,0.00020746367,0.00058523484,0.0012543979,0.006475476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970335,0.000083588886,0.000016785736,0.000033083492,0.00012034688,0.00004283748],"domain_scores_gemma":[0.99960107,0.00017923028,0.00004194251,0.00010345686,0.00005970028,0.000014578051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047513025,0.0005325779,0.00030893303,0.0005339992,0.00036293833,0.0006691011,0.0006112028,0.0002612578,0.008527974],"category_scores_gemma":[0.0012036395,0.00036256466,0.00028565325,0.000440755,0.00039541553,0.00074832706,0.0006053344,0.0004936257,0.0009673624],"study_design_candidate":"bench_or_experimental","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.00032320735,0.00012518874,0.005357408,0.00056989485,0.00006677701,0.00066123746,0.00063667045,0.45710623,0.09401984,0.09709503,0.018871255,0.3251673],"study_design_scores_gemma":[0.00012583478,0.00022590051,0.0015256932,0.00006034475,0.00004093966,0.0005176198,0.00018267655,0.8356719,0.082249664,0.022785952,0.056569114,0.00004434961],"about_ca_topic_score_codex":0.00086655753,"about_ca_topic_score_gemma":0.0020453979,"teacher_disagreement_score":0.008527974,"about_ca_system_score_codex":0.0004991969,"about_ca_system_score_gemma":0.0007081112,"threshold_uncertainty_score":0.02852887},"labels":[],"label_agreement":null},{"id":"W2280893263","doi":"10.1007/978-1-4615-0288-3_35","title":"Network Access Capability to Systems as A Factor in Distributed and Cluster Computing","year":2003,"lang":"en","type":"book-chapter","venue":"High Performance Computing Systems and Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Distributed computing; Network packet; Grid computing; Access network; Internetworking; Grid; Operating system; The Internet","score_opus":0.02155697347442029,"score_gpt":0.25560505363327546,"score_spread":0.23404808015885517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280893263","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032223273,0.032713708,0.15551545,0.013471068,0.0039052104,0.00011859464,0.00011438346,0.0007761337,0.7611623],"genre_scores_gemma":[0.52225363,0.03666329,0.05004973,0.0024399154,0.0049699773,0.00025618164,0.00009697879,0.000799988,0.38247034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996269,0.00008474567,0.00001179059,0.00006602197,0.00017150227,0.00003908644],"domain_scores_gemma":[0.9984676,0.0009790289,0.000053491323,0.00019283184,0.000192924,0.000114140836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061187573,0.0005690693,0.00037433626,0.0005556173,0.0007953819,0.0032346577,0.0008640375,0.0009814809,0.010179781],"category_scores_gemma":[0.0046322104,0.00042801644,0.00021554047,0.001469254,0.0032750973,0.008372979,0.0011825293,0.0033248572,0.002182352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023046234,0.000023336872,0.00013642825,0.00010177304,0.000004887566,0.00004936898,0.00032416033,0.0017776671,0.0010871601,0.9425476,0.0142347505,0.03968976],"study_design_scores_gemma":[0.00001718532,0.0000586153,0.00043475215,0.00014056842,0.000022541668,0.00029593002,0.00021149647,0.012258629,0.0015654757,0.65671206,0.32826394,0.000018820727],"about_ca_topic_score_codex":0.0012542737,"about_ca_topic_score_gemma":0.0014887318,"teacher_disagreement_score":0.010179781,"about_ca_system_score_codex":0.0014904353,"about_ca_system_score_gemma":0.0008393587,"threshold_uncertainty_score":0.034054756},"labels":[],"label_agreement":null},{"id":"W2281100802","doi":"10.1109/fpt.2015.7393125","title":"Bringing programmability to the data plane: Packet processing with a NoC-enhanced FPGA","year":2015,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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; Field-programmable gate array; Computer architecture; Application-specific integrated circuit; Latency (audio); Network packet; Embedded system; Architecture; Forwarding plane; Flexibility (engineering); Packet processing; Network on a chip; Bandwidth (computing); Network processor; Computer network; Telecommunications","score_opus":0.07163443242787843,"score_gpt":0.28583172662824713,"score_spread":0.2141972942003687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281100802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4812279,0.0014653704,0.4632192,0.00094426004,0.00036174184,0.00011055417,0.00013227222,0.002291886,0.050246794],"genre_scores_gemma":[0.8454314,0.00053775404,0.14733408,0.00016870315,0.000043413074,0.00002646456,0.00008536041,0.00004131832,0.0063315285],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999261,0.0000115187995,0.00000532455,0.000011489768,0.000024307608,0.000021185668],"domain_scores_gemma":[0.99991906,0.000015905778,0.000010325135,0.000018745215,0.000025556856,0.000010406255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013670367,0.00020182651,0.00009744993,0.00019471973,0.00014724997,0.00040455032,0.00045501284,0.00018839967,0.0013270178],"category_scores_gemma":[0.00027095978,0.000102885766,0.00010219806,0.00017792334,0.0001886312,0.0004949456,0.0002009942,0.00026059532,0.00025273868],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00064746366,0.00020987989,0.0047170515,0.0004355665,0.000083463754,0.0011859504,0.00019192515,0.10477765,0.47812247,0.05201989,0.0070349313,0.3505738],"study_design_scores_gemma":[0.00022621572,0.0013541242,0.0047727833,0.00013674879,0.00015862289,0.002023418,0.00013159521,0.5325159,0.3582576,0.0094260285,0.09092262,0.00007439512],"about_ca_topic_score_codex":0.00086227787,"about_ca_topic_score_gemma":0.0014564167,"teacher_disagreement_score":0.0013270178,"about_ca_system_score_codex":0.00028060423,"about_ca_system_score_gemma":0.00022160943,"threshold_uncertainty_score":0.0044392943},"labels":[],"label_agreement":null},{"id":"W2283418401","doi":"","title":"Méthode de reconfiguration dynamique pour un réseau-sur-puce tolérant aux fautes","year":2011,"lang":"fr","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Computer science; Art","score_opus":0.11855999751594233,"score_gpt":0.2660667773239659,"score_spread":0.14750677980802357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283418401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021896128,0.00055802736,0.96237564,0.00027272908,0.00018464775,0.00017524512,0.000067288056,0.002842531,0.011627671],"genre_scores_gemma":[0.4718715,0.0005312075,0.49852982,0.00025207785,0.00006778956,0.00044208733,0.00021653275,0.00065016845,0.027438784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950886,0.00008672693,0.00003531325,0.0001122607,0.00019572378,0.00006111127],"domain_scores_gemma":[0.9995771,0.00013379658,0.00003824944,0.00008850762,0.0001418454,0.000020575488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047539908,0.00065973407,0.00045579314,0.000916897,0.00069750677,0.0011309799,0.00082335674,0.00085040525,0.010536649],"category_scores_gemma":[0.0011477104,0.0003401969,0.0006255786,0.000373359,0.00055322534,0.00074279064,0.0006452995,0.00085567473,0.0015081752],"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.000696469,0.00012231429,0.0017405758,0.00075965177,0.00011424826,0.0010317537,0.0007797644,0.2965806,0.2210744,0.058161676,0.0067259585,0.41221264],"study_design_scores_gemma":[0.00014128062,0.00027261314,0.001065919,0.00013395213,0.000074789445,0.000947006,0.00026703533,0.81174296,0.101878524,0.015227332,0.06816036,0.000088181776],"about_ca_topic_score_codex":0.0026010864,"about_ca_topic_score_gemma":0.0029747372,"teacher_disagreement_score":0.010536649,"about_ca_system_score_codex":0.0007958801,"about_ca_system_score_gemma":0.0009914614,"threshold_uncertainty_score":0.035248578},"labels":[],"label_agreement":null},{"id":"W2288090762","doi":"10.1016/j.compeleceng.2015.12.018","title":"Characterization and modeling of multicast communication in cache-coherent manycore processors","year":2016,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Oracle (Canada)","funders":"","keywords":"Multicast; Computer science; Xcast; Pragmatic General Multicast; Distributed computing; Source-specific multicast; Computer network; Protocol Independent Multicast; Cache coherence; Unicast; Context (archaeology); IP multicast; Scalability; Computer architecture; Cache; CPU cache; Cache algorithms","score_opus":0.013388257107128302,"score_gpt":0.20791919700754283,"score_spread":0.19453093990041453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288090762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76146126,0.00068919046,0.22632167,0.00064670516,0.000052812673,0.000078524,0.00012495709,0.00032724979,0.010297647],"genre_scores_gemma":[0.9946404,0.00009609266,0.0040975204,0.000024655184,0.000016840817,0.000025648878,0.000045159188,0.00002968715,0.00102394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.00008325355,0.000008848702,0.000028931934,0.00009287029,0.000056143977],"domain_scores_gemma":[0.9991928,0.00038057246,0.00013327491,0.00006669942,0.00018881801,0.00003791274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040295356,0.00042029427,0.0004958752,0.00046943876,0.00055087934,0.0006867746,0.0010970043,0.0010354335,0.0007237659],"category_scores_gemma":[0.0026255257,0.00027444446,0.00027238255,0.00047006653,0.00050662895,0.00090269954,0.00035545827,0.00045270968,0.00011914372],"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.00007431971,0.00008285247,0.002003822,0.00004522819,0.000018461884,0.00011928536,0.000091524715,0.96327037,0.011064636,0.01907506,0.00043774504,0.003716735],"study_design_scores_gemma":[0.0000014107193,0.000005130823,0.00009111564,8.03983e-7,0.0000014774457,0.0000067882374,0.0000049190035,0.9986981,0.0003311508,0.00082089053,0.0000370348,0.0000011830053],"about_ca_topic_score_codex":0.0056933737,"about_ca_topic_score_gemma":0.0038182866,"teacher_disagreement_score":0.0056933737,"about_ca_system_score_codex":0.0010795466,"about_ca_system_score_gemma":0.00090725266,"threshold_uncertainty_score":0.011320472},"labels":[],"label_agreement":null},{"id":"W2293074099","doi":"","title":"What a Sunflower Can Teach a Robot? - Efficient Robot Queuing by Reverse Phyllotaxis.","year":2010,"lang":"en","type":"article","venue":"Artificial Life","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":"Simon Fraser University","funders":"","keywords":"Robot; Computer science; Controller (irrigation); Queue; Queueing theory; Phyllotaxis; Simple (philosophy); Control theory (sociology); Interference (communication); Mathematical optimization; Distributed computing; Artificial intelligence; Mathematics; Control (management); Computer network","score_opus":0.01271517958026363,"score_gpt":0.2342933924876934,"score_spread":0.22157821290742977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293074099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1974033,0.000454026,0.79048836,0.00084960606,0.00009739319,0.000045329376,0.000054337903,0.0014104594,0.0091971755],"genre_scores_gemma":[0.81774586,0.00022587512,0.17777406,0.0002018408,0.000023680666,0.00004877751,0.000034780154,0.000057326208,0.0038877644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998989,0.000026233147,0.000004012791,0.000028116212,0.000026456451,0.000016173337],"domain_scores_gemma":[0.99959296,0.00019001872,0.000078500176,0.000047176818,0.00004578752,0.000045547946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003435293,0.00018601547,0.00014754132,0.00013745396,0.00029505472,0.00038085342,0.0004658199,0.00033315294,0.0017770892],"category_scores_gemma":[0.0012334372,0.000095584204,0.00016881106,0.000096882686,0.0004884248,0.00087145413,0.00031259374,0.00033658277,0.00021925822],"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.00085087103,0.0002678945,0.005991159,0.00038193975,0.00009620066,0.00044415845,0.0007297823,0.21198711,0.22476193,0.25395453,0.006434701,0.29409978],"study_design_scores_gemma":[0.000098817225,0.00058365054,0.0029484355,0.000050446164,0.00005335921,0.0003443722,0.00013680125,0.7657663,0.11667555,0.082956836,0.03032775,0.00005763347],"about_ca_topic_score_codex":0.0006270198,"about_ca_topic_score_gemma":0.00080633716,"teacher_disagreement_score":0.0017770892,"about_ca_system_score_codex":0.00034412084,"about_ca_system_score_gemma":0.0003044205,"threshold_uncertainty_score":0.0059449077},"labels":[],"label_agreement":null},{"id":"W2293345881","doi":"10.1109/candar.2015.15","title":"On the Hamiltonicity, Connectivity, and Broadcasting Algorithm of the KCube","year":2015,"lang":"en","type":"article","venue":"","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":"Hypercube; Computer science; Broadcasting (networking); Graph; Interconnection; Algorithm; Theoretical computer science; Topology (electrical circuits); Class (philosophy); Discrete mathematics; Mathematics; Computer network; Combinatorics; Parallel computing","score_opus":0.036225413692263404,"score_gpt":0.23205770319185404,"score_spread":0.19583228949959064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293345881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29963893,0.00045223936,0.67648727,0.00072517013,0.000041291474,0.00021429264,0.000192956,0.0003244535,0.021923337],"genre_scores_gemma":[0.76374924,0.0007039027,0.2278302,0.000206372,0.000052018928,0.00028039515,0.00036260957,0.000118771626,0.006696526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997427,0.000086280386,0.000012400589,0.000048437054,0.00006410328,0.000046062658],"domain_scores_gemma":[0.9984073,0.0010500483,0.00012857266,0.00011883478,0.00021553565,0.00007970858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035544336,0.00021784249,0.00031567155,0.0005244671,0.000735158,0.00051328505,0.000749485,0.0004900715,0.0024559689],"category_scores_gemma":[0.0035480724,0.00021325934,0.00023506902,0.00085595244,0.00084757747,0.0010598737,0.000844366,0.0005819957,0.00025594956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033168265,0.00012311975,0.003579246,0.00028677267,0.000056188317,0.0003584744,0.0010184549,0.2925762,0.030035993,0.51626503,0.00786114,0.14750771],"study_design_scores_gemma":[0.00008584608,0.00019886014,0.0009955884,0.000034348664,0.00003200185,0.00033118506,0.0003020998,0.802255,0.0067924964,0.18408285,0.0048557743,0.00003403738],"about_ca_topic_score_codex":0.0059692063,"about_ca_topic_score_gemma":0.007042483,"teacher_disagreement_score":0.0059692063,"about_ca_system_score_codex":0.00084243476,"about_ca_system_score_gemma":0.0011521418,"threshold_uncertainty_score":0.011868894},"labels":[],"label_agreement":null},{"id":"W2293611664","doi":"10.1049/el.2015.1024","title":"Improved adaptive routing for networks‐on‐chip","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Interconnection Networks and 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":"University of Saskatchewan","funders":"","keywords":"Routing (electronic design automation); Chip; Computer science; Adaptive routing; Computer network; Multipath routing; Electronic engineering; Computer architecture; Static routing; Routing protocol; Engineering; Telecommunications","score_opus":0.02356071444585793,"score_gpt":0.23386088326343255,"score_spread":0.21030016881757463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293611664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03762554,0.0009178228,0.95438945,0.00014622005,0.000121111596,0.000025804648,0.00004292643,0.0010635381,0.0056676506],"genre_scores_gemma":[0.6065214,0.0008275021,0.38584378,0.0001408899,0.00007307502,0.00007681345,0.00018569661,0.00013541202,0.00619535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988186,0.000027432967,0.000005436353,0.000020175014,0.000053364005,0.000011676179],"domain_scores_gemma":[0.99987686,0.000034833403,0.000014063167,0.000035596324,0.000033138123,0.0000055491437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013813957,0.00027950763,0.00015121876,0.00032991517,0.00016711869,0.00029284944,0.0004180201,0.00025728863,0.001375627],"category_scores_gemma":[0.0003928411,0.0001345049,0.00018405955,0.00031729575,0.0001662254,0.0004735143,0.00033797798,0.00040198865,0.00022596399],"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.00010252434,0.000038300357,0.0005034233,0.00012521858,0.00004993598,0.000112197915,0.000067708126,0.4413018,0.20441711,0.03593161,0.0053712255,0.31197888],"study_design_scores_gemma":[0.000010759345,0.00007605817,0.00034702127,0.000006883243,0.000014791237,0.000119511016,0.000007897467,0.96136385,0.019329706,0.007122703,0.011584112,0.000016693157],"about_ca_topic_score_codex":0.00078510353,"about_ca_topic_score_gemma":0.001788243,"teacher_disagreement_score":0.001375627,"about_ca_system_score_codex":0.0003450921,"about_ca_system_score_gemma":0.00022302815,"threshold_uncertainty_score":0.004601896},"labels":[],"label_agreement":null},{"id":"W2293773081","doi":"10.1007/978-3-319-29221-2_17","title":"A New Construction of Broadcast Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Computer science; Graph; Broadcasting (networking); Wheel graph; Dissemination; Upper and lower bounds; Discrete mathematics; Mathematics; Graph power; Line graph; Computer network; Telecommunications","score_opus":0.01244924480286898,"score_gpt":0.22259271533092423,"score_spread":0.21014347052805524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293773081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019901933,0.00087616604,0.8687283,0.000997233,0.000613505,0.00012159669,0.0004257296,0.001140975,0.107194506],"genre_scores_gemma":[0.26175886,0.0030285276,0.6057966,0.0008525328,0.0008166624,0.00061124313,0.0015805045,0.0017656983,0.123789355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948704,0.00013692839,0.000022509728,0.00012100771,0.00016483011,0.00006765033],"domain_scores_gemma":[0.99902165,0.00037698794,0.000049435905,0.00026745044,0.00017707142,0.0001073465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051169324,0.0006995941,0.0006222154,0.0012844403,0.001519852,0.0017153689,0.0013353691,0.0007771264,0.010997114],"category_scores_gemma":[0.0017467744,0.0007900993,0.00089737657,0.0014173203,0.001488298,0.0027314278,0.0023521371,0.0027112928,0.0027745517],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004436507,0.000025785881,0.000075650845,0.00013481283,0.000011889687,0.00005270312,0.00023559856,0.0023615363,0.0040223673,0.934306,0.010045596,0.04868363],"study_design_scores_gemma":[0.0000416681,0.00003959077,0.00013850702,0.000064605665,0.000046124445,0.00018839433,0.00009377532,0.016631426,0.0040468117,0.8991638,0.07952201,0.000023356239],"about_ca_topic_score_codex":0.00097459427,"about_ca_topic_score_gemma":0.0012517959,"teacher_disagreement_score":0.010997114,"about_ca_system_score_codex":0.0011672465,"about_ca_system_score_gemma":0.0006687906,"threshold_uncertainty_score":0.036789},"labels":[],"label_agreement":null},{"id":"W2294903082","doi":"10.1109/async.2006.28","title":"Surfing Interconnect","year":2006,"lang":"en","type":"article","venue":"","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":"University of British Columbia","funders":"","keywords":"Asynchronous communication; Interconnection; Computer science; Robustness (evolution); Inverter; Electronic engineering; Electronic circuit; Spice; Asynchronous circuit; Electrical engineering; Synchronous circuit; Engineering; Computer network; Voltage; Clock signal","score_opus":0.005482720949376738,"score_gpt":0.1862076647039569,"score_spread":0.18072494375458015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294903082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034588177,0.002888861,0.7105162,0.0011408898,0.0012440291,0.0001779151,0.00054065895,0.0069135544,0.24198972],"genre_scores_gemma":[0.44755828,0.004152583,0.3272698,0.0010338489,0.000531048,0.000396311,0.0011312321,0.0011192476,0.21680772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997193,0.000032358097,0.000014997367,0.00007689398,0.00012040206,0.000036018762],"domain_scores_gemma":[0.9997094,0.00003801796,0.000031307547,0.00011913726,0.000075476404,0.000026614976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019661617,0.0006867478,0.00026972257,0.0009537026,0.0006716986,0.0012515563,0.0010107139,0.00082605134,0.025668144],"category_scores_gemma":[0.00066309737,0.00022363079,0.00025946804,0.0008755412,0.00042732462,0.0017238279,0.0013248275,0.00063232455,0.0060628643],"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.0001239234,0.000052484374,0.00090746774,0.00048332528,0.000045948094,0.00045174538,0.00035163315,0.020949576,0.11489324,0.30855706,0.028358769,0.52482486],"study_design_scores_gemma":[0.0000477632,0.0004194958,0.0007148107,0.00013185779,0.0000705399,0.0009730399,0.00019678724,0.09129586,0.06947526,0.13778992,0.6988265,0.00005823553],"about_ca_topic_score_codex":0.00038461038,"about_ca_topic_score_gemma":0.0007719712,"teacher_disagreement_score":0.025668144,"about_ca_system_score_codex":0.00042787875,"about_ca_system_score_gemma":0.00039169792,"threshold_uncertainty_score":0.08586848},"labels":[],"label_agreement":null},{"id":"W230790256","doi":"10.1504/ijhpcn.2006.013476","title":"Performance evaluation of the Sun Fire Link SMP clusters","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"","keywords":"Computer science; Interconnection; Latency (audio); Link (geometry); Node (physics); Bandwidth (computing); Software; Remote direct memory access; Cluster (spacecraft); Computer network; Computer architecture; Operating system; Engineering; Telecommunications","score_opus":0.017392002779588564,"score_gpt":0.25291831189435254,"score_spread":0.23552630911476397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W230790256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966289,0.00035175087,0.007428639,0.00027624966,0.00009118675,0.00006023777,0.00071991154,0.003314778,0.021468187],"genre_scores_gemma":[0.9872012,0.00018080338,0.007976165,0.000039663522,0.00002756022,0.000036926107,0.0015233698,0.00020446329,0.002809848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895644,0.00018588763,0.00003014506,0.00017337542,0.00049940764,0.00015476225],"domain_scores_gemma":[0.99861145,0.0003125755,0.00010571868,0.00018564436,0.0005658036,0.00021878257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927769,0.00048514866,0.0005964496,0.0006775974,0.0010299064,0.0007840758,0.0012255914,0.0004472528,0.0038975652],"category_scores_gemma":[0.0024644178,0.00024385168,0.00024493193,0.0015299399,0.00034324845,0.00088198384,0.00076499843,0.0004490448,0.00069883553],"study_design_candidate":"bench_or_experimental","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.0066733095,0.0011915398,0.042572454,0.0007490492,0.00038448177,0.00119289,0.0009230955,0.546233,0.07631073,0.00861614,0.07324036,0.24191293],"study_design_scores_gemma":[0.00033729337,0.0026466094,0.034676146,0.000031232983,0.00009282576,0.00040702577,0.0005007457,0.86851764,0.074720494,0.0014297327,0.016556222,0.00008399251],"about_ca_topic_score_codex":0.0062973215,"about_ca_topic_score_gemma":0.0047803214,"teacher_disagreement_score":0.0062973215,"about_ca_system_score_codex":0.0015286738,"about_ca_system_score_gemma":0.00069930154,"threshold_uncertainty_score":0.013038695},"labels":[],"label_agreement":null},{"id":"W2313808707","doi":"10.2316/journal.203.2010.3.203-4426","title":"CONGESTION MANAGEMENT AND LOOP FLOW CONTROL BY TRANSMISSION NETWORK RECONFIGURATION","year":2010,"lang":"en","type":"article","venue":"International Journal of Power and Energy Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Control reconfiguration; Computer science; Transmission network; Mathematical optimization; Integer programming; Flow network; Transmission (telecommunications); Electrical network; Congestion management; Power flow; Network congestion; Electric power system; Distributed computing; Power (physics); Engineering; Computer network; Mathematics; Telecommunications; Electrical engineering","score_opus":0.003498132038495116,"score_gpt":0.19776772105831297,"score_spread":0.19426958901981786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313808707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06725913,0.00062905095,0.9235352,0.00029265697,0.00009334719,0.00007524077,0.000044349068,0.00082000694,0.0072509046],"genre_scores_gemma":[0.9641841,0.0002535332,0.03353637,0.000049387352,0.00007431958,0.000058076545,0.000040102612,0.000065846005,0.00173812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00014819247,0.000013547458,0.00006980264,0.00007594484,0.00005582347],"domain_scores_gemma":[0.9992648,0.0004134526,0.00015190348,0.00006307393,0.000068576155,0.000038249633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064778276,0.0005272718,0.00041564435,0.00039858982,0.00031954492,0.0007471823,0.00067635573,0.00036409876,0.0020953305],"category_scores_gemma":[0.0022378413,0.00017254129,0.00027825532,0.00046397615,0.0006473637,0.0010371355,0.00047686917,0.00050431985,0.0001449526],"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.00013410098,0.00005822479,0.00038796116,0.000078745994,0.000027083472,0.00008478753,0.000070265196,0.88142574,0.008021986,0.026979206,0.0011916251,0.08154026],"study_design_scores_gemma":[0.000028750597,0.00008585276,0.00022355923,0.000005142261,0.000014665979,0.000040944837,0.000011897799,0.9822289,0.0020399468,0.013765416,0.0015449995,0.000009985337],"about_ca_topic_score_codex":0.0013712961,"about_ca_topic_score_gemma":0.0010214024,"teacher_disagreement_score":0.0020953305,"about_ca_system_score_codex":0.0004155752,"about_ca_system_score_gemma":0.00045525862,"threshold_uncertainty_score":0.0070096254},"labels":[],"label_agreement":null},{"id":"W2318422608","doi":"10.1109/hpca.2016.7446076","title":"The runahead network-on-chip","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Microarchitecture; Latency (audio); Network on a chip; Network packet; Router; Embedded system; Source routing; Routing protocol; Routing table; Telecommunications","score_opus":0.01497919436489814,"score_gpt":0.22295408485616655,"score_spread":0.2079748904912684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318422608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43836,0.009698245,0.44412923,0.0016990767,0.0010007416,0.00017041316,0.0011027923,0.019357868,0.08448159],"genre_scores_gemma":[0.8400774,0.0013854654,0.12868583,0.0007583562,0.00006923057,0.00007780218,0.00097681,0.00025271042,0.027716374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998248,0.000022992434,0.0000064528203,0.000048177415,0.00006613688,0.00003148132],"domain_scores_gemma":[0.9997625,0.00003587876,0.000024797304,0.00006702109,0.00007834752,0.000031567524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018076695,0.00027964197,0.00020807683,0.00017162292,0.00022785726,0.0006279327,0.0009088083,0.000300496,0.0045655635],"category_scores_gemma":[0.00037832564,0.00017890152,0.0001448012,0.00019671948,0.00019038809,0.00087850227,0.0003451454,0.00045104846,0.00093249965],"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.0009444096,0.00025556306,0.004723163,0.0005472479,0.00012697947,0.00050109834,0.00012969437,0.11274058,0.26930156,0.03689345,0.05886624,0.51497],"study_design_scores_gemma":[0.00012112585,0.0009447322,0.003546522,0.000106879226,0.00015282593,0.0009889997,0.00008565992,0.6523566,0.14745514,0.014732042,0.17937467,0.00013478022],"about_ca_topic_score_codex":0.0015659172,"about_ca_topic_score_gemma":0.004847836,"teacher_disagreement_score":0.0045655635,"about_ca_system_score_codex":0.00038267567,"about_ca_system_score_gemma":0.000750172,"threshold_uncertainty_score":0.015273333},"labels":[],"label_agreement":null},{"id":"W2318920610","doi":"10.2316/p.2010.676-028","title":"Development of a Network on Chip for Parallel Processing Systems","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; System on a chip; Computer architecture; Parallel computing; Parallel processing; Chip; Embedded system; Telecommunications","score_opus":0.01733670780103963,"score_gpt":0.2481187648224218,"score_spread":0.23078205702138216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318920610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044894613,0.004388325,0.89074016,0.002154296,0.0014402464,0.00075529644,0.00023813717,0.0027251327,0.052663714],"genre_scores_gemma":[0.13676527,0.004084809,0.83535796,0.0005660257,0.0002041947,0.00055473216,0.0006165011,0.00032105175,0.021529434],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992611,0.00012234761,0.00003681938,0.00009418671,0.00039413566,0.00009141208],"domain_scores_gemma":[0.9987974,0.000105138264,0.000034270455,0.00013405147,0.0007918928,0.00013716094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220527,0.0005128024,0.00037164325,0.0006938213,0.0005642333,0.0009639574,0.0014503443,0.0008229234,0.003578826],"category_scores_gemma":[0.0017261617,0.00033818136,0.0004020291,0.00051129516,0.0004401015,0.0015229586,0.0011195175,0.0011326375,0.0016721579],"study_design_candidate":"bench_or_experimental","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.00026432224,0.00041237343,0.0027969293,0.0010280171,0.00012746913,0.0003811651,0.00039259865,0.0696338,0.108544,0.2078111,0.032802474,0.5758057],"study_design_scores_gemma":[0.00010462339,0.0012884684,0.0020572355,0.0003433221,0.00015800491,0.0006135515,0.00017074992,0.22476745,0.11056758,0.025352692,0.63447505,0.000101280275],"about_ca_topic_score_codex":0.0024945128,"about_ca_topic_score_gemma":0.003299156,"teacher_disagreement_score":0.003578826,"about_ca_system_score_codex":0.0010541982,"about_ca_system_score_gemma":0.003128765,"threshold_uncertainty_score":0.011972308},"labels":[],"label_agreement":null},{"id":"W2324329365","doi":"10.1145/2857058.2857064","title":"Hierarchical Clustering for On-Chip Networks","year":2016,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer science; Locality; Hierarchy; Distributed computing; Hierarchical clustering; Interconnection; Latency (audio); Power consumption; Cluster analysis; Hierarchical control system; Parallel computing; Multi-core processor; Computer network; Power (physics); Telecommunications","score_opus":0.024346462516431883,"score_gpt":0.2501622854786731,"score_spread":0.2258158229622412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324329365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004715369,0.0049189474,0.9695701,0.0009857005,0.00042141185,0.0001366614,0.00022818502,0.0016234043,0.0174003],"genre_scores_gemma":[0.29499874,0.008859379,0.66010064,0.0007098042,0.0005742241,0.00065507134,0.0010070165,0.0005517095,0.032543376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943775,0.00013121644,0.000026786143,0.000099643585,0.00025644375,0.000048229496],"domain_scores_gemma":[0.9995974,0.00012741346,0.00003620239,0.00012025817,0.00009860915,0.000020035612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040220426,0.0006301521,0.0004710767,0.0008613003,0.0006702276,0.0010738447,0.0011991777,0.0009957218,0.005523363],"category_scores_gemma":[0.0018562133,0.00029445306,0.00045190685,0.0013889868,0.00061697216,0.0011523289,0.0008192971,0.0010542666,0.0019933803],"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.000055583703,0.000034037148,0.00039950406,0.0004881028,0.00006353187,0.0001539337,0.00012835604,0.26511353,0.005752607,0.43506503,0.03151812,0.26122764],"study_design_scores_gemma":[0.000021101669,0.000042281026,0.00040672653,0.000074640026,0.00002416542,0.00017526285,0.00003728911,0.6624709,0.0026124641,0.24288084,0.09122707,0.000027208858],"about_ca_topic_score_codex":0.0040046596,"about_ca_topic_score_gemma":0.006537921,"teacher_disagreement_score":0.005523363,"about_ca_system_score_codex":0.001713063,"about_ca_system_score_gemma":0.0008932341,"threshold_uncertainty_score":0.01847744},"labels":[],"label_agreement":null},{"id":"W2325643405","doi":"10.1142/s0129626416500055","title":"On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Hypercube; Interconnection; Scheme (mathematics); Reliability (semiconductor); Measure (data warehouse); Graph; Computer science; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Data mining","score_opus":0.011522049754263972,"score_gpt":0.2096169302629729,"score_spread":0.19809488050870894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325643405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1708242,0.0014239824,0.81074363,0.0017007387,0.00012040535,0.000057352154,0.0002901369,0.0002827604,0.014556799],"genre_scores_gemma":[0.95149225,0.001531636,0.041926716,0.0002629229,0.00025524126,0.00014085119,0.0003905355,0.00008545321,0.003914513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992673,0.00025056227,0.00003414646,0.00014765817,0.00017999591,0.00012036862],"domain_scores_gemma":[0.9904627,0.0076574613,0.0006567954,0.00039970895,0.00053887966,0.00028445278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014260109,0.0005464955,0.00044462146,0.0010662397,0.0006022184,0.0009817455,0.0009786848,0.0008136491,0.0024196254],"category_scores_gemma":[0.011926816,0.00027518385,0.0006693202,0.0010066029,0.0028453642,0.0030344056,0.0016161442,0.0019175119,0.00014736781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085967666,0.000031525826,0.0010799181,0.0001272312,0.000028855216,0.00021586561,0.00023911287,0.24712421,0.0020485849,0.7317459,0.0019476705,0.015325107],"study_design_scores_gemma":[0.000015138586,0.000025315105,0.00048238624,0.000025434165,0.000011973289,0.00007576342,0.00005677644,0.42241088,0.00059409766,0.5752137,0.0010745717,0.0000140116945],"about_ca_topic_score_codex":0.002900589,"about_ca_topic_score_gemma":0.0018390233,"teacher_disagreement_score":0.002900589,"about_ca_system_score_codex":0.0012321913,"about_ca_system_score_gemma":0.00083272427,"threshold_uncertainty_score":0.00894022},"labels":[],"label_agreement":null},{"id":"W2345102692","doi":"10.1109/rtas.2016.7461324","title":"Buffer Space Allocation for Real-Time Priority-Aware Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"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 Waterloo","funders":"","keywords":"Computer science; Correctness; Latency (audio); Buffer (optical fiber); Scheduling (production processes); Computer network; Distributed computing; Virtual network; Wormhole; Virtual channel; Mathematical optimization; Algorithm; Queueing theory","score_opus":0.011036751575175842,"score_gpt":0.23477023071360759,"score_spread":0.22373347913843175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345102692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466271,0.0013156944,0.96077555,0.00026955685,0.00008030596,0.00006532465,0.00006485759,0.00065893435,0.0021070663],"genre_scores_gemma":[0.7473637,0.00093819137,0.24927966,0.00018257932,0.00008197778,0.00012425122,0.00010742163,0.00022442352,0.0016977963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734384,0.0007602503,0.00016441975,0.00044776982,0.00082514866,0.00045859345],"domain_scores_gemma":[0.99431485,0.0032707304,0.0007536261,0.00074673805,0.0007071726,0.00020688839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003123052,0.0011829541,0.00073333946,0.0011849327,0.0010499096,0.0027332755,0.0024275284,0.0007167462,0.0018049008],"category_scores_gemma":[0.009835613,0.0005965741,0.00047606684,0.0011291573,0.0011751149,0.005159746,0.001005948,0.0010915264,0.00024717726],"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.00019625832,0.000084167295,0.0008916469,0.00021757613,0.00005052555,0.00006567432,0.00012772733,0.8888789,0.011739826,0.040116664,0.0012767833,0.056354173],"study_design_scores_gemma":[0.000010388089,0.00004170564,0.000120159035,0.000013166561,0.000020887042,0.000036326663,0.000036393034,0.98017865,0.004443901,0.013842851,0.0012445691,0.000010979168],"about_ca_topic_score_codex":0.0033221154,"about_ca_topic_score_gemma":0.0048607495,"teacher_disagreement_score":0.0033221154,"about_ca_system_score_codex":0.003051828,"about_ca_system_score_gemma":0.0034185478,"threshold_uncertainty_score":0.022142708},"labels":[],"label_agreement":null},{"id":"W2346957383","doi":"","title":"The average connectivity of regular multipartite tournaments","year":2001,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Winnipeg","funders":"","keywords":"Digraph; Multipartite; Combinatorics; Mathematics; Disjoint sets; Graph; Transitive relation; Discrete mathematics; Physics","score_opus":0.013851378896998065,"score_gpt":0.23387035884725163,"score_spread":0.22001897995025357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346957383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96107084,0.0003246851,0.03123933,0.00019221954,0.000015936415,0.0000139184285,0.00033253536,0.00010377479,0.006706722],"genre_scores_gemma":[0.9977852,0.00009413689,0.0015946893,0.000011381871,0.00001606792,0.000013004432,0.00014287731,0.000012277079,0.00033032257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996457,0.00008158402,0.000018999912,0.00008471527,0.00007601624,0.00009304188],"domain_scores_gemma":[0.9975867,0.0012469564,0.00050283433,0.00019957618,0.00021719583,0.000246777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037288162,0.00016694558,0.00032992556,0.0010482275,0.0006122067,0.0013810206,0.0005251927,0.00038250553,0.0013619056],"category_scores_gemma":[0.0044891816,0.00020322825,0.00020350922,0.0009537408,0.00073702954,0.0011502381,0.00042836316,0.00027891187,0.000099299774],"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.00095707615,0.00013650872,0.03513205,0.00028470185,0.00022364625,0.0009786183,0.0007679795,0.5621628,0.021869034,0.31073815,0.006787887,0.05996151],"study_design_scores_gemma":[0.000078936726,0.00013865829,0.019766718,0.000030838808,0.00006948069,0.00067789946,0.00031965185,0.6636284,0.004139742,0.30778065,0.003325309,0.000043724907],"about_ca_topic_score_codex":0.0012474878,"about_ca_topic_score_gemma":0.0013813647,"teacher_disagreement_score":0.0013810206,"about_ca_system_score_codex":0.0006260984,"about_ca_system_score_gemma":0.0001905399,"threshold_uncertainty_score":0.00455606},"labels":[],"label_agreement":null},{"id":"W2375658403","doi":"","title":"Design and Implementation of the Distributed Communication Network of Single Chip Computer based on Ethernet","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Ethernet; Key (lock); Embedded system; Computer network; Set (abstract data type); Chip; Flourishing; Operating system; Telecommunications","score_opus":0.0121596085930022,"score_gpt":0.23394139646370635,"score_spread":0.22178178787070416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375658403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07269271,0.001241692,0.88633513,0.00037784997,0.00036516454,0.00048652236,0.000108954955,0.0018858677,0.036506157],"genre_scores_gemma":[0.7155689,0.0009540271,0.26621747,0.0001322398,0.0001155283,0.00050068914,0.00027345837,0.000083627034,0.016154086],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996557,0.00007574173,0.000016530576,0.00006729379,0.00014003419,0.000044597236],"domain_scores_gemma":[0.99983907,0.000024125316,0.000011109268,0.00002064597,0.000093901544,0.0000110831925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041714136,0.00024257743,0.00021867947,0.00035073824,0.0003947453,0.0006514653,0.00090701936,0.00029529535,0.0023414877],"category_scores_gemma":[0.00048460858,0.00014174129,0.00017704065,0.00023218174,0.00020316336,0.00056172843,0.00018320317,0.0002928218,0.00032416935],"study_design_candidate":"bench_or_experimental","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.00050112547,0.00028724078,0.0031824827,0.0009869543,0.00013464694,0.00061578205,0.0007730763,0.09597393,0.155443,0.16860369,0.013136013,0.560362],"study_design_scores_gemma":[0.00034786912,0.0014930066,0.0035842033,0.00015039825,0.0002535179,0.001233178,0.00024010146,0.6264722,0.19086902,0.016151354,0.15911435,0.00009093321],"about_ca_topic_score_codex":0.001167192,"about_ca_topic_score_gemma":0.0012637813,"teacher_disagreement_score":0.0023414877,"about_ca_system_score_codex":0.00053010666,"about_ca_system_score_gemma":0.00068676216,"threshold_uncertainty_score":0.007833004},"labels":[],"label_agreement":null},{"id":"W2394588418","doi":"","title":"On Component Order Edge Connectivity Of a Complete Bipartite Graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Complete bipartite graph; Order (exchange); Component (thermodynamics); Graph; Computer science; Artificial intelligence","score_opus":0.017335751760802386,"score_gpt":0.22655301028302763,"score_spread":0.20921725852222525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394588418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53662497,0.0021847822,0.30743402,0.0030815245,0.00032291823,0.00017529144,0.0029838576,0.00058604626,0.14660661],"genre_scores_gemma":[0.95073384,0.0020114973,0.028098758,0.000497338,0.00036957653,0.00022413874,0.002037902,0.00020204631,0.015824812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994184,0.0002000197,0.000028365064,0.00012463205,0.00013159814,0.000096950294],"domain_scores_gemma":[0.99495643,0.003414363,0.00051009934,0.00036562153,0.00044998535,0.00030339602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005633842,0.00047662467,0.0005657724,0.0025613362,0.000937174,0.0015872001,0.0010138584,0.0012223258,0.009944687],"category_scores_gemma":[0.006053283,0.00037748224,0.0004071543,0.0021222753,0.0015116006,0.0036611366,0.0010186349,0.0013481812,0.0010076761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013600182,0.000048758517,0.0024851218,0.00022032976,0.00003445229,0.00031100647,0.0004126661,0.020231664,0.00210311,0.94026566,0.011087904,0.02266342],"study_design_scores_gemma":[0.000025462,0.000039258637,0.0019878906,0.000069539135,0.000028312446,0.0003453296,0.000226089,0.06796338,0.0008422622,0.9221442,0.0063104937,0.000017876031],"about_ca_topic_score_codex":0.0020537886,"about_ca_topic_score_gemma":0.002665561,"teacher_disagreement_score":0.009944687,"about_ca_system_score_codex":0.0009853729,"about_ca_system_score_gemma":0.00039265346,"threshold_uncertainty_score":0.033268273},"labels":[],"label_agreement":null},{"id":"W2394610828","doi":"","title":"Spanning trees in subcubic graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Discrete mathematics","score_opus":0.010568636526596462,"score_gpt":0.22141706556908922,"score_spread":0.21084842904249276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394610828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46437755,0.00458724,0.27759755,0.0022612081,0.0004454751,0.00017872392,0.0016055895,0.00089683017,0.2480499],"genre_scores_gemma":[0.9002715,0.0029366321,0.04197466,0.000659676,0.00025143079,0.00014491123,0.0016179397,0.00018343284,0.051959846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.00007932511,0.000018060027,0.000052040938,0.00007918075,0.00006332243],"domain_scores_gemma":[0.998953,0.00046742684,0.00014321515,0.00013359029,0.00016425211,0.00013846777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025375254,0.0002529219,0.00037044822,0.0013525706,0.0008976198,0.0013502936,0.00048329664,0.00055451295,0.008268583],"category_scores_gemma":[0.0018973508,0.0002405612,0.00024968537,0.001649308,0.0005892574,0.0020091503,0.00082875765,0.00085537886,0.0013183276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044103657,0.000030574014,0.0007805469,0.00013847194,0.0000205284,0.00032300668,0.00031335285,0.0057294425,0.0023668213,0.9245587,0.010191914,0.055502526],"study_design_scores_gemma":[0.000009345756,0.000016899206,0.0008039576,0.000041767504,0.000020036328,0.00051133614,0.00027475948,0.021090345,0.0010146546,0.95418775,0.022021497,0.0000075988573],"about_ca_topic_score_codex":0.00112145,"about_ca_topic_score_gemma":0.002481435,"teacher_disagreement_score":0.008268583,"about_ca_system_score_codex":0.0005637965,"about_ca_system_score_gemma":0.00039682252,"threshold_uncertainty_score":0.027661204},"labels":[],"label_agreement":null},{"id":"W2394677122","doi":"","title":"A new lower bound on critical graphs with maximum degree of 8 and 9.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Upper and lower bounds; Mathematical analysis; Physics","score_opus":0.030099684101645117,"score_gpt":0.23942797927939116,"score_spread":0.20932829517774604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394677122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09501296,0.024017483,0.51829207,0.012996057,0.0048348173,0.0004931356,0.0057970933,0.004249473,0.33430696],"genre_scores_gemma":[0.602207,0.012934315,0.2812591,0.0068518342,0.0069801346,0.0012016076,0.008949901,0.0035156799,0.07610045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721366,0.00036285413,0.00011966778,0.0005999262,0.0009959072,0.0007079282],"domain_scores_gemma":[0.9854033,0.008995463,0.0008646481,0.0017248096,0.00155746,0.0014543321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535382,0.0031171665,0.0020096572,0.0065412167,0.0029636503,0.006395743,0.005556134,0.0031556617,0.030821126],"category_scores_gemma":[0.017297324,0.001315706,0.0017930553,0.0043804753,0.00249501,0.012252961,0.005013547,0.0074123438,0.007452237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010672713,0.000543381,0.0029621269,0.0017100172,0.00023270401,0.0007556749,0.00060072786,0.035270434,0.01854214,0.6631059,0.14981286,0.12539673],"study_design_scores_gemma":[0.00012531278,0.00024065345,0.0018018361,0.00052443397,0.00023768216,0.0010846588,0.00023695861,0.10238591,0.008811076,0.81179625,0.07262451,0.0001307588],"about_ca_topic_score_codex":0.0015799167,"about_ca_topic_score_gemma":0.0034443815,"teacher_disagreement_score":0.030821126,"about_ca_system_score_codex":0.0042413115,"about_ca_system_score_gemma":0.0018812509,"threshold_uncertainty_score":0.103106916},"labels":[],"label_agreement":null},{"id":"W2395134656","doi":"","title":"Super Connectivity and Super Edge-connectivity of Transformation Graphs G +-+ .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Transformation (genetics); Combinatorics; Computer science; Artificial intelligence","score_opus":0.013625296934942431,"score_gpt":0.2280159920421776,"score_spread":0.21439069510723516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395134656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6289192,0.00063066115,0.22522824,0.0016317392,0.00012860818,0.000092680275,0.0009894583,0.0005342591,0.14184527],"genre_scores_gemma":[0.9678641,0.00037081144,0.019821588,0.00025622066,0.000074568095,0.00007616219,0.0006665344,0.00008996361,0.01078012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962914,0.0001121735,0.000015563288,0.000083118466,0.00008973511,0.00007024641],"domain_scores_gemma":[0.9982108,0.00084678264,0.00030176772,0.00021289737,0.00020262625,0.00022508627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032197943,0.00026690276,0.00028868433,0.0010653163,0.0007217884,0.0011967055,0.00058834546,0.0005405878,0.011735848],"category_scores_gemma":[0.0023076467,0.0002273436,0.00032223153,0.0009584552,0.0011172987,0.002809472,0.0010849006,0.001001148,0.00077221467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009946082,0.000026909065,0.0013268281,0.00008351465,0.000012431541,0.00036662086,0.00025120607,0.0045627444,0.0033157591,0.9685801,0.0038625253,0.017511884],"study_design_scores_gemma":[0.000025059679,0.000040760446,0.0017884999,0.000026469206,0.0000209781,0.00064804615,0.0002581196,0.029197058,0.0016238805,0.9561792,0.010178488,0.000013414401],"about_ca_topic_score_codex":0.00082063524,"about_ca_topic_score_gemma":0.001115766,"teacher_disagreement_score":0.011735848,"about_ca_system_score_codex":0.00040843192,"about_ca_system_score_gemma":0.00030843125,"threshold_uncertainty_score":0.039260328},"labels":[],"label_agreement":null},{"id":"W2395397426","doi":"","title":"Super connectivity and super arc connectivity of the Mycielskian of a digraph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Arc (geometry); Mathematics; Combinatorics; Geometry","score_opus":0.008938231889498707,"score_gpt":0.20313999902775584,"score_spread":0.19420176713825713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395397426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143766,0.0023165836,0.18165307,0.0024796363,0.00033688382,0.00008400429,0.0011580389,0.00024302164,0.2973522],"genre_scores_gemma":[0.95918775,0.0009945141,0.016650403,0.00040885952,0.00023649281,0.000083831066,0.0004054163,0.000059710743,0.021972997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997111,0.000085256484,0.000013900136,0.000058455826,0.000070603506,0.000060613445],"domain_scores_gemma":[0.99872965,0.00064289826,0.00017589804,0.00008537487,0.00016705645,0.00019921179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034805882,0.00031387756,0.00037234562,0.0015808761,0.0009829196,0.0013866791,0.00065008097,0.0006261378,0.010840412],"category_scores_gemma":[0.0022066652,0.0003106336,0.0004407241,0.0011293143,0.0014484513,0.0033710315,0.0012687589,0.0013334805,0.0007592664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018946535,0.0000059089975,0.00019677557,0.00002568005,0.0000035492567,0.00006206243,0.00007183134,0.00098536,0.0004285889,0.9943897,0.0010913236,0.0027201953],"study_design_scores_gemma":[0.000010579774,0.000014204434,0.0004766871,0.000015174815,0.000009483721,0.00019215108,0.000068574634,0.009953467,0.0002654344,0.9838071,0.0051779193,0.00000931936],"about_ca_topic_score_codex":0.0014685679,"about_ca_topic_score_gemma":0.0019986948,"teacher_disagreement_score":0.010840412,"about_ca_system_score_codex":0.0007449392,"about_ca_system_score_gemma":0.0004097418,"threshold_uncertainty_score":0.036264777},"labels":[],"label_agreement":null},{"id":"W2396405335","doi":"","title":"Component Order Edge Connectivity For Graphs Of Fixed Size And Order.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Order (exchange); Component (thermodynamics); Combinatorics; Computer science; Telecommunications; Business; Physics","score_opus":0.01096187036302483,"score_gpt":0.22925398175697692,"score_spread":0.2182921113939521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396405335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52341104,0.0029754224,0.3582863,0.0028531558,0.00036647913,0.0001446309,0.0025516143,0.001461516,0.107949905],"genre_scores_gemma":[0.95246786,0.0015079443,0.027142867,0.00025065336,0.0001872597,0.00011081129,0.0010918851,0.00022076225,0.017019957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961746,0.000079360216,0.000024922101,0.000091743066,0.000097025666,0.00008953404],"domain_scores_gemma":[0.9956328,0.0024676595,0.00051884115,0.0006214509,0.00047946078,0.00027976517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502072,0.00036471902,0.00046060942,0.0020042066,0.0008991954,0.0019495256,0.0010155573,0.000964765,0.008491588],"category_scores_gemma":[0.0067611546,0.00038324573,0.000440651,0.0014748985,0.001362481,0.0034318473,0.00073446194,0.0011041658,0.00083090604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015090923,0.000037962407,0.0020482454,0.00021036863,0.000024832709,0.0002465012,0.00024922236,0.018729493,0.0033490928,0.9412954,0.009887478,0.02377049],"study_design_scores_gemma":[0.00003791685,0.000054214222,0.0019087393,0.000047037316,0.000047143298,0.0006433873,0.00018546826,0.06288183,0.0020881721,0.9199296,0.012153109,0.000023402215],"about_ca_topic_score_codex":0.0023259304,"about_ca_topic_score_gemma":0.0040192357,"teacher_disagreement_score":0.008491588,"about_ca_system_score_codex":0.001212492,"about_ca_system_score_gemma":0.0006013669,"threshold_uncertainty_score":0.028407156},"labels":[],"label_agreement":null},{"id":"W2396568998","doi":"","title":"The rainbow connectivities of small cubic graphs","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rainbow; Combinatorics; Physics; Optics","score_opus":0.016780936543446614,"score_gpt":0.22277287544128224,"score_spread":0.20599193889783562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396568998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86787266,0.00079126377,0.04332527,0.00085740775,0.000083067825,0.000050494396,0.00035143993,0.00026928968,0.08639904],"genre_scores_gemma":[0.98303336,0.00053989846,0.00674961,0.00011926335,0.00006714094,0.00006861564,0.00017239874,0.00006491097,0.009184859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996853,0.00007271553,0.000012325235,0.00006562075,0.00009555679,0.00006854536],"domain_scores_gemma":[0.9975153,0.0014765026,0.00034004494,0.00019394014,0.00018043967,0.000293797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043184817,0.0003396706,0.0003414254,0.002500626,0.0011848994,0.0018258813,0.0008498908,0.0007127907,0.008693359],"category_scores_gemma":[0.00487141,0.0004892661,0.00034630296,0.0017034659,0.0019430214,0.002215073,0.0014873722,0.001341981,0.00037330633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013531059,0.000023580442,0.0013276091,0.000111612666,0.000014227073,0.00013503962,0.00044600913,0.010914951,0.0028224853,0.96965605,0.0020085655,0.01240469],"study_design_scores_gemma":[0.0000423986,0.000027754388,0.0016538444,0.000038198294,0.000021370692,0.00016824123,0.0002748248,0.026133422,0.001162289,0.96725756,0.0031959855,0.000024041605],"about_ca_topic_score_codex":0.0025757072,"about_ca_topic_score_gemma":0.0047712876,"teacher_disagreement_score":0.008693359,"about_ca_system_score_codex":0.0009897607,"about_ca_system_score_gemma":0.00059152505,"threshold_uncertainty_score":0.029082239},"labels":[],"label_agreement":null},{"id":"W2396719912","doi":"","title":"Fault tolerant path-embedding in locally twisted cubes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Embedding; Path (computing); Fault tolerance; Topology (electrical circuits); Combinatorics; Computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.01413941125520222,"score_gpt":0.2507848579107628,"score_spread":0.23664544665556062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396719912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43772012,0.0011636266,0.5113324,0.0009208415,0.00035637035,0.000090738424,0.0006332669,0.0010141073,0.04676861],"genre_scores_gemma":[0.9504304,0.0004740337,0.03649289,0.00011589409,0.00005306104,0.00005891902,0.00034893703,0.00009100692,0.011934916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999757,0.00006446032,0.000016754395,0.000033933393,0.00007050609,0.000057288416],"domain_scores_gemma":[0.99926656,0.00026572848,0.000120748875,0.00015855393,0.00011316575,0.00007514569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023110196,0.00027757118,0.00028492542,0.0004834957,0.0005008872,0.0007668622,0.0005487046,0.00039624132,0.0054074028],"category_scores_gemma":[0.001703038,0.00013792477,0.00020996916,0.0005930196,0.00058276305,0.0022650494,0.0014935547,0.0007915802,0.0007155907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037025617,0.000054065193,0.0007831397,0.00021378532,0.000034423003,0.00066648435,0.00036680192,0.06853753,0.01484686,0.82708126,0.007057152,0.07998825],"study_design_scores_gemma":[0.000036276408,0.00013765354,0.0003233096,0.000046252528,0.000024468764,0.0004632636,0.00023410433,0.15354416,0.010049688,0.8247939,0.010324602,0.000022359287],"about_ca_topic_score_codex":0.0004816984,"about_ca_topic_score_gemma":0.0007334114,"teacher_disagreement_score":0.0054074028,"about_ca_system_score_codex":0.00042812192,"about_ca_system_score_gemma":0.00029442893,"threshold_uncertainty_score":0.018089533},"labels":[],"label_agreement":null},{"id":"W2397667744","doi":"","title":"On cyclic edge connectivity of regular graphs with two orbits.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.017754493069397324,"score_gpt":0.24000767743303986,"score_spread":0.22225318436364253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397667744","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7628231,0.002619305,0.11039945,0.002291251,0.0002901213,0.00010972474,0.0012627367,0.00033424335,0.11986999],"genre_scores_gemma":[0.9765896,0.0016077141,0.011356285,0.000251495,0.00028772352,0.00010461649,0.0008366682,0.00008453337,0.008881308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965346,0.0001085927,0.000018135655,0.00006702962,0.00007211048,0.00008071602],"domain_scores_gemma":[0.9963491,0.002349375,0.0005218011,0.00024044972,0.00024798873,0.00029130094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032714236,0.00038191522,0.0004139052,0.0017510569,0.0009838509,0.0011951597,0.0008351229,0.0009951992,0.009211881],"category_scores_gemma":[0.004327866,0.00031414969,0.00032278406,0.001634847,0.0015652224,0.0028108268,0.00124115,0.0009160915,0.0006137339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002118137,0.00006121389,0.0026624775,0.00025300376,0.000035026656,0.0005905131,0.0005967624,0.019828346,0.003215441,0.9293183,0.010660291,0.032566797],"study_design_scores_gemma":[0.00003681951,0.00006924693,0.0019844065,0.00008781995,0.000030772684,0.00049381604,0.0003844635,0.056015395,0.0010893313,0.93202573,0.0077564316,0.000025675694],"about_ca_topic_score_codex":0.001715712,"about_ca_topic_score_gemma":0.002039733,"teacher_disagreement_score":0.009211881,"about_ca_system_score_codex":0.00070893497,"about_ca_system_score_gemma":0.00035213333,"threshold_uncertainty_score":0.030816793},"labels":[],"label_agreement":null},{"id":"W2397953028","doi":"","title":"A diameter formula for an undirected double-loop network.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Undirected graph; Combinatorics; Topology (electrical circuits); Graph; Business","score_opus":0.02651258352859079,"score_gpt":0.2680501012925312,"score_spread":0.24153751776394042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397953028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12734933,0.0042418363,0.6597902,0.004114686,0.0009484623,0.00011302936,0.0018166398,0.0008530667,0.2007727],"genre_scores_gemma":[0.857525,0.0026147268,0.10362219,0.0011514567,0.00069448026,0.0002527822,0.0009989906,0.0003387413,0.03280149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961334,0.00006408644,0.000031924035,0.00009409573,0.00014132207,0.000055182456],"domain_scores_gemma":[0.9981476,0.0011451475,0.00016145187,0.00016014795,0.0002687545,0.00011684994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057916384,0.00037929253,0.00048543775,0.00080977986,0.00077843753,0.0019841744,0.0012132591,0.0010814932,0.007624699],"category_scores_gemma":[0.004375019,0.0003146671,0.00046768077,0.0009388282,0.00092651276,0.0053752875,0.0011696211,0.0014501846,0.0012286841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052623975,0.000020025038,0.00044298262,0.00014332728,0.000010659608,0.00014341534,0.00016340196,0.00543926,0.002417554,0.96341836,0.009256173,0.018492118],"study_design_scores_gemma":[0.00001741865,0.000026222157,0.0003365834,0.000048915397,0.000024460744,0.00031114338,0.00008829957,0.036986746,0.00093505834,0.94635725,0.014852945,0.000015063289],"about_ca_topic_score_codex":0.0008040334,"about_ca_topic_score_gemma":0.0011379019,"teacher_disagreement_score":0.007624699,"about_ca_system_score_codex":0.0013864824,"about_ca_system_score_gemma":0.00042950417,"threshold_uncertainty_score":0.025507092},"labels":[],"label_agreement":null},{"id":"W2398768919","doi":"","title":"On super restricted edge-connectivity of vertex-transitive graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Transitive relation; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.00860464733695122,"score_gpt":0.2133818032879816,"score_spread":0.20477715595103038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398768919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4846198,0.0035904038,0.29277483,0.0030664932,0.0004255924,0.00014268985,0.001382654,0.00054317777,0.21345438],"genre_scores_gemma":[0.9630077,0.0019346952,0.022142911,0.0005735147,0.0004120987,0.00012774102,0.0008405579,0.00013847431,0.010822264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920124,0.00029472105,0.000048810707,0.00015464805,0.00017811426,0.00012249088],"domain_scores_gemma":[0.99434245,0.0037675365,0.0005004931,0.0006093455,0.00035126542,0.0004289424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516914,0.00049664883,0.00066268665,0.0018261212,0.00105404,0.0015234352,0.0011383323,0.0009061283,0.011135756],"category_scores_gemma":[0.005548701,0.0003844806,0.0004988011,0.0016023986,0.0017859455,0.0057898564,0.0015810347,0.0018243375,0.00086204574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089136905,0.000035790643,0.0007814581,0.00017379377,0.00002466893,0.00027571133,0.0002524935,0.005684505,0.002090709,0.97308,0.004577169,0.012934499],"study_design_scores_gemma":[0.00001605483,0.000026331085,0.0006818782,0.000038680868,0.00001978597,0.00032997836,0.00012266722,0.02048524,0.0005430375,0.9734485,0.004277399,0.000010371414],"about_ca_topic_score_codex":0.00073489704,"about_ca_topic_score_gemma":0.0013291903,"teacher_disagreement_score":0.011135756,"about_ca_system_score_codex":0.00066281494,"about_ca_system_score_gemma":0.00031138113,"threshold_uncertainty_score":0.037252843},"labels":[],"label_agreement":null},{"id":"W2399383611","doi":"","title":"Super 3-restricted edge connectivity of triangle-free graphs","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.028135633385569223,"score_gpt":0.24077049392312522,"score_spread":0.21263486053755598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399383611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096503,0.0004933522,0.09541137,0.0007932563,0.00011059336,0.000052035597,0.0005800007,0.00034941395,0.092559665],"genre_scores_gemma":[0.9812251,0.00031040073,0.010474463,0.00022791373,0.00007462637,0.000051572766,0.00047850417,0.00007862446,0.0070788814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.00008266395,0.000021497017,0.00007914388,0.000099925855,0.0000862698],"domain_scores_gemma":[0.9981337,0.00088689226,0.0002740992,0.00024040307,0.0001936664,0.00027115268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033127074,0.00033846858,0.0005206629,0.0010921665,0.0009289113,0.0013973442,0.0010586113,0.000735172,0.013258632],"category_scores_gemma":[0.0022734078,0.00041827757,0.00046110625,0.001029163,0.0009071408,0.00216505,0.0013900952,0.0012042101,0.00066716725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035123999,0.000079680096,0.002225288,0.00025408907,0.00003831919,0.0007819422,0.0007241058,0.014001814,0.017288491,0.93761027,0.0052593052,0.02138541],"study_design_scores_gemma":[0.00004962003,0.00005111698,0.002353516,0.00003640513,0.000032845415,0.000708949,0.00030123995,0.045945514,0.0030271488,0.94173783,0.0057326355,0.000023199],"about_ca_topic_score_codex":0.0010933189,"about_ca_topic_score_gemma":0.0018212688,"teacher_disagreement_score":0.013258632,"about_ca_system_score_codex":0.0004196371,"about_ca_system_score_gemma":0.00028789358,"threshold_uncertainty_score":0.044354558},"labels":[],"label_agreement":null},{"id":"W2399806649","doi":"","title":"Minimum Metric Dimension of Silicate Networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Combinatorics","score_opus":0.021492643376789723,"score_gpt":0.22283161625877596,"score_spread":0.20133897288198624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399806649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69508,0.0033981001,0.15010062,0.0028303787,0.00037360462,0.000069407164,0.0026540102,0.00035733695,0.14513661],"genre_scores_gemma":[0.96259356,0.0011877994,0.023269538,0.00021279645,0.00018042517,0.000089322304,0.00091772014,0.000090166264,0.011458755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949205,0.00015047396,0.00002697829,0.000076747936,0.0001616274,0.00009213012],"domain_scores_gemma":[0.99859303,0.0006027399,0.00022921586,0.00013036259,0.00018676766,0.00025775167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004083817,0.00042053475,0.0005615157,0.0014058113,0.00091789966,0.002112783,0.0006597325,0.0008432255,0.0056453687],"category_scores_gemma":[0.0032681932,0.00031496,0.0002990992,0.0008502161,0.0010379866,0.0024263335,0.0015285509,0.000868484,0.0008260463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017490337,0.000024834433,0.0010286991,0.00018110173,0.000040237363,0.00007973132,0.00014294418,0.010629784,0.0047618654,0.9548618,0.008866174,0.019207984],"study_design_scores_gemma":[0.000025330884,0.00003929742,0.001056443,0.00003997265,0.00001703164,0.00030874877,0.00011078943,0.030841116,0.0025116222,0.9542508,0.010780149,0.000018778665],"about_ca_topic_score_codex":0.00040353212,"about_ca_topic_score_gemma":0.0008000497,"teacher_disagreement_score":0.0056453687,"about_ca_system_score_codex":0.00083681446,"about_ca_system_score_gemma":0.00042868857,"threshold_uncertainty_score":0.018885612},"labels":[],"label_agreement":null},{"id":"W2400058436","doi":"","title":"On the (l, ω)-domination number of the cube network.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Mathematics; Combinatorics","score_opus":0.019975972562532057,"score_gpt":0.2434718960139144,"score_spread":0.22349592345138233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400058436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48041463,0.0063321805,0.18645574,0.008101288,0.00074501574,0.000108213644,0.0020630495,0.00042554396,0.31535435],"genre_scores_gemma":[0.9568421,0.0027277356,0.019250182,0.00067473965,0.0005056162,0.00017944963,0.00047000198,0.00011619123,0.019233981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931026,0.00023734529,0.000028747047,0.00011319121,0.0001465292,0.00016399291],"domain_scores_gemma":[0.9941975,0.004371628,0.0004092584,0.00026682022,0.00029880766,0.00045602067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011287831,0.00049495057,0.0006071088,0.0018468334,0.0012807607,0.0025047306,0.0010756191,0.00089196686,0.010990617],"category_scores_gemma":[0.009208273,0.0003120655,0.00035304998,0.0016984742,0.002380427,0.0044627707,0.001612074,0.001783887,0.001020388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018747548,0.000032398337,0.0011399878,0.00017439241,0.00002605679,0.000092654096,0.00020826347,0.018663812,0.0017903055,0.9403587,0.012868165,0.024457805],"study_design_scores_gemma":[0.000030405847,0.000027408163,0.0008488864,0.000055120607,0.00001629073,0.00018170582,0.00011407409,0.047734633,0.0008179184,0.94418555,0.005964704,0.000023326249],"about_ca_topic_score_codex":0.0017015581,"about_ca_topic_score_gemma":0.002224011,"teacher_disagreement_score":0.010990617,"about_ca_system_score_codex":0.0019030493,"about_ca_system_score_gemma":0.0009244393,"threshold_uncertainty_score":0.036767304},"labels":[],"label_agreement":null},{"id":"W2400152870","doi":"","title":"An algorithm to find k-tight optimal double-loop networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Algorithm; Mathematical optimization; Combinatorics","score_opus":0.023157057146677283,"score_gpt":0.2425350326295899,"score_spread":0.2193779754829126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400152870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020369157,0.0005162698,0.96170175,0.00038346802,0.00009841096,0.00027095905,0.00043649718,0.0031292439,0.013094255],"genre_scores_gemma":[0.16116984,0.00029505664,0.8289417,0.00017579245,0.000035943027,0.000424647,0.001183539,0.00040015957,0.007373328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958855,0.000087492655,0.000025595475,0.00011326873,0.00010028673,0.000084787534],"domain_scores_gemma":[0.9991517,0.00038615876,0.00006981031,0.00016655962,0.00015310456,0.00007269994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943292,0.00134893,0.0009905768,0.0014407344,0.00095276843,0.0012286116,0.0016617846,0.0013337472,0.014598869],"category_scores_gemma":[0.00416718,0.0007209449,0.0006620848,0.0015863826,0.0006611985,0.0021399283,0.0023798812,0.001326662,0.0031629934],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005172261,0.00035062444,0.0011433505,0.00063932943,0.00011282362,0.00020155245,0.0003772805,0.30161718,0.007391878,0.054677736,0.036943145,0.59602785],"study_design_scores_gemma":[0.00023725319,0.00016761775,0.00041497507,0.00008390617,0.000053696927,0.00022455354,0.00022826625,0.8692307,0.0039546667,0.11252132,0.012848502,0.000034675653],"about_ca_topic_score_codex":0.002722896,"about_ca_topic_score_gemma":0.0051261797,"teacher_disagreement_score":0.014598869,"about_ca_system_score_codex":0.0009936421,"about_ca_system_score_gemma":0.001821979,"threshold_uncertainty_score":0.04883808},"labels":[],"label_agreement":null},{"id":"W2400192545","doi":"","title":"Note on the generalized connectivity.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.014727400286500035,"score_gpt":0.23503789332315927,"score_spread":0.22031049303665923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400192545","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023054829,0.024697028,0.20351014,0.03475952,0.014817986,0.00010017125,0.0015086058,0.0006668795,0.6968849],"genre_scores_gemma":[0.7088627,0.043491174,0.08745991,0.022873944,0.022163205,0.0004762002,0.0015725199,0.00073575444,0.11236455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923575,0.00020959893,0.000033405653,0.00021401925,0.00022611837,0.00008115581],"domain_scores_gemma":[0.9975957,0.001421181,0.00010623988,0.00043666948,0.0002956074,0.00014457623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219285,0.00086031144,0.0007513149,0.0018608839,0.0013396166,0.0018787483,0.0013460206,0.0011432742,0.024700837],"category_scores_gemma":[0.005004642,0.0002984756,0.00090138277,0.0019368136,0.004252781,0.005206979,0.0028122852,0.0037648093,0.002826353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012949318,0.000004605238,0.00008330245,0.00008231374,0.000011167918,0.00016388507,0.00006430066,0.0005697727,0.00035840878,0.9761204,0.015171063,0.0073578767],"study_design_scores_gemma":[0.00000777802,0.000019262205,0.0002919944,0.000039930375,0.000016612026,0.00033816232,0.00004744604,0.0012067442,0.00021563587,0.9356748,0.06212942,0.0000122181755],"about_ca_topic_score_codex":0.0015643514,"about_ca_topic_score_gemma":0.0018478463,"teacher_disagreement_score":0.024700837,"about_ca_system_score_codex":0.0008536966,"about_ca_system_score_gemma":0.0005691761,"threshold_uncertainty_score":0.0826326},"labels":[],"label_agreement":null},{"id":"W2400401589","doi":"","title":"On 4-cutwidth critical trees.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.016871697053575937,"score_gpt":0.26240274648922396,"score_spread":0.24553104943564802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400401589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35608023,0.012057408,0.27409565,0.003778385,0.0014469146,0.00020618385,0.0012619124,0.0006478647,0.35042545],"genre_scores_gemma":[0.85960305,0.0072604087,0.0590617,0.0014761483,0.0007264408,0.00017729108,0.0013259582,0.00031843505,0.07005066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977964,0.000044923316,0.000010928731,0.000035620298,0.000059284474,0.000069584705],"domain_scores_gemma":[0.9991658,0.00041680963,0.00010222458,0.00007040085,0.000126383,0.000118432945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030795584,0.00052014505,0.00036544245,0.0017980635,0.0009114475,0.0012909146,0.0006423071,0.00068144087,0.012242693],"category_scores_gemma":[0.0020205365,0.00031753362,0.00030945655,0.0011547721,0.0008857808,0.0024366062,0.0011946401,0.0012592035,0.0016190043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000130057,0.000038191574,0.0005866298,0.00022854422,0.000022631511,0.00039075527,0.0002610702,0.007797514,0.0042925184,0.9252474,0.018282237,0.042722516],"study_design_scores_gemma":[0.00002276357,0.000027236738,0.00043507395,0.00009751553,0.000016512386,0.00041691685,0.00016317716,0.016126018,0.0014847557,0.9542636,0.026934097,0.000012336344],"about_ca_topic_score_codex":0.0011665795,"about_ca_topic_score_gemma":0.0030263742,"teacher_disagreement_score":0.012242693,"about_ca_system_score_codex":0.001109788,"about_ca_system_score_gemma":0.0004723393,"threshold_uncertainty_score":0.0409559},"labels":[],"label_agreement":null},{"id":"W2400852168","doi":"","title":"Supereulerian index is stable under contractions and closures.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Line graph; Graph; Iterated function; Discrete mathematics; Factor-critical graph; Contractible space; Graph power; Mathematical analysis","score_opus":0.010081464947897798,"score_gpt":0.22972261539235234,"score_spread":0.21964115044445454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400852168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91664207,0.00013948091,0.05694502,0.00015144495,0.000028800838,0.000037160535,0.00015852947,0.00017651655,0.02572085],"genre_scores_gemma":[0.9870275,0.000102919235,0.008906272,0.000044013294,0.000038643848,0.000038985807,0.00019197502,0.000055166296,0.003594539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.00005425851,0.00002868268,0.0001982976,0.00015711963,0.00012019079],"domain_scores_gemma":[0.997477,0.0008978683,0.0005331473,0.00047582237,0.00027949407,0.00033672422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004660293,0.00023723413,0.0004186927,0.0009998983,0.00095987314,0.0012467015,0.0006447054,0.00044730352,0.0027787967],"category_scores_gemma":[0.0026585157,0.00024530423,0.0005004897,0.0006823676,0.0020116437,0.0030862833,0.0012640523,0.00087679294,0.00031965278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005360997,0.00013437882,0.008133343,0.00014042264,0.00004910521,0.0010781307,0.0015967631,0.010857295,0.14200765,0.7876247,0.0014737985,0.046368223],"study_design_scores_gemma":[0.00007897832,0.00041823703,0.012990768,0.00003114098,0.00006922547,0.0021000316,0.0009059552,0.07530735,0.10114583,0.7897156,0.017171897,0.0000649508],"about_ca_topic_score_codex":0.000541091,"about_ca_topic_score_gemma":0.0006375937,"teacher_disagreement_score":0.0027787967,"about_ca_system_score_codex":0.00054990937,"about_ca_system_score_gemma":0.0003371284,"threshold_uncertainty_score":0.009296},"labels":[],"label_agreement":null},{"id":"W2400967666","doi":"","title":"On equality of restricted edge connectivity and minimum edge degree of graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Degree (music); Combinatorics; Computer science; Telecommunications","score_opus":0.02842017840557692,"score_gpt":0.24851214335308755,"score_spread":0.22009196494751063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400967666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41355535,0.0073204143,0.3596477,0.0069052535,0.0010021414,0.00012021592,0.0018357689,0.00042530915,0.20918794],"genre_scores_gemma":[0.9646126,0.0023877246,0.02261383,0.0008179703,0.0011014654,0.00013990207,0.0008021035,0.00020422792,0.007320134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757785,0.00096175977,0.00017239325,0.00057243253,0.00039209495,0.00032342452],"domain_scores_gemma":[0.97470814,0.019821804,0.0015350931,0.0016051899,0.0012425043,0.0010873596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024286371,0.0007338837,0.0014022099,0.002190166,0.0011041851,0.002997867,0.002469034,0.0018290422,0.010782813],"category_scores_gemma":[0.030594405,0.0006284006,0.00068924134,0.0022652089,0.004201741,0.011764342,0.003350307,0.003573007,0.0011681936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018359476,0.000051362196,0.0017515927,0.00022393515,0.00003969519,0.0002463355,0.0003277295,0.00518933,0.0013284107,0.96691114,0.00516954,0.018577212],"study_design_scores_gemma":[0.000025504873,0.000033629272,0.0011350405,0.000046114346,0.000025355237,0.00037490806,0.00013299342,0.012494107,0.0005164947,0.982733,0.002467103,0.000015727921],"about_ca_topic_score_codex":0.0009113628,"about_ca_topic_score_gemma":0.0008554135,"teacher_disagreement_score":0.010782813,"about_ca_system_score_codex":0.00094293937,"about_ca_system_score_gemma":0.00036578331,"threshold_uncertainty_score":0.036072075},"labels":[],"label_agreement":null},{"id":"W2401059461","doi":"","title":"Locating and Liar Domination of Circulant Networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.018301420743426604,"score_gpt":0.20934174256396182,"score_spread":0.1910403218205352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401059461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42151585,0.0025732082,0.41536272,0.0017014397,0.00018496178,0.00013972317,0.00045360456,0.0006062356,0.15746224],"genre_scores_gemma":[0.9538305,0.0005481826,0.020417929,0.0002241045,0.00014994039,0.000095614545,0.00020586845,0.00007222749,0.02445561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898666,0.00036352634,0.000032215325,0.00019700057,0.00021462397,0.00020588619],"domain_scores_gemma":[0.9952649,0.0026650277,0.00064039277,0.00045155032,0.00048381076,0.000494204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094391865,0.00040987134,0.0006708052,0.0014759895,0.0015314915,0.0020434444,0.00096633023,0.0010811322,0.0073288362],"category_scores_gemma":[0.008902165,0.0003419081,0.00044021013,0.000854662,0.0019743897,0.0018227717,0.0016719598,0.001018092,0.001207042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011014417,0.00004093802,0.0008126519,0.00009719335,0.000028194334,0.00031609373,0.00033624875,0.01647118,0.0052381055,0.9463689,0.004764028,0.025416264],"study_design_scores_gemma":[0.000070926704,0.0000723323,0.00093796005,0.00004935905,0.000034567507,0.00069288845,0.00021684848,0.09193327,0.003410811,0.8912389,0.011300285,0.000041736836],"about_ca_topic_score_codex":0.0011200401,"about_ca_topic_score_gemma":0.0018158513,"teacher_disagreement_score":0.0073288362,"about_ca_system_score_codex":0.0012210417,"about_ca_system_score_gemma":0.00063517434,"threshold_uncertainty_score":0.024517417},"labels":[],"label_agreement":null},{"id":"W2401068328","doi":"","title":"Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Hypercube; Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Cube (algebra); Interconnection; Computer science","score_opus":0.0063749726444367345,"score_gpt":0.22459000691385994,"score_spread":0.2182150342694232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401068328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22364363,0.0019233128,0.73628485,0.0008341539,0.00013510072,0.00010632978,0.00023236303,0.00034357785,0.036496766],"genre_scores_gemma":[0.8656067,0.0011750147,0.1296544,0.00013157426,0.00012071837,0.00009010787,0.00015995269,0.000070653055,0.002990833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999126,0.0002720831,0.000065861954,0.00023349421,0.00023691937,0.000065652246],"domain_scores_gemma":[0.9952814,0.0030796684,0.00059346535,0.0005211042,0.00027433567,0.00025000592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117631,0.00045083076,0.00044651792,0.0016209625,0.0006385676,0.0012864597,0.0006653481,0.00072394905,0.003337243],"category_scores_gemma":[0.008522872,0.0003402963,0.0006165372,0.0016139285,0.0029449582,0.00386327,0.0015670223,0.0012463798,0.0003072002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008098009,0.000022711763,0.001131209,0.00009921387,0.000012792191,0.00015336635,0.00020953658,0.024905976,0.0038467837,0.9428681,0.00095242675,0.025716959],"study_design_scores_gemma":[0.000011884802,0.000113236616,0.00082037796,0.00003048562,0.000025635232,0.0006310196,0.00009018974,0.106576994,0.00437289,0.8805062,0.0067935362,0.000027555176],"about_ca_topic_score_codex":0.00063901604,"about_ca_topic_score_gemma":0.0004923912,"teacher_disagreement_score":0.003337243,"about_ca_system_score_codex":0.0009738277,"about_ca_system_score_gemma":0.00041761325,"threshold_uncertainty_score":0.011164188},"labels":[],"label_agreement":null},{"id":"W2401169605","doi":"","title":"An Improved Algorithm for Cyclic Edge Connectivity of Regular Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Artificial intelligence","score_opus":0.009102863404994091,"score_gpt":0.23547330422581528,"score_spread":0.2263704408208212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401169605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042187076,0.00054540194,0.92667645,0.0006005145,0.00030051437,0.0005688519,0.0011848556,0.007915266,0.02002102],"genre_scores_gemma":[0.15585078,0.00022798381,0.8303405,0.0002476108,0.00012521312,0.00051828317,0.0028686589,0.00074432755,0.009076608],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.00019328704,0.00006629664,0.00023226428,0.00027810936,0.00015917061],"domain_scores_gemma":[0.99756384,0.0008756887,0.00011479675,0.0008389484,0.00047558342,0.00013126439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006498552,0.0009885719,0.00087886857,0.0019170046,0.0010497966,0.001475681,0.00251532,0.0014282295,0.016080655],"category_scores_gemma":[0.00571875,0.00050269766,0.0008006548,0.002819604,0.0007298117,0.0026439226,0.002586632,0.0012980371,0.003432325],"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.0008128567,0.00045513714,0.0016992423,0.0005285542,0.00011896231,0.00039050117,0.00034790972,0.072123885,0.01493645,0.062192257,0.056629173,0.789765],"study_design_scores_gemma":[0.0005192013,0.00032366833,0.0011915498,0.000084821164,0.00014055293,0.0005787054,0.00021052783,0.8186257,0.013609413,0.1257541,0.038881943,0.000079940284],"about_ca_topic_score_codex":0.0055087935,"about_ca_topic_score_gemma":0.008950352,"teacher_disagreement_score":0.016080655,"about_ca_system_score_codex":0.001155358,"about_ca_system_score_gemma":0.0022681293,"threshold_uncertainty_score":0.0537951},"labels":[],"label_agreement":null},{"id":"W2401701830","doi":"","title":"Some New Sufficient Conditions for Graphs to be (a, b, k)-Critical Graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Discrete mathematics; Graph","score_opus":0.03849208709936138,"score_gpt":0.2742585572179592,"score_spread":0.23576647011859783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401701830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25998044,0.0057742586,0.4445278,0.010228697,0.0034506219,0.0015733844,0.011838025,0.0040423754,0.25858432],"genre_scores_gemma":[0.86592835,0.0021308677,0.10441657,0.002954019,0.0013868057,0.001256064,0.0065797106,0.00056049705,0.014787164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990891,0.00021492108,0.00012830672,0.00021439619,0.00015066654,0.00020260118],"domain_scores_gemma":[0.98939204,0.005804571,0.0010175634,0.0005371272,0.0018251329,0.0014237171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014998598,0.00086714484,0.00093010685,0.00308686,0.002119599,0.0029200881,0.0011258916,0.0027596175,0.021576483],"category_scores_gemma":[0.013513702,0.0009403814,0.001103702,0.0012815899,0.0019927372,0.005273369,0.0019537199,0.0034531117,0.003667416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089941226,0.00037650668,0.0053091804,0.001323854,0.00014050644,0.0031049883,0.0012103526,0.009701044,0.030178381,0.8534364,0.0640732,0.030246176],"study_design_scores_gemma":[0.000367147,0.00019626922,0.004055845,0.00040497942,0.00013164406,0.0018124526,0.0013907873,0.027320491,0.011348396,0.9143102,0.038518194,0.00014344075],"about_ca_topic_score_codex":0.0014704634,"about_ca_topic_score_gemma":0.002859574,"teacher_disagreement_score":0.021576483,"about_ca_system_score_codex":0.0014507021,"about_ca_system_score_gemma":0.0015589753,"threshold_uncertainty_score":0.07218057},"labels":[],"label_agreement":null},{"id":"W2402046163","doi":"","title":"Two paths joining given vertices in (2k+1)-edge-connected graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.013010302553631356,"score_gpt":0.24010965132346485,"score_spread":0.22709934876983348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402046163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705226,0.0014299918,0.18454163,0.0026806558,0.00091260177,0.0007106588,0.005797554,0.0011488784,0.09755206],"genre_scores_gemma":[0.8040242,0.0009991209,0.13430996,0.00027459385,0.00007087507,0.00044093517,0.004239213,0.00018977249,0.055451456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00018054851,0.00005546378,0.00021254345,0.00015925117,0.00022379783],"domain_scores_gemma":[0.9980909,0.00066178315,0.00040362542,0.00026061907,0.00027732863,0.00030573836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003167436,0.0005623858,0.00048458154,0.0010634956,0.001953523,0.0025488203,0.001296723,0.0021022332,0.024100494],"category_scores_gemma":[0.004239233,0.00048684553,0.00049743487,0.0014911742,0.0011374826,0.0035138703,0.0023224563,0.0011102479,0.004089386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004574865,0.0007571903,0.010583639,0.0029444864,0.00036347922,0.008428716,0.0036947632,0.025822094,0.054895528,0.6165323,0.022725414,0.24867755],"study_design_scores_gemma":[0.000553569,0.0005823332,0.012958997,0.0009599897,0.00038393564,0.0056292685,0.004336951,0.071401335,0.053765643,0.7105721,0.13860872,0.0002471027],"about_ca_topic_score_codex":0.0011577554,"about_ca_topic_score_gemma":0.0028038332,"teacher_disagreement_score":0.024100494,"about_ca_system_score_codex":0.0010245177,"about_ca_system_score_gemma":0.00087940926,"threshold_uncertainty_score":0.08062416},"labels":[],"label_agreement":null},{"id":"W2403289943","doi":"","title":"On the Folded hypercube and Bi-folded Hypercube.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Combinatorics","score_opus":0.013915870917109222,"score_gpt":0.21893163015393358,"score_spread":0.20501575923682436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403289943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20613576,0.022159249,0.4024739,0.0039265254,0.003076283,0.00015536301,0.000633093,0.00057225325,0.3608676],"genre_scores_gemma":[0.8083421,0.01174711,0.08292608,0.0013169186,0.0011966195,0.00020494404,0.0006021797,0.00024541857,0.09341871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967945,0.000118690616,0.000018209157,0.000045691286,0.00007509176,0.00006283499],"domain_scores_gemma":[0.9994729,0.00015456504,0.00006114527,0.00012275774,0.00010448544,0.00008421108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044361642,0.00046772044,0.00043172162,0.0010979259,0.0009815496,0.0014311294,0.0006278609,0.0006828119,0.0077054407],"category_scores_gemma":[0.001811141,0.00029544006,0.00033459425,0.0014475025,0.0016561742,0.00417112,0.0019699784,0.00120988,0.0015904738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090545655,0.000015910993,0.00021852291,0.00007915825,0.000011011221,0.00021433657,0.00015792932,0.00847069,0.001177491,0.96117514,0.006465087,0.021924164],"study_design_scores_gemma":[0.000009433684,0.000021237107,0.0002162909,0.00005099145,0.0000074106943,0.00021090345,0.00011400773,0.02122245,0.00051794696,0.9612582,0.01636016,0.000011065303],"about_ca_topic_score_codex":0.0007838517,"about_ca_topic_score_gemma":0.0012050208,"teacher_disagreement_score":0.0077054407,"about_ca_system_score_codex":0.00067006436,"about_ca_system_score_gemma":0.00033830747,"threshold_uncertainty_score":0.02577728},"labels":[],"label_agreement":null},{"id":"W2403321548","doi":"","title":"Maximum degree of 3-independent vertices and group connectivity.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics; Group (periodic table); Physics; Quantum mechanics","score_opus":0.033559432396082875,"score_gpt":0.24326285946784204,"score_spread":0.20970342707175915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403321548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947032,0.002641007,0.11329626,0.004170491,0.00036553296,0.000112403046,0.002953561,0.00032628496,0.18143119],"genre_scores_gemma":[0.9789979,0.0011032257,0.010617119,0.0001798483,0.00018732072,0.000069737645,0.00065751094,0.000047500194,0.0081398925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995882,0.000100841884,0.000019924304,0.00009957784,0.000083316714,0.00010821459],"domain_scores_gemma":[0.9969199,0.0017242295,0.0005515459,0.00023070662,0.0002160171,0.00035757016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046300635,0.0004105322,0.00045485908,0.0015033245,0.0009577898,0.0015615365,0.00090162375,0.0008938131,0.008802011],"category_scores_gemma":[0.003989492,0.00032138996,0.0004751699,0.0013672189,0.0014914655,0.0025720163,0.001170495,0.0011181798,0.0010889693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046838558,0.00010991704,0.005420326,0.00038309663,0.00008126779,0.00064027373,0.0007903803,0.01492915,0.010506694,0.90639955,0.015583162,0.044687912],"study_design_scores_gemma":[0.000046933816,0.00004632376,0.0038290708,0.00007251782,0.000046593406,0.0009157303,0.00034157795,0.016144728,0.003142769,0.96312886,0.012259005,0.000025982175],"about_ca_topic_score_codex":0.000589352,"about_ca_topic_score_gemma":0.00093504676,"teacher_disagreement_score":0.008802011,"about_ca_system_score_codex":0.0005744871,"about_ca_system_score_gemma":0.0003389368,"threshold_uncertainty_score":0.029445589},"labels":[],"label_agreement":null},{"id":"W2403495415","doi":"","title":"cλ-optimally connected mixed Cayley graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Combinatorics; Vertex-transitive graph; Cayley transform; Mixed graph; Cayley's theorem; Graph; Voltage graph; Line graph","score_opus":0.02306755692736293,"score_gpt":0.23393902127162738,"score_spread":0.21087146434426446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403495415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47071457,0.0011517184,0.23414193,0.003880228,0.0005452996,0.00036960564,0.006974639,0.0014552796,0.28076667],"genre_scores_gemma":[0.85917085,0.00057272747,0.07981133,0.0011597256,0.000112658534,0.00025051492,0.0036404985,0.0002439533,0.05503779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.00008314669,0.00001377665,0.000085613676,0.0000657661,0.00007763647],"domain_scores_gemma":[0.9989002,0.0003995844,0.00013933405,0.00015468993,0.00022922622,0.00017701037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024235321,0.0006818807,0.00046482435,0.00084696634,0.0009924959,0.0017601303,0.0009815505,0.0012476376,0.022839598],"category_scores_gemma":[0.002179879,0.00042307493,0.00032637728,0.0008226207,0.0006197616,0.0017344756,0.00079062884,0.0013024502,0.0026642075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050009903,0.0002168954,0.0014452145,0.0006178551,0.00012800697,0.00047734805,0.00013256185,0.030492425,0.017987687,0.83090574,0.06301746,0.054078758],"study_design_scores_gemma":[0.00013455814,0.00011953453,0.0019862966,0.00010560521,0.00009432587,0.0006782576,0.00027533126,0.145585,0.008027635,0.8112849,0.031658392,0.000050167662],"about_ca_topic_score_codex":0.0018578334,"about_ca_topic_score_gemma":0.0048241923,"teacher_disagreement_score":0.022839598,"about_ca_system_score_codex":0.0010151955,"about_ca_system_score_gemma":0.0009660914,"threshold_uncertainty_score":0.07640612},"labels":[],"label_agreement":null},{"id":"W2403712848","doi":"","title":"Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Fault (geology); Parallel computing; Combinatorics; Computer science; Geology; Seismology","score_opus":0.017898883464014633,"score_gpt":0.2353897501708932,"score_spread":0.21749086670687856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403712848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87139565,0.0004191411,0.10869579,0.00045125023,0.000064679465,0.00007724444,0.0004641259,0.0004479575,0.017984042],"genre_scores_gemma":[0.9724534,0.0001708653,0.019731732,0.000050459545,0.000012260827,0.000042467458,0.00022378488,0.000042152,0.0072728437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998275,0.000042839205,0.0000131737215,0.000029257715,0.00003756525,0.000049553793],"domain_scores_gemma":[0.9990557,0.00040428655,0.00017955751,0.00010376067,0.00013955934,0.00011712311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020290105,0.00020104383,0.00021642784,0.0006874193,0.00092322106,0.0009035178,0.00058153045,0.00059797935,0.0038017083],"category_scores_gemma":[0.0015678619,0.0002373873,0.00022633681,0.0005639645,0.00059033977,0.0011381557,0.0005743207,0.00034867355,0.00042388737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014448776,0.00023072393,0.009136914,0.00046814836,0.00009868241,0.0028708074,0.00091656815,0.39749584,0.040956844,0.4708385,0.008807426,0.06673475],"study_design_scores_gemma":[0.000096722004,0.00019330562,0.0028265426,0.00007330877,0.000048849033,0.0006404844,0.000528212,0.6746712,0.014463791,0.3001809,0.006239961,0.000036689136],"about_ca_topic_score_codex":0.0053075864,"about_ca_topic_score_gemma":0.008007808,"teacher_disagreement_score":0.0053075864,"about_ca_system_score_codex":0.00073293067,"about_ca_system_score_gemma":0.0005237278,"threshold_uncertainty_score":0.012717962},"labels":[],"label_agreement":null},{"id":"W2403866431","doi":"","title":"Contractible edges of k-connected graphs for k=4, 5","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Contractible space; Mathematics; Combinatorics","score_opus":0.012247726329446922,"score_gpt":0.23948245569611745,"score_spread":0.22723472936667052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403866431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89800596,0.00032565545,0.03336311,0.0006566167,0.00012370363,0.00008535392,0.0013205521,0.0002037619,0.06591512],"genre_scores_gemma":[0.95808935,0.0003147697,0.015040966,0.00019096518,0.00005048101,0.000111215566,0.0016175074,0.00014319828,0.024441462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995301,0.000090066496,0.00003091495,0.00009680876,0.00012055654,0.00013161812],"domain_scores_gemma":[0.9978136,0.0009958189,0.00029212667,0.00024380433,0.00021988907,0.00043464068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040102433,0.000475475,0.00040314952,0.0010412739,0.0019410648,0.0020020609,0.001211719,0.0010819095,0.013877658],"category_scores_gemma":[0.0022673146,0.000543088,0.0005718875,0.0009467355,0.0014164965,0.0019628177,0.0012622048,0.0014892182,0.0009167255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010625736,0.00012190131,0.002942385,0.00026552257,0.00004111594,0.0007528544,0.0010150642,0.01571597,0.008480577,0.9375254,0.0082514305,0.02382524],"study_design_scores_gemma":[0.00014948696,0.000091934,0.00656444,0.00011157472,0.00005781011,0.0006535029,0.00082773826,0.04664528,0.0059571955,0.91866887,0.02019397,0.00007831814],"about_ca_topic_score_codex":0.0025338237,"about_ca_topic_score_gemma":0.003941303,"teacher_disagreement_score":0.013877658,"about_ca_system_score_codex":0.0006770567,"about_ca_system_score_gemma":0.00071389094,"threshold_uncertainty_score":0.046425402},"labels":[],"label_agreement":null},{"id":"W2404073835","doi":"","title":"Algebraic Properties and Panconnectivity of Folded Hypercubes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hypercube; Algebraic number; Combinatorics; Mathematical analysis","score_opus":0.016356384914356193,"score_gpt":0.20624516979337124,"score_spread":0.18988878487901503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404073835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72414815,0.0013679524,0.118824914,0.00074678694,0.00016509132,0.000082611376,0.0006743017,0.00018037825,0.15380992],"genre_scores_gemma":[0.977967,0.00070999924,0.012368332,0.00008924681,0.00009145092,0.000043602282,0.0004221208,0.000032069034,0.008276245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000044481683,0.000016113334,0.000039067723,0.000087020424,0.00003797231],"domain_scores_gemma":[0.9992506,0.0002177279,0.00020916971,0.00009907388,0.0001456596,0.00007775879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013196532,0.00020949602,0.0001752202,0.00083348877,0.00059653714,0.0011979829,0.00025142397,0.00026177394,0.005097866],"category_scores_gemma":[0.0015235803,0.00020905425,0.00015354014,0.0009288986,0.0007946176,0.0016288736,0.00071730954,0.00051306124,0.00049605273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009101841,0.000021850585,0.0014258812,0.000113549395,0.00001659226,0.000393652,0.00044860257,0.0069237016,0.012477516,0.94444746,0.0030078702,0.030632311],"study_design_scores_gemma":[0.000021451073,0.00007144897,0.0033306398,0.00004557905,0.000026364542,0.0016319086,0.0006449124,0.022329623,0.0069566136,0.9424865,0.02243607,0.000018761364],"about_ca_topic_score_codex":0.00043871193,"about_ca_topic_score_gemma":0.0007866616,"teacher_disagreement_score":0.005097866,"about_ca_system_score_codex":0.00029430067,"about_ca_system_score_gemma":0.00015966251,"threshold_uncertainty_score":0.017054081},"labels":[],"label_agreement":null},{"id":"W2404605154","doi":"","title":"The Maximum Number of One-Edge Extensions for Graphs with Bounded Degree","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Bounded function; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Telecommunications","score_opus":0.023157270652868798,"score_gpt":0.24781308170415545,"score_spread":0.22465581105128665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404605154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89706075,0.00084217574,0.07645883,0.001655555,0.00011429263,0.00008859612,0.00094819843,0.0005486674,0.022282895],"genre_scores_gemma":[0.95958877,0.000602982,0.031611707,0.00021952091,0.000098200915,0.0001506001,0.0007761475,0.00019496704,0.0067571755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986168,0.0004247394,0.000093356895,0.00036502944,0.00020752406,0.00029255345],"domain_scores_gemma":[0.98136675,0.0116420025,0.0014466968,0.002312764,0.0007387866,0.0024930006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723489,0.0010490683,0.0013516305,0.0012864738,0.0020781592,0.0041851844,0.002790319,0.0021726803,0.0064102076],"category_scores_gemma":[0.010604961,0.0008162483,0.0013264555,0.0010170591,0.0022155757,0.008519049,0.002300096,0.0024809912,0.00069998426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037741952,0.00060767744,0.009777201,0.0014213044,0.00026754924,0.0008245499,0.0015760097,0.08484128,0.054806937,0.74391466,0.010821993,0.087366655],"study_design_scores_gemma":[0.00016381513,0.00031678213,0.003218467,0.00020615068,0.0001835808,0.001262035,0.00044787105,0.12604465,0.016071873,0.8458981,0.0060950005,0.00009182389],"about_ca_topic_score_codex":0.0002517939,"about_ca_topic_score_gemma":0.0006378757,"teacher_disagreement_score":0.0064102076,"about_ca_system_score_codex":0.0010993059,"about_ca_system_score_gemma":0.00094024703,"threshold_uncertainty_score":0.02144432},"labels":[],"label_agreement":null},{"id":"W2404682058","doi":"","title":"A Note on Z 5 -connectivity in 3-edge-connected graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Artificial intelligence","score_opus":0.010063945597146911,"score_gpt":0.23010183354457925,"score_spread":0.22003788794743234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404682058","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07073916,0.030291108,0.27716777,0.025298456,0.017333474,0.00017318463,0.0017322426,0.0012849048,0.5759797],"genre_scores_gemma":[0.74397403,0.039410423,0.13135816,0.014430193,0.008531801,0.00035973842,0.0016148686,0.00060012494,0.05972048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.000097171294,0.00002660704,0.00009538112,0.0001170463,0.00006479785],"domain_scores_gemma":[0.9982326,0.0012605032,0.00009280037,0.00016755442,0.00013603382,0.00011044231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071752735,0.00061809487,0.0006053079,0.0015348727,0.001360599,0.0016556486,0.0013738216,0.0012051131,0.013325863],"category_scores_gemma":[0.0033084296,0.00033897266,0.0008032527,0.0019256739,0.0021605655,0.0036694552,0.0020661366,0.0034536612,0.0023587663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017390234,0.000038832546,0.0007175713,0.00055086456,0.000048633818,0.0011707597,0.00029744772,0.0043817265,0.0036256134,0.8757973,0.056793917,0.056403473],"study_design_scores_gemma":[0.000021116482,0.00008502658,0.0010921706,0.00012803917,0.00004664158,0.0008027658,0.00015636784,0.0046961717,0.0013851672,0.874685,0.11686444,0.00003706263],"about_ca_topic_score_codex":0.0017696265,"about_ca_topic_score_gemma":0.0025040288,"teacher_disagreement_score":0.013325863,"about_ca_system_score_codex":0.00076277787,"about_ca_system_score_gemma":0.00045403515,"threshold_uncertainty_score":0.044579506},"labels":[],"label_agreement":null},{"id":"W2404900926","doi":"","title":"Extraconnectivity of Folded Hypercubes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Arithmetic; Combinatorics","score_opus":0.010926820622835655,"score_gpt":0.2201957932466309,"score_spread":0.20926897262379526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404900926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77824515,0.0015888071,0.10017327,0.00037319228,0.00017057447,0.00006372352,0.0004417581,0.00024400713,0.11869951],"genre_scores_gemma":[0.9636282,0.0008842128,0.017919881,0.00010012695,0.000064123604,0.0000628861,0.00054518116,0.000063024134,0.016732302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979407,0.000055493645,0.000012457138,0.00003472836,0.00006260997,0.00004066349],"domain_scores_gemma":[0.999385,0.00021490415,0.00011676061,0.00009235362,0.000108356464,0.00008258519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013977209,0.00023963477,0.00018850587,0.0008662641,0.0006894473,0.00080004166,0.0002976575,0.00028890956,0.0055612396],"category_scores_gemma":[0.0011678237,0.00018843578,0.00017875011,0.0007183367,0.00051743473,0.0010587535,0.001067768,0.00042320302,0.00054467976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019494124,0.000051352123,0.0035547721,0.00025308577,0.00004001432,0.00083920825,0.00070952723,0.020733498,0.021035146,0.86078066,0.006095611,0.085712194],"study_design_scores_gemma":[0.000038622224,0.000104767045,0.0070636407,0.00013508214,0.000052821943,0.0016364794,0.0009895321,0.07267108,0.0151176285,0.86756104,0.034599736,0.000029679211],"about_ca_topic_score_codex":0.0007378897,"about_ca_topic_score_gemma":0.0015209154,"teacher_disagreement_score":0.0055612396,"about_ca_system_score_codex":0.0002972905,"about_ca_system_score_gemma":0.00017933465,"threshold_uncertainty_score":0.01860416},"labels":[],"label_agreement":null},{"id":"W2405304254","doi":"","title":"Connectivity and super-connectivity of Cartesian product graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Order (exchange); Degree (music); Discrete mathematics; Geometry; Business; Physics","score_opus":0.008479422549771593,"score_gpt":0.21955807577360473,"score_spread":0.21107865322383312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405304254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70937604,0.002957239,0.23097907,0.0010677712,0.0001479146,0.00006343196,0.00076227356,0.00030209575,0.05434413],"genre_scores_gemma":[0.973813,0.0006945811,0.022829695,0.00010255169,0.000085758555,0.000042265838,0.00041197904,0.00003503751,0.0019851339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991398,0.00021598936,0.00005296602,0.00031503176,0.00018658946,0.000089466856],"domain_scores_gemma":[0.99581224,0.002135128,0.0008040077,0.00039819436,0.0005024557,0.0003478405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065999443,0.00034927804,0.00037711463,0.0012097227,0.00072452327,0.0010376386,0.0005605112,0.0005595458,0.0050959922],"category_scores_gemma":[0.0041465685,0.00034683757,0.0003856643,0.0012556877,0.0017094584,0.0035069596,0.0010192683,0.0008465415,0.00037575336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036619898,0.000052488278,0.008882695,0.00044265602,0.00006184832,0.0012018201,0.001330145,0.012029724,0.015629698,0.9185261,0.0034489823,0.038027674],"study_design_scores_gemma":[0.000044614113,0.00034553537,0.014678861,0.00014795434,0.00014249326,0.0057959016,0.0008786968,0.048545875,0.013059591,0.88497525,0.031313848,0.00007136035],"about_ca_topic_score_codex":0.00061028515,"about_ca_topic_score_gemma":0.00082915695,"teacher_disagreement_score":0.0050959922,"about_ca_system_score_codex":0.0004929775,"about_ca_system_score_gemma":0.00027665676,"threshold_uncertainty_score":0.017047763},"labels":[],"label_agreement":null},{"id":"W2405338386","doi":"","title":"Restricted arc-connectivity of digraphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Geometry","score_opus":0.010046070011547937,"score_gpt":0.2185926251496004,"score_spread":0.20854655513805245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405338386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31779745,0.003191594,0.44051522,0.0017967104,0.0003149846,0.00017089506,0.0042183236,0.0012869835,0.23070793],"genre_scores_gemma":[0.9373381,0.001940609,0.035633236,0.0003501412,0.00018458342,0.00013548697,0.002784782,0.00016545874,0.021467619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.0001814799,0.00005498497,0.0002022006,0.0001334396,0.00008558494],"domain_scores_gemma":[0.9974293,0.0014599059,0.00027833806,0.0003998199,0.0002410704,0.00019158465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036210904,0.0003792269,0.00043809676,0.0012286964,0.00062312366,0.001684111,0.00086365355,0.00065277854,0.013914027],"category_scores_gemma":[0.0036226748,0.00035459417,0.0005039383,0.0014032852,0.0009101749,0.0035408677,0.0010312373,0.001223595,0.0016844567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009791529,0.000051682633,0.0011321651,0.00035618382,0.000052799278,0.0004645785,0.00027283878,0.008858282,0.0037086704,0.94122756,0.0074955225,0.036281694],"study_design_scores_gemma":[0.000028988674,0.000038228904,0.0009774241,0.000060449165,0.00004266398,0.0009629788,0.00012247292,0.023814881,0.0017691127,0.95283836,0.019326124,0.000018180031],"about_ca_topic_score_codex":0.00077308645,"about_ca_topic_score_gemma":0.0011099201,"teacher_disagreement_score":0.013914027,"about_ca_system_score_codex":0.0005283152,"about_ca_system_score_gemma":0.00031576338,"threshold_uncertainty_score":0.046547055},"labels":[],"label_agreement":null},{"id":"W2405891861","doi":"","title":"Digital Design Using VHDL: A Systems Approach","year":2016,"lang":"en","type":"book","venue":"Medical Entomology and Zoology","topic":"Interconnection Networks and Systems","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 British Columbia","funders":"","keywords":"VHDL; Computer science; Computer architecture; Software engineering; Perspective (graphical); Computer engineering; Programming language; Engineering drawing; Embedded system; Field-programmable gate array; Engineering; Artificial intelligence","score_opus":0.03101818473980621,"score_gpt":0.24600470010083644,"score_spread":0.21498651536103022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405891861","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010025343,0.0033000053,0.9117132,0.00092245964,0.0005983247,0.00011553744,0.00021129218,0.0025513198,0.0795854],"genre_scores_gemma":[0.041834243,0.015581181,0.80250126,0.0013021601,0.00063614245,0.00045442456,0.0008562845,0.001471779,0.13536249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994067,0.000120683486,0.000047681446,0.000055966215,0.00032943932,0.000039641356],"domain_scores_gemma":[0.9995197,0.00020234432,0.000018521283,0.0000587548,0.00017549476,0.000025205283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000642718,0.0008124192,0.00044562411,0.00095991103,0.00043634378,0.003735541,0.0015496182,0.0010132167,0.01731789],"category_scores_gemma":[0.0013697996,0.0005596893,0.000477516,0.0008721348,0.0009580974,0.0019047834,0.001119086,0.0022121368,0.009248895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040608422,0.000052886746,0.0001772864,0.0011349312,0.00003757449,0.00034842078,0.00079106574,0.028465945,0.015213071,0.53645164,0.056264564,0.36102203],"study_design_scores_gemma":[0.00002179508,0.000056648114,0.00009671116,0.00033728208,0.000021964848,0.00050233706,0.00016205203,0.021572882,0.0067151124,0.094811514,0.8756772,0.000024511644],"about_ca_topic_score_codex":0.00096114055,"about_ca_topic_score_gemma":0.00089081185,"teacher_disagreement_score":0.01731789,"about_ca_system_score_codex":0.0010959776,"about_ca_system_score_gemma":0.0009806051,"threshold_uncertainty_score":0.057934105},"labels":[],"label_agreement":null},{"id":"W2406787877","doi":"","title":"On constructions of infinite families of k-tight optimal double-loop networks.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Combinatorics; Business","score_opus":0.011532152093615858,"score_gpt":0.23139718019724215,"score_spread":0.2198650281036263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406787877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15222308,0.0012643803,0.75902563,0.0008381923,0.00012358822,0.000114666385,0.0004507212,0.0010904553,0.08486929],"genre_scores_gemma":[0.8112981,0.0011633404,0.17166905,0.00032287164,0.000059991664,0.00030823026,0.0007182647,0.00039453266,0.014065697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992348,0.00024656876,0.00004430961,0.00013884366,0.00016772264,0.00016772967],"domain_scores_gemma":[0.99753606,0.0014277205,0.00022006201,0.00035999948,0.00023781716,0.00021827951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103839,0.0006821575,0.0006720998,0.0011588422,0.0017413617,0.002098045,0.0014514303,0.00088683644,0.010180137],"category_scores_gemma":[0.0074193464,0.0007621167,0.00075326744,0.0012154191,0.0017983468,0.0041837576,0.0029619655,0.001969402,0.0014660422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120059274,0.000047876663,0.0005509958,0.00018011466,0.00002381829,0.00015802201,0.00054620404,0.034192476,0.0027721312,0.92602175,0.004474998,0.030911494],"study_design_scores_gemma":[0.000034070046,0.00004747204,0.0003009748,0.00013903607,0.000028547332,0.00022216947,0.00026578695,0.093318485,0.0024040516,0.8909876,0.012217248,0.00003460934],"about_ca_topic_score_codex":0.0009120757,"about_ca_topic_score_gemma":0.0014283049,"teacher_disagreement_score":0.010180137,"about_ca_system_score_codex":0.0015959479,"about_ca_system_score_gemma":0.0006877201,"threshold_uncertainty_score":0.034056008},"labels":[],"label_agreement":null},{"id":"W2407230819","doi":"","title":"On restricted edge connectivity of strong product graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Combinatorics; Computer science; Artificial intelligence; Geometry","score_opus":0.027725665696173244,"score_gpt":0.250759130913431,"score_spread":0.22303346521725775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407230819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49719593,0.0032791526,0.3422491,0.003232826,0.00035018995,0.0001372896,0.0014766118,0.0004555528,0.15162332],"genre_scores_gemma":[0.9539908,0.0026627837,0.02668968,0.0005305318,0.00049896137,0.00020931756,0.0013019942,0.00016220857,0.013953752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992507,0.00028399428,0.000040955452,0.00017098151,0.00015159034,0.00010163318],"domain_scores_gemma":[0.993845,0.004249324,0.0005980473,0.0005085136,0.00042240557,0.00037672106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007207978,0.00053110754,0.00060993154,0.0017554623,0.0009629728,0.0015345081,0.0010366688,0.0010351316,0.010652873],"category_scores_gemma":[0.0068372795,0.0004668585,0.0005145464,0.0017114745,0.0020200163,0.0059119826,0.0017287099,0.0016942951,0.00097612286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010702021,0.00004074973,0.001089175,0.0001970266,0.000032329004,0.00026337357,0.00029714886,0.009358554,0.0017609894,0.9635299,0.005792304,0.017531365],"study_design_scores_gemma":[0.000023816063,0.000037236987,0.000886903,0.00004693632,0.000022970533,0.0003527658,0.00013955118,0.024351992,0.0004948987,0.968483,0.0051465225,0.000013280651],"about_ca_topic_score_codex":0.0008074705,"about_ca_topic_score_gemma":0.001051969,"teacher_disagreement_score":0.010652873,"about_ca_system_score_codex":0.0005993793,"about_ca_system_score_gemma":0.00030802193,"threshold_uncertainty_score":0.03563738},"labels":[],"label_agreement":null},{"id":"W2407309435","doi":"","title":"On Some Properties of Cages.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Mathematics; Cage; Combinatorics; Graph; Girth (graph theory); Discrete mathematics","score_opus":0.015348732664037603,"score_gpt":0.2023332096057612,"score_spread":0.1869844769417236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407309435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3755513,0.014092555,0.40115067,0.007081273,0.00065600115,0.00018700649,0.002249811,0.0006021717,0.19842917],"genre_scores_gemma":[0.9277289,0.008596613,0.04520612,0.001528667,0.0011527996,0.00029742325,0.0014086139,0.00026891613,0.013811904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993006,0.00020224905,0.000040074785,0.00017527015,0.00016892594,0.00011297066],"domain_scores_gemma":[0.9954939,0.0027015756,0.00063753256,0.00038909714,0.00044942342,0.0003284871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092369836,0.0006054752,0.0005989156,0.0021545354,0.001446996,0.0014677955,0.00092613685,0.0011312228,0.0071865236],"category_scores_gemma":[0.006044101,0.00039145045,0.0007218675,0.0018607776,0.0029087425,0.0054018865,0.0015855763,0.0013300141,0.0008731567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006856566,0.000036255755,0.0024271724,0.0001932867,0.000031803753,0.00029104424,0.00048906315,0.0073961033,0.003596624,0.96173495,0.0070343902,0.016700663],"study_design_scores_gemma":[0.000026026462,0.00013982986,0.003132811,0.000106341446,0.0000521058,0.0013103483,0.00053981884,0.02805894,0.0030921565,0.93429345,0.029207049,0.000041090578],"about_ca_topic_score_codex":0.001160722,"about_ca_topic_score_gemma":0.00083708245,"teacher_disagreement_score":0.0071865236,"about_ca_system_score_codex":0.00076786877,"about_ca_system_score_gemma":0.0002851325,"threshold_uncertainty_score":0.024041355},"labels":[],"label_agreement":null},{"id":"W2408501675","doi":"","title":"Super-λ Connectivity of Bipartite Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Graph","score_opus":0.0109780438492236,"score_gpt":0.22100598085830148,"score_spread":0.21002793700907788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408501675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47605598,0.001787801,0.30704302,0.0033806518,0.00035573644,0.000084131214,0.0012468977,0.00077555585,0.20927021],"genre_scores_gemma":[0.96190137,0.0010188116,0.01858738,0.0005064444,0.00029231032,0.00010678779,0.0005834362,0.00010910511,0.016894381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993711,0.00017959776,0.000022701952,0.00014071753,0.00016891434,0.00011688376],"domain_scores_gemma":[0.99599504,0.0023785776,0.0005081921,0.00033842496,0.00037022642,0.0004096175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695419,0.00028029966,0.00037848612,0.0014881372,0.0009815823,0.001341795,0.0008313595,0.00069820613,0.012497459],"category_scores_gemma":[0.0045842705,0.00036643984,0.00040908207,0.0010502472,0.0011804793,0.003277673,0.0011603173,0.0013310506,0.0010524347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006587171,0.000027981461,0.0011041724,0.00012904545,0.000016154507,0.00019755003,0.00018909933,0.005361124,0.0025230672,0.96811956,0.0063902317,0.015876152],"study_design_scores_gemma":[0.000013008004,0.000016652317,0.0010965487,0.000028480865,0.000012906479,0.00035096216,0.00009089356,0.026736908,0.0007335372,0.9643347,0.006575595,0.00000973155],"about_ca_topic_score_codex":0.0008335686,"about_ca_topic_score_gemma":0.0013441695,"teacher_disagreement_score":0.012497459,"about_ca_system_score_codex":0.00079797255,"about_ca_system_score_gemma":0.0003735372,"threshold_uncertainty_score":0.04180813},"labels":[],"label_agreement":null},{"id":"W2413119592","doi":"","title":"Partial cubes without Q − 3 minors","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.02114389951048418,"score_gpt":0.2454413586644351,"score_spread":0.2242974591539509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413119592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7743341,0.00028744762,0.1945376,0.00043322283,0.000047748843,0.00009595994,0.000674723,0.00023466877,0.029354652],"genre_scores_gemma":[0.94162893,0.0002479357,0.044944588,0.00016198421,0.00002798397,0.000101906626,0.00091735565,0.00009073623,0.011878667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976057,0.000040495488,0.000010899047,0.00007140061,0.00005918833,0.000057472545],"domain_scores_gemma":[0.9993161,0.00013925547,0.00020007665,0.0001282813,0.00012034914,0.00009597989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015702877,0.00031419165,0.00030744454,0.00040428794,0.0007178902,0.0010408742,0.0005365476,0.0003435819,0.0055930116],"category_scores_gemma":[0.0009498961,0.00025901894,0.00047606206,0.00066182954,0.0009615633,0.0015368192,0.0011405342,0.00053489703,0.0005943652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021204495,0.000057900856,0.0056635556,0.00014909041,0.000035652396,0.00071516325,0.0005759661,0.023247244,0.0238443,0.9031994,0.0028734,0.03942631],"study_design_scores_gemma":[0.00004838933,0.00018071473,0.00638908,0.000063296575,0.000050276794,0.001931689,0.0012555991,0.1180326,0.024654856,0.80107766,0.046263658,0.000052222542],"about_ca_topic_score_codex":0.00195893,"about_ca_topic_score_gemma":0.0022579846,"teacher_disagreement_score":0.0055930116,"about_ca_system_score_codex":0.0006006073,"about_ca_system_score_gemma":0.00038622096,"threshold_uncertainty_score":0.018710434},"labels":[],"label_agreement":null},{"id":"W2436864742","doi":"10.1109/mcom.2016.7498096","title":"Supporting consumer services in a deterministic industrial internet core network","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Network packet; The Internet; Jitter; Network congestion; Core network; Router; Cloud computing; Distributed computing; Telecommunications","score_opus":0.06981764924760123,"score_gpt":0.3136034562032488,"score_spread":0.24378580695564758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2436864742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30097097,0.0006241523,0.6439593,0.00089934346,0.000103638304,0.00018494387,0.00007384831,0.0011280767,0.052055653],"genre_scores_gemma":[0.88741827,0.00027465235,0.107953675,0.00029154704,0.000030619103,0.00006619368,0.00007877339,0.00004017025,0.0038460328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968517,0.00008904059,0.000012515436,0.000042341395,0.00011838178,0.00005266754],"domain_scores_gemma":[0.9997873,0.000048795388,0.00002416503,0.000033062926,0.0000839652,0.00002267829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004993979,0.0001961531,0.00014720546,0.00021257074,0.00043039152,0.00067745405,0.00056234933,0.0003742092,0.0009173602],"category_scores_gemma":[0.0005935732,0.00018755745,0.00016431983,0.00022182104,0.0002960553,0.0007119126,0.000563294,0.00032952384,0.0002788558],"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.00068881013,0.0003569217,0.008820821,0.0002507431,0.00005027406,0.0010200351,0.0007046412,0.34966826,0.12392944,0.22268473,0.014357802,0.2774675],"study_design_scores_gemma":[0.000058795493,0.00036118095,0.0018927894,0.00004295892,0.00003895061,0.00035013986,0.00021957401,0.9132735,0.018697545,0.023737425,0.041285314,0.00004185435],"about_ca_topic_score_codex":0.0023251902,"about_ca_topic_score_gemma":0.003894177,"teacher_disagreement_score":0.0023251902,"about_ca_system_score_codex":0.00069338764,"about_ca_system_score_gemma":0.00094851153,"threshold_uncertainty_score":0.0050308704},"labels":[],"label_agreement":null},{"id":"W2465608688","doi":"10.1109/tpds.2016.2589934","title":"A Multi-Objective Model Oriented Mapping Approach for NoC-based Computing Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"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 Alberta","funders":"","keywords":"Computer science; Efficient energy use; Control reconfiguration; Speedup; Reliability (semiconductor); Latency (audio); Network on a chip; Simulated annealing; Upper and lower bounds; Distributed computing; Parallel computing; Algorithm; Embedded system","score_opus":0.03765948783194529,"score_gpt":0.24794323133287693,"score_spread":0.21028374350093165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465608688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004912562,0.0004856769,0.9916351,0.0001138927,0.00003329515,0.00004685125,0.000035245386,0.00015014508,0.0025873366],"genre_scores_gemma":[0.33811942,0.0011796927,0.6543885,0.00018710646,0.00007379678,0.0006234263,0.000239593,0.00019442601,0.0049941284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956256,0.00016662083,0.00001965848,0.00006113542,0.00015720284,0.000032878055],"domain_scores_gemma":[0.9997428,0.00011456193,0.0000357114,0.00002578156,0.000067452645,0.0000136916215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094584,0.0012572579,0.00076115463,0.00090709276,0.00041794617,0.0007492865,0.0011519898,0.00068143144,0.0018338532],"category_scores_gemma":[0.001033268,0.0004986925,0.0011122609,0.0008248613,0.0003151745,0.0008138779,0.0008550525,0.000872333,0.00028077737],"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.000010229534,0.000027319998,0.00018568528,0.00008809496,0.00004725738,0.000035945657,0.000024390896,0.9601191,0.0017004499,0.0080879275,0.00046585835,0.029207697],"study_design_scores_gemma":[0.000002637823,0.00002392455,0.000049009628,0.00000715368,0.000010012099,0.000016712305,0.000007577556,0.99502915,0.00034929684,0.0035955568,0.0009052781,0.0000038152484],"about_ca_topic_score_codex":0.0026425552,"about_ca_topic_score_gemma":0.0026777862,"teacher_disagreement_score":0.0026425552,"about_ca_system_score_codex":0.0007091346,"about_ca_system_score_gemma":0.0010416256,"threshold_uncertainty_score":0.0061348677},"labels":[],"label_agreement":null},{"id":"W24676266","doi":"10.1016/b978-0-12-394298-2.00006-5","title":"Substrate-Integrated Antennas on Silicon","year":2012,"lang":"en","type":"book-chapter","venue":"Advances in imaging and electron physics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bluetooth; Wireless; Computer science; Electrical engineering; Chip; Electronic engineering; Communications system; Integrated circuit; Communications satellite; Telecommunications; Engineering; Satellite; Aerospace engineering","score_opus":0.009273902611087192,"score_gpt":0.2453504608641005,"score_spread":0.23607655825301332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24676266","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11761548,0.05046137,0.15022781,0.001050902,0.0033728024,0.000055440803,0.00036143675,0.0015712422,0.67528343],"genre_scores_gemma":[0.5267965,0.035460632,0.06719873,0.000399959,0.0007041108,0.000059909606,0.0006565138,0.00044117423,0.3682825],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999337,0.0000046509804,0.0000022381594,0.000013455826,0.000035444617,0.000010558075],"domain_scores_gemma":[0.9999634,0.000008310071,0.0000035780254,0.000008789632,0.000013296563,0.0000025517131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045888104,0.0004196957,0.00032958947,0.00019150414,0.000107411106,0.00077206676,0.0005307809,0.00047654516,0.0036462934],"category_scores_gemma":[0.00009810314,0.0003248571,0.00020240272,0.00045782406,0.00019614598,0.0006173136,0.00036827038,0.00062787614,0.0029899946],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00010684906,0.00006154814,0.00035009359,0.0010209056,0.00006798764,0.0004603032,0.00030961042,0.013488936,0.42773822,0.21858019,0.037948746,0.29986668],"study_design_scores_gemma":[0.00004264709,0.0004098539,0.0021282448,0.00029908313,0.00007208384,0.001720143,0.00021044291,0.04967161,0.27281585,0.052510157,0.62005734,0.00006255686],"about_ca_topic_score_codex":0.00016173076,"about_ca_topic_score_gemma":0.0003825234,"teacher_disagreement_score":0.0036462934,"about_ca_system_score_codex":0.00027292245,"about_ca_system_score_gemma":0.00010796768,"threshold_uncertainty_score":0.012198031},"labels":[],"label_agreement":null},{"id":"W2475475907","doi":"10.1109/tetc.2016.2594957","title":"Efficient Performance Evaluation of Multi-Core SIMT Processors with Hot Redundancy","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Computer science; Redundancy (engineering); Parallel computing; Multi-core processor; Operating system","score_opus":0.05180314228324294,"score_gpt":0.30056042389013726,"score_spread":0.2487572816068943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475475907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89956206,0.0005026424,0.08805763,0.00024384022,0.00003110167,0.00007663647,0.0004415334,0.001889031,0.009195472],"genre_scores_gemma":[0.98382056,0.000075076234,0.014977696,0.000024059871,0.000009074738,0.000034085468,0.00023765047,0.00007728467,0.0007445033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931943,0.00017502508,0.000029933239,0.00008634822,0.00029429718,0.0000950356],"domain_scores_gemma":[0.998295,0.0008702015,0.00019091796,0.00022797713,0.00036878043,0.00004713089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272523,0.00073142006,0.0004162226,0.0007221582,0.00027089828,0.0004489361,0.00071483856,0.00036198273,0.002229675],"category_scores_gemma":[0.0029344857,0.000253251,0.00035715036,0.00080663717,0.00043095887,0.0007277022,0.00041504094,0.0003728285,0.00036416177],"study_design_candidate":"bench_or_experimental","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.00087173417,0.00012358738,0.006081134,0.00021446109,0.00006546035,0.00021727922,0.000098542696,0.91245914,0.030546544,0.003081106,0.0013991344,0.0448419],"study_design_scores_gemma":[0.000015664355,0.00023553775,0.0011860892,0.0000045604525,0.000008633437,0.00003260363,0.000019648702,0.9795725,0.018085577,0.0005194787,0.0003142569,0.0000055217274],"about_ca_topic_score_codex":0.0010630955,"about_ca_topic_score_gemma":0.0012460479,"teacher_disagreement_score":0.002229675,"about_ca_system_score_codex":0.0006981565,"about_ca_system_score_gemma":0.00057088706,"threshold_uncertainty_score":0.007458985},"labels":[],"label_agreement":null},{"id":"W2482039329","doi":"10.1109/ipdpsw.2016.44","title":"Topology-Aware GPU Selection on Multi-GPU Nodes","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":25,"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":"Computer science; GPU cluster; Node (physics); Parallel computing; General-purpose computing on graphics processing units; CUDA; Traverse; Supercomputer; Latency (audio); Network topology; Process (computing); Scheme (mathematics); Efficient energy use; Topology (electrical circuits); Distributed computing; Computer network; Graphics; Computer graphics (images); Telecommunications","score_opus":0.02641949303651304,"score_gpt":0.2626504744792607,"score_spread":0.23623098144274768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482039329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6937332,0.00042764383,0.29537702,0.00023879767,0.00011562709,0.00010060707,0.000096961536,0.0018869251,0.008023248],"genre_scores_gemma":[0.94383657,0.00008592711,0.054089777,0.00003330614,0.000016003352,0.00003818211,0.00010546944,0.000059148548,0.0017355902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995883,0.0001464547,0.000018229632,0.00006860143,0.000103299186,0.00007512245],"domain_scores_gemma":[0.99923885,0.00018256597,0.00008407246,0.00021062951,0.00015374974,0.00013010808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028978655,0.00034155673,0.00043721872,0.0004092408,0.00069406,0.00048559724,0.0010270801,0.0003173045,0.0013519755],"category_scores_gemma":[0.0014116734,0.00017540154,0.00015520434,0.0005193937,0.00029191867,0.0008454448,0.00087905617,0.00033372614,0.0004164625],"study_design_candidate":"bench_or_experimental","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.0012612459,0.00028403278,0.012803428,0.00020727467,0.00007135426,0.0011450038,0.0007145529,0.45633653,0.2641177,0.017961983,0.007458705,0.23763822],"study_design_scores_gemma":[0.00003523246,0.00018742046,0.0018972639,0.000007577849,0.000015579506,0.00015629249,0.0001344326,0.9463389,0.04412951,0.0027904431,0.0042874673,0.000019940504],"about_ca_topic_score_codex":0.0013985038,"about_ca_topic_score_gemma":0.0028627412,"teacher_disagreement_score":0.0013985038,"about_ca_system_score_codex":0.00053647347,"about_ca_system_score_gemma":0.0004226666,"threshold_uncertainty_score":0.00452286},"labels":[],"label_agreement":null},{"id":"W2482041307","doi":"10.1145/2866572","title":"Path Selection for Real-Time Communication on Priority-Aware NoCs","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Computer science; Multiprocessing; Heuristics; Distributed computing; Selection algorithm; Router; Network on a chip; Routing (electronic design automation); Path (computing); Computer network; Selection (genetic algorithm); Parallel computing","score_opus":0.020207549062080967,"score_gpt":0.25436278458381406,"score_spread":0.2341552355217331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482041307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09430217,0.00097579026,0.90070677,0.00017680951,0.00007336477,0.0001210319,0.000044344033,0.0010431518,0.0025566218],"genre_scores_gemma":[0.61941516,0.00038369113,0.37811378,0.00006091609,0.000033347253,0.00008289361,0.00010275411,0.00011005502,0.00169733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993236,0.00024956666,0.000038325717,0.00010057522,0.00018210898,0.00010581203],"domain_scores_gemma":[0.9979971,0.0011563362,0.0003046354,0.0001823765,0.00026874107,0.0000906993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011387662,0.000700073,0.00038702923,0.0011409606,0.00077809155,0.00065736665,0.0008997452,0.00039072303,0.0017403506],"category_scores_gemma":[0.0037639188,0.00035994966,0.00032266192,0.0007031859,0.00046686656,0.0011223033,0.0006209263,0.00045637507,0.0002198364],"study_design_candidate":"bench_or_experimental","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.00050667115,0.00014400561,0.0024425392,0.00029220755,0.00008137994,0.00024288426,0.000346897,0.6648794,0.030645775,0.016780697,0.002164978,0.28147265],"study_design_scores_gemma":[0.000037134647,0.0001598855,0.0003577362,0.000016015585,0.000029632536,0.000100923666,0.00007180932,0.98077434,0.00706788,0.009374853,0.0019941824,0.00001567587],"about_ca_topic_score_codex":0.0024594222,"about_ca_topic_score_gemma":0.00441626,"teacher_disagreement_score":0.0024594222,"about_ca_system_score_codex":0.0009258347,"about_ca_system_score_gemma":0.0012944661,"threshold_uncertainty_score":0.0067174435},"labels":[],"label_agreement":null},{"id":"W2482613298","doi":"10.1109/ipdpsw.2016.146","title":"PTRAM: A Parallel Topology-and Routing-Aware Mapping Framework for Large-Scale HPC Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; Ontario Innovation Trust","keywords":"Computer science; Scalability; Heuristics; Metric (unit); Heuristic; Routing (electronic design automation); Distributed computing; Greedy algorithm; Network topology; Process (computing); Scale (ratio); Benchmark (surveying); Topology (electrical circuits); Parallel computing; Algorithm; Mathematics; Computer network; Database; Artificial intelligence","score_opus":0.024841564632358103,"score_gpt":0.2615407005524002,"score_spread":0.2366991359200421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482613298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005090622,0.00020684532,0.97884125,0.000082020495,0.00004398194,0.000092229195,0.00019523954,0.013345706,0.0021020856],"genre_scores_gemma":[0.12224502,0.0003874567,0.8713061,0.00008134222,0.00003900045,0.00034240854,0.00088772946,0.0018624794,0.0028483844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996494,0.00008647209,0.00001859613,0.000047750735,0.00015602117,0.000041799343],"domain_scores_gemma":[0.9996082,0.00010707417,0.000049984763,0.00012185798,0.00007135215,0.000041545936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080328673,0.0009880979,0.00065452815,0.0009759175,0.00082018995,0.0011016709,0.002442413,0.0007452917,0.004484502],"category_scores_gemma":[0.001517252,0.0005674281,0.0009438683,0.0010178006,0.00051871594,0.0016200044,0.0013727314,0.0011302436,0.00095329783],"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.00021050664,0.0001819729,0.0017233475,0.00046710068,0.00018331916,0.00031944623,0.00026870816,0.62784433,0.023366587,0.04464318,0.021967556,0.27882397],"study_design_scores_gemma":[0.00003894836,0.000063691026,0.00028498017,0.000017614735,0.00002472542,0.00012848162,0.00003953546,0.9627558,0.0061357236,0.016738132,0.013740623,0.00003175509],"about_ca_topic_score_codex":0.0048751743,"about_ca_topic_score_gemma":0.009539478,"teacher_disagreement_score":0.0048751743,"about_ca_system_score_codex":0.0008033522,"about_ca_system_score_gemma":0.0015838463,"threshold_uncertainty_score":0.015002191},"labels":[],"label_agreement":null},{"id":"W2483506508","doi":"10.1016/j.dam.2016.06.015","title":"Minimum multiple originator broadcast graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Broadcasting (networking); Graph; Mathematics; Computer science; Set (abstract data type); Combinatorics; Computer network; Programming language","score_opus":0.013605648335715044,"score_gpt":0.22810287778523688,"score_spread":0.21449722944952185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483506508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31082356,0.0007324221,0.62470144,0.0027585295,0.00022214769,0.0002764174,0.0020664295,0.0011881312,0.057231005],"genre_scores_gemma":[0.84754926,0.0006797757,0.1149406,0.0004461704,0.00014547634,0.00035685155,0.0015587885,0.00040592637,0.03391711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.0002587062,0.00003824926,0.00017893719,0.00014221155,0.0001411031],"domain_scores_gemma":[0.9940019,0.0034149885,0.0006626195,0.0006939304,0.0007709686,0.0004555598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535201,0.0007163809,0.0013408037,0.0009624656,0.0013312242,0.0018908926,0.0023799457,0.0014910409,0.011358844],"category_scores_gemma":[0.00530197,0.00080761174,0.0005526535,0.001256661,0.0006837907,0.0026791121,0.0017262166,0.0021495197,0.0014559604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019688443,0.00023764867,0.001814787,0.0010674988,0.00021734557,0.00055426656,0.0009903776,0.08533954,0.0296824,0.7600702,0.027833957,0.090223186],"study_design_scores_gemma":[0.000616307,0.00033482988,0.00146838,0.0001751622,0.0002496035,0.00066115113,0.00056211936,0.32994658,0.015756907,0.62995714,0.02020149,0.00007029884],"about_ca_topic_score_codex":0.000832196,"about_ca_topic_score_gemma":0.0019826188,"teacher_disagreement_score":0.011358844,"about_ca_system_score_codex":0.0013676962,"about_ca_system_score_gemma":0.0010054326,"threshold_uncertainty_score":0.037999153},"labels":[],"label_agreement":null},{"id":"W2492478402","doi":"10.1007/978-1-4615-4559-0_4","title":"End-To-End Delay Bounds and Buffer Sizing","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jitter; Sizing; Provisioning; Computer science; Path (computing); Property (philosophy); Buffer (optical fiber); Computer network; Topology (electrical circuits); Mathematical optimization; Algorithm; Mathematics; Telecommunications; Combinatorics","score_opus":0.016635871035603978,"score_gpt":0.21770587475661593,"score_spread":0.20107000372101194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492478402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003060467,0.017385172,0.846223,0.0010010558,0.0012620063,0.000046891615,0.00029453603,0.0014546162,0.12927224],"genre_scores_gemma":[0.22140884,0.048706673,0.44779715,0.0011518508,0.0021303878,0.00039991003,0.0011795186,0.002536018,0.2746897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.000080058446,0.00003733424,0.00015106575,0.00035776518,0.00006886768],"domain_scores_gemma":[0.99824023,0.00105205,0.00007867532,0.00029134215,0.00029971186,0.000037948368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010654199,0.0023470202,0.001102642,0.0010872736,0.00054868136,0.0029993113,0.0026628303,0.0012005647,0.015835103],"category_scores_gemma":[0.003931887,0.0010123873,0.00041967232,0.0014803637,0.0010389363,0.0058597056,0.0010406441,0.0033667788,0.0064241625],"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.00016193527,0.00008430361,0.00011766748,0.0005080175,0.00002752053,0.0000719315,0.00009486885,0.1125929,0.008013191,0.47051316,0.03491051,0.372904],"study_design_scores_gemma":[0.000024622643,0.00009392213,0.00024349328,0.00036571815,0.00006137885,0.00024407731,0.000052748383,0.2145544,0.0172809,0.6188758,0.14814478,0.00005814819],"about_ca_topic_score_codex":0.000905865,"about_ca_topic_score_gemma":0.001415254,"teacher_disagreement_score":0.015835103,"about_ca_system_score_codex":0.0019629651,"about_ca_system_score_gemma":0.0009358721,"threshold_uncertainty_score":0.052973688},"labels":[],"label_agreement":null},{"id":"W2493595568","doi":"","title":"Adaptive mutation for semi-separable problems","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","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":"Université de Sherbrooke","funders":"","keywords":"Mutation; Travelling salesman problem; Adaptive mutation; Heuristic; Operator (biology); Computer science; Fitness landscape; Mathematical optimization; Mutation rate; Separable space; Genetic algorithm; Mathematics; Artificial intelligence; Algorithm; Biology; Genetics; Population","score_opus":0.03333412693013239,"score_gpt":0.24604613352736351,"score_spread":0.2127120065972311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493595568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03086978,0.00048351337,0.96342677,0.00032431877,0.00008774249,0.00006234466,0.000023852803,0.00015538858,0.004566188],"genre_scores_gemma":[0.5890303,0.0007047036,0.40049645,0.00022540045,0.0001360925,0.00027006914,0.00011181838,0.00011489684,0.0089103235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.00023257291,0.00003501017,0.000096248004,0.00026785475,0.000059831316],"domain_scores_gemma":[0.9986387,0.0008870723,0.00012919215,0.000114539456,0.00015150703,0.000079015525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012835298,0.00064410013,0.0007821222,0.0006653059,0.00048526845,0.0007609537,0.0009678367,0.00081658975,0.0021134927],"category_scores_gemma":[0.0044238036,0.00024426915,0.0007016634,0.0005890808,0.0013929649,0.001191844,0.0016234546,0.0012831411,0.00033690705],"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.00014098446,0.00008919601,0.0007349627,0.00023858709,0.00008854096,0.0004243715,0.00019155294,0.5069225,0.008508151,0.38468608,0.0024717997,0.095503315],"study_design_scores_gemma":[0.00005072161,0.00006523799,0.00012202809,0.000013032774,0.000011384106,0.00014268882,0.000023771086,0.8911648,0.0011073169,0.10450577,0.0027820398,0.000011144163],"about_ca_topic_score_codex":0.0009689623,"about_ca_topic_score_gemma":0.00090442266,"teacher_disagreement_score":0.0021134927,"about_ca_system_score_codex":0.0006485225,"about_ca_system_score_gemma":0.00062747265,"threshold_uncertainty_score":0.007070303},"labels":[],"label_agreement":null},{"id":"W2517521348","doi":"10.5555/2001196.2001199","title":"Effect of serialized routing resources on the implementation area of datapath circuits on FPGAS","year":2010,"lang":"en","type":"article","venue":"WSEAS Transactions on Computers archive","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":"Toronto Metropolitan University","funders":"","keywords":"Datapath; Computer science; Field-programmable gate array; Serialization; Routing (electronic design automation); Embedded system; Parallel computing","score_opus":0.012427591859798458,"score_gpt":0.25871668342850823,"score_spread":0.24628909156870976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517521348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96467006,0.0012464009,0.027587615,0.00016123503,0.00008191569,0.000046025576,0.0001388698,0.0008960454,0.00517183],"genre_scores_gemma":[0.97680783,0.00043587765,0.020106766,0.00010207551,0.0000308883,0.000038384,0.00023136927,0.00013642783,0.0021104247],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988471,0.00023181799,0.000106108506,0.00019178016,0.00041733525,0.00020576517],"domain_scores_gemma":[0.9944494,0.0027137538,0.0011582293,0.0007773077,0.0008046846,0.00009669614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070951384,0.00080828957,0.00035932686,0.0007077277,0.000257648,0.0006229482,0.0011200946,0.00030427397,0.0032732638],"category_scores_gemma":[0.003175815,0.00030479894,0.00033675643,0.00087060465,0.00029482247,0.001536253,0.00036283387,0.0004237488,0.00034216832],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.001976732,0.00052777864,0.017590592,0.00070380414,0.00023830695,0.0007172554,0.00018079884,0.3498565,0.37653288,0.0033267287,0.0023538945,0.2459948],"study_design_scores_gemma":[0.00011405875,0.0046833777,0.017413972,0.00005775031,0.00033201868,0.0007271484,0.00015725837,0.36406234,0.6030444,0.0009915141,0.008351468,0.000064623266],"about_ca_topic_score_codex":0.00088726456,"about_ca_topic_score_gemma":0.0013458368,"teacher_disagreement_score":0.0032732638,"about_ca_system_score_codex":0.00076234515,"about_ca_system_score_gemma":0.00049104507,"threshold_uncertainty_score":0.010950208},"labels":[],"label_agreement":null},{"id":"W2520334714","doi":"10.1109/hpcsim.2016.7568321","title":"Dynamic virtual channel and index-based arbitration based Network on Chip router architecture","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Faculty of Engineering and Architectural Science, Ryerson University","keywords":"Router; Network on a chip; Computer science; Core router; Virtual channel; One-armed router; Computer network; Arbitration; Embedded system; Network packet; Channel (broadcasting)","score_opus":0.007825265456110862,"score_gpt":0.20636775393920087,"score_spread":0.19854248848309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520334714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1427272,0.0012593452,0.8404059,0.00027599974,0.00023403208,0.00014756726,0.0001553719,0.00279019,0.012004378],"genre_scores_gemma":[0.7993765,0.00028166344,0.19552737,0.00013520755,0.000044364795,0.0001183481,0.00021271982,0.00005249742,0.0042513916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967337,0.00007831259,0.000033036282,0.000066951354,0.00010097761,0.000047475074],"domain_scores_gemma":[0.99967873,0.000059459104,0.000050123428,0.00006577909,0.00012146407,0.000024390845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003615244,0.00023289879,0.00032935673,0.00046403785,0.0002950069,0.000599529,0.0013913945,0.00038144624,0.0015673887],"category_scores_gemma":[0.000620897,0.00012446522,0.00025439085,0.0004143655,0.00027741454,0.0007378831,0.0003437701,0.00028478118,0.00018980626],"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.000678459,0.00034657712,0.0045627947,0.00040431062,0.0001917356,0.0004780131,0.00019482175,0.37903747,0.2301068,0.07628092,0.007271664,0.30044642],"study_design_scores_gemma":[0.00004859932,0.00044814745,0.0009121803,0.00001125662,0.000068142705,0.00033635832,0.000014055245,0.9484466,0.035894528,0.0048844353,0.008897704,0.000038085993],"about_ca_topic_score_codex":0.0009832629,"about_ca_topic_score_gemma":0.0016243082,"teacher_disagreement_score":0.0015673887,"about_ca_system_score_codex":0.0005620152,"about_ca_system_score_gemma":0.00065382494,"threshold_uncertainty_score":0.00524348},"labels":[],"label_agreement":null},{"id":"W2523891007","doi":"10.1109/fpl.2016.7577318","title":"LYNX: CAD for FPGA-based networks-on-chip","year":2016,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"CAD; Computer science; Field-programmable gate array; Latency (audio); Network on a chip; Database transaction; Arbitration; Embedded system; Computer architecture; FPGA prototype; Throughput; Design flow; Chip; Computer hardware; Computer network; Wireless; Telecommunications; Engineering","score_opus":0.023333984812916153,"score_gpt":0.24305990597836882,"score_spread":0.21972592116545267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523891007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016251229,0.0012450333,0.8392872,0.0004573583,0.00047829867,0.00046984717,0.0035422912,0.057475053,0.08079362],"genre_scores_gemma":[0.15467535,0.0011738265,0.76110446,0.0003979293,0.00009601792,0.001128423,0.006745848,0.010224558,0.06445357],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992637,0.00012160705,0.000036221103,0.000057940586,0.0004588286,0.00006163656],"domain_scores_gemma":[0.99945277,0.00019105991,0.000038004753,0.000085714,0.0002015114,0.000030939813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985928,0.0009889035,0.00042912646,0.0010084088,0.0003308658,0.0010142699,0.0014002909,0.00060614705,0.058480013],"category_scores_gemma":[0.0019051234,0.00062882743,0.0003521699,0.00050535734,0.00030501027,0.0009351612,0.0006494753,0.0012054353,0.0080455085],"study_design_candidate":"bench_or_experimental","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.00056058954,0.00013538169,0.003061178,0.0017110023,0.00011408787,0.00090299797,0.0005027388,0.10086651,0.06661943,0.09838861,0.23757328,0.48956412],"study_design_scores_gemma":[0.0004020408,0.00033124557,0.0018984372,0.00025067176,0.000059510978,0.0009167382,0.000071644696,0.33582217,0.051336695,0.009401105,0.59937143,0.00013840069],"about_ca_topic_score_codex":0.0020751443,"about_ca_topic_score_gemma":0.003604351,"teacher_disagreement_score":0.058480013,"about_ca_system_score_codex":0.0006921154,"about_ca_system_score_gemma":0.001017374,"threshold_uncertainty_score":0.19563514},"labels":[],"label_agreement":null},{"id":"W2529730326","doi":"10.1109/tac.2016.2596758","title":"Deadlock Analysis of Parameterized-Chain Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Interconnection Networks and Systems","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Undecidable problem; Deadlock; Dependency graph; Dependency (UML); Key (lock); Deadlock prevention algorithms; Graph","score_opus":0.011029061779976913,"score_gpt":0.22769011258597507,"score_spread":0.21666105080599815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529730326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19171216,0.00020512677,0.8033371,0.000142857,0.000011882988,0.000068847774,0.0001834572,0.00018250772,0.004156119],"genre_scores_gemma":[0.94770694,0.00028052295,0.04919131,0.000041575902,0.000013860345,0.00013511596,0.0003164492,0.00006532466,0.0022489205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999451,0.00017407375,0.00003160784,0.000114840754,0.00013710756,0.00009140896],"domain_scores_gemma":[0.99774456,0.0013175032,0.0003282256,0.00023247061,0.00027218723,0.00010504726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951731,0.0004431059,0.00032801714,0.0006508376,0.00043425077,0.0006217103,0.00094038283,0.00044918183,0.0022002775],"category_scores_gemma":[0.0035859717,0.0002637287,0.0005998388,0.0005668333,0.0011052692,0.001918191,0.0010308449,0.0006253604,0.0000890585],"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.00008539983,0.00004047057,0.0025525545,0.000072746436,0.00004105539,0.00016484452,0.00013691046,0.78718007,0.008394901,0.1907349,0.00034017186,0.010256071],"study_design_scores_gemma":[0.0000042120714,0.00001048845,0.00021079317,0.0000057520056,0.000006014263,0.000018825831,0.000017135737,0.92738354,0.0017689425,0.070064954,0.0005046669,0.0000046462255],"about_ca_topic_score_codex":0.0034979577,"about_ca_topic_score_gemma":0.0024591696,"teacher_disagreement_score":0.0034979577,"about_ca_system_score_codex":0.0015072677,"about_ca_system_score_gemma":0.00096322293,"threshold_uncertainty_score":0.010936022},"labels":[],"label_agreement":null},{"id":"W2532094356","doi":"10.1109/tc.2016.2621045","title":"Design and Applications for Embedded Networks-on-Chip on FPGAs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","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":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Network on a chip; Ethernet; Network packet; Computer architecture; Computer hardware; Computer network","score_opus":0.02557364602422677,"score_gpt":0.24291641780405798,"score_spread":0.21734277177983122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532094356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023243539,0.008662387,0.82585067,0.0009952026,0.00076424406,0.0004548281,0.00021865034,0.003475386,0.13633506],"genre_scores_gemma":[0.2744536,0.009184847,0.617622,0.00083122996,0.0002741027,0.0006948025,0.0007726958,0.0004930408,0.095673636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.000049828566,0.00001931609,0.000022014334,0.000107967615,0.000025660825],"domain_scores_gemma":[0.9998369,0.000036434558,0.000017673565,0.00003138544,0.00006373363,0.000013817662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576527,0.00059414486,0.00017789588,0.00035866394,0.00016779732,0.00054477167,0.0005038797,0.00040914075,0.009177376],"category_scores_gemma":[0.0004946155,0.00019190482,0.0002280209,0.00029432142,0.00018380946,0.0003697586,0.00024363695,0.00047777256,0.0027781904],"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.00012055604,0.000111827074,0.0016194588,0.0009948995,0.000065728964,0.0008730132,0.00018975281,0.06587096,0.09326592,0.14243652,0.04098408,0.6534672],"study_design_scores_gemma":[0.00009791739,0.0003690599,0.0017696369,0.00032161086,0.000064973494,0.0016756996,0.00007969166,0.17319044,0.052991103,0.034396205,0.7350018,0.000041849547],"about_ca_topic_score_codex":0.00042761696,"about_ca_topic_score_gemma":0.0009830128,"teacher_disagreement_score":0.009177376,"about_ca_system_score_codex":0.00036227168,"about_ca_system_score_gemma":0.00034574416,"threshold_uncertainty_score":0.030701399},"labels":[],"label_agreement":null},{"id":"W2532807735","doi":"10.1016/j.dam.2016.09.029","title":"Efficient broadcast trees for weighted vertices","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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); Dissemination; Mathematics; Node (physics); Binary logarithm; Computer science; Set (abstract data type); Time complexity; Combinatorics; Theoretical computer science; Computer network; Graph","score_opus":0.015630578426276638,"score_gpt":0.2396631979087195,"score_spread":0.22403261948244288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532807735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09766738,0.0005557669,0.88564473,0.0006600006,0.00014755232,0.00023598818,0.001033277,0.0011645348,0.012890803],"genre_scores_gemma":[0.58388704,0.0009325598,0.38513368,0.0002596339,0.00014653249,0.0004100085,0.0019661966,0.00059603766,0.026668292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00013521015,0.000037813134,0.00011825461,0.00021683723,0.00016722169],"domain_scores_gemma":[0.9977996,0.0011246343,0.0001554428,0.00046374043,0.00032179087,0.00013478316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059865194,0.00064031366,0.0011817056,0.00089039386,0.00086704694,0.0018374142,0.0015011173,0.0008500224,0.006926272],"category_scores_gemma":[0.005031041,0.0005557699,0.00058805756,0.0018329463,0.00059046247,0.0025034847,0.0015753837,0.001515445,0.0013784459],"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.0010573661,0.0003090265,0.00094737543,0.0007302073,0.00012628738,0.00025008575,0.00051059306,0.28563547,0.028906086,0.32633525,0.02798459,0.3272076],"study_design_scores_gemma":[0.00014007166,0.0001084775,0.00030029964,0.000055706987,0.00007733663,0.000098695025,0.00014172358,0.62545675,0.007313912,0.3581156,0.008171255,0.000020124962],"about_ca_topic_score_codex":0.002484625,"about_ca_topic_score_gemma":0.0067653116,"teacher_disagreement_score":0.006926272,"about_ca_system_score_codex":0.001383099,"about_ca_system_score_gemma":0.001360093,"threshold_uncertainty_score":0.02317065},"labels":[],"label_agreement":null},{"id":"W2535384655","doi":"10.1109/iceec.2004.1374442","title":"Designing fault-tolerant meshes and hypercubes using circulant graphs","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Hypercube; Circulant matrix; Polygon mesh; Computer science; Fault tolerance; Parallel computing; Distributed computing; Theoretical computer science; Algorithm; Computer graphics (images)","score_opus":0.028308937721070824,"score_gpt":0.24203858339846382,"score_spread":0.213729645677393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535384655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11081584,0.0004108791,0.88090783,0.00029596625,0.00020686619,0.00011709908,0.0000673365,0.0007402436,0.0064380304],"genre_scores_gemma":[0.71683043,0.00047224452,0.27894428,0.000233623,0.00009503217,0.00019670422,0.0001403416,0.00015564621,0.0029316305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968207,0.00010973673,0.000019029509,0.00005303137,0.00008332247,0.000052838324],"domain_scores_gemma":[0.99910647,0.0003329081,0.0001507705,0.00013590694,0.00020118662,0.00007272861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004415218,0.0005422529,0.00064048055,0.0007052087,0.00068415864,0.0007085658,0.0010153333,0.00066895253,0.0014764464],"category_scores_gemma":[0.0019511582,0.0004172818,0.00042097573,0.0007220608,0.00036984833,0.0008850658,0.00065785926,0.00048433238,0.00028504495],"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.00031448813,0.00015983528,0.000918754,0.00033251208,0.00010203093,0.0002778032,0.00015534936,0.75736094,0.06733679,0.057067268,0.0043910965,0.11158311],"study_design_scores_gemma":[0.00005296439,0.0002015599,0.00020387225,0.000017160273,0.000037599846,0.00008020321,0.000056499688,0.95345384,0.013732273,0.028975075,0.0031693922,0.000019604939],"about_ca_topic_score_codex":0.0011735036,"about_ca_topic_score_gemma":0.0028037105,"teacher_disagreement_score":0.0014764464,"about_ca_system_score_codex":0.00066981436,"about_ca_system_score_gemma":0.00064817676,"threshold_uncertainty_score":0.0049391985},"labels":[],"label_agreement":null},{"id":"W2536853408","doi":"10.1109/i-span.2012.15","title":"On the Conditional Diagnosability of Cayley Graphs Generated by 2-trees and Related Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Cayley graph; Value (mathematics); Combinatorics; Discrete mathematics; Mathematics; Computer science; Graph; Statistics","score_opus":0.010363557745374626,"score_gpt":0.2108617789984338,"score_spread":0.2004982212530592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536853408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3404359,0.0004744355,0.644056,0.00079650903,0.00007933772,0.000046362096,0.00045314257,0.00041568227,0.013242597],"genre_scores_gemma":[0.97617984,0.0002761221,0.021354202,0.00008841693,0.00005429746,0.000048280268,0.00030710458,0.000044309447,0.0016474572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.00017840574,0.000026123364,0.00013750936,0.00015988054,0.00009627232],"domain_scores_gemma":[0.9900828,0.00813853,0.0005781413,0.00038664538,0.0005380304,0.00027583487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00117365,0.00044365492,0.00042863097,0.00089369895,0.00046395513,0.00093941606,0.0009806103,0.00070229825,0.004776496],"category_scores_gemma":[0.010760471,0.00024208598,0.0004217198,0.00082589826,0.0014679974,0.0030482684,0.00082264893,0.0013578132,0.00020337306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011328752,0.000045551777,0.0014574073,0.00012818244,0.00002640587,0.00026208887,0.00017547233,0.21538818,0.00498236,0.75754344,0.0012636696,0.018614091],"study_design_scores_gemma":[0.000013182714,0.000031524138,0.00046974214,0.000016585838,0.0000103922275,0.000111092246,0.000044738223,0.42558286,0.0020540722,0.5712021,0.00044803106,0.000015759191],"about_ca_topic_score_codex":0.0013781198,"about_ca_topic_score_gemma":0.0015472628,"teacher_disagreement_score":0.004776496,"about_ca_system_score_codex":0.0010246509,"about_ca_system_score_gemma":0.0006633075,"threshold_uncertainty_score":0.015978992},"labels":[],"label_agreement":null},{"id":"W2536859411","doi":"10.1109/idt.2009.5404111","title":"Area and delay optimization for Networks-on-Chip architectures using Genetic Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Computer science; Genetic algorithm; Architecture; Process (computing); Network on a chip; Chip; Computer architecture; Embedded system; Telecommunications","score_opus":0.024814393793112812,"score_gpt":0.25086420948272986,"score_spread":0.22604981568961705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536859411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06161692,0.0010394481,0.9322039,0.00029577664,0.00003740741,0.00008256457,0.000037564205,0.00033109807,0.0043553496],"genre_scores_gemma":[0.5252084,0.0010673014,0.46919507,0.000101058766,0.000040816292,0.00034247557,0.000106029845,0.0001192369,0.0038196547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.00011188932,0.000010265275,0.00003838292,0.00008058863,0.000029405976],"domain_scores_gemma":[0.9995047,0.00034541902,0.000049792612,0.000020993393,0.000066545676,0.000012498078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008069394,0.0008234677,0.0005367118,0.0008557661,0.00036438662,0.000621029,0.0006413326,0.0008608219,0.001189945],"category_scores_gemma":[0.0020220156,0.00039100528,0.00048623848,0.0008026172,0.0005839863,0.0005953106,0.0004377173,0.0005782149,0.00016063832],"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.000010061855,0.000014191763,0.000138546,0.000020059817,0.000014052694,0.000013103099,0.000014669682,0.9769289,0.0010107518,0.0041662976,0.00016959751,0.017499749],"study_design_scores_gemma":[0.000011171461,0.000020557674,0.000053326054,0.0000046054647,0.000008846612,0.000007784996,0.0000065674258,0.9949556,0.0005088267,0.0039698463,0.0004503125,0.0000025956335],"about_ca_topic_score_codex":0.0034993608,"about_ca_topic_score_gemma":0.003706277,"teacher_disagreement_score":0.0034993608,"about_ca_system_score_codex":0.0011072045,"about_ca_system_score_gemma":0.0010958351,"threshold_uncertainty_score":0.008033335},"labels":[],"label_agreement":null},{"id":"W2538574317","doi":"10.1109/icecs.2007.4511160","title":"An FPGA Implementation of a Scalable Network-on-Chip Based on the Token Ring Concept","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Security token; Token ring; Bandwidth (computing); FPGA prototype; Embedded system; Chip; Computer hardware; Computer network; Operating system","score_opus":0.021246574663735553,"score_gpt":0.28611203649829686,"score_spread":0.26486546183456133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538574317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38160965,0.0015462295,0.57462853,0.00029821423,0.0005911333,0.00047858266,0.00058463763,0.006676498,0.033586554],"genre_scores_gemma":[0.7629151,0.00036674543,0.23149914,0.00008059624,0.000034387594,0.00010675058,0.0003017092,0.00006365153,0.004631955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985766,0.000029641738,0.0000071097643,0.000028344373,0.00004632374,0.00003076917],"domain_scores_gemma":[0.9998661,0.000030176941,0.000019153718,0.000029650755,0.000038010396,0.000016788486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865896,0.00029119677,0.00022026566,0.00022665663,0.0001641158,0.0003482271,0.00078866375,0.0002176185,0.0033337434],"category_scores_gemma":[0.00024872404,0.00011762205,0.00015638758,0.00018461602,0.0001544146,0.00037546616,0.000150704,0.00022831111,0.0004695746],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00090727664,0.00025830715,0.002728819,0.0009682487,0.00018165947,0.0013567408,0.00016541734,0.08814716,0.6050788,0.01974811,0.010406751,0.27005282],"study_design_scores_gemma":[0.00058416143,0.0044020577,0.0072740912,0.00012537192,0.00028359925,0.0023464623,0.00011732882,0.47856835,0.42224103,0.0022386203,0.081675045,0.00014396459],"about_ca_topic_score_codex":0.0011097626,"about_ca_topic_score_gemma":0.0018913487,"teacher_disagreement_score":0.0033337434,"about_ca_system_score_codex":0.00033293263,"about_ca_system_score_gemma":0.00041312407,"threshold_uncertainty_score":0.011152506},"labels":[],"label_agreement":null},{"id":"W2538808927","doi":"10.1109/gdn.1993.336565","title":"Performance of alternative media for LAN interconnection","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Interconnection; Distributed-queue dual-bus; Computer network; Computer science; Integrated Services Digital Network; Local area network; Metropolitan area network; Asynchronous Transfer Mode; Server; LAN switching; Workstation; Realization (probability); Operating system","score_opus":0.035474550278981755,"score_gpt":0.23227520756575912,"score_spread":0.19680065728677737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538808927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98002976,0.000909535,0.007695869,0.00029026932,0.00007154489,0.000014683188,0.00023756342,0.00033863023,0.010412173],"genre_scores_gemma":[0.9976687,0.00019822169,0.0009495375,0.00002263412,0.000013287805,0.000008141501,0.00014600402,0.000023261271,0.0009700945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904126,0.00022990032,0.000028250766,0.00010373513,0.0002984182,0.00029838146],"domain_scores_gemma":[0.9978332,0.0011911677,0.00019972624,0.00017623897,0.00047737474,0.00012232237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009043365,0.0006169657,0.00049344834,0.0008212427,0.00070773065,0.0019002336,0.00062084285,0.0008587517,0.003466967],"category_scores_gemma":[0.0037806232,0.00021871222,0.00037628654,0.001137702,0.00059938076,0.0021608656,0.0008571073,0.00058014644,0.00043966415],"study_design_candidate":"bench_or_experimental","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.0024668018,0.00037458751,0.011867199,0.00021030768,0.00012635384,0.0004948279,0.00025161752,0.89355636,0.040285356,0.020254157,0.0038365296,0.026275855],"study_design_scores_gemma":[0.00005217312,0.00044561652,0.0016511343,0.000014832657,0.00003631332,0.000090168134,0.00014825012,0.9762165,0.018141959,0.002110785,0.0010606338,0.00003157882],"about_ca_topic_score_codex":0.0042427173,"about_ca_topic_score_gemma":0.0023121599,"teacher_disagreement_score":0.0042427173,"about_ca_system_score_codex":0.0018000655,"about_ca_system_score_gemma":0.0005404717,"threshold_uncertainty_score":0.013060391},"labels":[],"label_agreement":null},{"id":"W2541438272","doi":"10.1109/idt.2007.4437466","title":"Performance Analysis of Networks-on-Chip Routers","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Router; Computer science; Network on a chip; Queueing theory; One-armed router; Queue; Markov chain; Focus (optics); Network topology; Core router; Computer network; Topology (electrical circuits); Distributed computing; Embedded system; Engineering","score_opus":0.013897089866814599,"score_gpt":0.23440533055056417,"score_spread":0.22050824068374958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541438272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26980332,0.0032043173,0.7058712,0.0008341497,0.00008822194,0.00012762526,0.00031795158,0.0007887154,0.018964522],"genre_scores_gemma":[0.9791837,0.0010945376,0.017421316,0.00006217033,0.00004207441,0.000061265215,0.00014061916,0.000068618174,0.001925732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989215,0.00040777778,0.00003286004,0.00011386627,0.000376215,0.00014777665],"domain_scores_gemma":[0.9978854,0.0013574241,0.00019460286,0.00016534895,0.00036328283,0.00003388237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428632,0.0006470032,0.00049186155,0.00073019677,0.0003204015,0.00069294113,0.0006780024,0.0006006151,0.0012167844],"category_scores_gemma":[0.0065071327,0.00025641022,0.00035155035,0.0006739342,0.0005550724,0.0009430071,0.00033414314,0.0004777716,0.00024215248],"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.000035091227,0.00002200353,0.0007546141,0.000043745935,0.000021480191,0.00003507055,0.0000239755,0.9661301,0.004262832,0.01928851,0.00034982048,0.009032716],"study_design_scores_gemma":[0.0000016415463,0.000015055455,0.0002548728,0.000003883534,0.0000057899047,0.000008703604,0.0000046656974,0.99522036,0.0012156428,0.003001079,0.00026546064,0.0000028657732],"about_ca_topic_score_codex":0.0031042665,"about_ca_topic_score_gemma":0.0013979385,"teacher_disagreement_score":0.0031042665,"about_ca_system_score_codex":0.0015580344,"about_ca_system_score_gemma":0.0008941691,"threshold_uncertainty_score":0.0113043785},"labels":[],"label_agreement":null},{"id":"W2546541767","doi":"","title":"Minimum CAPEX Design of Segment p -Cycles with Full Node Protection","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Interconnection Networks and 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","funders":"","keywords":"Node (physics); Context (archaeology); Compromise; Path (computing); Computer science; Network Access Protection; Reliability engineering; Computer network; Engineering","score_opus":0.019292572964773935,"score_gpt":0.2044228798776518,"score_spread":0.18513030691287785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546541767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19027808,0.0007251473,0.79318696,0.000206343,0.00007183012,0.00034980194,0.00012977106,0.0005577917,0.014494278],"genre_scores_gemma":[0.95954704,0.00012585813,0.03799078,0.0000378891,0.000014738848,0.000089221336,0.00003572288,0.00004581461,0.0021129418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.00008682145,0.000023876377,0.00008240851,0.000081583996,0.000078927915],"domain_scores_gemma":[0.9992592,0.00018734141,0.00013377634,0.00014355336,0.0002143552,0.00006190337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046437836,0.0006185029,0.00051069027,0.00050110527,0.00043842132,0.0008377763,0.001521026,0.0003773376,0.0031897724],"category_scores_gemma":[0.0012710206,0.00024285118,0.00026123863,0.0004036362,0.00041079195,0.0008253723,0.0005664177,0.00039179463,0.0002767272],"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.0014461555,0.00022767247,0.002159361,0.00057890225,0.0001492657,0.0005729376,0.00035686436,0.55729365,0.15829778,0.07381166,0.0041114613,0.20099428],"study_design_scores_gemma":[0.00013025427,0.0010227691,0.0010860948,0.000057698267,0.000092416354,0.00045171488,0.000073721785,0.91225827,0.05822135,0.018115673,0.008455091,0.000034997265],"about_ca_topic_score_codex":0.001051385,"about_ca_topic_score_gemma":0.0016229679,"teacher_disagreement_score":0.0031897724,"about_ca_system_score_codex":0.0008624007,"about_ca_system_score_gemma":0.0008285333,"threshold_uncertainty_score":0.010670841},"labels":[],"label_agreement":null},{"id":"W2548278520","doi":"10.1109/newcas.2016.7604823","title":"Towards LTE physical layer virtualization on a COTS multicore platform with efficient scheduling","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtualization; Emulation; Scheduling (production processes); Virtual machine; Distributed computing; Multi-core processor; Operating system; Cloud computing; Embedded system","score_opus":0.025398550678884153,"score_gpt":0.2554106378337335,"score_spread":0.23001208715484936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548278520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6528491,0.0012904565,0.33454546,0.0003686603,0.00012974167,0.00011512962,0.00005611842,0.0019970369,0.008648414],"genre_scores_gemma":[0.8575283,0.0003181434,0.13999632,0.00007501152,0.000025065545,0.000030233374,0.0000877196,0.00010632694,0.001832929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996642,0.0000975095,0.000015904076,0.00003890749,0.000104929466,0.00007851887],"domain_scores_gemma":[0.9995858,0.00007700207,0.000054056647,0.00013415114,0.00009789514,0.000051008625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157706,0.00038828424,0.0001872576,0.00021091865,0.00029231524,0.0005619311,0.0005618615,0.0002120351,0.00061268074],"category_scores_gemma":[0.0010778301,0.00017305189,0.00019574206,0.000254418,0.00026989827,0.0005999191,0.00036210593,0.00043223822,0.00016281308],"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.0008482649,0.00029449823,0.009823526,0.00034747095,0.0001200985,0.0005720172,0.00044393732,0.37887967,0.34656695,0.032189436,0.0053443993,0.22456971],"study_design_scores_gemma":[0.00003087983,0.0003357827,0.003663463,0.000021394279,0.000036377798,0.00017324997,0.00009641,0.929562,0.055761717,0.003137533,0.0071645738,0.000016562026],"about_ca_topic_score_codex":0.003483075,"about_ca_topic_score_gemma":0.004528683,"teacher_disagreement_score":0.003483075,"about_ca_system_score_codex":0.0004434701,"about_ca_system_score_gemma":0.0009384034,"threshold_uncertainty_score":0.0069256425},"labels":[],"label_agreement":null},{"id":"W2548314111","doi":"10.5555/3145862.3145879","title":"Cluster-based architecture relying on optical integrated networks with the provision of a low-latency arbiter","year":2016,"lang":"en","type":"article","venue":"Symposium on Integrated Circuits and Systems Design","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":"McGill University; Polytechnique Montréal","funders":"","keywords":"Arbiter; MPSoC; Computer science; Computer architecture; Latency (audio); Embedded system; Architecture; Field-programmable gate array; Exploit; System on a chip; Low latency (capital markets); Network on a chip; Parallel computing; Computer network; Telecommunications","score_opus":0.014816657749234487,"score_gpt":0.20741831464294752,"score_spread":0.19260165689371303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548314111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47825134,0.0016477009,0.47251377,0.00026357055,0.00025333193,0.00019605167,0.00032004603,0.005755546,0.040798634],"genre_scores_gemma":[0.9073908,0.00028873413,0.0863378,0.00004363434,0.000035929686,0.00006286354,0.00013945383,0.000050887767,0.005649987],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999163,0.000013546157,0.0000048066877,0.000019806186,0.000030276757,0.000015327601],"domain_scores_gemma":[0.9998951,0.000013720519,0.000019517587,0.00002650327,0.000033422595,0.000011723711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088075525,0.00022113875,0.00017590603,0.00029885833,0.00032709466,0.00036008318,0.00074959075,0.00022772304,0.0015592849],"category_scores_gemma":[0.00013710419,0.000099935845,0.00016247887,0.00033900706,0.00021363971,0.00035533376,0.00025826262,0.00015694389,0.00036192805],"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.00082851585,0.00023291423,0.003802177,0.00061401137,0.00022839206,0.0004945955,0.00019124645,0.12252777,0.6054536,0.03664682,0.0066445,0.22233552],"study_design_scores_gemma":[0.00010747325,0.0015967467,0.004411556,0.00003863554,0.00023064978,0.0008398062,0.000118078606,0.70138305,0.23672596,0.008648233,0.045805786,0.00009405521],"about_ca_topic_score_codex":0.0013332558,"about_ca_topic_score_gemma":0.0024211372,"teacher_disagreement_score":0.0015592849,"about_ca_system_score_codex":0.00040807133,"about_ca_system_score_gemma":0.00046821605,"threshold_uncertainty_score":0.00521636},"labels":[],"label_agreement":null},{"id":"W2560205416","doi":"10.1109/mcsoc.2016.12","title":"Adaptive VC Organization and Arbitration for Efficient NoC Design","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Router; Computer science; Network on a chip; Core router; Arbitration; One-armed router; Computer network; Latency (audio); Virtual channel; Network packet; Throughput; Queue; Distributed computing; Embedded system; Queueing theory; Operating system; Wireless","score_opus":0.023837990616902883,"score_gpt":0.2157696117267462,"score_spread":0.1919316211098433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560205416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047542714,0.0010621925,0.94615966,0.0001373576,0.00007295793,0.00009970265,0.00003567635,0.0008824531,0.0040072734],"genre_scores_gemma":[0.70448524,0.0003707845,0.2932459,0.000092051894,0.00004057627,0.00012814984,0.00006482288,0.000070163216,0.0015022438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996705,0.0000976975,0.0000320271,0.000054320146,0.000094888375,0.000050580686],"domain_scores_gemma":[0.99954516,0.00013325938,0.0000804141,0.0000609085,0.00015338046,0.000026911806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045929762,0.00025736666,0.00027060736,0.00046143186,0.00024265239,0.0005270753,0.0010088629,0.0002606751,0.0008887529],"category_scores_gemma":[0.0010553423,0.00016923962,0.00016069789,0.00043103367,0.0002317622,0.000586048,0.00031606786,0.00032660947,0.00013222996],"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.00024669102,0.00013684513,0.0022921334,0.0002891571,0.00007583553,0.0002996463,0.00019679387,0.36789793,0.21984331,0.052685026,0.0032859186,0.3527507],"study_design_scores_gemma":[0.00002314653,0.00017719637,0.0004126955,0.000018545908,0.00003119638,0.00016199192,0.000019383004,0.95697564,0.030558303,0.0048723826,0.006731985,0.000017576771],"about_ca_topic_score_codex":0.00080916466,"about_ca_topic_score_gemma":0.0016153889,"teacher_disagreement_score":0.0010088629,"about_ca_system_score_codex":0.00049127353,"about_ca_system_score_gemma":0.0005246146,"threshold_uncertainty_score":0.003564477},"labels":[],"label_agreement":null},{"id":"W2561635212","doi":"10.1002/cpe.4066","title":"Providing differentiated services, congestion management, and deadlock freedom in dragonfly networks with adaptive routing","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Distributed computing; Computer network; Network topology; Bottleneck; Static routing; Hierarchical routing; Policy-based routing; Network congestion; Deadlock; Dynamic Source Routing; Queueing theory; Routing domain; Routing (electronic design automation); Routing protocol; Network packet; Embedded system","score_opus":0.013776457186735088,"score_gpt":0.2517179663363386,"score_spread":0.2379415091496035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561635212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6812016,0.00044354872,0.31064454,0.00042589306,0.000071615825,0.00009478167,0.00007135908,0.0011055314,0.005941074],"genre_scores_gemma":[0.9530972,0.000119962,0.04525375,0.0000504214,0.000009340642,0.000023803872,0.000056338635,0.00001850682,0.0013706657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975675,0.00006412657,0.000013085293,0.000038606737,0.00005648285,0.000070871116],"domain_scores_gemma":[0.9994771,0.00021426703,0.00004724424,0.0000985908,0.00010181173,0.00006085698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004111087,0.0003613981,0.00021647738,0.0005992042,0.0006828113,0.00051033136,0.0006117777,0.0003129662,0.0007432477],"category_scores_gemma":[0.0006963305,0.00010491269,0.00019144498,0.00035220114,0.00048590766,0.000664308,0.00060681294,0.00039368236,0.00007250004],"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.0010354735,0.00034918165,0.008288494,0.00016916331,0.000093360024,0.0006671606,0.0007463188,0.5798571,0.13071004,0.04231498,0.005478574,0.23029013],"study_design_scores_gemma":[0.000025817586,0.00014766675,0.00081445574,0.0000096386275,0.000020249368,0.00007739476,0.000098421406,0.9696349,0.020874836,0.0056771263,0.0025929573,0.000026588876],"about_ca_topic_score_codex":0.0075813658,"about_ca_topic_score_gemma":0.0073143467,"teacher_disagreement_score":0.0075813658,"about_ca_system_score_codex":0.0009404576,"about_ca_system_score_gemma":0.00048293328,"threshold_uncertainty_score":0.015074432},"labels":[],"label_agreement":null},{"id":"W2566701340","doi":"10.1109/sbac-pad.2016.15","title":"MAGC: A Mapping Approach for GPU Clusters","year":2016,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Queen's University","funders":"Ministry of Economy, Trade and Industry","keywords":"Computer science; Benchmark (surveying); Network topology; GPU cluster; General-purpose computing on graphics processing units; Exploit; Supercomputer; Parallel computing; Multi-core processor; CUDA; Graphics; Computer network; Operating system","score_opus":0.031684010521795244,"score_gpt":0.2286484632223,"score_spread":0.19696445270050478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566701340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021854894,0.00033337527,0.9620613,0.00034921506,0.00012808382,0.00018592733,0.000226352,0.006695504,0.008165323],"genre_scores_gemma":[0.26850224,0.00027681774,0.7226632,0.00028013275,0.00005384653,0.00035262166,0.00063391536,0.00096480316,0.006272445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.0001315678,0.00002308993,0.00008794748,0.00019264515,0.00007641847],"domain_scores_gemma":[0.99938,0.000113433074,0.000040863215,0.00020735139,0.00018389121,0.000074402575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048297542,0.000874957,0.00049244676,0.0010648672,0.0011326753,0.0011082027,0.0022022035,0.00076139544,0.0040994016],"category_scores_gemma":[0.0020962171,0.0004405355,0.0006579138,0.0011345602,0.00054041145,0.0014372015,0.0019046084,0.0009736745,0.0009560794],"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.00026727672,0.00017894099,0.003125716,0.00026551727,0.00010123201,0.00036336237,0.0004718041,0.5194377,0.022011014,0.05775339,0.028072122,0.367952],"study_design_scores_gemma":[0.000033017466,0.00007878224,0.0003964107,0.000014950178,0.0000184911,0.000117399075,0.00012681984,0.9531599,0.0063988,0.019287644,0.020343589,0.000024186409],"about_ca_topic_score_codex":0.0072971275,"about_ca_topic_score_gemma":0.010730571,"teacher_disagreement_score":0.0072971275,"about_ca_system_score_codex":0.0010528584,"about_ca_system_score_gemma":0.0017519897,"threshold_uncertainty_score":0.01450932},"labels":[],"label_agreement":null},{"id":"W2571916084","doi":"","title":"Trees with a given order and matching number that have maximum general sum-connectivity index.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Index (typography); Matching (statistics); Order (exchange); Statistics; Combinatorics; Applied mathematics; Computer science; Economics","score_opus":0.011617981999662798,"score_gpt":0.22587698573966697,"score_spread":0.21425900374000417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571916084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7589755,0.0012879376,0.15720901,0.0019420597,0.00023392495,0.00030983146,0.010029388,0.0020869416,0.06792549],"genre_scores_gemma":[0.8514018,0.0012126458,0.124825574,0.0002756963,0.00015812217,0.00019688139,0.005830119,0.00047970907,0.015619493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950886,0.00007856029,0.000038241324,0.0001284962,0.00011411318,0.0001317272],"domain_scores_gemma":[0.9973412,0.0010503429,0.00039162417,0.0004964962,0.0003506354,0.00036964758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060370215,0.00057040487,0.0011165359,0.0016224664,0.0013846575,0.002960342,0.0011046581,0.0017247957,0.008570879],"category_scores_gemma":[0.0058315066,0.0004956108,0.0005847332,0.0025592942,0.00063015363,0.003607202,0.00088653655,0.00081911054,0.0018981454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028518538,0.0010737154,0.023411358,0.0025751137,0.0005298032,0.0016447378,0.0015981165,0.0963648,0.11362217,0.5075183,0.04558755,0.20322263],"study_design_scores_gemma":[0.00030258956,0.00057964015,0.0122142965,0.0003525025,0.00055631524,0.003536386,0.0014051131,0.14707544,0.059463136,0.709186,0.065208435,0.000120169476],"about_ca_topic_score_codex":0.00056392705,"about_ca_topic_score_gemma":0.0017567505,"teacher_disagreement_score":0.008570879,"about_ca_system_score_codex":0.0011044514,"about_ca_system_score_gemma":0.0010628403,"threshold_uncertainty_score":0.028672457},"labels":[],"label_agreement":null},{"id":"W2572376896","doi":"","title":"Local restricted edge connectivity and restricted edge connectivity of graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Computer science; Artificial intelligence","score_opus":0.013780292265750707,"score_gpt":0.22864974239254776,"score_spread":0.21486945012679706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572376896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41969565,0.004201612,0.42221504,0.0024907868,0.00029391047,0.00012632304,0.0014812986,0.00074894726,0.14874637],"genre_scores_gemma":[0.9679684,0.001307136,0.015688227,0.00030060313,0.0003245345,0.00013714608,0.0008066179,0.00010308745,0.013364167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938214,0.00018984968,0.00003247292,0.00016926952,0.00012729724,0.000098895754],"domain_scores_gemma":[0.9967878,0.0015910167,0.0004884548,0.0005402378,0.00029491988,0.00029757983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040317472,0.00037575923,0.00047848467,0.0013835363,0.00063178217,0.0013103741,0.0009563158,0.0007732854,0.008373775],"category_scores_gemma":[0.0047726263,0.0002705978,0.0003546699,0.0013395924,0.0016740272,0.0038500673,0.0013807465,0.0012087327,0.0009357402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097559205,0.000034823643,0.0014508768,0.00018485663,0.000035071276,0.00041347992,0.00028999607,0.011383404,0.0031181292,0.9510153,0.006561444,0.025415115],"study_design_scores_gemma":[0.000026709604,0.000051947314,0.0017060857,0.000047262543,0.0000442937,0.00087537797,0.00022073684,0.031592567,0.0014978922,0.95168906,0.012226916,0.0000211615],"about_ca_topic_score_codex":0.00064400473,"about_ca_topic_score_gemma":0.0008088755,"teacher_disagreement_score":0.008373775,"about_ca_system_score_codex":0.00041770106,"about_ca_system_score_gemma":0.00022072038,"threshold_uncertainty_score":0.02801305},"labels":[],"label_agreement":null},{"id":"W2572419657","doi":"","title":"On the page number of triple-loop networks with even cardinality.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Mathematics; Loop (graph theory); Combinatorics; Arithmetic; Computer science; Database","score_opus":0.012553497245683188,"score_gpt":0.2294478018817198,"score_spread":0.2168943046360366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572419657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57351834,0.0035793155,0.18217999,0.0043653734,0.0011222834,0.000083555664,0.002191634,0.0011972947,0.2317622],"genre_scores_gemma":[0.9556645,0.0013322417,0.01872629,0.00044131264,0.0004953453,0.00012518629,0.00069340284,0.00027108454,0.022250678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993406,0.00019433041,0.000038719987,0.000115295625,0.0001610042,0.00015015845],"domain_scores_gemma":[0.99361914,0.003921324,0.0008115097,0.00055411074,0.00047653247,0.00061740674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702907,0.0004230302,0.0006201415,0.002148198,0.0011524057,0.0029364298,0.0008614246,0.00089377695,0.014281115],"category_scores_gemma":[0.0076665026,0.0003774531,0.00034292156,0.0011432307,0.0016673394,0.0052465433,0.0012769343,0.00125564,0.002018253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608925,0.000044827193,0.0012119438,0.00020595864,0.000025397703,0.00023119128,0.00022629839,0.009698375,0.0032903012,0.94567806,0.012283209,0.02684341],"study_design_scores_gemma":[0.00002256854,0.00003383606,0.0007170116,0.00006363895,0.000017424454,0.00032450058,0.00007477719,0.025968727,0.0015545102,0.9634366,0.007763728,0.000022612145],"about_ca_topic_score_codex":0.00035793692,"about_ca_topic_score_gemma":0.0006299282,"teacher_disagreement_score":0.014281115,"about_ca_system_score_codex":0.00076503784,"about_ca_system_score_gemma":0.0004914775,"threshold_uncertainty_score":0.04777509},"labels":[],"label_agreement":null},{"id":"W2572884732","doi":"","title":"Covering a Unit Hypercube with Hypercubes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Unit (ring theory); Combinatorics; Parallel computing; Computer science; Mathematics education","score_opus":0.01382006134576147,"score_gpt":0.21166670830886972,"score_spread":0.19784664696310825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572884732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31584594,0.005401285,0.51246977,0.00092318334,0.0008454391,0.0002759363,0.0015003992,0.0013993523,0.16133872],"genre_scores_gemma":[0.80221623,0.0028276718,0.1575885,0.00033944895,0.00022747442,0.00031963785,0.0013927018,0.00022336355,0.03486498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995053,0.00018325631,0.00003281684,0.00008050051,0.000097050586,0.00010106371],"domain_scores_gemma":[0.9993187,0.00023872138,0.000087569366,0.00017010348,0.000088614375,0.00009623155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026710666,0.000468343,0.00044968436,0.0010158771,0.0009205425,0.0012903186,0.0007474508,0.00059757626,0.010670638],"category_scores_gemma":[0.0016516258,0.00029616882,0.00044117932,0.0015240946,0.0005543895,0.0016350975,0.0021812422,0.0005616926,0.0019802228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000896176,0.00018358689,0.0033269029,0.0014230995,0.00020118953,0.0014347926,0.0006829386,0.16039285,0.060668424,0.4468682,0.03476601,0.2891559],"study_design_scores_gemma":[0.00010460805,0.00033164996,0.0030174504,0.0002884365,0.000098156925,0.001772449,0.000991478,0.35946468,0.04388416,0.47246653,0.11750615,0.00007431919],"about_ca_topic_score_codex":0.001075323,"about_ca_topic_score_gemma":0.0014725394,"teacher_disagreement_score":0.010670638,"about_ca_system_score_codex":0.0004166587,"about_ca_system_score_gemma":0.00036808065,"threshold_uncertainty_score":0.035696805},"labels":[],"label_agreement":null},{"id":"W2574321853","doi":"","title":"Self Vertex Switchings Of Trees.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Tree (set theory); Combinatorics; Graph","score_opus":0.00815404646545823,"score_gpt":0.21182066971011518,"score_spread":0.20366662324465695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574321853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52387774,0.0025445903,0.20162363,0.00096861005,0.0008507782,0.00009205148,0.00077708485,0.0010912598,0.2681742],"genre_scores_gemma":[0.95758826,0.0006657205,0.013244055,0.00024315943,0.00022964443,0.000043557433,0.0004095436,0.00016549963,0.027410619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997081,0.00007033153,0.000018423523,0.000057776386,0.00007598279,0.00006921176],"domain_scores_gemma":[0.9989825,0.00041293097,0.0001472946,0.00017334455,0.0001237206,0.00016020227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002694645,0.00019958062,0.00031950168,0.0013481517,0.00079053506,0.001496498,0.00047416607,0.00056873524,0.008630879],"category_scores_gemma":[0.0018835984,0.00024078609,0.00039938153,0.00068879384,0.000675516,0.0016313974,0.00088914926,0.00080531207,0.00091998925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066658286,0.000040143368,0.00075537915,0.00006971898,0.000020427968,0.00023171809,0.00020160855,0.0053391894,0.0039199353,0.9562686,0.0052192016,0.027867444],"study_design_scores_gemma":[0.00002424342,0.000039420596,0.00082643767,0.000030807958,0.000016718877,0.00040551374,0.00013461178,0.037798397,0.002198719,0.94514257,0.013367776,0.000014786572],"about_ca_topic_score_codex":0.00057488313,"about_ca_topic_score_gemma":0.0010576542,"teacher_disagreement_score":0.008630879,"about_ca_system_score_codex":0.0006101499,"about_ca_system_score_gemma":0.00023606085,"threshold_uncertainty_score":0.028873146},"labels":[],"label_agreement":null},{"id":"W2578744964","doi":"","title":"Arc-connectivity of regular digraphs with two orbits.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arc (geometry); Mathematics; Combinatorics; Pure mathematics; Geometry","score_opus":0.008724780505388278,"score_gpt":0.21577670511047853,"score_spread":0.20705192460509025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578744964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79245615,0.00091856957,0.10311027,0.001034049,0.00011718086,0.0000968001,0.0024038255,0.0004762989,0.09938694],"genre_scores_gemma":[0.9794306,0.00038883588,0.010495496,0.000083156716,0.000039982257,0.00004427093,0.0009300272,0.000040208048,0.0085474225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976665,0.000053366453,0.000020812999,0.000059128317,0.000049660295,0.00005027132],"domain_scores_gemma":[0.99850875,0.00079503685,0.00026175784,0.00011206402,0.00012952728,0.00019292772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020817883,0.0002501567,0.00027350202,0.0010545006,0.0006440833,0.0013423957,0.00054254377,0.00063605997,0.009380379],"category_scores_gemma":[0.0020332239,0.00026443266,0.00028566635,0.00096571865,0.0007035623,0.0018822736,0.0007038188,0.00059825357,0.0006286468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002739999,0.000086412416,0.0038056346,0.00030549968,0.000059528913,0.0011398615,0.0006252539,0.017325806,0.0056564356,0.92513764,0.007892477,0.037691347],"study_design_scores_gemma":[0.00007218975,0.00008105357,0.0032219614,0.000088733446,0.0000633638,0.0012710377,0.00046860825,0.06746637,0.0026362096,0.91073835,0.01386379,0.000028357072],"about_ca_topic_score_codex":0.0012244484,"about_ca_topic_score_gemma":0.0016154904,"teacher_disagreement_score":0.009380379,"about_ca_system_score_codex":0.0005866297,"about_ca_system_score_gemma":0.00030472715,"threshold_uncertainty_score":0.031380475},"labels":[],"label_agreement":null},{"id":"W2585582500","doi":"10.1145/3020078.3021751","title":"120-core microAptiv MIPS Overlay for the Terasic DE5-NET FPGA board","year":2017,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"","keywords":"Stratix; Computer science; Field-programmable gate array; Overlay; Code (set theory); Message passing; Embedded system; Throughput; Parallel computing; Computer architecture; Operating system; Programming language","score_opus":0.04811111579369935,"score_gpt":0.28430915942833596,"score_spread":0.2361980436346366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585582500","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45822102,0.00091118773,0.3433998,0.00045111883,0.00034667505,0.00090797653,0.002312341,0.058207344,0.13524252],"genre_scores_gemma":[0.83940685,0.00022804603,0.12363867,0.00024106847,0.00003533018,0.00026986518,0.0028950654,0.0013446923,0.031940483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984705,0.000017056755,0.000008547083,0.00003168439,0.000055930566,0.000039666236],"domain_scores_gemma":[0.9998733,0.000020029105,0.000018881932,0.000027151997,0.00004159903,0.000019098276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015941744,0.0005155376,0.00018352382,0.0003693994,0.00014161321,0.0003762982,0.00074274745,0.00015834303,0.025227774],"category_scores_gemma":[0.0003626957,0.00017123307,0.00015781411,0.00021967798,0.000099796045,0.0003624406,0.00022342788,0.0002842723,0.00563806],"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.0014538725,0.00047741045,0.006766112,0.000833135,0.00009075921,0.0006000514,0.00024073546,0.042280164,0.42171022,0.023928031,0.062191352,0.43942824],"study_design_scores_gemma":[0.0005509344,0.0026351048,0.014803888,0.00011020979,0.00012676894,0.0012041056,0.00012106313,0.25571316,0.4442453,0.0037627832,0.27662617,0.00010050096],"about_ca_topic_score_codex":0.0009830779,"about_ca_topic_score_gemma":0.0015670432,"teacher_disagreement_score":0.025227774,"about_ca_system_score_codex":0.00054253417,"about_ca_system_score_gemma":0.00054221856,"threshold_uncertainty_score":0.08439535},"labels":[],"label_agreement":null},{"id":"W2592938669","doi":"10.5705/ss.202015.0019","title":"A general construction for space-filling Latin hypercubes","year":2015,"lang":"en","type":"article","venue":"Statistica Sinica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin hypercube sampling; Hypercube; Space (punctuation); Latin Americans; Computer science; Mathematics; Political science; Parallel computing; Statistics; Law","score_opus":0.06060965390519691,"score_gpt":0.2946521162037869,"score_spread":0.23404246229859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592938669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026580493,0.00008504435,0.994589,0.00003541749,0.000032569642,0.000055046283,0.000047120688,0.00023314366,0.0022646992],"genre_scores_gemma":[0.06338928,0.0002472383,0.9330531,0.000087078144,0.000048240796,0.00062291144,0.00014922532,0.00015975423,0.0022431326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982967,0.00081367814,0.000106434236,0.0002737805,0.00041668702,0.000092893286],"domain_scores_gemma":[0.9986883,0.00046646656,0.00016551575,0.00032001417,0.0002989558,0.00006076744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016992133,0.00079234235,0.0007431825,0.0010035373,0.0006352467,0.0010054364,0.0010092335,0.0006199568,0.005003709],"category_scores_gemma":[0.0041138697,0.00061856717,0.0009822198,0.001100979,0.0013601481,0.00128858,0.0016516973,0.0011755538,0.0014951954],"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.00023355604,0.00008095923,0.00075923465,0.0006053914,0.0000699817,0.00025815083,0.00037069406,0.14583191,0.07763479,0.5893883,0.0034635,0.18130349],"study_design_scores_gemma":[0.00018559028,0.00064253074,0.00052927644,0.00016920353,0.000062475054,0.0007500797,0.00015739753,0.48699266,0.07063047,0.35375047,0.08597613,0.0001537309],"about_ca_topic_score_codex":0.0002883567,"about_ca_topic_score_gemma":0.00031549134,"teacher_disagreement_score":0.005003709,"about_ca_system_score_codex":0.00047496904,"about_ca_system_score_gemma":0.0008633285,"threshold_uncertainty_score":0.01673913},"labels":[],"label_agreement":null},{"id":"W2594214392","doi":"","title":"Exact Wirelength of Embedding Circulant Networks into Necklace and Windmill Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Necklace; Windmill; Circulant matrix; Mathematics; Embedding; Discrete mathematics; Combinatorics; Computer science; Electrical engineering; Engineering; Artificial intelligence","score_opus":0.010970867736856661,"score_gpt":0.2497539726946023,"score_spread":0.23878310495774566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594214392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57011336,0.0026933444,0.3045384,0.0012322593,0.00047056284,0.0000797277,0.0017210996,0.0008829817,0.118268274],"genre_scores_gemma":[0.9317705,0.00092654047,0.046453994,0.00013885522,0.000120936355,0.00008772627,0.0006580581,0.0003279353,0.01951534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.000048334234,0.000011506035,0.00005129367,0.000096003176,0.00005218034],"domain_scores_gemma":[0.9988218,0.00057998445,0.00015096231,0.00016455901,0.00016650416,0.00011616494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033673013,0.00048548685,0.00040822173,0.0009660937,0.00058665266,0.001282678,0.0010032702,0.0008029232,0.010845752],"category_scores_gemma":[0.0038531902,0.00042066962,0.00026656047,0.0008351886,0.00076086744,0.0029696939,0.0008879619,0.0010300536,0.0015519387],"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.00028188276,0.00008067747,0.0011393054,0.00031972709,0.000046060926,0.00024208194,0.0003048894,0.105155334,0.009078601,0.80112123,0.015453816,0.066776335],"study_design_scores_gemma":[0.000026917849,0.000064081534,0.00084046746,0.00005477339,0.00002277705,0.00014002383,0.00011585522,0.18148877,0.0032844294,0.8074305,0.006507237,0.000024114555],"about_ca_topic_score_codex":0.0011978168,"about_ca_topic_score_gemma":0.0028039827,"teacher_disagreement_score":0.010845752,"about_ca_system_score_codex":0.0010060186,"about_ca_system_score_gemma":0.00048395008,"threshold_uncertainty_score":0.03628266},"labels":[],"label_agreement":null},{"id":"W2594273812","doi":"","title":"Residual Closeness Of Splitting Networks.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Closeness; Residual; Mathematics; Algorithm; Mathematical analysis","score_opus":0.01802815789864529,"score_gpt":0.2576778004659188,"score_spread":0.23964964256727353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594273812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36767998,0.0012687122,0.45883662,0.0014807915,0.00020989144,0.00010196328,0.0010205599,0.00049154763,0.16890997],"genre_scores_gemma":[0.93519694,0.0009237828,0.029957334,0.00030484743,0.00014710633,0.000086581844,0.0010599619,0.00018270772,0.03214064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.00020909408,0.000032042477,0.00014664585,0.00020608044,0.000097547636],"domain_scores_gemma":[0.9961725,0.0019832086,0.00046593687,0.0004572932,0.0005637487,0.000357283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000748409,0.00034316568,0.0005325779,0.0015038492,0.0008756542,0.0017058613,0.0008486624,0.0007104706,0.015504252],"category_scores_gemma":[0.007590319,0.00027645504,0.00038684517,0.0010245914,0.0013066317,0.0032275887,0.0020206163,0.0014954738,0.0017677643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010741346,0.0000230694,0.0008759599,0.00011256179,0.000026852496,0.000103249375,0.00035545815,0.014692851,0.0018079765,0.9548571,0.0040204967,0.023017008],"study_design_scores_gemma":[0.00002001263,0.00005097889,0.0006674997,0.00003653927,0.000019411931,0.00020962987,0.00027613412,0.039010618,0.0014637086,0.9470719,0.011161233,0.000012254236],"about_ca_topic_score_codex":0.0010868214,"about_ca_topic_score_gemma":0.0009838768,"teacher_disagreement_score":0.015504252,"about_ca_system_score_codex":0.0007758843,"about_ca_system_score_gemma":0.0003933627,"threshold_uncertainty_score":0.05186683},"labels":[],"label_agreement":null},{"id":"W2600117321","doi":"10.1145/3027486","title":"Hoplite","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":36,"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 Waterloo","funders":"","keywords":"Computer science; Crossbar switch; Field-programmable gate array; Router; Lookup table; Deflection routing; Overlay; Embedded system; Network packet; Network on a chip; Parallel computing; Computer network; Computer hardware; Routing protocol; Operating system; Static routing","score_opus":0.023791759575589093,"score_gpt":0.25333149139893907,"score_spread":0.22953973182334997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600117321","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05929485,0.003033062,0.20456114,0.0012739185,0.0011682878,0.00076437014,0.011308692,0.13659689,0.58199877],"genre_scores_gemma":[0.35836506,0.0018899196,0.17955314,0.0022926922,0.00020225701,0.0009138613,0.030257579,0.013007851,0.41351768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974686,0.000020447638,0.000010187986,0.0000531392,0.00010275674,0.000066650224],"domain_scores_gemma":[0.9997582,0.000050699586,0.000017571023,0.000070947164,0.00006615482,0.000036511065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032024822,0.0007221155,0.00031347954,0.00050855504,0.00035901304,0.0011413133,0.0013982407,0.00074662245,0.117073216],"category_scores_gemma":[0.00075473136,0.00041683132,0.00033512322,0.00034076264,0.00026041776,0.001731115,0.0010499251,0.00068368966,0.03287558],"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.0018896651,0.0003631837,0.0029092226,0.0014769806,0.00011865015,0.00053761597,0.00024299618,0.009389813,0.06759789,0.054486196,0.41668358,0.44430423],"study_design_scores_gemma":[0.000277285,0.0005404238,0.0014045178,0.00010770907,0.00005239038,0.0006101937,0.00007163976,0.027526092,0.05460396,0.008318367,0.906391,0.000096438984],"about_ca_topic_score_codex":0.0007414183,"about_ca_topic_score_gemma":0.0016979382,"teacher_disagreement_score":0.117073216,"about_ca_system_score_codex":0.00047890743,"about_ca_system_score_gemma":0.0005931465,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2610484559","doi":"10.1109/access.2017.2701406","title":"Cache Coherence Scheme for HCS-Based CMP and Its System Reliability Analysis","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Cache coherence; Computer science; MESI protocol; Reliability (semiconductor); Cache; MESIF protocol; Protocol (science); Throughput; Embedded system; Parallel computing; CPU cache; Power (physics); Cache algorithms; Operating system; Wireless","score_opus":0.05937888845365853,"score_gpt":0.33893922190112474,"score_spread":0.2795603334474662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610484559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349391,0.00088906783,0.35521865,0.00028666074,0.000036697154,0.00011028373,0.00022474825,0.0008789093,0.007415975],"genre_scores_gemma":[0.98974156,0.000082616214,0.009336554,0.00001729845,0.000009443056,0.000028958953,0.000058035814,0.000013116375,0.00071256387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996238,0.00008040708,0.000013418009,0.000044447293,0.00017457354,0.00006329234],"domain_scores_gemma":[0.99901867,0.00033562852,0.00013627045,0.00013046667,0.00035210047,0.000026821783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060707645,0.00019357644,0.00025053814,0.00052891934,0.00035155588,0.0003534423,0.0005440105,0.00022733232,0.0011517034],"category_scores_gemma":[0.0016146147,0.00008721227,0.00019906237,0.00060868124,0.0003932896,0.00059722003,0.00024090275,0.00027852604,0.000077382174],"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.00034402913,0.00007437563,0.0050244313,0.00018826952,0.00006926312,0.00019723289,0.00013861392,0.87537277,0.02852631,0.039257806,0.0019730965,0.048833866],"study_design_scores_gemma":[0.0000053095855,0.000053657037,0.000567607,0.000002942978,0.00001050427,0.000033888835,0.000012580241,0.99565434,0.0019859714,0.0012864782,0.00038376736,0.000003032217],"about_ca_topic_score_codex":0.0057232417,"about_ca_topic_score_gemma":0.005689194,"teacher_disagreement_score":0.0057232417,"about_ca_system_score_codex":0.00128785,"about_ca_system_score_gemma":0.0010961628,"threshold_uncertainty_score":0.011379838},"labels":[],"label_agreement":null},{"id":"W2613125546","doi":"","title":"Exact Wirelength of Circulant Networks into Cycle-of-ladders.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Discrete mathematics","score_opus":0.012483639966617308,"score_gpt":0.2460324485260892,"score_spread":0.23354880855947188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613125546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39121112,0.0032546434,0.3911471,0.0010055768,0.00047905146,0.00008215763,0.0010972125,0.0010751545,0.21064803],"genre_scores_gemma":[0.9306403,0.0012144105,0.04025369,0.00023019771,0.00020391199,0.00009273434,0.0004479602,0.00045522352,0.026461544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996985,0.00006225064,0.000014321758,0.000051184696,0.00011402387,0.000059669554],"domain_scores_gemma":[0.9989881,0.0004489439,0.00014225181,0.00015315469,0.0001502086,0.00011728038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036602488,0.00051075354,0.00043866842,0.0013764879,0.00068119384,0.0016790535,0.0010145019,0.00076748437,0.011597046],"category_scores_gemma":[0.003471675,0.00043727795,0.00035443838,0.0009131521,0.0009686148,0.003193582,0.0008796033,0.0012146635,0.0018464819],"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.000049201535,0.000028710441,0.00029719787,0.00010080385,0.000012048572,0.00007319878,0.00010468505,0.01222025,0.0024931508,0.96190387,0.003832415,0.01888454],"study_design_scores_gemma":[0.000008977926,0.000016674156,0.00022638917,0.000026702866,0.0000074225327,0.00007300287,0.000032334854,0.038776256,0.0009734997,0.955973,0.003876096,0.000009613775],"about_ca_topic_score_codex":0.00089339074,"about_ca_topic_score_gemma":0.0020872331,"teacher_disagreement_score":0.011597046,"about_ca_system_score_codex":0.0010355051,"about_ca_system_score_gemma":0.0005202593,"threshold_uncertainty_score":0.038795948},"labels":[],"label_agreement":null},{"id":"W2623363686","doi":"","title":"Routers vs Switches, How Much More Power Do They Really Consume? A Datasheet Analysis","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Datasheet; Computer science; Computer network; Energy consumption; Power consumption; Power (physics); Consumption (sociology); Engineering; Electrical engineering; Operating system","score_opus":0.015539439360455523,"score_gpt":0.22191824615633346,"score_spread":0.20637880679587794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623363686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92148644,0.002981801,0.050533727,0.0012640216,0.00007860931,0.00008989699,0.008589315,0.00085639185,0.014119805],"genre_scores_gemma":[0.9788663,0.0012637211,0.012084381,0.00017165518,0.000043383265,0.000055347562,0.0032863745,0.00025280402,0.003975992],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922776,0.00008223561,0.000057780187,0.00017130909,0.00039272098,0.00006824169],"domain_scores_gemma":[0.9972097,0.001647199,0.00023191035,0.00034427672,0.000517176,0.000049672082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049722556,0.0003530227,0.00045325354,0.0018031647,0.00024092432,0.0013175355,0.0005803342,0.00027520696,0.002694824],"category_scores_gemma":[0.0038979575,0.00032773675,0.00038322108,0.0033497834,0.00032677923,0.0023934427,0.00023261007,0.00043708144,0.0004740298],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013307523,0.00029496674,0.2612976,0.00084189797,0.0006706703,0.00068302656,0.0012453296,0.10071393,0.039609525,0.031730764,0.014575104,0.54700637],"study_design_scores_gemma":[0.00009193792,0.0011055622,0.48958665,0.00028073505,0.0007249707,0.0020008457,0.003951547,0.25434107,0.093189195,0.051500306,0.102996364,0.00023084818],"about_ca_topic_score_codex":0.0034430367,"about_ca_topic_score_gemma":0.004491876,"teacher_disagreement_score":0.0034430367,"about_ca_system_score_codex":0.0005431592,"about_ca_system_score_gemma":0.00031397783,"threshold_uncertainty_score":0.009015083},"labels":[],"label_agreement":null},{"id":"W2625111074","doi":"10.1145/3073763.3073766","title":"Optimal application mapping to 2D-mesh NoCs by using a tabu-based particle swarm methodology","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Tabu search; Multi-swarm optimization; Computer science; Mathematical optimization; Metaheuristic; Network on a chip; Swarm behaviour; Algorithm; Mathematics; Computer network","score_opus":0.1293587379361044,"score_gpt":0.3440655459357052,"score_spread":0.21470680799960082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625111074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042358052,0.00022058238,0.95300335,0.00010746996,0.00005004208,0.00009365172,0.000037259328,0.0004347783,0.0036948738],"genre_scores_gemma":[0.44819364,0.0001891716,0.548395,0.00009286136,0.000024686571,0.00028878378,0.000105553765,0.00012019548,0.002590093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998603,0.00005693761,0.0000066077987,0.000019629468,0.00003922909,0.000017382554],"domain_scores_gemma":[0.99973017,0.00015009269,0.000030658895,0.000028449185,0.000046494955,0.0000141727505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048183088,0.0006012116,0.00060611527,0.0006119422,0.00043788546,0.0005707401,0.00078024366,0.0006973303,0.0017168019],"category_scores_gemma":[0.0010469761,0.00034407346,0.00055136945,0.0005207843,0.00038010877,0.00046407036,0.00050210475,0.00042239594,0.00021967464],"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.000021315314,0.0000263004,0.0002369812,0.000032293854,0.000020069978,0.000020848549,0.00003112759,0.9708473,0.001721434,0.0021770971,0.0003420228,0.024523256],"study_design_scores_gemma":[0.000004312282,0.000012373022,0.000031698564,0.0000018044761,0.000002293129,0.0000044525423,0.000005290799,0.99897873,0.0002885355,0.00047774753,0.000191204,0.0000014755752],"about_ca_topic_score_codex":0.0035326115,"about_ca_topic_score_gemma":0.0032176815,"teacher_disagreement_score":0.0035326115,"about_ca_system_score_codex":0.0005707888,"about_ca_system_score_gemma":0.000753969,"threshold_uncertainty_score":0.0070241094},"labels":[],"label_agreement":null},{"id":"W2713939471","doi":"","title":"Architecture de réseau vs géométrie de la séparation / Architecture of Network vs. Geometry of Separation","year":2016,"lang":"fr","type":"article","venue":"Esse/Esse arts + opinions","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Architecture; Geometry; Mathematics; Art","score_opus":0.017348811993954744,"score_gpt":0.29726766855203807,"score_spread":0.27991885655808335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2713939471","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09122256,0.004579578,0.6919971,0.0045932047,0.00041135272,0.00005775282,0.0001696228,0.000552481,0.20641638],"genre_scores_gemma":[0.8270246,0.0040036896,0.12922965,0.00043899007,0.00043661727,0.00010683788,0.00025534685,0.00022529898,0.038278833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995684,0.00011730263,0.000021049644,0.000089247995,0.00014881098,0.00005514315],"domain_scores_gemma":[0.99960095,0.00009348152,0.000052691637,0.00009225348,0.000116355164,0.000044422886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005859975,0.000416478,0.00027561525,0.000828181,0.0006743242,0.0025340104,0.0006832972,0.00075322366,0.0060808784],"category_scores_gemma":[0.00087444193,0.00025090817,0.0004936212,0.0005851318,0.0031967468,0.0033573443,0.0010959217,0.0014036675,0.001261229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012979223,0.0000027362573,0.000058792815,0.000019225656,0.0000034153543,0.000012249064,0.000055267094,0.0032856707,0.0010760777,0.9880938,0.000522013,0.006857745],"study_design_scores_gemma":[0.00001411837,0.000034717163,0.00034498624,0.000021392887,0.000010008283,0.00013819606,0.00012680929,0.023694212,0.003053548,0.9423939,0.030153492,0.0000146923785],"about_ca_topic_score_codex":0.0016451386,"about_ca_topic_score_gemma":0.0010713158,"teacher_disagreement_score":0.0060808784,"about_ca_system_score_codex":0.0015342232,"about_ca_system_score_gemma":0.0007109061,"threshold_uncertainty_score":0.020342529},"labels":[],"label_agreement":null},{"id":"W2726529114","doi":"10.1007/978-3-319-61566-0_50","title":"Congestion Aware Routing for On-Chip Communication in NoC Systems","year":2017,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Router; Computer network; Network packet; Header; Wormhole; Routing (electronic design automation); Interconnection; Network on a chip; Network congestion; Throughput; Distributed computing; Telecommunications; Wireless","score_opus":0.0381016693052633,"score_gpt":0.29749767427248686,"score_spread":0.25939600496722354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726529114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022318954,0.084703706,0.7400607,0.001602008,0.0033502553,0.00016662388,0.0002474781,0.002745343,0.14480498],"genre_scores_gemma":[0.4135335,0.082517445,0.27010062,0.0010679045,0.002146855,0.0002273148,0.0009930364,0.0011020341,0.22831136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998135,0.000029261293,0.00000880019,0.000032514577,0.000093004084,0.0000229257],"domain_scores_gemma":[0.99982196,0.00006976932,0.000014476233,0.000032613487,0.00005115451,0.000010189208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024251269,0.0006138269,0.00040220545,0.0004441231,0.00029617135,0.0008800762,0.001031363,0.0005918716,0.0075427457],"category_scores_gemma":[0.0006516295,0.00026076235,0.00028961446,0.00070342456,0.0002608991,0.0009858608,0.00058088923,0.0009105973,0.0013201633],"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.00006942062,0.000096775744,0.00020920452,0.0012138358,0.00006596387,0.00015990263,0.00014788561,0.11394567,0.028559387,0.11093835,0.051571332,0.6930223],"study_design_scores_gemma":[0.0000224056,0.00028499367,0.0007753088,0.00039946832,0.00011638962,0.0007651206,0.000096796575,0.47435695,0.018867267,0.114711635,0.38954008,0.00006368491],"about_ca_topic_score_codex":0.0007107164,"about_ca_topic_score_gemma":0.0013603431,"teacher_disagreement_score":0.0075427457,"about_ca_system_score_codex":0.0006476337,"about_ca_system_score_gemma":0.00046809908,"threshold_uncertainty_score":0.02523303},"labels":[],"label_agreement":null},{"id":"W2735462985","doi":"","title":"Dodec: A Random-link Approach for Low-radix On-chip Networks","year":2013,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Radix (gastropod); Link (geometry); Chip; Computer science; Arithmetic; Mathematics; Parallel computing; Computer network; Telecommunications","score_opus":0.004201753038885054,"score_gpt":0.15205479007021294,"score_spread":0.14785303703132788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735462985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011393261,0.00028120575,0.9804097,0.00016607145,0.000056765777,0.00010703028,0.000078773985,0.0008954364,0.006611844],"genre_scores_gemma":[0.25655606,0.0006458393,0.7324621,0.00021562239,0.000068927046,0.00034658896,0.00034738262,0.00031156972,0.009045884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.00010214947,0.000016325686,0.000058085956,0.00013166908,0.000045329543],"domain_scores_gemma":[0.9994086,0.00020099619,0.00006002936,0.00016258552,0.00013335951,0.00003449054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815768,0.0004913281,0.0003595623,0.00081520865,0.0007243069,0.0008445325,0.0012468761,0.00052720244,0.0038537744],"category_scores_gemma":[0.0018210219,0.00026065548,0.00038846012,0.00068801077,0.0005325122,0.00090332504,0.00085565314,0.0008280886,0.0006377204],"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.00013403241,0.0001230042,0.00085648766,0.0001915434,0.000057667294,0.00013826344,0.0000687438,0.6160945,0.019291138,0.15654813,0.008482629,0.19801389],"study_design_scores_gemma":[0.000032812935,0.00008995029,0.00021029271,0.000020829186,0.000025796666,0.00013324381,0.0000279955,0.9401179,0.008695315,0.03189718,0.018730473,0.000018170693],"about_ca_topic_score_codex":0.0013296405,"about_ca_topic_score_gemma":0.003262037,"teacher_disagreement_score":0.0038537744,"about_ca_system_score_codex":0.0008408225,"about_ca_system_score_gemma":0.0007771882,"threshold_uncertainty_score":0.012892127},"labels":[],"label_agreement":null},{"id":"W2739725956","doi":"","title":"Simplifying system-on-chip design through architecture and system cad tools","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Toronto","funders":"University of Toronto; Government of Ontario; Iris O'Brien Foundation","keywords":"Datapath; Reconfigurability; Embedded system; Computer architecture; Application-specific integrated circuit; Field-programmable gate array; System on a chip; Reuse; Abstraction layer; Computer science; FPGA prototype; Integrated circuit design; Engineering; Software; Telecommunications","score_opus":0.03942994233753699,"score_gpt":0.2746734162715291,"score_spread":0.2352434739339921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739725956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003201991,0.00028992398,0.9878572,0.00017270184,0.000047615227,0.000088127,0.0000515816,0.0011762785,0.007114654],"genre_scores_gemma":[0.0436985,0.0010780885,0.9513411,0.000109055545,0.00003056111,0.00025704288,0.00021471904,0.00029670505,0.002974272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987476,0.00040130434,0.00007683455,0.00009618793,0.00058765116,0.00009042951],"domain_scores_gemma":[0.9985135,0.0006030012,0.00008469845,0.00051751744,0.0002472004,0.00003400512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014435339,0.0011367232,0.00049446773,0.0009156203,0.00053296133,0.0021166692,0.0013985657,0.00061137794,0.0045427643],"category_scores_gemma":[0.0038115853,0.0006420684,0.00074194453,0.0006821816,0.000980991,0.0018369929,0.0012756585,0.0019669759,0.0020165357],"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.00003823076,0.0000948101,0.00079725165,0.00068994926,0.000077651726,0.00034128365,0.00050169945,0.3091445,0.023219237,0.30700102,0.0067082257,0.3513861],"study_design_scores_gemma":[0.00008321142,0.00022877783,0.00058955414,0.00038677777,0.000108113294,0.00053115544,0.00022856807,0.56508195,0.025314864,0.1553924,0.2519875,0.000067081644],"about_ca_topic_score_codex":0.0022592377,"about_ca_topic_score_gemma":0.0039852555,"teacher_disagreement_score":0.0045427643,"about_ca_system_score_codex":0.00074344216,"about_ca_system_score_gemma":0.0020749895,"threshold_uncertainty_score":0.015197098},"labels":[],"label_agreement":null},{"id":"W2752066938","doi":"10.1109/icppw.2017.34","title":"Efficient Broadcasting Algorithm in Harary-like Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"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":"Logarithm; Broadcasting (networking); Computer science; Degree (music); Graph; Simple (philosophy); Combinatorics; Algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Computer network","score_opus":0.017949754839364666,"score_gpt":0.24837738742677015,"score_spread":0.23042763258740548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752066938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36672774,0.0008920034,0.61221355,0.00063038676,0.00007197392,0.00014831279,0.00022683828,0.0013040783,0.017785195],"genre_scores_gemma":[0.8455548,0.0003439713,0.1485729,0.00013917353,0.000028255463,0.00009424517,0.0003168498,0.00008896579,0.0048608338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.00015425145,0.000028193128,0.00011949643,0.00013301606,0.00010975935],"domain_scores_gemma":[0.9986941,0.0005661406,0.00018440704,0.00022936588,0.00021184592,0.00011422052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536318,0.0002314645,0.0004385733,0.0005159205,0.0009144847,0.0008319034,0.0010591389,0.0005695373,0.0020892045],"category_scores_gemma":[0.0026956073,0.0002107313,0.00023935619,0.00073078816,0.00059891475,0.001706368,0.0010034919,0.00062254403,0.0003207961],"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.00096112606,0.00017492325,0.0021854641,0.0003803334,0.00007757658,0.00029921802,0.00085349265,0.3209275,0.07686685,0.42739356,0.0070278835,0.16285208],"study_design_scores_gemma":[0.00010516372,0.00024709693,0.0009503986,0.000031308675,0.000036369926,0.0002457344,0.00018860905,0.85737,0.023996498,0.109327346,0.00746951,0.000031923322],"about_ca_topic_score_codex":0.002210548,"about_ca_topic_score_gemma":0.0025391986,"teacher_disagreement_score":0.002210548,"about_ca_system_score_codex":0.0013093138,"about_ca_system_score_gemma":0.0009987749,"threshold_uncertainty_score":0.009499848},"labels":[],"label_agreement":null},{"id":"W2758067934","doi":"10.1109/iscas.2017.8050443","title":"A 8-Gb/s 0.256-pJ/b transceiver for 5-mm on-chip interconnects in 130-nm CMOS","year":2017,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Transceiver; CMOS; Transmitter; Electrical engineering; Chip; Amplifier; Voltage; Electronic engineering; Optoelectronics; Engineering; Computer science; Materials science; Channel (broadcasting)","score_opus":0.039323417874536984,"score_gpt":0.28609563052520104,"score_spread":0.24677221265066407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758067934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398945,0.0018615532,0.1211196,0.000823784,0.0003089535,0.00019564494,0.00050978345,0.002134287,0.033151854],"genre_scores_gemma":[0.9283304,0.0005292683,0.05778124,0.00019688018,0.000057846853,0.000050687962,0.00033130572,0.00010372106,0.012618647],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999281,0.000008075749,0.0000034936309,0.000013051428,0.000034784032,0.000012506819],"domain_scores_gemma":[0.99991775,0.000020686835,0.000016359983,0.0000069678026,0.00002679507,0.000011440754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001360602,0.00021415732,0.00016535405,0.00024016955,0.00030469027,0.00041820583,0.00049259467,0.00039946416,0.0027984402],"category_scores_gemma":[0.00029341647,0.00010716547,0.00011362009,0.00023151858,0.000095043775,0.00045972466,0.00019894549,0.00024958779,0.000733141],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00016558304,0.00013073724,0.0022264365,0.0003662671,0.000052547384,0.00050257996,0.00024947847,0.0055013075,0.929881,0.0055837245,0.0052415053,0.050098818],"study_design_scores_gemma":[0.0001959501,0.0037534116,0.01255157,0.00018117273,0.00022828282,0.0030359772,0.00053383096,0.10050658,0.7442282,0.0024628977,0.13221267,0.00010947887],"about_ca_topic_score_codex":0.00092863035,"about_ca_topic_score_gemma":0.003524306,"teacher_disagreement_score":0.0027984402,"about_ca_system_score_codex":0.00037939777,"about_ca_system_score_gemma":0.00049262657,"threshold_uncertainty_score":0.009361684},"labels":[],"label_agreement":null},{"id":"W2758760487","doi":"10.1109/dsd.2017.22","title":"Optimal Placement of Heterogeneous Uncore Component in 3D Chip-Multiprocessors","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Parallel computing; Computer science; Parsec; Component (thermodynamics); Energy consumption; Memory architecture; Chip; Embedded system; Engineering; Electrical engineering","score_opus":0.024918640445447195,"score_gpt":0.2650856447085929,"score_spread":0.24016700426314572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758760487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07326575,0.00035460718,0.92110974,0.00021757536,0.000034054963,0.000042302137,0.00012377472,0.00034436278,0.004507933],"genre_scores_gemma":[0.82517874,0.00029472497,0.17032158,0.000109685774,0.000016552198,0.0001285788,0.00016292122,0.00014603398,0.0036411313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997532,0.000075325675,0.000009543071,0.000059077865,0.000057282465,0.000045606364],"domain_scores_gemma":[0.9997495,0.000102368795,0.000046892797,0.000027408363,0.00004870419,0.00002516414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033285646,0.00097527745,0.0007150539,0.00040701925,0.0003855862,0.0008704305,0.0009048984,0.0008548187,0.0014921309],"category_scores_gemma":[0.0009191516,0.00067508424,0.00055981573,0.0004161401,0.00057785766,0.0008099932,0.0007777684,0.00050887995,0.00030661438],"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.000012130294,0.0000062261406,0.00011323905,0.000011809608,0.000007998405,0.000028939268,0.000007062769,0.9945263,0.0012993792,0.0011260965,0.00014000718,0.0027207742],"study_design_scores_gemma":[0.00000182039,0.000010850547,0.000046746045,0.0000013008215,0.000003037624,0.0000058379387,0.0000072363828,0.9985177,0.00045413635,0.0008063447,0.00014322376,0.0000017872314],"about_ca_topic_score_codex":0.0045554256,"about_ca_topic_score_gemma":0.0055463235,"teacher_disagreement_score":0.0045554256,"about_ca_system_score_codex":0.0010653782,"about_ca_system_score_gemma":0.0009324338,"threshold_uncertainty_score":0.00905782},"labels":[],"label_agreement":null},{"id":"W2759011610","doi":"","title":"A Square Time Algorithm for Cyclic Edge Connectivity of Planar Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Square (algebra); Enhanced Data Rates for GSM Evolution; Planar; Combinatorics; Planar graph; Algorithm; Discrete mathematics; Graph; Geometry; Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.015807182949412888,"score_gpt":0.25185257081406776,"score_spread":0.23604538786465487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759011610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10720911,0.0009382597,0.8447714,0.0014411036,0.00028610474,0.00047784753,0.0012678434,0.0069975746,0.03661074],"genre_scores_gemma":[0.43220016,0.0003610015,0.54676765,0.0004011388,0.00012114105,0.0004202209,0.0027008904,0.00067180576,0.016356025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994381,0.00010714328,0.000035914283,0.00015428057,0.00014872108,0.00011595783],"domain_scores_gemma":[0.9980095,0.0010338359,0.00013472015,0.00042414767,0.00026491325,0.00013286342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000416055,0.00067592174,0.00054937834,0.0009363345,0.00074379286,0.0013418474,0.0017607588,0.0010381172,0.015063379],"category_scores_gemma":[0.004422951,0.00034527673,0.00049458107,0.0019296814,0.00069779035,0.0024741713,0.0017179046,0.000980416,0.0025942347],"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.001255776,0.00048451129,0.0017870548,0.00055697944,0.000100468395,0.0002727628,0.00043594683,0.11621167,0.02373586,0.06628383,0.055806544,0.7330685],"study_design_scores_gemma":[0.00060629135,0.00047469776,0.0010804787,0.00004537637,0.00009638571,0.00034687459,0.00031779788,0.83720136,0.012148891,0.12670971,0.020919902,0.000052099538],"about_ca_topic_score_codex":0.006459672,"about_ca_topic_score_gemma":0.010734337,"teacher_disagreement_score":0.015063379,"about_ca_system_score_codex":0.0010600125,"about_ca_system_score_gemma":0.0021723092,"threshold_uncertainty_score":0.05039203},"labels":[],"label_agreement":null},{"id":"W2759310240","doi":"","title":"Bounds of the Sum-connectivity Energy of Graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013258359672121217,"score_gpt":0.23163354727692634,"score_spread":0.21837518760480512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759310240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15914638,0.021351729,0.4309673,0.009789233,0.0016421231,0.000081227445,0.0026148723,0.0011451504,0.37326193],"genre_scores_gemma":[0.91562015,0.0063462835,0.034897313,0.0012209419,0.0010293208,0.00027062127,0.001241525,0.0006754015,0.038698453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988097,0.00029038682,0.000048725462,0.00022345883,0.0004212593,0.00020647692],"domain_scores_gemma":[0.99210316,0.0058073606,0.00034461182,0.00075034157,0.0005867226,0.00040784123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011795722,0.0015812191,0.00096520764,0.003193626,0.0011590708,0.003006016,0.0027529474,0.0018730272,0.02111544],"category_scores_gemma":[0.012093239,0.000512233,0.00074259704,0.0024436368,0.0018297039,0.0057466086,0.0030500004,0.0034576058,0.002859116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014412779,0.000084672385,0.0010145188,0.00047534582,0.0001114831,0.00021008984,0.00019289558,0.045669835,0.003958451,0.8912375,0.017301327,0.03959983],"study_design_scores_gemma":[0.000008985626,0.000028363176,0.0008859539,0.00011408145,0.000044249602,0.00026992022,0.00008434958,0.0902769,0.0021742044,0.8985838,0.007507085,0.000022143344],"about_ca_topic_score_codex":0.00056927186,"about_ca_topic_score_gemma":0.0011405515,"teacher_disagreement_score":0.02111544,"about_ca_system_score_codex":0.0013725784,"about_ca_system_score_gemma":0.00038754227,"threshold_uncertainty_score":0.07063824},"labels":[],"label_agreement":null},{"id":"W2760781693","doi":"","title":"On Fairness-Efficiency Tradeoffs for Multi-Resource Packet Processing","year":2013,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Weighted fair queueing; Computer science; Generalized processor sharing; Network packet; Queueing theory; Fair queuing; Computer network; Fairness measure; Distributed computing; Scheduling (production processes); Bandwidth (computing); Packet switching; Schedule; Round-robin scheduling; Throughput; Dynamic priority scheduling; Mathematical optimization; Quality of service; Operating system","score_opus":0.03836597184131473,"score_gpt":0.26843351062961096,"score_spread":0.23006753878829622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760781693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387751,0.005305928,0.85286814,0.0074307714,0.00047582178,0.00017529244,0.00009258297,0.00025232797,0.029521607],"genre_scores_gemma":[0.9367012,0.0012827696,0.058519397,0.0005640067,0.00062286656,0.00010547192,0.00003110097,0.0001093187,0.0020638448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99215066,0.0041911374,0.00027992058,0.0007621517,0.0017315635,0.00088457455],"domain_scores_gemma":[0.94354534,0.04682903,0.002030541,0.0031383717,0.0032548832,0.0012017266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018112605,0.0011035528,0.0014089737,0.0018472826,0.0018621074,0.0040655457,0.002396243,0.002473316,0.0028862115],"category_scores_gemma":[0.052153755,0.0007100564,0.0006066461,0.0015569623,0.004430039,0.009548701,0.0024794245,0.00349252,0.00058003503],"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.000947448,0.00027684608,0.0024681836,0.00023719363,0.00008353835,0.00016800285,0.0003107951,0.419329,0.0073682102,0.51352555,0.0029256074,0.052359667],"study_design_scores_gemma":[0.000053317086,0.00012430582,0.00041938954,0.000046110417,0.000021711689,0.00006562393,0.0000614088,0.77911556,0.0023254245,0.21637815,0.0013576531,0.000031285414],"about_ca_topic_score_codex":0.0019198093,"about_ca_topic_score_gemma":0.0010174424,"teacher_disagreement_score":0.018112605,"about_ca_system_score_codex":0.0051259026,"about_ca_system_score_gemma":0.0018205565,"threshold_uncertainty_score":0.09578973},"labels":[],"label_agreement":null},{"id":"W2762028946","doi":"10.23919/fpl.2017.8056807","title":"Quantifying and mitigating the costs of FPGA virtualization","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"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":"Virtualization; Field-programmable gate array; Computer science; Cloud computing; Embedded system; Porting; Latency (audio); Routing (electronic design automation); Operating system; Software; Telecommunications","score_opus":0.05083226221307862,"score_gpt":0.29894087047132756,"score_spread":0.24810860825824893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762028946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9052858,0.0024395925,0.069467776,0.0012887758,0.00014380479,0.00018977003,0.0004555823,0.00030540704,0.020423474],"genre_scores_gemma":[0.98258084,0.00038079135,0.016062625,0.00003697808,0.000019280229,0.00003707285,0.00012756481,0.00004490986,0.0007097862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753344,0.0007716559,0.000100869904,0.00015658239,0.00084950053,0.0005879497],"domain_scores_gemma":[0.986375,0.009000462,0.0016951177,0.0011931407,0.0014891209,0.00024730293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061349,0.0011861094,0.00045947233,0.0018874488,0.0007329373,0.0018462692,0.0011803113,0.00077829923,0.0020225027],"category_scores_gemma":[0.012563008,0.00043918204,0.0005223488,0.0019045959,0.00088233093,0.00382889,0.00094584114,0.0008697506,0.00017411831],"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.0006846959,0.00029068967,0.027162306,0.00034227956,0.00019633467,0.00037589777,0.00013239805,0.8048053,0.015574723,0.03368169,0.0024674842,0.114286155],"study_design_scores_gemma":[0.000048778493,0.00092235085,0.028229259,0.00013050242,0.00032049342,0.00069772784,0.00078286254,0.9077219,0.03575323,0.017535457,0.007741675,0.000115834606],"about_ca_topic_score_codex":0.00539149,"about_ca_topic_score_gemma":0.007678214,"teacher_disagreement_score":0.00539149,"about_ca_system_score_codex":0.002801092,"about_ca_system_score_gemma":0.0018898688,"threshold_uncertainty_score":0.020323455},"labels":[],"label_agreement":null},{"id":"W2767242928","doi":"","title":"On the path edge-connectivity of graphs.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Path (computing); Combinatorics; Computer science; Artificial intelligence; Computer network","score_opus":0.01736953347971534,"score_gpt":0.23910480072919002,"score_spread":0.22173526724947468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767242928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23670132,0.019518431,0.47180215,0.010637391,0.0018125735,0.00015081548,0.0024083266,0.0005623244,0.25640672],"genre_scores_gemma":[0.8775147,0.014749731,0.06828592,0.001887373,0.00218308,0.00027240877,0.0019040944,0.00033793796,0.03286478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993506,0.00027012586,0.000034224682,0.00013116935,0.00012006131,0.00009386004],"domain_scores_gemma":[0.994925,0.0038012853,0.00032468658,0.00032758788,0.00034060417,0.0002807376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089903944,0.00067086145,0.000668479,0.002293445,0.0009780406,0.0015497472,0.0011168609,0.0015564797,0.013201077],"category_scores_gemma":[0.008511263,0.0004154769,0.0004720618,0.0022708888,0.0026407875,0.0075087617,0.0016121684,0.002612885,0.0016911888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006559243,0.000029463215,0.00083629705,0.00022265394,0.00002926849,0.00016251414,0.00021170627,0.0070401356,0.0006750454,0.95033187,0.013658986,0.026736405],"study_design_scores_gemma":[0.000011222601,0.000024943038,0.0003949898,0.000042564618,0.0000137299985,0.0001440647,0.000078863515,0.00987661,0.00016859616,0.9826873,0.0065491833,0.00000780297],"about_ca_topic_score_codex":0.0009758845,"about_ca_topic_score_gemma":0.0012801217,"teacher_disagreement_score":0.013201077,"about_ca_system_score_codex":0.0007501903,"about_ca_system_score_gemma":0.0003533131,"threshold_uncertainty_score":0.044162035},"labels":[],"label_agreement":null},{"id":"W2769986458","doi":"10.1145/3152434.3152461","title":"In-Network Computation is a Dumb Idea Whose Time Has Come","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":275,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Computation; Algorithm","score_opus":0.028990539653121466,"score_gpt":0.2714978920376686,"score_spread":0.24250735238454715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769986458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035362948,0.02559387,0.607456,0.10267052,0.007236525,0.00008287156,0.00045869252,0.0016882305,0.21945034],"genre_scores_gemma":[0.6887961,0.029301327,0.18910404,0.012535242,0.006588591,0.00025563018,0.00033705172,0.0008941272,0.07218787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900347,0.00027551607,0.000041048228,0.00022867869,0.0003507027,0.000100498706],"domain_scores_gemma":[0.99642473,0.001466627,0.00017870948,0.0013405142,0.00038980285,0.0001995307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018688205,0.0007103339,0.0007693582,0.000560583,0.002151546,0.0056226295,0.0014186903,0.0022990764,0.008478013],"category_scores_gemma":[0.0064901323,0.00049149245,0.0004061127,0.000746926,0.008721862,0.02205928,0.0023252743,0.0053758333,0.00257129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045887467,0.000015871568,0.00010109151,0.00009037558,0.000009358745,0.00002125044,0.00011857055,0.0010747781,0.0008759498,0.9725874,0.0061445525,0.018915],"study_design_scores_gemma":[0.000015558906,0.000024827612,0.00008873888,0.00007549854,0.0000085080965,0.00007818709,0.00015370021,0.0034215022,0.0015087761,0.8938279,0.100779474,0.000017345827],"about_ca_topic_score_codex":0.000892884,"about_ca_topic_score_gemma":0.0010476729,"teacher_disagreement_score":0.008478013,"about_ca_system_score_codex":0.0016551331,"about_ca_system_score_gemma":0.0012940674,"threshold_uncertainty_score":0.028361797},"labels":[],"label_agreement":null},{"id":"W2775079186","doi":"10.4018/978-1-60566-026-4.ch267","title":"Graph Encoding and Transitive Closure Representation","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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 Winnipeg","funders":"","keywords":"Transitive closure; Reachability; Digraph; Computer science; Theoretical computer science; Directed graph; Graph; Combinatorics; Discrete mathematics; Mathematics; Algorithm","score_opus":0.020502796213718085,"score_gpt":0.24782384977739833,"score_spread":0.22732105356368024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775079186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009548563,0.0004425095,0.9699737,0.000571602,0.00018121144,0.00017654266,0.0029589715,0.004470058,0.011676929],"genre_scores_gemma":[0.18216437,0.0013291723,0.795615,0.0002686348,0.00018661082,0.00046123966,0.008635223,0.00094379974,0.01039596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989562,0.00023202246,0.00013021762,0.0002759732,0.0003168771,0.00008875481],"domain_scores_gemma":[0.99804187,0.00076952495,0.00025784288,0.0005255462,0.00033623923,0.0000689952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559503,0.0007746757,0.00063153106,0.002113858,0.0006093424,0.0034011188,0.001183671,0.00088763365,0.006879375],"category_scores_gemma":[0.003689125,0.0004603853,0.0010662092,0.003163432,0.0008788795,0.004854581,0.0010101964,0.0013655969,0.0019360374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017562875,0.00016267714,0.00042009642,0.000422377,0.00003277548,0.0005346706,0.0007618525,0.043274526,0.00807593,0.63198453,0.020465303,0.29368967],"study_design_scores_gemma":[0.00006756996,0.00009130635,0.00027314576,0.00017949539,0.00006201267,0.00065073645,0.000356624,0.2632414,0.013159445,0.61156267,0.110282645,0.000072917166],"about_ca_topic_score_codex":0.0039712605,"about_ca_topic_score_gemma":0.0032631552,"teacher_disagreement_score":0.006879375,"about_ca_system_score_codex":0.0013978181,"about_ca_system_score_gemma":0.0013102662,"threshold_uncertainty_score":0.02301383},"labels":[],"label_agreement":null},{"id":"W2775294075","doi":"10.1109/pacrim.2017.8121892","title":"Data-flow implementation of concurrent asynchronous systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Victoria","funders":"","keywords":"Computer science; Asynchronous communication; Correctness; Distributed computing; Embedded system; Scheduling (production processes); Synchronization (alternating current); Data flow diagram; Model of computation; Multi-core processor; Computation; Parallel computing; Computer network; Channel (broadcasting)","score_opus":0.0676412290570412,"score_gpt":0.35168059434869436,"score_spread":0.2840393652916532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775294075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014055229,0.0000951432,0.9784347,0.0000922266,0.000083472005,0.00011584919,0.000082764636,0.0012019161,0.00583862],"genre_scores_gemma":[0.57720727,0.0002613747,0.4131315,0.00015113608,0.00006946516,0.0005487514,0.00032641643,0.00015650602,0.008147545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993629,0.0001739288,0.00007180923,0.00008577187,0.00022795584,0.00007768206],"domain_scores_gemma":[0.9991013,0.0003387366,0.00007334746,0.00017082314,0.00027757944,0.00003821742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009209276,0.00046840444,0.00025148777,0.0005027997,0.00048525943,0.0011628263,0.0011729934,0.00057029014,0.0034709894],"category_scores_gemma":[0.0022388636,0.0002593874,0.00044964408,0.0003451464,0.00050949416,0.0011371212,0.00064169645,0.00069833617,0.00049706706],"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.00045586147,0.00028356325,0.0015487471,0.00037467314,0.00004536315,0.00034261483,0.0005823045,0.21894377,0.02930316,0.59394807,0.0039255205,0.15024635],"study_design_scores_gemma":[0.00010756087,0.00011708559,0.00010680792,0.000034727513,0.000024984036,0.00007569339,0.000026180898,0.9005752,0.021748666,0.057079572,0.020083373,0.00002017327],"about_ca_topic_score_codex":0.0014696871,"about_ca_topic_score_gemma":0.0013425171,"teacher_disagreement_score":0.0034709894,"about_ca_system_score_codex":0.00081000826,"about_ca_system_score_gemma":0.0010266257,"threshold_uncertainty_score":0.011611581},"labels":[],"label_agreement":null},{"id":"W2775875217","doi":"10.1007/s004530010030","title":"Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Binary logarithm; Bounded function; Parallel computing; Logarithm; Fault tolerance; Constant (computer programming); Fraction (chemistry); Theory of computation; Fault (geology); Log-log plot; Algorithm; Distributed computing; Combinatorics; Computer network; Mathematics","score_opus":0.012021439677676332,"score_gpt":0.22136921163421647,"score_spread":0.20934777195654014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775875217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14776178,0.0006377999,0.8423121,0.0014584044,0.000157394,0.00012884564,0.00022593583,0.00089143676,0.0064263893],"genre_scores_gemma":[0.86041373,0.00037584596,0.13309991,0.00023307904,0.00014853291,0.00021697175,0.00019129348,0.00015881185,0.0051618833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984182,0.0005474807,0.00008360444,0.0003851475,0.0002615173,0.0003041365],"domain_scores_gemma":[0.979471,0.015465412,0.00091687223,0.002625652,0.0010647149,0.00045630164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388235,0.001005765,0.0015091577,0.0008667434,0.000990531,0.0013387755,0.0025997853,0.0018270531,0.0029385039],"category_scores_gemma":[0.0214901,0.00084371935,0.000591385,0.0011577014,0.001803782,0.0035377264,0.0026807294,0.0014480781,0.000493906],"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.0023370127,0.00018070577,0.0015054356,0.00048504863,0.00010039583,0.0002227489,0.0003469046,0.83012134,0.018354394,0.0615513,0.0052038697,0.07959083],"study_design_scores_gemma":[0.00017210969,0.00009152705,0.00023452922,0.00001898009,0.000044521807,0.00007830822,0.00005847957,0.9476047,0.0038031728,0.047177885,0.00070126314,0.000014431498],"about_ca_topic_score_codex":0.0019159775,"about_ca_topic_score_gemma":0.0027064262,"teacher_disagreement_score":0.0029385039,"about_ca_system_score_codex":0.0018788261,"about_ca_system_score_gemma":0.0015393081,"threshold_uncertainty_score":0.01363194},"labels":[],"label_agreement":null},{"id":"W2778031277","doi":"10.1109/socc.2017.8226008","title":"Hybrid multi-swarm optimization based NoC synthesis","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"Northeastern States Research Cooperative; CMC Microsystems","keywords":"Network on a chip; Computer science; Particle swarm optimization; Swarm behaviour; Parallel computing; Tabu search; Latency (audio); Interconnection; Power consumption; Power (physics); Mathematical optimization; Algorithm; Embedded system; Mathematics; Computer network","score_opus":0.03401234743421679,"score_gpt":0.2596057830711458,"score_spread":0.225593435636929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778031277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043375462,0.0002897121,0.95036775,0.00008368308,0.000052211803,0.000082271305,0.00004307213,0.00045479962,0.005251107],"genre_scores_gemma":[0.5902251,0.00022679493,0.4056774,0.00008299909,0.000023375875,0.00035831815,0.00014606815,0.0000840878,0.0031758703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999777,0.000059378137,0.000012125269,0.00003734824,0.00008499428,0.00002914657],"domain_scores_gemma":[0.9997123,0.00013984965,0.00003740528,0.00003034654,0.00006688803,0.0000131657725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042361044,0.0005534922,0.00060963054,0.00050380715,0.00029626512,0.00046613193,0.00068961777,0.0005435409,0.0012060445],"category_scores_gemma":[0.0007658336,0.00030190882,0.0006127967,0.00045408276,0.00036660038,0.0003629703,0.00050009915,0.00032721754,0.0001563366],"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.000023787592,0.000020804831,0.00020379726,0.000048528673,0.000020532721,0.000028802373,0.000024324914,0.9649526,0.0053166486,0.0027897577,0.00026308084,0.02630735],"study_design_scores_gemma":[0.000006230875,0.000024466366,0.000049503848,0.0000022444053,0.0000038282383,0.000006076944,0.000003573579,0.9982589,0.00079508696,0.00052424765,0.00032391737,0.0000019020194],"about_ca_topic_score_codex":0.0019096005,"about_ca_topic_score_gemma":0.0017627798,"teacher_disagreement_score":0.0019096005,"about_ca_system_score_codex":0.00046440735,"about_ca_system_score_gemma":0.0005975181,"threshold_uncertainty_score":0.004034579},"labels":[],"label_agreement":null},{"id":"W2785317661","doi":"10.1109/fpt.2017.8280122","title":"HopliteRT: An efficient FPGA NoC for real-time applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Network packet; Latency (audio); Computer science; Burstiness; Router; Security token; Upper and lower bounds; Computer network; Parallel computing; Mathematics","score_opus":0.02144491692931802,"score_gpt":0.28876790432536814,"score_spread":0.2673229873960501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785317661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13189131,0.0024311605,0.79704046,0.00051775714,0.0005848852,0.000274319,0.0013165503,0.028536707,0.037406832],"genre_scores_gemma":[0.5483844,0.0010392934,0.42469946,0.00025820266,0.000085938416,0.00024930268,0.0017716495,0.00068593,0.02282578],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998369,0.000029269235,0.000010094083,0.000026781921,0.00007179665,0.000025103274],"domain_scores_gemma":[0.99979,0.00005492573,0.000021838114,0.000044208035,0.00007234718,0.000016727457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032079703,0.00036928392,0.00016852705,0.00044415018,0.00026346932,0.00045085227,0.00086882256,0.00028632264,0.0056875893],"category_scores_gemma":[0.00065757846,0.00018627709,0.00014615062,0.0003363156,0.0001480392,0.00073984783,0.00033905977,0.00025921088,0.0007127839],"study_design_candidate":"bench_or_experimental","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.00093238434,0.00016919301,0.0039380426,0.0005864491,0.00010960695,0.00036957423,0.00014577367,0.17638455,0.051918436,0.03083089,0.06765085,0.6669641],"study_design_scores_gemma":[0.0002142922,0.00059702655,0.0020142857,0.00007219914,0.00007695114,0.00040848824,0.000061307044,0.8310396,0.056894917,0.007109613,0.1014359,0.000075378324],"about_ca_topic_score_codex":0.0024342593,"about_ca_topic_score_gemma":0.0058208625,"teacher_disagreement_score":0.0056875893,"about_ca_system_score_codex":0.0005753315,"about_ca_system_score_gemma":0.000593464,"threshold_uncertainty_score":0.019026875},"labels":[],"label_agreement":null},{"id":"W2790277062","doi":"10.1016/j.ejc.2018.01.013","title":"Randomly twisted hypercubes","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; State Administration of Foreign Experts Affairs; Simons Foundation","keywords":"Hypercube; Mathematics; Combinatorics; Vertex (graph theory); Hypercube graph; Dimension (graph theory); Disjoint sets; Asymptotically optimal algorithm; Discrete mathematics; Graph; Line graph; Algorithm; Graph power","score_opus":0.012849131909337471,"score_gpt":0.21500796496726934,"score_spread":0.20215883305793186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790277062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76634663,0.0007149865,0.12338306,0.0014116315,0.00075084495,0.00012179596,0.00053201406,0.00071121077,0.10602779],"genre_scores_gemma":[0.96041375,0.00026666225,0.016884662,0.00026789543,0.00011969696,0.00013932922,0.00041848505,0.00020829562,0.021281378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994355,0.00024175992,0.000021958784,0.0000740757,0.0001047593,0.000121976664],"domain_scores_gemma":[0.99860877,0.000449805,0.00016696264,0.0002456477,0.00019938173,0.00032937448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719311,0.0005095039,0.00066627836,0.0013796812,0.0012013911,0.0018188606,0.0008022713,0.0011892086,0.014891596],"category_scores_gemma":[0.0030802742,0.0004202103,0.00038197442,0.0009118931,0.0012426013,0.0019101643,0.0023301812,0.0013685992,0.0015951822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057461247,0.0000523392,0.0006586366,0.00011927051,0.000030952717,0.0005069378,0.0002356512,0.030159412,0.009011613,0.94294715,0.0054514157,0.010251966],"study_design_scores_gemma":[0.00014349454,0.00014312909,0.00072455057,0.000079045116,0.000030090141,0.00064710603,0.00044240148,0.13571647,0.0064805904,0.844155,0.011388437,0.000049764352],"about_ca_topic_score_codex":0.00023351003,"about_ca_topic_score_gemma":0.0003418628,"teacher_disagreement_score":0.014891596,"about_ca_system_score_codex":0.00060915167,"about_ca_system_score_gemma":0.00035912602,"threshold_uncertainty_score":0.049817324},"labels":[],"label_agreement":null},{"id":"W2791325034","doi":"10.1016/j.bpj.2017.11.693","title":"USE- and State-Dependent Binding of KCNQ Channel Openers","year":2018,"lang":"en","type":"article","venue":"Biophysical Journal","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"","keywords":"Chemistry; Potassium channel; Biophysics; Binding site; Pharmacology; Mutant; Mechanism of action; Drug; Anticonvulsant; Biochemistry; In vitro; Neuroscience; Epilepsy; Biology","score_opus":0.03442749188030924,"score_gpt":0.2572387008958423,"score_spread":0.22281120901553303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791325034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963224,0.00018916467,0.0015744516,0.00011039646,0.000024581668,0.000015284282,0.00012819655,0.000042493448,0.0015929097],"genre_scores_gemma":[0.9981774,0.00010533597,0.00052803877,0.000047160986,0.000010166397,0.00001804177,0.00020578514,0.000034123987,0.00087399775],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991555,0.00013701423,0.00006723998,0.0001813479,0.0002551632,0.00020370564],"domain_scores_gemma":[0.9966652,0.0019314766,0.00034009715,0.00045075838,0.00032668604,0.00028577636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074434775,0.00024035717,0.0005957326,0.0003822141,0.0006049945,0.0013048601,0.0009628434,0.00061068893,0.0064219506],"category_scores_gemma":[0.005693541,0.0004125589,0.00046805336,0.0003190186,0.0006130624,0.001676644,0.0008878122,0.0006904537,0.0005896456],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0018125576,0.00029507215,0.004105369,0.00020481588,0.00008852232,0.00015953158,0.00045720217,0.0034088336,0.9787322,0.0032487963,0.00049354765,0.0069936323],"study_design_scores_gemma":[0.00015293522,0.00077533955,0.099879295,0.00006678238,0.00021198574,0.0005922725,0.0008087542,0.13507587,0.75316465,0.0055016945,0.0035891142,0.00018131446],"about_ca_topic_score_codex":0.0017566443,"about_ca_topic_score_gemma":0.0029585243,"teacher_disagreement_score":0.0064219506,"about_ca_system_score_codex":0.00071995036,"about_ca_system_score_gemma":0.00043246098,"threshold_uncertainty_score":0.0214836},"labels":[],"label_agreement":null},{"id":"W2792032102","doi":"10.1109/access.2018.2806618","title":"Interconnect Solutions for Virtualized Field-Programmable Gate Arrays","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"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":"Field-programmable gate array; Computer science; Embedded system; Interconnection; Routing (electronic design automation); Bandwidth (computing); Virtualization; USable; Network on a chip; Reconfigurable computing; Computer network; Cloud computing; Operating system","score_opus":0.06835082943540917,"score_gpt":0.3363952844678135,"score_spread":0.26804445503240437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792032102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53470546,0.0017084539,0.43609348,0.00052308955,0.00019758381,0.00010054134,0.0001351664,0.0023540154,0.024182184],"genre_scores_gemma":[0.94742167,0.00032206904,0.046984248,0.00008001786,0.0000150194055,0.000047080917,0.00008518499,0.00008266694,0.0049619307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996698,0.000107679734,0.000012229969,0.000029839823,0.000119410644,0.000061017206],"domain_scores_gemma":[0.9996123,0.00009246135,0.00010525615,0.00007886946,0.00007972111,0.000031521035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033791,0.00042198962,0.00017604679,0.0003379741,0.0003869038,0.00069245853,0.00058441644,0.00024282272,0.0018703679],"category_scores_gemma":[0.0008340271,0.000114646915,0.00012591286,0.0002964759,0.000304622,0.00082323037,0.0005250816,0.0003392164,0.00017128843],"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.00040497223,0.00024399623,0.0025449882,0.00031765742,0.00008376883,0.0004203732,0.00023187291,0.6333488,0.12317569,0.07781476,0.00787634,0.15353678],"study_design_scores_gemma":[0.000035466324,0.00091888005,0.0012785484,0.000049459763,0.000045239813,0.00028518587,0.00021688556,0.8813324,0.07066429,0.017300017,0.027844429,0.000029193921],"about_ca_topic_score_codex":0.0008519722,"about_ca_topic_score_gemma":0.0019086793,"teacher_disagreement_score":0.0018703679,"about_ca_system_score_codex":0.00078028865,"about_ca_system_score_gemma":0.00044711315,"threshold_uncertainty_score":0.0062569976},"labels":[],"label_agreement":null},{"id":"W2792569903","doi":"10.1002/cpe.4441","title":"Head‐of‐line blocking avoidance in Slim Fly networks using deadlock‐free non‐minimal and adaptive routing","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FPInnovations","keywords":"Computer science; Computer network; Network topology; Distributed computing; Deadlock; Network performance; Network traffic control; Blocking (statistics); Network packet; Queueing theory","score_opus":0.042297635630294955,"score_gpt":0.33971773757415974,"score_spread":0.2974201019438648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792569903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5661705,0.00021535269,0.42835554,0.00016971696,0.000045748893,0.00006737317,0.000077976685,0.0014287601,0.0034689202],"genre_scores_gemma":[0.9682142,0.00003727021,0.03103486,0.000028588325,0.0000052311757,0.00002158201,0.00004842056,0.000025622694,0.0005841478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997155,0.0000761404,0.000016089994,0.000047494148,0.0000606469,0.00008407952],"domain_scores_gemma":[0.99895954,0.00033277087,0.00018114642,0.00023018492,0.0001898516,0.00010650654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061530556,0.0003490755,0.00037646055,0.00061192765,0.00068774034,0.0006415219,0.0010004449,0.00030782758,0.000863533],"category_scores_gemma":[0.0012246555,0.00014662828,0.0002771507,0.0002793398,0.00051535683,0.0008216535,0.0009470165,0.00037889677,0.00009953791],"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.00081274915,0.00026024214,0.0039467565,0.00014584581,0.00008040717,0.00019697851,0.00023539475,0.8119804,0.05700467,0.030712768,0.0022865888,0.09233711],"study_design_scores_gemma":[0.000015762123,0.00015783297,0.000283988,0.0000074150157,0.000011853219,0.000041995267,0.000039616378,0.9846756,0.0094472505,0.004637485,0.0006697536,0.0000114543245],"about_ca_topic_score_codex":0.002891758,"about_ca_topic_score_gemma":0.0039872834,"teacher_disagreement_score":0.002891758,"about_ca_system_score_codex":0.0007808417,"about_ca_system_score_gemma":0.0007139552,"threshold_uncertainty_score":0.0057498813},"labels":[],"label_agreement":null},{"id":"W2798631810","doi":"10.1002/9780470932025.ch5","title":"Interconnection Networks","year":2011,"lang":"en","type":"other","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":30,"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":"Interconnection; Computer science; Computer network","score_opus":0.015177132372411924,"score_gpt":0.20786347146095116,"score_spread":0.19268633908853924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798631810","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052562896,0.027528143,0.33687255,0.0026731319,0.0074333805,0.00073237944,0.006854668,0.0062906705,0.6063588],"genre_scores_gemma":[0.0700383,0.05066975,0.22385697,0.0018099898,0.0024113813,0.0013943195,0.019959237,0.0013678685,0.6284922],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999353,0.000077533645,0.00005160649,0.00014977274,0.00031636964,0.00005172494],"domain_scores_gemma":[0.99960107,0.000060571238,0.000027537277,0.00011275358,0.00017406054,0.000023993029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037656105,0.0010288351,0.00062362984,0.0015128519,0.0008710357,0.0029213629,0.0010764479,0.00079215673,0.058315355],"category_scores_gemma":[0.0012191683,0.00040201395,0.00043518067,0.0024620735,0.00041634924,0.0029014426,0.0011258412,0.0012283642,0.032819636],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004083732,0.00005544175,0.00022986991,0.00068179984,0.00003659346,0.00013766387,0.0001376762,0.0061847973,0.0068451893,0.33663547,0.24805158,0.40096304],"study_design_scores_gemma":[0.000008880648,0.000025430589,0.00014750606,0.00013567618,0.000013523174,0.00017681626,0.00002453883,0.0036073443,0.00127373,0.052622225,0.9419516,0.000012667914],"about_ca_topic_score_codex":0.0008067506,"about_ca_topic_score_gemma":0.0012818377,"teacher_disagreement_score":0.058315355,"about_ca_system_score_codex":0.0008652531,"about_ca_system_score_gemma":0.0009181442,"threshold_uncertainty_score":0.19508427},"labels":[],"label_agreement":null},{"id":"W2799196781","doi":"10.4230/lipics.mfcs.2018.75","title":"Reconfiguration of Graph Minors","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Control reconfiguration; Vertex (graph theory); Mathematics; Graph; Edge contraction; Vertex connectivity; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.02228317346872367,"score_gpt":0.25909982572182005,"score_spread":0.2368166522530964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799196781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53330815,0.00034861176,0.4087316,0.0005305861,0.00018573698,0.00025252916,0.000568723,0.0016625794,0.054411404],"genre_scores_gemma":[0.94053227,0.0001934241,0.044743165,0.00013186414,0.00007861752,0.00013269523,0.00069490744,0.0003005945,0.013192535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958986,0.00007871162,0.000023053155,0.00015156792,0.00007008346,0.000086754466],"domain_scores_gemma":[0.999102,0.00018293728,0.00017032435,0.00030361483,0.00009804597,0.00014313916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025986216,0.000468512,0.0003418022,0.0005393858,0.0007800894,0.0010243766,0.0006326595,0.00042382313,0.005408711],"category_scores_gemma":[0.0015930277,0.00026083447,0.0008035712,0.0003966837,0.0010799114,0.001540647,0.0012273133,0.00064740656,0.0006440234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033761642,0.00013483404,0.0023885393,0.0002284595,0.00005055626,0.0014310824,0.0013471792,0.07835067,0.055146497,0.79256624,0.0070807375,0.060937714],"study_design_scores_gemma":[0.00007267681,0.00032312315,0.00197585,0.000034116973,0.000045817113,0.0017138247,0.00069377513,0.20616467,0.017522737,0.7300151,0.041391272,0.000047039008],"about_ca_topic_score_codex":0.0012778577,"about_ca_topic_score_gemma":0.0012242694,"teacher_disagreement_score":0.005408711,"about_ca_system_score_codex":0.00076371426,"about_ca_system_score_gemma":0.00038166356,"threshold_uncertainty_score":0.018093944},"labels":[],"label_agreement":null},{"id":"W2799267740","doi":"10.1007/978-3-319-78825-8_18","title":"Improved Lower Bound on Broadcast Function Based on Graph Partition","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Computer science; Graph; Discrete mathematics; Broadcasting (networking); Connectivity; Mathematics; Computer network","score_opus":0.01533656119422659,"score_gpt":0.22503501019749628,"score_spread":0.2096984490032697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799267740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06420839,0.010847664,0.82891107,0.004126194,0.0015194063,0.00046587124,0.0019540344,0.004009223,0.08395816],"genre_scores_gemma":[0.6602939,0.0071175466,0.26869297,0.0021049134,0.002207482,0.0013830377,0.0042807404,0.0021901196,0.05172929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654585,0.0008017193,0.00009534967,0.00058439124,0.0010700661,0.0009026644],"domain_scores_gemma":[0.99188036,0.005477239,0.00022910602,0.0012114105,0.0008108235,0.00039103968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025497675,0.0029544807,0.0041294536,0.0035041096,0.0022824686,0.0050036777,0.0063644364,0.0028685713,0.021477051],"category_scores_gemma":[0.011001159,0.0009944342,0.0024274003,0.004743486,0.0024987105,0.009203402,0.0046262583,0.0055908156,0.0039581135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029009986,0.0008641678,0.001729959,0.0023267004,0.00033381899,0.00038340504,0.0007580934,0.23730625,0.019575017,0.4147223,0.09493176,0.22416756],"study_design_scores_gemma":[0.00019725735,0.00027394897,0.0010073868,0.0002071512,0.00034836808,0.0003543042,0.00018884314,0.7522517,0.0060983244,0.22596918,0.013019652,0.00008396079],"about_ca_topic_score_codex":0.004198692,"about_ca_topic_score_gemma":0.0048184725,"teacher_disagreement_score":0.021477051,"about_ca_system_score_codex":0.0060318783,"about_ca_system_score_gemma":0.0042316276,"threshold_uncertainty_score":0.071847856},"labels":[],"label_agreement":null},{"id":"W2803986768","doi":"10.1016/j.vlsi.2018.05.005","title":"Ultra-low latency communication channels for FPGA-based HPC cluster","year":2018,"lang":"en","type":"article","venue":"Integration","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Coprocessor; Latency (audio); Embedded system; Scalability; Virtex; Low latency (capital markets); Computer network; Operating system","score_opus":0.02256487746584107,"score_gpt":0.2686323368522757,"score_spread":0.24606745938643465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803986768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7625858,0.0026418827,0.17903636,0.0008816977,0.00071415235,0.0001543324,0.0006178358,0.005076153,0.04829167],"genre_scores_gemma":[0.9780385,0.00018725873,0.014325137,0.000055028035,0.00005281326,0.000038793194,0.0002144184,0.000049216764,0.0070388713],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985135,0.000022412374,0.0000056931644,0.000021509313,0.000051461448,0.000047520447],"domain_scores_gemma":[0.99980885,0.00004138497,0.00002126171,0.000032726155,0.00006524829,0.000030626703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014259914,0.00020662669,0.00015443905,0.00030049487,0.0006975114,0.0005634701,0.0007448008,0.00022369283,0.00880742],"category_scores_gemma":[0.00032347316,0.000114303395,0.00007612099,0.0003595796,0.00016693889,0.0007280622,0.00043061268,0.00032292597,0.0008079296],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0033331297,0.00045721154,0.011170868,0.0009787689,0.00011218811,0.0012183996,0.00066253607,0.08234846,0.51249903,0.04862887,0.044488203,0.2941023],"study_design_scores_gemma":[0.00018105892,0.0019058388,0.0102458075,0.00009542954,0.00010994258,0.0007592907,0.000678295,0.53171617,0.36551392,0.011968034,0.07673074,0.00009556251],"about_ca_topic_score_codex":0.0012133283,"about_ca_topic_score_gemma":0.0033252097,"teacher_disagreement_score":0.00880742,"about_ca_system_score_codex":0.0005712106,"about_ca_system_score_gemma":0.0006792966,"threshold_uncertainty_score":0.029463768},"labels":[],"label_agreement":null},{"id":"W2809450333","doi":"","title":"On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transposition (logic); Cayley graph; Combinatorics; Discrete mathematics; Geometry; Graph","score_opus":0.01371831725176763,"score_gpt":0.2199312546156555,"score_spread":0.20621293736388785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809450333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45681337,0.038786985,0.324182,0.02912016,0.0034571013,0.0002772871,0.00327079,0.0027438442,0.14134847],"genre_scores_gemma":[0.9274994,0.00979933,0.03858951,0.004486161,0.0045843357,0.00046240483,0.0016438845,0.001226775,0.011708265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954464,0.0013979892,0.00020062976,0.0012838241,0.0007853198,0.0008857913],"domain_scores_gemma":[0.85307604,0.12682408,0.005018194,0.0054241563,0.0036285645,0.0060289814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072579766,0.0038041812,0.0045042965,0.005331745,0.00269972,0.008807703,0.007637026,0.00515229,0.012954634],"category_scores_gemma":[0.06686237,0.002851688,0.0029012852,0.0038933556,0.007802252,0.016562628,0.0071261534,0.014064594,0.0025660098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031456056,0.00060210994,0.009926665,0.002233033,0.0006130554,0.0014176463,0.0022216225,0.099049255,0.03407077,0.76644117,0.03756398,0.04271518],"study_design_scores_gemma":[0.0002530738,0.00051929033,0.005057182,0.00045740342,0.00041166408,0.0009575813,0.00044190953,0.2057089,0.0061377734,0.77149975,0.00831189,0.00024358372],"about_ca_topic_score_codex":0.0015485075,"about_ca_topic_score_gemma":0.0015426596,"teacher_disagreement_score":0.012954634,"about_ca_system_score_codex":0.004263009,"about_ca_system_score_gemma":0.001238237,"threshold_uncertainty_score":0.043337524},"labels":[],"label_agreement":null},{"id":"W2810586790","doi":"10.1109/iciea.2018.8398005","title":"Delay bound analysis for heterogeneous multicore systems using network calculus","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network calculus; Computer science; Multi-core processor; Upper and lower bounds; Scheduling (production processes); Task (project management); Distributed computing; Transmission (telecommunications); Formal methods; Parallel computing; Mathematical optimization; Computer network; Quality of service; Mathematics; Telecommunications","score_opus":0.04356989102378893,"score_gpt":0.2874417717725868,"score_spread":0.24387188074879784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810586790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010097351,0.0009462778,0.9817763,0.00020000173,0.000058186062,0.000033955137,0.000041378942,0.00010593271,0.0067406474],"genre_scores_gemma":[0.8461596,0.003965151,0.13828237,0.00024218853,0.00022957847,0.0003588197,0.000151571,0.00017323527,0.010437565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.00018468351,0.00004201858,0.00014526435,0.00039067643,0.0001451591],"domain_scores_gemma":[0.9988979,0.0006460215,0.00013604507,0.00006838741,0.00020160861,0.000050116436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016058442,0.00085590105,0.00061436126,0.00097047293,0.0007518679,0.0015741212,0.0009960287,0.0006139126,0.0018581802],"category_scores_gemma":[0.003318224,0.00034367118,0.0008158269,0.00081741036,0.0011076475,0.0018890693,0.0014280608,0.0015894065,0.00019712279],"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.00002842067,0.000027593243,0.00028194606,0.00010384226,0.000029392526,0.00011634497,0.00009987098,0.6239013,0.0060304664,0.35893553,0.0007075797,0.009737642],"study_design_scores_gemma":[0.0000026131845,0.000008066596,0.00006119021,0.000006908831,0.000008264279,0.000013290527,0.000011730752,0.95891154,0.00055775803,0.039144184,0.0012693017,0.000005171683],"about_ca_topic_score_codex":0.0057055666,"about_ca_topic_score_gemma":0.00342347,"teacher_disagreement_score":0.0057055666,"about_ca_system_score_codex":0.0029015667,"about_ca_system_score_gemma":0.0018955591,"threshold_uncertainty_score":0.02105248},"labels":[],"label_agreement":null},{"id":"W2844974720","doi":"10.1109/tcad.2018.2855165","title":"ShuttleNoC: Power-Adaptable Communication Infrastructure for Many-Core Processors","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Youth Innovation Promotion Association of the Chinese Academy of Sciences; National Natural Science Foundation of China; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Control reconfiguration; Computer science; Network on a chip; Latency (audio); Power consumption; Network packet; Bandwidth (computing); Traverse; Airfield traffic pattern; Many core; Provisioning; Power (physics); Electrical efficiency; Distributed computing; Embedded system; Computer network; Telecommunications; Parallel computing","score_opus":0.03706762900793073,"score_gpt":0.2504595890412046,"score_spread":0.21339196003327385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2844974720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27265012,0.005122559,0.65501165,0.000941602,0.0006897092,0.0007714754,0.00068534823,0.02753837,0.03658919],"genre_scores_gemma":[0.9294385,0.000636045,0.06380105,0.0003511673,0.000057101355,0.0002460115,0.00080747344,0.0003123792,0.0043502552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996877,0.00003744565,0.0000134879965,0.00004733407,0.00013912827,0.000075038406],"domain_scores_gemma":[0.99962246,0.000050574206,0.000056437955,0.000085355,0.00013092204,0.000054147687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024621477,0.00058184867,0.00030404172,0.0005625265,0.00036469055,0.0005109656,0.0015673282,0.00037408152,0.0032239824],"category_scores_gemma":[0.00068676384,0.00016890993,0.0002332457,0.00044086695,0.00031818636,0.00087041844,0.00097451033,0.0006862437,0.0005205703],"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.0010991317,0.0003935055,0.0043104542,0.0010921102,0.00012514174,0.00078708044,0.0001841455,0.23710585,0.16338225,0.02334125,0.052290708,0.51588845],"study_design_scores_gemma":[0.00019684368,0.0013599372,0.0032764943,0.00007058913,0.00010993345,0.0006966997,0.00007618368,0.8510309,0.07986565,0.00659617,0.056622125,0.0000983926],"about_ca_topic_score_codex":0.0014229375,"about_ca_topic_score_gemma":0.0026030354,"teacher_disagreement_score":0.0032239824,"about_ca_system_score_codex":0.0006060393,"about_ca_system_score_gemma":0.0010060046,"threshold_uncertainty_score":0.010785282},"labels":[],"label_agreement":null},{"id":"W287610840","doi":"","title":"Edge-critical isometric subgraphs of hypercubes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Mathematics; Isometric exercise; Enhanced Data Rates for GSM Evolution; Combinatorics; Computer science; Telecommunications","score_opus":0.013450739095580063,"score_gpt":0.24307846859906268,"score_spread":0.22962772950348262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W287610840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78503186,0.0012541875,0.10099575,0.0010160465,0.00017217177,0.00012086875,0.0009292382,0.00030171388,0.1101781],"genre_scores_gemma":[0.9648013,0.0006730893,0.016876435,0.00016347633,0.00007893815,0.000058368325,0.001169998,0.000070900955,0.016107516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983466,0.000046085177,0.000008074763,0.000028800065,0.000043656422,0.00003872557],"domain_scores_gemma":[0.9993954,0.00018579699,0.00014510554,0.00008346852,0.00007647254,0.000113772185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001401888,0.0002235958,0.00020843226,0.00059109955,0.0005212747,0.00070682884,0.00038782498,0.00028040528,0.006096701],"category_scores_gemma":[0.0011825311,0.00021795799,0.00019302205,0.0005085793,0.00041119786,0.0011237882,0.00087485067,0.00042896305,0.00045486604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002844791,0.000071431845,0.003827209,0.0003486033,0.000045222565,0.00081606593,0.00037695197,0.011154529,0.018780258,0.8941893,0.014747581,0.055358373],"study_design_scores_gemma":[0.000049378537,0.000069163805,0.0069036395,0.00009160662,0.000053372656,0.0016476633,0.000767632,0.05054992,0.013085559,0.88868594,0.03807624,0.000019844092],"about_ca_topic_score_codex":0.00072710257,"about_ca_topic_score_gemma":0.0017690614,"teacher_disagreement_score":0.006096701,"about_ca_system_score_codex":0.000457278,"about_ca_system_score_gemma":0.0002655352,"threshold_uncertainty_score":0.020395458},"labels":[],"label_agreement":null},{"id":"W2887756705","doi":"10.1109/icist.2018.8426111","title":"A Novel Migration Technique to Balance Thermal Distribution for Future Heterogeneous 3D Chip Multiprocessors","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parsec; Cache; Parallel computing; Energy consumption; Three-dimensional integrated circuit; Chip; Efficient energy use; Throughput; Reliability (semiconductor); Embedded system; Computer architecture; Power (physics); Wireless; Engineering; Operating system","score_opus":0.01214501131730004,"score_gpt":0.24589194816006615,"score_spread":0.23374693684276612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887756705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1294447,0.0007399441,0.8642615,0.00020616164,0.00015882803,0.00006899421,0.000060243743,0.0019566827,0.0031029002],"genre_scores_gemma":[0.7257229,0.00027115797,0.27076766,0.0001607288,0.00004893843,0.00011527857,0.00012392354,0.00015976114,0.0026296736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998789,0.000019040044,0.000008342345,0.00003452188,0.000034365916,0.000024920202],"domain_scores_gemma":[0.9998561,0.000019795836,0.000028965953,0.00003811535,0.000042895048,0.000014055647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015147432,0.0005753238,0.00033968224,0.00044789488,0.00044723763,0.00032611444,0.0008163969,0.0003369978,0.0008153322],"category_scores_gemma":[0.00031414223,0.00018313699,0.00033542,0.00039851098,0.00018318693,0.0005280159,0.0004665578,0.0003033821,0.00026217633],"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.00028375868,0.00019027616,0.002495605,0.00016281407,0.000084152125,0.0003421866,0.0001970105,0.21098965,0.38580474,0.0055330577,0.0048848507,0.3890319],"study_design_scores_gemma":[0.000033326967,0.00028858666,0.0015814729,0.0000118364405,0.000048227528,0.00035376486,0.000076309974,0.93784696,0.049432155,0.0025866607,0.0077036843,0.000036999656],"about_ca_topic_score_codex":0.0010151665,"about_ca_topic_score_gemma":0.0023663603,"teacher_disagreement_score":0.0010151665,"about_ca_system_score_codex":0.00030214526,"about_ca_system_score_gemma":0.00037667147,"threshold_uncertainty_score":0.0027275681},"labels":[],"label_agreement":null},{"id":"W2889569267","doi":"10.1016/j.orl.2018.09.002","title":"On Eulerian orientations of even-degree hypercubes","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eulerian path; Hypercube; Degree (music); Orientation (vector space); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Undirected graph; Graph; Node (physics); Connectivity; Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence; Pure mathematics","score_opus":0.10560141980985446,"score_gpt":0.37061326968721553,"score_spread":0.26501184987736104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889569267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7409045,0.0014217694,0.11695572,0.0009940986,0.00059063203,0.00007571475,0.0005268472,0.0002020522,0.13832876],"genre_scores_gemma":[0.9483958,0.0023201061,0.019650672,0.00028086986,0.0002099253,0.00006469587,0.0005931154,0.00021908717,0.028265806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976486,0.00005494478,0.0000108628155,0.00003097658,0.00005863317,0.00007976841],"domain_scores_gemma":[0.9993424,0.00020938991,0.00012655032,0.0000619067,0.000106735904,0.0001530164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381683,0.0006115801,0.00034705983,0.0010737041,0.00083974237,0.001730793,0.0005102234,0.00036251664,0.007865684],"category_scores_gemma":[0.0014727679,0.00030131303,0.00023331509,0.0008831939,0.0012522294,0.0017259216,0.0012959156,0.0009975737,0.0011775414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016848817,0.0000320469,0.0011271911,0.000075413314,0.0000070713877,0.00020411758,0.00037858644,0.011518664,0.0040073106,0.95787233,0.00287801,0.021730723],"study_design_scores_gemma":[0.000030917952,0.000037031445,0.0009068478,0.00006324572,0.0000087801245,0.00012812177,0.0005470586,0.020024182,0.0020886671,0.9647061,0.011435319,0.000023702585],"about_ca_topic_score_codex":0.0012190946,"about_ca_topic_score_gemma":0.0019014213,"teacher_disagreement_score":0.007865684,"about_ca_system_score_codex":0.00068427174,"about_ca_system_score_gemma":0.00042537213,"threshold_uncertainty_score":0.026313365},"labels":[],"label_agreement":null},{"id":"W2890949959","doi":"10.1109/fccm.2018.00027","title":"LegUp-NoC: High-Level Synthesis of Loops with Indirect Addressing","year":2018,"lang":"en","type":"article","venue":"","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":"University of Waterloo","funders":"Baidu","keywords":"High-level synthesis; Computer science; Parallel computing; Computer architecture; Embedded system; Field-programmable gate array","score_opus":0.04864440887995824,"score_gpt":0.24693953470492244,"score_spread":0.1982951258249642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890949959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20856726,0.0007863226,0.74621296,0.00016601272,0.0001717184,0.00028185596,0.0009981818,0.01533043,0.02748536],"genre_scores_gemma":[0.5299016,0.00022881757,0.46121818,0.00012983981,0.00002531477,0.0002921723,0.0011286117,0.0010687571,0.0060066446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.00003762789,0.00001472765,0.00003851029,0.00008692095,0.00004143175],"domain_scores_gemma":[0.99961936,0.00014475819,0.000056188805,0.00006816992,0.00009519176,0.000016210379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003296011,0.00061596395,0.00023696465,0.00034401374,0.00019867424,0.00040588493,0.000653572,0.0002940163,0.0036046752],"category_scores_gemma":[0.0008557897,0.00023731239,0.000340008,0.00023663096,0.00027018585,0.00030136734,0.0003011209,0.00032329003,0.00056209235],"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.0003370112,0.00020374484,0.004141401,0.0007775787,0.0001211457,0.0004705583,0.0002119936,0.5723938,0.14999264,0.017055832,0.011813372,0.2424809],"study_design_scores_gemma":[0.000069526024,0.00046715527,0.0011533065,0.000056040164,0.000045510216,0.00019270192,0.000039371804,0.8613794,0.11341581,0.0033948806,0.0197607,0.000025557954],"about_ca_topic_score_codex":0.0018684071,"about_ca_topic_score_gemma":0.0032748934,"teacher_disagreement_score":0.0036046752,"about_ca_system_score_codex":0.00051873695,"about_ca_system_score_gemma":0.000950159,"threshold_uncertainty_score":0.012058854},"labels":[],"label_agreement":null},{"id":"W2894815576","doi":"10.1016/j.dam.2020.10.015","title":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Lambda; Connectivity; Graph; Disjoint sets; Order (exchange); Discrete mathematics; Physics","score_opus":0.020272338775375483,"score_gpt":0.24080262769294664,"score_spread":0.22053028891757115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894815576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521197,0.0006916641,0.13519852,0.00048008098,0.000044547516,0.00002819739,0.0011135552,0.00020639876,0.01011725],"genre_scores_gemma":[0.9868732,0.00042141712,0.010492203,0.00007947327,0.00008223252,0.000051459596,0.0006409985,0.000052946216,0.0013061052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995529,0.000105996114,0.000022373122,0.00014667846,0.00009296957,0.000079096244],"domain_scores_gemma":[0.99464333,0.003412506,0.0006894598,0.00026646932,0.00052969856,0.00045856324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053824746,0.0005653549,0.00082588964,0.001956501,0.0007500559,0.0016173974,0.0017218809,0.0007697491,0.003944459],"category_scores_gemma":[0.006365042,0.0003476067,0.0004717966,0.0021033199,0.0008081998,0.002995458,0.00083030533,0.00076495326,0.00019756913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078746834,0.00020197692,0.025193788,0.0006373747,0.0003202239,0.0007954778,0.0011685165,0.23396724,0.025375124,0.65453863,0.007144197,0.049869917],"study_design_scores_gemma":[0.000035750007,0.00008890325,0.0111448,0.000032768872,0.000085504355,0.0005999619,0.00030872689,0.33700258,0.003351977,0.6452898,0.0020227276,0.00003644694],"about_ca_topic_score_codex":0.00087675866,"about_ca_topic_score_gemma":0.0010296474,"teacher_disagreement_score":0.003944459,"about_ca_system_score_codex":0.0006589922,"about_ca_system_score_gemma":0.000275615,"threshold_uncertainty_score":0.013195515},"labels":[],"label_agreement":null},{"id":"W2895070398","doi":"10.1145/3241793.3241813","title":"Flexible Reconfigurable On-chip Networks for Multi-core SoCs","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interconnection; Scalability; Embedded system; System on a chip; Chip; Network on a chip; Key (lock); Computer science; Computer architecture; Computer network; Telecommunications","score_opus":0.09514442117943452,"score_gpt":0.309720810330057,"score_spread":0.2145763891506225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895070398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46615756,0.0039141914,0.49125785,0.0007840292,0.00042762884,0.0001719733,0.00024067523,0.0029301739,0.034115806],"genre_scores_gemma":[0.94736487,0.000583942,0.050109476,0.00007963168,0.000029766914,0.00004259504,0.00012739313,0.000047909118,0.0016144089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989164,0.000027828384,0.000005237612,0.000018167157,0.0000335169,0.000023592116],"domain_scores_gemma":[0.9998851,0.000025945863,0.000021218686,0.000036354606,0.000019083882,0.000012299562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107017695,0.00027288107,0.00013207005,0.00027219925,0.00027518414,0.00030676936,0.0003934274,0.00023475276,0.0013418269],"category_scores_gemma":[0.0002893655,0.000085230524,0.00012697812,0.00029923924,0.00016165197,0.00047032107,0.00027144793,0.0002713191,0.0001526009],"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.00034822716,0.00016259673,0.0015944865,0.00033940416,0.000057047135,0.00046588722,0.00013649822,0.3803992,0.2566833,0.0363107,0.005371832,0.31813085],"study_design_scores_gemma":[0.00005540049,0.00046021858,0.0029436396,0.000044963803,0.000054554177,0.00029884442,0.00007257375,0.8832466,0.06089329,0.015804429,0.03607975,0.000045834724],"about_ca_topic_score_codex":0.00088782783,"about_ca_topic_score_gemma":0.0020165222,"teacher_disagreement_score":0.0013418269,"about_ca_system_score_codex":0.00038319733,"about_ca_system_score_gemma":0.00022181681,"threshold_uncertainty_score":0.004488826},"labels":[],"label_agreement":null},{"id":"W2895829868","doi":"10.1109/tpds.2018.2874659","title":"HSDC: A Highly Scalable Data Center Network Architecture for Greater Incremental Scalability","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":76,"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":"Institute of Computing Technology, Chinese Academy of Sciences; Key Laboratory of Computer System and Architecture; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Server; Data center; Distributed computing; Computer network; Network architecture; Throughput; Database; Operating system","score_opus":0.03422902820518883,"score_gpt":0.2578291159504301,"score_spread":0.2236000877452413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895829868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23758766,0.0011709168,0.7348899,0.00082701206,0.00037359065,0.00037825076,0.0006992944,0.008857749,0.015215615],"genre_scores_gemma":[0.8245895,0.00041651668,0.17022306,0.0001549605,0.000078528436,0.00014848298,0.00097349397,0.00008390986,0.0033315688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998379,0.000024709183,0.000011231828,0.000023687424,0.00006708138,0.000035413752],"domain_scores_gemma":[0.9995914,0.00004963535,0.000030516992,0.00007934536,0.00019283783,0.00005637321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537547,0.00024238577,0.00021201471,0.0005114984,0.00044564556,0.0005574251,0.0008124138,0.00023882528,0.0013801608],"category_scores_gemma":[0.00048410674,0.00011234663,0.00022223426,0.0006730856,0.00030589555,0.00090831186,0.0006387709,0.00035990868,0.0002517356],"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.00067082036,0.00028776046,0.007021521,0.0004702287,0.0001239122,0.0004944035,0.00029047576,0.3423543,0.13567284,0.059604887,0.043050073,0.40995878],"study_design_scores_gemma":[0.000086508044,0.00044567804,0.0022990252,0.000020046038,0.000057196048,0.0003452246,0.00011918885,0.9054605,0.041940406,0.011758661,0.03740252,0.000065026325],"about_ca_topic_score_codex":0.0043571764,"about_ca_topic_score_gemma":0.005427811,"teacher_disagreement_score":0.0043571764,"about_ca_system_score_codex":0.000884785,"about_ca_system_score_gemma":0.0011086557,"threshold_uncertainty_score":0.008663654},"labels":[],"label_agreement":null},{"id":"W2898493570","doi":"10.1016/j.dam.2018.09.015","title":"A new construction of broadcast graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Wheel graph; Discrete mathematics; Upper and lower bounds; Connectivity; Graph power; Line graph","score_opus":0.01227734323439428,"score_gpt":0.23292662629017105,"score_spread":0.22064928305577677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898493570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04084651,0.000400096,0.89731485,0.0012287978,0.0004714501,0.00012281317,0.00040453958,0.0008340538,0.058376882],"genre_scores_gemma":[0.4028199,0.0013568203,0.5212109,0.0008898933,0.00060703047,0.0005279039,0.001261477,0.0010766477,0.0702495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933845,0.00019300518,0.000028839242,0.0001480203,0.00019566952,0.00009602196],"domain_scores_gemma":[0.99825066,0.0006203817,0.00010860912,0.00044135633,0.00031836232,0.00026056884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445749,0.0005462398,0.0006228948,0.0013475611,0.0015686787,0.0016440785,0.0012928094,0.00086758245,0.0081247855],"category_scores_gemma":[0.0024628548,0.00066706684,0.0008730028,0.0011452896,0.0015134347,0.0023116064,0.002871946,0.0024477968,0.0016505318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057526715,0.00002964626,0.00015742872,0.00009101757,0.000012560693,0.00007533118,0.00027178708,0.002773302,0.0046847565,0.9607654,0.006153573,0.024927652],"study_design_scores_gemma":[0.00007306525,0.000070403265,0.00025640207,0.00005804197,0.00006208245,0.0002705559,0.00016143495,0.036103427,0.005465601,0.9034513,0.053991824,0.000035752244],"about_ca_topic_score_codex":0.0010104323,"about_ca_topic_score_gemma":0.0013610143,"teacher_disagreement_score":0.0081247855,"about_ca_system_score_codex":0.0011258916,"about_ca_system_score_gemma":0.00080137234,"threshold_uncertainty_score":0.027180135},"labels":[],"label_agreement":null},{"id":"W2901879074","doi":"10.5539/mas.v12n12p163","title":"On Maximizing Reliability of Network Topology Design Using a Practical Dynamic Programming Approach","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Network topology; Reliability (semiconductor); Benchmark (surveying); Sorting; Mathematical optimization; Constraint (computer-aided design); Dynamic programming; Set (abstract data type); Topology (electrical circuits); Reliability engineering; Algorithm; Mathematics; Computer network; Power (physics); Engineering","score_opus":0.049656383708235344,"score_gpt":0.3067830348818581,"score_spread":0.25712665117362277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901879074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054913526,0.000277956,0.9909155,0.00021986933,0.000018472268,0.00005278147,0.00003122916,0.00009222878,0.002900666],"genre_scores_gemma":[0.31141952,0.0015046779,0.68214613,0.0002122524,0.00011943423,0.0004628557,0.00017195329,0.00018238991,0.0037808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990841,0.00042883685,0.000031337295,0.00015622452,0.00020763782,0.00009185244],"domain_scores_gemma":[0.9978181,0.0017052981,0.00015148566,0.00007579598,0.00019854048,0.00005074744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017494289,0.0014939514,0.0012031535,0.0012910622,0.0005524078,0.0011635426,0.0010758856,0.0010963853,0.0021004484],"category_scores_gemma":[0.004790952,0.0007674076,0.00086839264,0.0014378731,0.0010542942,0.0016225822,0.0010533599,0.001166619,0.0003250154],"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.000014222345,0.000018897279,0.00010977812,0.0000684991,0.000012287879,0.000024916164,0.000026520891,0.96905667,0.0005306934,0.010667961,0.00042585493,0.019043677],"study_design_scores_gemma":[0.0000068251557,0.0000221724,0.000031561187,0.000009660822,0.000005194484,0.000018415623,0.000011621413,0.99139905,0.0003272704,0.007447837,0.00071684906,0.0000035806286],"about_ca_topic_score_codex":0.003407713,"about_ca_topic_score_gemma":0.003365675,"teacher_disagreement_score":0.003407713,"about_ca_system_score_codex":0.0014936855,"about_ca_system_score_gemma":0.0016013073,"threshold_uncertainty_score":0.010837555},"labels":[],"label_agreement":null},{"id":"W2903751892","doi":"10.1109/norchip.2018.8573462","title":"Multi-Swarm based NoC Configuration and Synthesis","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"Network on a chip; Computer science; Interconnection; Swarm behaviour; Particle swarm optimization; Latency (audio); Power consumption; Tabu search; Chip; Parallel computing; Power (physics); Embedded system; Computer network; Algorithm; Telecommunications","score_opus":0.025821807015617086,"score_gpt":0.2483482424896439,"score_spread":0.2225264354740268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903751892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05481984,0.00029289097,0.935978,0.00009496625,0.00007331358,0.00017306098,0.000112909736,0.0012648877,0.007190092],"genre_scores_gemma":[0.5337154,0.00020432354,0.46241865,0.000050738458,0.000017046175,0.0004026972,0.00022727082,0.00014322491,0.0028206143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979717,0.000043959466,0.000013602756,0.000044357934,0.0000734503,0.000027504722],"domain_scores_gemma":[0.9997297,0.0000969693,0.00003950266,0.000045429922,0.00007431039,0.000014102688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029962292,0.000490347,0.00046794076,0.00054334535,0.00029472355,0.00051155547,0.00073069864,0.0004623501,0.0017715514],"category_scores_gemma":[0.0008130059,0.0003024594,0.00046125092,0.00039026592,0.00032586927,0.00031590607,0.00038807958,0.0003307904,0.00023949589],"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.000032342392,0.00003107681,0.00039356673,0.00009735182,0.00001906686,0.000060817307,0.000045696026,0.9350983,0.016215721,0.00352704,0.00056463864,0.043914318],"study_design_scores_gemma":[0.000009734129,0.000032541524,0.00011599447,0.0000050815615,0.000005982451,0.000016583423,0.000007658578,0.9939851,0.003846809,0.0009332888,0.0010371046,0.0000041087737],"about_ca_topic_score_codex":0.001423683,"about_ca_topic_score_gemma":0.0015796105,"teacher_disagreement_score":0.0017715514,"about_ca_system_score_codex":0.00054265495,"about_ca_system_score_gemma":0.0005395634,"threshold_uncertainty_score":0.0059263706},"labels":[],"label_agreement":null},{"id":"W2904342476","doi":"10.1109/fpl.2018.00068","title":"Latency Insensitive Design Styles for FPGAs","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Latency (audio); Computer science; Field-programmable gate array; Interconnection; Embedded system; Stratix; Critical path method; Computer architecture; Logic synthesis; Pipeline (software); Parallel computing; Logic gate; Engineering; Computer network; Operating system; Telecommunications","score_opus":0.046248145640690755,"score_gpt":0.2672694188864032,"score_spread":0.22102127324571247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904342476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033078454,0.0023646217,0.91489565,0.00036387847,0.0004163562,0.00024782427,0.00054825924,0.007980127,0.04010481],"genre_scores_gemma":[0.3275675,0.0021236348,0.6104272,0.00112807,0.00021974086,0.00038790985,0.0008540535,0.0017552607,0.055536628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995809,0.00009899139,0.00005314969,0.000056389177,0.00016027913,0.00005023524],"domain_scores_gemma":[0.9994916,0.000076100696,0.000087002765,0.00018923976,0.00013617176,0.000019954554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033218786,0.00081013754,0.00020081834,0.00049801246,0.00027398355,0.0007496139,0.0009049221,0.00035085797,0.009628431],"category_scores_gemma":[0.00092732225,0.0002974124,0.0003183821,0.0005033449,0.00021821896,0.0008695178,0.0003783361,0.0006681488,0.0027976166],"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.0004223529,0.00009071207,0.0011702217,0.0012350962,0.00008887199,0.0005745939,0.00037179855,0.0377492,0.25317764,0.10046599,0.035460353,0.5691932],"study_design_scores_gemma":[0.00018543375,0.0014846368,0.0015862972,0.00025431695,0.00019172662,0.0023284801,0.0001989831,0.13216262,0.18694474,0.07031883,0.60421425,0.00012969693],"about_ca_topic_score_codex":0.00033604476,"about_ca_topic_score_gemma":0.00084529736,"teacher_disagreement_score":0.009628431,"about_ca_system_score_codex":0.00054509187,"about_ca_system_score_gemma":0.00031758417,"threshold_uncertainty_score":0.03221035},"labels":[],"label_agreement":null},{"id":"W2904370410","doi":"10.1109/fpl.2018.00013","title":"Automatic Topology Optimization for FPGA Interconnect Synthesis","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Field-programmable gate array; Network topology; Computer science; Interconnection; Key (lock); Topology (electrical circuits); Design flow; Transmission (telecommunications); High-level synthesis; Embedded system; Distributed computing; Computer architecture; Computer network; Engineering","score_opus":0.01954752759672433,"score_gpt":0.2604184269777946,"score_spread":0.24087089938107026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904370410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055723265,0.00015537725,0.9333343,0.00009395794,0.000018226721,0.00008787845,0.00010110002,0.00139537,0.009090451],"genre_scores_gemma":[0.5949843,0.00021635798,0.40157896,0.000044610006,0.000012578066,0.00018382605,0.00021876737,0.00029692124,0.002463649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.00013254881,0.000016151029,0.000042012372,0.00012637574,0.000040669023],"domain_scores_gemma":[0.99947363,0.00033581,0.000052564377,0.000065303226,0.00006224507,0.000010516555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042824398,0.00051564473,0.00032268622,0.0005110143,0.0003053536,0.0005005741,0.0004063077,0.00027858047,0.0023913078],"category_scores_gemma":[0.0015108838,0.0002897034,0.00036281432,0.00034598337,0.00040178042,0.00055146037,0.0004196131,0.00044529102,0.00043370944],"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.000045781588,0.000037674137,0.000740751,0.0001362404,0.000015542746,0.00009564488,0.000078934834,0.8583739,0.025199888,0.020395039,0.001024187,0.09385644],"study_design_scores_gemma":[0.000014331947,0.000055964076,0.00013304435,0.000011812986,0.000007430418,0.000044646375,0.000029284554,0.9758951,0.010939093,0.010231574,0.0026314333,0.0000062967147],"about_ca_topic_score_codex":0.001063526,"about_ca_topic_score_gemma":0.0025398917,"teacher_disagreement_score":0.0023913078,"about_ca_system_score_codex":0.00066386437,"about_ca_system_score_gemma":0.00073467544,"threshold_uncertainty_score":0.007999718},"labels":[],"label_agreement":null},{"id":"W2907525512","doi":"10.1109/async.2018.00037","title":"Case Study of Process Variation-Based Domain Partitioning of GPGPUs","year":2018,"lang":"en","type":"article","venue":"","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"General-purpose computing on graphics processing units; Graphics processing unit; Computer science; Graphics; CUDA; Parallel computing; Chip; Process (computing); Clock rate; Process variation; Domain (mathematical analysis); System on a chip; Computational science; Computer architecture; Embedded system; Computer graphics (images); Operating system","score_opus":0.023228779556620286,"score_gpt":0.2775220405538601,"score_spread":0.2542932609972398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907525512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96738183,0.0005568256,0.024763316,0.0003536288,0.000044026838,0.00013897229,0.00023667658,0.00057087245,0.0059539205],"genre_scores_gemma":[0.9908578,0.00007743198,0.007954099,0.000052273015,0.0000060627785,0.000030251196,0.000085469735,0.000045583296,0.0008911478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00018456895,0.000020971174,0.00010673702,0.00018899902,0.00014314888],"domain_scores_gemma":[0.9986008,0.0006966956,0.00011616638,0.00027457866,0.0001945417,0.00011730514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605641,0.00038687247,0.00026312715,0.00036759395,0.0006366595,0.00049227406,0.0011220943,0.00076242397,0.0008711909],"category_scores_gemma":[0.0022319707,0.00015184787,0.000309078,0.00085710076,0.00069697655,0.00038187756,0.000405265,0.0004824203,0.00015227954],"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.0009774377,0.00052769383,0.024109239,0.00043582972,0.00015170668,0.009278072,0.0011338153,0.79354614,0.06596282,0.01083617,0.006765663,0.08627537],"study_design_scores_gemma":[0.00020004166,0.002134089,0.027953243,0.000044840548,0.00013954056,0.0038897446,0.00088199624,0.84373885,0.087004945,0.0074522803,0.026465466,0.000094974705],"about_ca_topic_score_codex":0.0070313243,"about_ca_topic_score_gemma":0.0077067213,"teacher_disagreement_score":0.0070313243,"about_ca_system_score_codex":0.0008801713,"about_ca_system_score_gemma":0.00055851636,"threshold_uncertainty_score":0.013980806},"labels":[],"label_agreement":null},{"id":"W2907843763","doi":"10.1109/candar.2018.00013","title":"An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Hypercube; Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Node (physics); Shortest Path Faster Algorithm; Path (computing); Routing (electronic design automation); Yen's algorithm; Euclidean shortest path; Equal-cost multi-path routing; Blocking (statistics); Longest path problem; Mathematics; Algorithm; Combinatorics; Theoretical computer science; Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Computer network; Graph","score_opus":0.01792943788406481,"score_gpt":0.23751073271062154,"score_spread":0.21958129482655672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907843763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10031567,0.0012272343,0.8867636,0.0009714057,0.0001554049,0.00030298758,0.0003889625,0.0007039652,0.009170787],"genre_scores_gemma":[0.4205036,0.0014424565,0.56911594,0.00013814046,0.00011088662,0.0003912371,0.000682179,0.00010526847,0.0075103054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.00023642217,0.000027509104,0.00009146059,0.00013604188,0.00007840173],"domain_scores_gemma":[0.99960667,0.00015801605,0.00005563213,0.000065255015,0.00007465987,0.00003974033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056561496,0.0006262754,0.0007746595,0.00059960014,0.0008231555,0.00080468185,0.00087880035,0.0006459604,0.0022392364],"category_scores_gemma":[0.0010289497,0.00028760443,0.0005028649,0.0013014891,0.00052480516,0.0017647562,0.0010930346,0.0005317939,0.00035691535],"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.0003303062,0.00011728349,0.000715146,0.00037016853,0.000064981126,0.0004265676,0.0002291659,0.8175061,0.017915098,0.05672917,0.0057805395,0.09981554],"study_design_scores_gemma":[0.00005038293,0.000104885934,0.00023374743,0.000012526181,0.000011693872,0.00010971237,0.000094726456,0.9637938,0.003922491,0.02760275,0.0040440317,0.00001919585],"about_ca_topic_score_codex":0.002142505,"about_ca_topic_score_gemma":0.0015704937,"teacher_disagreement_score":0.0022392364,"about_ca_system_score_codex":0.0008118141,"about_ca_system_score_gemma":0.0008324276,"threshold_uncertainty_score":0.007490933},"labels":[],"label_agreement":null},{"id":"W2907863705","doi":"10.1109/newcas.2018.8585434","title":"HPQ: A High Capacity Hybrid Priority Queue Architecture for High-Speed Network Switches","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Priority queue; Queue; Network packet; Latency (audio); USable; Computer network; Scheduling (production processes); Architecture; Field-programmable gate array; Queueing theory; Embedded system; Distributed computing; Telecommunications; Engineering","score_opus":0.018153915318641384,"score_gpt":0.2279943169459181,"score_spread":0.2098404016272767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907863705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041687943,0.001285832,0.9442426,0.0001869584,0.00028309462,0.00016221833,0.00031882225,0.005059415,0.006773109],"genre_scores_gemma":[0.6581497,0.0007249716,0.32659888,0.000340809,0.00013690643,0.00017180495,0.00080460997,0.00029385285,0.012778449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.0000411071,0.000019671106,0.000047439677,0.000106217645,0.00005698541],"domain_scores_gemma":[0.99971384,0.00005412212,0.00002848238,0.000043007232,0.00012099512,0.000039514543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102304,0.00040246296,0.00023695789,0.00047282246,0.00043731797,0.001084665,0.0018505491,0.0004070978,0.0042198678],"category_scores_gemma":[0.00048646028,0.00022084817,0.00029638517,0.0004696171,0.00025649482,0.0010441561,0.00055188546,0.0006718052,0.00079555786],"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.0019998976,0.00050595356,0.0036010018,0.0007786027,0.00029289915,0.0004872134,0.00032406172,0.112824835,0.22320187,0.0728969,0.025418062,0.55766875],"study_design_scores_gemma":[0.00044944318,0.0015361627,0.0019781769,0.00006445037,0.00019947189,0.0005981763,0.00008492955,0.8145831,0.097060025,0.019796193,0.0635328,0.00011715371],"about_ca_topic_score_codex":0.0035837046,"about_ca_topic_score_gemma":0.0043026614,"teacher_disagreement_score":0.0042198678,"about_ca_system_score_codex":0.000879209,"about_ca_system_score_gemma":0.0011592872,"threshold_uncertainty_score":0.014116824},"labels":[],"label_agreement":null},{"id":"W2912351760","doi":"10.1049/iet-cdt.2018.5055","title":"KBMA: A knowledge‐based multi‐objective application mapping approach for 3D NoC","year":2019,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","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":"University of Saskatchewan","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Particle swarm optimization; Network on a chip; Network topology; Computer architecture; Distributed computing; Computer engineering; Embedded system; Machine learning; Computer network","score_opus":0.019259411816609416,"score_gpt":0.2558613399660693,"score_spread":0.23660192814945988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912351760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018153949,0.0003638825,0.9760572,0.00017494523,0.00006660245,0.000091151334,0.00004329434,0.00034384805,0.004705284],"genre_scores_gemma":[0.53064334,0.0003360399,0.46319333,0.00024495707,0.000044440825,0.00054738874,0.000108404216,0.00009984378,0.004782252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983215,0.000053228952,0.000007722651,0.000024528423,0.00006236712,0.000019936715],"domain_scores_gemma":[0.999796,0.000111533685,0.000026165639,0.000014896365,0.0000387281,0.000012711485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042802744,0.0006270339,0.00047674033,0.0006437562,0.00040662775,0.00060468196,0.0011744989,0.0009575941,0.0020571572],"category_scores_gemma":[0.0008301863,0.00031122204,0.0006694596,0.00039636466,0.00035509418,0.0005321649,0.0009646395,0.000610464,0.00022947368],"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.00003093185,0.000050533323,0.000302837,0.00008740022,0.000060679733,0.00006313727,0.000057277706,0.92055297,0.005078995,0.004917558,0.0007413407,0.06805634],"study_design_scores_gemma":[0.0000055844366,0.000029099065,0.00006863203,0.000005106721,0.00000623229,0.000018084675,0.000009537573,0.9970259,0.0005506346,0.0015526636,0.0007242505,0.0000041788257],"about_ca_topic_score_codex":0.003040605,"about_ca_topic_score_gemma":0.0031705345,"teacher_disagreement_score":0.003040605,"about_ca_system_score_codex":0.0004253626,"about_ca_system_score_gemma":0.00072704506,"threshold_uncertainty_score":0.0068818927},"labels":[],"label_agreement":null},{"id":"W2915521883","doi":"10.1145/3289602.3294002","title":"Enhancing Butterfly Fat Tree NoCs for FPGAs with Lightweight Flow Control","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Computer science; Router; Field-programmable gate array; Network on a chip; Embedded system; Deflection routing; Latency (audio); Place and route; Network packet; Scheduling (production processes); Computer network; Routing protocol; Static routing; Engineering","score_opus":0.0061464869001383446,"score_gpt":0.19626346000282896,"score_spread":0.19011697310269063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915521883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.758008,0.0005302506,0.22575706,0.00021754424,0.000114640934,0.00013072992,0.00018027847,0.0022956072,0.012765792],"genre_scores_gemma":[0.9110936,0.00019459285,0.08616974,0.00006731321,0.000014486111,0.000037836646,0.00011944729,0.000046689504,0.0022563234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998754,0.000024742934,0.000008302132,0.000013764375,0.000046539066,0.000031163698],"domain_scores_gemma":[0.9995858,0.00013242231,0.00008510274,0.000056877594,0.00011338612,0.000026377335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024959398,0.00033959773,0.00012781707,0.00042023216,0.00020533026,0.00034478534,0.0004567807,0.00017326421,0.0014681394],"category_scores_gemma":[0.00076191116,0.00009288143,0.00013693172,0.00028953853,0.00017073174,0.00056030526,0.00020098212,0.00021639379,0.00018552659],"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.0005250966,0.0002458062,0.0064062728,0.0004050536,0.000065649874,0.00047843845,0.00013505353,0.51623684,0.22442521,0.011163964,0.0043643946,0.23554823],"study_design_scores_gemma":[0.00006813917,0.0010290439,0.0027254913,0.000032741078,0.00006173297,0.00023527647,0.00006872305,0.8887126,0.09543884,0.0031626504,0.008436807,0.000027975937],"about_ca_topic_score_codex":0.0024736607,"about_ca_topic_score_gemma":0.006425222,"teacher_disagreement_score":0.0024736607,"about_ca_system_score_codex":0.00048683604,"about_ca_system_score_gemma":0.00045120931,"threshold_uncertainty_score":0.0049185157},"labels":[],"label_agreement":null},{"id":"W2917135642","doi":"10.1145/3289602.3293903","title":"The Network Management Unit (NMU)","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Latency (audio); Routing (electronic design automation); Networking hardware; Embedded system; Network processor; Throughput; Network management; Computer architecture; Computer network; Operating system; Telecommunications","score_opus":0.007951593086622726,"score_gpt":0.2056560361006942,"score_spread":0.19770444301407147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917135642","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14103656,0.0051663816,0.7086813,0.0010099529,0.0010832826,0.0011154548,0.0005539059,0.010867517,0.13048567],"genre_scores_gemma":[0.7516432,0.001070029,0.2196499,0.00064377,0.00027609148,0.0006360878,0.00032571884,0.000243688,0.025511501],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943954,0.00012147914,0.000043246288,0.00013972541,0.00014377522,0.00011217309],"domain_scores_gemma":[0.99948645,0.00007963813,0.00010558128,0.00014449112,0.00012693313,0.000056903187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004079595,0.00060624385,0.00027733573,0.00047717767,0.00055545295,0.0013663847,0.0012390687,0.0006514113,0.0057228236],"category_scores_gemma":[0.00089360395,0.00026799593,0.00021378277,0.00034750445,0.000424755,0.0014998206,0.0009346691,0.00053331937,0.0019533155],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006121438,0.00025467842,0.00568237,0.0009392387,0.00010843369,0.0006007838,0.0006375804,0.020298587,0.11961854,0.17263329,0.032265976,0.6463484],"study_design_scores_gemma":[0.00009837397,0.0015267564,0.004871472,0.0002951208,0.00016726539,0.0020939047,0.0002169318,0.13021147,0.19052075,0.017087674,0.6527585,0.00015182442],"about_ca_topic_score_codex":0.0006680857,"about_ca_topic_score_gemma":0.00081376155,"teacher_disagreement_score":0.0057228236,"about_ca_system_score_codex":0.000829044,"about_ca_system_score_gemma":0.0005816563,"threshold_uncertainty_score":0.019144714},"labels":[],"label_agreement":null},{"id":"W2917839487","doi":"10.1145/3289602.3293917","title":"HopliteBuf","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Computer science; Deflection routing; Network packet; Latency (audio); Field-programmable gate array; Bounding overwatch; Computer network; Parallel computing; Topology (electrical circuits); Routing protocol; Computer hardware; Mathematics; Telecommunications","score_opus":0.004103714305623634,"score_gpt":0.18408222633850949,"score_spread":0.17997851203288584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917839487","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19125582,0.005275398,0.325072,0.001235227,0.0013161519,0.0008233221,0.011640638,0.09114913,0.37223235],"genre_scores_gemma":[0.67497706,0.001685371,0.1881431,0.0009259119,0.00012590546,0.00075025513,0.016913151,0.0037821254,0.11269713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.000026543748,0.000015173726,0.000040555522,0.00013505544,0.00007040215],"domain_scores_gemma":[0.9995807,0.000092189875,0.00004939371,0.00008728678,0.0001565634,0.000033778644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003468964,0.00052880263,0.0002144391,0.00063233176,0.00043846254,0.00070373266,0.0011538299,0.0005528079,0.031211713],"category_scores_gemma":[0.0010915607,0.00033400496,0.00023561856,0.0003829421,0.00028568922,0.0011999666,0.0006350284,0.00055645575,0.004053439],"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.0014769258,0.00027950082,0.004932473,0.0018181333,0.00013490765,0.0007012851,0.0004325345,0.046849597,0.07081216,0.10617755,0.21865046,0.54773444],"study_design_scores_gemma":[0.00033598757,0.0012255796,0.0029870905,0.00025175588,0.000090624075,0.0013522988,0.00018694106,0.16652733,0.14104281,0.022489509,0.66334575,0.00016431244],"about_ca_topic_score_codex":0.0024886867,"about_ca_topic_score_gemma":0.0038352988,"teacher_disagreement_score":0.031211713,"about_ca_system_score_codex":0.000808753,"about_ca_system_score_gemma":0.00085786806,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2918883355","doi":"","title":"Super edge connectivity of direct product of graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Geometry; Computer science; Artificial intelligence","score_opus":0.013916518316738678,"score_gpt":0.2351739771977522,"score_spread":0.22125745888101353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918883355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59688663,0.0015334387,0.23920777,0.000788319,0.00022636943,0.00007331096,0.0009421456,0.0004588602,0.15988317],"genre_scores_gemma":[0.94886476,0.0008344647,0.029076155,0.00019678751,0.00014523769,0.00007646521,0.00079284195,0.00009633585,0.019916926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994961,0.00014857916,0.00002468816,0.00012677032,0.00013362952,0.0000701517],"domain_scores_gemma":[0.99752134,0.0012487031,0.00032540818,0.00025224907,0.00034269443,0.00030947375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885675,0.00031804806,0.00039705032,0.0015910267,0.0006954276,0.0013598275,0.0007250399,0.0006197793,0.01181851],"category_scores_gemma":[0.0033197086,0.00035493137,0.0003233705,0.0011877437,0.00092375785,0.0032548697,0.0012958576,0.00085567805,0.0009919665],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093447146,0.0000332934,0.0015457376,0.00016904993,0.00002612287,0.0004987977,0.00031307456,0.0048466194,0.0033046505,0.9602497,0.005455196,0.023464251],"study_design_scores_gemma":[0.000019075964,0.000062601735,0.0017632073,0.00004694157,0.00003240867,0.0010598238,0.00019768813,0.037549175,0.0017883078,0.9435255,0.013938803,0.000016325113],"about_ca_topic_score_codex":0.00057822646,"about_ca_topic_score_gemma":0.0010891188,"teacher_disagreement_score":0.01181851,"about_ca_system_score_codex":0.00039714025,"about_ca_system_score_gemma":0.00022897121,"threshold_uncertainty_score":0.039536834},"labels":[],"label_agreement":null},{"id":"W2920974405","doi":"10.1007/s10878-019-00400-6","title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Vertex connectivity; Connectivity; Graph; Time complexity; Theory of computation; Discrete mathematics; Algorithm","score_opus":0.005635936552762238,"score_gpt":0.2127651921359911,"score_spread":0.20712925558322887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920974405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43625274,0.00047760666,0.5317162,0.0010922167,0.0001335665,0.0006718397,0.0019626508,0.004337995,0.023355173],"genre_scores_gemma":[0.61081403,0.0002178402,0.3782787,0.00023430459,0.00009740052,0.00028281714,0.003974466,0.0004273106,0.0056731002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926287,0.00015551333,0.000041103547,0.00024416708,0.0001385456,0.00015786411],"domain_scores_gemma":[0.9954788,0.0029691441,0.00036291167,0.0005780803,0.00038033526,0.0002307786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993067,0.0009294088,0.0010736351,0.0018329691,0.0012553511,0.0020048602,0.0026587103,0.0014314314,0.010363148],"category_scores_gemma":[0.005441241,0.00066570455,0.00097221695,0.0024993455,0.0009324454,0.0023841213,0.001755952,0.0012638806,0.0014566401],"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.0020091902,0.0009323899,0.007902224,0.0007891695,0.00023720488,0.00052521966,0.00072395476,0.3183107,0.03238898,0.057339806,0.030791795,0.5480494],"study_design_scores_gemma":[0.0003340098,0.0002620513,0.00146321,0.00003984049,0.00007813888,0.00016153244,0.00027238994,0.91626203,0.007666007,0.069534145,0.003887899,0.00003869129],"about_ca_topic_score_codex":0.008002302,"about_ca_topic_score_gemma":0.012868797,"teacher_disagreement_score":0.010363148,"about_ca_system_score_codex":0.0017555034,"about_ca_system_score_gemma":0.0032590677,"threshold_uncertainty_score":0.034668207},"labels":[],"label_agreement":null},{"id":"W2929289575","doi":"10.1109/tcad.2019.2908921","title":"On Error Injection for NoC Platforms: A UVM-Based Generic Verification Environment","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":26,"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":"Emulation; Router; Computer science; Embedded system; Error detection and correction; Network on a chip; Fault injection; Operating system; Computer network; Algorithm; Software","score_opus":0.039603583040303675,"score_gpt":0.22685687875849697,"score_spread":0.1872532957181933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929289575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033054367,0.00017272338,0.9567975,0.0001043321,0.000032503845,0.00019319268,0.00013175387,0.0062604756,0.0032531729],"genre_scores_gemma":[0.3816647,0.00026365404,0.6130051,0.00018171383,0.000032119147,0.00028233856,0.0003621976,0.0008317629,0.0033764765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655306,0.0012921819,0.00024846947,0.00053231383,0.0010927694,0.00028111864],"domain_scores_gemma":[0.99588263,0.0013089711,0.00046968414,0.0018389097,0.00041812498,0.00008167855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031773597,0.0010386152,0.0006143258,0.00084619963,0.00043450002,0.0010677533,0.001966379,0.000999836,0.0027327882],"category_scores_gemma":[0.0065323077,0.000391171,0.00093482673,0.00038533172,0.0013859808,0.0020275714,0.0024032576,0.0010853393,0.0006118051],"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.00092399865,0.0004441371,0.009197024,0.0013184773,0.00015028942,0.002039836,0.00093615113,0.23698227,0.23977639,0.16443934,0.0041347607,0.33965722],"study_design_scores_gemma":[0.00012964061,0.00085115596,0.0018086751,0.00024519415,0.00010743813,0.0016189916,0.00008907095,0.6439742,0.27367032,0.040575795,0.036836956,0.00009255838],"about_ca_topic_score_codex":0.0005554106,"about_ca_topic_score_gemma":0.00079635193,"teacher_disagreement_score":0.0031773597,"about_ca_system_score_codex":0.00065881514,"about_ca_system_score_gemma":0.0010101892,"threshold_uncertainty_score":0.016803682},"labels":[],"label_agreement":null},{"id":"W2931065016","doi":"10.1016/j.jpdc.2019.03.013","title":"INRFlow: An interconnection networks research flow-level simulation framework","year":2019,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Engineering and Physical Sciences Research Council; European Commission","keywords":"Computer science; Network topology; Scalability; Distributed computing; Modular design; Interconnection; Variety (cybernetics); Context (archaeology); Network traffic simulation; Bandwidth (computing); Computer network; Network traffic control","score_opus":0.06974009187274968,"score_gpt":0.34891673189469175,"score_spread":0.2791766400219421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931065016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004105262,0.00026820958,0.9773361,0.00028100243,0.00016024096,0.00032028471,0.0010659797,0.0077758743,0.008687132],"genre_scores_gemma":[0.10693106,0.0012148643,0.87490934,0.00040487,0.00016364014,0.002036894,0.004340151,0.002352786,0.0076464503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890697,0.00040849502,0.00007507761,0.00012985307,0.00034647697,0.00013319435],"domain_scores_gemma":[0.99843925,0.00082059915,0.00012760574,0.00019665953,0.0002838378,0.0001320404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000519,0.0013283956,0.0010956513,0.0012734612,0.0008912906,0.0018573091,0.0038588005,0.0016815204,0.008294124],"category_scores_gemma":[0.0047791577,0.0008493485,0.0020758496,0.0008077464,0.0010479704,0.0022611013,0.0017979625,0.0025596458,0.0016365453],"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.00009506473,0.00010668383,0.0010047192,0.00021153459,0.000086574924,0.000090557456,0.00013736426,0.85969067,0.0025437635,0.09937354,0.011519932,0.02513956],"study_design_scores_gemma":[0.00004310765,0.000026330054,0.00008162728,0.000029435942,0.000014633821,0.000026860584,0.000007993903,0.9630547,0.0010309159,0.013766982,0.021897297,0.000020118221],"about_ca_topic_score_codex":0.012048727,"about_ca_topic_score_gemma":0.00721862,"teacher_disagreement_score":0.012048727,"about_ca_system_score_codex":0.0018456788,"about_ca_system_score_gemma":0.0036360333,"threshold_uncertainty_score":0.027746618},"labels":[],"label_agreement":null},{"id":"W2943584187","doi":"","title":"Interlace polynomials of n-claw graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Claw; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.011758007589839716,"score_gpt":0.24012160899691737,"score_spread":0.22836360140707765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943584187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312094,0.00046902502,0.16870622,0.00082270347,0.0003086443,0.00012681629,0.00039050076,0.00032275866,0.09764392],"genre_scores_gemma":[0.9516167,0.00038155372,0.01818563,0.00020726565,0.00017311436,0.00007924105,0.00028015694,0.00013279975,0.028943533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928904,0.00013505647,0.000024409954,0.00014803797,0.00019083997,0.00021263886],"domain_scores_gemma":[0.9981135,0.00069827586,0.00037531066,0.00017236643,0.00029025032,0.00035042572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225114,0.0007301989,0.00050928124,0.0023136113,0.001479821,0.0017881859,0.0013517117,0.0008061489,0.009704039],"category_scores_gemma":[0.0032042998,0.00046361226,0.00056702894,0.0014237447,0.0018073767,0.002300095,0.001307063,0.0019982792,0.0013661231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001859635,0.00013291379,0.00095046335,0.00009603542,0.000021032942,0.00035837403,0.00069462217,0.007424745,0.005868849,0.95318806,0.0036803118,0.027398534],"study_design_scores_gemma":[0.00004434738,0.000119687,0.0013200535,0.000040972867,0.000027075497,0.00045529834,0.0003925765,0.034786873,0.0037837608,0.9486027,0.010373824,0.00005295319],"about_ca_topic_score_codex":0.0021884597,"about_ca_topic_score_gemma":0.0035754358,"teacher_disagreement_score":0.009704039,"about_ca_system_score_codex":0.001302075,"about_ca_system_score_gemma":0.00071864075,"threshold_uncertainty_score":0.032463312},"labels":[],"label_agreement":null},{"id":"W2945645791","doi":"10.1007/978-3-030-18656-2_24","title":"Application Specific Reconfigurable SoC Interconnection Network Architecture","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interconnection; Computer architecture; Architecture; Embedded system; Computer network","score_opus":0.014002418332682804,"score_gpt":0.22014306099590467,"score_spread":0.20614064266322185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945645791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13159722,0.006383306,0.54789025,0.00048187625,0.0013115223,0.00023180827,0.0013805459,0.012568564,0.29815495],"genre_scores_gemma":[0.5806085,0.0056283325,0.21082021,0.00052960945,0.00024929622,0.00020970777,0.0035736796,0.00089693203,0.19748375],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999491,0.000005453065,0.0000036262352,0.000012304432,0.000016995815,0.000012513847],"domain_scores_gemma":[0.99994016,0.0000049244445,0.0000070322467,0.000016471144,0.00002565625,0.0000057616808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006194366,0.00040495777,0.00013918277,0.0004041348,0.00016848494,0.0003956191,0.0005609786,0.00021147747,0.0071333745],"category_scores_gemma":[0.00008792497,0.00014205032,0.00027012583,0.0004950844,0.000078932964,0.00034304548,0.00027987268,0.00032097904,0.002273522],"study_design_candidate":"bench_or_experimental","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.00024985572,0.000081141574,0.0009721499,0.000905701,0.000089827015,0.0005638961,0.00009793201,0.06655027,0.29112777,0.042611774,0.038582113,0.5581675],"study_design_scores_gemma":[0.0000420776,0.00060988433,0.004312313,0.00016126395,0.0001672644,0.0027747846,0.00008756747,0.2657185,0.17888357,0.018355919,0.5288149,0.000071968],"about_ca_topic_score_codex":0.00055872835,"about_ca_topic_score_gemma":0.0016648838,"teacher_disagreement_score":0.0071333745,"about_ca_system_score_codex":0.00028595192,"about_ca_system_score_gemma":0.00030065706,"threshold_uncertainty_score":0.023863494},"labels":[],"label_agreement":null},{"id":"W2948211145","doi":"10.1109/cybermatics_2018.2018.00312","title":"Topological Response to Deadlock Detection and Resolution in Real-Time Database Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Northern British Columbia","funders":"","keywords":"Timeout; Computer science; Deadlock prevention algorithms; Distributed computing; Workload; Overhead (engineering); Concurrency control; Deadlock; Key (lock); Node (physics); Computer network; Real-time computing; Topology (electrical circuits); Database; Computer security; Database transaction; Operating system","score_opus":0.02300188469663112,"score_gpt":0.26730722340826535,"score_spread":0.24430533871163423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948211145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61110944,0.00060148205,0.3822829,0.00049552944,0.00010042891,0.00012630758,0.00008152675,0.0021878593,0.0030144483],"genre_scores_gemma":[0.98215723,0.00006614511,0.01728515,0.000030960375,0.000006546181,0.00004063339,0.000040961688,0.000037038426,0.00033527217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651694,0.0019424891,0.00025315175,0.00021572912,0.0007702692,0.0003014597],"domain_scores_gemma":[0.9859735,0.0091761425,0.0013843483,0.0017477494,0.001171405,0.00054694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053742933,0.00039593302,0.000539886,0.00074376666,0.0007270881,0.0012884401,0.001513019,0.00084296154,0.0012933218],"category_scores_gemma":[0.020633059,0.0003640684,0.00029930286,0.0004934105,0.0014311927,0.0020195213,0.0016540162,0.0007212521,0.00014607776],"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.0014727421,0.00031847908,0.010905747,0.0005405446,0.00014859805,0.0008310525,0.0015180515,0.80554026,0.0719671,0.04853127,0.0014657537,0.05676036],"study_design_scores_gemma":[0.00008420565,0.0004318028,0.001520277,0.00001624699,0.000044803928,0.00027324865,0.00035432214,0.95546913,0.026452104,0.014013378,0.001305409,0.000035090055],"about_ca_topic_score_codex":0.0005511257,"about_ca_topic_score_gemma":0.0006316777,"teacher_disagreement_score":0.0053742933,"about_ca_system_score_codex":0.0007380997,"about_ca_system_score_gemma":0.00082992885,"threshold_uncertainty_score":0.028422356},"labels":[],"label_agreement":null},{"id":"W2949207837","doi":"10.1109/mssc.2019.2910619","title":"Ultra-Short-Reach Interconnects for Die-to-Die Links: Global Bandwidth Demands in Microcosm","year":2019,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Magazine","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":19,"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; University of Calgary","funders":"","keywords":"Bandwidth (computing); Die (integrated circuit); Signal integrity; Power consumption; Electrical impedance; Chip; Interconnection; Electronic engineering; Electrical engineering; Computer science; Engineering; Telecommunications; Power (physics); Physics; Mechanical engineering","score_opus":0.019176432799825213,"score_gpt":0.2792255406454986,"score_spread":0.26004910784567337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949207837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36615977,0.04854389,0.4229067,0.014066335,0.00081760023,0.00009086639,0.00045515815,0.0015563586,0.14540331],"genre_scores_gemma":[0.85977983,0.025771502,0.091432385,0.0008566462,0.00038629677,0.00012344043,0.00023081993,0.00038602314,0.021033008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953794,0.00006244136,0.000012697193,0.000073486735,0.00023490538,0.00007856685],"domain_scores_gemma":[0.99914277,0.0003118049,0.00009251174,0.00014397659,0.00023282882,0.000076065575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010105897,0.00032286224,0.0005417505,0.0007657205,0.00078199955,0.0027803143,0.00063151395,0.00095377845,0.0031987363],"category_scores_gemma":[0.0016488008,0.0003280922,0.00014511067,0.0011917028,0.001732623,0.0044903965,0.0012532921,0.0011461148,0.0008316875],"study_design_candidate":"bench_or_experimental","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.0001386468,0.000049409457,0.0016605557,0.00039543796,0.00001756216,0.00042065058,0.0005547909,0.02610225,0.0854688,0.6990735,0.0066460213,0.17947228],"study_design_scores_gemma":[0.000032228432,0.0006821617,0.0054676607,0.00028683743,0.00006156429,0.0018859463,0.0017236462,0.1286221,0.09125737,0.41857517,0.35128993,0.000115426345],"about_ca_topic_score_codex":0.00059195317,"about_ca_topic_score_gemma":0.0010905717,"teacher_disagreement_score":0.0031987363,"about_ca_system_score_codex":0.0013725426,"about_ca_system_score_gemma":0.00050109567,"threshold_uncertainty_score":0.0107008815},"labels":[],"label_agreement":null},{"id":"W2950297888","doi":"10.1145/3330345.3330381","title":"DeepHiR","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Kootenay Association for Science & Technology","funders":"National Science and Technology Major Project; National University of Defense Technology","keywords":"Computer science","score_opus":0.004278927667378021,"score_gpt":0.18372871015068168,"score_spread":0.17944978248330365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950297888","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024297016,0.0067409836,0.102721505,0.0060091587,0.0047143428,0.0003088318,0.0036501703,0.007656155,0.84390175],"genre_scores_gemma":[0.2186135,0.0050298343,0.05451381,0.005484863,0.00091058214,0.00023343335,0.005367697,0.0014553787,0.70839095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959654,0.000029653702,0.000021412523,0.00011010461,0.00015525032,0.00008700287],"domain_scores_gemma":[0.9993787,0.000057202386,0.00003536452,0.00013274976,0.0002493501,0.00014664017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039454835,0.0005955098,0.00043086338,0.0007863011,0.0009982898,0.0023467122,0.0010777459,0.0012435912,0.16083919],"category_scores_gemma":[0.0008816595,0.0003404649,0.00037976596,0.0006180462,0.0005071452,0.0017414164,0.0020454037,0.0014380915,0.07551975],"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.00027674274,0.00014962662,0.0023072457,0.00037332156,0.000032166416,0.0006768792,0.0002604202,0.0010294525,0.018545233,0.05162956,0.14723963,0.77747977],"study_design_scores_gemma":[0.00005563651,0.00012938368,0.0016648491,0.00012021109,0.000031046395,0.0012656002,0.00015516687,0.0029954228,0.011603842,0.01759697,0.96435404,0.000027814607],"about_ca_topic_score_codex":0.0015124789,"about_ca_topic_score_gemma":0.002973484,"teacher_disagreement_score":0.16083919,"about_ca_system_score_codex":0.0008238303,"about_ca_system_score_gemma":0.0016250197,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2952675288","doi":"10.1109/fccm.2019.00030","title":"Enhancing Butterfly Fat Tree NoCs for FPGAs with Lightweight Flow Control","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"","keywords":"Computer science; Field-programmable gate array; Embedded system; Tree (set theory); Butterfly; Flow control (data); Control flow; Computer architecture; Computer hardware; Computer network; Programming language","score_opus":0.0061464869001383446,"score_gpt":0.19626346000282896,"score_spread":0.19011697310269063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952675288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7240716,0.00060044124,0.26013488,0.00020770503,0.0000989913,0.00011843641,0.00016424178,0.0020447883,0.012558901],"genre_scores_gemma":[0.9118674,0.00023061299,0.085652724,0.000059152757,0.0000141043965,0.000033184442,0.00010739739,0.00004233323,0.0019931975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998975,0.000020811158,0.000006348437,0.000011326879,0.000038661172,0.00002539249],"domain_scores_gemma":[0.9996697,0.00010478984,0.000071895556,0.000045022978,0.00008646915,0.000022096836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021982424,0.00029916677,0.00011597153,0.00039099038,0.00020373853,0.00032827305,0.00037050666,0.000155468,0.0012830988],"category_scores_gemma":[0.0006703959,0.000079752295,0.0001180156,0.00027129296,0.00016037904,0.0005395421,0.000203186,0.00019134134,0.0001670021],"study_design_candidate":"bench_or_experimental","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.00039010236,0.00020692775,0.0057115927,0.00036898535,0.000053795015,0.00043783133,0.00012527329,0.4912534,0.2437982,0.0116316425,0.0037202924,0.24230199],"study_design_scores_gemma":[0.000053920023,0.00082215003,0.0025951893,0.000028804718,0.00004857462,0.0002249901,0.00006460173,0.8959293,0.08825361,0.0038769636,0.008077242,0.000024731344],"about_ca_topic_score_codex":0.0021730734,"about_ca_topic_score_gemma":0.0061017103,"teacher_disagreement_score":0.0021730734,"about_ca_system_score_codex":0.00043599616,"about_ca_system_score_gemma":0.00041081762,"threshold_uncertainty_score":0.00432086},"labels":[],"label_agreement":null},{"id":"W2953004880","doi":"10.1109/fccm.2019.00018","title":"RapidRoute: Fast Assembly of Communication Structures for FPGA Overlays","year":2019,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Router; Heuristics; Field-programmable gate array; Overlay; Polygon mesh; Routing (electronic design automation); Reuse; Embedded system; Overhead (engineering); Parallel computing; Computer architecture; Computer network; Operating system; Engineering","score_opus":0.015290433256794954,"score_gpt":0.25149605924126867,"score_spread":0.2362056259844737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953004880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13830669,0.00050711725,0.7057013,0.00023558078,0.00022859027,0.00041178125,0.001190063,0.1250694,0.028349476],"genre_scores_gemma":[0.5238327,0.00037891738,0.44850796,0.00015505172,0.000040158964,0.0004322262,0.0027327882,0.0078000566,0.016120192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998211,0.00002924149,0.000011428396,0.000033110307,0.00006165595,0.0000435299],"domain_scores_gemma":[0.9995881,0.00014647323,0.00005631789,0.00011756275,0.00006524174,0.000026243604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039854008,0.00078606885,0.00025956478,0.00042662452,0.00026185132,0.0005951537,0.0010590077,0.00033181283,0.016866438],"category_scores_gemma":[0.0011337202,0.00046803107,0.00036413778,0.000261432,0.00028079317,0.00092262134,0.0006730722,0.00052416825,0.002240593],"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.0009731788,0.00027780316,0.006183149,0.0013678776,0.00018640632,0.0010342627,0.00069480174,0.12810564,0.19739549,0.033809125,0.10180422,0.52816796],"study_design_scores_gemma":[0.00060823554,0.0010041157,0.0038300473,0.00017729298,0.00008400409,0.00081275415,0.00025674747,0.5268215,0.25345087,0.011930844,0.2008921,0.0001315697],"about_ca_topic_score_codex":0.0014998878,"about_ca_topic_score_gemma":0.0034174856,"teacher_disagreement_score":0.016866438,"about_ca_system_score_codex":0.0005761569,"about_ca_system_score_gemma":0.0006150356,"threshold_uncertainty_score":0.056423903},"labels":[],"label_agreement":null},{"id":"W2953689691","doi":"10.1109/access.2019.2925381","title":"A Self-Adaptive Mapping Approach for Network on Chip With Low Power Consumption","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":22,"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 Saskatchewan","funders":"Department of Science and Technology, Philippines; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Network on a chip; Reliability (semiconductor); Cluster analysis; Graph; Power consumption; Swarm behaviour; Power (physics); Algorithm; Artificial intelligence; Theoretical computer science; Embedded system","score_opus":0.03033125471423221,"score_gpt":0.2549646160241861,"score_spread":0.22463336130995387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953689691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020634538,0.0003299313,0.9741245,0.00012644309,0.00004008686,0.00003971532,0.000013297689,0.00023960107,0.004451816],"genre_scores_gemma":[0.6282943,0.00043419906,0.36431667,0.00014775162,0.000037703205,0.0001822077,0.00006821883,0.00009143413,0.0064275684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985385,0.00003700189,0.000005331105,0.000029611025,0.00005737128,0.000016854341],"domain_scores_gemma":[0.99987733,0.000036587644,0.000016746588,0.000019734993,0.000040169794,0.000009514666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021102707,0.00039836933,0.00029561023,0.00049352075,0.00036469367,0.00037735724,0.0008021837,0.00041803165,0.0011560638],"category_scores_gemma":[0.0004582548,0.00017222176,0.00034071587,0.00040973636,0.00029683197,0.00058849464,0.00045100486,0.0003676684,0.00017319004],"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.00003443537,0.00008407266,0.00051472953,0.00010486446,0.00005299383,0.000121413,0.00012684512,0.7477008,0.032209095,0.027938874,0.0024730214,0.1886388],"study_design_scores_gemma":[0.0000042478287,0.000043330663,0.00012277787,0.0000037942877,0.000007930602,0.000049310536,0.000017090662,0.99120975,0.002021966,0.004426614,0.0020881167,0.0000051871166],"about_ca_topic_score_codex":0.0012068771,"about_ca_topic_score_gemma":0.0015750567,"teacher_disagreement_score":0.0012068771,"about_ca_system_score_codex":0.00039988157,"about_ca_system_score_gemma":0.00049327576,"threshold_uncertainty_score":0.0038673878},"labels":[],"label_agreement":null},{"id":"W2956123625","doi":"10.1109/synasc.2018.00022","title":"Rational Householder Transformations","year":2018,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Western University","funders":"","keywords":"Algebra over a field; Integer (computer science); Linear algebra; Computation; Rational number; Computer science; Square (algebra); QR decomposition; Arithmetic; Mathematics; Matrix algebra; Discrete mathematics; Algorithm; Pure mathematics; Programming language","score_opus":0.022559441493387736,"score_gpt":0.23714940034770984,"score_spread":0.2145899588543221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956123625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020375993,0.00014929308,0.88776314,0.00024378991,0.00021585163,0.00011776583,0.000116849704,0.00086258765,0.09015476],"genre_scores_gemma":[0.40009558,0.00057381095,0.51839733,0.0004327137,0.00024617926,0.00027212163,0.00029713233,0.0011043642,0.07858069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936587,0.00016620528,0.00003244982,0.00010970882,0.00023856967,0.00008725239],"domain_scores_gemma":[0.9996445,0.00009787811,0.000029118535,0.00012912472,0.00007104552,0.00002832925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194557,0.00053899235,0.00040921447,0.0009954092,0.00069884217,0.0012793513,0.00056820776,0.00044461896,0.020764437],"category_scores_gemma":[0.0017070059,0.00030673895,0.00064647343,0.00051446573,0.0012882511,0.0017159946,0.0011447879,0.0012442316,0.0055122506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610244,0.000014406972,0.00005308697,0.000025144473,0.0000032560083,0.000038505153,0.00013957453,0.0026467072,0.0036260597,0.96292526,0.0016687019,0.028843172],"study_design_scores_gemma":[0.000037053174,0.00007756867,0.000108258144,0.0000310623,0.000010249455,0.00018393267,0.00012958805,0.041397475,0.014549772,0.89727944,0.04616068,0.000034900175],"about_ca_topic_score_codex":0.00035115727,"about_ca_topic_score_gemma":0.0005283351,"teacher_disagreement_score":0.020764437,"about_ca_system_score_codex":0.0004237866,"about_ca_system_score_gemma":0.0003813057,"threshold_uncertainty_score":0.06946397},"labels":[],"label_agreement":null},{"id":"W2962842387","doi":"","title":"Edge Decompositions of Hypercubes by Paths","year":2013,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Interconnection Networks and Systems","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":"Royal Canadian Navy","funders":"","keywords":"Hypercube; Combinatorics; Path (computing); Disjoint sets; Enhanced Data Rates for GSM Evolution; Mathematics; Disjoint union (topology); Discrete mathematics; Computer science; Telecommunications; Computer network","score_opus":0.009294119659840214,"score_gpt":0.21715592735450945,"score_spread":0.20786180769466922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962842387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61343974,0.002171946,0.3254965,0.00044146215,0.00022605213,0.00016780081,0.001079681,0.0005170889,0.05645982],"genre_scores_gemma":[0.83032924,0.0014699398,0.14289194,0.00023617878,0.00010429072,0.00019092714,0.0015291348,0.00018171199,0.023066578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997342,0.000055481327,0.000020474112,0.00005442493,0.00006030625,0.0000750575],"domain_scores_gemma":[0.99971837,0.00006090976,0.000054507385,0.000048009653,0.000060844563,0.000057298934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018479937,0.00027397546,0.00024679105,0.00089737395,0.0005529578,0.0010017582,0.00029738716,0.00027467927,0.0053074956],"category_scores_gemma":[0.00053533487,0.0002705702,0.0003280384,0.00070037064,0.0005053462,0.0012800558,0.0009189331,0.00045691873,0.0007304146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000631474,0.00009794934,0.0037659204,0.00034329324,0.00007307695,0.0007992151,0.0009597334,0.063361496,0.04632835,0.72693217,0.009752571,0.14695477],"study_design_scores_gemma":[0.00008298585,0.00015307018,0.00313913,0.00012087736,0.000037204536,0.00088970433,0.0008422074,0.1440755,0.014038891,0.7865018,0.050076548,0.000042107673],"about_ca_topic_score_codex":0.0007312117,"about_ca_topic_score_gemma":0.0011028711,"teacher_disagreement_score":0.0053074956,"about_ca_system_score_codex":0.00037348643,"about_ca_system_score_gemma":0.00020218553,"threshold_uncertainty_score":0.01775533},"labels":[],"label_agreement":null},{"id":"W2962878198","doi":"10.5539/jmr.v11n4p32","title":"Fractional Strong Matching Preclusion of Split-Star Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Graph; Prime (order theory); Discrete mathematics; Statistics","score_opus":0.06362806069779214,"score_gpt":0.36222711545047603,"score_spread":0.2985990547526839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962878198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77986133,0.0008568723,0.19850764,0.00059296185,0.0000617154,0.00015500061,0.0006526074,0.00025406486,0.019057814],"genre_scores_gemma":[0.96954805,0.00038669788,0.027688123,0.00008446633,0.00005017257,0.00008629647,0.00031330236,0.000024152558,0.0018187383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899155,0.00019553183,0.00008974076,0.00026704607,0.00029088074,0.0001651267],"domain_scores_gemma":[0.9968167,0.0013672049,0.0006393759,0.00045673264,0.00032560222,0.00039437754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008470233,0.0004465262,0.00065726484,0.0014382367,0.0013039216,0.0016212628,0.001033818,0.000706304,0.0046083606],"category_scores_gemma":[0.006393505,0.0003704906,0.00064903783,0.0012397924,0.0013350798,0.0038535895,0.0018636954,0.0009285436,0.00026459002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011579958,0.00014124952,0.008488687,0.00053950044,0.00012742516,0.00058412115,0.00070037873,0.1411795,0.025677534,0.7318209,0.0038159657,0.08576674],"study_design_scores_gemma":[0.000087738954,0.00026987077,0.004009733,0.00005976576,0.000087735774,0.0011568423,0.0003273607,0.32861376,0.015055624,0.6410177,0.009260433,0.000053455537],"about_ca_topic_score_codex":0.0007136634,"about_ca_topic_score_gemma":0.00054565957,"teacher_disagreement_score":0.0046083606,"about_ca_system_score_codex":0.0011127256,"about_ca_system_score_gemma":0.00064745103,"threshold_uncertainty_score":0.015416503},"labels":[],"label_agreement":null},{"id":"W2962898528","doi":"","title":"The generalized connectivity of complete bipartite graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Bipartite graph; Disjoint sets; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.015190567271106667,"score_gpt":0.23693426405566012,"score_spread":0.22174369678455347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962898528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81370693,0.0024323468,0.14218338,0.0010942925,0.000083972234,0.00012356193,0.0023485408,0.0003012391,0.037725672],"genre_scores_gemma":[0.9734563,0.0014351258,0.020977927,0.00016347597,0.00020070987,0.00019951462,0.0014538876,0.000046914745,0.002066061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919957,0.00020825083,0.000041806477,0.00023363168,0.00017557145,0.00014119434],"domain_scores_gemma":[0.99746597,0.0011772695,0.0005456753,0.00027677408,0.00029254975,0.0002418124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048556988,0.0004818874,0.0005568314,0.0018095366,0.0008039672,0.0014690267,0.0007632239,0.00064247183,0.0024864054],"category_scores_gemma":[0.004034585,0.0003992024,0.00039860164,0.0019319262,0.0013325175,0.0027603616,0.0010760394,0.0006825995,0.00015168377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047267662,0.00007280072,0.011362148,0.0006777667,0.0001612852,0.00088579045,0.0015622008,0.07032985,0.015157789,0.8127879,0.009810626,0.07671926],"study_design_scores_gemma":[0.00008677022,0.000120618875,0.014706343,0.00015123947,0.00010481659,0.0018662167,0.000590253,0.20052259,0.0036325282,0.75173914,0.026416175,0.00006330911],"about_ca_topic_score_codex":0.001210563,"about_ca_topic_score_gemma":0.0012635124,"teacher_disagreement_score":0.0024864054,"about_ca_system_score_codex":0.00093089504,"about_ca_system_score_gemma":0.00036797152,"threshold_uncertainty_score":0.008317888},"labels":[],"label_agreement":null},{"id":"W2963163826","doi":"","title":"The minimal size of a graph with given generalized 3-edge-connectivity","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lambda; Combinatorics; Graph; Disjoint sets; Upper and lower bounds; Order (exchange); Integer (computer science); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.017004155107788806,"score_gpt":0.23080822894137812,"score_spread":0.21380407383358932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963163826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472296,0.00038283557,0.029499512,0.0013333277,0.000033817756,0.00005531752,0.0038198205,0.00027864685,0.017367095],"genre_scores_gemma":[0.96260196,0.00038665943,0.029675132,0.00021080146,0.000056989913,0.0001273461,0.0030267548,0.00012167568,0.003792612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963534,0.00007112432,0.000019832049,0.00013161277,0.000059593785,0.000082526036],"domain_scores_gemma":[0.9977847,0.0011897351,0.00028447201,0.00020105694,0.00015624812,0.00038371855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027288447,0.00046016768,0.00048220117,0.0006776107,0.00073774764,0.001404435,0.0010998715,0.00069803244,0.00498322],"category_scores_gemma":[0.0023527415,0.00031583564,0.00043869411,0.0006743268,0.000764794,0.0018465065,0.0008542023,0.0005564929,0.00042894608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027843781,0.00029001132,0.03850545,0.0027542182,0.00037523705,0.0020691603,0.0026294144,0.14150336,0.2124932,0.48474085,0.034978107,0.07687659],"study_design_scores_gemma":[0.00027983257,0.00049793534,0.036414888,0.0002407185,0.00034698524,0.0041441815,0.0018810764,0.29957047,0.053812724,0.5688361,0.033831947,0.00014319681],"about_ca_topic_score_codex":0.0011658586,"about_ca_topic_score_gemma":0.0026712385,"teacher_disagreement_score":0.00498322,"about_ca_system_score_codex":0.00094276643,"about_ca_system_score_gemma":0.0007122138,"threshold_uncertainty_score":0.016670525},"labels":[],"label_agreement":null},{"id":"W2963273116","doi":"","title":"Uncoverings on graphs and network reliability","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Carleton University; University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Disjoint sets; Discrete mathematics; Graph; Spanning tree; Computer science","score_opus":0.01922578554111536,"score_gpt":0.20173289617792547,"score_spread":0.1825071106368101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963273116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13190976,0.0014131994,0.85276514,0.003124845,0.00010827064,0.00012620309,0.00016923809,0.0004628607,0.009920514],"genre_scores_gemma":[0.8560183,0.0015643168,0.13799411,0.00025836026,0.00020548167,0.00032502544,0.00020437356,0.00013535917,0.0032946356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709857,0.0014463193,0.00015386645,0.0003751631,0.0006082467,0.00031793574],"domain_scores_gemma":[0.9792976,0.01187394,0.0022926743,0.004642867,0.001223337,0.0006695957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037536034,0.00062575925,0.0009775395,0.0017020085,0.0012862483,0.0018040068,0.0019472324,0.001131494,0.0017589302],"category_scores_gemma":[0.017187595,0.00059802237,0.00080188795,0.001957585,0.003961365,0.007833006,0.00461517,0.0025668216,0.00037079304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014289719,0.00004132114,0.0010366583,0.0001282565,0.00003488028,0.00013730132,0.0005293791,0.11635006,0.0043762587,0.8393816,0.0022601753,0.03558131],"study_design_scores_gemma":[0.000027750857,0.00008257307,0.0004120755,0.00003099323,0.000026193447,0.00019435702,0.00024821877,0.20279591,0.0030159445,0.7865762,0.006556895,0.000032778735],"about_ca_topic_score_codex":0.0009469466,"about_ca_topic_score_gemma":0.0010317183,"teacher_disagreement_score":0.0037536034,"about_ca_system_score_codex":0.001441971,"about_ca_system_score_gemma":0.0008153256,"threshold_uncertainty_score":0.019851208},"labels":[],"label_agreement":null},{"id":"W2963809247","doi":"10.1002/jgt.22361","title":"Size of the largest induced forest in subcubic graphs of girth at least four and five","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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 Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Girth (graph theory); Graph; Discrete mathematics","score_opus":0.011680613743914096,"score_gpt":0.21672354184265774,"score_spread":0.20504292809874364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963809247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97309136,0.00020106406,0.021110443,0.00012856802,0.000013224103,0.000015129284,0.00022866478,0.00010620491,0.0051053744],"genre_scores_gemma":[0.99463296,0.00007466226,0.0047128303,0.00002649195,0.000009680492,0.000017284949,0.00016620151,0.000016057795,0.0003439036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996294,0.00008175707,0.000020180194,0.000094321855,0.000060290615,0.000114074384],"domain_scores_gemma":[0.99561226,0.0029165251,0.0004967485,0.0002997487,0.0002684863,0.0004063172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034719615,0.00026110566,0.00041882385,0.00064003724,0.00057084643,0.0009088433,0.0006407782,0.00036595704,0.0018246303],"category_scores_gemma":[0.0025401902,0.0002502006,0.0002891363,0.00038053567,0.00068704237,0.001016892,0.00067551027,0.00047213378,0.000121169855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022153088,0.0004639317,0.071080916,0.0009973826,0.00025570323,0.0021815442,0.001858207,0.19285354,0.21125668,0.37175667,0.008718279,0.13636181],"study_design_scores_gemma":[0.00009983878,0.00032894447,0.03255224,0.00011096769,0.000207811,0.0024369024,0.0010783917,0.39187947,0.082988344,0.4818878,0.0063546514,0.000074617645],"about_ca_topic_score_codex":0.000569156,"about_ca_topic_score_gemma":0.0008448726,"teacher_disagreement_score":0.0018246303,"about_ca_system_score_codex":0.00038402324,"about_ca_system_score_gemma":0.00030636048,"threshold_uncertainty_score":0.006103933},"labels":[],"label_agreement":null},{"id":"W2964135469","doi":"10.4169/amer.math.monthly.124.10.895","title":"Decomposition of a Cube into Nearly Equal Smaller Cubes","year":2017,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Interconnection Networks and 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":"World Wildlife Fund Canada","funders":"","keywords":"Cube (algebra); Unit cube; Combinatorics; Mathematics; Decomposition; Unit (ring theory); Integer (computer science); Computer science; Chemistry","score_opus":0.016799143622557612,"score_gpt":0.297962827385587,"score_spread":0.28116368376302936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964135469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11821906,0.001428308,0.83961105,0.00055625,0.00031087908,0.000113167356,0.000603074,0.0003438254,0.038814407],"genre_scores_gemma":[0.55094904,0.0025732531,0.417172,0.0009236884,0.00026203875,0.00037945277,0.001728553,0.00031626073,0.025695674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950683,0.000101866426,0.000035455374,0.00009500067,0.00015352808,0.000107149426],"domain_scores_gemma":[0.99893814,0.00030367795,0.000114362025,0.00027386186,0.00024955007,0.00012041335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005124413,0.00068739767,0.00060711696,0.00065788784,0.0003980089,0.0010759471,0.0006055996,0.00038481812,0.0066407416],"category_scores_gemma":[0.0015052633,0.0003565188,0.00065048784,0.0006669841,0.0007739371,0.0012982269,0.0017463047,0.0012471029,0.0014033146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00104275,0.00014271206,0.0015380761,0.00063708785,0.00012865706,0.0007996418,0.00040731553,0.14938375,0.11821142,0.5716119,0.018724486,0.13737231],"study_design_scores_gemma":[0.00016330373,0.0003321679,0.0015406437,0.00012982055,0.0000887591,0.0010835194,0.00036340056,0.4337489,0.028530829,0.4743115,0.059626304,0.00008077794],"about_ca_topic_score_codex":0.0009818934,"about_ca_topic_score_gemma":0.0010113149,"teacher_disagreement_score":0.0066407416,"about_ca_system_score_codex":0.00050806307,"about_ca_system_score_gemma":0.00044798877,"threshold_uncertainty_score":0.022215486},"labels":[],"label_agreement":null},{"id":"W2964278440","doi":"","title":"Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Combinatorics; Bipartite graph; Hamiltonian path; Mathematics; Fault tolerance; Hamiltonian (control theory); Embedding; Graph; Discrete mathematics; Computer science; Distributed computing","score_opus":0.011708026096431142,"score_gpt":0.22825893696829128,"score_spread":0.21655091087186012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964278440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65754336,0.002161963,0.3274272,0.0005074742,0.00018196918,0.00010012768,0.0003928419,0.00046348982,0.011221578],"genre_scores_gemma":[0.9715764,0.0005586712,0.024087908,0.000095927666,0.00003173433,0.00008757509,0.00038120637,0.000035500212,0.0031450698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995721,0.00009638998,0.000027938018,0.0000736927,0.00011164629,0.0001183123],"domain_scores_gemma":[0.999159,0.00026989044,0.00020462654,0.00012962472,0.00014856772,0.00008834565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030272367,0.0005846848,0.00038313982,0.0005652175,0.00055767753,0.0006397351,0.0006200768,0.0005574243,0.0020761173],"category_scores_gemma":[0.0018593488,0.00028947476,0.00033576667,0.00055897445,0.0005857001,0.0013190253,0.0012848765,0.0004521372,0.00029384563],"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.0014358042,0.00015264688,0.005971208,0.000651334,0.00017609305,0.0011390084,0.0007282583,0.6558291,0.07269573,0.14059551,0.004746867,0.115878455],"study_design_scores_gemma":[0.000095473086,0.00045404886,0.0019714765,0.00007203258,0.000055969707,0.0005191492,0.00041456826,0.8042893,0.03301241,0.15143183,0.0076401015,0.000043553435],"about_ca_topic_score_codex":0.0018308338,"about_ca_topic_score_gemma":0.00128341,"teacher_disagreement_score":0.0020761173,"about_ca_system_score_codex":0.0006538947,"about_ca_system_score_gemma":0.00031815754,"threshold_uncertainty_score":0.006945312},"labels":[],"label_agreement":null},{"id":"W2966984161","doi":"","title":"Surface Areas of Some Interconnection Networks","year":2019,"lang":"en","type":"dissertation","venue":"Brock University Digital Repository (Brock University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brock University","keywords":"Interconnection; Computer science; Computer network; Computer architecture","score_opus":0.008293106441414821,"score_gpt":0.1838241906008444,"score_spread":0.17553108415942958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966984161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5705915,0.001347601,0.36732653,0.000634405,0.00007151607,0.00008372326,0.00049556396,0.00055744994,0.058891747],"genre_scores_gemma":[0.95333356,0.00068100647,0.038845647,0.00008138249,0.00013097175,0.00009908373,0.00044694048,0.00012624558,0.006255244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997124,0.00005851787,0.000015217493,0.00006639999,0.00009717555,0.00005028518],"domain_scores_gemma":[0.9987576,0.00072165794,0.0001628072,0.00009760661,0.00018466215,0.00007571584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023384379,0.00038032242,0.00035480183,0.0013124101,0.0003692547,0.0010204045,0.00050331664,0.00046976082,0.004742327],"category_scores_gemma":[0.002545489,0.00022947432,0.0004466512,0.0010577323,0.0008423506,0.0018485317,0.0006437439,0.0006167655,0.00047363597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013653976,0.000047494108,0.0046082814,0.00024269268,0.00004529936,0.00039197106,0.00062658964,0.16495389,0.02040019,0.7050641,0.0044443663,0.09903859],"study_design_scores_gemma":[0.000017299997,0.000083755716,0.003232565,0.000026080872,0.000018517667,0.00034573695,0.00019433696,0.45987347,0.003794969,0.5225429,0.009853014,0.000017308645],"about_ca_topic_score_codex":0.000608111,"about_ca_topic_score_gemma":0.0004153843,"teacher_disagreement_score":0.004742327,"about_ca_system_score_codex":0.00056074123,"about_ca_system_score_gemma":0.00016121005,"threshold_uncertainty_score":0.01586467},"labels":[],"label_agreement":null},{"id":"W2967594056","doi":"10.1080/17445760.2019.1655742","title":"Diagnosability of interconnection networks: past, present and future","year":2019,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","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":"Brock University","funders":"","keywords":"Interconnection; Computer science; Computer network","score_opus":0.008821345230260635,"score_gpt":0.23970324922236355,"score_spread":0.23088190399210293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967594056","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001514866,0.10443344,0.013020479,0.8005889,0.07084033,0.000012931325,0.000105073945,0.00006452339,0.0094194645],"genre_scores_gemma":[0.12895691,0.2209799,0.0086650215,0.28672716,0.33753753,0.00008968678,0.00013688074,0.0001922408,0.016714692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972306,0.00092385564,0.00022858441,0.0005504811,0.0008946126,0.0001718522],"domain_scores_gemma":[0.97861356,0.01720923,0.00076492457,0.0004132031,0.002708967,0.00029006667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004698994,0.0005360485,0.0007399268,0.0011159994,0.0017431165,0.0031537754,0.002296373,0.008385706,0.002114054],"category_scores_gemma":[0.018071463,0.00029945897,0.0008281541,0.001205336,0.009088739,0.007994153,0.0011727477,0.013536294,0.00049420854],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067122,0.000015534893,0.0003580438,0.0011268492,0.0000462224,0.00048650597,0.0012051404,0.0027799525,0.0010460126,0.62999135,0.30094066,0.06192314],"study_design_scores_gemma":[0.000018873823,0.0000494197,0.0005397354,0.0010100388,0.00002309091,0.0005739572,0.00056719955,0.0030246226,0.00052221183,0.47968915,0.5139224,0.00005940286],"about_ca_topic_score_codex":0.005527996,"about_ca_topic_score_gemma":0.0057828915,"teacher_disagreement_score":0.008385706,"about_ca_system_score_codex":0.004341782,"about_ca_system_score_gemma":0.0030870242,"threshold_uncertainty_score":0.03150195},"labels":[],"label_agreement":null},{"id":"W2972941522","doi":"10.1007/978-3-030-30786-8_25","title":"Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transpose; Control reconfiguration; Hamiltonian path; Hamiltonian (control theory); Computer science; Grid; Hamiltonian path problem; Lattice graph; Graph; Combinatorics; Topology (electrical circuits); Theoretical computer science; Mathematics; Mathematical optimization; Voltage graph; Geometry; Physics; Line graph; Quantum mechanics; Embedded system","score_opus":0.01717598004401504,"score_gpt":0.2314674842187603,"score_spread":0.21429150417474524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972941522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5306302,0.0005556229,0.43326595,0.00035682638,0.0001542103,0.000120730365,0.00024789845,0.0016053796,0.033063177],"genre_scores_gemma":[0.93083656,0.0002044163,0.06251102,0.00015081957,0.000014610487,0.0000661047,0.00015507883,0.00017494327,0.005886381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999001,0.00003051972,0.0000051075126,0.000023674673,0.000014269167,0.000026266798],"domain_scores_gemma":[0.9995844,0.0001583281,0.000057385416,0.000088573615,0.00004032458,0.000071053444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012571395,0.0003021104,0.00039344313,0.0003691412,0.000324902,0.0005520023,0.00090234523,0.00038302166,0.003836179],"category_scores_gemma":[0.000968129,0.0002780471,0.00026548558,0.0004713779,0.00045561025,0.0007136005,0.00091764086,0.00037722092,0.0005933204],"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.0006739162,0.00017809024,0.0014844746,0.0003555735,0.00007095935,0.0006595139,0.00046747277,0.5895341,0.07342916,0.083075605,0.008776504,0.24129461],"study_design_scores_gemma":[0.000085886495,0.0002130387,0.00048888585,0.000036314887,0.000020164513,0.00019673644,0.00023465679,0.89356065,0.010611133,0.08965052,0.0048728045,0.000029201656],"about_ca_topic_score_codex":0.0012918506,"about_ca_topic_score_gemma":0.0018989957,"teacher_disagreement_score":0.003836179,"about_ca_system_score_codex":0.00038298866,"about_ca_system_score_gemma":0.0002186995,"threshold_uncertainty_score":0.012833297},"labels":[],"label_agreement":null},{"id":"W2973166705","doi":"10.1109/tpds.2019.2940190","title":"Achieving Flexible Global Reconfiguration in NoCs Using Reconfigurable Rings","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"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 Alberta","funders":"Pearl River S and T Nova Program of Guangzhou; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control reconfiguration; Computer science; Latency (audio); Embedded system; Overhead (engineering); Interconnection; Computer architecture; Flexibility (engineering); Network packet; Field-programmable gate array; Network on a chip; Distributed computing; Computer network","score_opus":0.022149339639874283,"score_gpt":0.24715347263248572,"score_spread":0.22500413299261143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973166705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4025664,0.0013442662,0.58375823,0.00014153817,0.00008690996,0.00007006907,0.000104558865,0.002701744,0.009226214],"genre_scores_gemma":[0.90837115,0.0002942558,0.089575276,0.00005209669,0.00002311576,0.000053954147,0.0000849597,0.00006574111,0.0014794058],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.00004684949,0.000017146174,0.000054511635,0.000040153514,0.00005830074],"domain_scores_gemma":[0.99967015,0.00007765727,0.00006930073,0.00011581597,0.00003946608,0.000027577053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024760605,0.0004249567,0.00032924776,0.0003825969,0.00034672912,0.00035359262,0.000518097,0.00025175934,0.000712971],"category_scores_gemma":[0.0004126848,0.00018418701,0.00032400127,0.00037367127,0.00034231335,0.00069932186,0.0006075841,0.0002908264,0.0002229937],"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.00033108515,0.00009749029,0.002348443,0.00023016203,0.000108055065,0.0005152195,0.0001694881,0.3546347,0.43419242,0.013542811,0.0020662867,0.19176374],"study_design_scores_gemma":[0.00005115187,0.00054016453,0.0024673324,0.000027821985,0.00008589174,0.0004749954,0.00009911548,0.8431565,0.1358469,0.0070408657,0.010147243,0.00006207803],"about_ca_topic_score_codex":0.0005576674,"about_ca_topic_score_gemma":0.001234565,"teacher_disagreement_score":0.000712971,"about_ca_system_score_codex":0.00024592783,"about_ca_system_score_gemma":0.00022007653,"threshold_uncertainty_score":0.0023850799},"labels":[],"label_agreement":null},{"id":"W2974643598","doi":"10.1109/access.2019.2939154","title":"HPQS: A Fast, High-Capacity, Hybrid Priority Queuing System for High-Speed Networking Devices","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Polytechnique Montréal","keywords":"Computer science; Priority queue; Queueing theory; Queue; Network packet; Scheduling (production processes); Latency (audio); Queue management system; Computer network; Field-programmable gate array; Message queue; Embedded system; Distributed computing; Telecommunications; Engineering","score_opus":0.03090633557616661,"score_gpt":0.2662057199067013,"score_spread":0.23529938433053466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974643598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017785365,0.0007487779,0.9741596,0.0001254501,0.0002300556,0.00017128217,0.00019472015,0.0043394445,0.0022452413],"genre_scores_gemma":[0.4952862,0.0007820188,0.49369884,0.00032344286,0.0002244769,0.00027705773,0.0007093644,0.00033718307,0.008361449],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933785,0.00013298649,0.000058039564,0.000107515945,0.00026973677,0.00009395091],"domain_scores_gemma":[0.9992797,0.00019592968,0.000086328066,0.00010215358,0.00026178136,0.00007409136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010698503,0.00056438387,0.00036551178,0.0005466578,0.00052864465,0.0012189442,0.0020960395,0.0005001969,0.0037215054],"category_scores_gemma":[0.001090081,0.0003323016,0.00038666802,0.00045367563,0.00039342084,0.0011233338,0.00069660693,0.0008646049,0.00095748046],"study_design_candidate":"bench_or_experimental","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.0018045219,0.0003939595,0.0034662038,0.0009311127,0.00032568927,0.00039871968,0.0003818763,0.16492166,0.24667601,0.06498288,0.021134602,0.49458268],"study_design_scores_gemma":[0.00033432603,0.0011675527,0.0015166942,0.00006461229,0.00017108223,0.00032986884,0.00006922103,0.85122883,0.08180647,0.011126234,0.052079223,0.000105956526],"about_ca_topic_score_codex":0.0036601943,"about_ca_topic_score_gemma":0.0043379352,"teacher_disagreement_score":0.0037215054,"about_ca_system_score_codex":0.0010439861,"about_ca_system_score_gemma":0.0018210298,"threshold_uncertainty_score":0.012449682},"labels":[],"label_agreement":null},{"id":"W2977774534","doi":"10.1371/journal.pone.0222759","title":"A low latency and low power indirect topology for on-chip communication","year":2019,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Interconnection Networks and Systems","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":"Western University","funders":"Office of Naval Research; Universiti Malaysia Sabah; Deutsches Zentrum für Luft- und Raumfahrt","keywords":"Interconnectivity; Network topology; Scalability; Latency (audio); Computer science; Router; Topology (electrical circuits); Dissipation; Tree (set theory); Energy consumption; Chip; Computer network; Network on a chip; Distributed computing; Parallel computing; Mathematics; Telecommunications; Engineering; Physics","score_opus":0.030131806715831554,"score_gpt":0.22817643209014785,"score_spread":0.1980446253743163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977774534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2195782,0.0018897671,0.7612764,0.0004383885,0.00013647728,0.00011724687,0.00035376227,0.00082865526,0.015381093],"genre_scores_gemma":[0.8551075,0.0008343056,0.13820562,0.00011010938,0.000045523855,0.00012639788,0.00049134076,0.000060052414,0.0050190585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991477,0.000023982298,0.000005063115,0.0000126983105,0.000031734256,0.000011858204],"domain_scores_gemma":[0.9998518,0.00003706355,0.000021432987,0.000024757694,0.00005156429,0.000013274404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011749874,0.000300949,0.00017841533,0.00037085262,0.0003445474,0.00039854442,0.00057444,0.00028437097,0.0016265761],"category_scores_gemma":[0.00039054616,0.00008083795,0.00019283073,0.0004373146,0.00017451655,0.00062967034,0.0003386277,0.00022241253,0.0002703907],"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.00041797623,0.0001283579,0.0037109107,0.00094767654,0.0001474602,0.0007246204,0.00029576945,0.29084995,0.21954836,0.06073306,0.010727856,0.41176805],"study_design_scores_gemma":[0.00007131176,0.0013128186,0.0029844597,0.000094838695,0.00015415832,0.0018446598,0.00024905684,0.85415304,0.055544917,0.031895988,0.051630493,0.00006422458],"about_ca_topic_score_codex":0.0005060295,"about_ca_topic_score_gemma":0.0016476968,"teacher_disagreement_score":0.0016265761,"about_ca_system_score_codex":0.00024673858,"about_ca_system_score_gemma":0.00028151908,"threshold_uncertainty_score":0.005441427},"labels":[],"label_agreement":null},{"id":"W2978074712","doi":"","title":"Impact of communication layer performance on shared virtual memory protocols for clusters of SMPs","year":2000,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Layer (electronics); Computer architecture; Distributed computing; Materials science; Nanotechnology","score_opus":0.04028698534396487,"score_gpt":0.3714386837265041,"score_spread":0.3311516983825393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978074712","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939756,0.000589761,0.0017686479,0.00039911413,0.00010459028,0.00001672583,0.00010819165,0.00039146678,0.0026460106],"genre_scores_gemma":[0.9984359,0.00011704699,0.0006936737,0.000025022266,0.000019758838,0.000005482893,0.00008715108,0.00005429348,0.0005616573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976628,0.00074035313,0.00017621089,0.0002233217,0.0004950476,0.00070225634],"domain_scores_gemma":[0.97904474,0.015153894,0.0009861867,0.0016245673,0.0023917882,0.0007988607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037004594,0.0006038743,0.0005102781,0.00066612277,0.0010761957,0.0020523514,0.0009842888,0.0009770758,0.003343093],"category_scores_gemma":[0.01992194,0.00046390275,0.00025480788,0.00083792274,0.0008589648,0.0025453786,0.0010608687,0.0009783868,0.00040152852],"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.020123614,0.0013494676,0.028519567,0.0010539062,0.00064922764,0.00073840766,0.0013447307,0.6338417,0.17117676,0.009531687,0.012866235,0.118804656],"study_design_scores_gemma":[0.00039610293,0.004447249,0.021930415,0.00009852549,0.0006828662,0.00025492228,0.0016399154,0.7797957,0.18487948,0.0030005537,0.0027556145,0.00011861751],"about_ca_topic_score_codex":0.0048557855,"about_ca_topic_score_gemma":0.0046583167,"teacher_disagreement_score":0.0048557855,"about_ca_system_score_codex":0.0019240094,"about_ca_system_score_gemma":0.0011363546,"threshold_uncertainty_score":0.019570172},"labels":[],"label_agreement":null},{"id":"W2979350050","doi":"10.1109/ccece.2019.8861540","title":"A Low-Latency Reconfigurable Multistage Interconnection Network","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Interconnection; Field-programmable gate array; Latency (audio); Correctness; Computer architecture; Decoding methods; Low latency (capital markets); Embedded system; Multiprocessing; Throughput; Parallel computing; Computer network; Wireless; Telecommunications","score_opus":0.008085820811950481,"score_gpt":0.2069680808687704,"score_spread":0.19888226005681992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979350050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18235615,0.0014160653,0.7880344,0.00034510143,0.00022025345,0.00010967734,0.00031431433,0.0032341753,0.023969809],"genre_scores_gemma":[0.81810945,0.00047778522,0.16984195,0.00011702926,0.000042823343,0.0000618114,0.00031934347,0.000079494974,0.010950374],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998908,0.000017047094,0.000007576117,0.00002587107,0.000042684256,0.000015979937],"domain_scores_gemma":[0.9999248,0.000013637175,0.000014828897,0.000017315011,0.000022319931,0.000007157464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008601066,0.00019948398,0.00012192646,0.0002262902,0.00026905377,0.00031784043,0.00066871,0.0002455951,0.0020054386],"category_scores_gemma":[0.00015362172,0.00011385911,0.00017727174,0.00025542933,0.00012428602,0.00040220522,0.0002444131,0.00020692142,0.00042910353],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00031993355,0.00008169068,0.0014189893,0.00037568793,0.000057503108,0.0006135929,0.000089672525,0.06823639,0.7123593,0.015609587,0.00413249,0.19670525],"study_design_scores_gemma":[0.00007278757,0.0008903091,0.0035962053,0.00005142814,0.00012611574,0.001356617,0.000045449455,0.6734557,0.2535514,0.005742945,0.06102577,0.00008533207],"about_ca_topic_score_codex":0.0006870165,"about_ca_topic_score_gemma":0.001826209,"teacher_disagreement_score":0.0020054386,"about_ca_system_score_codex":0.00032469205,"about_ca_system_score_gemma":0.0002674173,"threshold_uncertainty_score":0.006708801},"labels":[],"label_agreement":null},{"id":"W2981086990","doi":"10.1109/jiot.2019.2947257","title":"ahSpMV: An Autotuning Hybrid Computing Scheme for SpMV on the Sunway Architecture","year":2019,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":19,"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 Waterloo","funders":"Hunan Provincial Innovation Foundation for Postgraduate; National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Supercomputer; Parallel computing; Scalability; Architecture; Scheme (mathematics); Operating system; Mathematics","score_opus":0.020624689410233453,"score_gpt":0.25140890559051604,"score_spread":0.23078421618028258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981086990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37452784,0.00041357183,0.60207164,0.0003299056,0.00015726681,0.00014429454,0.0002248416,0.0076860045,0.0144445915],"genre_scores_gemma":[0.855496,0.00008130783,0.13990194,0.00011517138,0.000025242556,0.0001396446,0.0003599698,0.00017232086,0.0037082646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981564,0.000027777563,0.00001153507,0.00003795121,0.000070171125,0.000036866524],"domain_scores_gemma":[0.99979275,0.000030298952,0.000020064655,0.000060456743,0.00007014523,0.000026248455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017576988,0.0003859968,0.00025895398,0.00034938013,0.0005001084,0.00034915953,0.0010396244,0.00022528399,0.0029751812],"category_scores_gemma":[0.00051554275,0.00014260308,0.00028225625,0.00045007566,0.00028871544,0.00083676266,0.0007863565,0.0003605663,0.00037663893],"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.0012025167,0.0002242731,0.0068813753,0.00024445058,0.00012332138,0.0004214242,0.00043556278,0.2894606,0.17852569,0.024077104,0.022130491,0.47627324],"study_design_scores_gemma":[0.000061238585,0.00025946018,0.001022385,0.000008183979,0.000016749045,0.0000787082,0.00006343488,0.9558736,0.031130116,0.0037324566,0.007727472,0.000026180767],"about_ca_topic_score_codex":0.0029069313,"about_ca_topic_score_gemma":0.004547318,"teacher_disagreement_score":0.0029751812,"about_ca_system_score_codex":0.00051301287,"about_ca_system_score_gemma":0.00053741335,"threshold_uncertainty_score":0.009953022},"labels":[],"label_agreement":null},{"id":"W2995422874","doi":"10.1142/s0219265919500063","title":"Approximation Algorithm for the Broadcast Time in <i>k</i>-Path Graph","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Time complexity; Graph; Path (computing); Broadcasting (networking); Tree (set theory); Algorithm; Approximation algorithm; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Computer network","score_opus":0.007086389217122757,"score_gpt":0.21600671412726893,"score_spread":0.20892032491014617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995422874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11714583,0.0014868021,0.85382444,0.002447719,0.0002490717,0.00040312056,0.0013919807,0.00437485,0.018676203],"genre_scores_gemma":[0.5028754,0.00067113823,0.48390728,0.00044398042,0.00016596461,0.0005030574,0.003028323,0.0006777095,0.0077271448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868315,0.00023185775,0.000066422785,0.00033490968,0.00025894132,0.0004246692],"domain_scores_gemma":[0.9974395,0.001539518,0.00023528705,0.00037895428,0.00022431,0.0001824318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981813,0.0014970659,0.0014740771,0.0010883088,0.0010794475,0.0020547376,0.0027618324,0.0017466107,0.007892851],"category_scores_gemma":[0.005159565,0.000537101,0.0011103451,0.0021212464,0.0009311878,0.003349341,0.0014032678,0.0023399955,0.0016911742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019716232,0.0009137096,0.0036038312,0.0009274821,0.00024026207,0.00035747973,0.00079356646,0.6383487,0.01397823,0.055573925,0.033357415,0.24993378],"study_design_scores_gemma":[0.00027340942,0.00015800787,0.00049824873,0.000038361763,0.000066763176,0.0002706223,0.00014512856,0.9501097,0.0027498128,0.042175617,0.0034876426,0.000026628837],"about_ca_topic_score_codex":0.008433831,"about_ca_topic_score_gemma":0.008853127,"teacher_disagreement_score":0.008433831,"about_ca_system_score_codex":0.0035885947,"about_ca_system_score_gemma":0.0036279198,"threshold_uncertainty_score":0.026404202},"labels":[],"label_agreement":null},{"id":"W2996775194","doi":"10.1109/icds47004.2019.8942349","title":"Impact of communication volume on the maximum speedup in Parallel computing based on graph partitioning","year":2019,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Parallel computing; Heuristics; Speedup; Load balancing (electrical power); Partition (number theory); Graph; Theoretical computer science; Mathematics","score_opus":0.020113502779196334,"score_gpt":0.26033207493793364,"score_spread":0.24021857215873732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996775194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616422,0.0015398867,0.022416372,0.0005264986,0.00008887952,0.000044405253,0.00018796352,0.00091952895,0.012634358],"genre_scores_gemma":[0.9920237,0.000344472,0.006853189,0.000022371536,0.000016868958,0.000018155039,0.00012950152,0.00013206428,0.00045971887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.0004571833,0.000030920943,0.00012997015,0.00028775886,0.00023472398],"domain_scores_gemma":[0.99294657,0.005755355,0.00026735305,0.00045720203,0.00042834922,0.00014508229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011495086,0.0007209143,0.00047021487,0.00075824576,0.00056130695,0.0008373237,0.00055026327,0.00054083497,0.0013830239],"category_scores_gemma":[0.008214408,0.00026893528,0.00032169712,0.0010040508,0.0007463778,0.001494029,0.0004615126,0.00045972902,0.00024068922],"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.0014869663,0.00023832654,0.0066481587,0.00035249832,0.00010558654,0.00027036184,0.00021535401,0.8833984,0.050518513,0.00892544,0.0017534501,0.046086874],"study_design_scores_gemma":[0.000090979025,0.0012064107,0.0074049067,0.000041033356,0.00010866128,0.00023958401,0.00022352692,0.8648244,0.114940874,0.008575158,0.0023065421,0.000037911308],"about_ca_topic_score_codex":0.0015199424,"about_ca_topic_score_gemma":0.001743348,"teacher_disagreement_score":0.0015199424,"about_ca_system_score_codex":0.00051590207,"about_ca_system_score_gemma":0.0006442343,"threshold_uncertainty_score":0.0060792565},"labels":[],"label_agreement":null},{"id":"W2997008791","doi":"10.48550/arxiv.1312.5764","title":"Heuristics for Routing and Spiral Run-time Task Mapping in NoC-based\\n Heterogeneous MPSOCs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","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":"Emera (Canada)","funders":"","keywords":"Heuristics; Computer science; MPSoC; Dijkstra's algorithm; Heuristic; Routing (electronic design automation); Task (project management); Overhead (engineering); Network on a chip; Distributed computing; Parallel computing; Context (archaeology); Embedded system; Multiprocessing; Shortest path problem; Graph; Theoretical computer science; Engineering; Artificial intelligence","score_opus":0.05749991163793157,"score_gpt":0.1792497328622055,"score_spread":0.12174982122427393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997008791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072078936,0.00052659167,0.92248863,0.00010090783,0.000040572482,0.00013822633,0.00006233167,0.00076251145,0.0038012136],"genre_scores_gemma":[0.47194245,0.00034063996,0.5249159,0.000055886958,0.000012164213,0.00018576029,0.00020450838,0.00017468183,0.0021680754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971706,0.000086374916,0.000019170597,0.000040797702,0.000074009855,0.00006250927],"domain_scores_gemma":[0.9994035,0.000313383,0.000077359546,0.00006901965,0.0001004569,0.00003637593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004987433,0.00061901007,0.00035668592,0.0006744318,0.00038547555,0.00047454995,0.000754106,0.00036546128,0.0011239959],"category_scores_gemma":[0.0016648457,0.00036020472,0.00036745414,0.0005388999,0.00039450923,0.0005720281,0.0004836093,0.00030368686,0.00018919048],"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.00010106935,0.000056536788,0.00086849614,0.00012331811,0.000032942913,0.00008531697,0.00012391701,0.8863732,0.01056854,0.008105015,0.0011515694,0.0924101],"study_design_scores_gemma":[0.000023985534,0.00007606437,0.0003028428,0.000014739551,0.000017297762,0.00006148846,0.000077921526,0.9868541,0.005517421,0.004418976,0.0026218558,0.0000133648655],"about_ca_topic_score_codex":0.0035206436,"about_ca_topic_score_gemma":0.0053235427,"teacher_disagreement_score":0.0035206436,"about_ca_system_score_codex":0.0007814223,"about_ca_system_score_gemma":0.00126382,"threshold_uncertainty_score":0.0070002675},"labels":[],"label_agreement":null},{"id":"W2998610137","doi":"10.1145/3140659.3080251","title":"There and Back Again","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Network topology; Dram; Latency (audio); Scalability; Interconnection; Queueing theory; Interleaved memory; Registered memory; Efficient energy use; Distributed computing; Computer network; Parallel computing; Embedded system; Memory management; Semiconductor memory; Computer hardware; Operating system; Electrical engineering; Engineering; Telecommunications","score_opus":0.020889224603673175,"score_gpt":0.2564817175323137,"score_spread":0.2355924929286405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998610137","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00562091,0.004232406,0.004266879,0.07599614,0.025331756,0.00012051111,0.001517365,0.0017149168,0.8811992],"genre_scores_gemma":[0.014695669,0.0013842896,0.0019325677,0.01798769,0.001211144,0.00004014125,0.0006315338,0.0005546391,0.9615623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902797,0.00014600287,0.000038586026,0.00022348549,0.00030999465,0.0002539366],"domain_scores_gemma":[0.9986908,0.00009512937,0.00005915985,0.00020494653,0.00058187783,0.00036805458],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082434464,0.00093450706,0.00062411476,0.0011001329,0.006480878,0.009838901,0.001409957,0.0034524652,0.3821463],"category_scores_gemma":[0.0033676,0.0003354857,0.0007161505,0.0010518853,0.002350191,0.0073066056,0.005291155,0.005856956,0.2561211],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00008308864,0.00007143029,0.0010438854,0.00012427903,0.000013633151,0.00039761476,0.0024524608,0.000061010753,0.000791903,0.053807218,0.8334985,0.10765504],"study_design_scores_gemma":[0.0000030070803,0.0000076079536,0.00021615856,0.0000559747,0.0000024193237,0.0000782428,0.0010206746,0.000017552637,0.00009327359,0.0020686095,0.99642974,0.0000067130095],"about_ca_topic_score_codex":0.010087905,"about_ca_topic_score_gemma":0.017026393,"teacher_disagreement_score":0.3821463,"about_ca_system_score_codex":0.0022846577,"about_ca_system_score_gemma":0.0025945185,"threshold_uncertainty_score":0.8812933},"labels":[],"label_agreement":null},{"id":"W3000054795","doi":"10.37236/1742","title":"A Note on the Edge-Connectivity of Cages","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"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":"Combinatorics; Mathematics; Graph; Cage; Discrete mathematics","score_opus":0.010755351900277177,"score_gpt":0.22938730937232962,"score_spread":0.21863195747205244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000054795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36621055,0.012150386,0.3284263,0.009992563,0.0015947908,0.00015189429,0.0013343295,0.0009311661,0.27920803],"genre_scores_gemma":[0.8860771,0.010226276,0.08299099,0.0021412699,0.0007345272,0.00022929099,0.001013579,0.0003221044,0.016264936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994628,0.0001307801,0.000035448476,0.0001369414,0.00013177717,0.00010221352],"domain_scores_gemma":[0.9976433,0.0015280287,0.0001624002,0.00024999407,0.00022680918,0.00018945936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045695773,0.00051556097,0.00057008665,0.00092712924,0.0017422271,0.0013867109,0.0011156381,0.0009316915,0.0073881233],"category_scores_gemma":[0.0026088208,0.0003894776,0.0006186792,0.0011570024,0.002165997,0.004028066,0.0031359056,0.0019051533,0.0009584329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016296539,0.000048899543,0.0030467478,0.00032726306,0.000049807444,0.0010036487,0.00072719954,0.007594396,0.011044581,0.92813814,0.015316411,0.03253989],"study_design_scores_gemma":[0.000041932442,0.00026718486,0.0047797854,0.0001587938,0.00011313319,0.0019167329,0.00071701704,0.019746121,0.011329602,0.872465,0.0883823,0.00008247028],"about_ca_topic_score_codex":0.0012521168,"about_ca_topic_score_gemma":0.0011711306,"teacher_disagreement_score":0.0073881233,"about_ca_system_score_codex":0.0003482553,"about_ca_system_score_gemma":0.00023700873,"threshold_uncertainty_score":0.024715722},"labels":[],"label_agreement":null},{"id":"W3003598270","doi":"","title":"Rational Interface Design for High-Performance All-Solid-State Lithium Batteries","year":2020,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Natural Sciences and Engineering Research Council of Canada; Brookhaven National Laboratory; Mitacs; China Automotive Battery Research Institute; U.S. Department of Energy","keywords":"Interface (matter); Lithium (medication); State (computer science); Computer science; Operating system; Programming language; Psychology","score_opus":0.11650637067652153,"score_gpt":0.30344152083800113,"score_spread":0.1869351501614796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003598270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80782807,0.0050898874,0.16557376,0.00036867525,0.00023194475,0.0005246907,0.00073171814,0.0014380428,0.018213175],"genre_scores_gemma":[0.9201638,0.0028998158,0.0718832,0.000096891396,0.00002325828,0.0003821888,0.0006122966,0.00015113964,0.0037875015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998697,0.000010236934,0.0000140195325,0.000018597499,0.0000606174,0.000026703736],"domain_scores_gemma":[0.9999554,0.0000062122836,0.0000086865475,0.0000022848526,0.000019690284,0.000007736327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018818317,0.00059607334,0.00044056593,0.00032951284,0.0002183759,0.00080170535,0.0005201297,0.0004278082,0.0012630424],"category_scores_gemma":[0.00022577017,0.0003111149,0.0002863868,0.00029582396,0.0001376432,0.0005871374,0.0003927381,0.0004394354,0.00094479905],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0001629667,0.0001131437,0.00046511623,0.00049465493,0.000023768172,0.00017889467,0.000077180266,0.009046016,0.97011113,0.0037211888,0.000592265,0.015013571],"study_design_scores_gemma":[0.00010844167,0.0004270629,0.0005365261,0.00002966978,0.0000373434,0.00011875124,0.00008835192,0.07904845,0.9025921,0.00079116813,0.016188364,0.000033760996],"about_ca_topic_score_codex":0.00036140604,"about_ca_topic_score_gemma":0.0010636856,"teacher_disagreement_score":0.0012630424,"about_ca_system_score_codex":0.00046673126,"about_ca_system_score_gemma":0.00035018596,"threshold_uncertainty_score":0.0042253137},"labels":[],"label_agreement":null},{"id":"W3004351771","doi":"10.1145/2892641","title":"Fine-Grained Interconnect Synthesis","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; Interconnection; Computer architecture; Latency (audio); Embedded system; Field-programmable gate array; Task (project management); Arbiter; Key (lock); Verilog; Process (computing); High-level synthesis; Computer hardware; Operating system; Computer network; Telecommunications","score_opus":0.017385105100770487,"score_gpt":0.22412332494544118,"score_spread":0.2067382198446707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004351771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06233884,0.00041633524,0.9021073,0.0002074592,0.00015807307,0.00016234769,0.00052196434,0.007284827,0.02680282],"genre_scores_gemma":[0.4489516,0.00026772503,0.5387196,0.00019906502,0.000036507907,0.00019397416,0.00075275137,0.00076551817,0.010113324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969006,0.00003343876,0.000021870192,0.00006036153,0.00013509765,0.00005912994],"domain_scores_gemma":[0.9996026,0.00012375737,0.000044766417,0.00011227423,0.000101609934,0.000014884056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028726377,0.00047375154,0.0003138767,0.00046459062,0.00030248074,0.0006569017,0.0006215868,0.00042842218,0.006028037],"category_scores_gemma":[0.00081582373,0.0002823098,0.00044490828,0.0003431225,0.00038732155,0.00070641737,0.00045415593,0.000536328,0.0010467811],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012917025,0.00009333822,0.0010790663,0.0005907855,0.000040865092,0.00036130048,0.00018653816,0.46209833,0.23054087,0.06335726,0.009736491,0.231786],"study_design_scores_gemma":[0.00006104559,0.00029066164,0.0005885337,0.000060727856,0.00003427268,0.00025858823,0.000057725363,0.8051407,0.12352625,0.02592916,0.044015825,0.000036358946],"about_ca_topic_score_codex":0.0012739688,"about_ca_topic_score_gemma":0.0028138233,"teacher_disagreement_score":0.006028037,"about_ca_system_score_codex":0.00071438163,"about_ca_system_score_gemma":0.0009851139,"threshold_uncertainty_score":0.020165741},"labels":[],"label_agreement":null},{"id":"W3007860969","doi":"10.1109/iccike47802.2019.9004367","title":"A Novel Approach for Scheduling and Mapping of Real-Time Parallel Matrices Multiplication (SMPMM)","year":2019,"lang":"en","type":"article","venue":"","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":"Université de Moncton","funders":"","keywords":"Computer science; Parallel computing; Matrix multiplication; Multiplication (music); Scheduling (production processes); Parallel algorithm; Task (project management); Arithmetic; Algorithm; Mathematics; Combinatorics","score_opus":0.02622696308451042,"score_gpt":0.24403017266133284,"score_spread":0.21780320957682242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007860969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038330385,0.00022738575,0.9923145,0.00007027951,0.00015235473,0.00005582029,0.00002720679,0.0006527662,0.0026667186],"genre_scores_gemma":[0.09553756,0.00033156972,0.89835703,0.00010757493,0.00014743922,0.00018828725,0.00015498043,0.00017086034,0.0050047413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943155,0.00009755899,0.000039043676,0.00014892961,0.00022063054,0.00006226394],"domain_scores_gemma":[0.999699,0.000050450417,0.000031258678,0.00009189241,0.00009880859,0.000028637918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033721808,0.0006942337,0.0005716232,0.00058344746,0.00075019244,0.00062629924,0.0013734906,0.0005007512,0.002963884],"category_scores_gemma":[0.00076319557,0.0002975528,0.0005894082,0.0008518233,0.00038082874,0.0009942576,0.0010319769,0.00086919265,0.0012617067],"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.0001927359,0.00026593034,0.0008618963,0.00041089155,0.00008979658,0.00034432526,0.000318101,0.14082785,0.062333353,0.08896478,0.013346977,0.69204324],"study_design_scores_gemma":[0.000049052334,0.00025866262,0.00033847368,0.000025045143,0.000035636847,0.00046075898,0.0000923723,0.894803,0.01873158,0.03314152,0.052030668,0.0000331874],"about_ca_topic_score_codex":0.0012725712,"about_ca_topic_score_gemma":0.0019951558,"teacher_disagreement_score":0.002963884,"about_ca_system_score_codex":0.00050801627,"about_ca_system_score_gemma":0.0012516266,"threshold_uncertainty_score":0.009915113},"labels":[],"label_agreement":null},{"id":"W3008972875","doi":"10.1145/3373087.3375371","title":"Unleashing the Power of FPGAs as Programmable Switches","year":2020,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Computer science; Flexibility (engineering); Architecture; Computer architecture; Limit (mathematics); Network packet; Embedded system; Computer network","score_opus":0.022350185732008622,"score_gpt":0.22891232271398063,"score_spread":0.206562136981972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008972875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44871834,0.019239387,0.41627985,0.0034691973,0.00096625695,0.00013060917,0.000214503,0.0037196558,0.10726223],"genre_scores_gemma":[0.90019214,0.0062690615,0.082362875,0.00041395958,0.0002484147,0.000043309814,0.00010945764,0.00016415311,0.010196603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995604,0.00012292186,0.000018308083,0.00005047383,0.0001746449,0.00007313929],"domain_scores_gemma":[0.99918526,0.00042070853,0.0000590362,0.00018223109,0.00011858161,0.000034089513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006291991,0.00044598768,0.00028476137,0.00044787285,0.00037038868,0.0014802163,0.0006655266,0.0004588112,0.0039941007],"category_scores_gemma":[0.0014796737,0.00025440613,0.00024738285,0.00049764925,0.00075525406,0.0022693283,0.000389233,0.00093751744,0.0007603387],"study_design_candidate":"bench_or_experimental","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.0013552298,0.0001096343,0.006315361,0.000782407,0.00011068211,0.0006099383,0.00034484494,0.13769595,0.09285187,0.37332258,0.008107302,0.37839428],"study_design_scores_gemma":[0.00021907252,0.0020955873,0.005689985,0.00047845868,0.00023816206,0.0012797436,0.00040319512,0.57524365,0.1331679,0.10306708,0.17800711,0.00011002534],"about_ca_topic_score_codex":0.0015876694,"about_ca_topic_score_gemma":0.0018912886,"teacher_disagreement_score":0.0039941007,"about_ca_system_score_codex":0.0006027751,"about_ca_system_score_gemma":0.00045357164,"threshold_uncertainty_score":0.013361633},"labels":[],"label_agreement":null},{"id":"W3011227702","doi":"10.1016/j.dam.2020.03.013","title":"Hamiltonian cycles in covering graphs of trees","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Indifference graph; Cartesian product; Pathwidth; Chordal graph; Discrete mathematics; Graph product; Cograph; Modular decomposition; 1-planar graph; Vertex-transitive graph; Graph; Line graph; Voltage graph","score_opus":0.020596625041591966,"score_gpt":0.2312055570515828,"score_spread":0.21060893200999084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011227702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90715986,0.00027194124,0.08376743,0.0002093486,0.00001671965,0.0000746323,0.0002041709,0.00013910054,0.00815669],"genre_scores_gemma":[0.9780462,0.00019990971,0.019205026,0.00005546313,0.000015563024,0.000051153635,0.0003581483,0.000030298655,0.0020384316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968326,0.00010105838,0.000019158782,0.000074595984,0.000060172082,0.00006168208],"domain_scores_gemma":[0.9987394,0.0006967225,0.00025319375,0.00010590278,0.000107400134,0.00009736497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002069086,0.00021640163,0.00031555814,0.0005465413,0.0005564385,0.00084059895,0.00032430227,0.00043385438,0.002064579],"category_scores_gemma":[0.0022938945,0.0003135172,0.00032280068,0.0006728163,0.0007693354,0.0009757027,0.00053811155,0.000280277,0.00017489669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036230544,0.00009025823,0.009832765,0.00033692413,0.000091776164,0.0018621541,0.0020062244,0.141097,0.03907956,0.71518457,0.0036095565,0.08644688],"study_design_scores_gemma":[0.000063467916,0.000113171205,0.0036005476,0.000042907286,0.000044387598,0.000857596,0.00059669494,0.22569919,0.00928025,0.75202024,0.007651346,0.000030349547],"about_ca_topic_score_codex":0.0021431064,"about_ca_topic_score_gemma":0.001870392,"teacher_disagreement_score":0.0021431064,"about_ca_system_score_codex":0.0005384024,"about_ca_system_score_gemma":0.0003694364,"threshold_uncertainty_score":0.006906748},"labels":[],"label_agreement":null},{"id":"W3014397626","doi":"10.3390/fi12040064","title":"Revisiting the High-Performance Reconfigurable Computing for Future Datacenters","year":2020,"lang":"en","type":"article","venue":"Future Internet","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Computer science; Virtualization; Scalability; Field-programmable gate array; Embedded system; Architecture; Computer architecture; Scheduling (production processes); Overhead (engineering); Cloud computing; Distributed computing; Operating system","score_opus":0.017997548677950552,"score_gpt":0.22431951182378998,"score_spread":0.20632196314583942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014397626","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07952662,0.40493622,0.29234555,0.06091902,0.0055964226,0.00021309432,0.0004040512,0.0010275011,0.15503158],"genre_scores_gemma":[0.5620919,0.28558868,0.11711125,0.0076207914,0.0043726354,0.00017156039,0.00056153,0.00035388852,0.022127634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856275,0.00036771252,0.000078680925,0.00020065914,0.00060365873,0.00018651852],"domain_scores_gemma":[0.9986192,0.00047753143,0.00009374601,0.00019299967,0.00051570835,0.00010085882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018067859,0.00041069445,0.00029883953,0.0012115776,0.00065288774,0.004193171,0.0012299881,0.00089190487,0.0019782672],"category_scores_gemma":[0.00294545,0.00026595578,0.00043386736,0.0018884337,0.0009014755,0.0066747363,0.00083142635,0.0018910231,0.0007240723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072680006,0.00007635986,0.002769361,0.0016831297,0.00003749733,0.00021493454,0.0004997442,0.011983141,0.005356426,0.5283748,0.022873772,0.42605823],"study_design_scores_gemma":[0.000015254631,0.00017959208,0.0057861377,0.0020538138,0.00006042686,0.00072779064,0.0016660312,0.060187113,0.0056877146,0.22929476,0.69426984,0.0000715695],"about_ca_topic_score_codex":0.002296821,"about_ca_topic_score_gemma":0.002824339,"teacher_disagreement_score":0.004193171,"about_ca_system_score_codex":0.0016070082,"about_ca_system_score_gemma":0.0022419537,"threshold_uncertainty_score":0.011659682},"labels":[],"label_agreement":null},{"id":"W3015099477","doi":"10.1145/3375899","title":"HopliteBuf","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Deflection routing; Overlay; Parallel computing; Network packet; Topology (electrical circuits); Network on a chip; Latency (audio); Thread (computing); Field-programmable gate array; Offset (computer science); Computer hardware; Embedded system; Computer network; Operating system","score_opus":0.025130432624858826,"score_gpt":0.22637053213379452,"score_spread":0.20124009950893568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015099477","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0356985,0.008532816,0.15413299,0.0032967427,0.0021562045,0.0006044541,0.0066512213,0.052838963,0.7360881],"genre_scores_gemma":[0.27005333,0.0057319775,0.12345644,0.0024218508,0.00048699454,0.0007475647,0.01801109,0.0076335636,0.5714572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928063,0.000059293892,0.0000266403,0.00012525897,0.00035428276,0.00015385929],"domain_scores_gemma":[0.9992055,0.00013985836,0.000053434967,0.0001373369,0.00031597685,0.00014779528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262197,0.00086697214,0.0004580956,0.0009984828,0.0009231234,0.0016636605,0.0013416052,0.0010268996,0.12951127],"category_scores_gemma":[0.0015431297,0.00043282847,0.00034401965,0.0006721561,0.00043785127,0.0024566934,0.0016460841,0.0010962512,0.033635996],"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.0009247281,0.00019345745,0.002235084,0.0007967444,0.00004752907,0.000705404,0.0002793529,0.0060071493,0.020225001,0.063179635,0.36676162,0.5386444],"study_design_scores_gemma":[0.0001357854,0.00029294897,0.00082094094,0.00014446066,0.000027830058,0.0008200333,0.000087196524,0.015654478,0.018851828,0.009986569,0.95310926,0.00006879785],"about_ca_topic_score_codex":0.002189295,"about_ca_topic_score_gemma":0.002782061,"teacher_disagreement_score":0.12951127,"about_ca_system_score_codex":0.0010613196,"about_ca_system_score_gemma":0.0013779472,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3017153815","doi":"10.1109/hpca47549.2020.00044","title":"DRAIN: Deadlock Removal for Arbitrary Irregular Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":32,"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":"Deadlock; Correctness; Computer science; Deadlock prevention algorithms; Distributed computing; Network packet; Computer network; Algorithm","score_opus":0.02663691732179952,"score_gpt":0.22306762767862753,"score_spread":0.19643071035682802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017153815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13870122,0.001974079,0.82601,0.0005415052,0.0004001809,0.00034884532,0.00043713546,0.018835464,0.012751589],"genre_scores_gemma":[0.7730137,0.00067014806,0.21550773,0.00044146902,0.000068057314,0.00031866672,0.0007173319,0.001220276,0.008042624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.00012845293,0.000044073997,0.00006975385,0.00020587319,0.0001012824],"domain_scores_gemma":[0.99833184,0.0006682734,0.00012039652,0.0005402651,0.00022372883,0.00011544835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010549492,0.0005367502,0.0004976459,0.0007142802,0.00068746053,0.00095746404,0.001524496,0.00046979394,0.0026453792],"category_scores_gemma":[0.0031891994,0.00025266685,0.00044116584,0.0003400299,0.0010284161,0.0018244627,0.0019965465,0.0007022641,0.00044403187],"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.0016765699,0.000441492,0.007686042,0.0017881783,0.0002066987,0.0005098512,0.00073675776,0.18413651,0.12753935,0.065516025,0.029293524,0.5804691],"study_design_scores_gemma":[0.00048201144,0.0007766542,0.001515984,0.00016246701,0.00017269702,0.0008254388,0.0002915754,0.7189952,0.17147489,0.04848512,0.056708507,0.00010939041],"about_ca_topic_score_codex":0.0008936389,"about_ca_topic_score_gemma":0.0016074429,"teacher_disagreement_score":0.0026453792,"about_ca_system_score_codex":0.00061006617,"about_ca_system_score_gemma":0.0012181601,"threshold_uncertainty_score":0.00884968},"labels":[],"label_agreement":null},{"id":"W3017598233","doi":"10.1049/iet-cds.2019.0465","title":"Hybrid bidirectional transceiver for multipoint‐to‐multipoint signalling across on‐chip global interconnects","year":2020,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Interconnection Networks and 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 Toronto","funders":"Indian Institute of Technology Kharagpur","keywords":"Transceiver; Chip; Signalling; Electronic engineering; Computer science; Embedded system; Engineering; Telecommunications; CMOS; Cell biology; Biology","score_opus":0.04406635870964428,"score_gpt":0.2808772769216909,"score_spread":0.2368109182120466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017598233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30579126,0.0011245926,0.6663805,0.00020647548,0.0001576738,0.00010177254,0.00015232274,0.0015869328,0.024498513],"genre_scores_gemma":[0.8859114,0.0003829124,0.098477826,0.00012150615,0.000048483966,0.00009024508,0.00018646166,0.00006820312,0.014712956],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988055,0.000020770238,0.0000055981827,0.000016797392,0.00005325859,0.000023036691],"domain_scores_gemma":[0.9998518,0.000023273722,0.000023947605,0.000029577155,0.0000610887,0.000010245307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017688119,0.0003033503,0.00015770791,0.0004184088,0.0002558905,0.00054561533,0.0005843546,0.00039073572,0.0023914657],"category_scores_gemma":[0.00017042433,0.00012961477,0.00018225901,0.00025006512,0.00012806557,0.00062323565,0.00046369602,0.00031052285,0.0007469697],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00026390064,0.00015576222,0.0020377848,0.00045085372,0.00013811524,0.00034862058,0.0002478044,0.026880221,0.72029257,0.027243393,0.0043124254,0.21762855],"study_design_scores_gemma":[0.000098525,0.0027750172,0.0036886039,0.00011213965,0.00025386387,0.0011563464,0.00027624352,0.45157355,0.4516977,0.007846166,0.0804013,0.00012059315],"about_ca_topic_score_codex":0.0002582503,"about_ca_topic_score_gemma":0.0011897337,"teacher_disagreement_score":0.0023914657,"about_ca_system_score_codex":0.00021173248,"about_ca_system_score_gemma":0.00021936905,"threshold_uncertainty_score":0.008000195},"labels":[],"label_agreement":null},{"id":"W3021987857","doi":"10.1080/23799927.2020.1764626","title":"The <i>g</i> -extra diagnosability of the generalized exchanged hypercube","year":2020,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","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":"Brock University","funders":"","keywords":"Hypercube; Vertex (graph theory); Mathematics; Combinatorics; Graph; Property (philosophy); Set (abstract data type); Interconnection; Process (computing); Discrete mathematics; Computer science; Topology (electrical circuits)","score_opus":0.022007071279342434,"score_gpt":0.234428073198466,"score_spread":0.21242100191912358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021987857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24662976,0.00028226152,0.73339605,0.00041629944,0.00006438853,0.00011181374,0.00016919136,0.00025386646,0.018676348],"genre_scores_gemma":[0.9285274,0.00022547133,0.06856388,0.00009606733,0.000029147579,0.0001090252,0.00016369837,0.000045159682,0.0022402522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995733,0.00011165111,0.000024260133,0.00008926298,0.00014622363,0.00005525181],"domain_scores_gemma":[0.9989065,0.00049448264,0.00017311116,0.00021176189,0.00015723608,0.00005692997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370555,0.0003143825,0.0002499102,0.0005802515,0.0003785594,0.0007113595,0.0005385207,0.00054472574,0.0013868106],"category_scores_gemma":[0.0026198158,0.0001529183,0.00048104336,0.00037403748,0.0016158728,0.00135081,0.0009585324,0.0009733342,0.000109651744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093297065,0.000033755623,0.0023378048,0.00014148037,0.000017223625,0.0012944883,0.0004891055,0.093201235,0.031531096,0.8438421,0.0006410972,0.02637728],"study_design_scores_gemma":[0.000024583385,0.000117569245,0.0017615411,0.00005250721,0.00002473101,0.0013058586,0.00014922704,0.39284453,0.027574262,0.5707378,0.005373396,0.000033980476],"about_ca_topic_score_codex":0.00059537526,"about_ca_topic_score_gemma":0.00048402755,"teacher_disagreement_score":0.0013868106,"about_ca_system_score_codex":0.00065022137,"about_ca_system_score_gemma":0.0005341328,"threshold_uncertainty_score":0.0047177672},"labels":[],"label_agreement":null},{"id":"W3035314967","doi":"10.1109/fccm48280.2020.00019","title":"Exploring The Impact Of Switch Arity On Butterfly Fat Tree Fpga Nocs","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Waterloo","funders":"","keywords":"Arity; Computer science; Field-programmable gate array; Network on a chip; Routing (electronic design automation); Parallel computing; Deadlock; Tree (set theory); Cache; Network topology; Embedded system; Routing table; Topology (electrical circuits); Computer network; Distributed computing; Routing protocol; Engineering; Mathematics","score_opus":0.1543552887953143,"score_gpt":0.2803277376674801,"score_spread":0.1259724488721658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035314967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900243,0.00019465463,0.0069755786,0.000045145203,0.000011500148,0.000010100759,0.000048349324,0.000109567285,0.0025807736],"genre_scores_gemma":[0.9946279,0.00008892603,0.0048470544,0.000013181345,0.0000035930373,0.000006162284,0.00003871878,0.000013002568,0.00036151707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.00008262513,0.000018927918,0.000043238768,0.0000838263,0.00008055171],"domain_scores_gemma":[0.9984585,0.00094826083,0.00019867966,0.000153413,0.00018394922,0.000057303292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048690985,0.00036120642,0.00015972099,0.0004447476,0.00020971587,0.00046168067,0.00047211986,0.00020394649,0.0015880088],"category_scores_gemma":[0.002158955,0.00013105755,0.0001766764,0.0003550583,0.00020889047,0.00074739376,0.00023279047,0.0002311692,0.00008178],"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.0013061431,0.0002193163,0.018751565,0.0003065081,0.000105429506,0.00044742163,0.0001283123,0.7841914,0.10827674,0.0044709044,0.00082214363,0.08097412],"study_design_scores_gemma":[0.00006837762,0.0016994238,0.0113378195,0.000029929715,0.00012784482,0.00024209489,0.00015346354,0.92447644,0.05832581,0.0014423695,0.00207136,0.000025023674],"about_ca_topic_score_codex":0.0030033605,"about_ca_topic_score_gemma":0.007502833,"teacher_disagreement_score":0.0030033605,"about_ca_system_score_codex":0.0005361466,"about_ca_system_score_gemma":0.00042482713,"threshold_uncertainty_score":0.0059717298},"labels":[],"label_agreement":null},{"id":"W3083985534","doi":"10.1109/hpcs48598.2019.9188120","title":"High Performance Multilevel Graph Partitioning on GPU","year":2019,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Computer science; Parallel computing; Graph partition; Thread (computing); CUDA; Graph; General-purpose computing on graphics processing units; Exploit; Computation; Scheduling (production processes); Theoretical computer science; Algorithm; Graphics","score_opus":0.01391545973466771,"score_gpt":0.21027645824476265,"score_spread":0.19636099851009495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083985534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12940829,0.0006639333,0.82275534,0.00054206484,0.00015705095,0.00013998433,0.0010728278,0.018237742,0.027022727],"genre_scores_gemma":[0.44151208,0.00027598193,0.5478028,0.0002044763,0.000030159952,0.00020279344,0.0020743732,0.0011008861,0.0067964946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979323,0.00003204585,0.000010774044,0.000039535622,0.00008988021,0.000034556604],"domain_scores_gemma":[0.9997056,0.00008346497,0.000020661451,0.00008110088,0.00008211049,0.000027028482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016887563,0.0005993613,0.0004710457,0.00062515034,0.0005009374,0.0008787417,0.0010938331,0.00052511814,0.0068224687],"category_scores_gemma":[0.00082081626,0.00027402194,0.00056158873,0.00087836926,0.00024803067,0.0007327348,0.0007758781,0.00061952387,0.0015177968],"study_design_candidate":"bench_or_experimental","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.00060592045,0.00026153916,0.0040510762,0.0005876755,0.00023797179,0.00051558495,0.00048719588,0.47270373,0.093431845,0.027276585,0.04546221,0.35437864],"study_design_scores_gemma":[0.000051130653,0.000048840466,0.0007042988,0.000010033294,0.000011358548,0.00006910064,0.000048191974,0.9744309,0.008328912,0.006191331,0.010093056,0.00001275209],"about_ca_topic_score_codex":0.007399098,"about_ca_topic_score_gemma":0.014757705,"teacher_disagreement_score":0.007399098,"about_ca_system_score_codex":0.000719208,"about_ca_system_score_gemma":0.00084815023,"threshold_uncertainty_score":0.022823453},"labels":[],"label_agreement":null},{"id":"W3092226368","doi":"10.1109/dac18072.2020.9218539","title":"Kite: A Family of Heterogeneous Interposer Topologies Enabled via Accurate Interconnect Modeling","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Network topology; Interposer; Interconnection; Computer science; Network on a chip; Kite; Latency (audio); Chip; Three-dimensional integrated circuit; Topology (electrical circuits); Computer network; Computer architecture; Engineering; Telecommunications; Electrical engineering; Materials science","score_opus":0.04656119098170598,"score_gpt":0.2504398831839114,"score_spread":0.20387869220220545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092226368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07250005,0.000821388,0.9108892,0.0001660648,0.00007901664,0.00010969202,0.0007350723,0.0050097634,0.009689846],"genre_scores_gemma":[0.60662246,0.001340805,0.38439673,0.00012991864,0.000025454903,0.00033142464,0.0016408806,0.000700109,0.0048122816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000072925555,0.000010532144,0.000025582387,0.00009796991,0.000027525057],"domain_scores_gemma":[0.9995802,0.0001454899,0.00005498626,0.00013055121,0.00006417085,0.00002464935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004126077,0.0008157744,0.0005598689,0.00062837993,0.00029993072,0.00053940585,0.0011161509,0.0006789808,0.0017866623],"category_scores_gemma":[0.0012048876,0.0004309673,0.00065338885,0.00055619725,0.0002631091,0.00097294105,0.00071787374,0.0006447091,0.0004116228],"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.00005282593,0.0000327938,0.00085604994,0.000096239826,0.00005977109,0.00017176267,0.000058015445,0.938153,0.0064217187,0.012058051,0.0022779359,0.039761785],"study_design_scores_gemma":[0.0000081338185,0.000042695046,0.00015046154,0.000010745522,0.000010287956,0.00007287511,0.000009283091,0.98941773,0.0022691675,0.0031779765,0.0048189675,0.000011684317],"about_ca_topic_score_codex":0.0015213318,"about_ca_topic_score_gemma":0.002107654,"teacher_disagreement_score":0.0017866623,"about_ca_system_score_codex":0.00030547442,"about_ca_system_score_gemma":0.00042365774,"threshold_uncertainty_score":0.0059769154},"labels":[],"label_agreement":null},{"id":"W3093127399","doi":"10.1016/j.dam.2020.09.022","title":"Eulerian orientations and vertex-connectivity","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Eulerian path; Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Line graph; Indifference graph; Modular decomposition; Orientation (vector space); Pathwidth; Graph; Geometry","score_opus":0.019939516798493075,"score_gpt":0.23010295599416297,"score_spread":0.2101634391956699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093127399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5815115,0.0018485585,0.20988826,0.0030943227,0.00073441997,0.00008410475,0.00091923214,0.0003574791,0.20156209],"genre_scores_gemma":[0.95746416,0.0017604001,0.016113028,0.00031598046,0.0002244675,0.00005557889,0.00040425846,0.00013644225,0.023525676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998173,0.000035078876,0.000008605349,0.000043686774,0.00004573412,0.00004964297],"domain_scores_gemma":[0.99912494,0.00033544246,0.0001739992,0.00006691271,0.00013648174,0.00016221618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026683227,0.0005209034,0.0003526544,0.0014461103,0.00094801374,0.0020405469,0.000559179,0.00063291425,0.009059227],"category_scores_gemma":[0.0020053936,0.00033839743,0.00025039937,0.0011952023,0.0018291526,0.0031686467,0.001281197,0.0015848095,0.0009473148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020791558,0.000010164548,0.00034456968,0.000018118744,0.000002296451,0.00005103173,0.000119904624,0.0013388369,0.0005458181,0.98970264,0.00086067937,0.0069850096],"study_design_scores_gemma":[0.0000057141374,0.0000046170508,0.00025436695,0.000010705224,0.0000032775656,0.00006487486,0.00010570435,0.0030016762,0.0003549945,0.9932355,0.0029532588,0.0000052192854],"about_ca_topic_score_codex":0.0012277494,"about_ca_topic_score_gemma":0.0015221614,"teacher_disagreement_score":0.009059227,"about_ca_system_score_codex":0.00061955187,"about_ca_system_score_gemma":0.00045207058,"threshold_uncertainty_score":0.0303061},"labels":[],"label_agreement":null},{"id":"W3093527048","doi":"10.1109/fpl50879.2020.00015","title":"Learn the Switches: Evolving FPGA NoCs with Stall-Free and Backpressure Based Routers","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Field-programmable gate array; Network on a chip; Network packet; Parallel computing; Embedded system; Computer network","score_opus":0.0161973007415746,"score_gpt":0.1905093130177452,"score_spread":0.1743120122761706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093527048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7086673,0.00041214042,0.27809885,0.00032518173,0.00014622562,0.00006714992,0.00007852209,0.0018808001,0.010323729],"genre_scores_gemma":[0.91444486,0.00012346458,0.08309476,0.00007337021,0.000013008604,0.000033469307,0.000050593368,0.000051422358,0.0021151325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999019,0.000022113145,0.000003582729,0.000014549919,0.000038089995,0.000019750578],"domain_scores_gemma":[0.9998567,0.000043763554,0.00002293638,0.000032195323,0.00002852908,0.000015940668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025634983,0.0002952604,0.00014486528,0.00022078796,0.00014848325,0.00034790722,0.00055093155,0.00024858915,0.0009574728],"category_scores_gemma":[0.00061328366,0.00014503307,0.00013624769,0.00011552715,0.00025224805,0.00039334377,0.00028394375,0.00027903105,0.00012735196],"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.00014024573,0.000095697025,0.003917454,0.000056503748,0.00004232464,0.00020349897,0.00011334667,0.8186659,0.04111142,0.005603734,0.0011330508,0.12891679],"study_design_scores_gemma":[0.0000152234015,0.00013680564,0.00078992697,0.000006954211,0.000015113736,0.000041573338,0.000027730788,0.9855434,0.010169936,0.0016111836,0.0016349516,0.00000724368],"about_ca_topic_score_codex":0.0016380878,"about_ca_topic_score_gemma":0.0024699783,"teacher_disagreement_score":0.0016380878,"about_ca_system_score_codex":0.00036296048,"about_ca_system_score_gemma":0.00028957773,"threshold_uncertainty_score":0.0032571554},"labels":[],"label_agreement":null},{"id":"W3093764955","doi":"10.1109/access.2020.3030606","title":"NoC<sup>2</sup>: An Efficient Interfacing Approach for Heavily-Communicating NoC-Based Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Access","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":"University of Victoria","funders":"","keywords":"Interfacing; Computer science; Latency (audio); Network on a chip; Benchmark (surveying); Throughput; Embedded system; Default gateway; Bandwidth (computing); Low latency (capital markets); Computer network; Distributed computing; Computer hardware; Operating system; Telecommunications","score_opus":0.08969245911305108,"score_gpt":0.31035827450887554,"score_spread":0.22066581539582447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093764955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13480818,0.001949811,0.8479846,0.00022924945,0.00011537131,0.0001403396,0.0001188063,0.00333542,0.011318203],"genre_scores_gemma":[0.75007313,0.0005087174,0.24326901,0.00012467933,0.000055280125,0.00010499652,0.00027998566,0.00018061016,0.0054035317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972206,0.00007362395,0.000018330367,0.000039449198,0.000109452856,0.000037071713],"domain_scores_gemma":[0.9996382,0.0000852784,0.00004580947,0.000102425176,0.00010279978,0.000025433666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031533706,0.00072029175,0.00034162233,0.00045090364,0.00044546078,0.00060474075,0.0009895656,0.0003431099,0.0029358477],"category_scores_gemma":[0.00080110325,0.00014709083,0.00019304817,0.00057772436,0.00023374571,0.000887972,0.0006620387,0.00034697083,0.00043755854],"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.00037057258,0.00013172651,0.002909745,0.00046331002,0.000110869325,0.00047306882,0.00025249255,0.19759569,0.1396354,0.017299931,0.008343415,0.63241374],"study_design_scores_gemma":[0.00003372554,0.00052240223,0.0014867195,0.00003326943,0.00007595415,0.0006583583,0.00014018685,0.9158799,0.049956568,0.009228342,0.02195412,0.000030385558],"about_ca_topic_score_codex":0.001006399,"about_ca_topic_score_gemma":0.0024284036,"teacher_disagreement_score":0.0029358477,"about_ca_system_score_codex":0.00044464608,"about_ca_system_score_gemma":0.00041334884,"threshold_uncertainty_score":0.009821415},"labels":[],"label_agreement":null},{"id":"W3095545986","doi":"","title":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs","year":2021,"lang":"en","type":"article","venue":"idUS (Universidad de Sevilla)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Connectivity; Bound graph; Graph; Disjoint sets; Discrete mathematics; Graph power; Line graph","score_opus":0.010615906188625512,"score_gpt":0.22192240604689195,"score_spread":0.21130649985826644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095545986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9096038,0.00066770805,0.07955043,0.00034718987,0.000034890407,0.00002776945,0.001438651,0.00017353956,0.008156072],"genre_scores_gemma":[0.9876667,0.0003710755,0.0097460225,0.000052423864,0.00006036183,0.00004933444,0.00091637694,0.000043726905,0.0010939669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993855,0.00014886877,0.00003140294,0.00020122035,0.000117603275,0.00011543405],"domain_scores_gemma":[0.99400616,0.003871769,0.00070239947,0.0002674026,0.00063761027,0.000514627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006131851,0.0005089561,0.000824969,0.0027479408,0.0008128482,0.0016491973,0.0015494041,0.0006450176,0.0036205363],"category_scores_gemma":[0.0059909807,0.0003109068,0.00047173773,0.0024204832,0.00072034186,0.0023310836,0.0007137014,0.00053802814,0.00018593213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013725339,0.0003304516,0.05803547,0.0010292203,0.00058365316,0.0012147052,0.001441031,0.35678577,0.03195623,0.45337206,0.009518615,0.08436024],"study_design_scores_gemma":[0.000059362465,0.0001684056,0.033527598,0.00006192277,0.00018975837,0.0011400523,0.00049898407,0.48865741,0.005398032,0.46689644,0.0033392634,0.00006272252],"about_ca_topic_score_codex":0.001347678,"about_ca_topic_score_gemma":0.0017231972,"teacher_disagreement_score":0.0036205363,"about_ca_system_score_codex":0.0007693157,"about_ca_system_score_gemma":0.0003402196,"threshold_uncertainty_score":0.012111902},"labels":[],"label_agreement":null},{"id":"W3096442223","doi":"","title":"Toward a Generic Fault Tolerance Technique for Partial Network Partitioning.","year":2020,"lang":"en","type":"article","venue":"Operating Systems Design and Implementation","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fault tolerance; Reliability engineering; Parallel computing; Distributed computing; Engineering","score_opus":0.06937251658217819,"score_gpt":0.3019854254663023,"score_spread":0.23261290888412411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096442223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00989091,0.00032417712,0.9862757,0.00011529804,0.000048007307,0.00003830857,0.000030457848,0.0010454017,0.0022317413],"genre_scores_gemma":[0.20415151,0.0005906285,0.7901859,0.00018798535,0.00006068892,0.0001206575,0.00022266213,0.00034672103,0.004133214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00008375465,0.000024062429,0.00005677921,0.00018616297,0.000060985647],"domain_scores_gemma":[0.99934715,0.000086673535,0.000049791794,0.00033300446,0.00014985488,0.000033531953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003237,0.00042286105,0.00040207125,0.00054253056,0.0004963507,0.00071846886,0.0014959837,0.00057677226,0.0019182696],"category_scores_gemma":[0.0014757083,0.00029021592,0.0004915454,0.0007307916,0.000751678,0.001332701,0.0013855703,0.0010357517,0.000600083],"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.00031747847,0.00013598414,0.0013050332,0.00048039376,0.00011104514,0.00021569469,0.00046629322,0.16108353,0.087789364,0.16875096,0.013080786,0.5662634],"study_design_scores_gemma":[0.00006510599,0.0003650769,0.0010046454,0.00011775968,0.00011827482,0.0008555389,0.0001567353,0.778927,0.05403381,0.10745735,0.056853935,0.000044725653],"about_ca_topic_score_codex":0.00095747726,"about_ca_topic_score_gemma":0.0020095482,"teacher_disagreement_score":0.0019182696,"about_ca_system_score_codex":0.00038879394,"about_ca_system_score_gemma":0.0006821738,"threshold_uncertainty_score":0.006417215},"labels":[],"label_agreement":null},{"id":"W3097870658","doi":"10.1142/s0129626420400095","title":"A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks","year":2020,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Interconnection; Computer science; Perspective (graphical); Resilience (materials science); Vulnerability (computing); Development (topology); Graph theory; Distributed computing; Theoretical computer science; Computer network; Artificial intelligence; Mathematics; Computer security","score_opus":0.07882330602952328,"score_gpt":0.2734465681261355,"score_spread":0.1946232620966122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097870658","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014777979,0.35157117,0.03232463,0.2899004,0.27306572,0.00010473906,0.0010492556,0.00032333145,0.050182957],"genre_scores_gemma":[0.033165257,0.38664284,0.01884293,0.17919345,0.30178234,0.00029865757,0.0007740248,0.00051974144,0.078780636],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981218,0.0005600671,0.00022271581,0.00034449107,0.0005901379,0.00016075802],"domain_scores_gemma":[0.9927758,0.0049836584,0.00037309268,0.00019942322,0.0014646765,0.00020334021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048322,0.0014804805,0.0010470753,0.002693074,0.0024371198,0.004479498,0.002607264,0.005877262,0.0101089785],"category_scores_gemma":[0.009331363,0.0004958712,0.0014483478,0.0036713332,0.0035780899,0.006877088,0.0012601027,0.009908181,0.004436559],"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.00008918064,0.000024086432,0.00025049114,0.0013739895,0.000048693622,0.00054052373,0.00038126795,0.0015481126,0.0016153648,0.24534099,0.7077885,0.04099873],"study_design_scores_gemma":[0.0000072508674,0.000039157163,0.00031195197,0.00061296666,0.000020201682,0.00032826894,0.00013231408,0.00082357955,0.00024208461,0.078719884,0.91873235,0.00002999568],"about_ca_topic_score_codex":0.0046845074,"about_ca_topic_score_gemma":0.0072602616,"teacher_disagreement_score":0.0101089785,"about_ca_system_score_codex":0.0038097352,"about_ca_system_score_gemma":0.0022458697,"threshold_uncertainty_score":0.033817887},"labels":[],"label_agreement":null},{"id":"W3099119422","doi":"10.1109/tcad.2020.3037310","title":"A Deflection-Based Deadlock Recovery Framework to Achieve High Throughput for Faulty NoCs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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 Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; Nova; Ministry of Science and Technology of the People's Republic of China; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Deadlock prevention algorithms; Deadlock; Computer science; Throughput; Distributed computing; Computer network; Network packet; Latency (audio); Concurrency control; Wireless; Database transaction","score_opus":0.05258363901333988,"score_gpt":0.2568730001466262,"score_spread":0.2042893611332863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099119422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021859927,0.0005451081,0.97295713,0.00016372811,0.00008779981,0.00008127374,0.00004604162,0.0022125968,0.0020463276],"genre_scores_gemma":[0.6517349,0.0006547016,0.34263402,0.00020220102,0.00007502623,0.00021991854,0.00020123646,0.00023733053,0.0040405625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995679,0.00007062262,0.00002972029,0.00007692113,0.00015845646,0.000096330856],"domain_scores_gemma":[0.9994906,0.00012336763,0.000050743718,0.00010442831,0.00018539184,0.00004535223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008400993,0.00061890273,0.00047257147,0.00066288945,0.00076018256,0.0006164091,0.0015377122,0.00056622823,0.0020153201],"category_scores_gemma":[0.0012002039,0.00022808897,0.00046267282,0.00038137136,0.000656152,0.00093078153,0.0013808951,0.00089227926,0.00035592233],"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.00035806472,0.00018281827,0.0017254944,0.0003926435,0.000080259044,0.000477477,0.0003649983,0.47596884,0.19667488,0.07365089,0.0067877667,0.24333587],"study_design_scores_gemma":[0.000038968676,0.00018962327,0.00029603558,0.000023520886,0.00004101665,0.00016475854,0.00005144739,0.946295,0.02899056,0.015663292,0.008198103,0.000047614103],"about_ca_topic_score_codex":0.0021568122,"about_ca_topic_score_gemma":0.0031288425,"teacher_disagreement_score":0.0021568122,"about_ca_system_score_codex":0.0008590275,"about_ca_system_score_gemma":0.0016041251,"threshold_uncertainty_score":0.006741941},"labels":[],"label_agreement":null},{"id":"W3102472584","doi":"10.1109/ipc47351.2020.9252467","title":"Hyperscale Data Center Networks with Interconnected Transparent Island Architecture","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Toronto Metropolitan University","funders":"","keywords":"Architecture; Data center; Computer science; Center (category theory); Computer network; Computer architecture; Geography; Archaeology","score_opus":0.04718476327755264,"score_gpt":0.23402321691509406,"score_spread":0.18683845363754142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102472584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55603915,0.00073499006,0.41434583,0.0005362274,0.00020011602,0.00010773671,0.0003937686,0.0024722205,0.025170026],"genre_scores_gemma":[0.95872885,0.00014329783,0.03863279,0.00006935241,0.00002774119,0.000043714663,0.00021629466,0.000031018153,0.0021067588],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991083,0.000011491423,0.0000031594245,0.000025381862,0.000028842966,0.000020218939],"domain_scores_gemma":[0.99989414,0.000012242004,0.000013082737,0.000028061699,0.000038138038,0.000014283663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008637279,0.00019540846,0.00016230435,0.00016145356,0.0003800316,0.00037683433,0.0004284906,0.00016533528,0.0012427913],"category_scores_gemma":[0.00014550112,0.000076326105,0.00013820571,0.00023757185,0.00019432578,0.00066757016,0.0004926912,0.0003012243,0.00016459676],"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.00073035987,0.00030282637,0.00744357,0.00033680137,0.00012893633,0.00052319415,0.00031786453,0.25307062,0.40567023,0.055068087,0.01985165,0.25655589],"study_design_scores_gemma":[0.00005084839,0.00028919303,0.0023136062,0.000012707054,0.00003676817,0.0001338207,0.00007910947,0.91723204,0.058278944,0.0076617463,0.013879162,0.000031965097],"about_ca_topic_score_codex":0.002481717,"about_ca_topic_score_gemma":0.0041611018,"teacher_disagreement_score":0.002481717,"about_ca_system_score_codex":0.0004219468,"about_ca_system_score_gemma":0.00033331278,"threshold_uncertainty_score":0.0049344897},"labels":[],"label_agreement":null},{"id":"W3104964829","doi":"10.1002/cpe.6052","title":"Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph Partitioning","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Asynchronous communication; Distributed computing; Graph; Benchmark (surveying); Parallel computing; Theoretical computer science","score_opus":0.02998049227623267,"score_gpt":0.31634306788024974,"score_spread":0.28636257560401707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104964829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09799557,0.000083589206,0.895966,0.0000970615,0.000022217777,0.00007193975,0.000025478173,0.0030617316,0.0026763387],"genre_scores_gemma":[0.6564388,0.000060633927,0.34150776,0.00003966214,0.000007668324,0.00006468757,0.000049574224,0.00021878578,0.0016124231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.00009477044,0.000017191694,0.00012074343,0.00011477815,0.000033550994],"domain_scores_gemma":[0.9995547,0.00012338025,0.000061563616,0.00014836245,0.00008264531,0.000029287667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745606,0.0003728923,0.00027067726,0.00031016546,0.0002798999,0.0005297387,0.0005892773,0.00022587417,0.0007703548],"category_scores_gemma":[0.00095612806,0.00017384258,0.00021415282,0.00019894511,0.0004833611,0.0004761095,0.00057892845,0.00052279804,0.00014309632],"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.00044218605,0.00014353365,0.0042183325,0.00015405787,0.00004967207,0.00020785362,0.0004961547,0.47269952,0.13976185,0.037367795,0.0017045409,0.34275454],"study_design_scores_gemma":[0.000017434239,0.00008371643,0.00068352977,0.000008586643,0.00001302631,0.000047828275,0.000026229385,0.94202167,0.044912133,0.0061071906,0.006067581,0.0000110761175],"about_ca_topic_score_codex":0.0034732267,"about_ca_topic_score_gemma":0.003066663,"teacher_disagreement_score":0.0034732267,"about_ca_system_score_codex":0.00062801235,"about_ca_system_score_gemma":0.00060137233,"threshold_uncertainty_score":0.0069060326},"labels":[],"label_agreement":null},{"id":"W3105015273","doi":"10.1007/s00542-020-05084-1","title":"Predictions optimal routing algorithm based on artificial intelligence technique for 3D NoC systems","year":2020,"lang":"en","type":"article","venue":"Microsystem Technologies","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Latency (audio); Routing (electronic design automation); Energy consumption; Network on a chip; Power consumption; Routing algorithm; Throughput; Distributed computing; Power (physics); Embedded system; Engineering; Routing protocol","score_opus":0.035446168145836746,"score_gpt":0.2543629808605192,"score_spread":0.2189168127146825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105015273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036393397,0.000388684,0.95518124,0.00019727384,0.00010522404,0.000049735707,0.00004214591,0.00041174077,0.007230547],"genre_scores_gemma":[0.5984324,0.0004039054,0.3956008,0.00015025144,0.00004901546,0.00019154015,0.00014167276,0.000090379974,0.0049399566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998952,0.000027353237,0.0000066922,0.00002084977,0.000035598674,0.000014287684],"domain_scores_gemma":[0.9998615,0.000057904796,0.0000148559575,0.000010618865,0.000048907288,0.0000062144018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025527133,0.0003570331,0.0004537163,0.0005422405,0.00038544103,0.0004243657,0.0005552893,0.0005378379,0.0019322616],"category_scores_gemma":[0.0005543335,0.0002590466,0.0004416451,0.00042362197,0.0002590293,0.00043926304,0.00031986678,0.00038833663,0.00014591168],"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.00002832522,0.000019934814,0.00028821192,0.000038632043,0.000023524348,0.000032758428,0.000023327326,0.9406269,0.002846475,0.0070018573,0.0009943263,0.0480757],"study_design_scores_gemma":[0.0000029538214,0.000009014717,0.000043826032,0.0000016073744,0.0000034779239,0.000006149802,0.0000022433715,0.99830544,0.0002226574,0.0011758413,0.00022517676,0.0000016085061],"about_ca_topic_score_codex":0.004433959,"about_ca_topic_score_gemma":0.0037245278,"teacher_disagreement_score":0.004433959,"about_ca_system_score_codex":0.00051488006,"about_ca_system_score_gemma":0.000788,"threshold_uncertainty_score":0.008816302},"labels":[],"label_agreement":null},{"id":"W3107509995","doi":"10.1088/1742-6596/1679/3/032017","title":"Multilevel procedure for decomposition and mapping graphs","year":2020,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Decomposition; Multiprocessing; Task (project management); Parallel computing; Decomposition method (queueing theory); Metis; Software; Execution time; Programming language; Mathematics","score_opus":0.043917379843044724,"score_gpt":0.2634190147211211,"score_spread":0.2195016348780764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107509995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009197923,0.00006767737,0.98502886,0.0001188389,0.00004091864,0.00010832278,0.00021036722,0.00079407735,0.004432984],"genre_scores_gemma":[0.097379416,0.00010402564,0.89798963,0.000066759894,0.000029699264,0.00017116337,0.00048053768,0.0003029235,0.0034757904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959725,0.00010296197,0.00002293841,0.000087347864,0.00013029981,0.000059318958],"domain_scores_gemma":[0.9993975,0.00020594375,0.00004526491,0.0002049756,0.000117400305,0.000028912107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038221537,0.00044231294,0.00041218058,0.0012886015,0.00062414,0.00071414374,0.0007085756,0.0005233291,0.012868441],"category_scores_gemma":[0.0017926857,0.00025730778,0.0009111905,0.0008463234,0.0005373442,0.0006867959,0.0014211377,0.0012706696,0.0021381145],"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.00018962972,0.00016837235,0.0010576848,0.00048375965,0.00007986614,0.00034960033,0.0003574522,0.091132596,0.042628754,0.2763247,0.014945542,0.5722821],"study_design_scores_gemma":[0.00008358617,0.0002026061,0.0012143082,0.000112685564,0.00007686402,0.00057207304,0.0002167403,0.5334101,0.038428996,0.36796108,0.05767371,0.000047337657],"about_ca_topic_score_codex":0.0014294882,"about_ca_topic_score_gemma":0.0018177304,"teacher_disagreement_score":0.012868441,"about_ca_system_score_codex":0.0004303901,"about_ca_system_score_gemma":0.0007236604,"threshold_uncertainty_score":0.043049216},"labels":[],"label_agreement":null},{"id":"W3112004038","doi":"10.1109/sbesc51047.2020.9277850","title":"Mapping Wired Links in a Hybrid Wired-Wireless Network-on-Chip","year":2020,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Latency (audio); Network packet; Wireless network; Wireless; Network topology; Interconnection; Wireless WAN; Power consumption; Wi-Fi array; Telecommunications; Power (physics)","score_opus":0.029231077752701798,"score_gpt":0.22115340417395032,"score_spread":0.1919223264212485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112004038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61215526,0.00078303117,0.37572572,0.00012183474,0.00011192003,0.00012634035,0.00023289706,0.0011286762,0.009614278],"genre_scores_gemma":[0.90886414,0.0002958526,0.08782549,0.000057703015,0.000009313114,0.0000894328,0.00014795178,0.000059019545,0.0026511322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978894,0.000055595592,0.00001126453,0.000043450822,0.000059635924,0.000041126757],"domain_scores_gemma":[0.99973065,0.00008555332,0.00003770096,0.00005672732,0.00006820222,0.00002118787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022861498,0.00047330852,0.00019177952,0.0003936985,0.0002199299,0.0006665381,0.0006185406,0.00031609196,0.0012694987],"category_scores_gemma":[0.00062346464,0.00018147466,0.00014711397,0.0004155025,0.00020843883,0.0008043139,0.0005399262,0.00027734367,0.00027950923],"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.00030654346,0.00026787524,0.0037928517,0.00048251174,0.00015191393,0.00042198796,0.0001743317,0.5517191,0.2641727,0.008032756,0.001227853,0.16924953],"study_design_scores_gemma":[0.000037503876,0.0009916087,0.0034410653,0.00005602105,0.00017104067,0.0004456102,0.00026372029,0.7758789,0.19752863,0.008191647,0.012940924,0.000053298674],"about_ca_topic_score_codex":0.00078438,"about_ca_topic_score_gemma":0.0019149146,"teacher_disagreement_score":0.0012694987,"about_ca_system_score_codex":0.0002613966,"about_ca_system_score_gemma":0.00034897853,"threshold_uncertainty_score":0.0042468905},"labels":[],"label_agreement":null},{"id":"W3112004248","doi":"10.1002/cpe.6124","title":"An efficient shortest path routing on the hypercube with blocking/faulty nodes","year":2020,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Hypercube; Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Node (physics); Path (computing); Routing (electronic design automation); Shortest Path Faster Algorithm; Blocking (statistics); Yen's algorithm; Equal-cost multi-path routing; Fault tolerance; Longest path problem; Floyd–Warshall algorithm; Algorithm; Mathematics; Mathematical optimization; Link-state routing protocol; Theoretical computer science; Distributed computing; Parallel computing; Dijkstra's algorithm; Computer network; Routing protocol; Graph","score_opus":0.03460719488136469,"score_gpt":0.29395456044820983,"score_spread":0.2593473655668451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112004248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21450105,0.0010957855,0.7692949,0.0014991261,0.00018099156,0.0002549648,0.00049586175,0.0010282277,0.011649037],"genre_scores_gemma":[0.5876047,0.0007458911,0.40349263,0.000115035546,0.000080702,0.0002182987,0.0006383569,0.000098457254,0.0070058363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994229,0.00025207613,0.00003279443,0.000073964584,0.00013889644,0.0000793836],"domain_scores_gemma":[0.9993773,0.00025892668,0.00006823888,0.000117028816,0.00012443998,0.000054012187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124145,0.00041298292,0.0006392728,0.0006215791,0.00071442046,0.0007548929,0.000752032,0.0005873283,0.002673694],"category_scores_gemma":[0.001210257,0.00022395723,0.00041400045,0.0011072551,0.00045674932,0.0016023505,0.00087619375,0.00048481097,0.00040058722],"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.00047653072,0.00010453534,0.0009770383,0.00027724152,0.000062653446,0.00038073605,0.00020062701,0.8245135,0.019087046,0.041623943,0.006496907,0.10579918],"study_design_scores_gemma":[0.000046360554,0.00007249497,0.00024891895,0.000009805757,0.00000852573,0.000075144184,0.00008768028,0.9675382,0.004088707,0.024528077,0.0032827703,0.000013361812],"about_ca_topic_score_codex":0.0023937114,"about_ca_topic_score_gemma":0.0018080196,"teacher_disagreement_score":0.002673694,"about_ca_system_score_codex":0.0008263253,"about_ca_system_score_gemma":0.0007033277,"threshold_uncertainty_score":0.008944392},"labels":[],"label_agreement":null},{"id":"W3112629328","doi":"10.1145/3257185","title":"Session details: Interconnect and Routing","year":2017,"lang":"en","type":"article","venue":"","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":"Microsemi (Canada)","funders":"","keywords":"Session (web analytics); Computer science; Computer network; Routing (electronic design automation); Interconnection; Computer architecture; World Wide Web","score_opus":0.027334545689660303,"score_gpt":0.27270951661196896,"score_spread":0.24537497092230864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112629328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014291963,0.008017391,0.0058451323,0.015972406,0.048701055,0.00063079165,0.020175612,0.0038008587,0.8954276],"genre_scores_gemma":[0.00598808,0.004184446,0.00080362963,0.0013512691,0.006282702,0.0001643146,0.0045433687,0.0005806517,0.9761016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995722,0.00006265634,0.000019406642,0.000108824905,0.00014005788,0.00009685375],"domain_scores_gemma":[0.9981483,0.00036354354,0.000060602782,0.00029634545,0.00038692163,0.0007442731],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007422468,0.0014737605,0.0016358676,0.00079686166,0.0013934446,0.003916302,0.0014295386,0.0033802346,0.88533086],"category_scores_gemma":[0.0025574213,0.00033384323,0.0009725699,0.0011334929,0.00033216414,0.0016593547,0.0015852277,0.002179628,0.74138105],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00011406564,0.00006156732,0.00006340703,0.00014734425,0.000008716261,0.000029640698,0.000008859738,0.000099955345,0.0007221505,0.0009806028,0.9616135,0.036150303],"study_design_scores_gemma":[0.000047765378,0.00007761994,0.000285588,0.00007219548,0.000010635133,0.00007257384,0.000019223206,0.00027275618,0.00040458428,0.0012515683,0.9974777,0.000007705818],"about_ca_topic_score_codex":0.00107879,"about_ca_topic_score_gemma":0.0025473828,"teacher_disagreement_score":0.114669144,"about_ca_system_score_codex":0.0008516698,"about_ca_system_score_gemma":0.0012157393,"threshold_uncertainty_score":0.16356164},"labels":[],"label_agreement":null},{"id":"W3122907336","doi":"","title":"DART: Fast and Flexible NoC Simulation using FPGAs","year":2010,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Parallel computing; Computer architecture; Dart; Embedded system; Programming language","score_opus":0.022504578388023742,"score_gpt":0.27947871144285863,"score_spread":0.2569741330548349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122907336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12709588,0.00081051484,0.80323595,0.0005222196,0.00054902775,0.0006185227,0.003811004,0.037168674,0.026188266],"genre_scores_gemma":[0.5833006,0.00048074586,0.40478224,0.00018290593,0.000053599142,0.0010442942,0.0027746488,0.0018075554,0.005573461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.00009675289,0.000020385256,0.000044016742,0.000100086196,0.000041329207],"domain_scores_gemma":[0.99928695,0.00039501963,0.000041055882,0.00009896586,0.00012941008,0.000048574253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007077354,0.0011415286,0.000693308,0.0006818238,0.0005730338,0.0008198583,0.0019329304,0.0010347413,0.011245113],"category_scores_gemma":[0.0020633875,0.00072868937,0.0006823871,0.00049468694,0.00041321665,0.00088296167,0.00080651266,0.0009896844,0.0012074905],"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.00024588653,0.000076838216,0.0014089816,0.00021659177,0.00010835348,0.00021351055,0.000087720706,0.94571793,0.003849299,0.0056674327,0.0072406735,0.03516675],"study_design_scores_gemma":[0.00005802475,0.000037729853,0.00012207848,0.000008623573,0.000007933353,0.000021762437,0.000008188566,0.99460703,0.0019463885,0.00094700855,0.0022256062,0.000009649419],"about_ca_topic_score_codex":0.0061400733,"about_ca_topic_score_gemma":0.0050812154,"teacher_disagreement_score":0.011245113,"about_ca_system_score_codex":0.0005657112,"about_ca_system_score_gemma":0.0009042292,"threshold_uncertainty_score":0.037618637},"labels":[],"label_agreement":null},{"id":"W3135483926","doi":"10.1109/isscc42613.2021.9365929","title":"8.7 A 112Gb/s ADC-DSP-Based PAM-4 Transceiver for Long-Reach Applications with &gt;40dB Channel Loss in 7nm FinFET","year":2021,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Indigenous Peoples' Health","funders":"","keywords":"Transceiver; Computer science; Electronic engineering; Throughput; Bandwidth (computing); Channel (broadcasting); Computer hardware; Electrical engineering; CMOS; Computer network; Telecommunications; Engineering; Wireless","score_opus":0.01425396180571375,"score_gpt":0.23378411849708053,"score_spread":0.21953015669136677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135483926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.866664,0.002233994,0.055994745,0.0016658411,0.0006945898,0.00020086206,0.000750611,0.0027233828,0.06907201],"genre_scores_gemma":[0.9212747,0.00067782105,0.039260097,0.00027458312,0.00010414091,0.000053249663,0.0003861655,0.000068422836,0.037900764],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986386,0.000007361428,0.0000045518527,0.000019659587,0.00008494955,0.000019616082],"domain_scores_gemma":[0.99992764,0.000007652381,0.000011529489,0.000004879384,0.00003310973,0.000015180295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001296835,0.00022130918,0.00018729582,0.00018673412,0.00025249252,0.00032725435,0.0008018161,0.0006630711,0.003775537],"category_scores_gemma":[0.00018022448,0.00011393905,0.00013333937,0.00016146064,0.00014797824,0.00047217924,0.0001838638,0.00040039403,0.0016703256],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00018838965,0.00012860566,0.001362226,0.00023301429,0.000022254859,0.0007951578,0.00013272297,0.0022483678,0.9464972,0.0037313572,0.007602432,0.037058212],"study_design_scores_gemma":[0.00010659567,0.003062033,0.0050995885,0.00010849612,0.00006965977,0.003565601,0.0001528419,0.040333834,0.8694065,0.0009819617,0.07704393,0.0000689001],"about_ca_topic_score_codex":0.0008159656,"about_ca_topic_score_gemma":0.0017239765,"teacher_disagreement_score":0.003775537,"about_ca_system_score_codex":0.000429481,"about_ca_system_score_gemma":0.00042730442,"threshold_uncertainty_score":0.012630403},"labels":[],"label_agreement":null},{"id":"W3138020119","doi":"10.1109/ccwc51732.2021.9375923","title":"A Broadcasting Heuristic for Hypercube of Trees","year":2021,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Hypercube; Computer science; Heuristic; Broadcasting (networking); Speedup; Upper and lower bounds; Theoretical computer science; Vertex (graph theory); Process (computing); Graph; Algorithm; Parallel computing; Mathematical optimization; Mathematics; Artificial intelligence; Computer network","score_opus":0.026151277838742423,"score_gpt":0.2516666708271315,"score_spread":0.22551539298838907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138020119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12388452,0.00358318,0.8367793,0.001311358,0.00032868068,0.0005529388,0.0005733725,0.0020666572,0.030920018],"genre_scores_gemma":[0.4848829,0.0013699535,0.5031259,0.00035439368,0.00011006111,0.0005215354,0.001070114,0.00038282017,0.008182372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952793,0.00014779347,0.000020060394,0.00006608421,0.00010391204,0.00013423421],"domain_scores_gemma":[0.99919146,0.0003482442,0.00007512227,0.00012037775,0.00014661255,0.000118167474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006431432,0.0005891757,0.00090442307,0.0010353965,0.0012040042,0.0010338293,0.0015279766,0.0011690658,0.005270293],"category_scores_gemma":[0.0019181808,0.00040910605,0.0005424881,0.0016686663,0.0007262802,0.001556728,0.0009915928,0.00083199143,0.00082406116],"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.00041838194,0.00022106309,0.0010812302,0.0004738843,0.00007260975,0.00027363724,0.00032039796,0.7631058,0.010732223,0.054183148,0.019620828,0.1494967],"study_design_scores_gemma":[0.00007282967,0.00007664791,0.0001704603,0.00003658441,0.000021915348,0.00007149264,0.00011911617,0.97752714,0.002698588,0.01265761,0.006530624,0.00001700175],"about_ca_topic_score_codex":0.006538373,"about_ca_topic_score_gemma":0.00815144,"teacher_disagreement_score":0.006538373,"about_ca_system_score_codex":0.0019011318,"about_ca_system_score_gemma":0.002127619,"threshold_uncertainty_score":0.017630935},"labels":[],"label_agreement":null},{"id":"W3146394219","doi":"10.1109/date.2007.364438","title":"System Level Assessment of an Optical NoC in an MPSoC Platform","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"MPSoC; Interconnection; System on a chip; Computer science; Embedded system; Computer architecture; Network on a chip; Telecommunications","score_opus":0.056631651127626186,"score_gpt":0.3263792045090526,"score_spread":0.2697475533814264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146394219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93675613,0.00034468243,0.052060045,0.00015852677,0.000026840657,0.00009266639,0.00012938566,0.00023316,0.010198584],"genre_scores_gemma":[0.9943808,0.000045707817,0.0045925854,0.000014793911,0.000004159401,0.000020210313,0.000029386994,0.000012021792,0.0009003855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967897,0.000080194935,0.000008099031,0.0000314296,0.00015264869,0.00004862613],"domain_scores_gemma":[0.9993537,0.00028334046,0.00007785207,0.00004140173,0.00021572514,0.000027974302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045880442,0.00032990857,0.00020056729,0.0003357012,0.0002863712,0.00046521175,0.000377431,0.00038337894,0.0021303927],"category_scores_gemma":[0.0014462067,0.0001307289,0.0002476814,0.00019595551,0.00032830934,0.0004851239,0.00023372877,0.00022951196,0.00011604454],"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.00034362712,0.000099748024,0.0031755758,0.00017301725,0.000041822364,0.00015701099,0.000057341353,0.9198813,0.057754952,0.0034936168,0.0002739266,0.014548048],"study_design_scores_gemma":[0.000015018559,0.00049459847,0.0017917603,0.000008082828,0.000029252169,0.000028857708,0.000036772617,0.9793258,0.01687493,0.0007912949,0.0005939924,0.000009664951],"about_ca_topic_score_codex":0.0027738675,"about_ca_topic_score_gemma":0.0021199004,"teacher_disagreement_score":0.0027738675,"about_ca_system_score_codex":0.00083937193,"about_ca_system_score_gemma":0.0004942955,"threshold_uncertainty_score":0.007126868},"labels":[],"label_agreement":null},{"id":"W3149289496","doi":"10.1109/iwqos.2011.5931336","title":"Future Internet video multicasting with essentially perfect resource utilization and QoS guarantees","year":2011,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"McMaster University; Bell (Canada)","funders":"","keywords":"Computer science; Computer network; Quality of service; Multicast; Router; Core router; The Internet; Multiprotocol Label Switching; Internet traffic; Scheduling (production processes); Distributed computing","score_opus":0.03502223818557173,"score_gpt":0.2210646784005382,"score_spread":0.18604244021496646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149289496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0945026,0.0067240056,0.7930042,0.0007039476,0.00027167448,0.0002828259,0.00025654573,0.00253487,0.10171936],"genre_scores_gemma":[0.572767,0.006056615,0.39579487,0.00032016615,0.00030071175,0.00028362172,0.0005947646,0.00013002448,0.023752108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999749,0.000048535483,0.000015360856,0.000023604254,0.00012633707,0.000037120222],"domain_scores_gemma":[0.99990857,0.000011943409,0.000012368285,0.000020623691,0.00003887601,0.0000076250267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028635268,0.00030703738,0.0002577227,0.00039959498,0.00022650475,0.0006332772,0.00043187803,0.00036253425,0.001037427],"category_scores_gemma":[0.00036962258,0.00012580497,0.00021933368,0.00031993905,0.00021205473,0.00063048495,0.0002631071,0.00029444156,0.00048958545],"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.00020734152,0.00010741207,0.0016963918,0.00081075024,0.000065638706,0.00070583064,0.00020133927,0.077639565,0.11469625,0.2572178,0.0174552,0.52919644],"study_design_scores_gemma":[0.0001029919,0.0014098935,0.005762828,0.0002697365,0.00019709406,0.0032971099,0.0002357324,0.48114526,0.060962725,0.1370709,0.30945826,0.00008755927],"about_ca_topic_score_codex":0.0007447827,"about_ca_topic_score_gemma":0.00096125953,"teacher_disagreement_score":0.001037427,"about_ca_system_score_codex":0.0005316391,"about_ca_system_score_gemma":0.00039119562,"threshold_uncertainty_score":0.0038573742},"labels":[],"label_agreement":null},{"id":"W3150538181","doi":"10.1109/ipdps.2006.1639557","title":"Broadcasting and routing in faulty mesh networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Ottawa","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Distributed computing; Polygon mesh; Routing (electronic design automation); Static routing; Node (physics); Mesh networking; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Parallel computing; Routing protocol; Telecommunications; Engineering","score_opus":0.009778374273930733,"score_gpt":0.21370334861238519,"score_spread":0.20392497433845444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150538181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051003948,0.0013603246,0.93904674,0.00082262256,0.00015566873,0.000062162915,0.00011710364,0.0007212348,0.0067101577],"genre_scores_gemma":[0.6839707,0.0026377437,0.30609056,0.00026199923,0.00018432665,0.00016643619,0.0003521813,0.00018284879,0.0061531556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.00024742293,0.000067565,0.0001415121,0.0002991169,0.00012382837],"domain_scores_gemma":[0.9976393,0.0011850325,0.0003021811,0.00046405525,0.00034904678,0.0000603393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007484769,0.00032400773,0.0005125331,0.00069945515,0.0009427498,0.0011975425,0.001022603,0.0009765904,0.0011533019],"category_scores_gemma":[0.0056515415,0.0003339021,0.00034830064,0.0011018416,0.0011581783,0.002239748,0.00093881565,0.0006660837,0.00023826642],"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.00027649914,0.00002471057,0.0019700741,0.00044815874,0.000045790963,0.00051469315,0.00054180785,0.5909071,0.014039175,0.25135386,0.005323986,0.13455412],"study_design_scores_gemma":[0.00003237703,0.000068763016,0.00044553698,0.00004280417,0.00003082472,0.00036003345,0.00020508748,0.79003537,0.007931485,0.18631312,0.014510622,0.00002395623],"about_ca_topic_score_codex":0.0030196873,"about_ca_topic_score_gemma":0.0018376863,"teacher_disagreement_score":0.0030196873,"about_ca_system_score_codex":0.0013410271,"about_ca_system_score_gemma":0.00075748604,"threshold_uncertainty_score":0.009729922},"labels":[],"label_agreement":null},{"id":"W3156834715","doi":"","title":"Network Improvement and Evaluation in Datacenters and Chip-Multiprocessors","year":2017,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","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 Toronto","funders":"","keywords":"Computer science; Chip; Computer architecture; Parallel computing; Embedded system; Telecommunications","score_opus":0.01965511335798342,"score_gpt":0.2656518853934637,"score_spread":0.24599677203548026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156834715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.751644,0.0023954662,0.21748047,0.0006586376,0.00024512454,0.00046433136,0.0006333633,0.0031095212,0.023369038],"genre_scores_gemma":[0.9518274,0.0003169582,0.045695987,0.00008348001,0.000016637287,0.00011875995,0.0003891101,0.00008098587,0.001470678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762887,0.0009213592,0.000103525264,0.00032339356,0.00073191436,0.00029109127],"domain_scores_gemma":[0.9957663,0.00135053,0.00037813353,0.0006745936,0.0015656825,0.00026474413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032344286,0.0006899386,0.000457636,0.0007519854,0.0004126675,0.00078805897,0.0012516642,0.00044347646,0.0014681827],"category_scores_gemma":[0.006231079,0.00018192877,0.00028063098,0.00084421143,0.00048448966,0.0015744893,0.000785062,0.0005088203,0.00014272689],"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.00097581785,0.0006459793,0.010714713,0.00036134644,0.00009477566,0.00015940868,0.00013535471,0.79584306,0.020107483,0.009548111,0.0049465555,0.15646736],"study_design_scores_gemma":[0.00006366941,0.0008085681,0.0032059434,0.000027539885,0.000045458928,0.00004025614,0.000100285906,0.9669103,0.023336105,0.0021082615,0.00333869,0.000014929159],"about_ca_topic_score_codex":0.0043727895,"about_ca_topic_score_gemma":0.0049595735,"teacher_disagreement_score":0.0043727895,"about_ca_system_score_codex":0.0022759582,"about_ca_system_score_gemma":0.0012511017,"threshold_uncertainty_score":0.01710552},"labels":[],"label_agreement":null},{"id":"W3157297576","doi":"10.1109/hpca51647.2021.00063","title":"Pitstop: Enabling a Virtual Network Free Network-on-Chip","year":2021,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Computer network; Deadlock; Network packet; Network on a chip; Virtual channel; Distributed computing; Network topology; Network interface; Embedded system; Channel (broadcasting)","score_opus":0.018137617048143262,"score_gpt":0.2237215778253241,"score_spread":0.20558396077718083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157297576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063842796,0.0023430104,0.8891892,0.0006143747,0.00071499025,0.00026908476,0.0003566899,0.022377715,0.020292189],"genre_scores_gemma":[0.6824176,0.0015813998,0.2946976,0.001048351,0.00022909242,0.0004217426,0.0011744178,0.0015175756,0.01691223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999206,0.000096663,0.00003672936,0.00009768396,0.00038596787,0.00017707588],"domain_scores_gemma":[0.9990263,0.000178096,0.000108653396,0.00034019907,0.0002562404,0.000090547095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006417099,0.0006444477,0.00041691557,0.00047207487,0.0005623453,0.0011407514,0.0024171234,0.0007570213,0.0056976946],"category_scores_gemma":[0.0015906715,0.00033379486,0.0003852891,0.00043290854,0.0007831312,0.0023740951,0.0021688784,0.0013611134,0.0014142502],"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.0013450466,0.00041359663,0.0028277116,0.0019110896,0.00017341683,0.0013693095,0.0006342934,0.07143334,0.24359962,0.10860726,0.08137551,0.48630977],"study_design_scores_gemma":[0.00031440967,0.0015848981,0.0014300069,0.0002231464,0.0002521082,0.0016570503,0.00016666036,0.4870354,0.24119979,0.033129063,0.23282285,0.00018455874],"about_ca_topic_score_codex":0.0010204269,"about_ca_topic_score_gemma":0.0017555025,"teacher_disagreement_score":0.0056976946,"about_ca_system_score_codex":0.00050103024,"about_ca_system_score_gemma":0.0013711205,"threshold_uncertainty_score":0.019060671},"labels":[],"label_agreement":null},{"id":"W3157591363","doi":"10.1007/pl00007242","title":"On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Series (stratigraphy); Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Series and parallel circuits; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.010195947134003418,"score_gpt":0.1984105735703931,"score_spread":0.18821462643638967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157591363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40170127,0.0018330159,0.5652569,0.0016421963,0.00015481206,0.00007899414,0.00040512573,0.00038580393,0.028541883],"genre_scores_gemma":[0.8920769,0.002736674,0.08914105,0.0003238123,0.000253788,0.00007304049,0.0007664238,0.00020324542,0.0144250905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992988,0.00030626106,0.000030656567,0.00014828275,0.00014063223,0.000075352356],"domain_scores_gemma":[0.99234515,0.0052225576,0.00082194334,0.0007716772,0.00050296,0.00033572756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011905613,0.00087306526,0.0009480651,0.0017016279,0.0009839915,0.0018709529,0.0018248516,0.001864895,0.0051606903],"category_scores_gemma":[0.013855516,0.00090693164,0.0008363592,0.0018891592,0.002787831,0.0040828004,0.0015823367,0.0023559032,0.00047248567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002680454,0.0000753763,0.0013916858,0.0001433838,0.000046897647,0.00018547299,0.00030037484,0.12898582,0.0019580394,0.8313803,0.0025687045,0.032695923],"study_design_scores_gemma":[0.000022875489,0.000035835823,0.0003579661,0.00002974469,0.000019313844,0.00009465544,0.000090189766,0.22843617,0.0008677015,0.76849693,0.0015291855,0.000019423156],"about_ca_topic_score_codex":0.0017997066,"about_ca_topic_score_gemma":0.0016985793,"teacher_disagreement_score":0.0051606903,"about_ca_system_score_codex":0.0008600402,"about_ca_system_score_gemma":0.00044577834,"threshold_uncertainty_score":0.017264247},"labels":[],"label_agreement":null},{"id":"W3163207579","doi":"10.3934/math.2021439","title":"On locally most reliable three-terminal graphs of sparse graphs","year":2021,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Interconnection Networks and 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 Regina","funders":"","keywords":"Combinatorics; Terminal (telecommunication); Mathematics; Graph; Path graph; Discrete mathematics; Line graph; Graph power; Computer science; Telecommunications","score_opus":0.019993223676201904,"score_gpt":0.23643124523374887,"score_spread":0.21643802155754696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163207579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6015294,0.00045240074,0.37962297,0.0006620468,0.000035899026,0.00007139489,0.0004026246,0.0002716221,0.016951581],"genre_scores_gemma":[0.9739721,0.00034218578,0.022355575,0.000090532994,0.000053419157,0.00006381423,0.00037051027,0.000082779756,0.0026691374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994759,0.00020883235,0.000018481072,0.000096397154,0.00012156249,0.00007884952],"domain_scores_gemma":[0.99379796,0.0036267347,0.0010675328,0.0005712354,0.00055178854,0.00038473302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006871,0.0005354982,0.00042845018,0.0012779763,0.0008473223,0.0007755739,0.0007989412,0.00059903803,0.00383938],"category_scores_gemma":[0.0067472938,0.0003142435,0.0004834134,0.00086658064,0.0016704196,0.0016890656,0.0010692867,0.0009720696,0.00041717675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003867109,0.000068409136,0.005853805,0.00033234668,0.00007692561,0.0007375705,0.001079177,0.2494564,0.01685902,0.6885895,0.006824093,0.029736055],"study_design_scores_gemma":[0.000047075053,0.00014941585,0.0030999542,0.00006312785,0.000060480277,0.0006432897,0.00046496163,0.44921404,0.007611653,0.534302,0.0042951778,0.000048783568],"about_ca_topic_score_codex":0.0012460117,"about_ca_topic_score_gemma":0.0017309167,"teacher_disagreement_score":0.00383938,"about_ca_system_score_codex":0.00063626486,"about_ca_system_score_gemma":0.0002960765,"threshold_uncertainty_score":0.0128439665},"labels":[],"label_agreement":null},{"id":"W3168603277","doi":"10.1007/s11227-021-03872-8","title":"Node-to-set disjoint paths problem in cross-cubes","year":2021,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Young Scientists Fund; Qinglan Project of Jiangsu Province of China; Secretário de Ciência, Tecnologia e Ensino Superior, Governo do Estado de Parana; National Natural Science Foundation of China; Ivey Foundation","keywords":"Hypercube; Disjoint sets; Computer science; Node (physics); Set (abstract data type); Multiprocessing; Binary logarithm; Combinatorics; Cube (algebra); Fault tolerance; Discrete mathematics; Algorithm; Parallel computing; Mathematics; Distributed computing","score_opus":0.022393139082332026,"score_gpt":0.27649482505904455,"score_spread":0.2541016859767125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168603277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32190475,0.0026337886,0.61870885,0.010091824,0.00064196676,0.0010686858,0.00529855,0.0010319977,0.038619574],"genre_scores_gemma":[0.7044485,0.0023294203,0.26081434,0.0011736463,0.00054772734,0.0008020902,0.0049206126,0.0006270051,0.02433677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790996,0.0008469324,0.00012321037,0.0004467751,0.00035048256,0.0003226322],"domain_scores_gemma":[0.98823327,0.008998029,0.00069536455,0.0006596856,0.0005929715,0.0008206687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003265608,0.0018785371,0.0030435203,0.0013247979,0.0021218867,0.004356901,0.004300184,0.004602382,0.013889004],"category_scores_gemma":[0.017238254,0.0014793222,0.0016666704,0.0029384422,0.0019830556,0.008134605,0.004852704,0.0031139704,0.001124517],"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.0009544482,0.00044115013,0.0013058046,0.00086271466,0.00026244196,0.00044637817,0.00045957003,0.7772909,0.0016747629,0.14048968,0.021869082,0.053943112],"study_design_scores_gemma":[0.00022620706,0.00021573306,0.00035101088,0.00008577979,0.000076068034,0.00018997675,0.0004815788,0.76520467,0.0013277367,0.22769444,0.004116321,0.00003044583],"about_ca_topic_score_codex":0.005098723,"about_ca_topic_score_gemma":0.003997422,"teacher_disagreement_score":0.013889004,"about_ca_system_score_codex":0.0018944398,"about_ca_system_score_gemma":0.0026933646,"threshold_uncertainty_score":0.04646337},"labels":[],"label_agreement":null},{"id":"W3180604166","doi":"10.1007/978-3-030-83823-2_134","title":"A Rainbow Connectivity Threshold for Random Graph Families","year":2021,"lang":"en","type":"book-chapter","venue":"Trends in mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Rainbow; Vertex (graph theory); Mathematics; Graph; Connectivity; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.044366666820302665,"score_gpt":0.2733452173151141,"score_spread":0.22897855049481142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180604166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19803852,0.008022967,0.40061623,0.0071771573,0.0012080917,0.00015929529,0.0009902606,0.0017941474,0.38199338],"genre_scores_gemma":[0.8749286,0.004131924,0.056034792,0.0011698098,0.00082297454,0.0002222064,0.0004434321,0.0005547772,0.06169154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943286,0.00009152261,0.000024419616,0.00015832402,0.00020382769,0.00008900064],"domain_scores_gemma":[0.9971915,0.0017269328,0.00017473433,0.00034919014,0.0002775227,0.00028005516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885957,0.0003796197,0.0008133747,0.0017809574,0.0010504049,0.0021757155,0.0013170406,0.0015313668,0.010049408],"category_scores_gemma":[0.0065605748,0.00051026716,0.00059256394,0.0013272833,0.0018708265,0.00510706,0.0016395163,0.002788377,0.0010467741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029094164,0.000014214186,0.00015596535,0.00007389968,0.000006177833,0.000058247875,0.000088560366,0.003280181,0.0017275533,0.9759301,0.0067202165,0.011915714],"study_design_scores_gemma":[0.0000073002407,0.000014104687,0.0001929454,0.000029712251,0.000007333959,0.0001789187,0.00003948182,0.01706027,0.00075094006,0.9767001,0.0050080623,0.000010767121],"about_ca_topic_score_codex":0.0006056383,"about_ca_topic_score_gemma":0.00050011417,"teacher_disagreement_score":0.010049408,"about_ca_system_score_codex":0.0015190156,"about_ca_system_score_gemma":0.00053754734,"threshold_uncertainty_score":0.03361863},"labels":[],"label_agreement":null},{"id":"W3193374719","doi":"","title":"The maximum average connectivity among all orientations of a graph","year":2021,"lang":"en","type":"article","venue":"idUS (Universidad de Sevilla)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Connectivity; Discrete mathematics; Kappa; Upper and lower bounds; Geometry","score_opus":0.010826146431926576,"score_gpt":0.23425405545189246,"score_spread":0.22342790901996587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193374719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89143944,0.0013096569,0.08020678,0.0007105025,0.00012213219,0.000053843454,0.003235783,0.0004946802,0.02242724],"genre_scores_gemma":[0.9783117,0.0006064134,0.016618256,0.00006457832,0.00014353558,0.000095048636,0.001738087,0.00010855247,0.0023137662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993382,0.00017133243,0.0000375589,0.00022757401,0.000111059846,0.000114329516],"domain_scores_gemma":[0.9961289,0.0023937204,0.0004633001,0.00025170314,0.000361263,0.0004010029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043343563,0.0006648828,0.0006749163,0.0033869494,0.0009476525,0.0020007142,0.00094676524,0.00072601205,0.0040942654],"category_scores_gemma":[0.004831131,0.00035350025,0.0005288749,0.002296502,0.00067770656,0.0019375669,0.0006178242,0.00048501528,0.0004282993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020232445,0.00037703614,0.045912046,0.0019829916,0.0006154045,0.0012182663,0.0013763421,0.23326513,0.07817138,0.33176166,0.024174249,0.27912232],"study_design_scores_gemma":[0.00015083203,0.00070894,0.063379064,0.00025865022,0.00052082853,0.0026476479,0.0010939029,0.456418,0.026314143,0.42846,0.01990571,0.00014226252],"about_ca_topic_score_codex":0.0012578095,"about_ca_topic_score_gemma":0.0018872909,"teacher_disagreement_score":0.0040942654,"about_ca_system_score_codex":0.0007298966,"about_ca_system_score_gemma":0.0005149988,"threshold_uncertainty_score":0.01369673},"labels":[],"label_agreement":null},{"id":"W3194448140","doi":"10.32920/ryerson.14649366.v1","title":"Multi-objective Tabu search based topology synthesis for designing power and performance efficient NoC architectures","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Tabu search; Network on a chip; Multiprocessing; Network topology; Deadlock; Power (physics); Distributed computing; Topology (electrical circuits); Throughput; Parallel computing; Computer engineering; Computer architecture; Embedded system; Engineering; Algorithm; Computer network","score_opus":0.02736512991449894,"score_gpt":0.2689134646960383,"score_spread":0.24154833478153934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194448140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07226162,0.0008418901,0.9197563,0.00013889109,0.000044472425,0.00023371367,0.00014537043,0.00070010807,0.00587759],"genre_scores_gemma":[0.32380223,0.0004610911,0.6727436,0.00007741738,0.000016944727,0.0005495584,0.0003255425,0.00016579857,0.0018578427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996158,0.00021208229,0.000015386988,0.000042447573,0.00007874528,0.000035509256],"domain_scores_gemma":[0.99924564,0.00051632285,0.00007012945,0.00004141538,0.00011042395,0.000016061833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231877,0.0007562188,0.0006016917,0.0011164151,0.00037407887,0.0006438043,0.000740064,0.00064402807,0.0023210603],"category_scores_gemma":[0.0024185244,0.00037912137,0.0006718445,0.0009332991,0.00038474367,0.0005072174,0.00041115866,0.00054183294,0.00032139762],"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.000029884606,0.000036004632,0.00038556985,0.00011578717,0.000032018757,0.00003057131,0.000047924277,0.9506028,0.002721248,0.0033895914,0.00040016483,0.042208362],"study_design_scores_gemma":[0.000010460474,0.000031208845,0.00007557487,0.0000095216,0.0000067251885,0.000009432837,0.000016240203,0.9972632,0.0010729183,0.0010921911,0.00040973496,0.0000028766992],"about_ca_topic_score_codex":0.0018658744,"about_ca_topic_score_gemma":0.0023702697,"teacher_disagreement_score":0.0023210603,"about_ca_system_score_codex":0.0005691091,"about_ca_system_score_gemma":0.0011167098,"threshold_uncertainty_score":0.0077647567},"labels":[],"label_agreement":null},{"id":"W3197968463","doi":"10.32920/ryerson.14662287.v1","title":"Network-On-Chip Topology Generation and Analysis For Transaction-Based Systems-on-Chip","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Computer science; Chip; Network on a chip; Latency (audio); System on a chip; Database transaction; Topology (electrical circuits); Computer network; Distributed computing; Embedded system; Engineering; Telecommunications; Electrical engineering","score_opus":0.045674681322314614,"score_gpt":0.26685052895338,"score_spread":0.2211758476310654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197968463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026871175,0.00022694284,0.96919125,0.00009035818,0.00003528691,0.000071854636,0.0001289858,0.0012263677,0.0021577699],"genre_scores_gemma":[0.62180907,0.00068986515,0.37298146,0.000053022704,0.000029212413,0.00028407914,0.00068633107,0.00035284495,0.0031140745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.00009597908,0.000014301871,0.000028974287,0.00018637306,0.000020710211],"domain_scores_gemma":[0.9990895,0.00033842234,0.00006316905,0.00019041049,0.0002965253,0.000021999846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042596742,0.0004212423,0.0003138707,0.00089476054,0.00032660854,0.00066218065,0.00054644834,0.0003057926,0.0024044595],"category_scores_gemma":[0.0026559164,0.00023697845,0.0002754348,0.00068305567,0.00026983756,0.0008019113,0.00030967407,0.0005563349,0.00043323298],"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.000055249493,0.000042463344,0.0016435804,0.00010747454,0.000034900688,0.00008626462,0.000068023655,0.8323028,0.017177975,0.022264607,0.0025257303,0.12369087],"study_design_scores_gemma":[0.000002696439,0.00001364428,0.00021866731,0.0000038060386,0.00000326615,0.000020900361,0.000011508279,0.991091,0.003995496,0.0032912132,0.00134334,0.0000045012603],"about_ca_topic_score_codex":0.0018933673,"about_ca_topic_score_gemma":0.0020261565,"teacher_disagreement_score":0.0024044595,"about_ca_system_score_codex":0.00067689613,"about_ca_system_score_gemma":0.000647137,"threshold_uncertainty_score":0.008043706},"labels":[],"label_agreement":null},{"id":"W3198611431","doi":"10.32920/ryerson.14663889.v1","title":"Virtual channel organization and arbitration for network on chip router architecure","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Arbiter; Arbitration; Computer science; Router; Network on a chip; Virtual channel; Port (circuit theory); Network packet; Computer network; Channel (broadcasting); Chip; One-armed router; Embedded system; Distributed computing; Engineering; Telecommunications","score_opus":0.01659932575669573,"score_gpt":0.22748735696403755,"score_spread":0.21088803120734181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198611431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050074805,0.0032330228,0.93020856,0.0005650741,0.00031542848,0.000141804,0.000053268774,0.0019520527,0.013456004],"genre_scores_gemma":[0.7626027,0.0012610537,0.22760355,0.0002947887,0.00013938211,0.0002451265,0.0001401015,0.000097194585,0.007616141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.00014174926,0.000031330608,0.000084582,0.00013845468,0.00008485597],"domain_scores_gemma":[0.99965525,0.000092561226,0.00004986808,0.000079835845,0.00009741857,0.000025209349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821297,0.00026508217,0.00027793553,0.00037193854,0.0004762752,0.0010033757,0.0010948057,0.0004892257,0.0016542161],"category_scores_gemma":[0.0009866792,0.0001544445,0.00021376829,0.00032061327,0.00043250032,0.0008352467,0.0005408605,0.0005586479,0.00027713194],"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.00039815527,0.00019225277,0.0023530493,0.00036658804,0.000074724674,0.0002817956,0.00027501723,0.21087646,0.090457454,0.3018286,0.010301125,0.38259476],"study_design_scores_gemma":[0.00003066785,0.0001898215,0.00042375046,0.000028400802,0.000043494707,0.00019185513,0.000036336613,0.9183522,0.025781864,0.02475927,0.030128034,0.00003435154],"about_ca_topic_score_codex":0.0010037955,"about_ca_topic_score_gemma":0.0016535203,"teacher_disagreement_score":0.0016542161,"about_ca_system_score_codex":0.00062824995,"about_ca_system_score_gemma":0.0008558647,"threshold_uncertainty_score":0.005533874},"labels":[],"label_agreement":null},{"id":"W3198758847","doi":"10.32920/ryerson.14654766.v1","title":"Power and chip-area aware network-on-chip simulation","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"SystemC; MPSoC; Network on a chip; Computer science; Embedded system; Computer architecture; Chip; System on a chip; Code (set theory); Power (physics); Power network design; Telecommunications","score_opus":0.02606783814072352,"score_gpt":0.26009752911037176,"score_spread":0.23402969096964824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198758847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111105114,0.00093043904,0.84333223,0.0005070422,0.00015134313,0.00018168279,0.0011171455,0.0017750348,0.040900003],"genre_scores_gemma":[0.79656917,0.0011818022,0.18564841,0.00019821637,0.00004594983,0.0005272934,0.000891713,0.0003510033,0.014586458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.000085531196,0.00000917821,0.000030594827,0.00008939741,0.000032863918],"domain_scores_gemma":[0.99952817,0.00027891973,0.000030821986,0.00005671529,0.00009115876,0.000014251282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029141756,0.00045727275,0.00043560672,0.00038104356,0.00029865836,0.000517806,0.00094253605,0.0006542635,0.003243419],"category_scores_gemma":[0.0013529222,0.00030866513,0.00047253387,0.0005346967,0.00032624693,0.0006010787,0.00041297407,0.00054281193,0.00036795594],"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.0000063537886,0.000008027256,0.00015479854,0.000017824845,0.0000058265177,0.0000104741075,0.000007334616,0.993682,0.00067192287,0.0031078097,0.0002598177,0.002067774],"study_design_scores_gemma":[0.0000022417607,0.0000051637635,0.000046551635,0.0000018747055,0.0000022082247,0.0000034132995,0.0000019090737,0.99799216,0.00043409396,0.000809242,0.00069968274,0.0000014341756],"about_ca_topic_score_codex":0.005609278,"about_ca_topic_score_gemma":0.0049915896,"teacher_disagreement_score":0.005609278,"about_ca_system_score_codex":0.00065110717,"about_ca_system_score_gemma":0.00086471695,"threshold_uncertainty_score":0.011153221},"labels":[],"label_agreement":null},{"id":"W3201276541","doi":"10.1016/j.tcs.2021.08.025","title":"Symmetric PMC model of diagnosis, b-matchings in graphs and fault identification in t-diagnosable systems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Bipartite graph; Hypercube; Matching (statistics); Combinatorics; Algorithm; Graph theory; Computer science; Identification (biology); Mathematics; Graph; Discrete mathematics; Statistics","score_opus":0.013057115727586714,"score_gpt":0.24194940384525296,"score_spread":0.22889228811766624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201276541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12390786,0.00030253196,0.8619658,0.0010224276,0.00010389717,0.00011154056,0.0004502868,0.00043501475,0.011700751],"genre_scores_gemma":[0.9600451,0.00021466377,0.032484118,0.00019317721,0.00007595638,0.00010080719,0.00020667652,0.000056848454,0.006622611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989404,0.00025823826,0.000056637033,0.0003357514,0.0002380491,0.00017085003],"domain_scores_gemma":[0.996482,0.0017162922,0.00062650954,0.0004515545,0.0005206374,0.00020293903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011114056,0.00059085595,0.0010096744,0.0010959848,0.0007481039,0.0020016695,0.0017394521,0.0019404135,0.005147429],"category_scores_gemma":[0.0061529195,0.00053284655,0.0008712328,0.0012017362,0.0015724777,0.003195624,0.0013332118,0.0014963142,0.000525984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026103377,0.000107277614,0.0011295725,0.00015285893,0.00006349439,0.0006713441,0.00027286468,0.19205633,0.005414293,0.782399,0.0018258624,0.015646106],"study_design_scores_gemma":[0.00003770151,0.000039043338,0.00022581742,0.0000106835105,0.000021577169,0.00017699985,0.000054208584,0.5911996,0.00097027415,0.40660673,0.00064544077,0.0000118485295],"about_ca_topic_score_codex":0.0043856977,"about_ca_topic_score_gemma":0.0022799238,"teacher_disagreement_score":0.005147429,"about_ca_system_score_codex":0.0015011408,"about_ca_system_score_gemma":0.0016634903,"threshold_uncertainty_score":0.017219841},"labels":[],"label_agreement":null},{"id":"W3203464045","doi":"10.1145/3479876.3481593","title":"Worst-case latency analysis for the versal NoC network packet switch","year":2021,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Computer science; Network packet; Latency (audio); Field-programmable gate array; Embedded system; Network on a chip; Scheduling (production processes); Automotive industry; Computer network; Engineering","score_opus":0.026691070717321953,"score_gpt":0.2524296847741498,"score_spread":0.22573861405682782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203464045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.401736,0.0018844429,0.5649937,0.00053139817,0.00009762073,0.000104474886,0.000939393,0.0011867936,0.028526269],"genre_scores_gemma":[0.96776193,0.00046270402,0.02897776,0.00006296937,0.00003360705,0.00006137088,0.0003142691,0.00014074807,0.0021845347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992525,0.00014821098,0.00002822582,0.00008921451,0.00027901572,0.00020288392],"domain_scores_gemma":[0.9985077,0.0009290871,0.00018455961,0.00011836803,0.00021950903,0.000040762265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010009034,0.00080325425,0.0002970862,0.0010527205,0.00046181868,0.00079117296,0.00087769906,0.00036766106,0.0023015004],"category_scores_gemma":[0.0032820283,0.00026900347,0.00040161159,0.0008583365,0.0005456991,0.00086234394,0.0004118575,0.00052575447,0.0002421003],"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.00006555059,0.000024286815,0.0010743316,0.000052878586,0.000012164138,0.00008233443,0.000032622847,0.97881776,0.00434473,0.0081913555,0.00070502696,0.006596932],"study_design_scores_gemma":[0.0000015286108,0.000015446403,0.00016237408,0.0000029982052,0.0000027668004,0.000019549876,0.00001027262,0.9975961,0.0009323799,0.0009794662,0.00027415593,0.000003025163],"about_ca_topic_score_codex":0.0053614727,"about_ca_topic_score_gemma":0.005468813,"teacher_disagreement_score":0.0053614727,"about_ca_system_score_codex":0.0018470918,"about_ca_system_score_gemma":0.0010732777,"threshold_uncertainty_score":0.013401628},"labels":[],"label_agreement":null},{"id":"W3205689090","doi":"","title":"A complexity-based classification for multiprocessor synchronization","year":2019,"lang":"en","type":"book-chapter","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Computability; Hierarchy; Synchronization (alternating current); Multiprocessing; Theoretical computer science; Parallel computing","score_opus":0.041828068883024094,"score_gpt":0.2598741923951574,"score_spread":0.21804612351213332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205689090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025144938,0.005505123,0.91505957,0.0017956081,0.0009589334,0.00025029707,0.0008315505,0.001402679,0.049051356],"genre_scores_gemma":[0.33756435,0.0054400167,0.59766054,0.00080458797,0.002738827,0.000559557,0.0044540586,0.00088209496,0.04989594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988023,0.00012834636,0.00011606457,0.00023450606,0.0005820982,0.00013664445],"domain_scores_gemma":[0.9973949,0.0011015303,0.00021117827,0.00049524236,0.0005979944,0.00019915019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008738405,0.0012157278,0.00094970514,0.0039183265,0.0011602129,0.0029482911,0.0019145976,0.0013204726,0.008906955],"category_scores_gemma":[0.0054789027,0.00040059615,0.0015119337,0.0035894897,0.0015553996,0.0055458657,0.0021508734,0.0029163975,0.0034991298],"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.00021488334,0.00012830891,0.0030825199,0.00037812907,0.000044643042,0.00016096293,0.000308781,0.028932342,0.010283977,0.42575446,0.036802497,0.49390855],"study_design_scores_gemma":[0.000029668898,0.00022344134,0.0038144607,0.00015267864,0.000049009737,0.0006341996,0.00023389423,0.40331718,0.004824191,0.5280078,0.058631368,0.0000820945],"about_ca_topic_score_codex":0.0016622704,"about_ca_topic_score_gemma":0.0014718019,"teacher_disagreement_score":0.008906955,"about_ca_system_score_codex":0.0018042326,"about_ca_system_score_gemma":0.00093494164,"threshold_uncertainty_score":0.02979678},"labels":[],"label_agreement":null},{"id":"W3209181774","doi":"10.1007/978-3-030-87136-9_5","title":"Dynamic VNF Scheduling for Network Utility Maximization","year":2021,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Granularity; Network packet; Distributed computing; Generalized processor sharing; Maximization; Quality of service; Computer network; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling; Mathematics","score_opus":0.018264677362451753,"score_gpt":0.23181113349051624,"score_spread":0.2135464561280645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209181774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037707502,0.007645866,0.89468724,0.00068410835,0.0013269401,0.000041573254,0.00020927376,0.00067241373,0.09096194],"genre_scores_gemma":[0.2761108,0.020035865,0.47380573,0.0007757158,0.0022983975,0.0002741728,0.0010408377,0.0014322293,0.22422622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998311,0.00004032699,0.000004224111,0.000028408349,0.000071151415,0.000024869298],"domain_scores_gemma":[0.99986804,0.000070675764,0.0000071923096,0.000020785812,0.000024969415,0.000008480941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032060163,0.0009221833,0.0006058718,0.00037036964,0.0003150306,0.00076669373,0.0009700006,0.00049360807,0.010051714],"category_scores_gemma":[0.00073887163,0.0002760626,0.000270539,0.0013445029,0.00029180988,0.0009823692,0.0004512975,0.0013634735,0.002200845],"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.000067806934,0.00006755025,0.000055959965,0.0002204982,0.000022724547,0.000054281518,0.000044201613,0.2738689,0.0041744797,0.18502407,0.07748232,0.45891726],"study_design_scores_gemma":[0.000015008765,0.000050783878,0.0001822754,0.00008057195,0.000012240081,0.00015475311,0.000023290497,0.6689411,0.002102681,0.21428989,0.11412849,0.000018843099],"about_ca_topic_score_codex":0.0015288936,"about_ca_topic_score_gemma":0.0028507742,"teacher_disagreement_score":0.010051714,"about_ca_system_score_codex":0.0010348364,"about_ca_system_score_gemma":0.00054833706,"threshold_uncertainty_score":0.033626378},"labels":[],"label_agreement":null},{"id":"W3209605964","doi":"10.1145/3458817.3476140","title":"SEEC: stochastic escape express channel","year":2021,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","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":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Network packet; Router; Deadlock; Throughput; Traverse; Distributed computing; Operating system; Wireless","score_opus":0.07337362606211412,"score_gpt":0.30175775577060376,"score_spread":0.22838412970848965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209605964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115571946,0.0008621716,0.8010527,0.00086131203,0.0009170131,0.00057794986,0.0018022178,0.02987535,0.048479263],"genre_scores_gemma":[0.81564057,0.000530486,0.14654762,0.0009968682,0.00018967698,0.0006521282,0.0024544,0.00149143,0.031496827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.00008711933,0.00003205675,0.00009669486,0.0003494153,0.00022536132],"domain_scores_gemma":[0.99885285,0.00026511739,0.00011244935,0.00024517011,0.00038408063,0.00014034616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059498526,0.0005691447,0.00039762817,0.0005510647,0.00062904623,0.001205639,0.0016184427,0.00055506814,0.008161207],"category_scores_gemma":[0.0013720779,0.00022736656,0.00032455652,0.00047280735,0.0007929633,0.001032776,0.0014305143,0.0012209057,0.001529484],"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.0021044316,0.0008022616,0.0059557846,0.0005764735,0.00012561181,0.0009823381,0.0003493682,0.28498217,0.13905676,0.1430387,0.12449184,0.29753423],"study_design_scores_gemma":[0.00024319837,0.0005816332,0.0006866555,0.00005040833,0.000044083146,0.00046618955,0.00006257417,0.830868,0.06834567,0.014715144,0.08380902,0.0001273766],"about_ca_topic_score_codex":0.003281451,"about_ca_topic_score_gemma":0.0059164483,"teacher_disagreement_score":0.008161207,"about_ca_system_score_codex":0.00088908407,"about_ca_system_score_gemma":0.0022942044,"threshold_uncertainty_score":0.027301967},"labels":[],"label_agreement":null},{"id":"W3210183637","doi":"10.32920/ryerson.14656014.v1","title":"Application mapping and NoC configuration using hybrid particle swarm optimization","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Particle swarm optimization; Tabu search; Computer science; Swarm behaviour; Multi-swarm optimization; Metaheuristic; Mathematical optimization; Latency (audio); Network on a chip; Parallel computing; Algorithm; Distributed computing; Mathematics; Embedded system; Artificial intelligence","score_opus":0.03173156922379412,"score_gpt":0.24909018482808015,"score_spread":0.21735861560428604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210183637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10463881,0.00024929194,0.8901599,0.00018087772,0.000051174935,0.00012669868,0.00005914025,0.0004656117,0.004068445],"genre_scores_gemma":[0.79079914,0.00013468091,0.20632774,0.00007275558,0.000026607138,0.00025139115,0.00013055888,0.00006302527,0.0021941483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00013285001,0.000017769336,0.0000532524,0.00010621708,0.00004108274],"domain_scores_gemma":[0.99941325,0.00033676147,0.00007930399,0.00005986938,0.000081911,0.000028865947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079307024,0.0007435941,0.000720893,0.00063143537,0.00042458012,0.0006945911,0.00074223126,0.0007142509,0.000905459],"category_scores_gemma":[0.0016070649,0.0004132775,0.0005801611,0.00060911104,0.0005271595,0.0005149164,0.0006837812,0.0004498848,0.00011563021],"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.000023490049,0.000020686644,0.00033291202,0.00001552624,0.000021780463,0.000015369902,0.00001703288,0.98585504,0.000967681,0.0012084874,0.0001619446,0.0113600595],"study_design_scores_gemma":[0.0000060176917,0.000014060695,0.00006395584,0.0000010339068,0.0000027208139,0.000003822773,0.000003589875,0.99923694,0.00021183639,0.00036598014,0.000088647175,0.000001354441],"about_ca_topic_score_codex":0.004205915,"about_ca_topic_score_gemma":0.0035369147,"teacher_disagreement_score":0.004205915,"about_ca_system_score_codex":0.00065904,"about_ca_system_score_gemma":0.0007800136,"threshold_uncertainty_score":0.008362889},"labels":[],"label_agreement":null},{"id":"W3213111701","doi":"10.32920/ryerson.14645025.v1","title":"Congestion aware adaptive routing for network-on-chip communication","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Latency (audio); Header; Network congestion; Network packet; Network on a chip; Routing (electronic design automation); Throughput; Wireless; Telecommunications","score_opus":0.05430929928577852,"score_gpt":0.2793790470994055,"score_spread":0.22506974781362696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213111701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026196653,0.007311905,0.9580214,0.0007092316,0.0004915166,0.00010207384,0.00005788872,0.0009663361,0.0061429185],"genre_scores_gemma":[0.6991677,0.009040837,0.28106657,0.00027389236,0.00045581977,0.00019683152,0.00024911467,0.00026281507,0.009286427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.000064136584,0.000012960091,0.000054794615,0.00010784592,0.0000236897],"domain_scores_gemma":[0.9997056,0.00012572679,0.000037241123,0.000051119543,0.000067345485,0.000012946288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041115045,0.00036969993,0.0002706791,0.00043015648,0.0003092292,0.0006267076,0.00050676224,0.00042824663,0.0012131429],"category_scores_gemma":[0.0012853146,0.00021928141,0.00025130584,0.0005681767,0.00034344845,0.0007623978,0.00035818334,0.00072184653,0.00023768876],"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.000096544885,0.00009156059,0.0010335973,0.0004305491,0.00009782165,0.00019202926,0.00013110971,0.43193287,0.05362773,0.18809326,0.010400464,0.31387243],"study_design_scores_gemma":[0.000012017111,0.00006123086,0.00044896294,0.000025694193,0.000027359283,0.00009998691,0.000016328782,0.9436277,0.007476567,0.035735875,0.012445792,0.000022426031],"about_ca_topic_score_codex":0.0010066997,"about_ca_topic_score_gemma":0.0011207055,"teacher_disagreement_score":0.0012131429,"about_ca_system_score_codex":0.0006115729,"about_ca_system_score_gemma":0.0005514412,"threshold_uncertainty_score":0.004437268},"labels":[],"label_agreement":null},{"id":"W355903526","doi":"","title":"SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, August 10-13, 2002, Winnipeg, Manitoba, Canada","year":2002,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; History","score_opus":0.014240313027036187,"score_gpt":0.2125394869319179,"score_spread":0.19829917390488172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W355903526","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012889183,0.03873247,0.22657776,0.011723754,0.041308947,0.0012701111,0.019215224,0.046179622,0.60210294],"genre_scores_gemma":[0.007048189,0.01643355,0.033937525,0.00071774895,0.0012531714,0.00014745921,0.0120999785,0.0031326,0.92522967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999587,0.000033679204,0.000019575,0.00006395568,0.00023111545,0.00006471049],"domain_scores_gemma":[0.9985141,0.00011141714,0.000027311626,0.00016599648,0.0008891102,0.00029219492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002055,0.00217313,0.0020030274,0.001383265,0.001571074,0.0053076893,0.0020493027,0.0010623721,0.18478912],"category_scores_gemma":[0.0018618947,0.0009111827,0.00062447175,0.0029001874,0.0005752139,0.0023722718,0.0013317468,0.0023672138,0.16602428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008772074,0.00005445458,0.00020576498,0.00012268347,0.000014974868,0.000040499486,0.000041191633,0.0006062121,0.0010941318,0.0022508847,0.8750928,0.12038869],"study_design_scores_gemma":[0.00006560171,0.000045242195,0.0010738787,0.00010883583,0.00004137649,0.00015750513,0.00006805624,0.0067321537,0.0012983325,0.003473037,0.9869148,0.000021237578],"about_ca_topic_score_codex":0.048336685,"about_ca_topic_score_gemma":0.14512242,"teacher_disagreement_score":0.9516633,"about_ca_system_score_codex":0.0017229748,"about_ca_system_score_gemma":0.0053041764,"threshold_uncertainty_score":0.6181812},"labels":[],"label_agreement":null},{"id":"W39796434","doi":"","title":"Efficient heuristics for message dissemination in networks","year":2007,"lang":"en","type":"article","venue":"Parallel and distributed computing and 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":"Concordia University","funders":"","keywords":"Heuristics; Computer science; Heuristic; Gossip; Broadcasting (networking); Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.009029404762501544,"score_gpt":0.2602048136757128,"score_spread":0.2511754089132113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39796434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01123217,0.0010553418,0.98160326,0.00024121343,0.00009765936,0.0003481984,0.00015368707,0.0011388212,0.004129646],"genre_scores_gemma":[0.18289088,0.0011404894,0.81110376,0.00014611133,0.00009367003,0.00062830886,0.0006265643,0.00030900488,0.003061241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998131,0.0008745107,0.0001138137,0.00021575873,0.0003677211,0.00029719045],"domain_scores_gemma":[0.99526054,0.003519989,0.00023721812,0.00050047436,0.00033459847,0.00014732523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002433876,0.0014963192,0.0014988554,0.0018469046,0.0014584895,0.0017992681,0.002149839,0.0017745704,0.0033338508],"category_scores_gemma":[0.00892787,0.00085466803,0.0008799411,0.0023129035,0.0010478821,0.0026236412,0.0016761723,0.001355942,0.0010333562],"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.00027205487,0.00017323677,0.0005515938,0.0004945195,0.00009806424,0.00018365037,0.0004173444,0.7013044,0.0046586087,0.074683934,0.011104725,0.20605792],"study_design_scores_gemma":[0.00026595988,0.00010458007,0.0001719475,0.000063879575,0.00007215993,0.00012949172,0.0001591163,0.8669407,0.004812734,0.11214048,0.015093426,0.00004554904],"about_ca_topic_score_codex":0.00243172,"about_ca_topic_score_gemma":0.0030157808,"teacher_disagreement_score":0.0033338508,"about_ca_system_score_codex":0.0020129948,"about_ca_system_score_gemma":0.0019466626,"threshold_uncertainty_score":0.014605403},"labels":[],"label_agreement":null},{"id":"W4206978675","doi":"10.1007/978-3-030-95018-7_24","title":"Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Time complexity; Butterfly graph; Vertex (graph theory); Algorithm; Discrete mathematics; Graph; Theoretical computer science; Combinatorics; Line graph; Voltage graph; Mathematics","score_opus":0.010894208617090121,"score_gpt":0.20614941249938376,"score_spread":0.19525520388229364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206978675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092893586,0.0057357713,0.85235053,0.00536837,0.0007081435,0.0002849357,0.0018612437,0.0044151684,0.036382247],"genre_scores_gemma":[0.47355786,0.0037110632,0.49137312,0.001044565,0.0009980707,0.0004710366,0.0037444127,0.0017566773,0.023343157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970469,0.0007204496,0.00013512341,0.0008667306,0.00056192215,0.0006688396],"domain_scores_gemma":[0.98277515,0.012063636,0.0007373699,0.0030883846,0.0007246024,0.00061082735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031203702,0.0024735653,0.00274986,0.0019846465,0.0023316203,0.0055654077,0.0070763817,0.0036781018,0.009777632],"category_scores_gemma":[0.017777625,0.0016151182,0.0025518504,0.0058728363,0.0020496722,0.010678312,0.0029695483,0.0058200923,0.0026507806],"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.0027325586,0.00086930016,0.0023369603,0.001163124,0.00033376715,0.00020537848,0.00085002696,0.48310676,0.0041190847,0.18713771,0.053757094,0.2633882],"study_design_scores_gemma":[0.00027364888,0.000112448026,0.00046061323,0.000096512114,0.00014971574,0.00017971541,0.00020515769,0.7204393,0.0025846316,0.27047896,0.004987515,0.000031747986],"about_ca_topic_score_codex":0.0072430386,"about_ca_topic_score_gemma":0.01080653,"teacher_disagreement_score":0.009777632,"about_ca_system_score_codex":0.0064171236,"about_ca_system_score_gemma":0.0048423526,"threshold_uncertainty_score":0.04655975},"labels":[],"label_agreement":null},{"id":"W4210456298","doi":"10.1016/bs.adcom.2021.11.013","title":"Power-gating in NoCs","year":2022,"lang":"en","type":"book-chapter","venue":"Advances in computers","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Alfred P. Sloan Foundation","keywords":"Power gating; Computer science; Provisioning; Pace; Embedded system; Network on a chip; Chip; Power (physics); Power consumption; Gating; Power budget; Computer network; Computer architecture; Telecommunications; Engineering; Electrical engineering; Transistor; Switched-mode power supply","score_opus":0.010897071500097612,"score_gpt":0.24206328616661435,"score_spread":0.23116621466651674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210456298","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016985426,0.09202733,0.30651212,0.0018442833,0.0051202257,0.00012262113,0.0003499496,0.002269004,0.57476914],"genre_scores_gemma":[0.19035861,0.09607377,0.103422605,0.0014354696,0.0013341319,0.00018401348,0.0007620705,0.0009437969,0.6054855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999318,0.000008428378,0.0000028603297,0.000013143996,0.00003140318,0.000012435743],"domain_scores_gemma":[0.9999262,0.00002954806,0.000004749032,0.000013225755,0.000019569117,0.000006659809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011862079,0.0004944618,0.00026735076,0.0003357433,0.0002553889,0.00073712086,0.00059941504,0.0003501601,0.0139657995],"category_scores_gemma":[0.00029321483,0.00027809036,0.00021020131,0.0008068429,0.00025347155,0.00087842566,0.000511796,0.00073031365,0.002482311],"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.00005926953,0.000080549224,0.00015419039,0.00090624584,0.000024292938,0.00017048483,0.0001254353,0.029611276,0.023746116,0.23087873,0.07901771,0.63522565],"study_design_scores_gemma":[0.000014312873,0.00012787791,0.00043384358,0.00041638085,0.000035467227,0.0005769763,0.00006295256,0.047524586,0.013216765,0.14045656,0.7971107,0.000023670558],"about_ca_topic_score_codex":0.00036519466,"about_ca_topic_score_gemma":0.0009954467,"teacher_disagreement_score":0.0139657995,"about_ca_system_score_codex":0.0003176662,"about_ca_system_score_gemma":0.0002879479,"threshold_uncertainty_score":0.046720207},"labels":[],"label_agreement":null},{"id":"W4210619295","doi":"10.1142/s0219265921420172","title":"A Note on Linearly Many Faults of Interconnection Networks","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Interconnection; Computer science; Vulnerability (computing); Measure (data warehouse); Graph; Theoretical computer science; Distributed computing; Topology (electrical circuits); Mathematics; Computer network; Combinatorics; Data mining; Computer security","score_opus":0.011292947896288664,"score_gpt":0.24226947289312595,"score_spread":0.2309765249968373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210619295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06322236,0.048394047,0.44258213,0.07550683,0.116731964,0.00013412152,0.0014675101,0.0012044088,0.25075656],"genre_scores_gemma":[0.53769255,0.053984676,0.12252291,0.019310724,0.11125687,0.0001899884,0.00090419233,0.0010169555,0.15312113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966466,0.000092161055,0.000021862881,0.000072183124,0.000119708086,0.000029465153],"domain_scores_gemma":[0.9979962,0.0014273422,0.000087090935,0.0001575702,0.00023758992,0.000094236835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049674354,0.0008393252,0.00049804075,0.0007984678,0.0011950759,0.0013313688,0.0008365151,0.0007120588,0.006915342],"category_scores_gemma":[0.003333699,0.00022188366,0.00083644217,0.0012389519,0.0013127708,0.0031789294,0.0008416244,0.0037439386,0.0014763963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002542615,0.000107406515,0.0012083342,0.0006354756,0.00007204574,0.001770374,0.00037279635,0.02071841,0.01172606,0.62017477,0.22573443,0.117225654],"study_design_scores_gemma":[0.000021723272,0.000197097,0.0017156835,0.00012262787,0.000059297436,0.000583657,0.0001319597,0.025712928,0.0027748002,0.76219565,0.20642923,0.000055307297],"about_ca_topic_score_codex":0.0024482359,"about_ca_topic_score_gemma":0.0022685672,"teacher_disagreement_score":0.006915342,"about_ca_system_score_codex":0.00075387745,"about_ca_system_score_gemma":0.0004158948,"threshold_uncertainty_score":0.023134112},"labels":[],"label_agreement":null},{"id":"W4210984760","doi":"10.2200/s00772ed1v01y201704cac040","title":"On-chip networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":40,"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; Chip; Architecture; Computer architecture; Software engineering; Telecommunications; Art; Visual arts","score_opus":0.02213840267945066,"score_gpt":0.254470202908354,"score_spread":0.23233180022890332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210984760","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003281054,0.081318624,0.14764874,0.008415792,0.032876164,0.0005366415,0.0029413945,0.0049753995,0.7180062],"genre_scores_gemma":[0.025193293,0.06409857,0.044974897,0.004621295,0.0052082995,0.0005698146,0.0055793216,0.00086335675,0.84889114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903667,0.00011215043,0.000048216858,0.00015531333,0.0005749518,0.00007265587],"domain_scores_gemma":[0.99948174,0.00010136538,0.000032687974,0.00013916462,0.00017899503,0.000066148445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004896244,0.0012999307,0.0007898867,0.0011056751,0.0009786657,0.0036026547,0.0015223405,0.0013894552,0.087600134],"category_scores_gemma":[0.001738679,0.0005719447,0.00048334154,0.0017574565,0.0006190582,0.0030862733,0.0018591796,0.0023924615,0.05254135],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000032937685,0.000032700285,0.00018159975,0.0005090765,0.000034473065,0.00015314254,0.00009758714,0.0022560176,0.0030467291,0.06867777,0.57693225,0.34804565],"study_design_scores_gemma":[0.000004097175,0.000018462688,0.00010319623,0.00009021715,0.000005527835,0.00018242623,0.000020532096,0.0013467659,0.00039074087,0.009218768,0.98861235,0.00000694116],"about_ca_topic_score_codex":0.0007573568,"about_ca_topic_score_gemma":0.0013336589,"teacher_disagreement_score":0.087600134,"about_ca_system_score_codex":0.00085821917,"about_ca_system_score_gemma":0.0010123338,"threshold_uncertainty_score":0.29305166},"labels":[],"label_agreement":null},{"id":"W4213381076","doi":"10.1145/3507699","title":"HopliteML: Evolving Application Customized FPGA NoCs with Adaptable Routers and Regulators","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Field-programmable gate array; Network packet; Workload; Network on a chip; Parallel computing; Embedded system; Routing (electronic design automation); Computer network; Operating system","score_opus":0.008975924883542399,"score_gpt":0.20066839680657483,"score_spread":0.19169247192303243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213381076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41014358,0.00073758553,0.5597803,0.0003081173,0.00020305949,0.0001726767,0.00035085433,0.009985901,0.01831795],"genre_scores_gemma":[0.8116292,0.00018726371,0.18218134,0.000170734,0.000021231286,0.00010254317,0.00027435148,0.00030370965,0.0051297145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998752,0.00002326936,0.0000050739886,0.000022277613,0.000048034955,0.000026093896],"domain_scores_gemma":[0.99984217,0.00004066777,0.000023544537,0.000041703788,0.000035284487,0.00001651018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029268026,0.0003609961,0.00015247452,0.00028910823,0.00013879564,0.0004068693,0.0008664032,0.00023727803,0.0020820135],"category_scores_gemma":[0.00053179014,0.00015768626,0.00015177202,0.00015056008,0.0001907064,0.00045384912,0.00038781037,0.0003236166,0.00028941463],"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.0003144081,0.00016424934,0.0058320705,0.0002299862,0.000075539094,0.00043334602,0.00017293065,0.5717063,0.102138646,0.011871377,0.0070450585,0.3000161],"study_design_scores_gemma":[0.0000491705,0.000303848,0.0014585559,0.000023422243,0.000025293815,0.0001558306,0.00004762669,0.9462871,0.034823406,0.0027489846,0.0140533075,0.00002345481],"about_ca_topic_score_codex":0.0011364374,"about_ca_topic_score_gemma":0.002128659,"teacher_disagreement_score":0.0020820135,"about_ca_system_score_codex":0.00049220584,"about_ca_system_score_gemma":0.0003175451,"threshold_uncertainty_score":0.006965041},"labels":[],"label_agreement":null},{"id":"W4220668587","doi":"10.3390/app12063163","title":"An Efficient Algorithm for Mapping Deep Learning Applications on the NoC Architecture","year":2022,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Interconnection Networks and Systems","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":"Northwestern Polytechnic","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Energy consumption; Cloud computing; Latency (audio); Network on a chip; Computer architecture; Deep learning; Distributed computing; Artificial neural network; Embedded system; Artificial intelligence; Engineering","score_opus":0.019318052836492287,"score_gpt":0.24392779547081653,"score_spread":0.22460974263432423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220668587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017976603,0.00032377345,0.9773566,0.0001928239,0.00006147766,0.00009811554,0.000051159022,0.0014280963,0.002511364],"genre_scores_gemma":[0.25713256,0.00032638136,0.73638606,0.00017408002,0.000031891424,0.00037845774,0.00031035798,0.00011554501,0.0051446576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997787,0.000033841217,0.000021670196,0.000045607267,0.000074687036,0.000045417502],"domain_scores_gemma":[0.99977976,0.00007066238,0.000023761593,0.000028948167,0.00008002691,0.000016957418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037241235,0.0008403591,0.0004877088,0.00081567606,0.00052964274,0.0005088661,0.00096275914,0.0006127403,0.003200668],"category_scores_gemma":[0.001011207,0.00031694263,0.00047583025,0.0007043291,0.0003227342,0.0007984088,0.00094891957,0.0009613393,0.0004987771],"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.00011659155,0.00011477565,0.0011160871,0.00014123006,0.000057791472,0.00008510893,0.0000684582,0.35806274,0.0112026725,0.0077376473,0.0047272323,0.61656976],"study_design_scores_gemma":[0.00001588415,0.000048548514,0.0001264537,0.000006552912,0.000008779124,0.000039076924,0.000017434615,0.9930636,0.0022761263,0.0031399585,0.0012524022,0.0000052255677],"about_ca_topic_score_codex":0.00616737,"about_ca_topic_score_gemma":0.010797975,"teacher_disagreement_score":0.00616737,"about_ca_system_score_codex":0.0007685236,"about_ca_system_score_gemma":0.0015532825,"threshold_uncertainty_score":0.01226294},"labels":[],"label_agreement":null},{"id":"W4220946767","doi":"10.1109/mm.2022.3151214","title":"Special Issue on Hot Interconnects","year":2022,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Computer science; Computer architecture; Data science","score_opus":0.01571338613231099,"score_gpt":0.23286327752439456,"score_spread":0.21714989139208357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220946767","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093379254,0.0028278343,0.00027211983,0.01252211,0.9787417,0.000022267557,0.000070882794,0.00010660991,0.0053430847],"genre_scores_gemma":[0.00080468203,0.0040109707,0.0002022488,0.0079134535,0.95204526,0.000028973745,0.00009878389,0.0001634498,0.03473223],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979595,0.00023594171,0.00022412837,0.0003446373,0.0009807032,0.00025508073],"domain_scores_gemma":[0.98954237,0.0021647739,0.00080974284,0.0004339359,0.0048903273,0.0021588476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027407007,0.0018803495,0.0021292858,0.002322768,0.0022252896,0.0073447526,0.0020870564,0.00659874,0.06581136],"category_scores_gemma":[0.008568991,0.0008427335,0.0014614898,0.0012498326,0.0010465452,0.003527759,0.0015007799,0.008446889,0.03616535],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000039884177,0.00001686388,0.000048194728,0.00016919483,0.000009637273,0.00007333011,0.000009450591,0.000027760176,0.00025861032,0.000662248,0.9884958,0.010188978],"study_design_scores_gemma":[0.000016096452,0.000043185835,0.00023919786,0.00013346318,0.00001606679,0.00016668806,0.000019699602,0.000084418636,0.00021647783,0.0006375767,0.9984175,0.000009492352],"about_ca_topic_score_codex":0.0005246401,"about_ca_topic_score_gemma":0.0015158375,"teacher_disagreement_score":0.06581136,"about_ca_system_score_codex":0.0014732673,"about_ca_system_score_gemma":0.0022804248,"threshold_uncertainty_score":0.22016096},"labels":[],"label_agreement":null},{"id":"W4223912195","doi":"10.1109/accai53970.2022.9752659","title":"Design alternatives of Network- on-Chip (NoC) Router microarchitecture for future Communication System","year":2022,"lang":"en","type":"article","venue":"2022 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)","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":"Horizon College and Seminary","funders":"","keywords":"Router; Microarchitecture; Network on a chip; Computer science; Embedded system; Computer architecture; Latency (audio); Field-programmable gate array; Architecture; Critical path method; Throughput; Chip; Computer network; Engineering; Telecommunications","score_opus":0.023142402738180214,"score_gpt":0.2795259390962561,"score_spread":0.2563835363580759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223912195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098133445,0.025660506,0.7347638,0.003144972,0.00072562153,0.00023398825,0.00024625505,0.001399492,0.13569196],"genre_scores_gemma":[0.7623612,0.0068666963,0.20743644,0.0004563818,0.0001894422,0.0001859734,0.00022121142,0.00011636064,0.022166189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972147,0.00009093091,0.00001474655,0.0000456164,0.000089527566,0.000037667876],"domain_scores_gemma":[0.9997838,0.0000370263,0.0000311727,0.000036815676,0.00009605238,0.0000150799715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003338741,0.00032238825,0.00014884301,0.00032728713,0.00023599919,0.0006987805,0.0006925991,0.0004216342,0.003591474],"category_scores_gemma":[0.00043499423,0.00012212101,0.00023371741,0.00023317675,0.00018252735,0.00072060764,0.00017255494,0.00031306918,0.0006610224],"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.00036882568,0.00012437868,0.0027265074,0.0010909538,0.00016032574,0.0006705659,0.00030375598,0.1587662,0.14264534,0.24477601,0.013851135,0.434516],"study_design_scores_gemma":[0.0001455949,0.0010963517,0.0044142203,0.0002955012,0.00028761226,0.0014678104,0.0002758769,0.5980534,0.05173865,0.054040205,0.2881036,0.000081121434],"about_ca_topic_score_codex":0.0006437868,"about_ca_topic_score_gemma":0.0014686616,"teacher_disagreement_score":0.003591474,"about_ca_system_score_codex":0.00040519083,"about_ca_system_score_gemma":0.0003965884,"threshold_uncertainty_score":0.012014687},"labels":[],"label_agreement":null},{"id":"W4224273243","doi":"10.1007/s42979-022-01141-w","title":"Correction to: Graph Compression for Adjacency-Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adjacency matrix; Adjacency list; Matrix multiplication; Computer science; Multiplication (music); Compression (physics); Graph; Arithmetic; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Physics","score_opus":0.015794710251909802,"score_gpt":0.27654854344658303,"score_spread":0.2607538331946732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224273243","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074995053,0.0009502801,0.0050131753,0.043122206,0.9425396,0.000065630265,0.0016446701,0.0035461576,0.0023683147],"genre_scores_gemma":[0.0997657,0.0059429477,0.044997532,0.10282464,0.4898404,0.0007152645,0.0065579326,0.0075164884,0.2418391],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954482,0.0005850265,0.00089527207,0.00083476264,0.0016627548,0.0005740135],"domain_scores_gemma":[0.9717429,0.008050992,0.0011265595,0.0028128757,0.01496597,0.0013006759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018845686,0.003026786,0.003093456,0.004090303,0.003214398,0.0033551385,0.0044363677,0.010496652,0.12363086],"category_scores_gemma":[0.059001576,0.0017088725,0.0023130754,0.0028481702,0.0027875565,0.002589708,0.0020285076,0.009118392,0.060095645],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00015879924,0.000021887883,0.00013486194,0.00017869592,0.000037458343,0.0010768812,0.00003700507,0.00023170646,0.0002892811,0.0013006607,0.98237944,0.01415321],"study_design_scores_gemma":[0.00025931664,0.00012314222,0.0015143135,0.00028379884,0.00007180651,0.00400674,0.00013813745,0.004701356,0.003341215,0.009170745,0.9762512,0.00013830498],"about_ca_topic_score_codex":0.00970021,"about_ca_topic_score_gemma":0.00885959,"teacher_disagreement_score":0.12363086,"about_ca_system_score_codex":0.0033291169,"about_ca_system_score_gemma":0.0027223341,"threshold_uncertainty_score":0.41358638},"labels":[],"label_agreement":null},{"id":"W4230024666","doi":"10.1002/net.20270","title":"A linear algorithm for finding the <i>k</i>‐broadcast center of a tree","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"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":"Vertex (graph theory); Computer science; Graph; Algorithm; Dissemination; Prim's algorithm; Unit disk graph; Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Shortest-path tree; Telecommunications","score_opus":0.030353133551422228,"score_gpt":0.2480676424642185,"score_spread":0.21771450891279628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230024666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045504916,0.00043587433,0.93678886,0.0007147138,0.0000664848,0.0004424986,0.00061412,0.0047365334,0.01069605],"genre_scores_gemma":[0.21760051,0.00017041508,0.7743922,0.00014530157,0.000050068076,0.00039894285,0.0015068976,0.00036669543,0.0053690085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916553,0.00015954865,0.00006113556,0.00021876393,0.00018043266,0.00021466671],"domain_scores_gemma":[0.9979305,0.0010715192,0.00026510557,0.00025478037,0.00031179984,0.00016633641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547771,0.0007098791,0.00085145276,0.0011957523,0.0012191671,0.0017265865,0.0018342119,0.0008222164,0.009267134],"category_scores_gemma":[0.002611604,0.0005207014,0.0006590334,0.0015494167,0.0007565161,0.0018192633,0.0017933898,0.00092719233,0.0028031163],"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.0014541039,0.0006072899,0.0034022545,0.0009172357,0.000115119285,0.00030424277,0.000938112,0.17504567,0.03362608,0.03792698,0.04445876,0.7012041],"study_design_scores_gemma":[0.0005923594,0.00036327323,0.0013433646,0.00005528634,0.0001031424,0.00046211533,0.00038571045,0.9337329,0.014386484,0.03807407,0.0104344785,0.000066708344],"about_ca_topic_score_codex":0.008220494,"about_ca_topic_score_gemma":0.010291473,"teacher_disagreement_score":0.009267134,"about_ca_system_score_codex":0.001904575,"about_ca_system_score_gemma":0.0028290474,"threshold_uncertainty_score":0.031001627},"labels":[],"label_agreement":null},{"id":"W4230091211","doi":"10.32920/ryerson.14649366","title":"Multi-objective Tabu search based topology synthesis for designing power and performance efficient NoC architectures","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Benchmark (surveying); Computer science; Network on a chip; Multiprocessing; Network topology; Deadlock; Power (physics); Distributed computing; Topology (electrical circuits); Computer engineering; Parallel computing; Embedded system; Engineering; Algorithm; Computer network","score_opus":0.02736512991449894,"score_gpt":0.2689134646960383,"score_spread":0.24154833478153934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230091211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07226162,0.0008418901,0.9197563,0.00013889109,0.000044472425,0.00023371367,0.00014537043,0.00070010807,0.00587759],"genre_scores_gemma":[0.32380223,0.0004610911,0.6727436,0.00007741738,0.000016944727,0.0005495584,0.0003255425,0.00016579857,0.0018578427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996158,0.00021208229,0.000015386988,0.000042447573,0.00007874528,0.000035509256],"domain_scores_gemma":[0.99924564,0.00051632285,0.00007012945,0.00004141538,0.00011042395,0.000016061833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231877,0.0007562188,0.0006016917,0.0011164151,0.00037407887,0.0006438043,0.000740064,0.00064402807,0.0023210603],"category_scores_gemma":[0.0024185244,0.00037912137,0.0006718445,0.0009332991,0.00038474367,0.0005072174,0.00041115866,0.00054183294,0.00032139762],"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.000029884606,0.000036004632,0.00038556985,0.00011578717,0.000032018757,0.00003057131,0.000047924277,0.9506028,0.002721248,0.0033895914,0.00040016483,0.042208362],"study_design_scores_gemma":[0.000010460474,0.000031208845,0.00007557487,0.0000095216,0.0000067251885,0.000009432837,0.000016240203,0.9972632,0.0010729183,0.0010921911,0.00040973496,0.0000028766992],"about_ca_topic_score_codex":0.0018658744,"about_ca_topic_score_gemma":0.0023702697,"teacher_disagreement_score":0.0023210603,"about_ca_system_score_codex":0.0005691091,"about_ca_system_score_gemma":0.0011167098,"threshold_uncertainty_score":0.0077647567},"labels":[],"label_agreement":null},{"id":"W4230458348","doi":"10.32920/ryerson.14654766","title":"Power and chip-area aware network-on-chip simulation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"SystemC; MPSoC; Network on a chip; Computer science; Embedded system; Computer architecture; System on a chip; Chip; Code (set theory); Power (physics); Power network design; Design flow; Telecommunications","score_opus":0.02606783814072352,"score_gpt":0.26009752911037176,"score_spread":0.23402969096964824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230458348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1111052,0.00093043887,0.84333205,0.0005070421,0.0001513434,0.0001816831,0.0011171475,0.0017750368,0.04090008],"genre_scores_gemma":[0.7965691,0.0011818011,0.18564844,0.00019821597,0.000045949782,0.00052729365,0.00089171354,0.00035100328,0.014586484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.000085531115,0.00000917821,0.000030594827,0.00008939732,0.00003286395],"domain_scores_gemma":[0.99952817,0.00027891868,0.00003082187,0.00005671518,0.000091158596,0.0000142512545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029141727,0.00045727257,0.00043560672,0.00038104318,0.0002986581,0.00051780546,0.00094253605,0.0006542625,0.003243417],"category_scores_gemma":[0.0013529203,0.00030866513,0.00047253293,0.0005346959,0.00032624663,0.0006010781,0.00041297366,0.0005428109,0.0003679563],"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.000006353801,0.000008027271,0.00015479885,0.000017824861,0.0000058265177,0.000010474128,0.0000073346223,0.993682,0.00067192514,0.0031078113,0.00025981845,0.0020677783],"study_design_scores_gemma":[0.0000022417607,0.0000051637735,0.000046551635,0.0000018747055,0.0000022082204,0.0000034132963,0.000001909072,0.99799216,0.00043409457,0.0008092409,0.00069968373,0.0000014341756],"about_ca_topic_score_codex":0.005609278,"about_ca_topic_score_gemma":0.004991592,"teacher_disagreement_score":0.005609278,"about_ca_system_score_codex":0.00065110624,"about_ca_system_score_gemma":0.00086471613,"threshold_uncertainty_score":0.011153221},"labels":[],"label_agreement":null},{"id":"W4230977844","doi":"10.1090/fic/026/13","title":"Accelerated simulation of ATM switching fabrics","year":2000,"lang":"en","type":"other","venue":"","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":"York University","funders":"","keywords":"Computer science","score_opus":0.02790610417542106,"score_gpt":0.2693843067012439,"score_spread":0.24147820252582286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230977844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8912139,0.0002712076,0.08323798,0.00046848741,0.000085546315,0.000061383325,0.00073336554,0.00076150533,0.023166567],"genre_scores_gemma":[0.98419595,0.00006515499,0.013272478,0.000036423615,0.000011610996,0.00005835183,0.00022002059,0.000061843544,0.0020781667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997992,0.000065001914,0.0000048706775,0.000020278316,0.000055448858,0.00005527937],"domain_scores_gemma":[0.99934417,0.0003765912,0.00005276931,0.00005410794,0.00011659094,0.000055750705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036957767,0.00042438266,0.0004497242,0.00029249562,0.0003499148,0.00045989297,0.0009188894,0.0006293095,0.0034360965],"category_scores_gemma":[0.0023382695,0.00028266397,0.00039682252,0.0003825278,0.00044844896,0.00044383004,0.0005254987,0.0005526943,0.000224204],"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.00004315789,0.000013917334,0.00073038344,0.000011226382,0.0000053861486,0.000027040684,0.000015431082,0.99521035,0.00062241283,0.0018589223,0.00022838078,0.0012334075],"study_design_scores_gemma":[0.000006600216,0.00000503148,0.00008201292,7.621289e-7,7.620206e-7,0.000002494993,0.0000028810323,0.9993799,0.00015002552,0.00028003607,0.00008863585,8.313515e-7],"about_ca_topic_score_codex":0.012239661,"about_ca_topic_score_gemma":0.005568995,"teacher_disagreement_score":0.012239661,"about_ca_system_score_codex":0.0008359477,"about_ca_system_score_gemma":0.0007201487,"threshold_uncertainty_score":0.024336815},"labels":[],"label_agreement":null},{"id":"W4231358938","doi":"10.1109/iwsoc.2004.1319889","title":"Evaluation of MP-SoC interconnect architectures: a case study","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Interconnection; Computer architecture; Network topology; Embedded system; Multiprocessing; System on a chip; Latency (audio); Parallel computing; Computer network","score_opus":0.05135766385730587,"score_gpt":0.3165225683731483,"score_spread":0.2651649045158424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231358938","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9559021,0.00031833237,0.03451623,0.00020642283,0.000015379394,0.00022260257,0.00033000525,0.00026688143,0.008221978],"genre_scores_gemma":[0.96705085,0.00016700057,0.03088093,0.000026248796,0.0000067641936,0.00009396407,0.00021863684,0.000043425614,0.0015122032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998312,0.00082563073,0.00008392609,0.000085525426,0.00054487784,0.00014808802],"domain_scores_gemma":[0.9937621,0.0040623373,0.00033722987,0.00048046774,0.0012070137,0.00015085406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019177519,0.0005853486,0.0003479087,0.00079120876,0.00037960868,0.0006358854,0.00090460625,0.0007585171,0.001960313],"category_scores_gemma":[0.0071802465,0.00018279313,0.00029367395,0.0010656624,0.00047461537,0.00075101503,0.00057254086,0.00039585942,0.0002129651],"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.0012136574,0.0009994891,0.017555254,0.0016266867,0.00013499055,0.004406144,0.0009209574,0.719542,0.045563713,0.018397572,0.0045236596,0.18511587],"study_design_scores_gemma":[0.00012486144,0.0023673307,0.0070575117,0.000061473525,0.000076264056,0.0011792447,0.0008192449,0.9115766,0.0650728,0.004242331,0.0073924153,0.000029889654],"about_ca_topic_score_codex":0.0015969952,"about_ca_topic_score_gemma":0.0023440833,"teacher_disagreement_score":0.001960313,"about_ca_system_score_codex":0.0008190703,"about_ca_system_score_gemma":0.0004156867,"threshold_uncertainty_score":0.010142148},"labels":[],"label_agreement":null},{"id":"W4232237238","doi":"10.32920/ryerson.14656014","title":"Application mapping and NoC configuration using hybrid particle swarm optimization","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Particle swarm optimization; Computer science; Tabu search; Swarm behaviour; Multi-swarm optimization; Metaheuristic; Mathematical optimization; Network on a chip; Latency (audio); Parallel computing; Algorithm; Mathematics; Embedded system; Artificial intelligence","score_opus":0.03173156922379412,"score_gpt":0.24909018482808015,"score_spread":0.21735861560428604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232237238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10463881,0.00024929194,0.8901599,0.00018087772,0.000051174935,0.00012669868,0.00005914025,0.0004656117,0.004068445],"genre_scores_gemma":[0.79079914,0.00013468091,0.20632774,0.00007275558,0.000026607138,0.00025139115,0.00013055888,0.00006302527,0.0021941483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996489,0.00013285001,0.000017769336,0.0000532524,0.00010621708,0.00004108274],"domain_scores_gemma":[0.99941325,0.00033676147,0.00007930399,0.00005986938,0.000081911,0.000028865947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079307024,0.0007435941,0.000720893,0.00063143537,0.00042458012,0.0006945911,0.00074223126,0.0007142509,0.000905459],"category_scores_gemma":[0.0016070649,0.0004132775,0.0005801611,0.00060911104,0.0005271595,0.0005149164,0.0006837812,0.0004498848,0.00011563021],"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.000023490049,0.000020686644,0.00033291202,0.00001552624,0.000021780463,0.000015369902,0.00001703288,0.98585504,0.000967681,0.0012084874,0.0001619446,0.0113600595],"study_design_scores_gemma":[0.0000060176917,0.000014060695,0.00006395584,0.0000010339068,0.0000027208139,0.000003822773,0.000003589875,0.99923694,0.00021183639,0.00036598014,0.000088647175,0.000001354441],"about_ca_topic_score_codex":0.004205915,"about_ca_topic_score_gemma":0.0035369147,"teacher_disagreement_score":0.004205915,"about_ca_system_score_codex":0.00065904,"about_ca_system_score_gemma":0.0007800136,"threshold_uncertainty_score":0.008362889},"labels":[],"label_agreement":null},{"id":"W4233804237","doi":"10.1007/978-1-4939-7131-2_100465","title":"Heterogeneous Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01829108790221543,"score_gpt":0.21317550592712511,"score_spread":0.1948844180249097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233804237","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004882793,0.008308604,0.21089871,0.0013297482,0.0017984151,0.00009962131,0.00034293346,0.0010082879,0.77133083],"genre_scores_gemma":[0.092629924,0.015860213,0.059674054,0.0010330917,0.001205421,0.00021461838,0.0012975871,0.00056981266,0.8275153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986875,0.00001540542,0.000004581826,0.000036327085,0.00005612987,0.000018830633],"domain_scores_gemma":[0.9998758,0.000028093851,0.0000071024115,0.000045666973,0.000029192457,0.00001403282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016136274,0.0006076229,0.0002896854,0.00050032657,0.00049532345,0.0016162443,0.0007445368,0.0004767433,0.036926266],"category_scores_gemma":[0.0004943801,0.00027495148,0.00022296607,0.0007751039,0.00041138468,0.002483558,0.0014556998,0.0008866476,0.010614491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036329588,0.00003239959,0.00012424961,0.00024539654,0.000021586855,0.00012462675,0.00012988628,0.0070980564,0.005588077,0.5191621,0.11676374,0.35067353],"study_design_scores_gemma":[0.000006404834,0.000020016892,0.00016518222,0.00009235368,0.000016460659,0.0002172603,0.00005540304,0.008229499,0.0028634963,0.15722845,0.8310957,0.000009843424],"about_ca_topic_score_codex":0.0005180733,"about_ca_topic_score_gemma":0.00073717703,"teacher_disagreement_score":0.036926266,"about_ca_system_score_codex":0.00049499585,"about_ca_system_score_gemma":0.00039420943,"threshold_uncertainty_score":0.123530686},"labels":[],"label_agreement":null},{"id":"W4234325571","doi":"10.1007/978-1-4614-6170-8_100819","title":"Network Multiplication","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Arithmetic; Computer science; Mathematics","score_opus":0.02090310659671724,"score_gpt":0.21499917956716735,"score_spread":0.19409607297045012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234325571","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041381237,0.0034983382,0.20038351,0.00078175735,0.0016957077,0.00009789563,0.0002821429,0.0010754962,0.7880471],"genre_scores_gemma":[0.099309854,0.0067096017,0.09503567,0.00056727947,0.001097055,0.00020938061,0.0008196828,0.00080802874,0.7954435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976224,0.000027186705,0.000009812718,0.00006616473,0.00011237925,0.000022256834],"domain_scores_gemma":[0.99983096,0.00003418169,0.000008911198,0.00004799286,0.0000651896,0.000012701024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017812553,0.0008420167,0.00037940807,0.001006659,0.00070575054,0.0012368202,0.000705916,0.0003836674,0.057170216],"category_scores_gemma":[0.00068867306,0.00026271906,0.00030778415,0.0010688652,0.000764166,0.0020520429,0.0010644337,0.0010548803,0.017827485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031413078,0.000018268627,0.000049800088,0.00020137402,0.000010296607,0.00007017348,0.00010078187,0.0026560363,0.004492679,0.6247315,0.07718617,0.29045162],"study_design_scores_gemma":[0.000010839971,0.000035035962,0.000112570524,0.000060543007,0.000012290348,0.00032830934,0.000031319145,0.0063777706,0.0056865914,0.27823585,0.70909524,0.000013629838],"about_ca_topic_score_codex":0.00050691224,"about_ca_topic_score_gemma":0.0007678582,"teacher_disagreement_score":0.057170216,"about_ca_system_score_codex":0.0006804665,"about_ca_system_score_gemma":0.0004609494,"threshold_uncertainty_score":0.19125342},"labels":[],"label_agreement":null},{"id":"W4235020875","doi":"10.1145/776044.776045","title":"Design of a 17-million gate network processor using a design factory","year":2003,"lang":"en","type":"article","venue":"Proceedings of the 40th conference on Design automation - DAC '03","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Network processor; Factory (object-oriented programming); Computer science; Throughput; Embedded system; Key (lock); Variety (cybernetics); Transistor; State (computer science); Network packet; Computer architecture; Electrical engineering; Engineering; Telecommunications; Operating system; Computer network","score_opus":0.09292747740030433,"score_gpt":0.27048931352297056,"score_spread":0.17756183612266624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235020875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2048553,0.0003802393,0.76048636,0.0004381959,0.00009963443,0.00039554038,0.0002289391,0.0029984862,0.030117298],"genre_scores_gemma":[0.56734324,0.00021200378,0.41690764,0.0001893544,0.000019868154,0.0003234403,0.00031156445,0.00014610212,0.014546742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998349,0.00003233382,0.000009209077,0.000031015494,0.000057853522,0.000034723747],"domain_scores_gemma":[0.9998925,0.000026835669,0.000012938882,0.000016676826,0.00003753009,0.000013410664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034653264,0.0002794682,0.0002063538,0.00017529202,0.00028595873,0.00070246356,0.00048456376,0.00035187174,0.0031852047],"category_scores_gemma":[0.00033985684,0.00022202925,0.0003405363,0.00017301708,0.0001844529,0.0003478961,0.00021009032,0.00030086839,0.00090291625],"study_design_candidate":"bench_or_experimental","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.0008146864,0.00041192753,0.006569942,0.00039727121,0.00024327027,0.0012262971,0.00067313557,0.25487882,0.254112,0.066472575,0.014940306,0.3992598],"study_design_scores_gemma":[0.00063147064,0.002480343,0.0047500613,0.00008656549,0.00020407648,0.001229491,0.00018292303,0.67309296,0.16891468,0.014963732,0.13337643,0.00008725942],"about_ca_topic_score_codex":0.0014723795,"about_ca_topic_score_gemma":0.0015362684,"teacher_disagreement_score":0.0031852047,"about_ca_system_score_codex":0.0005460001,"about_ca_system_score_gemma":0.0013229676,"threshold_uncertainty_score":0.010655582},"labels":[],"label_agreement":null},{"id":"W4236090814","doi":"10.1109/iccad.2003.159711","title":"Performance efficiency of context-flow system-on-chip platform","year":2003,"lang":"en","type":"article","venue":"ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)","topic":"Interconnection Networks and 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":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture; System on a chip; Architecture; Programming paradigm; Embedded system; Context (archaeology); Network on a chip; Bandwidth (computing); Distributed computing; Computer network","score_opus":0.0535743858993818,"score_gpt":0.25545042713158195,"score_spread":0.20187604123220015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236090814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9592362,0.00035267745,0.034221996,0.00014963456,0.000026635953,0.000049495433,0.00006263334,0.0013691711,0.004531575],"genre_scores_gemma":[0.99115,0.000084499625,0.007932753,0.00003256772,0.000004725815,0.00002504772,0.00005718692,0.000059544265,0.0006536843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993117,0.00023531516,0.000026782303,0.00008146985,0.00016319574,0.00018149252],"domain_scores_gemma":[0.99874973,0.00056120625,0.0001261984,0.0002446611,0.0002198036,0.00009841124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791366,0.0006795103,0.00034920464,0.0004105964,0.00037881447,0.0006955158,0.00094869133,0.0005188121,0.0015684232],"category_scores_gemma":[0.0023007558,0.00021438656,0.00026330331,0.00035825063,0.00042927047,0.0012562972,0.0004571224,0.0006384404,0.00022489576],"study_design_candidate":"bench_or_experimental","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.0013252911,0.00033317512,0.005160893,0.00018747179,0.000085552005,0.0002170161,0.00015217152,0.8584412,0.05450157,0.0114208395,0.0018255027,0.06634935],"study_design_scores_gemma":[0.000049371665,0.0005902127,0.0007101009,0.000007076236,0.000035900775,0.00005395089,0.00002220651,0.97418004,0.02217901,0.0014302224,0.00072694954,0.000014936169],"about_ca_topic_score_codex":0.0021282376,"about_ca_topic_score_gemma":0.0018325888,"teacher_disagreement_score":0.0021282376,"about_ca_system_score_codex":0.00069489196,"about_ca_system_score_gemma":0.001045729,"threshold_uncertainty_score":0.0052469373},"labels":[],"label_agreement":null},{"id":"W4236109935","doi":"10.1007/978-1-4419-1530-6_3","title":"The Key","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key encapsulation; Key management; Key (lock); Computer science; Public-key cryptography; Cryptography; Key generation; ElGamal encryption; Discrete logarithm; Symmetric-key algorithm; Key distribution; Computer security; Theoretical computer science; Encryption","score_opus":0.017726566431343956,"score_gpt":0.21104830256498214,"score_spread":0.19332173613363818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236109935","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027225533,0.0026236067,0.0028349927,0.0056095156,0.004163699,0.000045500947,0.00017404626,0.00016232645,0.98411405],"genre_scores_gemma":[0.004212285,0.0021833768,0.0006729403,0.002359895,0.00091353885,0.000045304885,0.00011504831,0.00012695555,0.9893706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995521,0.000056909423,0.00001582097,0.00013083032,0.00016348458,0.00008086146],"domain_scores_gemma":[0.9995277,0.0000665592,0.000024113666,0.00009399923,0.00017356624,0.00011409106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204019,0.0007417331,0.00047567088,0.0008079127,0.0014013802,0.004492002,0.0010470544,0.0016665182,0.30315572],"category_scores_gemma":[0.0021546215,0.000282595,0.0003177068,0.00074437395,0.0014454748,0.007306889,0.0031484729,0.0029481733,0.23262133],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000024159282,0.0000148987865,0.000063572246,0.000110715366,0.0000026537361,0.00004406096,0.00019095506,0.000062504274,0.00043727225,0.29645976,0.5906933,0.111896046],"study_design_scores_gemma":[0.0000022223933,0.000004597411,0.00002870279,0.000044900364,0.0000010464566,0.00004316103,0.00005329422,0.000017513867,0.00006680578,0.016435625,0.9833001,0.0000018984986],"about_ca_topic_score_codex":0.0018067025,"about_ca_topic_score_gemma":0.0025237962,"teacher_disagreement_score":0.30315572,"about_ca_system_score_codex":0.0015903853,"about_ca_system_score_gemma":0.0021930044,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4236678756","doi":"10.1109/iv.2004.1320170","title":"Orderly broadcasting in a 2D Torus","year":2004,"lang":"en","type":"article","venue":"Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Torus; Computer science; Graph; Upper and lower bounds; Computer network; Theoretical computer science; Mathematics","score_opus":0.03741470318139265,"score_gpt":0.2899776667547905,"score_spread":0.2525629635733978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236678756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867851,0.0012031883,0.6369096,0.0011542443,0.00041058465,0.000142495,0.00071884476,0.0011518777,0.071524106],"genre_scores_gemma":[0.8603375,0.0009456737,0.12281597,0.00020710149,0.00008745059,0.00021800345,0.00046707192,0.00017180813,0.014749396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962664,0.00010352297,0.000019186951,0.00005189922,0.000101556485,0.00009722153],"domain_scores_gemma":[0.9994017,0.00024111442,0.000080768215,0.00011190631,0.00009903935,0.000065524226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025049728,0.0003311198,0.00045541336,0.0005223092,0.00091736985,0.0012485451,0.0006173477,0.0007341757,0.0033777296],"category_scores_gemma":[0.0012955533,0.00032494447,0.00038859787,0.0009426424,0.0008014273,0.0016306319,0.0008353238,0.000609632,0.00084442995],"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.00038141303,0.000071439994,0.0009668002,0.00020479159,0.000034291934,0.000784233,0.0005778332,0.54092944,0.025665116,0.3948244,0.009352846,0.026207313],"study_design_scores_gemma":[0.0001042999,0.00016304261,0.0004148281,0.000020587719,0.000018866822,0.00038922307,0.00030718648,0.8113008,0.006329893,0.1632777,0.01763073,0.000042754495],"about_ca_topic_score_codex":0.002943396,"about_ca_topic_score_gemma":0.0029901608,"teacher_disagreement_score":0.0033777296,"about_ca_system_score_codex":0.0010636669,"about_ca_system_score_gemma":0.0006034085,"threshold_uncertainty_score":0.01129967},"labels":[],"label_agreement":null},{"id":"W4237872477","doi":"10.1109/csics.2005.1531748","title":"A 1-tap 40-Gbps look-ahead decision feedback equalizer in 0.18 /spl mu/m SiGe BiCMOS technology","year":2005,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"BiCMOS; Equalizer; Electronic engineering; Computer science; CMOS; Silicon-germanium; Differential (mechanical device); Voltage; Electrical engineering; Engineering; Silicon; Transistor; Physics; Optoelectronics; Channel (broadcasting)","score_opus":0.022619300550610413,"score_gpt":0.2780564367753947,"score_spread":0.2554371362247843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237872477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38157287,0.0026118548,0.59057146,0.00090766273,0.0003889008,0.00022287206,0.0006639994,0.0043103,0.018750004],"genre_scores_gemma":[0.8084154,0.0005318218,0.1774095,0.0003154665,0.00008376275,0.000056485263,0.0003100045,0.00004901089,0.01282854],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998672,0.000016197273,0.000006313932,0.000032874937,0.00004692812,0.000030448366],"domain_scores_gemma":[0.99991345,0.00003099806,0.000008707349,0.000009039819,0.00002862036,0.000009199749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001156752,0.00025075895,0.00020955376,0.00022837924,0.00026638948,0.00029719074,0.0003732777,0.0004332685,0.002554465],"category_scores_gemma":[0.00027647932,0.00018572906,0.00015349491,0.00017539553,0.00014342375,0.0003951868,0.00015917775,0.0002341077,0.00050133286],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0003764401,0.000055927114,0.0010446912,0.00013601666,0.000042866166,0.0004402462,0.00011719779,0.008374487,0.7745387,0.0051104855,0.002651037,0.20711194],"study_design_scores_gemma":[0.00015537877,0.00095588836,0.006506773,0.000058015863,0.000118847754,0.0036024055,0.00007785282,0.14009774,0.7962279,0.0032372822,0.048880138,0.00008180721],"about_ca_topic_score_codex":0.0009338933,"about_ca_topic_score_gemma":0.0022716604,"teacher_disagreement_score":0.002554465,"about_ca_system_score_codex":0.00034091895,"about_ca_system_score_gemma":0.00030487243,"threshold_uncertainty_score":0.0085455775},"labels":[],"label_agreement":null},{"id":"W4238558928","doi":"10.1137/1.9781611973075.63","title":"Bounding Variance and Expectation of Longest Path Lengths in DAGs","year":2010,"lang":"en","type":"article","venue":"","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":"York University","funders":"","keywords":"Bounding overwatch; Directed acyclic graph; Path (computing); Variance (accounting); Computer science; Combinatorics; Algorithm; Path length; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.006664333175335899,"score_gpt":0.22549060316630803,"score_spread":0.21882626999097213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238558928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04959265,0.00037117823,0.9479523,0.00034167568,0.000028705459,0.000024934312,0.00020994003,0.000607918,0.0008707488],"genre_scores_gemma":[0.7251571,0.0007729086,0.2701294,0.0002102285,0.0002021742,0.00021850593,0.0012183813,0.00059748534,0.001493774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620277,0.0011024134,0.00025925672,0.0009105044,0.001078396,0.00044666717],"domain_scores_gemma":[0.9320899,0.05841475,0.0030384872,0.0029468245,0.0026176178,0.0008923701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063073286,0.0014052097,0.001580791,0.0026354326,0.0006199279,0.002588153,0.0026074825,0.0014076895,0.00165731],"category_scores_gemma":[0.06259902,0.0010726214,0.0009417694,0.002344739,0.0021648637,0.005341728,0.0024994642,0.0021642467,0.0003408725],"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.0002525682,0.00006574914,0.0029913362,0.00016067263,0.00009553698,0.00009167553,0.00015816897,0.89929485,0.0037794441,0.050134722,0.0010477826,0.041927554],"study_design_scores_gemma":[0.000013861566,0.000030905292,0.00039375547,0.000015609594,0.000009177939,0.000026572576,0.00001577406,0.90281874,0.0012102369,0.09516859,0.0002821971,0.000014674182],"about_ca_topic_score_codex":0.001934749,"about_ca_topic_score_gemma":0.0022919169,"teacher_disagreement_score":0.0063073286,"about_ca_system_score_codex":0.0022531375,"about_ca_system_score_gemma":0.001808357,"threshold_uncertainty_score":0.033356786},"labels":[],"label_agreement":null},{"id":"W4241148233","doi":"10.1007/978-0-387-39940-9_2327","title":"Cube Precomputation","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Precomputation; Cube (algebra); Computer science; Mathematics; Combinatorics; Programming language","score_opus":0.015061710092965757,"score_gpt":0.2301494660238048,"score_spread":0.21508775593083904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241148233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016473005,0.0042297724,0.5272292,0.0019122217,0.0026533976,0.00029319976,0.0039270194,0.0092213005,0.4340609],"genre_scores_gemma":[0.20714496,0.0062921722,0.46766594,0.001828596,0.0014602633,0.0004813243,0.014157265,0.006075565,0.294894],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990036,0.00010055356,0.000049228383,0.0002256241,0.0005002964,0.00012072999],"domain_scores_gemma":[0.9990827,0.00019710707,0.00002698427,0.0003424066,0.00032039406,0.000030384806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052747864,0.0010776869,0.0012491673,0.0015448234,0.0015017071,0.0031892387,0.001729448,0.0005718265,0.05890032],"category_scores_gemma":[0.002103355,0.0004785953,0.0011706059,0.0033653073,0.0012895628,0.0039842487,0.003279591,0.0030103633,0.024050957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014030033,0.000068212845,0.00016328221,0.00047336504,0.000028725955,0.00012686325,0.00016955784,0.0036024512,0.0028334863,0.3901119,0.12885459,0.47342724],"study_design_scores_gemma":[0.000031597883,0.000063948166,0.00021564814,0.00012557872,0.000042398326,0.0004263827,0.000083782405,0.012643584,0.013913731,0.7162628,0.2561497,0.000040774612],"about_ca_topic_score_codex":0.00161692,"about_ca_topic_score_gemma":0.00271494,"teacher_disagreement_score":0.05890032,"about_ca_system_score_codex":0.0012809895,"about_ca_system_score_gemma":0.0015226296,"threshold_uncertainty_score":0.19704121},"labels":[],"label_agreement":null},{"id":"W4241307726","doi":"10.1109/date.2004.1269203","title":"Application of a multi-processor SoC platform to high-speed packet forwarding","year":2004,"lang":"en","type":"article","venue":"Proceedings Design, Automation and Test in Europe Conference and Exhibition","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":"STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Network processor; Overhead (engineering); Network packet; Embedded system; IPv4; Computer network; Packet forwarding; Packet processing; System on a chip; Task (project management); The Internet; Computer architecture; Operating system; IPv6; Engineering","score_opus":0.035804866394178986,"score_gpt":0.25167302639827965,"score_spread":0.21586816000410067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241307726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9209733,0.00013940589,0.073588446,0.00008922854,0.000048207723,0.000084509535,0.00011260617,0.00076688133,0.0041974788],"genre_scores_gemma":[0.97421896,0.000058132107,0.024791332,0.00002135068,0.0000053304057,0.000045008062,0.0000820682,0.000020045098,0.0007576197],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998622,0.000024718503,0.000005370529,0.00001943839,0.000057146775,0.00003118377],"domain_scores_gemma":[0.9997905,0.000067053006,0.000023821454,0.00005042199,0.000043254044,0.000024960525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019830915,0.00028760332,0.00014819187,0.00015040468,0.00012898461,0.00023876652,0.0002884744,0.00020038933,0.0021614374],"category_scores_gemma":[0.00046541975,0.00008066484,0.00012097024,0.00013813548,0.00014823228,0.00030656383,0.00025861818,0.00027779568,0.00018102654],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00075080286,0.0001714124,0.002420803,0.00039380262,0.000048178965,0.0008073273,0.00012542927,0.06339799,0.8441702,0.005629685,0.0008130554,0.08127125],"study_design_scores_gemma":[0.0001765005,0.0033607627,0.006571538,0.000029504017,0.00007631435,0.0008508943,0.00010046736,0.28359312,0.6928056,0.0022181438,0.010190912,0.000026241865],"about_ca_topic_score_codex":0.00043084697,"about_ca_topic_score_gemma":0.00052267354,"teacher_disagreement_score":0.0021614374,"about_ca_system_score_codex":0.0001128517,"about_ca_system_score_gemma":0.00026740556,"threshold_uncertainty_score":0.0072307587},"labels":[],"label_agreement":null},{"id":"W4241676912","doi":"10.1007/978-1-4939-7131-2_100531","title":"Interconnected Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01919019080320595,"score_gpt":0.21499439596657702,"score_spread":0.19580420516337108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241676912","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045765783,0.004765787,0.1356346,0.001012636,0.0018181494,0.000123125,0.00067569804,0.0011777525,0.8502156],"genre_scores_gemma":[0.090281464,0.015957277,0.06305866,0.0009463753,0.0009176915,0.00044704077,0.0023033621,0.00054828025,0.8255398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999045,0.000012138015,0.0000043265472,0.00003153169,0.000036561392,0.00001090177],"domain_scores_gemma":[0.9999151,0.0000149904945,0.0000058068963,0.000020989079,0.000034928442,0.000008183033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000839962,0.00059382553,0.0002646728,0.0007465243,0.00053375086,0.00103101,0.0005078495,0.0004515938,0.053786043],"category_scores_gemma":[0.00034990648,0.00019214505,0.00022341381,0.0009477608,0.00040455456,0.0016598952,0.0009487854,0.0007569914,0.01541318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035501827,0.000022841052,0.000113253525,0.00038244028,0.00001916819,0.00019317745,0.00015595337,0.008215642,0.0050439555,0.59501296,0.14464417,0.24616101],"study_design_scores_gemma":[0.0000070310366,0.000027455286,0.00010388856,0.00008065649,0.000016778953,0.00021177687,0.00003865832,0.0054130284,0.0015190177,0.09564391,0.8969286,0.00000920769],"about_ca_topic_score_codex":0.0007729764,"about_ca_topic_score_gemma":0.0009370356,"teacher_disagreement_score":0.053786043,"about_ca_system_score_codex":0.00050851214,"about_ca_system_score_gemma":0.0004697416,"threshold_uncertainty_score":0.17993224},"labels":[],"label_agreement":null},{"id":"W4241824298","doi":"10.1145/1477942","title":"Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems","year":2008,"lang":"en","type":"paratext","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Implementation; Telecommunications; Process (computing); Quality (philosophy); Work (physics); Software-defined networking; Library science; Engineering management; Software engineering; Engineering; Computer network; Operating system","score_opus":0.041436330199992474,"score_gpt":0.2697732257518641,"score_spread":0.2283368955518716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241824298","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014781219,0.068135016,0.18976118,0.021355344,0.13339013,0.002008334,0.0042837393,0.010552257,0.55573285],"genre_scores_gemma":[0.038763355,0.03825449,0.06798804,0.003749259,0.013510603,0.0010418164,0.010086539,0.0015912886,0.8250146],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847203,0.00031554862,0.00012359643,0.00018217934,0.0007516063,0.00015499361],"domain_scores_gemma":[0.99712354,0.00033548803,0.000097965174,0.0004125916,0.0014103522,0.00062001334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025593208,0.0015548066,0.0012769671,0.0009789864,0.0009236222,0.003798205,0.0013727766,0.001506112,0.09294275],"category_scores_gemma":[0.0035551905,0.00048639465,0.00068517495,0.0008351758,0.0006252585,0.0024187877,0.0017158312,0.0035261735,0.06426638],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00018917088,0.0001775324,0.0010051994,0.00031707544,0.00007255697,0.00013452464,0.000117112904,0.0008128704,0.0046320315,0.008149433,0.74883825,0.23555426],"study_design_scores_gemma":[0.000017171042,0.00007532847,0.0007527433,0.0001262299,0.000024701314,0.0001547789,0.000052541374,0.0032379748,0.0007713793,0.002360279,0.992411,0.000015834794],"about_ca_topic_score_codex":0.002442614,"about_ca_topic_score_gemma":0.0035419383,"teacher_disagreement_score":0.9070572,"about_ca_system_score_codex":0.00085244974,"about_ca_system_score_gemma":0.0024629626,"threshold_uncertainty_score":0.31092447},"labels":[],"label_agreement":null},{"id":"W4242746803","doi":"10.1145/1555815.1555810","title":"Achieving predictable performance through better memory controller placement in many-core CMPs","year":2009,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"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":"Memory controller; Computer science; Thread (computing); Chip; Memory refresh; Interconnection; Registered memory; Embedded system; Parallel computing; Distributed computing; Computer hardware; Semiconductor memory; Computer memory; Computer network; Operating system","score_opus":0.017282648637952498,"score_gpt":0.24160847600101454,"score_spread":0.22432582736306203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242746803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8663748,0.0007109547,0.12763087,0.0002955112,0.000037904298,0.000036333928,0.00004078531,0.00085260894,0.00402028],"genre_scores_gemma":[0.9626648,0.00014626117,0.036545135,0.000046763307,0.0000143767675,0.000018478082,0.00003451568,0.000057326863,0.00047237732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968994,0.000109234636,0.000019076355,0.000036093836,0.000065862245,0.0000798087],"domain_scores_gemma":[0.99934965,0.00024053895,0.000120671306,0.00015254515,0.00009693419,0.00003958409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054679194,0.0003647117,0.00040091976,0.00037745113,0.0003612138,0.0005827906,0.00076533237,0.00035459944,0.0009951196],"category_scores_gemma":[0.0018041553,0.00023344794,0.0001680293,0.00046466212,0.00028634365,0.0008786203,0.0004735958,0.00033374713,0.00019964269],"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.00054733484,0.00018762029,0.004915818,0.0001362011,0.000029425568,0.00022182763,0.00014111845,0.79491645,0.07045703,0.0059905658,0.0015921972,0.120864384],"study_design_scores_gemma":[0.00004849682,0.00033080115,0.0016316442,0.000010979086,0.00001628625,0.00011205601,0.00014699945,0.9675904,0.022264494,0.0067536416,0.0010807243,0.000013477641],"about_ca_topic_score_codex":0.0011457201,"about_ca_topic_score_gemma":0.002662162,"teacher_disagreement_score":0.0011457201,"about_ca_system_score_codex":0.00049819145,"about_ca_system_score_gemma":0.00064261234,"threshold_uncertainty_score":0.003614664},"labels":[],"label_agreement":null},{"id":"W4243136073","doi":"10.22215/etd/2009-09095","title":"Packet-based transaction interconnect fabric for FPGA systems on chip","year":2009,"lang":"en","type":"dissertation","venue":"","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":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Interconnection; Database transaction; Field-programmable gate array; Computer science; Chip; Embedded system; Telecommunications; Database","score_opus":0.01991948356145588,"score_gpt":0.2621202069219233,"score_spread":0.2422007233604674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243136073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7170693,0.0010680372,0.24283886,0.00048355229,0.00035107523,0.00019355938,0.00075837196,0.005237917,0.03199936],"genre_scores_gemma":[0.94360375,0.0003108078,0.040621012,0.000064892585,0.000030529358,0.000057570647,0.0008285142,0.0001486914,0.014334247],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998412,0.000035651927,0.000017317823,0.000025582298,0.000041103343,0.000039129325],"domain_scores_gemma":[0.9995115,0.00007100613,0.000047732443,0.00021416163,0.00012137185,0.00003414425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022916647,0.00016370053,0.00010531653,0.0003669833,0.00033039422,0.000653871,0.00061075325,0.00018037406,0.007482313],"category_scores_gemma":[0.0004890999,0.00014402895,0.00010275623,0.0005009541,0.000159781,0.00078311673,0.00032289268,0.00030987518,0.00078187365],"study_design_candidate":"bench_or_experimental","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.0026284095,0.00058802264,0.00877441,0.0005223726,0.000101736216,0.00094209186,0.0005084885,0.06356295,0.21801302,0.051683027,0.032909453,0.6197661],"study_design_scores_gemma":[0.00024006005,0.002657965,0.010929546,0.00009385533,0.0001942181,0.0008922678,0.00046863576,0.62526923,0.24390316,0.016362604,0.09891556,0.00007295928],"about_ca_topic_score_codex":0.0007808376,"about_ca_topic_score_gemma":0.0016556832,"teacher_disagreement_score":0.007482313,"about_ca_system_score_codex":0.00041047332,"about_ca_system_score_gemma":0.00040966488,"threshold_uncertainty_score":0.025030851},"labels":[],"label_agreement":null},{"id":"W4243779530","doi":"10.1109/iwsoc.2004.1319888","title":"SERDES technology for gigabit I/O communications in storage area networking","year":2004,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Simon Fraser University; University of Alberta","funders":"","keywords":"SerDes; Backplane; Gigabit; Computer science; Transceiver; Embedded system; Computer hardware; Telecommunications; Wireless","score_opus":0.043487871642909674,"score_gpt":0.2805547034716632,"score_spread":0.23706683182875354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243779530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033473566,0.27776027,0.35359553,0.004928119,0.0073473365,0.0003573044,0.00037415035,0.002089955,0.32007378],"genre_scores_gemma":[0.2693803,0.2351847,0.21867603,0.0034770912,0.002605068,0.00039952013,0.0005261165,0.00045457488,0.26929662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99977773,0.00004787433,0.00001536952,0.000033583725,0.000098378754,0.000027109505],"domain_scores_gemma":[0.9998418,0.00006223559,0.000024569257,0.000020896028,0.00003834084,0.000012052153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029268864,0.0006556673,0.0004323775,0.0005266191,0.00049620523,0.0012920358,0.00050967996,0.00079669885,0.0072887805],"category_scores_gemma":[0.00039286749,0.00030828896,0.00030500878,0.00053625903,0.00045216625,0.0015069871,0.00055964,0.0011059712,0.0037786178],"study_design_candidate":"bench_or_experimental","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.00016055869,0.000081186816,0.0007811543,0.0021309808,0.000056331417,0.0011766654,0.00037077328,0.0053985044,0.16333707,0.3837694,0.048753917,0.39398348],"study_design_scores_gemma":[0.000013714024,0.00028776526,0.00040309742,0.00032679818,0.000035235225,0.0026630373,0.000103660605,0.0045607476,0.06628719,0.02200926,0.9032762,0.00003323138],"about_ca_topic_score_codex":0.00013998577,"about_ca_topic_score_gemma":0.0003431238,"teacher_disagreement_score":0.0072887805,"about_ca_system_score_codex":0.00046021375,"about_ca_system_score_gemma":0.0003239988,"threshold_uncertainty_score":0.024383426},"labels":[],"label_agreement":null},{"id":"W4244017389","doi":"10.1109/iccad.2001.968651","title":"Color permutation: an iterative algorithm for memory packing","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; Algorithm; Graph; Parallel computing; Theoretical computer science","score_opus":0.03793038055269091,"score_gpt":0.26442027662412654,"score_spread":0.22648989607143563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244017389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01003289,0.00017157116,0.98375666,0.00011560573,0.000042340547,0.00010031153,0.00003736098,0.0020090998,0.0037341018],"genre_scores_gemma":[0.082275674,0.00012436029,0.9138284,0.00007635058,0.00002512268,0.00018631891,0.00018623506,0.00027414676,0.0030233911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943215,0.00016817158,0.000027446007,0.00007717828,0.00020202677,0.00009298103],"domain_scores_gemma":[0.9993038,0.00025311174,0.00005081873,0.00014178472,0.00022013433,0.000030310717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000601827,0.0009644249,0.00073955674,0.0011366474,0.0007300746,0.0006526333,0.0017675118,0.0008369101,0.004875906],"category_scores_gemma":[0.0021705807,0.00046329552,0.00055588695,0.001952861,0.0008429781,0.0013043302,0.0012455602,0.0008668334,0.0017392567],"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.0003206563,0.00013193538,0.0008661734,0.00012364324,0.00004646612,0.00010612786,0.00023586441,0.14755094,0.011669029,0.024856577,0.010858396,0.8032342],"study_design_scores_gemma":[0.00007583078,0.000100421625,0.00020157943,0.000011635726,0.000017103328,0.00012476035,0.000045550627,0.9658643,0.008320205,0.017378237,0.007838908,0.000021396887],"about_ca_topic_score_codex":0.0054192943,"about_ca_topic_score_gemma":0.004869256,"teacher_disagreement_score":0.0054192943,"about_ca_system_score_codex":0.00079761376,"about_ca_system_score_gemma":0.0013219739,"threshold_uncertainty_score":0.016311526},"labels":[],"label_agreement":null},{"id":"W4244245269","doi":"10.32920/ryerson.14663889","title":"Virtual channel organization and arbitration for network on chip router architecure","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Arbiter; Arbitration; Computer science; Router; Network on a chip; Virtual channel; Port (circuit theory); Computer network; Network packet; Channel (broadcasting); One-armed router; Chip; Embedded system; Distributed computing; Engineering; Telecommunications","score_opus":0.01659932575669573,"score_gpt":0.22748735696403755,"score_spread":0.21088803120734181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244245269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050074805,0.0032330228,0.93020856,0.0005650741,0.00031542848,0.000141804,0.000053268774,0.0019520527,0.013456004],"genre_scores_gemma":[0.7626027,0.0012610537,0.22760355,0.0002947887,0.00013938211,0.0002451265,0.0001401015,0.000097194585,0.007616141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.00014174926,0.000031330608,0.000084582,0.00013845468,0.00008485597],"domain_scores_gemma":[0.99965525,0.000092561226,0.00004986808,0.000079835845,0.00009741857,0.000025209349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821297,0.00026508217,0.00027793553,0.00037193854,0.0004762752,0.0010033757,0.0010948057,0.0004892257,0.0016542161],"category_scores_gemma":[0.0009866792,0.0001544445,0.00021376829,0.00032061327,0.00043250032,0.0008352467,0.0005408605,0.0005586479,0.00027713194],"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.00039815527,0.00019225277,0.0023530493,0.00036658804,0.000074724674,0.0002817956,0.00027501723,0.21087646,0.090457454,0.3018286,0.010301125,0.38259476],"study_design_scores_gemma":[0.00003066785,0.0001898215,0.00042375046,0.000028400802,0.000043494707,0.00019185513,0.000036336613,0.9183522,0.025781864,0.02475927,0.030128034,0.00003435154],"about_ca_topic_score_codex":0.0010037955,"about_ca_topic_score_gemma":0.0016535203,"teacher_disagreement_score":0.0016542161,"about_ca_system_score_codex":0.00062824995,"about_ca_system_score_gemma":0.0008558647,"threshold_uncertainty_score":0.005533874},"labels":[],"label_agreement":null},{"id":"W4245690188","doi":"10.1109/ipdps.2006.1639563","title":"Efficient RDMA-based multi-port collectives on multi-rail QsNet/sup II/ clusters","year":2006,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Remote direct memory access; Scalability; Point (geometry); Data striping; Port (circuit theory); Theoretical computer science; Programming language; Operating system; Mathematics","score_opus":0.01887012125266963,"score_gpt":0.24018695916263777,"score_spread":0.22131683790996814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245690188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2634363,0.00044633375,0.71405786,0.00039195947,0.00020749342,0.00020761337,0.00017527473,0.008546596,0.0125306165],"genre_scores_gemma":[0.7313574,0.0001746462,0.25484505,0.00009770312,0.000050491493,0.0001964542,0.00048410997,0.00026335454,0.01253076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995541,0.00008449137,0.000033397566,0.000099408106,0.00015099926,0.0000776054],"domain_scores_gemma":[0.9992822,0.0001014997,0.0000518942,0.00030334108,0.00018214884,0.000078950405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007577239,0.00041202345,0.0006162995,0.0004928626,0.0010124906,0.00089207233,0.0015430659,0.0003866437,0.0026871737],"category_scores_gemma":[0.0009765662,0.00029066284,0.0004609463,0.00057772326,0.00049462984,0.0009735507,0.0012741497,0.0005334955,0.00073831173],"study_design_candidate":"bench_or_experimental","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.0014010773,0.00053840707,0.00827864,0.00030802042,0.00020859909,0.0006222308,0.0018862772,0.38032314,0.262579,0.048389398,0.0183477,0.2771175],"study_design_scores_gemma":[0.000098698474,0.00024495245,0.0008814442,0.000011498349,0.000036419562,0.000058533482,0.00015746435,0.9426547,0.04058544,0.003524237,0.0117072845,0.000039279497],"about_ca_topic_score_codex":0.004829002,"about_ca_topic_score_gemma":0.0056506656,"teacher_disagreement_score":0.004829002,"about_ca_system_score_codex":0.0008416197,"about_ca_system_score_gemma":0.0007028717,"threshold_uncertainty_score":0.009601772},"labels":[],"label_agreement":null},{"id":"W4245838702","doi":"10.1002/9781118181508.ch16","title":"On‐Chip Surfing Interconnect","year":2012,"lang":"en","type":"other","venue":"","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 British Columbia","funders":"","keywords":"Interconnection; Chip; Embedded system; Computer science; Telecommunications","score_opus":0.018570856928510696,"score_gpt":0.23545990370454015,"score_spread":0.21688904677602944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245838702","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030640755,0.010356486,0.13696842,0.0009496366,0.0029476923,0.00037026015,0.0016872062,0.012448554,0.80363107],"genre_scores_gemma":[0.12368303,0.011504398,0.03970183,0.00069889514,0.0006463514,0.00019242542,0.0036475607,0.0023645493,0.817561],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980146,0.000013632983,0.000007967838,0.000038611626,0.000103591155,0.000034751643],"domain_scores_gemma":[0.9998281,0.00001569096,0.000010377263,0.000049085593,0.000083140556,0.000013512888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015964288,0.0007450816,0.00032443678,0.00083654415,0.0005275221,0.001411621,0.000794677,0.00048793404,0.09440894],"category_scores_gemma":[0.00031785437,0.0003110829,0.00031728306,0.0010144743,0.00017901158,0.0015431378,0.0010471292,0.0005090221,0.024612555],"study_design_candidate":"bench_or_experimental","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.000106335625,0.00006358225,0.00045851446,0.0007382831,0.000027657103,0.0001681724,0.00021609626,0.008268749,0.05300992,0.024898162,0.21591681,0.69612765],"study_design_scores_gemma":[0.000015510952,0.00019707423,0.0008504546,0.00019342934,0.000041514013,0.00025927185,0.00012970006,0.014297162,0.037323944,0.0056289616,0.941027,0.000035997586],"about_ca_topic_score_codex":0.0019965786,"about_ca_topic_score_gemma":0.0037216365,"teacher_disagreement_score":0.09440894,"about_ca_system_score_codex":0.000690784,"about_ca_system_score_gemma":0.00076298066,"threshold_uncertainty_score":0.31582934},"labels":[],"label_agreement":null},{"id":"W4246489050","doi":"10.1007/978-1-4939-7131-2_101009","title":"Routing","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network","score_opus":0.024767636081976963,"score_gpt":0.22350293204627497,"score_spread":0.198735295964298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246489050","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002302521,0.0017358845,0.13212968,0.0010741099,0.0015335038,0.00021762741,0.0015413964,0.0041005514,0.85536474],"genre_scores_gemma":[0.035821404,0.0045916243,0.063084066,0.0007810009,0.00048516534,0.00022995283,0.0033965793,0.0012032661,0.8904069],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970514,0.000025489084,0.00001262167,0.000088145105,0.00013245137,0.000036178368],"domain_scores_gemma":[0.9997285,0.000031577358,0.000011777537,0.0001169366,0.00009385364,0.000017215563],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002502984,0.001097076,0.00038415875,0.0010057281,0.0008560022,0.0021321694,0.0011777567,0.0007885627,0.13918787],"category_scores_gemma":[0.0007363317,0.000494898,0.00049505796,0.0010720387,0.0004419909,0.0024054754,0.0012122109,0.0011610471,0.07479802],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004881393,0.000056620727,0.00010698161,0.0002777467,0.000019580366,0.00007436992,0.000105762476,0.0059972433,0.008365344,0.26423523,0.24205178,0.47866052],"study_design_scores_gemma":[0.000010089313,0.0000304947,0.00008884377,0.00007549369,0.000017117696,0.00018699182,0.00003826673,0.005617017,0.0053314245,0.051948443,0.9366411,0.000014715537],"about_ca_topic_score_codex":0.0012081544,"about_ca_topic_score_gemma":0.0017913934,"teacher_disagreement_score":0.8608121,"about_ca_system_score_codex":0.00076360954,"about_ca_system_score_gemma":0.0009019532,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4247490801","doi":"10.4018/9781605666617.ch014","title":"Cell Processing for Two Scientific Computing Kernels","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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 Manitoba","funders":"","keywords":"Computer science; SIMD; Parallel computing; Fast Fourier transform; Synchronization (alternating current); Single-core; Finite-difference time-domain method; Multi-core processor; Overhead (engineering); Computational science; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.03564091095150606,"score_gpt":0.2597759873534116,"score_spread":0.22413507640190555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247490801","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016931375,0.023070162,0.4707698,0.0024073045,0.00322639,0.00024642874,0.00025680778,0.0032358593,0.47985592],"genre_scores_gemma":[0.09744065,0.021080231,0.31992012,0.0013919118,0.0005142121,0.00030183152,0.0007020414,0.00093083986,0.55771816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998702,0.0000072572775,0.0000044443814,0.000028082122,0.00007383344,0.000016276495],"domain_scores_gemma":[0.9999118,0.000025616308,0.0000040807963,0.00001733524,0.000032671334,0.000008570786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011715304,0.00057123834,0.00034945976,0.0004914569,0.0006745048,0.00169775,0.00064760225,0.0006566134,0.02203777],"category_scores_gemma":[0.00029600508,0.00024114519,0.0005046858,0.0009143574,0.00049648015,0.0016226928,0.0007279592,0.0013923025,0.009068303],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006107881,0.000055754568,0.00018420894,0.0004644958,0.000012948392,0.00038140191,0.000467498,0.0075214286,0.04107812,0.6172576,0.060924906,0.27159053],"study_design_scores_gemma":[0.000012662266,0.000046122346,0.00019835227,0.00009717004,0.000014731848,0.0006904271,0.000121753656,0.032303594,0.016604617,0.06806031,0.88182724,0.000023097104],"about_ca_topic_score_codex":0.000778215,"about_ca_topic_score_gemma":0.0011496444,"teacher_disagreement_score":0.02203777,"about_ca_system_score_codex":0.0006847986,"about_ca_system_score_gemma":0.0005232293,"threshold_uncertainty_score":0.073723674},"labels":[],"label_agreement":null},{"id":"W4247668105","doi":"10.1007/978-1-4757-4941-0_2","title":"Interconnection Networks","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Alterra Power (Canada); University of British Columbia","funders":"","keywords":"Interconnection; Computer science; Perspective (graphical); Computer architecture; Telephony; Telecommunications; Artificial intelligence","score_opus":0.015111821014973128,"score_gpt":0.20730183252405177,"score_spread":0.19219001150907863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247668105","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019203059,0.007607363,0.10454675,0.0008201567,0.0015804593,0.000113868184,0.0005115175,0.001654913,0.8812448],"genre_scores_gemma":[0.016971959,0.009641228,0.032870114,0.00048605405,0.00042128784,0.00017769108,0.0010147186,0.0004078018,0.93800914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983656,0.000015288686,0.0000068161944,0.0000402257,0.000085941756,0.000015212983],"domain_scores_gemma":[0.9998832,0.000017045173,0.00000617134,0.00003676063,0.00004775452,0.00000898771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012839057,0.0010909989,0.00043984942,0.0010752062,0.0006544636,0.0014643505,0.00072068145,0.0006033703,0.069064565],"category_scores_gemma":[0.00041020595,0.00039623887,0.00025603376,0.0016033706,0.00048791544,0.0020858531,0.0008316879,0.0010339165,0.034110792],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018783703,0.00003497714,0.0000851904,0.0003084028,0.000015577376,0.000113732596,0.00015075709,0.0036083064,0.004517415,0.29497796,0.2999177,0.39625117],"study_design_scores_gemma":[0.0000033083109,0.000015232054,0.000074924974,0.000062285944,0.000008555227,0.00015308603,0.000018775043,0.0016325067,0.0011062132,0.046006944,0.950912,0.0000061118835],"about_ca_topic_score_codex":0.00087918475,"about_ca_topic_score_gemma":0.0017089734,"teacher_disagreement_score":0.069064565,"about_ca_system_score_codex":0.0006833571,"about_ca_system_score_gemma":0.0005989927,"threshold_uncertainty_score":0.23104393},"labels":[],"label_agreement":null},{"id":"W4248489133","doi":"10.1109/cjece.2020.2969378","title":"Table of contents","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.011260948384896979,"score_gpt":0.16222899699586507,"score_spread":0.1509680486109681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248489133","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019506805,0.00858701,0.012827131,0.0024865223,0.007879483,0.00066921284,0.015924308,0.0050448715,0.9446308],"genre_scores_gemma":[0.010518426,0.0055953525,0.0051386766,0.0015711114,0.0019329452,0.00025118873,0.015110095,0.00091629446,0.9589658],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974686,0.000020177195,0.000014203487,0.000051133844,0.00014264621,0.000024974914],"domain_scores_gemma":[0.9992111,0.00008872888,0.000030115152,0.00009481655,0.00047882964,0.000096428055],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027822985,0.0006606288,0.0005818684,0.0015463444,0.00077807705,0.0023534445,0.0011421846,0.00081932714,0.6925264],"category_scores_gemma":[0.0013445524,0.00022950757,0.00031776042,0.0011971969,0.00015659783,0.0014764012,0.0008922533,0.0006252439,0.5806245],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00007339216,0.00005571164,0.00028059067,0.00040471926,0.0000102628455,0.000100408324,0.000022672823,0.00058474316,0.0036002228,0.0033850744,0.81586343,0.17561881],"study_design_scores_gemma":[0.000008578797,0.000048671165,0.00027806687,0.000097318334,0.0000069547123,0.00013227241,0.000023091665,0.00030997506,0.0011271767,0.0011813662,0.9967789,0.000007725259],"about_ca_topic_score_codex":0.0012491167,"about_ca_topic_score_gemma":0.0017491699,"teacher_disagreement_score":0.3074736,"about_ca_system_score_codex":0.00078491424,"about_ca_system_score_gemma":0.0009638163,"threshold_uncertainty_score":0.43857378},"labels":[],"label_agreement":null},{"id":"W4248545690","doi":"10.24124/2007/bpgub464","title":"Linear separability of the vertices of an n-dimensional hypercube.","year":2007,"lang":"en","type":"dissertation","venue":"","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":"Canadian Heritage","funders":"","keywords":"Hypercube; Combinatorics; Mathematics","score_opus":0.015507234740902043,"score_gpt":0.30252135266305874,"score_spread":0.2870141179221567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248545690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38026303,0.0015415647,0.39056328,0.0014917539,0.00033829952,0.00020442747,0.0021163228,0.0004998899,0.22298138],"genre_scores_gemma":[0.8567893,0.00069323153,0.08643604,0.00024289805,0.00010675286,0.00029541625,0.0020478123,0.000158417,0.053230155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996081,0.00011520118,0.000028851318,0.000073370116,0.00008866649,0.000085871005],"domain_scores_gemma":[0.99872345,0.0006496112,0.00019661724,0.00014720221,0.00015360363,0.0001295828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751529,0.00046137755,0.00030785048,0.00073280744,0.000707585,0.0017379622,0.00076602993,0.0006977677,0.015753834],"category_scores_gemma":[0.0024897666,0.0003630683,0.00042094302,0.0008392908,0.0008615075,0.0017670391,0.0012683083,0.00095469033,0.0021687422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013801558,0.00016955099,0.0026656354,0.0007839869,0.00009486798,0.0006405757,0.0006632984,0.13144031,0.02918451,0.70769763,0.014228905,0.11105051],"study_design_scores_gemma":[0.00018017451,0.00020858752,0.002541709,0.00020070936,0.00004132202,0.00055471907,0.0005754076,0.29993182,0.021298984,0.648316,0.02610539,0.000045170782],"about_ca_topic_score_codex":0.0011032857,"about_ca_topic_score_gemma":0.0020989338,"teacher_disagreement_score":0.015753834,"about_ca_system_score_codex":0.000702312,"about_ca_system_score_gemma":0.00054343854,"threshold_uncertainty_score":0.05270183},"labels":[],"label_agreement":null},{"id":"W4248853006","doi":"10.1002/net.20060","title":"The strongly connected reliability of complete digraphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","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":"Dalhousie University","funders":"","keywords":"Digraph; Vertex connectivity; Vertex (graph theory); Strongly connected component; Combinatorics; Fist; Mathematics; Reliability (semiconductor); Connected component; Connectivity; Discrete mathematics; Computer science; Graph","score_opus":0.011253662670866976,"score_gpt":0.2199192064679363,"score_spread":0.20866554379706934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248853006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56475145,0.00031646236,0.4279401,0.00048022546,0.000029716912,0.00008473355,0.0005806314,0.00034386475,0.005472894],"genre_scores_gemma":[0.9831818,0.000181402,0.015181732,0.00004213929,0.000028807595,0.000060042876,0.00028252444,0.000027651995,0.0010139633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.00038282629,0.000050167084,0.00018684662,0.00025343834,0.00011434729],"domain_scores_gemma":[0.98748326,0.008677702,0.0012408756,0.0009077729,0.0011965269,0.0004939982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013478274,0.00047110632,0.00063626975,0.002089969,0.00052657997,0.0011575563,0.000757149,0.0006356679,0.0015925135],"category_scores_gemma":[0.015332738,0.00058150134,0.00044212257,0.0009591605,0.0014435628,0.0020218445,0.0010704354,0.000705496,0.0002491142],"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.00034861674,0.00005829691,0.007233992,0.00022511018,0.00010973024,0.0005004056,0.00064184883,0.69505304,0.00413993,0.25143093,0.0025425046,0.03771552],"study_design_scores_gemma":[0.000026048576,0.000064605265,0.0017743971,0.000023431792,0.000026885904,0.00015673014,0.00007616834,0.63990253,0.001419251,0.35532072,0.0011869933,0.00002224276],"about_ca_topic_score_codex":0.001795033,"about_ca_topic_score_gemma":0.0012791594,"teacher_disagreement_score":0.002089969,"about_ca_system_score_codex":0.0011271042,"about_ca_system_score_gemma":0.0005795681,"threshold_uncertainty_score":0.008177757},"labels":[],"label_agreement":null},{"id":"W4249853457","doi":"10.1007/978-1-4939-7131-2_101229","title":"Space-Embedded Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Space (punctuation); Operating system","score_opus":0.017867495266601287,"score_gpt":0.22195651711471082,"score_spread":0.20408902184810954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249853457","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030010506,0.03541285,0.06347829,0.0017313372,0.0031260767,0.00003476409,0.00020111346,0.00057789224,0.8924366],"genre_scores_gemma":[0.045229293,0.031965133,0.016613515,0.0007739233,0.0015966904,0.00009194901,0.0003588015,0.00035252282,0.9030182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998963,0.000017106238,0.0000033426318,0.00002231623,0.000048272705,0.000012682488],"domain_scores_gemma":[0.99993134,0.000019129538,0.0000047799767,0.000018775681,0.000018200515,0.000007763501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094981624,0.00079979055,0.0003053492,0.0005899056,0.00048188138,0.0017196293,0.0005159759,0.0006048051,0.03494727],"category_scores_gemma":[0.00030142855,0.00024187076,0.00016284599,0.001034864,0.0007129449,0.0026728765,0.0010978658,0.0011632999,0.012115106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013622974,0.000018626559,0.000041674448,0.00020033575,0.0000076085403,0.000047548892,0.00013456335,0.0035717252,0.0018698454,0.6818787,0.115318865,0.19689694],"study_design_scores_gemma":[0.0000026980701,0.00001019758,0.000059827144,0.000083727915,0.0000035086525,0.00006931689,0.0000335303,0.0018222998,0.00058009493,0.16167186,0.8356584,0.0000044916596],"about_ca_topic_score_codex":0.0005708658,"about_ca_topic_score_gemma":0.0010760619,"teacher_disagreement_score":0.03494727,"about_ca_system_score_codex":0.000715853,"about_ca_system_score_gemma":0.0004360554,"threshold_uncertainty_score":0.11691028},"labels":[],"label_agreement":null},{"id":"W4250137794","doi":"10.1109/aspdac.2005.1466487","title":"Crossbar based design schemes for switch boxes and programmable interconnection networks","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","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":"Wilfrid Laurier University","funders":"","keywords":"Crossbar switch; Interconnection; Computer science; Routing (electronic design automation); Crossover switch; Field-programmable gate array; Topology (electrical circuits); Network on a chip; Network topology; Parallel computing; Embedded system; Computer architecture; Computer network; Engineering; Electrical engineering; Telecommunications","score_opus":0.025511391140629478,"score_gpt":0.23102644318365506,"score_spread":0.2055150520430256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250137794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014793085,0.0027978716,0.96161497,0.00024673628,0.0003803746,0.000118035314,0.00009824118,0.00072536187,0.019225292],"genre_scores_gemma":[0.29827863,0.003302445,0.6776101,0.0005712762,0.00022215728,0.00045837075,0.00022610318,0.00020540314,0.019125514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996512,0.0000994962,0.000031308944,0.00007699286,0.000108830805,0.000032158576],"domain_scores_gemma":[0.9997296,0.000067291636,0.000051888033,0.00006476083,0.00007453344,0.000012017954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044244574,0.00073029246,0.00022243525,0.00052182877,0.00030810945,0.0008995082,0.00089229504,0.0006766507,0.0045232926],"category_scores_gemma":[0.0007442914,0.00029220516,0.0003643182,0.000668421,0.0005753584,0.0010268776,0.0005174461,0.000857033,0.00091043464],"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.00011857295,0.000047719983,0.00024678657,0.0006401575,0.00005344359,0.00020177767,0.00020304167,0.042701617,0.07464257,0.70971286,0.0047197817,0.1667117],"study_design_scores_gemma":[0.00017049511,0.0006622136,0.0006185099,0.00030900893,0.00014084807,0.0018172358,0.00013186895,0.23330748,0.118170455,0.24456747,0.40001836,0.000086162356],"about_ca_topic_score_codex":0.00020073143,"about_ca_topic_score_gemma":0.0003954649,"teacher_disagreement_score":0.0045232926,"about_ca_system_score_codex":0.00062098785,"about_ca_system_score_gemma":0.00032829493,"threshold_uncertainty_score":0.01513195},"labels":[],"label_agreement":null},{"id":"W4250198422","doi":"10.1109/cjece.2020.3018383","title":"Table of contents","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Table (database); Database; Computer science","score_opus":0.011260948384896979,"score_gpt":0.16222899699586507,"score_spread":0.1509680486109681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250198422","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016907535,0.009465988,0.011773603,0.0042711394,0.015153735,0.00050191395,0.024687383,0.0031254773,0.92932993],"genre_scores_gemma":[0.009149587,0.007125729,0.008255733,0.0016744874,0.0035905878,0.0003292105,0.019642392,0.0012003529,0.94903195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961567,0.00004705203,0.000023335515,0.00007628906,0.00020158885,0.000035999714],"domain_scores_gemma":[0.9986798,0.00022619526,0.000066179506,0.00017013146,0.0007120269,0.00014563346],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003753654,0.0008335777,0.0007533058,0.001953509,0.0014488519,0.003222106,0.0012962247,0.0010175146,0.69276553],"category_scores_gemma":[0.0031514931,0.00036898884,0.00042195123,0.0020310064,0.00033702797,0.001772999,0.001118158,0.0011752034,0.517374],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00007602606,0.00003538613,0.00023674378,0.00034553706,0.00000698622,0.00014414008,0.000049249757,0.00048463076,0.0010389579,0.017547373,0.8774782,0.102556765],"study_design_scores_gemma":[0.0000062193594,0.000016132268,0.0001565823,0.0000964248,0.0000027677945,0.00011771274,0.000026759248,0.00015573495,0.00028469527,0.0023958934,0.99673516,0.000005802324],"about_ca_topic_score_codex":0.0034866666,"about_ca_topic_score_gemma":0.003473641,"teacher_disagreement_score":0.69276553,"about_ca_system_score_codex":0.0016171625,"about_ca_system_score_gemma":0.0015845379,"threshold_uncertainty_score":0.43823266},"labels":[],"label_agreement":null},{"id":"W4250550822","doi":"10.1017/cbo9781316162651.025","title":"Interconnect","year":2015,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","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 British Columbia","funders":"","keywords":"Interconnection; Computer science; Reliability engineering; Computer network; Engineering","score_opus":0.042666295332171256,"score_gpt":0.20982466924944781,"score_spread":0.16715837391727656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250550822","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028673217,0.003275393,0.024590753,0.00091630383,0.0020249397,0.00012134457,0.0017868591,0.005830525,0.9585865],"genre_scores_gemma":[0.012465582,0.0024602786,0.008785282,0.00052537693,0.00021628132,0.000092626266,0.0027911768,0.0010342015,0.97162926],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971336,0.000017746823,0.000016638607,0.00006561314,0.00014734502,0.00003925064],"domain_scores_gemma":[0.999775,0.000019029932,0.0000136523595,0.000045607707,0.00011649691,0.000030230185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016098945,0.0009835768,0.0004894002,0.0014041087,0.0010788661,0.0024170037,0.0011634274,0.0010266355,0.3265777],"category_scores_gemma":[0.00052607676,0.0004913735,0.00034286547,0.0014946458,0.00023320521,0.0020557442,0.0017526504,0.0011476163,0.22288622],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007277541,0.00006648139,0.00032477613,0.0006193389,0.000012897794,0.0003439856,0.00031408423,0.001334807,0.0106863445,0.06684002,0.41410473,0.50527984],"study_design_scores_gemma":[0.000005006524,0.000017940614,0.00012368144,0.000056849614,0.000004392803,0.00020281502,0.000041879317,0.00039117242,0.0018810822,0.0038065498,0.9934627,0.0000059373547],"about_ca_topic_score_codex":0.0007628821,"about_ca_topic_score_gemma":0.0015810883,"teacher_disagreement_score":0.3265777,"about_ca_system_score_codex":0.00080409547,"about_ca_system_score_gemma":0.0006723576,"threshold_uncertainty_score":0.9605552},"labels":[],"label_agreement":null},{"id":"W4251628355","doi":"10.1145/2024723.2000113","title":"DBAR","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"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; Workload; Distributed computing; Computer network; Network congestion; Overhead (engineering); Routing (electronic design automation)","score_opus":0.03189074900865286,"score_gpt":0.22797246316031655,"score_spread":0.1960817141516637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251628355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01781051,0.003700335,0.7634301,0.0012802469,0.0024438251,0.00041443147,0.0047263554,0.05802855,0.14816569],"genre_scores_gemma":[0.2600698,0.003426442,0.5075185,0.0035058819,0.0008731388,0.0006727198,0.02796087,0.0064097657,0.18956304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.00012154087,0.000078096935,0.00025346593,0.00041409524,0.00013750837],"domain_scores_gemma":[0.9989411,0.00011074311,0.000065206594,0.00040415922,0.0004069606,0.000071826646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073563034,0.00097172335,0.00062016957,0.001073945,0.0007455528,0.002615161,0.0022408906,0.0010160238,0.03159111],"category_scores_gemma":[0.0017985436,0.00042250764,0.0005323102,0.0011625555,0.00029160627,0.0020478813,0.0019194793,0.0013126995,0.032290813],"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.0005378295,0.00017959204,0.0014944156,0.00046232008,0.00009071992,0.00018264703,0.000083024344,0.017063783,0.025176974,0.037679497,0.17040797,0.7466412],"study_design_scores_gemma":[0.0001380562,0.00025971638,0.0010417129,0.000075705495,0.00007207485,0.0007702507,0.00010516634,0.15064351,0.05106008,0.027602885,0.7681342,0.0000966963],"about_ca_topic_score_codex":0.0014989311,"about_ca_topic_score_gemma":0.0022794073,"teacher_disagreement_score":0.03159111,"about_ca_system_score_codex":0.00066879444,"about_ca_system_score_gemma":0.0009802604,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4251842523","doi":"10.1007/978-1-4939-7131-2_100740","title":"Network Multiplication","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multiplication (music); Arithmetic; Mathematics; Combinatorics","score_opus":0.026470311482370182,"score_gpt":0.2275829594470779,"score_spread":0.20111264796470774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251842523","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042515714,0.0034501122,0.19536397,0.00084788736,0.001862843,0.00010156736,0.00030169796,0.0011257386,0.7926947],"genre_scores_gemma":[0.10327818,0.006713812,0.09498505,0.000629603,0.0012055583,0.00022545132,0.00087666843,0.00085341407,0.79123217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976,0.000027337674,0.000009935146,0.000070134505,0.00011003421,0.000022698638],"domain_scores_gemma":[0.9998186,0.000036713274,0.000009464515,0.000052755408,0.00006861167,0.00001392517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001866905,0.00085063133,0.0003803306,0.0009888889,0.00071662286,0.0012840213,0.00071358617,0.00040049004,0.05745448],"category_scores_gemma":[0.0007424884,0.00026512335,0.00031853936,0.0010460065,0.00077033025,0.0021509707,0.0010941348,0.0011103102,0.018976668],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032780452,0.000018570177,0.00004962259,0.00020923153,0.000010475143,0.00006771383,0.00009883191,0.0024915899,0.0044199694,0.65332264,0.07452093,0.2647577],"study_design_scores_gemma":[0.000011175332,0.000036505706,0.000112043104,0.000060329447,0.000012599874,0.00031247432,0.000030130408,0.005964211,0.005599488,0.28767547,0.7001724,0.000013182623],"about_ca_topic_score_codex":0.00046273702,"about_ca_topic_score_gemma":0.00067217596,"teacher_disagreement_score":0.05745448,"about_ca_system_score_codex":0.00068881677,"about_ca_system_score_gemma":0.00046626924,"threshold_uncertainty_score":0.19220442},"labels":[],"label_agreement":null},{"id":"W4253415458","doi":"10.12785/ijcds/040101","title":"Introduction to Special Issue: Design and Performance of Networks on Chip","year":2015,"lang":"en","type":"article","venue":"International Journal of Computing and Digital Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Stockholms Universitet; University of the Aegean; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universidad de Valladolid; Chaoyang University of Technology; University of Bedfordshire; National and Kapodistrian University of Athens; University of Central Arkansas; Towson University; West Chester University; University of Pennsylvania; University of Derby; Taibah University; George Washington University; Manchester Metropolitan University; Acadia University","keywords":"Computer science; Chip; Computer architecture; Embedded system; Telecommunications","score_opus":0.018395518154757328,"score_gpt":0.24382524389632712,"score_spread":0.2254297257415698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253415458","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021825118,0.20968825,0.048388496,0.039137915,0.59061986,0.0002864848,0.001096783,0.0011987044,0.10740111],"genre_scores_gemma":[0.018809618,0.174381,0.017004108,0.01465086,0.60883284,0.00031500452,0.0015258279,0.001442775,0.16303802],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998541,0.00020315406,0.00013107032,0.00033566324,0.00069236424,0.00009686241],"domain_scores_gemma":[0.9953675,0.0015980115,0.00021556845,0.00029304452,0.0019844028,0.00054146844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016289311,0.0016324819,0.0015390663,0.0019453058,0.0008488371,0.0039898274,0.0018084352,0.002789787,0.04217257],"category_scores_gemma":[0.005359546,0.0005747018,0.0005840726,0.0024857349,0.0010091311,0.0029643506,0.0011797054,0.0042152996,0.020902164],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000055589986,0.000048690796,0.00031023266,0.000763876,0.000025874166,0.00010275247,0.000034475815,0.0012699999,0.0007843906,0.013299049,0.84691745,0.1363877],"study_design_scores_gemma":[0.000010449227,0.00009979888,0.0005244805,0.00036036188,0.000025498892,0.0003184049,0.000021417249,0.002574278,0.0003988059,0.007895819,0.9877506,0.000020119642],"about_ca_topic_score_codex":0.0006547097,"about_ca_topic_score_gemma":0.0007757084,"teacher_disagreement_score":0.04217257,"about_ca_system_score_codex":0.0011592661,"about_ca_system_score_gemma":0.0010359782,"threshold_uncertainty_score":0.14108133},"labels":[],"label_agreement":null},{"id":"W4254384617","doi":"10.1007/978-1-4614-6170-8_100721","title":"Space-Embedded Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Space (punctuation); Computer science; Operating system","score_opus":0.014058786430750701,"score_gpt":0.2095855002277584,"score_spread":0.1955267137970077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254384617","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030294561,0.034385283,0.070404544,0.0015318351,0.0025088717,0.00003479727,0.00017446405,0.0005307433,0.8874],"genre_scores_gemma":[0.04547565,0.03073917,0.018202398,0.0007013664,0.0012580019,0.00008957716,0.0003025967,0.00031322907,0.902918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998987,0.000017431083,0.0000033784697,0.000020863286,0.00004730299,0.000012353794],"domain_scores_gemma":[0.9999385,0.000016857231,0.0000043713762,0.00001686273,0.000016932636,0.0000064377864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089544665,0.00078358286,0.0003090049,0.0006069092,0.00047812017,0.0016041679,0.0005150177,0.0005758623,0.03206465],"category_scores_gemma":[0.00026780358,0.00023980846,0.00015967256,0.0010612569,0.00073121756,0.0025621816,0.0010550332,0.00109446,0.010386967],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012242326,0.000017707942,0.00004033829,0.0001739482,0.0000074164363,0.000048881353,0.00013596308,0.0037191957,0.0019312127,0.6894981,0.100727685,0.20368734],"study_design_scores_gemma":[0.0000027458461,0.000010895043,0.0000634993,0.00008332899,0.0000036932097,0.000077177334,0.000037260063,0.0021645126,0.00067653955,0.16747646,0.8293989,0.000005039342],"about_ca_topic_score_codex":0.00065810606,"about_ca_topic_score_gemma":0.0012518687,"teacher_disagreement_score":0.03206465,"about_ca_system_score_codex":0.00070883427,"about_ca_system_score_gemma":0.00043403928,"threshold_uncertainty_score":0.1072669},"labels":[],"label_agreement":null},{"id":"W4254900933","doi":"10.1002/dac.966","title":"Architecture design, performance analysis and VLSI implementation of a reconfigurable shared buffer for high‐speed switch/router","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Dram; Router; Network packet; Static random-access memory; Buffer (optical fiber); Computer network; Embedded system; Computer hardware","score_opus":0.03466270430056799,"score_gpt":0.28923128202543363,"score_spread":0.25456857772486563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254900933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83823514,0.0009865455,0.15187024,0.00022650935,0.000106103595,0.00008693452,0.00015878229,0.0013608318,0.006968903],"genre_scores_gemma":[0.98694927,0.00006895707,0.0123320585,0.000015713547,0.000005228613,0.00001290759,0.000028100214,0.000008133094,0.0005796436],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998753,0.00002122771,0.0000066824173,0.00002379954,0.000040222076,0.00003281215],"domain_scores_gemma":[0.99982256,0.000038355392,0.000043576485,0.000027016771,0.000053783813,0.000014699457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013406007,0.00028336066,0.00016233485,0.00027318252,0.00019669115,0.00042256186,0.0008719487,0.00026785338,0.0017996647],"category_scores_gemma":[0.00027931237,0.00011623669,0.00023097178,0.00020863269,0.00013996493,0.0004362847,0.00016014355,0.00015280316,0.0001698175],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0007222495,0.00023232232,0.0073980927,0.00038301834,0.00027351113,0.0005541589,0.00013642373,0.44182676,0.454067,0.009016319,0.0026349092,0.08275517],"study_design_scores_gemma":[0.00006554612,0.0008718854,0.0023196028,0.000013952155,0.00010700411,0.00019766127,0.000039337297,0.8734023,0.119687006,0.00058000995,0.0026948014,0.000020909818],"about_ca_topic_score_codex":0.0018780186,"about_ca_topic_score_gemma":0.0017220458,"teacher_disagreement_score":0.0018780186,"about_ca_system_score_codex":0.0006681246,"about_ca_system_score_gemma":0.0005218357,"threshold_uncertainty_score":0.0060204864},"labels":[],"label_agreement":null},{"id":"W4255196150","doi":"10.22215/etd/2009-09122","title":"Parallel algorithms for simulation and optimization of on-chip power grid networks","year":2009,"lang":"en","type":"dissertation","venue":"","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":"Carleton University; Library and Archives Canada","funders":"","keywords":"Computer science; Grid; Chip; Power grid; Parallel computing; Algorithm; Power (physics); Mathematics; Telecommunications; Physics","score_opus":0.01959501527481013,"score_gpt":0.2816945120029353,"score_spread":0.2620994967281252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255196150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024212223,0.0005922036,0.96111095,0.0004962815,0.00015763757,0.00013711312,0.0002530302,0.0015669755,0.011473655],"genre_scores_gemma":[0.51761854,0.0007339483,0.4691349,0.00023030081,0.00012970612,0.0009887111,0.0007476711,0.00073909794,0.00967707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933916,0.00035485133,0.000029212957,0.00006144923,0.0001447081,0.000070628135],"domain_scores_gemma":[0.9978011,0.0016085441,0.00012313256,0.00017554857,0.00021674401,0.00007490251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010759676,0.0012255604,0.0012780798,0.0008115477,0.0007574185,0.0012164471,0.0018849146,0.0016582421,0.005155058],"category_scores_gemma":[0.005343887,0.00085034076,0.00086153834,0.0010402526,0.00082294137,0.0011392088,0.0011729185,0.0016644899,0.0008328322],"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.00001840435,0.000013266097,0.00008989933,0.000013685942,0.000011458755,0.0000054901375,0.0000087039025,0.9929432,0.00007579516,0.0022680266,0.0003592614,0.004192762],"study_design_scores_gemma":[0.000005934979,0.000002606508,0.000009559548,0.0000010231851,9.646408e-7,7.738122e-7,0.0000014246816,0.9985715,0.000038638493,0.0012203848,0.0001466312,5.688982e-7],"about_ca_topic_score_codex":0.019031228,"about_ca_topic_score_gemma":0.017628841,"teacher_disagreement_score":0.019031228,"about_ca_system_score_codex":0.0014639971,"about_ca_system_score_gemma":0.0019497083,"threshold_uncertainty_score":0.037840903},"labels":[],"label_agreement":null},{"id":"W4255584984","doi":"10.32920/ryerson.14645025","title":"Congestion aware adaptive routing for network-on-chip communication","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Latency (audio); Header; Network congestion; Network packet; Routing (electronic design automation); Throughput; Network on a chip; Routing domain; Static routing; Routing protocol; Telecommunications; Wireless","score_opus":0.05430929928577852,"score_gpt":0.2793790470994055,"score_spread":0.22506974781362696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255584984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026196653,0.007311905,0.9580214,0.0007092316,0.0004915166,0.00010207384,0.00005788872,0.0009663361,0.0061429185],"genre_scores_gemma":[0.6991677,0.009040837,0.28106657,0.00027389236,0.00045581977,0.00019683152,0.00024911467,0.00026281507,0.009286427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.000064136584,0.000012960091,0.000054794615,0.00010784592,0.0000236897],"domain_scores_gemma":[0.9997056,0.00012572679,0.000037241123,0.000051119543,0.000067345485,0.000012946288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041115045,0.00036969993,0.0002706791,0.00043015648,0.0003092292,0.0006267076,0.00050676224,0.00042824663,0.0012131429],"category_scores_gemma":[0.0012853146,0.00021928141,0.00025130584,0.0005681767,0.00034344845,0.0007623978,0.00035818334,0.00072184653,0.00023768876],"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.000096544885,0.00009156059,0.0010335973,0.0004305491,0.00009782165,0.00019202926,0.00013110971,0.43193287,0.05362773,0.18809326,0.010400464,0.31387243],"study_design_scores_gemma":[0.000012017111,0.00006123086,0.00044896294,0.000025694193,0.000027359283,0.00009998691,0.000016328782,0.9436277,0.007476567,0.035735875,0.012445792,0.000022426031],"about_ca_topic_score_codex":0.0010066997,"about_ca_topic_score_gemma":0.0011207055,"teacher_disagreement_score":0.0012131429,"about_ca_system_score_codex":0.0006115729,"about_ca_system_score_gemma":0.0005514412,"threshold_uncertainty_score":0.004437268},"labels":[],"label_agreement":null},{"id":"W4255671196","doi":"10.1145/1081081","title":"Proceedings of the 18th annual symposium on Integrated circuits and system design - SBCCI '05","year":2005,"lang":"en","type":"paratext","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Latin Americans; Library science; Computer science; Event (particle physics); Telecommunications; Political science; Law","score_opus":0.016019846209991678,"score_gpt":0.21915216398377416,"score_spread":0.2031323177737825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255671196","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009592055,0.084326275,0.26840162,0.010245411,0.10365559,0.0011719074,0.0027891777,0.010441503,0.5093764],"genre_scores_gemma":[0.0405611,0.045994688,0.12260885,0.0046044295,0.009052045,0.0007638795,0.0103673935,0.002456007,0.76359165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821043,0.00029542387,0.00010868556,0.00020625348,0.0010308535,0.00014839115],"domain_scores_gemma":[0.99753344,0.0002877317,0.000052661442,0.00037686742,0.0014671623,0.0002821358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022107037,0.0019652552,0.0016634522,0.0016728442,0.00081974466,0.0052553476,0.0019184722,0.0019823255,0.10927883],"category_scores_gemma":[0.0034115952,0.00057650736,0.000983707,0.0011895439,0.0007263418,0.0017924374,0.0014876102,0.0035340872,0.076034196],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00023384858,0.00019161176,0.00054548733,0.00032639923,0.000074096584,0.00020936577,0.00008311841,0.0015379202,0.0055900323,0.007246288,0.66069514,0.3232668],"study_design_scores_gemma":[0.000028080818,0.0001324824,0.0005460741,0.00017018149,0.00004000135,0.00043774827,0.000043600437,0.0042572836,0.0025952884,0.0032166797,0.9885091,0.000023408538],"about_ca_topic_score_codex":0.0023430297,"about_ca_topic_score_gemma":0.0048557534,"teacher_disagreement_score":0.10927883,"about_ca_system_score_codex":0.0014237468,"about_ca_system_score_gemma":0.0019688518,"threshold_uncertainty_score":0.36557412},"labels":[],"label_agreement":null},{"id":"W4256008263","doi":"10.22215/etd/2005-08493","title":"Scheduling algorithms for resilient packet ring networks with video transport applications","year":2005,"lang":"en","type":"dissertation","venue":"","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":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Network packet; Scheduling (production processes); Computer network; Algorithm; Mathematics; Mathematical optimization","score_opus":0.014714095762468113,"score_gpt":0.2655596050789708,"score_spread":0.2508455093165027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256008263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073797114,0.00086736097,0.9159006,0.0005277146,0.00018427562,0.00023026657,0.00016124068,0.0012224385,0.0071090534],"genre_scores_gemma":[0.6630418,0.00063720654,0.3247584,0.00017526741,0.00017217896,0.0002649396,0.00034809017,0.00026437952,0.01033784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999577,0.0001488049,0.000028688815,0.00007874477,0.00007749327,0.00008924092],"domain_scores_gemma":[0.99896264,0.0006452736,0.00010628669,0.00010477836,0.000114484,0.00006656187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013776926,0.00057195395,0.00053257716,0.0007781123,0.0007292597,0.00094624906,0.0014619087,0.0005904535,0.0047439253],"category_scores_gemma":[0.0035294052,0.00039845138,0.0003094731,0.00073722657,0.00036715667,0.0013585505,0.00087514834,0.00062065886,0.00073818583],"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.00044931393,0.00012869328,0.00049039,0.00011700326,0.00003893711,0.000059137317,0.00012563192,0.8184591,0.005304297,0.028915405,0.0058877734,0.14002433],"study_design_scores_gemma":[0.000025592031,0.000043784243,0.0000449104,0.000004490331,0.000005833191,0.0000106256075,0.000017128425,0.9909889,0.0007825185,0.0070877094,0.0009850827,0.0000034051418],"about_ca_topic_score_codex":0.0027279996,"about_ca_topic_score_gemma":0.003301909,"teacher_disagreement_score":0.0047439253,"about_ca_system_score_codex":0.0011178347,"about_ca_system_score_gemma":0.0010076353,"threshold_uncertainty_score":0.015870035},"labels":[],"label_agreement":null},{"id":"W4282050611","doi":"10.1109/fccm53951.2022.9786203","title":"Managing HBM Bandwidth on Multi-Die FPGAs with FPGA Overlay NoCs","year":2022,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Crossbar switch; Field-programmable gate array; Bandwidth (computing); Network on a chip; Throughput; Parallel computing; Overlay; Embedded system; Computer architecture; Computer network; Wireless","score_opus":0.018698751205250747,"score_gpt":0.2271776167145129,"score_spread":0.20847886550926215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282050611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91397554,0.00064553856,0.0764197,0.00014352944,0.00006884077,0.000044136388,0.00009257682,0.0015971238,0.0070129638],"genre_scores_gemma":[0.9739619,0.00011863636,0.02469925,0.000027978122,0.000010668976,0.000024116254,0.000093859904,0.000031478434,0.0010320585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997694,0.00004202393,0.000013661269,0.000037923728,0.00007190718,0.00006513693],"domain_scores_gemma":[0.9996074,0.00010937832,0.000050736577,0.00009315036,0.0000998184,0.000039547354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028809486,0.0003540824,0.00022896205,0.0005370836,0.00030639934,0.00040413867,0.0005200895,0.00018584279,0.0012662213],"category_scores_gemma":[0.0008064432,0.00012269821,0.000121305224,0.0004107291,0.0001658951,0.00069999363,0.00045347522,0.00023268195,0.00014123549],"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.00084217207,0.00026739133,0.015138925,0.00032531266,0.00013122601,0.00068470225,0.00034392418,0.39894673,0.1900046,0.0068797963,0.0060180896,0.38041723],"study_design_scores_gemma":[0.00006067248,0.000944776,0.011068912,0.000042724583,0.000083584884,0.0002861351,0.0002704243,0.8702818,0.1034173,0.0026013735,0.010901732,0.00004063204],"about_ca_topic_score_codex":0.0022860505,"about_ca_topic_score_gemma":0.005367841,"teacher_disagreement_score":0.0022860505,"about_ca_system_score_codex":0.0005971626,"about_ca_system_score_gemma":0.00035436166,"threshold_uncertainty_score":0.0045455694},"labels":[],"label_agreement":null},{"id":"W4287826148","doi":"","title":"Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.052386694198762025,"score_gpt":0.2651282707307061,"score_spread":0.2127415765319441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287826148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84210604,0.00070450356,0.124078,0.0065134987,0.0001535568,0.00010730713,0.0043078973,0.00067350705,0.021355735],"genre_scores_gemma":[0.96781987,0.0004786169,0.022517772,0.00041304663,0.00019683923,0.00011440041,0.0024879407,0.00024024962,0.005731294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797386,0.00060211634,0.000076227705,0.0003932848,0.00043092668,0.00052354997],"domain_scores_gemma":[0.9723847,0.02163898,0.0015663242,0.0019111594,0.00093885354,0.0015601091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016361792,0.00073881005,0.001085314,0.0011282444,0.0009983743,0.0044734757,0.0022606323,0.0021184706,0.013537345],"category_scores_gemma":[0.021012217,0.00071739097,0.0010859666,0.0013572023,0.0013070543,0.0063494123,0.0015544721,0.002481606,0.0008432034],"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.003071701,0.00055604294,0.014734227,0.00091061025,0.00028829515,0.0006949258,0.0006013763,0.47572586,0.015234778,0.4074333,0.030020393,0.0507285],"study_design_scores_gemma":[0.00019171867,0.00015327668,0.0039035245,0.000039743765,0.00008928527,0.00040321145,0.0002175708,0.5752115,0.0032827614,0.41457272,0.0018919897,0.000042596814],"about_ca_topic_score_codex":0.0019796272,"about_ca_topic_score_gemma":0.0023364683,"teacher_disagreement_score":0.013537345,"about_ca_system_score_codex":0.0028523796,"about_ca_system_score_gemma":0.001870725,"threshold_uncertainty_score":0.045286953},"labels":[],"label_agreement":null},{"id":"W4290040450","doi":"10.1142/s0219265921500377","title":"Optimal Broadcasting in Fully Connected Trees","year":2022,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Combinatorics; Dissemination; Graph; Binary logarithm; Discrete mathematics; Mathematics; Computer network; Telecommunications","score_opus":0.011846415244611547,"score_gpt":0.2263594755566411,"score_spread":0.21451306031202955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290040450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3803267,0.0022132304,0.5918582,0.0010383942,0.00011957914,0.00016411662,0.0008118686,0.0013198246,0.022148175],"genre_scores_gemma":[0.8731119,0.0010235137,0.119937174,0.00016772148,0.0000556948,0.0001225299,0.0006239518,0.00014686576,0.0048106154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959356,0.000115309194,0.000022955177,0.00009217559,0.00008287347,0.00009316879],"domain_scores_gemma":[0.9982679,0.0010285074,0.00019764532,0.00017891476,0.00021177834,0.00011513551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003614765,0.0002479304,0.0005430663,0.00044043703,0.00062750524,0.0008769601,0.00064289285,0.0006513632,0.0019674366],"category_scores_gemma":[0.004113317,0.0004053403,0.0002900151,0.0009075134,0.0004878506,0.0015623746,0.00073880516,0.00050889933,0.00036438505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006040384,0.00013377587,0.0012753733,0.0007484252,0.00007770677,0.0002563514,0.0006468926,0.56735754,0.033615276,0.2145266,0.015997875,0.1647601],"study_design_scores_gemma":[0.000072689196,0.000116897674,0.0005660676,0.000041592404,0.000027568114,0.000109221844,0.00011858769,0.83699006,0.004562068,0.15238574,0.00499007,0.00001939058],"about_ca_topic_score_codex":0.002822527,"about_ca_topic_score_gemma":0.0032967061,"teacher_disagreement_score":0.002822527,"about_ca_system_score_codex":0.0009491976,"about_ca_system_score_gemma":0.00094198575,"threshold_uncertainty_score":0.0068870187},"labels":[],"label_agreement":null},{"id":"W4292066621","doi":"10.1007/s11227-022-04749-0","title":"Godiva: green on-chip interconnection for DNNs","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interconnection; Scalability; Overhead (engineering); Efficient energy use; Parallel computing; Embedded system; Computer architecture; Distributed computing; Operating system; Computer network","score_opus":0.02845487092469902,"score_gpt":0.24578314658198339,"score_spread":0.21732827565728435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292066621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19857402,0.004600195,0.6045327,0.0024082905,0.0029255012,0.00046397847,0.0029242502,0.049068354,0.13450271],"genre_scores_gemma":[0.6821721,0.0017252286,0.23692437,0.00092167244,0.00013610255,0.00028995157,0.0031593412,0.0023290722,0.07234211],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984217,0.000023642526,0.0000033418708,0.000027903223,0.000066316716,0.000036643378],"domain_scores_gemma":[0.99978095,0.00003130283,0.000012320139,0.000063574356,0.00006739735,0.000044615845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003224817,0.0005565812,0.00034948057,0.00042993083,0.0006250526,0.00084383506,0.0010618819,0.00047797844,0.008046627],"category_scores_gemma":[0.000434346,0.0001577807,0.0002754881,0.0003629328,0.00036252802,0.0007396987,0.0011489289,0.000857834,0.0013489325],"study_design_candidate":"bench_or_experimental","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.0012043365,0.0003814647,0.00260334,0.0008673502,0.0001713312,0.0005344456,0.00041067423,0.12225723,0.14792463,0.110763475,0.21532378,0.39755794],"study_design_scores_gemma":[0.00018529304,0.000655601,0.0016880066,0.00014791741,0.000101750404,0.00031761348,0.00020578566,0.5011363,0.12830971,0.05308501,0.31406602,0.000100958576],"about_ca_topic_score_codex":0.002069629,"about_ca_topic_score_gemma":0.005920915,"teacher_disagreement_score":0.008046627,"about_ca_system_score_codex":0.0008613413,"about_ca_system_score_gemma":0.0009113546,"threshold_uncertainty_score":0.02691865},"labels":[],"label_agreement":null},{"id":"W4293240324","doi":"10.21203/rs.3.rs-1977082/v1","title":"Pareto technique optimization for 3D NOC architecture","year":2022,"lang":"en","type":"preprint","venue":"Research Square","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 Saskatchewan","funders":"","keywords":"Computer science; Initialization; Pareto principle; Benchmark (surveying); Population; Network topology; Metric (unit); Mathematical optimization; Selection (genetic algorithm); Parallel computing; Mathematics; Engineering; Artificial intelligence; Computer network","score_opus":0.06113900082295693,"score_gpt":0.3791101017785399,"score_spread":0.31797110095558295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293240324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06392824,0.0005707869,0.9232624,0.00022412145,0.000059596754,0.00009162582,0.000120602745,0.00039766904,0.01134498],"genre_scores_gemma":[0.7344744,0.00041859123,0.2583334,0.00013314115,0.000026250998,0.00025344169,0.00029289673,0.00011269185,0.005955091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996295,0.00012484407,0.000010933886,0.000041467774,0.00014489033,0.000048330527],"domain_scores_gemma":[0.9994628,0.00028103212,0.00004424063,0.000035243927,0.00014593653,0.00003074487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083804934,0.0010310197,0.0006260727,0.0015330841,0.00050228456,0.00063993264,0.00065640034,0.0007557249,0.0024851805],"category_scores_gemma":[0.0012687818,0.00033347358,0.0010935138,0.000829247,0.00045833125,0.00044797405,0.000774843,0.00065571506,0.00032116423],"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.000013473703,0.00001810904,0.00019216008,0.000020458992,0.000012137399,0.00002178833,0.000011743703,0.982533,0.0010111028,0.0024436903,0.0003585763,0.013363847],"study_design_scores_gemma":[0.0000020572181,0.000015284048,0.000057790858,0.0000025465008,0.0000019651259,0.0000044320373,0.0000047712115,0.99855,0.00018565737,0.0009504651,0.00022322546,0.0000018060701],"about_ca_topic_score_codex":0.0051186415,"about_ca_topic_score_gemma":0.004018501,"teacher_disagreement_score":0.0051186415,"about_ca_system_score_codex":0.001177681,"about_ca_system_score_gemma":0.0010388176,"threshold_uncertainty_score":0.010177672},"labels":[],"label_agreement":null},{"id":"W4295681833","doi":"10.1007/s10617-022-09265-1","title":"Emulation and verification framework for MPSoC based on NoC and RISC-V","year":2022,"lang":"en","type":"article","venue":"Design Automation for Embedded Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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; Emulation; MPSoC; Embedded system; Scalability; Design space exploration; Correctness; Hardware emulation; Computer architecture; Energy consumption; Software; Multiprocessing; System on a chip; Operating system; Field-programmable gate array","score_opus":0.04028755874784274,"score_gpt":0.27798844575708176,"score_spread":0.23770088700923903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295681833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013549886,0.00020156449,0.9803443,0.00005561599,0.00003681497,0.0001273903,0.00009252423,0.0024131865,0.0031786577],"genre_scores_gemma":[0.5970896,0.00047334607,0.39497882,0.00013409514,0.000046757606,0.00040102197,0.00051514147,0.00045141205,0.0059099095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999398,0.00014474933,0.000040845953,0.0000986334,0.0002350679,0.000082658844],"domain_scores_gemma":[0.99960405,0.0001170911,0.00004389334,0.000085183805,0.00013573261,0.000014171206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009119662,0.0006452134,0.0004900082,0.00059611595,0.0003900366,0.00064809335,0.0012905482,0.00050476304,0.0029297683],"category_scores_gemma":[0.0011383584,0.0002703969,0.0009782317,0.00019808389,0.0004081614,0.0006061494,0.00054172415,0.000600097,0.00034632656],"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.00020774436,0.000103279766,0.0016625772,0.000492828,0.00013965691,0.00061379053,0.00018731554,0.7640726,0.05304612,0.07965536,0.0024254434,0.097393274],"study_design_scores_gemma":[0.00003060743,0.00011370998,0.00032198048,0.000039033945,0.00005233311,0.0001672918,0.000023576731,0.9588282,0.023102919,0.008820974,0.008483071,0.000016321783],"about_ca_topic_score_codex":0.004355326,"about_ca_topic_score_gemma":0.0035815956,"teacher_disagreement_score":0.004355326,"about_ca_system_score_codex":0.0005787172,"about_ca_system_score_gemma":0.001445139,"threshold_uncertainty_score":0.00980109},"labels":[],"label_agreement":null},{"id":"W4298555929","doi":"10.1007/978-3-031-01755-1_3","title":"Topology","year":2017,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Topology (electrical circuits); Logical topology; Computer network; Traverse; Network topology; Computer science; Latency (audio); Interconnection; Node (physics); Engineering; Telecommunications; Geography","score_opus":0.016114590333512264,"score_gpt":0.22998493559315775,"score_spread":0.2138703452596455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298555929","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039139227,0.002094768,0.11542258,0.0013885346,0.0022200912,0.00011223349,0.0037076685,0.0031338504,0.86800647],"genre_scores_gemma":[0.07606402,0.004377871,0.044298656,0.00085129996,0.0009591795,0.00028005935,0.008893926,0.0020223898,0.8622526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997464,0.000024291885,0.00000863872,0.000075648975,0.0001188525,0.000026313728],"domain_scores_gemma":[0.99978524,0.000026734273,0.000013089436,0.00007535359,0.00006919123,0.00003031763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017656844,0.00087218016,0.00055777346,0.0014217279,0.0008341383,0.0020744433,0.0009642297,0.0007018386,0.16090527],"category_scores_gemma":[0.0007162379,0.00034027442,0.00036476494,0.0012162402,0.00055845175,0.002205519,0.0013360573,0.0013475193,0.07464768],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005541719,0.000032997865,0.00012779553,0.00027400962,0.000018298157,0.00014937135,0.00011136451,0.004693048,0.008306656,0.5123748,0.25145617,0.2224001],"study_design_scores_gemma":[0.000011257237,0.000016584872,0.00012333703,0.00003953349,0.000008388693,0.0002586319,0.00004388747,0.0034579344,0.0024686726,0.14322281,0.85033727,0.000011680317],"about_ca_topic_score_codex":0.0005322095,"about_ca_topic_score_gemma":0.00070905423,"teacher_disagreement_score":0.16090527,"about_ca_system_score_codex":0.00054360175,"about_ca_system_score_gemma":0.0005024708,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4300861755","doi":"10.32920/21262362","title":"Packet-based Adaptive Virtual Channel Configuration for NoC Systems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Interconnection Networks and 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":"Toronto Metropolitan University","funders":"","keywords":"Virtual channel; Computer science; Network packet; Router; Computer network; Latency (audio); Queue; Channel (broadcasting); Network on a chip; Throughput; Operating system; Wireless; Telecommunications","score_opus":0.04721709989862587,"score_gpt":0.2656676579024678,"score_spread":0.21845055800384194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300861755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10256774,0.001807872,0.8835912,0.00023756265,0.00038288566,0.00015139146,0.00015906185,0.0028727725,0.008229465],"genre_scores_gemma":[0.9106984,0.00035922043,0.08575595,0.00008385042,0.000058633905,0.000094353454,0.00018177879,0.00006523206,0.002702599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.000112050046,0.000023344093,0.000060288607,0.000099811085,0.00006821367],"domain_scores_gemma":[0.9995047,0.00014621807,0.000048032638,0.00010096817,0.00015699331,0.000043115593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035684524,0.00031198253,0.0003168227,0.0004946343,0.00039267316,0.00066405226,0.0009050416,0.00027604867,0.0018620383],"category_scores_gemma":[0.00094479584,0.00014657824,0.00012581961,0.00052051403,0.00030577366,0.000681816,0.000554114,0.0004088883,0.00020921716],"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.0006101197,0.0001738037,0.0020726896,0.00023450694,0.000063019004,0.0003277187,0.000120418095,0.55144894,0.06233637,0.030021597,0.009839568,0.34275126],"study_design_scores_gemma":[0.000023713792,0.000118381744,0.000333049,0.000011447289,0.000016073904,0.00010837843,0.000026120022,0.9778561,0.011577705,0.0049201953,0.004989011,0.00001974145],"about_ca_topic_score_codex":0.0014112648,"about_ca_topic_score_gemma":0.0013536414,"teacher_disagreement_score":0.0018620383,"about_ca_system_score_codex":0.000646653,"about_ca_system_score_gemma":0.0004981518,"threshold_uncertainty_score":0.006229162},"labels":[],"label_agreement":null},{"id":"W4300861947","doi":"10.32920/21262362.v1","title":"Packet-based Adaptive Virtual Channel Configuration for NoC Systems","year":2022,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Virtual channel; Network packet; Computer science; Router; Computer network; Latency (audio); Queue; Channel (broadcasting); Throughput; Network on a chip; Operating system; Wireless; Telecommunications","score_opus":0.04721709989862587,"score_gpt":0.2656676579024678,"score_spread":0.21845055800384194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300861947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10256774,0.001807872,0.8835912,0.00023756265,0.00038288566,0.00015139146,0.00015906185,0.0028727725,0.008229465],"genre_scores_gemma":[0.9106984,0.00035922043,0.08575595,0.00008385042,0.000058633905,0.000094353454,0.00018177879,0.00006523206,0.002702599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.000112050046,0.000023344093,0.000060288607,0.000099811085,0.00006821367],"domain_scores_gemma":[0.9995047,0.00014621807,0.000048032638,0.00010096817,0.00015699331,0.000043115593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035684524,0.00031198253,0.0003168227,0.0004946343,0.00039267316,0.00066405226,0.0009050416,0.00027604867,0.0018620383],"category_scores_gemma":[0.00094479584,0.00014657824,0.00012581961,0.00052051403,0.00030577366,0.000681816,0.000554114,0.0004088883,0.00020921716],"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.0006101197,0.0001738037,0.0020726896,0.00023450694,0.000063019004,0.0003277187,0.000120418095,0.55144894,0.06233637,0.030021597,0.009839568,0.34275126],"study_design_scores_gemma":[0.000023713792,0.000118381744,0.000333049,0.000011447289,0.000016073904,0.00010837843,0.000026120022,0.9778561,0.011577705,0.0049201953,0.004989011,0.00001974145],"about_ca_topic_score_codex":0.0014112648,"about_ca_topic_score_gemma":0.0013536414,"teacher_disagreement_score":0.0018620383,"about_ca_system_score_codex":0.000646653,"about_ca_system_score_gemma":0.0004981518,"threshold_uncertainty_score":0.006229162},"labels":[],"label_agreement":null},{"id":"W4301657875","doi":"","title":"HyperFPGA: A possible general purpose reconfigurable hardware for custom supercomputing","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Microsemi (Canada)","funders":"","keywords":"Supercomputer; Computer science; Computer architecture; Parallel computing; Reconfigurable computing; Field-programmable gate array; Computer hardware; Embedded system","score_opus":0.015116036428243102,"score_gpt":0.2167653569473545,"score_spread":0.20164932051911139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301657875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18608809,0.003107579,0.6760909,0.0009820958,0.001136646,0.00040652606,0.001753203,0.08659754,0.04383741],"genre_scores_gemma":[0.6271253,0.0010855584,0.30989334,0.00095604156,0.00024123855,0.00034171762,0.0032146694,0.0044974084,0.052644636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997974,0.000030313024,0.000012379702,0.0000471817,0.000047746966,0.000064953456],"domain_scores_gemma":[0.9996014,0.00009030972,0.000025512094,0.00014455046,0.00007300166,0.000065139146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038399984,0.00082945445,0.0004938968,0.00054691284,0.00038082912,0.0012985818,0.0021957085,0.0008131341,0.022893883],"category_scores_gemma":[0.0006757031,0.00043704204,0.00045846298,0.0005895245,0.0004004698,0.0012597253,0.00078588276,0.00083252083,0.0043465793],"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.005129844,0.00039390137,0.0040225135,0.000875687,0.0002320261,0.000970185,0.000563542,0.025283584,0.36421022,0.03331737,0.07572899,0.4892722],"study_design_scores_gemma":[0.0007527011,0.0017851029,0.0057490715,0.00028805924,0.00029361606,0.0014416745,0.00024063337,0.25719398,0.37850794,0.021742301,0.331724,0.00028096908],"about_ca_topic_score_codex":0.0012015502,"about_ca_topic_score_gemma":0.0011563816,"teacher_disagreement_score":0.022893883,"about_ca_system_score_codex":0.0005249212,"about_ca_system_score_gemma":0.00034094075,"threshold_uncertainty_score":0.07658762},"labels":[],"label_agreement":null},{"id":"W4312641908","doi":"10.1109/ispdc55340.2022.00010","title":"[Full] Deep Heuristic for Broadcasting in Arbitrary Networks","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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","funders":"","keywords":"Heuristics; Computer science; Broadcasting (networking); Heuristic; Vertex (graph theory); Graph; Theoretical computer science; Computer network; Artificial intelligence","score_opus":0.013980630325432694,"score_gpt":0.22455780617160503,"score_spread":0.21057717584617233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312641908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031143218,0.00050400785,0.9419063,0.0006859028,0.00020165081,0.00040615053,0.00048202323,0.002338373,0.022332387],"genre_scores_gemma":[0.25706542,0.00028812455,0.7313987,0.00055798655,0.00006114165,0.000395982,0.0009078332,0.00045288855,0.00887189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994605,0.00016561057,0.000024932402,0.00007433877,0.00012712729,0.00014753341],"domain_scores_gemma":[0.999005,0.00041009928,0.000065015774,0.00023619205,0.00019514549,0.00008855639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077688944,0.00064078765,0.00073577475,0.0007771379,0.0008320247,0.0008237479,0.002040842,0.0012346015,0.0077986275],"category_scores_gemma":[0.0027998325,0.00043954139,0.00063233904,0.0010218789,0.0007778239,0.001262962,0.0012249483,0.0010475867,0.001422292],"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.0003386977,0.00027687565,0.0007316443,0.00029459473,0.000073232,0.00012966113,0.00016660112,0.6580264,0.005846674,0.058985867,0.022195436,0.25293437],"study_design_scores_gemma":[0.00008141616,0.00006479793,0.00013594172,0.000023396657,0.000026716942,0.000047627145,0.00003344261,0.96866477,0.00195972,0.020014333,0.00893222,0.000015634601],"about_ca_topic_score_codex":0.0073754825,"about_ca_topic_score_gemma":0.009225304,"teacher_disagreement_score":0.0077986275,"about_ca_system_score_codex":0.0012648092,"about_ca_system_score_gemma":0.0025841382,"threshold_uncertainty_score":0.026089072},"labels":[],"label_agreement":null},{"id":"W4313342923","doi":"10.1007/978-3-031-22105-7_41","title":"The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Square tiling; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Mathematics; Path (computing); Graph; Hamiltonian path problem; Discrete mathematics; Grid; Square (algebra); Topology (electrical circuits); Geometry; Computer science","score_opus":0.013598181428121399,"score_gpt":0.23224372402874752,"score_spread":0.21864554260062613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313342923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6391969,0.0011920518,0.14229557,0.0009995988,0.0004158246,0.000205532,0.0014619343,0.0007859027,0.21344669],"genre_scores_gemma":[0.92790395,0.00085987593,0.038723398,0.00028229077,0.00009166806,0.00017031934,0.000988448,0.00019750757,0.030782515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99989915,0.00001705953,0.000004349721,0.00003573453,0.000021966707,0.000021767884],"domain_scores_gemma":[0.9995881,0.00019351939,0.00006111104,0.000045964047,0.000050572657,0.000060821378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096084084,0.00032901778,0.00036472597,0.0007759453,0.0010998626,0.0012898331,0.00054054434,0.00076750596,0.010612147],"category_scores_gemma":[0.0008128692,0.00042627694,0.00041781913,0.0012135092,0.0009846485,0.0015008543,0.0007218107,0.00080488203,0.00089922274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020141687,0.00005012778,0.0007919716,0.00042384735,0.00003695697,0.0004614732,0.00059596065,0.012000302,0.011607168,0.9158777,0.012630164,0.04532295],"study_design_scores_gemma":[0.000051913183,0.00006460324,0.0016809723,0.000040527655,0.000036309117,0.00046010147,0.0003375621,0.023077907,0.0027496181,0.9573856,0.014092874,0.000022055821],"about_ca_topic_score_codex":0.0015557648,"about_ca_topic_score_gemma":0.0022369055,"teacher_disagreement_score":0.010612147,"about_ca_system_score_codex":0.0004376159,"about_ca_system_score_gemma":0.00041741424,"threshold_uncertainty_score":0.035501182},"labels":[],"label_agreement":null},{"id":"W4313372307","doi":"10.1007/978-3-031-17658-6_3","title":"Broadcast Graphs with Nodes of Limited Memory","year":2022,"lang":"en","type":"book-chapter","venue":"Springer proceedings in complexity","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Hypercube; Communication source; Graph; Vertex (graph theory); Theoretical computer science; Upper and lower bounds; Computer network; Mathematics; Parallel computing","score_opus":0.04348887798121863,"score_gpt":0.2305114781229854,"score_spread":0.18702260014176675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313372307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11470845,0.0061321678,0.5318243,0.005701023,0.0011345717,0.00020015756,0.001927413,0.0021838807,0.33618805],"genre_scores_gemma":[0.61223054,0.0067831003,0.12426384,0.0010052209,0.0006337207,0.00039122274,0.0013509387,0.00066751556,0.25267386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998783,0.000029746649,0.000005190132,0.000029778836,0.000035985347,0.000020976138],"domain_scores_gemma":[0.9992644,0.00037536773,0.000047970556,0.00017367284,0.00008879735,0.000049796265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015239065,0.00037632385,0.00042384132,0.0005477259,0.0006415093,0.0011346855,0.00094712037,0.00050401705,0.011657169],"category_scores_gemma":[0.0011328349,0.00046039035,0.0002562262,0.0009685986,0.0006050282,0.0020866294,0.0007154666,0.0010865838,0.0018716067],"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.000112498405,0.00003308406,0.00012583373,0.00030397865,0.00002067321,0.00014451763,0.0001834465,0.024923664,0.006494899,0.87200654,0.031903483,0.06374739],"study_design_scores_gemma":[0.000035792582,0.00003670475,0.0002468838,0.00007820511,0.00003396095,0.0002405955,0.00010864903,0.04790154,0.0035859924,0.88275474,0.06495952,0.000017410805],"about_ca_topic_score_codex":0.00121831,"about_ca_topic_score_gemma":0.0019991572,"teacher_disagreement_score":0.011657169,"about_ca_system_score_codex":0.00081144983,"about_ca_system_score_gemma":0.00050606666,"threshold_uncertainty_score":0.038997173},"labels":[],"label_agreement":null},{"id":"W4316658784","doi":"10.1109/mcsoc57363.2022.00061","title":"Turn-aware Application Mapping using Reinforcement Learning in Power Gating-enabled Network on Chip","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Victoria","funders":"","keywords":"Computer science; Reinforcement learning; Network packet; Router; Network on a chip; Power gating; Heuristic; Simulated annealing; Latency (audio); Real-time computing; Distributed computing; Embedded system; Computer network; Artificial intelligence; Algorithm; Engineering","score_opus":0.019321625366015432,"score_gpt":0.23609627082962598,"score_spread":0.21677464546361055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316658784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11348777,0.0006617031,0.87970513,0.00034978648,0.00007888091,0.00008196015,0.000019073022,0.000600169,0.005015401],"genre_scores_gemma":[0.9746309,0.000121103236,0.02404462,0.00008200352,0.000012317226,0.000055608038,0.000015315345,0.000019330706,0.0010188086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.00006955403,0.000009602911,0.000051838884,0.00005373433,0.00005397006],"domain_scores_gemma":[0.9995902,0.00021340861,0.000062558414,0.000022467097,0.00007368069,0.000037745274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058820634,0.0005718951,0.0006201968,0.00024084738,0.00028999738,0.0004629927,0.0007561431,0.00054883095,0.00082478585],"category_scores_gemma":[0.0012341923,0.00027431524,0.0003087187,0.00020222487,0.00064334465,0.00041720778,0.00055951305,0.0006702106,0.000085714186],"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.000027696367,0.000035392753,0.00038275245,0.000017509275,0.000013529784,0.000038233855,0.000019178384,0.98128325,0.0017040406,0.0011684272,0.0002056323,0.015104388],"study_design_scores_gemma":[0.0000036697797,0.000017263403,0.000037862694,0.0000012850653,0.000002835429,0.0000042445736,0.0000018120977,0.9992623,0.00023032671,0.00037428454,0.00006260705,0.0000015113579],"about_ca_topic_score_codex":0.006154631,"about_ca_topic_score_gemma":0.004653254,"teacher_disagreement_score":0.006154631,"about_ca_system_score_codex":0.00060874654,"about_ca_system_score_gemma":0.0009683951,"threshold_uncertainty_score":0.012237608},"labels":[],"label_agreement":null},{"id":"W4319586632","doi":"10.1109/candar57322.2022.00011","title":"A Recurrence for the Surface Area of the ($n, k$)-Star Graph","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Star (game theory); Graph; Computer science; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.029548908168599123,"score_gpt":0.23279250306015292,"score_spread":0.2032435948915538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319586632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15443924,0.0019462834,0.787791,0.0011713878,0.00044596675,0.00012642545,0.00085981854,0.000823768,0.05239605],"genre_scores_gemma":[0.802376,0.0018385081,0.17084248,0.00032474875,0.00041675626,0.000366813,0.0012758058,0.0007795208,0.021779362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995827,0.00007300461,0.000030256035,0.00010760939,0.00012834906,0.00007812266],"domain_scores_gemma":[0.9987281,0.0005832374,0.00014123274,0.000118224016,0.00034733955,0.00008199704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004748287,0.00055480265,0.0006303543,0.0015008978,0.00058261893,0.0009415353,0.0009423883,0.0005973157,0.005684802],"category_scores_gemma":[0.003988037,0.00023955139,0.0008787161,0.001231468,0.0010360245,0.002244372,0.0009682494,0.0011200155,0.0016829323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009017778,0.00004071269,0.0030516572,0.0003356341,0.00003193574,0.00090819073,0.000657439,0.07808859,0.022147458,0.7842146,0.013720318,0.0967133],"study_design_scores_gemma":[0.000018122133,0.000068124806,0.0017794261,0.0000560219,0.000038686514,0.0007915525,0.00014830368,0.37341157,0.0082420325,0.5946555,0.020722741,0.000067849236],"about_ca_topic_score_codex":0.0016077206,"about_ca_topic_score_gemma":0.0016819976,"teacher_disagreement_score":0.005684802,"about_ca_system_score_codex":0.0009329542,"about_ca_system_score_gemma":0.00043618388,"threshold_uncertainty_score":0.019017518},"labels":[],"label_agreement":null},{"id":"W431959137","doi":"","title":"Studies of interconnection networks with applications in broadcasting","year":2007,"lang":"en","type":"book","venue":"Spectrum Research Repository (Concordia University)","topic":"Interconnection Networks and 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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); Interconnection; Heuristic; Graph; Computer network; Constant (computer programming); Theoretical computer science; Broadcast communication network; Distributed computing","score_opus":0.04599407038618806,"score_gpt":0.29052928417527296,"score_spread":0.2445352137890849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W431959137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10449273,0.06131489,0.60624254,0.010157483,0.0010051786,0.00012623277,0.00021190131,0.00032299137,0.21612597],"genre_scores_gemma":[0.8345899,0.057587378,0.079533815,0.00067843613,0.001978377,0.00033305233,0.0002373164,0.0002016198,0.02486015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00027695438,0.000035482495,0.00011499618,0.00021602435,0.00008070878],"domain_scores_gemma":[0.9955747,0.0034655854,0.0003002206,0.00018643112,0.00040178475,0.000071326045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091931457,0.0005567826,0.00045450113,0.001416448,0.0010284303,0.0017380863,0.0007128987,0.0013061409,0.0036284437],"category_scores_gemma":[0.006510352,0.00051067636,0.0005488762,0.0031958323,0.0019820083,0.0030483275,0.0006465178,0.0018831401,0.00043778407],"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.00001638674,0.000019258903,0.00039806645,0.00022156473,0.0000149925845,0.00009715265,0.00026844998,0.045979828,0.001127236,0.93374777,0.0018002121,0.016309125],"study_design_scores_gemma":[0.0000167757,0.000057782552,0.0006226759,0.00015630091,0.00002708764,0.00025878742,0.00021727277,0.15273276,0.00100098,0.80525154,0.039638598,0.000019422665],"about_ca_topic_score_codex":0.0022958815,"about_ca_topic_score_gemma":0.0012055811,"teacher_disagreement_score":0.0036284437,"about_ca_system_score_codex":0.0023316625,"about_ca_system_score_gemma":0.0006499751,"threshold_uncertainty_score":0.016917467},"labels":[],"label_agreement":null},{"id":"W4321637172","doi":"10.1109/fpl57034.2022.00072","title":"RAD-Sim: Rapid Architecture Exploration for Novel Reconfigurable Acceleration Devices","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Design space exploration; Computer architecture; Architecture; Embedded system; Acceleration; Hardware acceleration","score_opus":0.05360408767995727,"score_gpt":0.2541476348583884,"score_spread":0.20054354717843115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321637172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7294508,0.0007061646,0.23089273,0.0005007423,0.00015180558,0.00023014241,0.001891832,0.0053838026,0.030791966],"genre_scores_gemma":[0.8587001,0.00025761037,0.13662618,0.00013558577,0.000012053918,0.00019594896,0.0009329339,0.0004158092,0.0027237297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984884,0.000043633896,0.000004958092,0.000017489006,0.000055658875,0.000029356805],"domain_scores_gemma":[0.9996265,0.00021792947,0.000028011895,0.00005468257,0.000049027654,0.000023916331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004517322,0.00061977486,0.00031617665,0.0003647211,0.00025527156,0.00047474637,0.0011649227,0.00060178863,0.0038293118],"category_scores_gemma":[0.0010981817,0.0003596886,0.0005873322,0.00025253248,0.00039565476,0.00064438867,0.00045301727,0.0008157806,0.00031055365],"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.00006187982,0.00004179913,0.0016717875,0.00009032969,0.000027484683,0.000062523206,0.000049470964,0.9818382,0.0041405912,0.0043928,0.0012595952,0.0063634696],"study_design_scores_gemma":[0.000011948339,0.000035511723,0.00015791923,0.0000053097197,0.0000042415054,0.000010261238,0.000012132726,0.9958353,0.0017917888,0.0008754407,0.0012565627,0.0000035680084],"about_ca_topic_score_codex":0.0038047237,"about_ca_topic_score_gemma":0.0060754344,"teacher_disagreement_score":0.0038293118,"about_ca_system_score_codex":0.0006768729,"about_ca_system_score_gemma":0.00095997046,"threshold_uncertainty_score":0.01281029},"labels":[],"label_agreement":null},{"id":"W4327701551","doi":"10.1117/12.2657144","title":"Design and analysis of on-chip optical phase array systems for satellite communications","year":2023,"lang":"en","type":"article","venue":"","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 Toronto; Carleton University; York University; Honeywell (Canada)","funders":"","keywords":"Beam steering; Synchronizing; Computer science; Free-space optical communication; Optical communication; Communications satellite; Telecommunications; Satellite; Aerospace engineering; Electronic engineering; Engineering; Antenna (radio)","score_opus":0.09468466918165067,"score_gpt":0.3341485937761873,"score_spread":0.2394639245945366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327701551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05101717,0.0014826381,0.9130364,0.00032554023,0.000114685754,0.00016063744,0.000107914064,0.0004181566,0.03333685],"genre_scores_gemma":[0.8725588,0.0021415642,0.1105549,0.00009964836,0.00008127589,0.0002801205,0.00014681304,0.000098780154,0.01403812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972135,0.00005990629,0.0000048499414,0.000031375315,0.00014784843,0.000034561996],"domain_scores_gemma":[0.9998204,0.000065886234,0.000027599352,0.000014632723,0.00006427386,0.000007145825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026995258,0.0004192107,0.00031999612,0.00020913698,0.0002578424,0.000971137,0.00043455802,0.00042461252,0.00304384],"category_scores_gemma":[0.0007719598,0.00027374725,0.0003177665,0.00021901417,0.00034608776,0.0004329884,0.00023590584,0.00042906837,0.000616821],"study_design_candidate":"bench_or_experimental","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.000048597612,0.000044344273,0.0004468911,0.00018705707,0.000038871825,0.00005819558,0.00005330455,0.8901433,0.03265581,0.031061884,0.0011707966,0.04409101],"study_design_scores_gemma":[0.000005999464,0.000059526934,0.00019533213,0.00000849629,0.000008814193,0.00001903263,0.00001238817,0.9908228,0.0037689498,0.0025973988,0.0024969259,0.0000043977866],"about_ca_topic_score_codex":0.002024996,"about_ca_topic_score_gemma":0.002539713,"teacher_disagreement_score":0.00304384,"about_ca_system_score_codex":0.00074795523,"about_ca_system_score_gemma":0.0008856408,"threshold_uncertainty_score":0.010182619},"labels":[],"label_agreement":null},{"id":"W4327781405","doi":"10.1109/sds57574.2022.10062950","title":"Optimizing System-on-Chip Performance Using AI and SDN: Approaches and Challenges","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Computer science; Cloud computing; Software; Embedded system; Computer architecture; Edge device; Key (lock); Edge computing; Enhanced Data Rates for GSM Evolution; Software-defined networking; Networking hardware; System on a chip; Chip; Distributed computing; Operating system; Artificial intelligence; Telecommunications","score_opus":0.09703353110020647,"score_gpt":0.22957582277994013,"score_spread":0.13254229167973364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327781405","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048004005,0.06666366,0.8207478,0.0156082045,0.0007903975,0.00014778799,0.00012871723,0.0015261843,0.046383224],"genre_scores_gemma":[0.73977095,0.025230689,0.22633584,0.0009224367,0.0005941358,0.0001776733,0.00012494704,0.00030774967,0.006535631],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867356,0.00039777538,0.00006741977,0.00018954383,0.0005307843,0.00014102327],"domain_scores_gemma":[0.9977024,0.0010284366,0.00017895673,0.00028411948,0.00064237154,0.00016368894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028793076,0.0009752171,0.0008478052,0.0007060718,0.0005909264,0.0034876675,0.0025838001,0.0012058573,0.0015978545],"category_scores_gemma":[0.0031193425,0.00043660653,0.0003334364,0.0012164952,0.0015682688,0.004242141,0.0012870455,0.002297126,0.00045703223],"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.00015140107,0.00027369606,0.0017571477,0.0009323815,0.000116745294,0.00008566664,0.00026022719,0.3472053,0.011639732,0.19697987,0.006796426,0.4338014],"study_design_scores_gemma":[0.000022309634,0.00015705585,0.00036043097,0.00014393368,0.00003915127,0.00005538743,0.00023718728,0.8824542,0.005512112,0.08475878,0.026220644,0.000038803602],"about_ca_topic_score_codex":0.0030689177,"about_ca_topic_score_gemma":0.0033904663,"teacher_disagreement_score":0.0034876675,"about_ca_system_score_codex":0.0017717673,"about_ca_system_score_gemma":0.0019931982,"threshold_uncertainty_score":0.015227437},"labels":[],"label_agreement":null},{"id":"W4327884581","doi":"10.1007/978-3-031-29056-5_30","title":"Efficient Heuristic for Broadcasting in Chordal Networks","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Network topology; Computer science; Computer network; Heuristic; Node (physics); Distributed computing; Scope (computer science); Chordal graph; Broadcast domain; Theoretical computer science; Atomic broadcast; Engineering; Graph","score_opus":0.023379415387318647,"score_gpt":0.23763540408200148,"score_spread":0.21425598869468285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327884581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07221425,0.0012641439,0.8872283,0.0008397124,0.00043437025,0.0007457461,0.00065589894,0.0024375147,0.034180034],"genre_scores_gemma":[0.28651914,0.00050904136,0.70261616,0.00020681285,0.00012929818,0.0003573612,0.0008763758,0.00041577496,0.0083700605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912304,0.00025193396,0.000042906464,0.00013475037,0.00020571997,0.00024170717],"domain_scores_gemma":[0.9967505,0.0021153146,0.00010072731,0.00042693134,0.00033820354,0.0002683752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011667373,0.0010938795,0.0015615196,0.001405361,0.0015512663,0.0017277712,0.0037530453,0.0015843735,0.011225163],"category_scores_gemma":[0.0060094716,0.0007234167,0.0007711543,0.0018466242,0.0011332057,0.002519107,0.0021940272,0.0016684963,0.0012668878],"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.0014827244,0.0006448771,0.00079117593,0.0009741069,0.00011842438,0.00020339435,0.00046317512,0.50757974,0.010108289,0.10499752,0.029033624,0.34360296],"study_design_scores_gemma":[0.00030789047,0.00015258291,0.00012671748,0.00005002102,0.000051539995,0.00008259863,0.00020403875,0.94010174,0.0029886665,0.050827384,0.0050822934,0.000024515362],"about_ca_topic_score_codex":0.0056556566,"about_ca_topic_score_gemma":0.008899612,"teacher_disagreement_score":0.011225163,"about_ca_system_score_codex":0.0023897497,"about_ca_system_score_gemma":0.0030431715,"threshold_uncertainty_score":0.03755194},"labels":[],"label_agreement":null},{"id":"W4360764597","doi":"10.1109/ispa-bdcloud-socialcom-sustaincom57177.2022.00065","title":"Reuse-Aware Partitioning of Dataflow Graphs on a Tightly-Coupled CGRA","year":2022,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Dataflow; Computer science; Parallel computing; Cache; Partition (number theory); Limit (mathematics); Reuse; CPU cache; Distributed computing; Mathematics","score_opus":0.01848065368098811,"score_gpt":0.22611582503225078,"score_spread":0.20763517135126267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360764597","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06549525,0.0001476198,0.9261744,0.00023896064,0.000033378667,0.00008811611,0.00012924295,0.00039967307,0.007293346],"genre_scores_gemma":[0.7123152,0.00019299035,0.28146264,0.00015929124,0.000024899859,0.00019750012,0.0002728144,0.00018395137,0.0051906877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965763,0.000074431686,0.000011296796,0.00008158266,0.00009346552,0.00008161113],"domain_scores_gemma":[0.99953604,0.00021760406,0.00007058818,0.00006509887,0.000078001176,0.00003270712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048415497,0.00075203524,0.00049203646,0.00031624507,0.0003908085,0.00076894846,0.00094908965,0.00065006985,0.0024190247],"category_scores_gemma":[0.0011623607,0.0003780462,0.0008942125,0.000389722,0.00061087235,0.00078063447,0.0007398486,0.00069262687,0.0002912337],"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.000014490427,0.000014110549,0.00021024748,0.000027388054,0.000007672219,0.00004098718,0.00002342604,0.9845574,0.0026790977,0.00531847,0.00027762464,0.0068289856],"study_design_scores_gemma":[0.000003994589,0.000017271137,0.000062970204,0.0000032036444,0.0000042762845,0.000010612509,0.000011486573,0.9956957,0.00055202405,0.0031109566,0.00052521256,0.00000220249],"about_ca_topic_score_codex":0.008726794,"about_ca_topic_score_gemma":0.012326454,"teacher_disagreement_score":0.008726794,"about_ca_system_score_codex":0.0012267119,"about_ca_system_score_gemma":0.0015145852,"threshold_uncertainty_score":0.017352045},"labels":[],"label_agreement":null},{"id":"W4365456027","doi":"10.1016/j.dam.2023.03.002","title":"Broadcast graphs using new dimensional broadcast schemes for Knödel graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Hypercube; Graph; Upper and lower bounds; Discrete mathematics","score_opus":0.04483337236795438,"score_gpt":0.28415459781928093,"score_spread":0.23932122545132656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365456027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047930054,0.00029713794,0.93210876,0.00068205124,0.0002648224,0.00016466326,0.0003662095,0.0008543836,0.017331867],"genre_scores_gemma":[0.6527413,0.00063108205,0.3186389,0.00044137606,0.00017522584,0.00034254594,0.0006737964,0.0003668196,0.025988847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990428,0.0003495868,0.00005516769,0.00016021119,0.00024507716,0.00014717488],"domain_scores_gemma":[0.9968341,0.0011922453,0.00021148061,0.0011180562,0.00040951298,0.00023461449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241027,0.0004699693,0.00075534696,0.0009310153,0.0011556455,0.001892895,0.0015937915,0.0009855157,0.007050113],"category_scores_gemma":[0.005327885,0.0003658011,0.00065684214,0.001113872,0.0011434006,0.0031644488,0.002622204,0.0018177469,0.0010113987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035603726,0.0001208342,0.00031275034,0.0001630925,0.000034788733,0.000075003336,0.00033387454,0.14291443,0.008064096,0.7675741,0.008749441,0.07130148],"study_design_scores_gemma":[0.00007682238,0.000106562664,0.00014916813,0.000043060056,0.00003671657,0.00007885739,0.000137701,0.6126072,0.004113077,0.3718126,0.010793027,0.00004514721],"about_ca_topic_score_codex":0.0029180022,"about_ca_topic_score_gemma":0.005723141,"teacher_disagreement_score":0.007050113,"about_ca_system_score_codex":0.0022306703,"about_ca_system_score_gemma":0.0012661302,"threshold_uncertainty_score":0.023585021},"labels":[],"label_agreement":null},{"id":"W4365797342","doi":"10.32913/mic-ict-research-vn.v1.n33.186","title":"Xây dựng tô-pô mạng liên kết 3 chiều dựa trên kiến trúc DSN nhằm thích ứng cài đặt thực tế","year":2015,"lang":"en","type":"article","venue":"Journal on Information Technologies & Communications","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":"Hatch (Canada)","funders":"","keywords":"Network topology; Torus; NASA Deep Space Network; Topology (electrical circuits); Routing (electronic design automation); Integer (computer science); Computer science; Interconnection; Base (topology); Discrete mathematics; Mathematics; Combinatorics; Computer network; Physics; Geometry; Operating system","score_opus":0.053881549967498055,"score_gpt":0.28241612790359444,"score_spread":0.22853457793609638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365797342","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061654866,0.028530791,0.04372969,0.01760203,0.015630921,0.0002664862,0.0036047383,0.0053506834,0.82362974],"genre_scores_gemma":[0.16966379,0.0075455005,0.017224664,0.0009876951,0.00043657457,0.00013713526,0.002303259,0.0009876997,0.8007136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00004520397,0.0000147061655,0.00014295818,0.00016585147,0.000091508584],"domain_scores_gemma":[0.999508,0.000078085475,0.000037773352,0.000040913685,0.00019383985,0.00014140207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039406025,0.0008066465,0.00057769293,0.0007047511,0.0018097112,0.001953558,0.00047727436,0.0009910081,0.14082177],"category_scores_gemma":[0.0011128469,0.00030031154,0.00030010004,0.0005675342,0.00044229603,0.0017092981,0.0017375586,0.0014101114,0.06435878],"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.0009410315,0.00014011563,0.0045794407,0.0009227172,0.00004335731,0.0022741202,0.0007638605,0.0051697493,0.017173063,0.047921624,0.29574212,0.62432873],"study_design_scores_gemma":[0.000018901888,0.00010317931,0.0026240372,0.00020442446,0.000019969553,0.00095561234,0.0005853087,0.0059949956,0.009916816,0.0043360502,0.9751789,0.00006180987],"about_ca_topic_score_codex":0.004748991,"about_ca_topic_score_gemma":0.0051226234,"teacher_disagreement_score":0.14082177,"about_ca_system_score_codex":0.0014152694,"about_ca_system_score_gemma":0.0012700235,"threshold_uncertainty_score":0.47109574},"labels":[],"label_agreement":null},{"id":"W4366958160","doi":"10.1007/978-3-031-30448-4_20","title":"Broadcasting in Split Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Network topology; Heuristic; Scope (computer science); Node (physics); Time complexity; Computer network; Distributed computing; Theoretical computer science; Algorithm","score_opus":0.026584700248262115,"score_gpt":0.24605594015525825,"score_spread":0.21947123990699613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366958160","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17227241,0.00961061,0.3185078,0.0022134287,0.0006832248,0.0001596801,0.0009504852,0.0012858132,0.49431655],"genre_scores_gemma":[0.6714047,0.009948717,0.07050665,0.0006751154,0.00051602215,0.00023612489,0.0017028839,0.0007621921,0.24424765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987555,0.000025789237,0.0000048071424,0.000030299036,0.00004067402,0.000022959986],"domain_scores_gemma":[0.9995714,0.00021422839,0.00003246191,0.00008145388,0.000057432957,0.000043029246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015947825,0.00034197574,0.0004793557,0.00090436405,0.0006070605,0.001017949,0.00051104155,0.00043614602,0.010879264],"category_scores_gemma":[0.0010041981,0.00037615674,0.00028525048,0.0014687274,0.0006030992,0.0017663025,0.0008180669,0.0010818507,0.001907466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098687495,0.000027888485,0.00016216599,0.00022449424,0.000020090254,0.00009690931,0.0002779183,0.011013109,0.004771101,0.89063436,0.019742904,0.07293024],"study_design_scores_gemma":[0.000019535692,0.000025290059,0.0002766718,0.00004090296,0.00002110039,0.00017489992,0.000097174874,0.028731244,0.0018285253,0.94036776,0.028408581,0.000008356789],"about_ca_topic_score_codex":0.0010714164,"about_ca_topic_score_gemma":0.0013588488,"teacher_disagreement_score":0.010879264,"about_ca_system_score_codex":0.0007800845,"about_ca_system_score_gemma":0.00035279224,"threshold_uncertainty_score":0.036394835},"labels":[],"label_agreement":null},{"id":"W4378806021","doi":"10.1109/vlsi-tsa/vlsi-dat57221.2023.10134194","title":"Heterogeneous Integration with 3D Chiplets","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Modular design; Computer science; Process (computing); Computer architecture; Power consumption; Architecture; Power demand; Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Supercomputer; On demand; Embedded system; Power (physics); Parallel computing; Telecommunications; Operating system; Multimedia","score_opus":0.01660785192678292,"score_gpt":0.2256143337515299,"score_spread":0.20900648182474696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378806021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30561662,0.0062315166,0.59501463,0.0011986969,0.0022744497,0.00023164455,0.0007061294,0.005471613,0.083254695],"genre_scores_gemma":[0.71799415,0.0024901396,0.26518884,0.0006453149,0.00018083329,0.00017605179,0.00073349103,0.00042778117,0.012163369],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996431,0.000045052446,0.000016339292,0.00006237543,0.00018400385,0.00004921529],"domain_scores_gemma":[0.9996784,0.00004030315,0.000043685664,0.0001187539,0.000084992214,0.000033854092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032971642,0.00047132507,0.0004103876,0.00035899816,0.00025077688,0.0013634735,0.0009432395,0.00094252615,0.002148107],"category_scores_gemma":[0.0005310382,0.00041099289,0.0005466578,0.00042135292,0.0003792994,0.0007712932,0.0010086794,0.0006060156,0.001339392],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00015085308,0.00021891466,0.0016262693,0.00052726164,0.00018243914,0.0016321434,0.00038342678,0.087927744,0.73721725,0.055322528,0.011361942,0.103449196],"study_design_scores_gemma":[0.00008028483,0.0011105377,0.0043796306,0.00016296774,0.00019017316,0.0020937999,0.00017746378,0.26439625,0.4871938,0.019299759,0.22074455,0.00017087045],"about_ca_topic_score_codex":0.00026822468,"about_ca_topic_score_gemma":0.00043839688,"teacher_disagreement_score":0.002148107,"about_ca_system_score_codex":0.000509024,"about_ca_system_score_gemma":0.0002648033,"threshold_uncertainty_score":0.0071861744},"labels":[],"label_agreement":null},{"id":"W4382933733","doi":"10.1016/j.tcs.2023.114059","title":"On the g-extra connectivity of augmented cubes","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Hypercube; Social connectedness; Upper and lower bounds; Graph; Discrete mathematics; Graph power; Connected component; Hypercube graph; Line graph","score_opus":0.018132900117005232,"score_gpt":0.25192517906498535,"score_spread":0.2337922789479801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382933733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5608003,0.0020219886,0.28398117,0.0034288678,0.0006426859,0.00009854052,0.0008251625,0.00032799746,0.14787328],"genre_scores_gemma":[0.93821484,0.0017169381,0.03948281,0.0009820063,0.00038123556,0.00012919474,0.000802654,0.00015353656,0.018136704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996264,0.00015102226,0.000015972448,0.0000682465,0.00006920023,0.00006911996],"domain_scores_gemma":[0.99804926,0.0010802862,0.00027508836,0.00017800141,0.00020632581,0.00021104512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052681944,0.00065397384,0.0006954445,0.0014475507,0.0012017459,0.0015189818,0.0012074031,0.0011402478,0.010869063],"category_scores_gemma":[0.004024018,0.0004169593,0.0006114216,0.0013122002,0.0019443294,0.0034445387,0.0024137534,0.0022183678,0.00078496104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015994282,0.000025121166,0.0005383471,0.000091795686,0.000015341622,0.00018096661,0.00021235936,0.011858135,0.0013663301,0.9673264,0.0041593215,0.014065987],"study_design_scores_gemma":[0.00002308473,0.00003919239,0.00042525597,0.000031881213,0.000009975885,0.00012563099,0.00011875021,0.031215817,0.00031816136,0.964493,0.0031887116,0.00001049889],"about_ca_topic_score_codex":0.0013518597,"about_ca_topic_score_gemma":0.0014613542,"teacher_disagreement_score":0.010869063,"about_ca_system_score_codex":0.00053990044,"about_ca_system_score_gemma":0.00033888558,"threshold_uncertainty_score":0.03636062},"labels":[],"label_agreement":null},{"id":"W4383749471","doi":"10.1109/fccm57271.2023.00014","title":"Placement Optimization for NoC-Enhanced FPGAs","year":2023,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"Intel Corporation","keywords":"Computer science; Field-programmable gate array; Netlist; Network on a chip; Latency (audio); Embedded system; Design flow; Testbed; Computer architecture; Parallel computing; Computer network","score_opus":0.0245002699235289,"score_gpt":0.2638700126582905,"score_spread":0.2393697427347616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383749471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28295213,0.0005192071,0.69112843,0.0002050491,0.000089294364,0.00013257918,0.00022325304,0.0022069404,0.022543056],"genre_scores_gemma":[0.75856805,0.00020591283,0.23502286,0.00007519336,0.000015763082,0.00007294812,0.0002301169,0.00020433535,0.0056048147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975795,0.000064319145,0.000012622866,0.00003600422,0.000080299935,0.00004881411],"domain_scores_gemma":[0.99973077,0.0001041525,0.000043346892,0.000044862514,0.00006299187,0.00001375072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031945354,0.00067542854,0.00029667013,0.0004612863,0.00024172873,0.00043565276,0.00062755786,0.00031634158,0.002915786],"category_scores_gemma":[0.0009205425,0.00027816722,0.00028467207,0.00032129345,0.0002820701,0.00035192844,0.0004454313,0.00034348498,0.00036786858],"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.00003756719,0.000017265958,0.00050477847,0.000046335346,0.000011931424,0.00009808258,0.000019822097,0.9496125,0.011183241,0.003100414,0.0005942187,0.03477393],"study_design_scores_gemma":[0.000009612783,0.000055856875,0.00023144217,0.0000059559925,0.0000061372607,0.000037847567,0.0000122969295,0.9910936,0.0052596354,0.00156172,0.0017220832,0.0000038806425],"about_ca_topic_score_codex":0.0027122588,"about_ca_topic_score_gemma":0.0052113426,"teacher_disagreement_score":0.002915786,"about_ca_system_score_codex":0.0010181755,"about_ca_system_score_gemma":0.00075780007,"threshold_uncertainty_score":0.0097543},"labels":[],"label_agreement":null},{"id":"W4384833496","doi":"10.1145/3597031.3597055","title":"Exploration of Compute vs. Interconnect Tradeoffs in CGRAs for HPC","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Interconnection; Baseline (sea); Parallel computing; Computer architecture; Bandwidth (computing); Embedded system","score_opus":0.06850391650008301,"score_gpt":0.2919087846131991,"score_spread":0.22340486811311605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384833496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91791064,0.0014833084,0.060654942,0.00052532385,0.000029845636,0.000053370968,0.0002749951,0.0004611894,0.018606404],"genre_scores_gemma":[0.983354,0.00024536194,0.01524202,0.000042846703,0.000007424701,0.00001942325,0.000059488793,0.000046830017,0.0009827318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998062,0.00004831685,0.000005231025,0.000034974204,0.000049263053,0.00005600883],"domain_scores_gemma":[0.999506,0.0002956333,0.00006774833,0.000049468268,0.000051460258,0.000029623261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039834616,0.00063919876,0.00025912563,0.0004713262,0.0003629409,0.00081819703,0.0006695524,0.0006165201,0.0018713403],"category_scores_gemma":[0.0014314034,0.00027255242,0.00026098322,0.00054310926,0.0005188924,0.0011394846,0.00036110348,0.00044890912,0.00017706293],"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.000109012384,0.000060588944,0.0019226505,0.00009282304,0.000017143913,0.00008549025,0.000049512368,0.96245414,0.017783044,0.0075568343,0.0005044933,0.009364345],"study_design_scores_gemma":[0.000014841729,0.00024071986,0.0015864195,0.000013759292,0.000028020304,0.00007551758,0.00007715757,0.9826158,0.007977314,0.005220972,0.002137357,0.000012070476],"about_ca_topic_score_codex":0.0031326178,"about_ca_topic_score_gemma":0.007514762,"teacher_disagreement_score":0.0031326178,"about_ca_system_score_codex":0.0008656477,"about_ca_system_score_gemma":0.0005455857,"threshold_uncertainty_score":0.00628078},"labels":[],"label_agreement":null},{"id":"W4385585417","doi":"10.1109/ipdpsw59300.2023.00075","title":"Efficient Data Streaming for a Tightly-Coupled Coarse-Grained Reconfigurable Array","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Computer science; Cache; Stratix; Exploit; Granularity; Reuse; Parallel computing; Throughput; CPU cache; Field-programmable gate array; Host (biology); Embedded system; Operating system","score_opus":0.06156837681817882,"score_gpt":0.28648833289562653,"score_spread":0.22491995607744772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385585417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68962544,0.00085999246,0.2993694,0.00016567344,0.0001167387,0.00013806857,0.00015123602,0.004967597,0.004605831],"genre_scores_gemma":[0.9437723,0.000076164724,0.05483254,0.000051440027,0.000019811689,0.00003579737,0.00008902545,0.000053707427,0.001069155],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966645,0.00005631328,0.000025149719,0.00007586341,0.00011340057,0.00006275015],"domain_scores_gemma":[0.9994492,0.00017434923,0.00009469444,0.00012499727,0.00010127473,0.000055468576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023205805,0.00041707655,0.00034404916,0.00034359714,0.00024099326,0.00046186664,0.0010069817,0.00024069932,0.001693118],"category_scores_gemma":[0.00072552444,0.0001667213,0.00018740442,0.00040667894,0.0002596049,0.0006197805,0.00035000202,0.00028407777,0.00025712777],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015065839,0.0003078613,0.005982461,0.0003680743,0.00011318134,0.00056277117,0.00021557027,0.17955872,0.5392975,0.0038641607,0.002608745,0.26561433],"study_design_scores_gemma":[0.00007578889,0.0015229402,0.002324799,0.000012512976,0.00005674264,0.00024395547,0.000056316585,0.81052595,0.17984849,0.0011416177,0.0041542836,0.000036604404],"about_ca_topic_score_codex":0.0016430691,"about_ca_topic_score_gemma":0.0020216028,"teacher_disagreement_score":0.001693118,"about_ca_system_score_codex":0.00047893525,"about_ca_system_score_gemma":0.0004436917,"threshold_uncertainty_score":0.00566411},"labels":[],"label_agreement":null},{"id":"W4385624414","doi":"10.1109/icufn57995.2023.10201234","title":"Broadcasting in chains of rings","year":2023,"lang":"en","type":"article","venue":"","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":"Broadcasting (networking); Node (physics); Computer science; Computer network; Interconnection; Time complexity; Theoretical computer science; Ring (chemistry); Distributed computing; Algorithm; Engineering","score_opus":0.02035314291439159,"score_gpt":0.24386428771541863,"score_spread":0.22351114480102705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385624414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18668288,0.0025217542,0.77228457,0.00072832353,0.00012476377,0.00022030424,0.00062305486,0.0011376773,0.035676695],"genre_scores_gemma":[0.7683378,0.0018360621,0.21373619,0.00014197975,0.00012221248,0.00014748052,0.0007263262,0.00017119758,0.014780885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.00021480623,0.000045046316,0.00021632525,0.00015712861,0.00016655675],"domain_scores_gemma":[0.9980421,0.0010644998,0.00025446332,0.00030904202,0.00021784006,0.00011203643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528588,0.00021322233,0.0005113281,0.00037447544,0.0008820981,0.0011276057,0.00068345416,0.0004590857,0.0056360424],"category_scores_gemma":[0.0034022683,0.00034141887,0.00035801984,0.00078914146,0.0006248623,0.00211653,0.0008163214,0.0006902539,0.001093221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010160119,0.00014937179,0.0026438483,0.00066548755,0.00007792779,0.0003540511,0.001089474,0.22279927,0.031320326,0.53754526,0.015005654,0.18733336],"study_design_scores_gemma":[0.0001927729,0.00032497858,0.0008296173,0.00007512604,0.000059056252,0.00031835603,0.00027900908,0.5264408,0.013115252,0.40878657,0.049531505,0.000046906716],"about_ca_topic_score_codex":0.0024345024,"about_ca_topic_score_gemma":0.0017995987,"teacher_disagreement_score":0.0056360424,"about_ca_system_score_codex":0.00063510495,"about_ca_system_score_gemma":0.0005224997,"threshold_uncertainty_score":0.01885444},"labels":[],"label_agreement":null},{"id":"W4387251147","doi":"10.1109/meditcom58224.2023.10266406","title":"Broadcasting in interconnection networks based on node partitioning","year":2023,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Network topology; Computer science; Computer network; Node (physics); Distributed computing; Heuristic; Interconnection; Scope (computer science); Broadcast communication network; Broadcast domain; Topology (electrical circuits); Atomic broadcast; Mathematics; Engineering","score_opus":0.023448129270874394,"score_gpt":0.24870114354752745,"score_spread":0.22525301427665306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387251147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10257551,0.0017707563,0.8770857,0.00040590885,0.00006820581,0.00020254462,0.00021905119,0.00053346273,0.017138867],"genre_scores_gemma":[0.6453474,0.0019059918,0.34500825,0.00010181584,0.000055892295,0.0003379086,0.0005503698,0.00015274648,0.0065395655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996573,0.00011896721,0.000015673038,0.00006099381,0.0000862115,0.00006089849],"domain_scores_gemma":[0.9994272,0.00034512358,0.00006166846,0.00007144544,0.00006910289,0.000025491136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003773243,0.00033573224,0.0005212377,0.0005754448,0.00077014015,0.0005915412,0.000635779,0.0004445494,0.0015378351],"category_scores_gemma":[0.0019095277,0.00032171185,0.00029243733,0.0011787107,0.0006133082,0.00094188657,0.00061394216,0.00044837504,0.00028589353],"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.00022197474,0.000053436102,0.00079231936,0.00031712803,0.0000387551,0.00020322474,0.0004549955,0.71445847,0.018543884,0.1530058,0.0050719753,0.1068381],"study_design_scores_gemma":[0.00004445334,0.0001102427,0.0005783426,0.000042220803,0.000033631582,0.00021601893,0.00014771882,0.8878693,0.004801293,0.09548869,0.010649432,0.000018623994],"about_ca_topic_score_codex":0.003804422,"about_ca_topic_score_gemma":0.0039968067,"teacher_disagreement_score":0.003804422,"about_ca_system_score_codex":0.0010546539,"about_ca_system_score_gemma":0.00064300717,"threshold_uncertainty_score":0.007652104},"labels":[],"label_agreement":null},{"id":"W4388214725","doi":"10.1109/fpl60245.2023.00045","title":"A Whole New World: How to Architect Beyond-FPGA Reconfigurable Acceleration Devices?","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Computer architecture; Reconfigurable computing; Embedded system; Hardware acceleration; Routing (electronic design automation); Acceleration; Architecture; Design flow","score_opus":0.03585392803957797,"score_gpt":0.2646523646597408,"score_spread":0.2287984366201628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388214725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12776323,0.018684354,0.7335491,0.030544635,0.0021256907,0.00020534196,0.00051976246,0.00506574,0.08154215],"genre_scores_gemma":[0.4608981,0.009883355,0.5080315,0.0026739722,0.00021577346,0.000100853504,0.00033709154,0.0006465193,0.017212866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997209,0.00008452916,0.000011349194,0.000039070175,0.000087393404,0.000056853714],"domain_scores_gemma":[0.9994635,0.00015051273,0.000031207026,0.0001770175,0.0001178115,0.00005998161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996744,0.0005534392,0.00041161707,0.00031411287,0.0004511506,0.0022319516,0.0009975159,0.00096477225,0.006241147],"category_scores_gemma":[0.001985906,0.000365073,0.00045450934,0.00036640893,0.00067738566,0.0049099466,0.00066483655,0.0014431038,0.0023565344],"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.0002809631,0.00016097761,0.006554189,0.00040434272,0.0001742423,0.00026581477,0.0003730522,0.14747778,0.020193012,0.1831818,0.038787913,0.6021459],"study_design_scores_gemma":[0.0001423601,0.0005751902,0.002774505,0.0004540579,0.00017125902,0.00046140957,0.0011476869,0.49350134,0.019481847,0.18561296,0.295538,0.00013935244],"about_ca_topic_score_codex":0.002896993,"about_ca_topic_score_gemma":0.0064212964,"teacher_disagreement_score":0.006241147,"about_ca_system_score_codex":0.0006363789,"about_ca_system_score_gemma":0.00095618685,"threshold_uncertainty_score":0.020878732},"labels":[],"label_agreement":null},{"id":"W4388214727","doi":"10.1109/fpl60245.2023.00043","title":"Partitioning Large-Scale, Multi-FPGA Applications for the Data Center","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Simulated annealing; Latency (audio); Bandwidth (computing); Software deployment; Embedded system; Data center; Implementation; Computer architecture; Computer network; Telecommunications; Operating system; Algorithm","score_opus":0.09015232991533921,"score_gpt":0.32545323308791313,"score_spread":0.2353009031725739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388214727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28194305,0.00044246248,0.71096784,0.00030267765,0.00005056674,0.00016394597,0.00006133099,0.00081872585,0.0052493764],"genre_scores_gemma":[0.7530743,0.00019198042,0.24376778,0.000095854506,0.000014958647,0.00007520521,0.00009097263,0.00017995549,0.0025089225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997497,0.00006739723,0.000012291096,0.000058004378,0.000061122555,0.00005151381],"domain_scores_gemma":[0.9996061,0.0001586904,0.0000452539,0.0000869681,0.000057728965,0.00004527872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047587833,0.0006033226,0.00038576283,0.0003323431,0.00053849246,0.00056819397,0.00082542346,0.00036252302,0.0016563517],"category_scores_gemma":[0.00073324895,0.00028385248,0.0003254833,0.00032483513,0.00045064944,0.00107549,0.00076317665,0.0006601042,0.00031653437],"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.00032312723,0.00014986897,0.002265876,0.00022021265,0.00005342331,0.00026774727,0.00022425505,0.7951683,0.06671902,0.009296923,0.0021945897,0.12311678],"study_design_scores_gemma":[0.00005048727,0.00031422207,0.0018761436,0.000019243167,0.000031426982,0.00020949436,0.00021806436,0.9400225,0.041990776,0.0075800135,0.0076656207,0.00002201666],"about_ca_topic_score_codex":0.0015780838,"about_ca_topic_score_gemma":0.0039180918,"teacher_disagreement_score":0.0016563517,"about_ca_system_score_codex":0.00080450973,"about_ca_system_score_gemma":0.0008007261,"threshold_uncertainty_score":0.005837202},"labels":[],"label_agreement":null},{"id":"W4388329021","doi":"10.4230/lipics.approx/random.2024.18","title":"A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta","funders":"","keywords":"Feedback vertex set; Feedback arc set; Vertex (graph theory); Bounded function; Maximal independent set; Combinatorics; Directed acyclic graph; Vertex cover; Discrete mathematics; Directed graph; Constant (computer programming); Mathematics; Computer science; Approximation algorithm; 1-planar graph; Graph; Chordal graph; Line graph","score_opus":0.1176293745490146,"score_gpt":0.21286165360758647,"score_spread":0.09523227905857186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388329021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11514446,0.0021101513,0.85712546,0.00247848,0.00029645042,0.00022981655,0.0011933391,0.005733156,0.015688697],"genre_scores_gemma":[0.61035377,0.0016022347,0.37558058,0.00094462995,0.0002519079,0.00043780022,0.0022406168,0.0015968848,0.0069916155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979721,0.00044506718,0.00006705793,0.00046437385,0.0006029778,0.0004484135],"domain_scores_gemma":[0.9877401,0.008212658,0.00082005345,0.0020317782,0.000604187,0.0005912693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018257883,0.0026624622,0.0024702332,0.0015580078,0.0013367637,0.0030032406,0.0040058997,0.0021366999,0.008278407],"category_scores_gemma":[0.022802467,0.0008271284,0.0016658612,0.0026050368,0.0019041708,0.006659913,0.0033052156,0.0034325027,0.0024085657],"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.001496764,0.00043034082,0.002156905,0.0008909316,0.00015104402,0.00042419377,0.00061696843,0.7108925,0.017527256,0.10045315,0.023931025,0.14102899],"study_design_scores_gemma":[0.00009795085,0.00014888933,0.00032406798,0.000089699446,0.000060219576,0.0002134161,0.00011796348,0.8174585,0.0036700214,0.17418426,0.0036070312,0.000027908698],"about_ca_topic_score_codex":0.0038631947,"about_ca_topic_score_gemma":0.0048602927,"teacher_disagreement_score":0.008278407,"about_ca_system_score_codex":0.003238448,"about_ca_system_score_gemma":0.0018466321,"threshold_uncertainty_score":0.027693987},"labels":[],"label_agreement":null},{"id":"W4388368278","doi":"10.48550/arxiv.1204.5641","title":"Stability Analysis of Path-vector Routing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Bell (Canada)","funders":"","keywords":"Stability (learning theory); Path analysis (statistics); Path (computing); Computer science; Computer network; Machine learning","score_opus":0.09108656776773617,"score_gpt":0.1891559529457698,"score_spread":0.09806938517803364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388368278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16404863,0.0007504621,0.8282816,0.00021637292,0.000027593072,0.000110145476,0.00025087735,0.00044284912,0.005871491],"genre_scores_gemma":[0.9762946,0.00030794574,0.02183546,0.000026005024,0.00003640194,0.0000823497,0.00021340179,0.00008413054,0.0011196873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.00032113222,0.00005112166,0.00022867699,0.00038670423,0.000084026135],"domain_scores_gemma":[0.99384874,0.0032373942,0.0010026703,0.00057297293,0.0011750369,0.00016315887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017917353,0.00055949384,0.0005669073,0.0021455123,0.0005839432,0.0010674252,0.00069804606,0.00039740515,0.0015040683],"category_scores_gemma":[0.009767619,0.00019302646,0.0003578424,0.0011868825,0.0012014535,0.0016712523,0.00087096856,0.0007242741,0.00024518216],"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.00014511416,0.000055633544,0.008960399,0.00015937429,0.00012225118,0.0001152034,0.00032713023,0.7321532,0.017635053,0.18756181,0.0011970869,0.05156778],"study_design_scores_gemma":[0.0000034127988,0.000038939368,0.0010706044,0.000008387182,0.00000971797,0.000038628714,0.000035440466,0.9596802,0.0024350027,0.03612206,0.0005467584,0.000010795051],"about_ca_topic_score_codex":0.0014286218,"about_ca_topic_score_gemma":0.00042606608,"teacher_disagreement_score":0.0021455123,"about_ca_system_score_codex":0.0012928698,"about_ca_system_score_gemma":0.00055391574,"threshold_uncertainty_score":0.009475708},"labels":[],"label_agreement":null},{"id":"W4388458529","doi":"10.18280/isi.280514","title":"Performance Analysis of a Generic Modular Adder via RTL Programming and IP Modeling Techniques on FPGA","year":2023,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Adder; Computer science; Field-programmable gate array; Computer architecture; Parallel computing; Embedded system; Programming language; Telecommunications; Latency (audio)","score_opus":0.020874957151166836,"score_gpt":0.2333708454370076,"score_spread":0.21249588828584076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388458529","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5649315,0.0008655485,0.4017166,0.0002046082,0.000052938714,0.00010515126,0.00035773646,0.0048225964,0.026943365],"genre_scores_gemma":[0.9576781,0.00020000612,0.040372502,0.000025025012,0.000006722293,0.000036133235,0.00010031105,0.00008462882,0.0014966237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983823,0.000043547254,0.0000076397755,0.00002404853,0.000058772006,0.000027707074],"domain_scores_gemma":[0.9997365,0.00012146982,0.00004990424,0.00004584098,0.00003991875,0.0000063896982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022122226,0.0006007674,0.0002521062,0.00041133096,0.00016006494,0.00045125734,0.00047922228,0.00021839568,0.002344245],"category_scores_gemma":[0.0005837902,0.00013417887,0.00028324345,0.00034029922,0.00015277941,0.00050800515,0.00013679077,0.00022812204,0.00032791926],"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.0005710454,0.00010048674,0.0026542633,0.0003955448,0.000074090385,0.00032503475,0.00014941984,0.7667761,0.07576232,0.015791735,0.0018831985,0.13551679],"study_design_scores_gemma":[0.000012062258,0.00017964255,0.00043119743,0.000009298226,0.00001870853,0.00008326808,0.000012206644,0.97625285,0.02139492,0.00049073034,0.0011080162,0.0000070894803],"about_ca_topic_score_codex":0.0016098928,"about_ca_topic_score_gemma":0.0016762017,"teacher_disagreement_score":0.002344245,"about_ca_system_score_codex":0.0004805239,"about_ca_system_score_gemma":0.00038430782,"threshold_uncertainty_score":0.007842302},"labels":[],"label_agreement":null},{"id":"W4388482096","doi":"10.48550/arxiv.2311.03185","title":"Spanning trees in pseudorandom graphs via sorting networks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Nacional de Investigación y Desarrollo; Centre National de la Recherche Scientifique; European Commission; Natural Sciences and Engineering Research Council of Canada; University of Warwick","keywords":"Combinatorics; Lambda; Disjoint sets; Mathematics; Logarithm; Spanning tree; Bounded function; Discrete mathematics; Vertex (graph theory); Sorting; Upper and lower bounds; Graph; Algorithm; Physics","score_opus":0.07785570620457882,"score_gpt":0.19438688240618365,"score_spread":0.11653117620160483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388482096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6779695,0.00090084807,0.306066,0.0018565559,0.000050215665,0.00013609348,0.00056788506,0.0008378134,0.011615004],"genre_scores_gemma":[0.94525206,0.000704611,0.048716705,0.00045140064,0.0000613376,0.00017370132,0.0004010482,0.00010600604,0.0041332273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991297,0.00035888123,0.000042700038,0.00019380826,0.00013317236,0.00014164892],"domain_scores_gemma":[0.9932278,0.0043106927,0.0008480935,0.00086767896,0.0003265799,0.00041921457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394913,0.0004824085,0.00058197987,0.0010574647,0.0010454297,0.0013065266,0.0010480788,0.0010765151,0.0029227454],"category_scores_gemma":[0.011225449,0.00056024414,0.00048046457,0.0012672052,0.0017047403,0.0041596065,0.0019431473,0.0009778328,0.000470093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054306706,0.00013250328,0.0045565707,0.00032040835,0.00005854886,0.00033199272,0.00066140626,0.15324527,0.014999591,0.7622883,0.005947754,0.056914706],"study_design_scores_gemma":[0.00009913426,0.00011081735,0.001489333,0.00005622815,0.000050359107,0.0004464943,0.00016530787,0.3738446,0.0057457937,0.61249673,0.00546546,0.00002967274],"about_ca_topic_score_codex":0.00082334486,"about_ca_topic_score_gemma":0.0015679821,"teacher_disagreement_score":0.0029227454,"about_ca_system_score_codex":0.0014033741,"about_ca_system_score_gemma":0.0007149868,"threshold_uncertainty_score":0.0101822615},"labels":[],"label_agreement":null},{"id":"W4389478371","doi":"10.1007/978-3-031-49614-1_7","title":"Improved Approximation for Broadcasting in k-Path Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Network topology; Heuristic; Node (physics); Path (computing); Scope (computer science); Time complexity; Computer network; Theoretical computer science; Distributed computing; Topology (electrical circuits); Algorithm; Mathematics; Combinatorics","score_opus":0.025553468096681287,"score_gpt":0.24762101083544982,"score_spread":0.22206754273876853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389478371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09821414,0.0041487315,0.8296281,0.0037476625,0.0009914244,0.0005034682,0.0021280271,0.008519808,0.052118637],"genre_scores_gemma":[0.41338044,0.0024758696,0.53956914,0.0010522014,0.0008393859,0.00076078984,0.0036964517,0.0019473843,0.036278415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970181,0.0006870847,0.0001204542,0.00053253555,0.0009355676,0.0007063153],"domain_scores_gemma":[0.98907137,0.006530557,0.0003778016,0.0027963615,0.0007084247,0.0005155216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024931047,0.0026429459,0.0034333004,0.002166436,0.0018324624,0.0034230147,0.0076458957,0.0027469466,0.022028115],"category_scores_gemma":[0.014093193,0.0011607175,0.0023003325,0.0055514174,0.0020983857,0.008352772,0.0046739965,0.0054876064,0.0043727164],"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.0028675636,0.0010130735,0.0016190846,0.001338665,0.000262378,0.00028409166,0.0007234947,0.4069905,0.010445496,0.1398989,0.07820868,0.35634813],"study_design_scores_gemma":[0.00025964493,0.0001585382,0.00048486737,0.00008279573,0.00013953543,0.00018712584,0.00014252492,0.8585339,0.0025879787,0.12992908,0.0074589034,0.000035095214],"about_ca_topic_score_codex":0.012129554,"about_ca_topic_score_gemma":0.018373314,"teacher_disagreement_score":0.022028115,"about_ca_system_score_codex":0.007192671,"about_ca_system_score_gemma":0.0044522267,"threshold_uncertainty_score":0.07369137},"labels":[],"label_agreement":null},{"id":"W4389609027","doi":"10.1145/3626780","title":"Kernel vs. User-Level Networking: Don't Throw Out the Stack with the Interrupts","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Computer science; Linux kernel; Server; Interrupt; Kernel (algebra); Overhead (engineering); Software deployment; Latency (audio); Computer network; Operating system; Embedded system; Asynchronous communication; Distributed computing; Telecommunications","score_opus":0.0767983168861339,"score_gpt":0.2624284616411261,"score_spread":0.1856301447549922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389609027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257596,0.008870657,0.22771028,0.000721815,0.00024549023,0.00015329641,0.00011351797,0.002978396,0.033446904],"genre_scores_gemma":[0.9773946,0.0010923997,0.019316169,0.00009562684,0.000083032144,0.00003406524,0.00006275639,0.00022664672,0.001694733],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850035,0.00021264558,0.000081342936,0.00019248061,0.0006519234,0.0003613396],"domain_scores_gemma":[0.9964804,0.0011216835,0.00058468897,0.00079818943,0.00081477186,0.00020030297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016154752,0.00065802573,0.0005022455,0.00071178767,0.0007009235,0.002421954,0.0015397194,0.000445326,0.0014240369],"category_scores_gemma":[0.0058886786,0.00029389941,0.00025415784,0.0008843944,0.00085890305,0.0030624704,0.0008662014,0.0007922393,0.0004580135],"study_design_candidate":"bench_or_experimental","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.002542449,0.0006231558,0.060242545,0.0015071129,0.0001895879,0.0005167092,0.00176116,0.06206385,0.16967563,0.095544636,0.00518919,0.60014397],"study_design_scores_gemma":[0.00011920945,0.0051505878,0.076262236,0.00040222376,0.0005064868,0.0033725528,0.0012999924,0.4824806,0.31437585,0.037135318,0.07856253,0.00033246574],"about_ca_topic_score_codex":0.0015936093,"about_ca_topic_score_gemma":0.0014985271,"teacher_disagreement_score":0.002421954,"about_ca_system_score_codex":0.0011955088,"about_ca_system_score_gemma":0.0007980924,"threshold_uncertainty_score":0.008674026},"labels":[],"label_agreement":null},{"id":"W4390030003","doi":"10.18280/mmep.100627","title":"An Energy-Efficient Routing Protocol for a Modified Fat-Tree Topology in System-on-Chip Design","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Protocol (science); Topology (electrical circuits); Routing (electronic design automation); Chip; Tree (set theory); Zone Routing Protocol; Energy (signal processing); Computer network; Routing protocol; Distributed computing; Dynamic Source Routing; Mathematics; Medicine; Telecommunications; Combinatorics","score_opus":0.06539248881988795,"score_gpt":0.26707482773009533,"score_spread":0.20168233891020737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390030003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03374814,0.0005156857,0.9624237,0.00015942368,0.00006546436,0.00009069319,0.00002920441,0.00020952632,0.002758139],"genre_scores_gemma":[0.60864985,0.00073887047,0.38759026,0.00007430349,0.00003302072,0.00024532995,0.000083544284,0.00003620714,0.0025485547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997346,0.00012534217,0.000020255127,0.000022332972,0.00007972729,0.00001769854],"domain_scores_gemma":[0.99969375,0.00013635319,0.000046475125,0.000041072122,0.00007413987,0.000008202846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066437613,0.00017209715,0.00017896482,0.00034061828,0.00029833906,0.00044160578,0.0006273429,0.00033457446,0.00061109447],"category_scores_gemma":[0.0012413971,0.00012616116,0.00024263319,0.00046485086,0.0003491123,0.0006100938,0.00027298386,0.00024293295,0.00011358172],"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.00012612027,0.000053791915,0.00073272944,0.00021961119,0.000054461514,0.00019577735,0.00014414283,0.75018626,0.039233595,0.090610065,0.002018725,0.11642484],"study_design_scores_gemma":[0.000016374566,0.00016781778,0.00015599345,0.000015850399,0.000023282277,0.00013194987,0.000018749253,0.97936195,0.0072503374,0.008121955,0.00472065,0.00001516666],"about_ca_topic_score_codex":0.0007136107,"about_ca_topic_score_gemma":0.0014544659,"teacher_disagreement_score":0.0007136107,"about_ca_system_score_codex":0.00035216255,"about_ca_system_score_gemma":0.0005690462,"threshold_uncertainty_score":0.0035136342},"labels":[],"label_agreement":null},{"id":"W4391319116","doi":"10.1016/j.comnet.2024.110193","title":"Comparative analysis of 2D mesh topologies with additional communication links for on-chip networks","year":2024,"lang":"en","type":"article","venue":"Computer Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Network topology; Mesh networking; Polygon mesh; Scalability; Network on a chip; Bottleneck; Distributed computing; MPSoC; Interconnection; Node (physics); Energy consumption; Order One Network Protocol; Wireless mesh network; Topology (electrical circuits); System on a chip; Embedded system; Routing (electronic design automation); Computer network; Routing protocol; Telecommunications; Wireless","score_opus":0.030682383227629704,"score_gpt":0.28096183304776445,"score_spread":0.2502794498201347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391319116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879273,0.0025767877,0.08214829,0.00035364245,0.00014364671,0.00006389878,0.00056307693,0.00028348004,0.025939867],"genre_scores_gemma":[0.9892943,0.00049151387,0.008408202,0.000018653634,0.000020043333,0.000023078208,0.0002011803,0.000029388326,0.0015137108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996846,0.00013288819,0.000009019357,0.000027661237,0.00009178494,0.00005408055],"domain_scores_gemma":[0.99774915,0.0014161101,0.00012729509,0.00015707262,0.00048100858,0.00006934769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065718876,0.00047317296,0.00046402725,0.001620782,0.0003707305,0.0007888595,0.00059766736,0.00047991713,0.0049319603],"category_scores_gemma":[0.003010648,0.00019083518,0.00043676136,0.0013289916,0.00025203,0.0010576074,0.00031248084,0.00021667356,0.00025922447],"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.00042405396,0.000091589136,0.0017527711,0.00023142647,0.00006795573,0.00014047894,0.000062977655,0.9313037,0.0077476627,0.016350724,0.0020648546,0.03976177],"study_design_scores_gemma":[0.000011302028,0.00021267602,0.00216868,0.000019233137,0.00005610231,0.000086722335,0.00011594443,0.99038714,0.0016659471,0.0038514142,0.0014126297,0.00001221556],"about_ca_topic_score_codex":0.0022616454,"about_ca_topic_score_gemma":0.0029886714,"teacher_disagreement_score":0.0049319603,"about_ca_system_score_codex":0.0010321985,"about_ca_system_score_gemma":0.00039841433,"threshold_uncertainty_score":0.016499043},"labels":[],"label_agreement":null},{"id":"W4391363703","doi":"10.1007/978-3-031-38684-8_5","title":"Busy-Wait Synchronization with Conditions","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Synchronization (alternating current); Computer science; Real-time computing; Computer network; Channel (broadcasting)","score_opus":0.007620640077111914,"score_gpt":0.2024071683244451,"score_spread":0.1947865282473332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363703","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010273864,0.001819448,0.8179471,0.0010666706,0.0018504534,0.00012656124,0.00030225347,0.0033514863,0.16326207],"genre_scores_gemma":[0.55422336,0.0021591738,0.21153682,0.001246702,0.0014914186,0.00062668935,0.00073551637,0.0022278326,0.22575256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993389,0.00011424218,0.000038443817,0.00018358124,0.00021872303,0.00010602255],"domain_scores_gemma":[0.99918395,0.00034082204,0.00003793754,0.00024144912,0.00013608442,0.000059709408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226446,0.0010309347,0.000705414,0.0006277116,0.0008358354,0.0019503532,0.0010562787,0.0007263996,0.023829805],"category_scores_gemma":[0.0027344883,0.00052369956,0.00041584246,0.00088636845,0.0015305548,0.0034465806,0.0017893082,0.002435647,0.004600794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522418,0.000031736377,0.00007108039,0.00011503766,0.000013923694,0.000065895976,0.00020630477,0.006589437,0.0094102975,0.8884966,0.017164724,0.077582724],"study_design_scores_gemma":[0.00011175928,0.00014039331,0.00015615787,0.000087929155,0.000044020566,0.000111320274,0.000107223634,0.0732173,0.021681191,0.8030252,0.10126587,0.000051700154],"about_ca_topic_score_codex":0.0006887531,"about_ca_topic_score_gemma":0.00089299923,"teacher_disagreement_score":0.023829805,"about_ca_system_score_codex":0.0010010818,"about_ca_system_score_gemma":0.0010309018,"threshold_uncertainty_score":0.07971871},"labels":[],"label_agreement":null},{"id":"W4391678096","doi":"10.1109/srds60354.2023.00017","title":"CASPR: Connectivity-Aware Scheduling for Partition Resilience","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Research Canada; University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Partition (number theory); Resilience (materials science); Processor scheduling; Distributed computing; Computer network; Computer security; Mathematics; Resource (disambiguation); Mathematical optimization","score_opus":0.034713474004884094,"score_gpt":0.2863481820932484,"score_spread":0.2516347080883643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391678096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7127004,0.0024097064,0.24640028,0.0010062712,0.00037853408,0.00079627056,0.0012136246,0.023428584,0.011666322],"genre_scores_gemma":[0.93812054,0.00022360489,0.05987798,0.00009305695,0.000038044145,0.00011813845,0.0005064768,0.00038370036,0.000638479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970475,0.00085619476,0.00014620062,0.00039531206,0.0011268719,0.00042798],"domain_scores_gemma":[0.9878435,0.0056437226,0.0015857755,0.0031388835,0.0012165515,0.00057149393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038977785,0.00088095124,0.00038817563,0.0015202479,0.0010588347,0.0010174584,0.0017501934,0.00052866404,0.0015695005],"category_scores_gemma":[0.015824221,0.00043215728,0.00042375887,0.0010551503,0.0012454872,0.0018293669,0.001401481,0.0011256267,0.00028735228],"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.001292232,0.0006066049,0.030557271,0.00073091575,0.0002508149,0.00030953388,0.0009294319,0.65962595,0.03771186,0.016756196,0.01674215,0.23448701],"study_design_scores_gemma":[0.00013568145,0.0010850133,0.009985788,0.000047009264,0.00013846958,0.00031162257,0.0002945028,0.9452169,0.021894159,0.006436604,0.014368129,0.00008612191],"about_ca_topic_score_codex":0.0069649727,"about_ca_topic_score_gemma":0.0071784277,"teacher_disagreement_score":0.0069649727,"about_ca_system_score_codex":0.0016458108,"about_ca_system_score_gemma":0.0030692897,"threshold_uncertainty_score":0.02061361},"labels":[],"label_agreement":null},{"id":"W4392353220","doi":"10.1002/cpe.8059","title":"A recurrence for the surface area of the (n,k)$$ \\left(n,k\\right) $$‐star graph","year":2024,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","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":"Star (game theory); Computer science; Graph; Star network; A* search algorithm; Surface (topology); Combinatorics; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Network topology; Geometry; Computer network","score_opus":0.028157599498894282,"score_gpt":0.3089877351882812,"score_spread":0.2808301356893869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392353220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2992011,0.0009280791,0.62852436,0.0018156408,0.00037525818,0.000100368365,0.0007060299,0.00076745375,0.06758172],"genre_scores_gemma":[0.92122513,0.00040951298,0.063935995,0.00017576899,0.00014797732,0.0001199363,0.00043600475,0.00029331297,0.0132563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995926,0.000077582845,0.000032056018,0.00008947864,0.00013248726,0.0000757358],"domain_scores_gemma":[0.998166,0.00079537014,0.00019948976,0.00017102787,0.00056628004,0.00010180198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905938,0.00030974494,0.0005314423,0.001203361,0.00061556575,0.00086564856,0.0007419745,0.00046174842,0.0059189643],"category_scores_gemma":[0.0034532347,0.00017052593,0.00059941504,0.00085702894,0.001011143,0.0017464702,0.00078753836,0.000786837,0.0011341284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008178863,0.00002671162,0.0032288823,0.0001581135,0.000024229761,0.0008625825,0.0005450745,0.061078764,0.01720301,0.84970045,0.010538951,0.05655146],"study_design_scores_gemma":[0.0000135727405,0.00005009012,0.0024897142,0.00003501459,0.000024087745,0.00083843933,0.00021367575,0.37673822,0.008675866,0.5954548,0.015406028,0.0000605051],"about_ca_topic_score_codex":0.0018333574,"about_ca_topic_score_gemma":0.0016139423,"teacher_disagreement_score":0.0059189643,"about_ca_system_score_codex":0.0009559355,"about_ca_system_score_gemma":0.00036675192,"threshold_uncertainty_score":0.019800842},"labels":[],"label_agreement":null},{"id":"W4392457755","doi":"10.2139/ssrn.4748735","title":"On Memory, Communication, and Synchronous Schedulers When Moving and Computing","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Distributed computing; Computer network","score_opus":0.008476583789720816,"score_gpt":0.23628594624072058,"score_spread":0.22780936245099975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392457755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092413485,0.010654743,0.82524663,0.011722493,0.0036919469,0.00014565334,0.0003144567,0.0010373654,0.054773323],"genre_scores_gemma":[0.8848928,0.0053473883,0.08114589,0.001686265,0.004403057,0.00021422563,0.0002569847,0.0006020254,0.02145131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723744,0.0011342248,0.00016927539,0.00043775994,0.00059423316,0.0004269575],"domain_scores_gemma":[0.986439,0.009557375,0.00076246256,0.0015635946,0.0010881496,0.00058942207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005203734,0.0008927219,0.0014101592,0.001512234,0.0020469762,0.004194107,0.0025203489,0.0022849753,0.00826737],"category_scores_gemma":[0.03268566,0.00071449025,0.00078813254,0.0024867447,0.004057464,0.009580235,0.0026228365,0.0031917775,0.00086655834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038286735,0.000053568045,0.00087614387,0.00011185513,0.000036929905,0.00019242674,0.00035611328,0.052704547,0.0009549131,0.90071034,0.011726583,0.03189369],"study_design_scores_gemma":[0.00006732365,0.000045915684,0.00040755366,0.00004364873,0.0000587554,0.000099506055,0.00018993409,0.30330637,0.000748418,0.68429583,0.010699572,0.000037123842],"about_ca_topic_score_codex":0.006201536,"about_ca_topic_score_gemma":0.0060494943,"teacher_disagreement_score":0.00826737,"about_ca_system_score_codex":0.0019661204,"about_ca_system_score_gemma":0.002577125,"threshold_uncertainty_score":0.027657092},"labels":[],"label_agreement":null},{"id":"W4393145383","doi":"10.1109/cloudcom59040.2023.00026","title":"A Lightweight Routing Layer Using a Reliable Link-Layer Protocol","year":2023,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer network; Computer science; Layer (electronics); Data link layer; Link layer; Routing protocol; Zone Routing Protocol; Application layer; Enhanced Interior Gateway Routing Protocol; Network layer; Routing (electronic design automation); Protocol (science); Link (geometry); Link-state routing protocol; Materials science; Operating system; Network packet; Composite material; Software","score_opus":0.0645586211160376,"score_gpt":0.31487305907314844,"score_spread":0.25031443795711084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074967,0.0006729919,0.8931325,0.00045765872,0.0003617588,0.0005416352,0.0003421174,0.019824766,0.009699563],"genre_scores_gemma":[0.67531693,0.00051437435,0.3120235,0.0003692147,0.00019535964,0.00046388712,0.0006609278,0.0006863071,0.009769487],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987111,0.00016605615,0.00014126617,0.00019089156,0.00066314737,0.00012753526],"domain_scores_gemma":[0.9977412,0.00032953272,0.0003450004,0.0010246179,0.0004915758,0.00006804768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013197875,0.00055315474,0.00039977083,0.0007132802,0.0005824493,0.0015475765,0.001553809,0.00067416707,0.0024320625],"category_scores_gemma":[0.002896186,0.0004433949,0.00033788293,0.00041218568,0.00044416668,0.0019844435,0.0013536627,0.0012857267,0.001469809],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0006648085,0.0004055538,0.0027301686,0.00072306505,0.00018388373,0.0006278142,0.000331896,0.09069744,0.5192198,0.039091304,0.021483168,0.32384104],"study_design_scores_gemma":[0.00014920793,0.00093303353,0.0017060431,0.00007527185,0.00013684583,0.0005790269,0.00007513486,0.65121996,0.2642757,0.0087957075,0.0718811,0.00017297151],"about_ca_topic_score_codex":0.0011301835,"about_ca_topic_score_gemma":0.0016281024,"teacher_disagreement_score":0.0024320625,"about_ca_system_score_codex":0.0006866441,"about_ca_system_score_gemma":0.0013560026,"threshold_uncertainty_score":0.008136034},"labels":[],"label_agreement":null},{"id":"W4393186165","doi":"10.1109/icpads60453.2023.00029","title":"Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Interconnection; Hypercube; Mathematics; Star (game theory); Graph property; Discrete mathematics; Graph; Combinatorics; Topology (electrical circuits); Computer science; Line graph; Voltage graph; Telecommunications; Mathematical analysis","score_opus":0.02242414169717924,"score_gpt":0.2084128502523698,"score_spread":0.18598870855519056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393186165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674734,0.00026418042,0.30266073,0.00033704806,0.00004176869,0.000034347995,0.00022220946,0.00023461248,0.028731737],"genre_scores_gemma":[0.9806295,0.00014849115,0.016143877,0.00004288802,0.000028595505,0.000026322645,0.00014098859,0.000042906922,0.0027963263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997799,0.00003337944,0.000013097544,0.000048018745,0.00008904775,0.000036578913],"domain_scores_gemma":[0.99884915,0.0005820875,0.00021161509,0.00010925502,0.0001682,0.00007967361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918321,0.00017710464,0.00025849394,0.0006040628,0.00031667048,0.00046259916,0.00033899577,0.0002870683,0.002557127],"category_scores_gemma":[0.0015875455,0.00011896708,0.0003561625,0.00046420662,0.00069980853,0.0013655403,0.00041610043,0.0004899393,0.00019475352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022768142,0.00005724459,0.0038626045,0.00016842732,0.000031422536,0.0005552309,0.00058544293,0.0864752,0.07310911,0.7795317,0.0016503856,0.053745545],"study_design_scores_gemma":[0.00003430071,0.00025652524,0.0050850986,0.0000135868895,0.000022764414,0.0011556408,0.00024535807,0.42914897,0.025863277,0.5300185,0.008126515,0.000029456449],"about_ca_topic_score_codex":0.00068398035,"about_ca_topic_score_gemma":0.0004907893,"teacher_disagreement_score":0.002557127,"about_ca_system_score_codex":0.0004157624,"about_ca_system_score_gemma":0.00018221921,"threshold_uncertainty_score":0.008554459},"labels":[],"label_agreement":null},{"id":"W4396819614","doi":"10.48550/arxiv.2404.18014","title":"Layered subgraphs of the hypercube","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Computer science; Combinatorics; Business; Mathematics; Parallel computing","score_opus":0.0588107978927283,"score_gpt":0.16889078044917172,"score_spread":0.11007998255644341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396819614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7398967,0.000982902,0.20004028,0.001008794,0.000120533776,0.000079043006,0.0009412455,0.00052060233,0.056409862],"genre_scores_gemma":[0.94718784,0.00073229056,0.040848363,0.00030093009,0.00007400888,0.00012525408,0.001354106,0.00012404562,0.009253277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969316,0.000089811925,0.000014730657,0.000059861486,0.00008003304,0.000062276085],"domain_scores_gemma":[0.9991646,0.00023143191,0.00015072091,0.00022332069,0.00012110107,0.00010889709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014620693,0.0002128297,0.00024092777,0.00038457115,0.0005120011,0.0008622951,0.0004149094,0.00028827728,0.0031507383],"category_scores_gemma":[0.0011167885,0.00033961405,0.00041893264,0.0004391282,0.0006582079,0.0014617668,0.0013241223,0.0006455228,0.00044716024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002222178,0.00003620652,0.0032383525,0.00022822591,0.000055398537,0.00081192545,0.00059288123,0.03833867,0.034911733,0.8863881,0.00773368,0.02744256],"study_design_scores_gemma":[0.000036556423,0.00005717991,0.0046521514,0.000055854704,0.00003699224,0.00068958296,0.00036326793,0.08827791,0.011408532,0.8753389,0.019051734,0.000031365307],"about_ca_topic_score_codex":0.0013186547,"about_ca_topic_score_gemma":0.0015943121,"teacher_disagreement_score":0.0031507383,"about_ca_system_score_codex":0.0005075594,"about_ca_system_score_gemma":0.000345309,"threshold_uncertainty_score":0.010540247},"labels":[],"label_agreement":null},{"id":"W4396892510","doi":"10.1145/3651598","title":"Topology-aware Parallel Joins","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","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 Waterloo","funders":"","keywords":"Joins; Join (topology); Skew; Cartesian product; Network topology; Computer science; Topology (electrical circuits); Extension topology; Product topology; Computation; Logical topology; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; General topology; Combinatorics; Computer network; Topological space","score_opus":0.06779863890756006,"score_gpt":0.30346095502099496,"score_spread":0.2356623161134349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396892510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032082815,0.00028106518,0.9633032,0.00025875831,0.00005443965,0.00006727056,0.000058320395,0.00034989367,0.0035441641],"genre_scores_gemma":[0.75051296,0.00058543665,0.24283662,0.00019140102,0.00017332801,0.00020372045,0.000249633,0.00022418336,0.0050227046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964007,0.001010255,0.00013723968,0.00075773714,0.0013392692,0.00035479863],"domain_scores_gemma":[0.99270767,0.003934541,0.0008038918,0.0013640783,0.0009020229,0.000287856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030725,0.0007192231,0.0013825374,0.0006399719,0.0012878408,0.0026549743,0.0032399537,0.0011776519,0.0026125791],"category_scores_gemma":[0.011191178,0.00093762507,0.0008179936,0.0012798943,0.0015869847,0.0050460747,0.0025351075,0.001836185,0.0006369869],"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.00019975482,0.000092815906,0.0005317449,0.00009463796,0.000048598926,0.000059748298,0.000092694536,0.87951976,0.003452198,0.08833679,0.0014388207,0.026132349],"study_design_scores_gemma":[0.000017870958,0.000048041064,0.00004509521,0.0000035462956,0.000009980741,0.00004107434,0.000017547462,0.9630043,0.0011507412,0.03477133,0.0008854434,0.0000050230947],"about_ca_topic_score_codex":0.0013185204,"about_ca_topic_score_gemma":0.0012787038,"teacher_disagreement_score":0.0032399537,"about_ca_system_score_codex":0.001559299,"about_ca_system_score_gemma":0.0015827037,"threshold_uncertainty_score":0.01624912},"labels":[],"label_agreement":null},{"id":"W4396982322","doi":"10.1109/tcsii.2024.3401701","title":"Efficient Address-Embedded Time-Domain Implementation of Minima Finders for Soft Error-Correction Decoders","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Interconnection Networks and Systems","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Computer science; Algorithm; Soft error; Error detection and correction; Time domain; Mathematics; Electronic engineering; Engineering; Computer vision","score_opus":0.020848019629157957,"score_gpt":0.2811656388895385,"score_spread":0.26031761926038055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396982322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049846187,0.00028996696,0.9462682,0.00009145568,0.000046714908,0.00004984865,0.00004633696,0.0010613988,0.0022999502],"genre_scores_gemma":[0.37475702,0.0001619443,0.6210173,0.00007775822,0.000029065935,0.000080904734,0.0000980791,0.00006267294,0.00371524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998203,0.000035376233,0.000017220162,0.00002903605,0.0000806907,0.00001748939],"domain_scores_gemma":[0.9996935,0.00013117956,0.00005622669,0.000039745795,0.00007020063,0.000009186592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027006198,0.0003894752,0.00029769665,0.00045195964,0.0002540687,0.0005047529,0.0008174509,0.00043620524,0.002234724],"category_scores_gemma":[0.0010028215,0.00018242592,0.00015556172,0.00032496738,0.00020850005,0.0006919869,0.00027794272,0.00046862572,0.00060194917],"study_design_candidate":"bench_or_experimental","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.0006646473,0.0002021393,0.00089493283,0.00024646695,0.000066979184,0.000230222,0.00026553206,0.086035825,0.38588902,0.040802006,0.002098418,0.48260382],"study_design_scores_gemma":[0.00007049305,0.00036945558,0.0004598048,0.000026465745,0.000019859259,0.00035975032,0.00003098727,0.74446565,0.24172458,0.0050393576,0.00740704,0.000026554357],"about_ca_topic_score_codex":0.00042163942,"about_ca_topic_score_gemma":0.0013694605,"teacher_disagreement_score":0.002234724,"about_ca_system_score_codex":0.00044930796,"about_ca_system_score_gemma":0.0005764658,"threshold_uncertainty_score":0.0074759126},"labels":[],"label_agreement":null},{"id":"W4399345956","doi":"10.1145/3626183.3659962","title":"Multi Bucket Queues: Efficient Concurrent Priority Scheduling","year":2024,"lang":"en","type":"article","venue":"","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","funders":"Universitas Brawijaya","keywords":"Computer science; Scheduling (production processes); Distributed computing; Priority queue; Earliest deadline first scheduling; Computer network; Queue; Dynamic priority scheduling; Rate-monotonic scheduling; Quality of service; Mathematical optimization","score_opus":0.027944110004002317,"score_gpt":0.291290350778284,"score_spread":0.2633462407742817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399345956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029915513,0.0012477793,0.95830333,0.0004485362,0.00045409135,0.0002877525,0.00035280993,0.0037003637,0.0052898233],"genre_scores_gemma":[0.55488175,0.00086879,0.43552274,0.0002825538,0.00028952377,0.0003541264,0.00061750604,0.00060154253,0.0065815197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981858,0.0003782607,0.00015833697,0.00023639188,0.0006419397,0.00039917947],"domain_scores_gemma":[0.9960978,0.0013126013,0.00032801402,0.00083976,0.0010152297,0.00040655606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003562218,0.00070956827,0.0009091798,0.0012050465,0.0014226631,0.0030689423,0.004148138,0.0007533848,0.004900757],"category_scores_gemma":[0.009070801,0.00068613514,0.00043687838,0.0020425753,0.0007087995,0.002751886,0.0028194983,0.0013763352,0.0016389583],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026785138,0.0004546506,0.004565065,0.0005312455,0.00014580508,0.0002461387,0.0006006576,0.2203343,0.021424707,0.1318774,0.031117532,0.58602405],"study_design_scores_gemma":[0.00028166064,0.00019381805,0.00032270353,0.000036891543,0.000039417857,0.000118921664,0.00009120432,0.9263132,0.0076783835,0.050760277,0.014112853,0.000050661238],"about_ca_topic_score_codex":0.0046099727,"about_ca_topic_score_gemma":0.0064764987,"teacher_disagreement_score":0.004900757,"about_ca_system_score_codex":0.0013452491,"about_ca_system_score_gemma":0.0041726157,"threshold_uncertainty_score":0.018839002},"labels":[],"label_agreement":null},{"id":"W4399688236","doi":"10.1145/3673660.3655061","title":"Kernel vs. User-Level Networking: Don't Throw Out the Stack with the Interrupts","year":2024,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Interconnection Networks and 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":"University of Waterloo","funders":"","keywords":"Computer science; Linux kernel; Server; Interrupt; Software deployment; Operating system; Kernel (algebra); Overhead (engineering); Embedded system; Asynchronous communication; Computer network; Latency (audio); Distributed computing; Telecommunications; Microcontroller","score_opus":0.12474079334489474,"score_gpt":0.3415135167367768,"score_spread":0.21677272339188208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399688236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908683,0.02608341,0.20793322,0.0016126974,0.00043521117,0.00021615681,0.00017847579,0.0029954636,0.06967707],"genre_scores_gemma":[0.9688497,0.0038277106,0.023223259,0.00018079394,0.00016073613,0.000050238283,0.00011190957,0.00026583427,0.0033297758],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981756,0.00028873992,0.00009790426,0.00018614861,0.00084601785,0.00040553533],"domain_scores_gemma":[0.99638546,0.0011789851,0.0006013114,0.0006056661,0.0010405505,0.00018817298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019565318,0.0005482895,0.00044902173,0.00081107876,0.00059206295,0.0024443457,0.0013546319,0.00041663923,0.0014979095],"category_scores_gemma":[0.005942289,0.00024640994,0.00022923313,0.0010564005,0.00067778496,0.0029298158,0.00070980133,0.00068053004,0.000509067],"study_design_candidate":"bench_or_experimental","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.0015765034,0.00049905345,0.047421336,0.0017321662,0.00015931444,0.00032151543,0.0011078464,0.032520603,0.078181826,0.07750939,0.0077170692,0.7512533],"study_design_scores_gemma":[0.00016811701,0.007300693,0.12404101,0.00093954237,0.00078552106,0.0044308077,0.00180032,0.34911636,0.266496,0.045380406,0.19915886,0.00038243065],"about_ca_topic_score_codex":0.00212305,"about_ca_topic_score_gemma":0.0020874925,"teacher_disagreement_score":0.0024443457,"about_ca_system_score_codex":0.0012344328,"about_ca_system_score_gemma":0.000911339,"threshold_uncertainty_score":0.010347307},"labels":[],"label_agreement":null},{"id":"W4399723170","doi":"10.1145/3665283.3665297","title":"CAD Techniques for NoC-Connected Multi-CGRA Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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 Toronto","funders":"","keywords":"Computer science; CAD; Computer architecture; Embedded system; Parallel computing; Engineering; Engineering drawing","score_opus":0.029647139450659526,"score_gpt":0.2839806443060249,"score_spread":0.2543335048553653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399723170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055233445,0.0005682645,0.93113923,0.00017743708,0.000073425465,0.000081218015,0.00009823633,0.0019261955,0.0107025],"genre_scores_gemma":[0.47766602,0.00041134586,0.51612574,0.00008417621,0.000020162715,0.00013460174,0.00022777331,0.00024401647,0.0050862036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979,0.00003345158,0.000011651393,0.000030713236,0.00011635409,0.000017823002],"domain_scores_gemma":[0.9996177,0.0001347121,0.00004046824,0.00009536706,0.00010009864,0.00001154313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020115678,0.00044549242,0.0002398716,0.00054507086,0.00028996062,0.00040491932,0.0007174764,0.00035416122,0.004015523],"category_scores_gemma":[0.0011127372,0.00027912363,0.000247799,0.00049004436,0.00026977272,0.00043287137,0.0005109327,0.0004682011,0.00043868241],"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.00008266322,0.000065238004,0.0015739884,0.0002772716,0.0000549224,0.00019939407,0.0002501439,0.7102352,0.06945144,0.019380357,0.0026680594,0.19576134],"study_design_scores_gemma":[0.00001905218,0.00006885934,0.00063866435,0.00002620417,0.000018769708,0.00013310762,0.000039619867,0.9677491,0.015342775,0.00415122,0.011799691,0.00001287749],"about_ca_topic_score_codex":0.001962288,"about_ca_topic_score_gemma":0.0037009583,"teacher_disagreement_score":0.004015523,"about_ca_system_score_codex":0.0005877561,"about_ca_system_score_gemma":0.00043910628,"threshold_uncertainty_score":0.013433278},"labels":[],"label_agreement":null},{"id":"W4399973719","doi":"10.1002/jgt.23146","title":"Attainable bounds for algebraic connectivity and maximally connected regular graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Interconnection Networks and 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":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Algebraic number; Algebraic connectivity; Discrete mathematics; Graph; Line graph","score_opus":0.008902518721699832,"score_gpt":0.23630028197731293,"score_spread":0.2273977632556131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399973719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6230211,0.002019575,0.30075893,0.0014950308,0.00010705499,0.00009547091,0.0010355243,0.0013101493,0.07015718],"genre_scores_gemma":[0.9729734,0.0004479212,0.02502295,0.00012865436,0.00008267272,0.000066036446,0.0003369926,0.000088529414,0.00085271324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983425,0.00032203563,0.000069720925,0.0003755964,0.0005381307,0.0003518803],"domain_scores_gemma":[0.9859774,0.010202135,0.00096915144,0.0012814766,0.0008040319,0.0007657945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015915859,0.0008836902,0.00092503615,0.0022918284,0.000969442,0.0018184226,0.0016184788,0.0010163898,0.0044619446],"category_scores_gemma":[0.01603837,0.00048072985,0.0006754948,0.0016446406,0.0019552184,0.0040316735,0.0024084533,0.0019838882,0.0004577315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004111369,0.0002448166,0.005935055,0.00053220516,0.00008660918,0.00047651798,0.00078176294,0.16185881,0.030005898,0.7469605,0.004843919,0.047862764],"study_design_scores_gemma":[0.00004085739,0.00024115648,0.0036447018,0.00013612366,0.000058527017,0.00076230755,0.00034519023,0.3004687,0.023448655,0.6623619,0.008421648,0.00007019901],"about_ca_topic_score_codex":0.00053060584,"about_ca_topic_score_gemma":0.0008398732,"teacher_disagreement_score":0.0044619446,"about_ca_system_score_codex":0.001264263,"about_ca_system_score_gemma":0.0004972798,"threshold_uncertainty_score":0.014926672},"labels":[],"label_agreement":null},{"id":"W4400021049","doi":"10.56553/popets-2024-0100","title":"PRAC: Round-Efficient 3-Party MPC for Dynamic Data Structures","year":2024,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Interconnection Networks and Systems","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; University of Waterloo; Royal Bank of Canada","keywords":"Computer science","score_opus":0.036462159009906354,"score_gpt":0.3073009581521042,"score_spread":0.27083879914219783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400021049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016655667,0.00019741835,0.9682976,0.0004924971,0.00007380946,0.00029902896,0.0002890187,0.006530544,0.007164411],"genre_scores_gemma":[0.52001965,0.00018634234,0.4688316,0.00047886555,0.00007740683,0.0008130348,0.0006769981,0.0008648927,0.0080512175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559695,0.0012493937,0.00028307867,0.00057114847,0.001695517,0.0006039374],"domain_scores_gemma":[0.9931578,0.0013293779,0.00039461683,0.004596091,0.00033686668,0.00018530064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027326543,0.0006497936,0.0010187348,0.000561612,0.0015547548,0.0022315588,0.0034047686,0.0015190887,0.0071366066],"category_scores_gemma":[0.0077085188,0.0006643799,0.001553846,0.0008759475,0.0022080685,0.005422616,0.00682232,0.0031322427,0.0023375312],"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.0011632099,0.0002984123,0.001363159,0.00045832474,0.00019350435,0.0003224573,0.00063163583,0.13850628,0.03510021,0.5897798,0.018019715,0.21416336],"study_design_scores_gemma":[0.00016705887,0.000195233,0.00028940363,0.000039609145,0.00005051979,0.00024531953,0.00007611642,0.7197397,0.040376253,0.2106296,0.028099457,0.00009178364],"about_ca_topic_score_codex":0.0010841799,"about_ca_topic_score_gemma":0.0014631575,"teacher_disagreement_score":0.0071366066,"about_ca_system_score_codex":0.0016623599,"about_ca_system_score_gemma":0.0025034535,"threshold_uncertainty_score":0.023874342},"labels":[],"label_agreement":null},{"id":"W4400033941","doi":"10.1109/ectc51529.2024.00098","title":"Reliable Chiplet Integration on High Density Laminate (2.XD) for AI Hardware","year":2024,"lang":"en","type":"article","venue":"","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":"IBM (Canada)","funders":"","keywords":"Computer science; Computer hardware; Embedded system; Computer architecture","score_opus":0.01410976025179167,"score_gpt":0.2511695080193858,"score_spread":0.23705974776759414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400033941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94287163,0.0012881854,0.042104084,0.000065898785,0.00010750087,0.00006924084,0.00021577293,0.00086637895,0.012411466],"genre_scores_gemma":[0.9727174,0.00024627155,0.022564832,0.000025969704,0.000013942801,0.000035229245,0.00016664616,0.00005417788,0.0041755415],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981326,0.000022970886,0.0000064433066,0.000023159286,0.000093152834,0.00004094726],"domain_scores_gemma":[0.99972516,0.000036335452,0.000085724445,0.000052068535,0.00008249938,0.000018295163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001835422,0.00024880707,0.000119419434,0.00032641648,0.000154734,0.0004879606,0.00032018137,0.00028774483,0.0018287139],"category_scores_gemma":[0.00029123703,0.00014382323,0.0001996111,0.00025071495,0.000111309186,0.00031937042,0.00022131234,0.00017371764,0.0005224001],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00016891323,0.000050198745,0.002493613,0.00024920466,0.00004363302,0.00032152038,0.00009035739,0.008585771,0.96526897,0.0012552537,0.0006181946,0.020854421],"study_design_scores_gemma":[0.000034154167,0.0031110954,0.0190703,0.000067185814,0.00009150367,0.0008770976,0.00013007752,0.0389621,0.9097223,0.0003504234,0.027553394,0.000030351051],"about_ca_topic_score_codex":0.00038117834,"about_ca_topic_score_gemma":0.0009615798,"teacher_disagreement_score":0.0018287139,"about_ca_system_score_codex":0.00026528366,"about_ca_system_score_gemma":0.0001722321,"threshold_uncertainty_score":0.0061175823},"labels":[],"label_agreement":null},{"id":"W4400237890","doi":"10.1109/iscas58744.2024.10558430","title":"A Rule-Based High Efficient Obstacle-Avoiding RSMT Algorithm for VLSI Routing","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Advanced Micro Devices (Canada)","funders":"National Natural Science Foundation of China","keywords":"Very-large-scale integration; Obstacle; Computer science; Routing (electronic design automation); Parallel computing; Routing algorithm; Algorithm design; Algorithm; Embedded system; Routing protocol","score_opus":0.01611258267738973,"score_gpt":0.24606452674395177,"score_spread":0.22995194406656203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400237890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024823098,0.00034757936,0.96888405,0.00010965613,0.00006754462,0.00011273429,0.00008798909,0.0018058184,0.003761476],"genre_scores_gemma":[0.21477532,0.00027473763,0.7796805,0.00013488354,0.000034209865,0.00016613347,0.0005611509,0.0001799898,0.0041931756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997706,0.000024405374,0.000021959737,0.000051380106,0.00010479062,0.000026960908],"domain_scores_gemma":[0.99974495,0.00006598822,0.000028962568,0.000055168304,0.00008805879,0.000016896889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021179992,0.00051796495,0.0006171827,0.0006898416,0.00035350415,0.00053672434,0.0011751609,0.0006126343,0.0028186003],"category_scores_gemma":[0.0009734687,0.00024390889,0.00050928147,0.0007134499,0.00026372616,0.00069833983,0.00069528574,0.00056998094,0.00094253157],"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.00014320949,0.000109889465,0.0009331532,0.00013913737,0.00004741619,0.0001827169,0.00007094909,0.31671402,0.03322793,0.011620755,0.006913353,0.6298975],"study_design_scores_gemma":[0.0000377351,0.000089368776,0.00020599648,0.000011782258,0.000019783083,0.00015589224,0.000016518921,0.9843833,0.0064753443,0.0043518017,0.0042385543,0.000013894363],"about_ca_topic_score_codex":0.0024555146,"about_ca_topic_score_gemma":0.0035131657,"teacher_disagreement_score":0.0028186003,"about_ca_system_score_codex":0.00033314628,"about_ca_system_score_gemma":0.0009805836,"threshold_uncertainty_score":0.009429216},"labels":[],"label_agreement":null},{"id":"W4400325795","doi":"10.4230/lipics.esa.2024.24","title":"A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Interconnection Networks and Systems","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Algorithm; Combinatorics; Computer science; Mathematics; Graph; Artificial intelligence","score_opus":0.05738119772931273,"score_gpt":0.20184774976655984,"score_spread":0.14446655203724712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400325795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04224031,0.00037514692,0.9392683,0.00050613476,0.00008397228,0.0004132969,0.001731504,0.008280199,0.0071011973],"genre_scores_gemma":[0.24727443,0.00029822983,0.73791736,0.00019903101,0.000081289036,0.00053959305,0.0066826628,0.0015755369,0.005431791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973911,0.0003415398,0.00019078804,0.0011437908,0.0006396205,0.000293031],"domain_scores_gemma":[0.9938553,0.002414909,0.0005122765,0.002348653,0.00059423386,0.00027452342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018107,0.002130705,0.0016965324,0.0021121707,0.0014035519,0.0034217837,0.005012248,0.0023799809,0.012989807],"category_scores_gemma":[0.010733096,0.0012450668,0.0018738813,0.0040353537,0.0014181101,0.008654858,0.0045821457,0.0025473237,0.0028689273],"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.0007440298,0.00055765745,0.0034023782,0.0007018219,0.00022670334,0.00043285478,0.00065314065,0.3097201,0.018224929,0.101708665,0.025717352,0.53791034],"study_design_scores_gemma":[0.0002103387,0.00013541314,0.00069616555,0.00006315868,0.00007207076,0.00028902353,0.00021304593,0.81207114,0.007187905,0.16805133,0.010953971,0.00005638231],"about_ca_topic_score_codex":0.0046697813,"about_ca_topic_score_gemma":0.0066853105,"teacher_disagreement_score":0.012989807,"about_ca_system_score_codex":0.0028694198,"about_ca_system_score_gemma":0.002709495,"threshold_uncertainty_score":0.043455303},"labels":[],"label_agreement":null},{"id":"W4400364008","doi":"10.1016/j.nancom.2024.100526","title":"Probability-based mapping approach for an application-aware networks-on-chip architectures","year":2024,"lang":"en","type":"article","venue":"Nano Communication Networks","topic":"Interconnection Networks and 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 Saskatchewan","funders":"","keywords":"Computer science; Chip; Distributed computing; Telecommunications","score_opus":0.04496609206672779,"score_gpt":0.27246645172448286,"score_spread":0.22750035965775506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400364008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016189877,0.0002460116,0.98087823,0.00008591271,0.000032006144,0.0000421502,0.00002304391,0.00040617355,0.002096535],"genre_scores_gemma":[0.6267411,0.00047792183,0.3686041,0.00010579105,0.000048877995,0.00016447988,0.00011493983,0.00009587714,0.003647004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.000121764126,0.000019308207,0.000066566674,0.00015699056,0.000035715282],"domain_scores_gemma":[0.9996588,0.00012517453,0.00004091205,0.000058994094,0.000096697484,0.000019513313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037905847,0.0005463975,0.00029893528,0.0006865367,0.00038601097,0.00052187976,0.00078607065,0.00034726635,0.001658786],"category_scores_gemma":[0.0013097915,0.000224711,0.0003281604,0.0005445482,0.00022254384,0.00090313004,0.0005764675,0.00039367503,0.0003064595],"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.00007793898,0.00010158811,0.0013171685,0.00013110894,0.00006172511,0.00020096499,0.00010171811,0.6674841,0.023440816,0.034373138,0.0022594964,0.27045017],"study_design_scores_gemma":[0.0000045097645,0.00004121404,0.000286348,0.0000040320388,0.000012426259,0.000076173004,0.000017496064,0.9848172,0.002962888,0.009618946,0.0021512844,0.000007494118],"about_ca_topic_score_codex":0.0013249776,"about_ca_topic_score_gemma":0.0018983524,"teacher_disagreement_score":0.001658786,"about_ca_system_score_codex":0.00044853552,"about_ca_system_score_gemma":0.00076466025,"threshold_uncertainty_score":0.005549252},"labels":[],"label_agreement":null},{"id":"W4400484708","doi":"10.61091/jcmcc120-36","title":"Hamiltonian Laceability of Hypercubes with Prescribed Linear Forest and/or Faulty Edges","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Combinatorics; Mathematics; Hamiltonian path; Hamiltonian (control theory); Graph; Mathematical optimization","score_opus":0.019311295792831498,"score_gpt":0.2572892807899825,"score_spread":0.23797798499715098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8926492,0.0005678448,0.08553277,0.0003445677,0.00004602529,0.000079687634,0.0004420828,0.0002192975,0.020118473],"genre_scores_gemma":[0.98244,0.00020052686,0.012616198,0.00005730127,0.000022771752,0.0000673204,0.0002402672,0.000048126403,0.0043074866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996563,0.0000989292,0.00002083481,0.000053753647,0.00006359148,0.000106540174],"domain_scores_gemma":[0.9984023,0.0008046649,0.00029988147,0.000172845,0.0001382292,0.00018212355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003800008,0.00028413412,0.00034464532,0.0006559326,0.0008093239,0.0012163654,0.00060232484,0.00042595138,0.0051569953],"category_scores_gemma":[0.0022492646,0.00035816766,0.00034090612,0.0005582176,0.0012584098,0.0013985004,0.0011331096,0.00041245393,0.0002712423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010040909,0.0001527438,0.006236207,0.0006382685,0.00012910567,0.0015753134,0.000829199,0.3191842,0.020183047,0.6082664,0.0064171148,0.035384394],"study_design_scores_gemma":[0.00014959494,0.00015831219,0.0017191847,0.00005521321,0.00003709011,0.00044759546,0.00043085002,0.4901385,0.007999828,0.4951727,0.0036530567,0.00003812265],"about_ca_topic_score_codex":0.002195398,"about_ca_topic_score_gemma":0.0033868675,"teacher_disagreement_score":0.0051569953,"about_ca_system_score_codex":0.0009108281,"about_ca_system_score_gemma":0.00041537677,"threshold_uncertainty_score":0.01725185},"labels":[],"label_agreement":null},{"id":"W4400512506","doi":"10.61091/ars159-14","title":"5-Regular Subgraphs in Hypercubes","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Combinatorics; Hypercube; Mathematics; Integer (computer science); Vertex (graph theory); Induced subgraph; Discrete mathematics; Graph","score_opus":0.009741632269100343,"score_gpt":0.22829226629881294,"score_spread":0.2185506340297126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8664555,0.00083645986,0.07817589,0.0006723695,0.000064671105,0.00018046652,0.0014556954,0.00044257814,0.051716328],"genre_scores_gemma":[0.93585193,0.0006190899,0.051453643,0.00024323181,0.000053467742,0.0001883429,0.004025008,0.000097110715,0.007468155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942786,0.00013072339,0.000044492946,0.0001473326,0.00012594875,0.00012369882],"domain_scores_gemma":[0.99910295,0.00031850347,0.00022498236,0.00011647023,0.00012125446,0.0001158996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771626,0.00031294086,0.00030482796,0.00068686134,0.00066236715,0.0010766976,0.00058972853,0.0004997041,0.0042352136],"category_scores_gemma":[0.0014774934,0.00037998686,0.0005722413,0.0008385565,0.0007764739,0.001344765,0.0012427694,0.00061941467,0.0006667077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055409776,0.0002203518,0.010487883,0.0008142128,0.000095254,0.0017785144,0.0015072133,0.084459275,0.039702248,0.7840532,0.012302967,0.0640247],"study_design_scores_gemma":[0.0001761663,0.00020791577,0.008833126,0.00014841298,0.00005602508,0.0016328489,0.0014415146,0.19029737,0.02171458,0.7420958,0.03333045,0.00006584793],"about_ca_topic_score_codex":0.0015881078,"about_ca_topic_score_gemma":0.0022051623,"teacher_disagreement_score":0.0042352136,"about_ca_system_score_codex":0.00082417537,"about_ca_system_score_gemma":0.00036605645,"threshold_uncertainty_score":0.014168203},"labels":[],"label_agreement":null},{"id":"W4400596804","doi":"10.55016/ojs/cdm.v16i3.62468","title":"New cyclic Kautz digraphs with optimal diameter","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Agència de Gestió d'Ajuts Universitaris i de Recerca; European Commission","keywords":"Digraph; Combinatorics; Iterated function; Mathematics; Alphabet; Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.008987353394995507,"score_gpt":0.25575134147274214,"score_spread":0.24676398807774663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45464897,0.0015786124,0.455609,0.0010195778,0.0002744612,0.00031392524,0.002313677,0.0011038941,0.083138],"genre_scores_gemma":[0.8083576,0.00089472195,0.15660185,0.0005833132,0.00010513519,0.000323787,0.0026470087,0.00022832354,0.03025826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996482,0.00005717303,0.000023544482,0.000115518356,0.000069746224,0.000085817715],"domain_scores_gemma":[0.9992835,0.00022504941,0.000073725685,0.00013957295,0.00013469235,0.00014349705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002447977,0.00043693147,0.0004346991,0.00088975014,0.0010032611,0.0012142041,0.0007237907,0.00064490084,0.0047191796],"category_scores_gemma":[0.0013288638,0.00035992978,0.00056368124,0.0007578401,0.0006456154,0.001601186,0.00080072426,0.00078990246,0.0008378856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034219693,0.00015196412,0.002033159,0.0003879604,0.000060610575,0.00056849763,0.0006329304,0.035658095,0.037578527,0.8231617,0.015118058,0.084306315],"study_design_scores_gemma":[0.00014575616,0.00018025057,0.0022332424,0.000082091436,0.000091840244,0.0010793649,0.00041860182,0.16116546,0.019895783,0.7091467,0.10545442,0.00010653848],"about_ca_topic_score_codex":0.0019081989,"about_ca_topic_score_gemma":0.0033583385,"teacher_disagreement_score":0.0047191796,"about_ca_system_score_codex":0.0014445976,"about_ca_system_score_gemma":0.00071970205,"threshold_uncertainty_score":0.015787184},"labels":[],"label_agreement":null},{"id":"W4400680859","doi":"10.1109/saner60148.2024.00057","title":"Comparative Study of Reinforcement Learning in GitHub Pull Request Outcome Predictions","year":2024,"lang":"en","type":"article","venue":"","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":"Carleton University","funders":"","keywords":"Reinforcement learning; Computer science; Outcome (game theory); Reinforcement; Artificial intelligence; Engineering; Structural engineering; Mathematics","score_opus":0.055257810474489764,"score_gpt":0.3240587006938017,"score_spread":0.26880089021931197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400680859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176709,0.00091790844,0.07230427,0.0018002221,0.00012332038,0.00024643115,0.0004922306,0.002241927,0.0042026853],"genre_scores_gemma":[0.99023855,0.00006759165,0.008416146,0.00012781195,0.000026318372,0.000055065364,0.00044993195,0.00005264847,0.0005659685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934243,0.0043299193,0.00018943429,0.0008661664,0.00071123784,0.00047883726],"domain_scores_gemma":[0.93962634,0.050713778,0.002542238,0.002283257,0.0033643867,0.001469967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0193917,0.0011819004,0.0010008175,0.0013228745,0.00054810714,0.0013835911,0.0012921547,0.0012294697,0.0014301457],"category_scores_gemma":[0.06259365,0.00036754823,0.0005085138,0.0008831734,0.00088929804,0.0025766434,0.00136883,0.002248658,0.00067466614],"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.0026441372,0.0013534173,0.0979726,0.0002551947,0.0002181045,0.00018284991,0.0004313456,0.7481966,0.0013809386,0.0045107333,0.006817678,0.13603641],"study_design_scores_gemma":[0.00003117946,0.00012322864,0.0028102614,0.00000929069,0.000010235522,0.000010789123,0.000049571827,0.994735,0.0005417799,0.0014327761,0.00023564747,0.000010292432],"about_ca_topic_score_codex":0.008313207,"about_ca_topic_score_gemma":0.0062879594,"teacher_disagreement_score":0.0193917,"about_ca_system_score_codex":0.0018065021,"about_ca_system_score_gemma":0.0016559275,"threshold_uncertainty_score":0.10255432},"labels":[],"label_agreement":null},{"id":"W4401880292","doi":"10.1109/mm.2024.3447711","title":"Co-Design of Interchiplet, Package, and System Interconnect Protocols","year":2024,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Interconnection Networks and Systems","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":"Alpha Technologies (Canada)","funders":"","keywords":"Computer science; Interconnection; Computer architecture; Embedded system; Computer network","score_opus":0.03457412439194708,"score_gpt":0.29359706895539533,"score_spread":0.25902294456344827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401880292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019283002,0.0004307952,0.9612562,0.00032630583,0.00011554537,0.0001932979,0.00004274531,0.0010641754,0.017287888],"genre_scores_gemma":[0.62740403,0.000682604,0.3576054,0.00032808,0.000079097066,0.00047934576,0.00024106444,0.0003049,0.0128754815],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878746,0.00037606692,0.00006957275,0.0001784563,0.00043185195,0.00015660739],"domain_scores_gemma":[0.9988998,0.00019153218,0.00014339777,0.0003198061,0.00037581916,0.000069637674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016755133,0.00047740902,0.00032908242,0.0005478016,0.00033174828,0.0017579192,0.0016304386,0.0006049281,0.002898864],"category_scores_gemma":[0.0017917253,0.00031426802,0.00035277006,0.0003541717,0.00052405434,0.0014805504,0.0011320986,0.0009807303,0.0013097217],"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.00025965556,0.00029901994,0.0027377533,0.0003472442,0.00018297184,0.00039702829,0.0003621202,0.275519,0.0728936,0.23436473,0.010104164,0.40253276],"study_design_scores_gemma":[0.000038491995,0.0005877364,0.0010166938,0.00006130583,0.00008595326,0.0003214926,0.00014166809,0.83967215,0.066890925,0.029896807,0.06125882,0.000027878417],"about_ca_topic_score_codex":0.00046982354,"about_ca_topic_score_gemma":0.0011715859,"teacher_disagreement_score":0.002898864,"about_ca_system_score_codex":0.00079418346,"about_ca_system_score_gemma":0.0012162408,"threshold_uncertainty_score":0.009697676},"labels":[],"label_agreement":null},{"id":"W4402475028","doi":"10.1109/ccece59415.2024.10667242","title":"Implementing Multipathing When Using Partitioned Communication in Open MPI","year":2024,"lang":"en","type":"article","venue":"","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":"Queen's University","funders":"","keywords":"Computer science; Parallel computing; Computer network","score_opus":0.08252444453576725,"score_gpt":0.3526659425937873,"score_spread":0.27014149805802007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23018396,0.00034309772,0.6958685,0.0007134426,0.00045781845,0.0003335581,0.00030861734,0.057690315,0.014100678],"genre_scores_gemma":[0.6488858,0.00021581884,0.34121272,0.00026241012,0.00010947748,0.00038981385,0.00044574527,0.004362031,0.0041162143],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769574,0.00061445753,0.0002078028,0.00031829337,0.0007237435,0.00044001715],"domain_scores_gemma":[0.99294335,0.0024242415,0.00041932837,0.002950206,0.0009388772,0.00032386227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172702,0.0009024681,0.00044963634,0.0005808391,0.0010933268,0.0017346579,0.0018383407,0.0008677102,0.0030873283],"category_scores_gemma":[0.01519427,0.0007772719,0.00056115026,0.00064219447,0.0011432312,0.0031319982,0.003807642,0.0019034912,0.00092858076],"study_design_candidate":"bench_or_experimental","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.0031224464,0.0007262966,0.029360166,0.0010314425,0.00032614067,0.0015956742,0.005740454,0.155434,0.28780562,0.06514129,0.02281808,0.4268984],"study_design_scores_gemma":[0.000494746,0.0012323045,0.0073898653,0.00024346595,0.000273226,0.0007638495,0.0010150813,0.44963345,0.38329923,0.05451474,0.10073527,0.00040476382],"about_ca_topic_score_codex":0.0022774227,"about_ca_topic_score_gemma":0.004041431,"teacher_disagreement_score":0.0030873283,"about_ca_system_score_codex":0.00057734037,"about_ca_system_score_gemma":0.0016624596,"threshold_uncertainty_score":0.011490524},"labels":[],"label_agreement":null},{"id":"W4402510183","doi":"10.1109/tvt.2024.3461161","title":"DRL-AdCAR: Adaptive Coding-Aware Routing With Maximum Coding Opportunities and High-Quality via Deep Reinforcement Learning in FANET","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Interconnection Networks and Systems","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Coding (social sciences); Computer network; Artificial intelligence; Mathematics","score_opus":0.026453501926605314,"score_gpt":0.24446836682843445,"score_spread":0.21801486490182914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402510183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052292686,0.0006667715,0.9421397,0.00037957018,0.00011171828,0.000049468614,0.00006298474,0.0009716547,0.0033254412],"genre_scores_gemma":[0.9245471,0.0002834393,0.07194785,0.0002802619,0.00003668059,0.00007509198,0.00011539634,0.00005545787,0.0026586873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973387,0.000052948963,0.0000143389925,0.00006932016,0.00007279053,0.000056787696],"domain_scores_gemma":[0.9993061,0.00033976158,0.00008868485,0.00005418788,0.0001614681,0.00004988338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072803267,0.00069600577,0.0006866997,0.0003377514,0.0003134084,0.00062659,0.0012883279,0.0007567699,0.00090072723],"category_scores_gemma":[0.0019918536,0.0002701825,0.00030750522,0.00034543048,0.00062572164,0.0009693713,0.0008573941,0.0012379363,0.00015466822],"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.00005079763,0.000066640285,0.0006002215,0.000040089,0.00002481063,0.00006908807,0.00003913622,0.9289683,0.0030457515,0.004687418,0.0012598827,0.061147857],"study_design_scores_gemma":[0.0000033211768,0.000013310388,0.000030818665,0.0000018050796,0.0000024803023,0.00000572537,0.00000199442,0.99866116,0.00032397034,0.00084266404,0.000110272886,0.000002422659],"about_ca_topic_score_codex":0.010139519,"about_ca_topic_score_gemma":0.008563625,"teacher_disagreement_score":0.010139519,"about_ca_system_score_codex":0.0009376719,"about_ca_system_score_gemma":0.0010699491,"threshold_uncertainty_score":0.020161033},"labels":[],"label_agreement":null},{"id":"W4402703980","doi":"10.1175/aies-d-24-0101.1","title":"Efficient Fine-Tuning of 37-Level GraphCast with the Canadian Global Deterministic Analysis","year":2025,"lang":"en","type":"preprint","venue":"Artificial Intelligence for the Earth Systems","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":true,"ca_institutions":"Environment and Climate Change Canada","funders":"","keywords":"Computer science; Econometrics; Economics","score_opus":0.07781509034038958,"score_gpt":0.297313925103527,"score_spread":0.21949883476313742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402703980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70672905,0.00036953358,0.23750171,0.0014704003,0.0005581621,0.00043316305,0.004143892,0.01417391,0.03462018],"genre_scores_gemma":[0.9361585,0.00006950386,0.05824662,0.00015415209,0.000022827402,0.00005822393,0.0019664797,0.0005584209,0.0027651577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996418,0.0000501617,0.000012445717,0.000088212335,0.0001161032,0.0000913586],"domain_scores_gemma":[0.9992034,0.00017672384,0.000035636418,0.00015410673,0.00033437926,0.000095868534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000864806,0.000729487,0.000419331,0.00042230936,0.000812636,0.00081139914,0.0015988172,0.00043325796,0.0031615368],"category_scores_gemma":[0.0037727759,0.0003562499,0.0005630004,0.00036080476,0.00049055595,0.0006401776,0.00096581987,0.0015742374,0.00065533805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010283721,0.00007322405,0.005896241,0.00004105856,0.000046692574,0.000047007114,0.00008069207,0.9489327,0.0048961802,0.002001356,0.0043837475,0.033498287],"study_design_scores_gemma":[0.000019808198,0.000017668017,0.0019157823,0.0000059124714,0.000011363452,0.0000042965517,0.000021587624,0.99212027,0.002601547,0.00056091207,0.0027038425,0.000017074773],"about_ca_topic_score_codex":0.6716237,"about_ca_topic_score_gemma":0.63369745,"teacher_disagreement_score":0.3283763,"about_ca_system_score_codex":0.003953685,"about_ca_system_score_gemma":0.008688125,"threshold_uncertainty_score":0.66062033},"labels":[],"label_agreement":null},{"id":"W4403277742","doi":"10.1109/fpl64840.2024.00015","title":"The Road Less Traveled: Congestion-Aware NoC Placement and Packet Routing for FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"","keywords":"Routing (electronic design automation); Computer science; Field-programmable gate array; Network packet; Computer network; Embedded system","score_opus":0.02652935152601651,"score_gpt":0.2668917209443228,"score_spread":0.24036236941830627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403277742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07161316,0.0008605746,0.91666824,0.0005979291,0.00014962831,0.00007487094,0.00005320417,0.0019842098,0.0079981275],"genre_scores_gemma":[0.8218613,0.00032765054,0.17356484,0.00022864272,0.000042850384,0.000058969028,0.00009327991,0.00016910394,0.0036533624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968946,0.00008822983,0.000010561456,0.000052959644,0.00010151348,0.000057187222],"domain_scores_gemma":[0.9995845,0.00015084566,0.00007218546,0.000060235838,0.000087335335,0.00004481858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063271314,0.00066557893,0.00036290218,0.0003856312,0.00035838812,0.0005841049,0.0010259638,0.0006013821,0.0019460346],"category_scores_gemma":[0.0017033864,0.00033212488,0.00032161555,0.00020901837,0.0004920043,0.00078612834,0.00066675793,0.0007011917,0.0003044504],"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.0000669977,0.00004749526,0.00064518134,0.000039983315,0.000018912193,0.000055030036,0.000031339354,0.9123863,0.005214161,0.004461133,0.0012261765,0.07580739],"study_design_scores_gemma":[0.00000910471,0.00003813453,0.00011185072,0.000004935457,0.00000648865,0.000016265765,0.000008402175,0.9960116,0.001302513,0.0016479853,0.0008391621,0.0000035336764],"about_ca_topic_score_codex":0.005337727,"about_ca_topic_score_gemma":0.008035779,"teacher_disagreement_score":0.005337727,"about_ca_system_score_codex":0.000993555,"about_ca_system_score_gemma":0.0012866858,"threshold_uncertainty_score":0.010613263},"labels":[],"label_agreement":null},{"id":"W4403278520","doi":"10.1109/fpl64840.2024.00017","title":"A High-Performance Routing Engine for Large-Scale FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Guelph","funders":"","keywords":"Computer science; Field-programmable gate array; Routing (electronic design automation); Scale (ratio); Embedded system; Computer architecture; Geography; Cartography","score_opus":0.010637407154962631,"score_gpt":0.22924061754592853,"score_spread":0.2186032103909659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403278520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056440774,0.00088531064,0.839118,0.0003002765,0.00016054948,0.00024597975,0.0012192948,0.07787174,0.023758102],"genre_scores_gemma":[0.282321,0.0006015375,0.69341224,0.00020929908,0.000033358185,0.00015246565,0.0034748942,0.0024270206,0.017368175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999757,0.000036045414,0.000014447489,0.000057307047,0.00009914498,0.00003605617],"domain_scores_gemma":[0.9997863,0.000054318458,0.000020711832,0.000065035485,0.00005744476,0.000016175525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004252242,0.0007073487,0.00031884562,0.00048201668,0.00028322102,0.0009264894,0.0013011129,0.00034754205,0.0093682865],"category_scores_gemma":[0.00082257285,0.00036731843,0.00035947078,0.0005619614,0.0001848986,0.0011438717,0.00036392975,0.00052705675,0.0026020294],"study_design_candidate":"bench_or_experimental","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.0006757783,0.00026371249,0.0023206642,0.0006330213,0.00015890592,0.0004845352,0.0001542168,0.14496626,0.16727155,0.046376187,0.092947945,0.5437471],"study_design_scores_gemma":[0.00030302617,0.0003753196,0.0015038792,0.000054016415,0.000086167965,0.0004226469,0.000069726266,0.77329224,0.11034742,0.013438321,0.100016035,0.00009112998],"about_ca_topic_score_codex":0.0029702699,"about_ca_topic_score_gemma":0.005993823,"teacher_disagreement_score":0.0093682865,"about_ca_system_score_codex":0.00058693235,"about_ca_system_score_gemma":0.0010291963,"threshold_uncertainty_score":0.031340063},"labels":[],"label_agreement":null},{"id":"W4403638487","doi":"10.1080/23799927.2024.2416513","title":"A recurrence for the surface area of ( <i>n, k</i> )-arrangement graphs","year":2024,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","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":"Surface (topology); Combinatorics; Mathematics; Geometry","score_opus":0.02415245441467564,"score_gpt":0.2652987174020755,"score_spread":0.24114626298739986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403638487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20623167,0.0013130017,0.7611602,0.0013732662,0.00023439522,0.0001579281,0.0009120207,0.0011529402,0.027464554],"genre_scores_gemma":[0.80516243,0.00095069053,0.18137386,0.00023223009,0.00019824706,0.00029579856,0.000983591,0.00031130813,0.010491956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00008927743,0.000044999877,0.0001365823,0.00015350533,0.00010455503],"domain_scores_gemma":[0.99778616,0.0012961667,0.00029169687,0.00019376169,0.00032476065,0.00010753754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004976447,0.00042616238,0.0006445312,0.0012835597,0.0005864626,0.0012784998,0.001003796,0.00062519027,0.0045908075],"category_scores_gemma":[0.006400609,0.00025493203,0.0006580703,0.0014885922,0.0011336051,0.002864676,0.00094903755,0.0010712867,0.0010096908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021921347,0.00007681603,0.006738365,0.0005053456,0.00005121064,0.0010639713,0.0010293783,0.14270784,0.02104038,0.65854055,0.016914617,0.15111236],"study_design_scores_gemma":[0.000023424353,0.00008191839,0.0021974514,0.00005003179,0.000033886605,0.0009519798,0.00026370134,0.44373995,0.0052889683,0.53684276,0.010463824,0.00006218344],"about_ca_topic_score_codex":0.0012452044,"about_ca_topic_score_gemma":0.0014245381,"teacher_disagreement_score":0.0045908075,"about_ca_system_score_codex":0.0010154243,"about_ca_system_score_gemma":0.0004056714,"threshold_uncertainty_score":0.015357792},"labels":[],"label_agreement":null},{"id":"W4403742549","doi":"10.18280/isi.290513","title":"Buffer Association of Network on Chip (NoC) Using Simulated Network","year":2024,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Buffer (optical fiber); Network on a chip; Computer science; Association (psychology); Chip; Parallel computing; Embedded system; Telecommunications; Psychology","score_opus":0.016323437199275013,"score_gpt":0.2384143608897961,"score_spread":0.22209092369052108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403742549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8981481,0.00039183276,0.090134196,0.00021478876,0.000092421345,0.00006745595,0.00037501036,0.00093608984,0.009640193],"genre_scores_gemma":[0.9886635,0.000060644314,0.009942258,0.000014925445,0.0000052137284,0.000026655558,0.00011934977,0.000030205223,0.001137208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997402,0.0000875931,0.000012945909,0.000052230705,0.00005566392,0.00005132384],"domain_scores_gemma":[0.99789774,0.001261376,0.00016919017,0.00013648672,0.00044677028,0.00008836465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046611103,0.00043297722,0.0004454761,0.0006939751,0.00048683095,0.00062863634,0.0008470115,0.000863245,0.0036824779],"category_scores_gemma":[0.0026961777,0.00038993417,0.00033138698,0.0008341634,0.00030525753,0.0007778036,0.00033350603,0.00036441928,0.00016167262],"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.00007909835,0.000037122958,0.0012020644,0.000029487885,0.0000127568555,0.000043928652,0.00001980095,0.9944593,0.00070210267,0.0006891847,0.00015792935,0.0025673732],"study_design_scores_gemma":[0.0000033674626,0.0000132604,0.00009930658,0.0000012327883,0.0000037690313,0.0000034819666,0.000004184908,0.9994011,0.000294011,0.00013284494,0.00004193244,0.00000148986],"about_ca_topic_score_codex":0.014697507,"about_ca_topic_score_gemma":0.012152812,"teacher_disagreement_score":0.014697507,"about_ca_system_score_codex":0.0010494941,"about_ca_system_score_gemma":0.0011038308,"threshold_uncertainty_score":0.02922386},"labels":[],"label_agreement":null},{"id":"W4403863187","doi":"10.1109/tnet.2024.3481152","title":"Enabling Rank-Based P4 Programmable Schedulers: Requirements, Implementation, and Evaluation on BMv2 Switches","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rank (graph theory); Computer architecture; Embedded system; Mathematics","score_opus":0.05843924637607877,"score_gpt":0.3312098925092904,"score_spread":0.2727706461332116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403863187","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8552353,0.00015706196,0.1316936,0.00020557249,0.00008816564,0.00038093823,0.00019461152,0.0054500443,0.0065947836],"genre_scores_gemma":[0.93616116,0.0000964144,0.061175067,0.00008554894,0.000010220659,0.000107473345,0.00017057791,0.00018896062,0.0020045852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00030679427,0.00005540023,0.00009340559,0.0003880855,0.00023205733],"domain_scores_gemma":[0.99843866,0.0005830439,0.00016239008,0.0002741361,0.00039012646,0.00015165593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735707,0.0005970189,0.00027169107,0.0003059183,0.0003715875,0.0008721373,0.002022111,0.0003386127,0.002002182],"category_scores_gemma":[0.003486672,0.00022063243,0.00019781456,0.00030679512,0.0005467205,0.0011964086,0.0006772494,0.0007760829,0.00023256772],"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.0050902786,0.0024850196,0.017015075,0.0010665369,0.00014534636,0.0011334185,0.0012142666,0.45602173,0.25992614,0.043502066,0.008317426,0.20408273],"study_design_scores_gemma":[0.00026169876,0.0015590746,0.0019708325,0.000025842366,0.000040017956,0.000121078636,0.00021133795,0.8244093,0.16306962,0.001943461,0.0063364063,0.000051301624],"about_ca_topic_score_codex":0.0071068243,"about_ca_topic_score_gemma":0.00469383,"teacher_disagreement_score":0.0071068243,"about_ca_system_score_codex":0.0011037835,"about_ca_system_score_gemma":0.0015892491,"threshold_uncertainty_score":0.01413089},"labels":[],"label_agreement":null},{"id":"W4403940531","doi":"10.37236/12980","title":"Layered Subgraphs of the Hypercube","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Parallel computing; Geology; Computer science; Combinatorics; Mathematics","score_opus":0.004848642471394242,"score_gpt":0.20326200840164893,"score_spread":0.1984133659302547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403940531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.765566,0.0009545588,0.17458552,0.00089780486,0.00011100337,0.000074845506,0.00085566216,0.00046194502,0.056492724],"genre_scores_gemma":[0.94888294,0.00072872214,0.03930929,0.00029094602,0.00006507752,0.00012057462,0.0012675477,0.000107347405,0.009227663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999711,0.00008163534,0.000014446604,0.000055971082,0.00007369612,0.00006328615],"domain_scores_gemma":[0.99921715,0.00021089488,0.00014880057,0.00019889226,0.00011677641,0.00010758563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014032469,0.00021563833,0.00023820876,0.00036982418,0.00051463494,0.00083496614,0.00042522256,0.00028658754,0.0031669422],"category_scores_gemma":[0.0010472673,0.00033834326,0.00042711486,0.00042545403,0.0006466919,0.0014686498,0.0013698981,0.0006089961,0.0004737807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023108031,0.000035490408,0.0032643613,0.0002316911,0.00005470187,0.001009429,0.0005985607,0.0355317,0.03622462,0.889088,0.0070634107,0.02666704],"study_design_scores_gemma":[0.000038981947,0.000063404535,0.0049692807,0.000064260494,0.000041742347,0.00083583477,0.00039522856,0.08370148,0.012287957,0.8779308,0.019634858,0.000036138394],"about_ca_topic_score_codex":0.0013477292,"about_ca_topic_score_gemma":0.0016629724,"teacher_disagreement_score":0.0031669422,"about_ca_system_score_codex":0.000492802,"about_ca_system_score_gemma":0.0003425463,"threshold_uncertainty_score":0.010594487},"labels":[],"label_agreement":null},{"id":"W4404133733","doi":"10.2139/ssrn.5013483","title":"Bounds on Broadcast Time in Well-Connected Graphs","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.007074821855896956,"score_gpt":0.22994435438810595,"score_spread":0.222869532532209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404133733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2123719,0.024764042,0.6253192,0.022812176,0.0018378247,0.0003306099,0.0052248314,0.003468038,0.103871405],"genre_scores_gemma":[0.8556907,0.016682822,0.082590885,0.0034111678,0.0029764117,0.0009847882,0.0035403331,0.0026720704,0.03145077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957705,0.0009325835,0.00016993216,0.000800459,0.0011250037,0.001201448],"domain_scores_gemma":[0.8781375,0.104765154,0.003333922,0.005101336,0.003998908,0.0046631945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006380314,0.0033524274,0.0038386087,0.0056410334,0.003009585,0.007976263,0.0060238615,0.003581441,0.020722318],"category_scores_gemma":[0.051409062,0.0019031785,0.0021789023,0.006295066,0.0050104437,0.016811045,0.0055559184,0.0087601,0.00313369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043655345,0.0005540381,0.0044195093,0.002782727,0.00044471663,0.00052643206,0.0021421365,0.23375742,0.020739429,0.60553354,0.043348648,0.08138589],"study_design_scores_gemma":[0.0002346974,0.00020211951,0.0013288185,0.00030418797,0.00034771874,0.0002620732,0.00029500588,0.27718905,0.00397781,0.7098454,0.0059265294,0.00008654059],"about_ca_topic_score_codex":0.0033267573,"about_ca_topic_score_gemma":0.0047175833,"teacher_disagreement_score":0.020722318,"about_ca_system_score_codex":0.005793121,"about_ca_system_score_gemma":0.0029107968,"threshold_uncertainty_score":0.06932312},"labels":[],"label_agreement":null},{"id":"W4405937374","doi":"10.1109/acp/ipoc63121.2024.10809973","title":"Performance Analysis of Parallel Structures for Links Between Data Centers","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and 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":"Université Laval","funders":"","keywords":"Computer science; Parallel computing","score_opus":0.05804520447675643,"score_gpt":0.3053693751665498,"score_spread":0.24732417068979334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405937374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9280668,0.0003306787,0.0636517,0.00025527444,0.00001328795,0.00005029985,0.00014233618,0.00058473845,0.006904986],"genre_scores_gemma":[0.9935462,0.00005905886,0.0051346035,0.000014975572,0.000008045431,0.00001839422,0.000049254926,0.000027823698,0.0011416896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996326,0.0000905067,0.000010434772,0.000060536302,0.00013182042,0.000074043135],"domain_scores_gemma":[0.99829143,0.00075917173,0.00024586913,0.00023303677,0.000404975,0.00006552138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055020396,0.00044011787,0.00030231554,0.00046336598,0.00055273256,0.0007029357,0.0006280276,0.00041166184,0.002469922],"category_scores_gemma":[0.0026745268,0.00021673864,0.00023005244,0.0005043684,0.00042477527,0.00096932246,0.00035177768,0.00036246912,0.0003473571],"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.00042983185,0.00013015578,0.0034489592,0.0000738057,0.000046117326,0.00009919034,0.00005306614,0.9475793,0.027990013,0.005546631,0.00057905464,0.014023859],"study_design_scores_gemma":[0.000011127821,0.00010656166,0.0005432857,0.0000031723755,0.0000119854885,0.0000239528,0.00001461319,0.99157095,0.006713749,0.00084146013,0.00015475294,0.0000044012163],"about_ca_topic_score_codex":0.0036996137,"about_ca_topic_score_gemma":0.0045674816,"teacher_disagreement_score":0.0036996137,"about_ca_system_score_codex":0.0017317571,"about_ca_system_score_gemma":0.0007340721,"threshold_uncertainty_score":0.012564838},"labels":[],"label_agreement":null},{"id":"W4406163797","doi":"10.61091/ars161-03","title":"\\((n−2)\\)-Fault-Tolerant Edge-Pancyclicity of Möbius Cubes \\(MQ_n\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.01186018279222473,"score_gpt":0.2432766486586561,"score_spread":0.2314164658664314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88416225,0.0004067702,0.09155561,0.0003931489,0.000119788776,0.000076850745,0.00038050208,0.00016999459,0.022735028],"genre_scores_gemma":[0.97883075,0.00023630177,0.017054575,0.00010415782,0.000028995028,0.000051344385,0.00029151168,0.00002319403,0.0033792222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998041,0.00003334881,0.000014376587,0.000042963482,0.00004880803,0.000056317647],"domain_scores_gemma":[0.99943894,0.00015050214,0.00012524692,0.000110667665,0.000104437655,0.000070195536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016272989,0.00020725196,0.000250736,0.00028592054,0.0005609583,0.00051843614,0.00041792012,0.00022534135,0.00147028],"category_scores_gemma":[0.0010352811,0.00011405624,0.00025179438,0.00038874647,0.0005152814,0.0006446089,0.00076164183,0.00041981915,0.00018940147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012465727,0.00009791187,0.0064088413,0.00041258306,0.00007649741,0.001441979,0.00064871483,0.17553388,0.1433854,0.5335962,0.006755365,0.13039608],"study_design_scores_gemma":[0.00014423639,0.0007436002,0.00496999,0.00006343367,0.000045805038,0.0021002172,0.00040213845,0.41690475,0.106057376,0.44313207,0.025336454,0.0000999083],"about_ca_topic_score_codex":0.0014866054,"about_ca_topic_score_gemma":0.0017698067,"teacher_disagreement_score":0.0014866054,"about_ca_system_score_codex":0.00043064103,"about_ca_system_score_gemma":0.00039969158,"threshold_uncertainty_score":0.0049185157},"labels":[],"label_agreement":null},{"id":"W4406203396","doi":"10.61091/jcmcc123-01","title":"Decomposition of A Complete Equipartite Graph into Gregarious \\(\\mathcal{Y}_5\\) Tree","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Graph; Tree (set theory); Mathematics; Decomposition; Tree decomposition; Discrete mathematics; Chemistry; Pathwidth; Line graph","score_opus":0.016275355210054982,"score_gpt":0.2716088382100886,"score_spread":0.2553334830000336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406203396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024801,0.00038391378,0.4208136,0.00041626574,0.00008977987,0.00019440964,0.0017932724,0.00047212924,0.07335652],"genre_scores_gemma":[0.79182535,0.00044403988,0.17484058,0.00033913873,0.00005016916,0.00023936442,0.0037061875,0.00020182591,0.028353376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981683,0.00003395653,0.000010094854,0.000044965665,0.000042692984,0.000051503022],"domain_scores_gemma":[0.99968266,0.000040047235,0.00004996503,0.00007725058,0.000077851706,0.000072248265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001299774,0.00024402404,0.00023152346,0.0007447096,0.0007582595,0.00069502747,0.0004981775,0.00043190378,0.006952238],"category_scores_gemma":[0.0003727738,0.00020494415,0.0004643137,0.0005895023,0.00043783436,0.00085702934,0.0008473845,0.0005291498,0.0010348004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017673628,0.00010383193,0.0020872373,0.00026160316,0.0000645933,0.0006711682,0.00052323926,0.016199946,0.05335801,0.85933715,0.010337369,0.056879044],"study_design_scores_gemma":[0.000042140626,0.00018097591,0.008793865,0.000094894574,0.00009724875,0.001869059,0.0006305389,0.1151229,0.015849307,0.79859585,0.05866056,0.00006272005],"about_ca_topic_score_codex":0.0012247972,"about_ca_topic_score_gemma":0.0029029604,"teacher_disagreement_score":0.006952238,"about_ca_system_score_codex":0.00053592306,"about_ca_system_score_gemma":0.0003535653,"threshold_uncertainty_score":0.023257494},"labels":[],"label_agreement":null},{"id":"W4406480758","doi":"10.1007/s11390-023-2561-y","title":"P3DC: Reducing DRAM Cache Hit Latency by Hybrid Mappings","year":2024,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Cache; Parallel computing; Dram; Latency (audio); CAS latency; Theory of computation; Cache algorithms; CPU cache; Operating system; Embedded system; Computer hardware; Algorithm; Memory controller; Telecommunications","score_opus":0.006352724953010962,"score_gpt":0.22183695703123665,"score_spread":0.2154842320782257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406480758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6773586,0.0047656805,0.25571716,0.0005665469,0.0007065767,0.0002744307,0.00166244,0.029999455,0.02894904],"genre_scores_gemma":[0.9124799,0.00030814786,0.07969564,0.00018970107,0.00006151877,0.00009720968,0.000892719,0.00039111337,0.0058840336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.00005552491,0.000015810523,0.000064008455,0.00011623885,0.000091043694],"domain_scores_gemma":[0.9992086,0.00016417669,0.000037721547,0.00031078607,0.00020448024,0.00007411895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025890511,0.000812691,0.000434715,0.0007041281,0.00080402766,0.0009410582,0.0018920836,0.00047705238,0.005603943],"category_scores_gemma":[0.0011993576,0.00024700363,0.00025721407,0.0014970361,0.00032970417,0.0011978773,0.0010650544,0.0005706958,0.0009828802],"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.0037210293,0.00082192844,0.007919001,0.0005551285,0.00023399525,0.0005837958,0.00029178726,0.08330725,0.13262336,0.009765246,0.06565964,0.6945179],"study_design_scores_gemma":[0.0005750426,0.0013801055,0.00457689,0.00004505921,0.00021424911,0.000779747,0.00036212895,0.81026417,0.14667584,0.008497258,0.026555046,0.00007447891],"about_ca_topic_score_codex":0.0056906994,"about_ca_topic_score_gemma":0.011515621,"teacher_disagreement_score":0.0056906994,"about_ca_system_score_codex":0.0005056859,"about_ca_system_score_gemma":0.0014917352,"threshold_uncertainty_score":0.018747032},"labels":[],"label_agreement":null},{"id":"W4406481255","doi":"10.1080/23799927.2025.2454546","title":"On messy broadcasting in directed hyper-cylinder graphs","year":2025,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics Computer Systems Theory","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Mathematics; Computer network","score_opus":0.011524154473439753,"score_gpt":0.2554768673040764,"score_spread":0.2439527128306367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406481255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2614658,0.0019494294,0.7068724,0.0015618117,0.00011217699,0.0001693927,0.00058690563,0.00057813665,0.026703993],"genre_scores_gemma":[0.9154643,0.0023407086,0.07308947,0.00026931375,0.00014325629,0.00018576029,0.00047603226,0.00016893387,0.007862257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990029,0.0003895091,0.0000391635,0.0001270451,0.00022458362,0.00021674878],"domain_scores_gemma":[0.99375653,0.004414777,0.00066283793,0.00054947764,0.0003367318,0.00027975932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011012129,0.0005270038,0.0008272522,0.0011008411,0.0011599809,0.001429143,0.0011582242,0.00065847335,0.0025883622],"category_scores_gemma":[0.0070622205,0.0003564026,0.00040530457,0.001675361,0.001446188,0.0027498584,0.0012553278,0.0010259598,0.0005084981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004495968,0.0000482384,0.0007738368,0.00022538754,0.00003267446,0.00017102453,0.0004598739,0.34727708,0.0045666015,0.60729975,0.006001237,0.032694716],"study_design_scores_gemma":[0.000050739243,0.00010091963,0.00041313644,0.000034122262,0.000020778767,0.00016778358,0.00023743794,0.54727966,0.0014435613,0.44508603,0.005136599,0.000029298706],"about_ca_topic_score_codex":0.0061359773,"about_ca_topic_score_gemma":0.0057061347,"teacher_disagreement_score":0.0061359773,"about_ca_system_score_codex":0.0027827001,"about_ca_system_score_gemma":0.0011646249,"threshold_uncertainty_score":0.02019},"labels":[],"label_agreement":null},{"id":"W4406641246","doi":"10.1016/b978-1-55860-348-6.50004-3","title":"10.1016/b978-1-55860-348-6.50004-3","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.009772107780671797,"score_gpt":0.17044555164687794,"score_spread":0.16067344386620613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406641246","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002454006,0.000649049,0.0015684295,0.00026997156,0.00021373463,0.000047246864,0.00078084343,0.0010612115,0.99516404],"genre_scores_gemma":[0.0005359364,0.0003317405,0.00047093164,0.000095234514,0.00003595726,0.000028563843,0.00042341813,0.00020877227,0.9978695],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996094,0.0000220887,0.000022271477,0.00013939946,0.00013243554,0.0000744462],"domain_scores_gemma":[0.9987863,0.00037174916,0.00008631861,0.00016696492,0.00023965254,0.00034907903],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006516799,0.002206363,0.0012240688,0.0018315337,0.0011658758,0.00385259,0.0025982156,0.0037830903,0.97412646],"category_scores_gemma":[0.0010336181,0.00079630263,0.00078173546,0.0021209035,0.0009913581,0.004341236,0.0023502826,0.002067976,0.98604405],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119180535,0.00011280688,0.00034067166,0.0004786501,0.000019311981,0.00011960615,0.00007014265,0.00041102956,0.0032787467,0.0062909927,0.37963992,0.60911894],"study_design_scores_gemma":[0.0000135258715,0.000042939082,0.00034354377,0.00020231106,0.000007696307,0.00017777363,0.000053299398,0.0001690232,0.0004340672,0.00092155655,0.99762326,0.000011084753],"about_ca_topic_score_codex":0.0023695538,"about_ca_topic_score_gemma":0.0023604992,"teacher_disagreement_score":0.025873542,"about_ca_system_score_codex":0.0008142778,"about_ca_system_score_gemma":0.00064150686,"threshold_uncertainty_score":0.036905408},"labels":[],"label_agreement":null},{"id":"W4406861205","doi":"10.1109/ipccc59868.2024.10850473","title":"Spreading Computations for Loop-Free Multipath Routing in Computer Networks","year":2024,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Computer science; Multipath propagation; Computation; Multipath routing; Loop (graph theory); Routing (electronic design automation); Computer network; Routing protocol; Static routing; Algorithm; Channel (broadcasting); Mathematics","score_opus":0.02087702710148485,"score_gpt":0.26362404933431677,"score_spread":0.24274702223283193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406861205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032840457,0.00021029408,0.9633597,0.000098717974,0.000046317986,0.00008013616,0.000029496923,0.00047122582,0.0028636346],"genre_scores_gemma":[0.62983876,0.00035837758,0.36722702,0.00006232409,0.0000494824,0.00016353482,0.000097856835,0.00014433273,0.0020583475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.000165721,0.000033953947,0.000040274386,0.00021877528,0.00004365823],"domain_scores_gemma":[0.99763954,0.0014736007,0.00015583225,0.00021166603,0.00046110977,0.000058312893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008586011,0.00050550885,0.00037117413,0.0006203271,0.0005594549,0.0007454075,0.0006178687,0.00036703298,0.0018824654],"category_scores_gemma":[0.0051628505,0.00022940234,0.00027346265,0.00077653566,0.00084367755,0.0011222652,0.000598689,0.0008587448,0.0002453868],"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.00016344567,0.000048960672,0.00073421997,0.00010384366,0.000031342715,0.00009039353,0.00014387075,0.816197,0.012149868,0.10428148,0.0012149786,0.06484068],"study_design_scores_gemma":[0.000007235831,0.000020928708,0.000041379964,0.00000579939,0.0000041235367,0.000013134124,0.000008615911,0.98417974,0.0015542561,0.013546299,0.0006128561,0.0000055484334],"about_ca_topic_score_codex":0.0034195515,"about_ca_topic_score_gemma":0.003564231,"teacher_disagreement_score":0.0034195515,"about_ca_system_score_codex":0.0008183257,"about_ca_system_score_gemma":0.0011884822,"threshold_uncertainty_score":0.0067992806},"labels":[],"label_agreement":null},{"id":"W4407315468","doi":"10.1109/tvlsi.2025.3530785","title":"Strassen Multisystolic Array Hardware Architectures","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Strassen algorithm; Computer science; Computer hardware; Physics","score_opus":0.01046963389340058,"score_gpt":0.24687174947558505,"score_spread":0.23640211558218446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407315468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07524149,0.0010312877,0.8662589,0.0004935271,0.00027652527,0.00014417041,0.0004979081,0.012384029,0.04367218],"genre_scores_gemma":[0.4220399,0.0005729492,0.5429875,0.00048754585,0.000110745976,0.0002616921,0.0010829626,0.00043577078,0.03202082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968565,0.000039530652,0.00003529232,0.00007370319,0.00011589058,0.000050038474],"domain_scores_gemma":[0.9993881,0.00011020401,0.00008068682,0.0001538211,0.00023173595,0.000035450696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002832059,0.00046035217,0.00029518612,0.0007013415,0.00044950825,0.00097131147,0.001672497,0.0004899704,0.01651203],"category_scores_gemma":[0.00077275245,0.00028991696,0.00036686417,0.000859991,0.00029204728,0.0014708092,0.0006905257,0.00062965654,0.0045796754],"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.0006882211,0.00021722462,0.0019673451,0.0006570184,0.00010673266,0.00034212315,0.00033548096,0.07286183,0.17283843,0.15486822,0.024373438,0.570744],"study_design_scores_gemma":[0.00014736092,0.0013100727,0.00145411,0.00013312376,0.00010687925,0.0010421085,0.00014382352,0.5107512,0.28844658,0.04586507,0.15046668,0.00013299397],"about_ca_topic_score_codex":0.0010075181,"about_ca_topic_score_gemma":0.0028930288,"teacher_disagreement_score":0.01651203,"about_ca_system_score_codex":0.00097158033,"about_ca_system_score_gemma":0.0010681466,"threshold_uncertainty_score":0.055238247},"labels":[],"label_agreement":null},{"id":"W4407476882","doi":"10.1109/apmc60911.2024.10867758","title":"Efficiency and Bandwidth Improvement of Digitally-Assisted LMBAs Using Adaptive Input Power Distribution","year":2024,"lang":"en","type":"article","venue":"","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 Calgary","funders":"","keywords":"Bandwidth (computing); Computer science; Power (physics); Electronic engineering; Telecommunications; Engineering","score_opus":0.016065982176210147,"score_gpt":0.23891798278526016,"score_spread":0.22285200060905003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407476882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8221503,0.00044422937,0.16872644,0.00016820668,0.00002387451,0.000029123454,0.000044820415,0.00073790486,0.007675061],"genre_scores_gemma":[0.9772471,0.000085080326,0.021108828,0.000027166945,0.0000060500174,0.000011919584,0.000024986604,0.000032947548,0.001455841],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998665,0.00002745919,0.000005703179,0.00002867059,0.00005077505,0.000020865838],"domain_scores_gemma":[0.999801,0.00006806076,0.000051220948,0.000023081631,0.000044769324,0.0000117973905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017894828,0.0002689668,0.00014409283,0.00023802575,0.00014952227,0.00034192862,0.0003812708,0.00024467238,0.0011983133],"category_scores_gemma":[0.00040079557,0.00011180576,0.0001028838,0.00022021568,0.00022495579,0.0004467608,0.00021898223,0.00020309401,0.0004571405],"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.00014159858,0.000053955362,0.0008851439,0.00003668655,0.000010672862,0.000025930294,0.000055206754,0.004943511,0.95305085,0.0019043026,0.00010869917,0.03878338],"study_design_scores_gemma":[0.00002890416,0.00037209384,0.0021043362,0.000013688285,0.000021927977,0.00016575318,0.00002902487,0.082481906,0.909232,0.00082206476,0.0047127074,0.00001557329],"about_ca_topic_score_codex":0.00032045008,"about_ca_topic_score_gemma":0.000670186,"teacher_disagreement_score":0.0011983133,"about_ca_system_score_codex":0.00028611062,"about_ca_system_score_gemma":0.00010267729,"threshold_uncertainty_score":0.00400877},"labels":[],"label_agreement":null},{"id":"W4407920597","doi":"10.18280/jesa.580111","title":"Optimum Compensation of Packet-Loss over IEEE 802 Standard-Based Blackhole for DC Motor Speed Control","year":2025,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Compensation (psychology); Computer science; DC motor; End-to-end delay; Computer network; Network packet; Electrical engineering; Engineering; Psychology","score_opus":0.02365361299110951,"score_gpt":0.27792687166675933,"score_spread":0.2542732586756498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407920597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37186325,0.00087372,0.6201453,0.00043038093,0.00022476875,0.00007866173,0.000042977063,0.0010076559,0.0053333035],"genre_scores_gemma":[0.9904839,0.000055516444,0.008935807,0.0000201176,0.000014857177,0.000006769766,0.0000070466904,0.0000082316,0.0004677215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992931,0.00021302619,0.00002503713,0.00014671756,0.00018815242,0.00013401623],"domain_scores_gemma":[0.9989324,0.0004529905,0.000115939176,0.00008272094,0.00037783693,0.000038077673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009471082,0.0005500155,0.0004486991,0.0004761801,0.0005458008,0.00071632897,0.0007433783,0.00054728414,0.0013004489],"category_scores_gemma":[0.0025192928,0.00017016161,0.0001505387,0.0002656005,0.00044333615,0.0010114089,0.0004240353,0.00042528802,0.00012218625],"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.0048989216,0.00069163425,0.003989691,0.00038032033,0.0001229365,0.00028585718,0.0002990577,0.25369927,0.28269964,0.02295637,0.0032645217,0.42671174],"study_design_scores_gemma":[0.00007101408,0.0006952485,0.0011931723,0.00002068554,0.00005578048,0.00012080247,0.000044028766,0.9529726,0.04114758,0.0025737067,0.001080248,0.000025120926],"about_ca_topic_score_codex":0.0010056463,"about_ca_topic_score_gemma":0.0019778297,"teacher_disagreement_score":0.0013004489,"about_ca_system_score_codex":0.00071352976,"about_ca_system_score_gemma":0.0006239506,"threshold_uncertainty_score":0.005177021},"labels":[],"label_agreement":null},{"id":"W4408325621","doi":"10.1109/aiccsa63423.2024.10912602","title":"Performance Evaluation and Benchmarking of PQC CRYSTALS-Kyber on Embedded Devices","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"Université de Sherbrooke","funders":"","keywords":"Benchmarking; Computer science; Nanotechnology; Materials science; Business","score_opus":0.023259874356090962,"score_gpt":0.27904764076847755,"score_spread":0.2557877664123866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408325621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9473004,0.0018805315,0.025082318,0.00044442213,0.00026452958,0.00019997642,0.0007104514,0.003940764,0.02017669],"genre_scores_gemma":[0.98937714,0.00027489694,0.0065001487,0.00006912137,0.000019798827,0.00005122663,0.00037394842,0.00014979062,0.0031839374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99818075,0.00038348633,0.00008838213,0.00027187908,0.0007702892,0.00030522718],"domain_scores_gemma":[0.99773836,0.00072401954,0.00020161747,0.00046282748,0.0007299529,0.00014325358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206565,0.00071397156,0.0008183347,0.00078132923,0.00067944423,0.0008377307,0.0015708728,0.00088628486,0.004537902],"category_scores_gemma":[0.003466071,0.0001722385,0.00028862324,0.0010014881,0.00075454876,0.0018207827,0.0010600529,0.00071961904,0.0009696947],"study_design_candidate":"observational","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.009311066,0.0012764613,0.015426432,0.0035759336,0.0006208819,0.0019863816,0.0010263327,0.4486195,0.26049638,0.043088727,0.030050242,0.18452166],"study_design_scores_gemma":[0.00028376118,0.0066447416,0.0062096347,0.00012992401,0.00012830715,0.00073181535,0.0004117891,0.61792916,0.34547243,0.003750579,0.018179378,0.00012846828],"about_ca_topic_score_codex":0.0010863821,"about_ca_topic_score_gemma":0.0010674217,"teacher_disagreement_score":0.004537902,"about_ca_system_score_codex":0.0010854366,"about_ca_system_score_gemma":0.00064765627,"threshold_uncertainty_score":0.015180826},"labels":[],"label_agreement":null},{"id":"W4408736823","doi":"10.61091/ars162-02","title":"The degree associated edge reconstruction number of bidegreed graphs is at most four","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Board for Higher Mathematics","keywords":"Mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Statistics; Combinatorics; Artificial intelligence; Computer science","score_opus":0.023821742122332495,"score_gpt":0.24497500410164152,"score_spread":0.22115326197930904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92152643,0.00032279937,0.058131423,0.0004482288,0.00003745133,0.00003696731,0.0003489305,0.0001518772,0.018995848],"genre_scores_gemma":[0.9728371,0.00034034968,0.023036126,0.00010820918,0.00001761653,0.000033894048,0.000569015,0.00003809466,0.003019541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.00006707713,0.000023144237,0.0001314017,0.000095056756,0.00012134419],"domain_scores_gemma":[0.9976992,0.0012098915,0.00029726283,0.00038330755,0.00021243464,0.0001980135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040960356,0.0003252029,0.00027469473,0.000480229,0.00067898654,0.0010894592,0.0008527608,0.00032783987,0.0021380384],"category_scores_gemma":[0.002614813,0.0002810918,0.0003359927,0.00060867926,0.00089870323,0.0015377377,0.0010199517,0.00094803853,0.00041904626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012841894,0.00037897305,0.041937433,0.000747484,0.00010986108,0.0009169569,0.0011778985,0.06789943,0.12792489,0.5809206,0.008549322,0.16815297],"study_design_scores_gemma":[0.00018061894,0.0006632932,0.03455615,0.00010194659,0.00023380738,0.0045102574,0.0010032409,0.30395663,0.12863757,0.48963386,0.036381934,0.00014063157],"about_ca_topic_score_codex":0.0008996843,"about_ca_topic_score_gemma":0.0015222541,"teacher_disagreement_score":0.0021380384,"about_ca_system_score_codex":0.00062571093,"about_ca_system_score_gemma":0.00037555548,"threshold_uncertainty_score":0.007152498},"labels":[],"label_agreement":null},{"id":"W4409839611","doi":"10.1016/j.comcom.2025.108173","title":"A novel energy-efficient cross-layer design for scheduling and routing in 6TiSCH networks","year":2025,"lang":"en","type":"article","venue":"Computer Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Ministère de l'Enseignement Supérieur et de la Recherche Scientifique","keywords":"Computer science; Scheduling (production processes); Computer network; Routing (electronic design automation); Distributed computing; Mathematical optimization","score_opus":0.06266617415485004,"score_gpt":0.3171091297572265,"score_spread":0.25444295560237645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409839611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038390134,0.00050251617,0.9527806,0.00020970337,0.00015753972,0.00009597926,0.00008054348,0.00084504986,0.0069379606],"genre_scores_gemma":[0.5651765,0.0004563059,0.42760685,0.0003069362,0.00008511614,0.00015025288,0.00020030612,0.00017955461,0.005838173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953556,0.00011398561,0.000034827157,0.00006506694,0.00018192748,0.00006862234],"domain_scores_gemma":[0.9995888,0.00008836443,0.00005338251,0.00008299994,0.00015681272,0.000029619612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005706215,0.0005017651,0.00034515993,0.0004193504,0.00047904078,0.00095936295,0.0013908937,0.0003769477,0.0026848644],"category_scores_gemma":[0.00085040607,0.0003433486,0.00033633228,0.00030090997,0.00021739306,0.00081242656,0.00069612847,0.0007082097,0.0005385405],"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.0005416848,0.00032322967,0.0016485028,0.00036612473,0.00025161103,0.00031271364,0.00024221026,0.42304248,0.2340942,0.070942044,0.009802881,0.25843233],"study_design_scores_gemma":[0.00002743498,0.00016726623,0.00020720538,0.000013567837,0.000045816396,0.0001087339,0.000024187424,0.966362,0.02286052,0.0047533414,0.0054118726,0.000018016786],"about_ca_topic_score_codex":0.0012928267,"about_ca_topic_score_gemma":0.005117605,"teacher_disagreement_score":0.0026848644,"about_ca_system_score_codex":0.00068041007,"about_ca_system_score_gemma":0.0010624344,"threshold_uncertainty_score":0.008981764},"labels":[],"label_agreement":null},{"id":"W4409894255","doi":"10.71352/ac.47.261","title":"Enumeration of connected feedforward networks","year":2018,"lang":"en","type":"article","venue":"Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio computatorica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NanoQuébec (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Computer science; Feed forward; Mathematics; Combinatorics; Engineering; Control engineering","score_opus":0.006555169149301765,"score_gpt":0.20844308143195284,"score_spread":0.20188791228265107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409894255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27639985,0.0012263878,0.68701166,0.00062564656,0.000081766906,0.00014615334,0.0010538351,0.0005316033,0.03292316],"genre_scores_gemma":[0.88738024,0.0010274664,0.0959387,0.0002360077,0.00010775521,0.00043460733,0.0013781162,0.00015806773,0.013338925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893385,0.00035203868,0.000062328676,0.00020265645,0.00032032584,0.00012884896],"domain_scores_gemma":[0.99311674,0.0048889713,0.00054601073,0.0005151059,0.0006614368,0.00027166808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009177838,0.0005430823,0.00065355044,0.0025161195,0.0008990904,0.001635694,0.0013906858,0.0014775728,0.0074324273],"category_scores_gemma":[0.011359417,0.00059181324,0.0006177577,0.0013719329,0.0010321214,0.0026226144,0.0013886627,0.00089486496,0.0006593136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017404635,0.00006466584,0.0034920925,0.00044722098,0.00006858408,0.00034133278,0.0003632112,0.08416179,0.008128523,0.8435803,0.0045598377,0.05461845],"study_design_scores_gemma":[0.000021896654,0.000043222488,0.0012809057,0.0000866745,0.000021083848,0.0004512343,0.0000646191,0.29876924,0.0027404842,0.6922511,0.004244802,0.000024714012],"about_ca_topic_score_codex":0.00037492393,"about_ca_topic_score_gemma":0.0005627359,"teacher_disagreement_score":0.0074324273,"about_ca_system_score_codex":0.0006651537,"about_ca_system_score_gemma":0.00041047332,"threshold_uncertainty_score":0.024863958},"labels":[],"label_agreement":null},{"id":"W4410400756","doi":"10.1145/3728179.3728196","title":"Systolic Array-Based Matrix Multiplication and Reduction on Elastic CGRAs","year":2025,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplication (music); Reduction (mathematics); Matrix multiplication; Computer science; Parallel computing; Systolic array; Matrix (chemical analysis); Arithmetic; Physics; Very-large-scale integration; Mathematics; Embedded system; Materials science; Combinatorics","score_opus":0.009302123584836272,"score_gpt":0.25858755589532645,"score_spread":0.24928543231049016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410400756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10495934,0.00049869827,0.85885864,0.00041442364,0.00031713114,0.00009756815,0.00032221372,0.0063091647,0.028222902],"genre_scores_gemma":[0.47732505,0.0003043301,0.49306428,0.0003227606,0.00014599762,0.00013767349,0.00081534707,0.00043176243,0.027452841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995958,0.000055670585,0.000021824755,0.00006290785,0.00018377489,0.000080057],"domain_scores_gemma":[0.99961436,0.00009191225,0.00002491088,0.00012998928,0.00011881505,0.000020043062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017966583,0.0006821166,0.00049268815,0.0006835825,0.00066323957,0.00080232974,0.0013325929,0.00033703935,0.007474108],"category_scores_gemma":[0.00078928174,0.00023602393,0.000488861,0.0013599182,0.00047990755,0.0009774216,0.0010472803,0.00074652967,0.001898348],"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.0009696712,0.0003335741,0.0014133903,0.000280488,0.0001104513,0.00045874168,0.00027737254,0.18681248,0.10829898,0.074243575,0.027567055,0.5992342],"study_design_scores_gemma":[0.00009244267,0.00028214202,0.00072500604,0.000024888059,0.000051638646,0.00020503455,0.00013931337,0.890625,0.058577474,0.030629767,0.018611126,0.000036196652],"about_ca_topic_score_codex":0.004081044,"about_ca_topic_score_gemma":0.010799971,"teacher_disagreement_score":0.007474108,"about_ca_system_score_codex":0.00050013396,"about_ca_system_score_gemma":0.001180115,"threshold_uncertainty_score":0.025003314},"labels":[],"label_agreement":null},{"id":"W4410977851","doi":"10.1002/dac.70137","title":"A Novel Hex‐Penta‐Based Network Topology","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and 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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Topology (electrical circuits); Network topology; Computer network; Electrical engineering","score_opus":0.02268641950966897,"score_gpt":0.30708178697521127,"score_spread":0.2843953674655423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410977851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2600609,0.0008385444,0.65836734,0.0010413455,0.0005332975,0.00023354994,0.0008971966,0.001645179,0.076382644],"genre_scores_gemma":[0.8612482,0.0003966739,0.126968,0.0001234865,0.000038231647,0.00011456328,0.00057780306,0.00004229856,0.010490819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.000059297552,0.000014313543,0.000031317843,0.000045594927,0.00002668568],"domain_scores_gemma":[0.99975675,0.000031322135,0.000031424912,0.000046868103,0.000098673416,0.000034912424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011992233,0.00015105489,0.00019495825,0.0004316465,0.00051436917,0.000778096,0.00040179843,0.00022915009,0.002892187],"category_scores_gemma":[0.00023693596,0.00012436142,0.0001475385,0.0006252668,0.00025466166,0.0006934677,0.0005003733,0.00022653607,0.0005224678],"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.00067031296,0.00018441053,0.0047619827,0.0004799212,0.00009945607,0.00239477,0.00039425906,0.42696628,0.14073478,0.16387533,0.027668564,0.23176998],"study_design_scores_gemma":[0.000059549497,0.00036300253,0.0017808307,0.00004664377,0.000042482807,0.0014004775,0.00032493394,0.8700629,0.029682638,0.030046606,0.066129014,0.000060878767],"about_ca_topic_score_codex":0.0017351444,"about_ca_topic_score_gemma":0.0018339517,"teacher_disagreement_score":0.002892187,"about_ca_system_score_codex":0.00041393732,"about_ca_system_score_gemma":0.00042526267,"threshold_uncertainty_score":0.009675384},"labels":[],"label_agreement":null},{"id":"W4410992488","doi":"10.1364/ofc.2025.w4i.5","title":"Discrete-Modulated CVQKD with Composable Security","year":2025,"lang":"en","type":"article","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Computer security; Computer network","score_opus":0.003390200720501626,"score_gpt":0.22004952114268203,"score_spread":0.21665932042218042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410992488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3535236,0.00033269727,0.6154077,0.0011925432,0.0005399278,0.00039408458,0.00019651485,0.002126241,0.026286637],"genre_scores_gemma":[0.94231915,0.000057983154,0.05476935,0.00012877946,0.000044707096,0.000092390954,0.000053557935,0.00011155918,0.002422574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974469,0.00040945693,0.0001170309,0.00037439598,0.0013036648,0.00034861054],"domain_scores_gemma":[0.9974564,0.00096192607,0.00026062853,0.0009209469,0.00023367917,0.0001664879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023459664,0.0005442182,0.000690861,0.00034692817,0.0007522276,0.0016400301,0.0015422403,0.0009856969,0.0035439816],"category_scores_gemma":[0.0035119406,0.00038936717,0.0005725439,0.00041075575,0.0030044587,0.002234624,0.0027037004,0.0023911155,0.0006310182],"study_design_candidate":"bench_or_experimental","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.000986579,0.00038836128,0.0018296815,0.00037318573,0.00012396624,0.00066629075,0.0005656948,0.029824,0.33524534,0.5828424,0.001856949,0.045297544],"study_design_scores_gemma":[0.00040844607,0.00065188634,0.00068194687,0.00004939015,0.00006942699,0.00036245622,0.00005300761,0.22254437,0.6121095,0.15049143,0.012455833,0.00012236765],"about_ca_topic_score_codex":0.0003245033,"about_ca_topic_score_gemma":0.00029761606,"teacher_disagreement_score":0.0035439816,"about_ca_system_score_codex":0.0011990531,"about_ca_system_score_gemma":0.0010702019,"threshold_uncertainty_score":0.012406766},"labels":[],"label_agreement":null},{"id":"W4411113821","doi":"10.1038/s42003-025-08269-4","title":"Multilayer Integration of Networks Toolbox (MINT)","year":2025,"lang":"en","type":"article","venue":"Communications Biology","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; National Institutes of Health; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; Northern California Institute for Research and Education; Pfizer; Novartis Pharmaceuticals Corporation; University of Southern California; Biogen; Dartmouth College; Eli Lilly and Company; Bristol-Myers Squibb; BioClinica; U.S. Department of Defense; Alzheimer's Disease Neuroimaging Initiative; Meso Scale Diagnostics; National Institute on Aging; Alzheimer's Association","keywords":"Toolbox; Computer science; Programming language","score_opus":0.03334841716181329,"score_gpt":0.32474709200789065,"score_spread":0.29139867484607734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411113821","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065793516,0.00062594743,0.8368279,0.0003485795,0.00019142612,0.00020519405,0.01626448,0.13586381,0.0030932405],"genre_scores_gemma":[0.0738699,0.00111254,0.860085,0.0006136081,0.00011875364,0.0025118517,0.030999413,0.024824003,0.005864942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937147,0.0001920031,0.000054914362,0.00013624398,0.00017265414,0.000072755676],"domain_scores_gemma":[0.99842167,0.0009767585,0.0001463407,0.00018712263,0.00018969075,0.00007837641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019589989,0.0022089153,0.0011571104,0.0012717751,0.00054253417,0.0017249814,0.0023331726,0.0011274881,0.027975798],"category_scores_gemma":[0.007362459,0.0012032602,0.0022154346,0.00094215403,0.00044098884,0.0016782392,0.002407277,0.0024101553,0.008511247],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009254045,0.0003378405,0.009566751,0.0036639296,0.0020890322,0.0010855332,0.0008611319,0.26745853,0.013928524,0.049077388,0.26877466,0.38223127],"study_design_scores_gemma":[0.00016159004,0.00009495602,0.002244287,0.00016677163,0.00012950883,0.0003295981,0.000056295812,0.88094616,0.0054469127,0.050674014,0.05965947,0.00009047832],"about_ca_topic_score_codex":0.005534443,"about_ca_topic_score_gemma":0.009029051,"teacher_disagreement_score":0.027975798,"about_ca_system_score_codex":0.0006581117,"about_ca_system_score_gemma":0.001979502,"threshold_uncertainty_score":0.09358835},"labels":[],"label_agreement":null},{"id":"W4411391099","doi":"10.7155/jgaa.v29i1.3011","title":"Broadcast Schemes of Hypercubes","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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":"Concordia University","funders":"","keywords":"Hypercube; Computer science; Parallel computing","score_opus":0.008143199895198298,"score_gpt":0.2516604544261473,"score_spread":0.24351725453094902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411391099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28096887,0.0020631975,0.6830604,0.0006417232,0.00015739576,0.00035907407,0.00072197616,0.0007896952,0.031237643],"genre_scores_gemma":[0.8112097,0.0012251147,0.17697717,0.00017648173,0.00008791348,0.0003556668,0.0009242379,0.00016809454,0.008875617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.0005371788,0.00010567086,0.00014811527,0.00045128068,0.00025136553],"domain_scores_gemma":[0.9964779,0.001431407,0.00040591165,0.0008126032,0.0006966212,0.00017563775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929301,0.00026030777,0.0006097851,0.00092502875,0.0011881454,0.0018930472,0.0009803473,0.0006069029,0.002875634],"category_scores_gemma":[0.005881359,0.00038200957,0.00043407836,0.0013802365,0.0008238256,0.002904294,0.0014615936,0.0007035741,0.0005726047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007290321,0.00010178379,0.0018294798,0.00031489818,0.000060962077,0.00016141862,0.0009791818,0.12796688,0.022612046,0.69173104,0.0063463906,0.14716686],"study_design_scores_gemma":[0.0001775791,0.00025530273,0.00090315175,0.00009750746,0.000053825628,0.00027363628,0.00044074949,0.486257,0.017820837,0.4681975,0.025470722,0.000052233114],"about_ca_topic_score_codex":0.0012345267,"about_ca_topic_score_gemma":0.0014999543,"teacher_disagreement_score":0.002875634,"about_ca_system_score_codex":0.0012556835,"about_ca_system_score_gemma":0.0008340719,"threshold_uncertainty_score":0.009619951},"labels":[],"label_agreement":null},{"id":"W4412524219","doi":"10.31438/trf.hh2024.73","title":"INTEGRATION OF GRAPHENE-POLYMER HETEROSTRUCTURE MEMBRANES INTO A MULTI-USER MEMS FABRICATION PROCESS","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Institute for Health and Care Research; Manchester Biomedical Research Centre; CMC Microsystems","keywords":"Fabrication; Graphene; Microelectromechanical systems; Materials science; Membrane; Heterojunction; Polymer; Nanotechnology; Process (computing); Optoelectronics; Computer science; Composite material; Chemistry","score_opus":0.015164861498187979,"score_gpt":0.2706814329308315,"score_spread":0.25551657143264356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412524219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91103965,0.0021662377,0.07760759,0.00050178875,0.00028010682,0.00016285207,0.0005009585,0.0009830598,0.006757698],"genre_scores_gemma":[0.91439015,0.0006588802,0.08291082,0.00008511331,0.000036199657,0.00007485501,0.0001237304,0.000033828717,0.0016864759],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968517,0.000036861748,0.000017914886,0.00005090964,0.00017166772,0.000037454098],"domain_scores_gemma":[0.9997862,0.00005765611,0.000051606163,0.000050671035,0.000035357796,0.000018477293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027045337,0.00035770462,0.00019331009,0.00029622696,0.00029482975,0.00027974253,0.00041656697,0.00055313285,0.00080508104],"category_scores_gemma":[0.00038726785,0.000220256,0.00026548406,0.00023904328,0.00018679787,0.0004760814,0.0005428062,0.0005043167,0.00035743395],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000012655631,0.000009348423,0.00011980277,0.00003347499,0.0000061926285,0.00007088784,0.000015585796,0.00014394813,0.9958377,0.00027049772,0.00008037043,0.003399595],"study_design_scores_gemma":[0.0000029753267,0.00007075458,0.00077368575,0.0000031877885,0.0000069957036,0.00016414447,0.0000111184545,0.0014172604,0.99521846,0.000079251186,0.002243987,0.000008160015],"about_ca_topic_score_codex":0.00032727994,"about_ca_topic_score_gemma":0.0008534632,"teacher_disagreement_score":0.00080508104,"about_ca_system_score_codex":0.00029552713,"about_ca_system_score_gemma":0.00021666446,"threshold_uncertainty_score":0.0026932359},"labels":[],"label_agreement":null},{"id":"W4412533609","doi":"10.61091/jcmcc126-22","title":"Multidecomposition of hypercube graphs into paths, cycles and stars","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Stars; Computer science; Combinatorics; Mathematics; Parallel computing","score_opus":0.008895259087596917,"score_gpt":0.24989162598876793,"score_spread":0.24099636690117102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412533609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09139712,0.0005137856,0.8608427,0.00038451137,0.00015234553,0.00026625433,0.0014499397,0.00093314226,0.04406027],"genre_scores_gemma":[0.3463382,0.0008817633,0.6036274,0.00040390322,0.00015061718,0.0005105708,0.005676313,0.0008690223,0.041542195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913484,0.00022288361,0.000084680534,0.000232511,0.00023390392,0.00009122149],"domain_scores_gemma":[0.9986222,0.00041640768,0.00019451749,0.00023339537,0.0004166071,0.000116892006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739393,0.00080068456,0.000756873,0.001541135,0.0006759259,0.0021658104,0.00087805546,0.00055182894,0.018157186],"category_scores_gemma":[0.002556395,0.0008164498,0.0011148327,0.0025030868,0.00074697763,0.0029168855,0.0016911373,0.001324854,0.0043013296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046837144,0.00022058495,0.0022080268,0.0008195291,0.000121593235,0.00044716662,0.0008162278,0.09131325,0.009912734,0.5951162,0.02400189,0.27455443],"study_design_scores_gemma":[0.00007864528,0.00019520662,0.0011730238,0.00015103414,0.000057669848,0.00051545637,0.0005153875,0.2652361,0.009982828,0.68319744,0.038848437,0.00004876932],"about_ca_topic_score_codex":0.0014979986,"about_ca_topic_score_gemma":0.0021014651,"teacher_disagreement_score":0.018157186,"about_ca_system_score_codex":0.00069040334,"about_ca_system_score_gemma":0.00056744064,"threshold_uncertainty_score":0.06074184},"labels":[],"label_agreement":null},{"id":"W4412617749","doi":"10.55016/ojs/cdm.v12i1.62531","title":"Closing the Gap: Eternal Domination on 3 x n Grids","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closing (real estate); Combinatorics; Mathematics; Law; Political science","score_opus":0.027804162392918913,"score_gpt":0.3259153034617716,"score_spread":0.2981111410688527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34610954,0.0038361615,0.577414,0.004772143,0.0005655767,0.00007871377,0.0004307427,0.000655032,0.066138074],"genre_scores_gemma":[0.9422744,0.0019542978,0.04218876,0.0007640669,0.00026480292,0.00007695467,0.00023792898,0.00015738161,0.012081497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.00027905163,0.00003709422,0.00017316238,0.0001875046,0.000203161],"domain_scores_gemma":[0.9953047,0.003115919,0.000353475,0.00065597263,0.00030995085,0.0002600869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008738576,0.00042323567,0.000696023,0.00055854995,0.0010329324,0.0015487884,0.0012085319,0.00075347343,0.004664213],"category_scores_gemma":[0.0054950095,0.00025513847,0.0006148958,0.0009776871,0.0016286217,0.004051016,0.0023877306,0.0017552226,0.00043729504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006165947,0.00007715247,0.003391242,0.0003113332,0.00008268368,0.00059351244,0.00060783233,0.18996027,0.009511181,0.7104272,0.01298888,0.0714322],"study_design_scores_gemma":[0.00005409328,0.00007056386,0.0011810086,0.000053840995,0.00002706887,0.00044226288,0.00030408864,0.27455723,0.003852065,0.70098525,0.0184433,0.000029187568],"about_ca_topic_score_codex":0.0022555604,"about_ca_topic_score_gemma":0.00260581,"teacher_disagreement_score":0.004664213,"about_ca_system_score_codex":0.0010889336,"about_ca_system_score_gemma":0.0004654872,"threshold_uncertainty_score":0.0156033635},"labels":[],"label_agreement":null},{"id":"W4413277705","doi":"10.1109/tcomm.2025.3599900","title":"Fundamental Tradeoff Between Computation and Communication With Joint Coding and Interference Management in Wireless Distributed Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","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":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Coding (social sciences); Interference (communication); Computation; Joint (building); Computer network; Distributed computing; Telecommunications; Electronic engineering; Engineering; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.036934669478127326,"score_gpt":0.28132045936146954,"score_spread":0.24438578988334222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413277705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07414546,0.0014732245,0.9118731,0.0011876603,0.00006699969,0.00004638119,0.000031004565,0.00010884212,0.01106736],"genre_scores_gemma":[0.929397,0.00073194667,0.06830965,0.00013485014,0.00008663278,0.000084087405,0.000016935164,0.00003456935,0.0012043437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794585,0.0008186413,0.00006344659,0.00021962647,0.00066086894,0.00029166625],"domain_scores_gemma":[0.99481684,0.003882071,0.00029887748,0.0005740213,0.0003129576,0.00011523732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026318517,0.00075889163,0.0006316749,0.00044483112,0.00075580925,0.0018825575,0.0014715826,0.000934727,0.0010333045],"category_scores_gemma":[0.007414101,0.0003299979,0.0002749413,0.0009974061,0.0019969512,0.0038407284,0.0016685199,0.0013949755,0.00015809998],"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.00014404283,0.00009157903,0.0006397019,0.00023816875,0.000038692036,0.00014014871,0.00027373657,0.48699552,0.019905487,0.43573302,0.0009963136,0.0548036],"study_design_scores_gemma":[0.0000134833,0.00010942068,0.0001717836,0.000017708377,0.000014907412,0.00011625011,0.00008501253,0.89430505,0.0058377124,0.09787288,0.0014346892,0.000021223741],"about_ca_topic_score_codex":0.0006831149,"about_ca_topic_score_gemma":0.0011374555,"teacher_disagreement_score":0.0026318517,"about_ca_system_score_codex":0.0015744263,"about_ca_system_score_gemma":0.0013224089,"threshold_uncertainty_score":0.013918757},"labels":[],"label_agreement":null},{"id":"W4413278532","doi":"10.1109/icfpt64416.2024.11113444","title":"Multiqueue-Based FPGA Routing: Relaxed A* Priority Ordering for Improved Parallelism","year":2024,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Field-programmable gate array; Parallelism (grammar); Parallel computing; Routing (electronic design automation); Task parallelism; Computer architecture; Embedded system","score_opus":0.0208851046178999,"score_gpt":0.26990722269702005,"score_spread":0.24902211807912017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413278532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13079308,0.0005871746,0.85602367,0.00036125773,0.00014674789,0.00012537609,0.00011417713,0.0025509368,0.0092975795],"genre_scores_gemma":[0.49436095,0.00021984112,0.5001651,0.00016130072,0.00003843458,0.00008587999,0.00022377969,0.00025877974,0.004485961],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993988,0.00013822183,0.000060792117,0.00010230206,0.00017886978,0.000121044],"domain_scores_gemma":[0.99862623,0.00036694837,0.00012869423,0.0004903952,0.0002770128,0.00011067959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089705724,0.00038180425,0.0005128989,0.00058763596,0.00058418815,0.0013403223,0.0015454126,0.00041277174,0.003160566],"category_scores_gemma":[0.0021920977,0.00030682495,0.00033172456,0.00089246844,0.00041249127,0.0016980334,0.00090818113,0.0010040738,0.0005892026],"study_design_candidate":"bench_or_experimental","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.0012685758,0.00052564085,0.0026135775,0.00024536875,0.000048267655,0.00022554513,0.000363072,0.26061925,0.07291832,0.08864556,0.008354089,0.56417274],"study_design_scores_gemma":[0.00020972492,0.0003864271,0.0004932704,0.000026024865,0.000024409052,0.00012818382,0.00008498766,0.93694496,0.027042527,0.023417447,0.011201352,0.000040633462],"about_ca_topic_score_codex":0.0044822656,"about_ca_topic_score_gemma":0.010273377,"teacher_disagreement_score":0.0044822656,"about_ca_system_score_codex":0.0010259965,"about_ca_system_score_gemma":0.002083277,"threshold_uncertainty_score":0.010573149},"labels":[],"label_agreement":null},{"id":"W4413410893","doi":"10.1142/s0218863525300038","title":"Integration of microcombs with PCMs: Strategies, architectures, and performance","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear Optical Physics & Materials","topic":"Interconnection Networks and Systems","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":"Ministry of Education and Child Care","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Materials science; Computer science","score_opus":0.00908971806502971,"score_gpt":0.24367055085747383,"score_spread":0.23458083279244413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413410893","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3015511,0.54461426,0.09189058,0.0027300473,0.0010489691,0.00020014161,0.0004888447,0.0009728942,0.056503247],"genre_scores_gemma":[0.7667198,0.15837218,0.06404054,0.0006958519,0.0003603696,0.0002479443,0.000398703,0.00024061417,0.008923973],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974495,0.000025602678,0.00001707643,0.000049896767,0.00012018075,0.00004235661],"domain_scores_gemma":[0.9998197,0.000056818786,0.000040841638,0.000023094966,0.000041315307,0.000018232842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037672944,0.00050160894,0.0004319151,0.0006463215,0.00035564165,0.0010661752,0.00062573,0.0008143639,0.0017541784],"category_scores_gemma":[0.00060055614,0.0003604957,0.00045098335,0.00063198025,0.00045498527,0.0017814704,0.0008225102,0.0010344835,0.0006995311],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00020964796,0.00019726652,0.0013876887,0.0070346906,0.00011254796,0.000738386,0.0004165806,0.0068596127,0.6283007,0.09505679,0.0049568755,0.25472912],"study_design_scores_gemma":[0.000034477493,0.0007055982,0.0018893578,0.0004618104,0.00012097299,0.0013227488,0.0001943118,0.022366386,0.7513405,0.010854828,0.21061632,0.00009266744],"about_ca_topic_score_codex":0.00052678806,"about_ca_topic_score_gemma":0.0012136191,"teacher_disagreement_score":0.0017541784,"about_ca_system_score_codex":0.0006385971,"about_ca_system_score_gemma":0.00046931795,"threshold_uncertainty_score":0.005868256},"labels":[],"label_agreement":null},{"id":"W4413822863","doi":"10.1109/icccn65249.2025.11133867","title":"Attaining Loop-Free Routing with Coordinated Updates Carrying Minimum Link-State Information","year":2025,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Link (geometry); Routing (electronic design automation); Loop (graph theory); Computer science; State (computer science); State information; Computer network; Distributed computing; Mathematics; Algorithm","score_opus":0.00639178784785149,"score_gpt":0.21400480739117606,"score_spread":0.20761301954332456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413822863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024246106,0.00012277042,0.9703571,0.00008885901,0.000026719119,0.00004882938,0.000052403473,0.0013856178,0.0036716762],"genre_scores_gemma":[0.6325119,0.000245773,0.3630947,0.000119322714,0.00006074621,0.00016707924,0.0003516085,0.00021129538,0.0032376375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988568,0.0002424192,0.0000864262,0.00019908407,0.00044708475,0.00016817724],"domain_scores_gemma":[0.99758375,0.0008911463,0.00037787398,0.00063745776,0.00040480235,0.000104940016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011500343,0.00074994477,0.0009921886,0.0009921115,0.0006747671,0.001295781,0.0014030013,0.0006079774,0.0012173296],"category_scores_gemma":[0.0055109416,0.00033461401,0.00036859492,0.0009501486,0.0009871987,0.0019599865,0.0022212563,0.0009126141,0.00044567426],"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.00043793296,0.00016800787,0.00160937,0.00027134654,0.0001103484,0.0002508893,0.0004397428,0.54687625,0.025430964,0.20557286,0.005609908,0.21322231],"study_design_scores_gemma":[0.000055867968,0.00018848034,0.00022738929,0.000018805937,0.000037894093,0.00016748431,0.000053375617,0.9188341,0.010804849,0.06440468,0.00518277,0.000024399997],"about_ca_topic_score_codex":0.001274798,"about_ca_topic_score_gemma":0.0011638486,"teacher_disagreement_score":0.0014030013,"about_ca_system_score_codex":0.00055175717,"about_ca_system_score_gemma":0.0013265521,"threshold_uncertainty_score":0.0060819983},"labels":[],"label_agreement":null},{"id":"W4414008401","doi":"10.1109/tcomm.2025.3606647","title":"Knowledge Sharing-Enabled Semantic Rate Maximization for Multi-Cell Task-Oriented Hybrid Semantic-Bit Communication Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","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":"Western University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Maximization; Bit error rate; Computer network; Computer architecture; Distributed computing; Channel (broadcasting); Engineering; Mathematics","score_opus":0.035913565002770986,"score_gpt":0.290979862205952,"score_spread":0.255066297203181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029497623,0.00034781595,0.9664288,0.00017205795,0.000028087257,0.000039731123,0.00006330828,0.00015737933,0.0032651965],"genre_scores_gemma":[0.8996989,0.00031180755,0.097298585,0.00012577408,0.00003693335,0.00013241766,0.00011188521,0.000054635828,0.0022291585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00028864207,0.000039626924,0.00017346155,0.00021670062,0.00018718997],"domain_scores_gemma":[0.9987582,0.00065967714,0.0001881466,0.00010081611,0.00021809929,0.00007502242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447617,0.0011236367,0.0010235026,0.0006498063,0.0006886409,0.0013954911,0.0016349605,0.00096911745,0.0016301839],"category_scores_gemma":[0.003354182,0.0003335496,0.0004317023,0.0012433401,0.00086251897,0.0019830274,0.0018731545,0.00083602173,0.00030142453],"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.0001605239,0.00006227111,0.00030327064,0.000111046895,0.000030584266,0.00009219114,0.00013511602,0.9263888,0.004859392,0.025315747,0.0011709493,0.041370127],"study_design_scores_gemma":[0.000006298427,0.000032090607,0.000047809393,0.0000046373266,0.0000069335315,0.000025612913,0.000020241261,0.99131525,0.0009230393,0.0072923433,0.00031894044,0.000006697253],"about_ca_topic_score_codex":0.002265628,"about_ca_topic_score_gemma":0.0024645142,"teacher_disagreement_score":0.002265628,"about_ca_system_score_codex":0.0012668811,"about_ca_system_score_gemma":0.0013571299,"threshold_uncertainty_score":0.00919193},"labels":[],"label_agreement":null},{"id":"W4414405621","doi":"10.1109/iccworkshops67674.2025.11162328","title":"Partitioned Task Offloading for Low-Latency and Reliable Task Completion in 5G MEC","year":2025,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Cuckoo search; Task (project management); Server; Cloud computing; Integer programming; Cloud server; Task analysis","score_opus":0.010322307437470136,"score_gpt":0.2412227769008626,"score_spread":0.23090046946339246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414405621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4631046,0.0010786591,0.51735765,0.00048319562,0.0001478288,0.0002386035,0.00019899504,0.0013631316,0.0160273],"genre_scores_gemma":[0.9770586,0.00010822675,0.021048903,0.00007356636,0.000012232025,0.00006010734,0.00008103066,0.00005354405,0.0015036677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995332,0.00010731832,0.000018850415,0.00006930539,0.000085776825,0.0001856007],"domain_scores_gemma":[0.9994955,0.00019751958,0.00006225106,0.000073993244,0.00009781901,0.00007292504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035035706,0.00094692997,0.0005238301,0.00032312243,0.0006377107,0.0007055578,0.0007681293,0.00046101902,0.00246497],"category_scores_gemma":[0.0012654425,0.00020411614,0.0002960988,0.0004235388,0.00042128022,0.00088300765,0.0006981891,0.0004302057,0.00037060646],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006099412,0.00018070693,0.001434631,0.00024623037,0.000040125607,0.0005836257,0.00020549199,0.8913454,0.029958455,0.0050547123,0.0033319877,0.067008734],"study_design_scores_gemma":[0.000020761398,0.00015182536,0.00055924343,0.000013891182,0.000012474046,0.00009323382,0.00008287209,0.988993,0.0061599053,0.0025439898,0.0013566741,0.000012074912],"about_ca_topic_score_codex":0.005530164,"about_ca_topic_score_gemma":0.008552919,"teacher_disagreement_score":0.005530164,"about_ca_system_score_codex":0.0006545319,"about_ca_system_score_gemma":0.0010047441,"threshold_uncertainty_score":0.010995984},"labels":[],"label_agreement":null},{"id":"W4414561388","doi":"10.3390/mi16101096","title":"Reduction Method for a Network-on-Chip Low-Level Modeling","year":2025,"lang":"en","type":"article","venue":"Micromachines","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":"Alpha Technologies (Canada)","funders":"Russian Science Foundation","keywords":"Interface (matter); Component (thermodynamics); Network packet; Reduction (mathematics); Routing (electronic design automation); Connection (principal bundle); Network on a chip; Resource (disambiguation)","score_opus":0.030561706890026658,"score_gpt":0.30608985243405035,"score_spread":0.2755281455440237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414561388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017521371,0.000052277206,0.99533564,0.00003171892,0.000018222532,0.000022587565,0.000040598527,0.00027864415,0.002468215],"genre_scores_gemma":[0.13409631,0.00032289687,0.8544738,0.00008051763,0.00003542889,0.00028239493,0.00047086677,0.00039894122,0.009838859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966955,0.00007720177,0.000014338358,0.000039819577,0.00017751116,0.00002161176],"domain_scores_gemma":[0.9997789,0.000087805594,0.000013017325,0.000051082403,0.00006325033,0.0000058684145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003325916,0.000636217,0.00047889035,0.0006373176,0.0004631551,0.00066121074,0.0009182758,0.0004454674,0.0055018384],"category_scores_gemma":[0.0008204428,0.00033711395,0.0009860707,0.0003537887,0.00036084917,0.00069575146,0.00059381995,0.0010068815,0.0015789504],"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.00005220979,0.00006240595,0.00043044297,0.00033791916,0.000047028825,0.00017098208,0.00016095157,0.6897888,0.039429758,0.1391488,0.003265156,0.12710558],"study_design_scores_gemma":[0.0000057091097,0.000025253996,0.000083865634,0.000014213884,0.000016166472,0.000048495695,0.000011974428,0.96501166,0.005870946,0.014762339,0.014141299,0.000008049707],"about_ca_topic_score_codex":0.0023498924,"about_ca_topic_score_gemma":0.0024539137,"teacher_disagreement_score":0.0055018384,"about_ca_system_score_codex":0.00060546806,"about_ca_system_score_gemma":0.0007313573,"threshold_uncertainty_score":0.018405497},"labels":[],"label_agreement":null},{"id":"W4415029121","doi":"","title":"Decentralized Asynchronous Optimization with DADAO allows Decoupling and Acceleration","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Acceleration; Decoupling (probability); Asynchronous communication; Control theory (sociology); Minification; Context (archaeology)","score_opus":0.011003552251165234,"score_gpt":0.21916290793112922,"score_spread":0.208159355679964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415029121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024649847,0.00024395472,0.9512359,0.0004120481,0.00031281833,0.000050383052,0.00009933087,0.002247327,0.020748395],"genre_scores_gemma":[0.7590549,0.00020052915,0.22365712,0.0002691288,0.00019381146,0.00015000274,0.00019821597,0.00054879027,0.015727483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995883,0.00012262612,0.000018805289,0.00009151634,0.000110349894,0.00006838992],"domain_scores_gemma":[0.99930847,0.0002663628,0.00004073796,0.00020496144,0.00011087473,0.000068536916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073125906,0.0007499372,0.0008376202,0.00032405625,0.0004977206,0.0009960576,0.0008748681,0.000493264,0.008102429],"category_scores_gemma":[0.0020840543,0.0003680254,0.00045612935,0.00040049537,0.00053429167,0.0009279029,0.0012518079,0.0013296555,0.001347898],"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.0011493464,0.00037529564,0.0011663766,0.00036831925,0.00012075912,0.00021640379,0.0001370922,0.48315012,0.04250557,0.18899284,0.014138984,0.26767892],"study_design_scores_gemma":[0.00009070634,0.00007616011,0.00018900893,0.000009652154,0.000017373399,0.000037991602,0.000014815171,0.9503479,0.006797635,0.03745764,0.004949206,0.000011896176],"about_ca_topic_score_codex":0.0009451484,"about_ca_topic_score_gemma":0.0024286278,"teacher_disagreement_score":0.008102429,"about_ca_system_score_codex":0.00042244463,"about_ca_system_score_gemma":0.0009452267,"threshold_uncertainty_score":0.027105272},"labels":[],"label_agreement":null},{"id":"W4415104276","doi":"10.1145/3769005","title":"A High Efficient and Scalable Obstacle-Avoiding VLSI Global Routing Flow","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","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":"Advanced Micro Devices (Canada)","funders":"National Natural Science Foundation of China","keywords":"Scalability; Very-large-scale integration; Routing (electronic design automation); Benchmark (surveying); Steiner tree problem; Tree (set theory); Network topology; Obstacle","score_opus":0.012184330506875382,"score_gpt":0.23621870231564815,"score_spread":0.22403437180877278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415104276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037852395,0.0003649917,0.9536228,0.00013201359,0.000036974852,0.000092996976,0.00012967845,0.0022743838,0.005493707],"genre_scores_gemma":[0.31711727,0.00038717652,0.67659223,0.00010976876,0.000026153748,0.00017276921,0.0006879541,0.00022622303,0.004680435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998449,0.000019880219,0.0000092421715,0.000030594736,0.00006821848,0.000027093545],"domain_scores_gemma":[0.99982625,0.000044615357,0.000021934711,0.00004348764,0.000050551287,0.000013187481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020791184,0.00066182105,0.00048074976,0.0005606653,0.0003256944,0.00047577132,0.0007820957,0.00037215627,0.0019879616],"category_scores_gemma":[0.00051601866,0.00019470375,0.00041144763,0.00050196215,0.00024675575,0.0007954604,0.0007800834,0.00042812355,0.0004484571],"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.00010156106,0.00008092074,0.0010943498,0.00022664222,0.00003897864,0.00022009232,0.00011706061,0.40658525,0.06424259,0.021478876,0.0084834425,0.49733028],"study_design_scores_gemma":[0.000049443453,0.00024620953,0.00046065208,0.000021806185,0.000036763515,0.00018972946,0.000038336802,0.95611924,0.018618582,0.010991611,0.013206239,0.000021234926],"about_ca_topic_score_codex":0.0010747664,"about_ca_topic_score_gemma":0.002092875,"teacher_disagreement_score":0.0019879616,"about_ca_system_score_codex":0.0002563391,"about_ca_system_score_gemma":0.00088867027,"threshold_uncertainty_score":0.0066503882},"labels":[],"label_agreement":null},{"id":"W4415125084","doi":"10.1109/tcomm.2025.3621094","title":"RIS With Coupled Phase Shift and Amplitude: Capacity Maximization and Configuration Set Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Reflection (computer programming); Maximization; Amplitude; Reflection coefficient; Phase (matter); Set (abstract data type); Continuous phase modulation; Surface (topology)","score_opus":0.03237185869466722,"score_gpt":0.28570488005841255,"score_spread":0.2533330213637453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415125084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046503924,0.0003560518,0.93513936,0.00034433787,0.000032275653,0.00009239739,0.000120329416,0.0005090908,0.01690228],"genre_scores_gemma":[0.82875603,0.0003343199,0.16260643,0.00017162708,0.00004985006,0.0002369676,0.00017844248,0.00023877923,0.0074274573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.00047279103,0.000031646672,0.00016536757,0.00022618679,0.0001902146],"domain_scores_gemma":[0.99836713,0.0010662554,0.00013982355,0.00018316708,0.00014924277,0.00009434031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702386,0.0014021324,0.0011903567,0.00082865654,0.0004402916,0.0011136094,0.0014128623,0.0009390174,0.00447186],"category_scores_gemma":[0.0032632218,0.00073683495,0.0007270607,0.0011643188,0.0013153603,0.0015342947,0.0016565174,0.0012264561,0.00074353104],"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.00006982356,0.000043845823,0.00017653377,0.000076352895,0.000028045275,0.00010149419,0.00003512215,0.9476076,0.0049651265,0.02782533,0.0015982536,0.017472379],"study_design_scores_gemma":[0.0000072456337,0.000027275328,0.000039254643,0.000006260499,0.000006696555,0.000028170325,0.000012164185,0.98733807,0.0013530619,0.010790508,0.00038354358,0.000007779245],"about_ca_topic_score_codex":0.0013265932,"about_ca_topic_score_gemma":0.0016258307,"teacher_disagreement_score":0.00447186,"about_ca_system_score_codex":0.0011627161,"about_ca_system_score_gemma":0.0009623569,"threshold_uncertainty_score":0.014959872},"labels":[],"label_agreement":null},{"id":"W4415525834","doi":"10.61091/jcmcc128-02","title":"Decomposing hypercubes into cycles: An approach to the oberwolfach problem","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Interconnection; Variety (cybernetics); Fault tolerance; Permutation (music)","score_opus":0.01720986096588445,"score_gpt":0.2685308993420815,"score_spread":0.25132103837619707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091384865,0.00089291146,0.8764094,0.0018275598,0.00009871059,0.00044842396,0.0005582624,0.00032935425,0.028050538],"genre_scores_gemma":[0.2956625,0.001424197,0.6748454,0.00059872994,0.00016007357,0.0004689515,0.0016836036,0.00020321447,0.024953289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906737,0.0003307265,0.000048406826,0.00021376128,0.00016744602,0.00017239433],"domain_scores_gemma":[0.9986199,0.0006766398,0.00013641808,0.00027564992,0.0001664767,0.00012497242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010183898,0.00074734824,0.0007841363,0.0011747584,0.001311087,0.0016224827,0.0011861303,0.0011557505,0.007939425],"category_scores_gemma":[0.0034348397,0.00056349376,0.0009985594,0.0019714434,0.0015221324,0.0041111456,0.0022803207,0.0017977204,0.0009009131],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016444744,0.00017356526,0.0014543325,0.00034271678,0.000050115577,0.0003288787,0.00054447696,0.16009182,0.0036010733,0.648388,0.011642336,0.1732182],"study_design_scores_gemma":[0.000044043798,0.00007007344,0.00029180065,0.00006931455,0.00002287622,0.00020717729,0.00042101182,0.2965887,0.0027048253,0.677045,0.02250387,0.000031346583],"about_ca_topic_score_codex":0.0055685174,"about_ca_topic_score_gemma":0.007440072,"teacher_disagreement_score":0.007939425,"about_ca_system_score_codex":0.0014030468,"about_ca_system_score_gemma":0.0016868839,"threshold_uncertainty_score":0.026560009},"labels":[],"label_agreement":null},{"id":"W4416233715","doi":"10.1109/camad67323.2025.11229891","title":"Virtual Network Embedding on Interconnection Networks","year":2025,"lang":"","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Network topology; Interconnection; Embedding; Hypercube; Network virtualization; Topology (electrical circuits); Logical topology; Virtual network","score_opus":0.012262849100152736,"score_gpt":0.26558162557577486,"score_spread":0.2533187764756221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416233715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18790399,0.0037289711,0.77652097,0.00065500115,0.00022677633,0.00008867435,0.00010298106,0.00031233695,0.030460289],"genre_scores_gemma":[0.92504776,0.0029274486,0.06641609,0.00009677935,0.00012711219,0.0000613179,0.0001072319,0.00010142911,0.0051148525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890995,0.0005730348,0.000032810905,0.000095301184,0.00027208964,0.00011678193],"domain_scores_gemma":[0.997033,0.0020021873,0.00024552803,0.00023179517,0.00040907782,0.000078305035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086243317,0.00068172085,0.00042668756,0.0004930059,0.00037784316,0.0012339014,0.0005537141,0.00046241574,0.0022511124],"category_scores_gemma":[0.006601907,0.0002037053,0.00020516566,0.00091510575,0.0007900647,0.0028481607,0.0010125359,0.0005201252,0.00030530876],"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.00008141456,0.000041611882,0.00051596196,0.00012570506,0.000024125153,0.00011329528,0.000043319716,0.8482319,0.0030196316,0.10065106,0.0011932298,0.045958746],"study_design_scores_gemma":[0.0000042147954,0.00006483119,0.0001790417,0.000019328576,0.000008667023,0.000075439384,0.000027078624,0.9581641,0.0013900074,0.03690679,0.003153807,0.0000067006144],"about_ca_topic_score_codex":0.0008594016,"about_ca_topic_score_gemma":0.000597738,"teacher_disagreement_score":0.0022511124,"about_ca_system_score_codex":0.0007791618,"about_ca_system_score_gemma":0.000372475,"threshold_uncertainty_score":0.007530749},"labels":[],"label_agreement":null},{"id":"W4416513626","doi":"10.1109/lca.2025.3630669","title":"A Performance Model for Disintegrated Manycores","year":2025,"lang":"","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interconnection; Focus (optics); Yield (engineering); Data modeling; Context model; Integrated circuit packaging; Work (physics); Key (lock); Semiconductor device modeling","score_opus":0.013554097472716624,"score_gpt":0.23434494159957,"score_spread":0.22079084412685338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15963838,0.0025464178,0.74226475,0.002763757,0.00023419817,0.00024496307,0.0011472986,0.002294738,0.088865496],"genre_scores_gemma":[0.91921157,0.0012861823,0.032812264,0.000634941,0.00010669131,0.0003556021,0.0005992731,0.0006075248,0.044385966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00013238528,0.000029059227,0.00013248985,0.00029756676,0.00021673519],"domain_scores_gemma":[0.99883837,0.0003637168,0.0001287826,0.00014516027,0.000444068,0.00007990347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008322991,0.0011643964,0.0007404502,0.00094199565,0.0007220274,0.0013564439,0.0029333837,0.001865442,0.009165001],"category_scores_gemma":[0.0028751434,0.000534859,0.00073157623,0.00074985117,0.0009822779,0.0030678923,0.0011032966,0.0016000529,0.0027246093],"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.000057493096,0.000035228717,0.00031609205,0.000052891126,0.00001442646,0.00012261767,0.00007813135,0.93345094,0.0032298616,0.05505644,0.0022791033,0.0053068143],"study_design_scores_gemma":[0.0000052105765,0.000019767209,0.0000849487,0.000006075072,0.0000049261753,0.00003012197,0.000008834931,0.99235207,0.00037290232,0.0059567215,0.0011533702,0.0000051680654],"about_ca_topic_score_codex":0.010880779,"about_ca_topic_score_gemma":0.0048538116,"teacher_disagreement_score":0.010880779,"about_ca_system_score_codex":0.0024024313,"about_ca_system_score_gemma":0.0012832211,"threshold_uncertainty_score":0.030659914},"labels":[],"label_agreement":null},{"id":"W4416982622","doi":"10.23977/acss.2025.090402","title":"Throughput-Optimized Processor Microarchitecture: Coordinating Core, NoC, and Memory Subsystems","year":2025,"lang":"","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Throughput; Microarchitecture; Multi-core processor; Reduction (mathematics); Resource (disambiguation); Systems design; Execution model; Scalability","score_opus":0.015999519446741352,"score_gpt":0.276995215841028,"score_spread":0.26099569639428666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416982622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3552791,0.0033474683,0.6233632,0.00076603016,0.000092990726,0.00008164732,0.00020008528,0.001305254,0.015564182],"genre_scores_gemma":[0.94900435,0.0005682503,0.04827087,0.00009778429,0.00003102572,0.00005414394,0.00009120732,0.00009991738,0.0017824859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996697,0.00007831835,0.000013399214,0.000053198986,0.00010468636,0.00008080005],"domain_scores_gemma":[0.99964845,0.000090752656,0.00008206306,0.000058219674,0.00009615458,0.00002434693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053389353,0.00048291555,0.00029058772,0.00030280475,0.00025346768,0.0007702649,0.0006702726,0.00027474161,0.000759562],"category_scores_gemma":[0.0009181271,0.00023969555,0.00020475002,0.00035850346,0.00044594196,0.0009113476,0.00035249488,0.00039778603,0.00019673712],"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.00023655967,0.000078267534,0.0033642661,0.00016582516,0.00007615813,0.00014435552,0.00009983113,0.8433912,0.0645621,0.023339367,0.0021996072,0.06234258],"study_design_scores_gemma":[0.00001762447,0.00016293606,0.0017598824,0.000015904017,0.00004706178,0.00006539654,0.0000452584,0.96755254,0.017840609,0.009462015,0.0030173175,0.000013335277],"about_ca_topic_score_codex":0.001500002,"about_ca_topic_score_gemma":0.0028579875,"teacher_disagreement_score":0.001500002,"about_ca_system_score_codex":0.001029137,"about_ca_system_score_gemma":0.0011289207,"threshold_uncertainty_score":0.0074669123},"labels":[],"label_agreement":null},{"id":"W4417256187","doi":"10.21105/joss.09136","title":"MatrixBandwidth.jl: Fast algorithms for matrix bandwidth minimization and recognition","year":2025,"lang":"en","type":"article","venue":"The Journal of Open Source Software","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":"Mount Allison University","funders":"","keywords":"Minification; Bandwidth (computing); Matrix (chemical analysis); Sparse matrix; Band matrix; Matrix algebra","score_opus":0.026740464216248736,"score_gpt":0.30474850774774015,"score_spread":0.2780080435314914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417256187","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010249659,0.0006534784,0.9717057,0.00025168815,0.00015181596,0.000075831675,0.0005563518,0.022024877,0.003555195],"genre_scores_gemma":[0.032625984,0.0006133167,0.9484704,0.00046124327,0.00018124544,0.00046328836,0.0025164408,0.0065616653,0.008106482],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979001,0.00036871736,0.00018344283,0.00039717442,0.0009222049,0.00022841328],"domain_scores_gemma":[0.9963625,0.0017221895,0.0002872868,0.00089591404,0.0006047034,0.00012741188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019257473,0.0038020008,0.0017546695,0.0026212577,0.0011504879,0.0036901592,0.0039699934,0.0027686264,0.035134427],"category_scores_gemma":[0.012518815,0.0016856464,0.0021289517,0.0027305344,0.001446363,0.0064666136,0.0046463646,0.004558078,0.03174677],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048786445,0.00019914533,0.00087062817,0.00073035347,0.00011475962,0.00017594872,0.00040264905,0.035064775,0.010123489,0.101653,0.14834845,0.70182884],"study_design_scores_gemma":[0.0003293926,0.00012253749,0.0003620725,0.0002327425,0.000044267315,0.0004096227,0.0001449161,0.57118917,0.016531758,0.29825488,0.112256676,0.000122029836],"about_ca_topic_score_codex":0.0033029655,"about_ca_topic_score_gemma":0.0063654045,"teacher_disagreement_score":0.035134427,"about_ca_system_score_codex":0.0014516292,"about_ca_system_score_gemma":0.001911186,"threshold_uncertainty_score":0.117536366},"labels":[],"label_agreement":null},{"id":"W51026761","doi":"10.1007/978-3-642-45278-9_18","title":"Tight Bound on the Diameter of the Knödel Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Graph; Upper and lower bounds; Constructive; Physics; Mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.01807556455322648,"score_gpt":0.21454776107792875,"score_spread":0.19647219652470227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W51026761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14040291,0.022174522,0.5832965,0.021425892,0.002543074,0.00032902468,0.0067520137,0.0049089445,0.21816722],"genre_scores_gemma":[0.7469061,0.015864333,0.16441283,0.004626314,0.004257782,0.00091023365,0.005760479,0.0033265115,0.053935397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965372,0.0006944365,0.00010717722,0.0009762734,0.00092247664,0.0007625213],"domain_scores_gemma":[0.97032446,0.021712305,0.0010373249,0.0030697014,0.0015762751,0.002280023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099514,0.0035178664,0.0043299063,0.0030540673,0.0029981064,0.0069317454,0.0069096014,0.0031988642,0.0185394],"category_scores_gemma":[0.024442213,0.0024501313,0.0019240798,0.0036626766,0.0032800497,0.011678262,0.006683373,0.008632895,0.005180187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019519725,0.00045823434,0.003166618,0.0018335371,0.00028706848,0.0005315566,0.0010569334,0.13977227,0.026527517,0.64223206,0.096712254,0.08547001],"study_design_scores_gemma":[0.00012950963,0.0001984808,0.0015424876,0.00028519062,0.00019721003,0.0005502304,0.00025204674,0.20043457,0.0052091866,0.76438326,0.026721003,0.00009690993],"about_ca_topic_score_codex":0.0030431137,"about_ca_topic_score_gemma":0.0049358117,"teacher_disagreement_score":0.0185394,"about_ca_system_score_codex":0.005160088,"about_ca_system_score_gemma":0.0021592837,"threshold_uncertainty_score":0.06202048},"labels":[],"label_agreement":null},{"id":"W58556464","doi":"10.46298/dmtcs.322","title":"On Locating-Dominating Codes in Binary Hamming Spaces","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Hypercube; Hamming code; Computer science; Hamming(7,4); Hamming distance; Multiprocessing; Binary number; Hamming graph; Hamming space; Parallel computing; Theoretical computer science; Mathematics; Block code; Arithmetic; Algorithm; Decoding methods","score_opus":0.011940022561228078,"score_gpt":0.25787279695283344,"score_spread":0.24593277439160535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58556464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28651547,0.001533155,0.68969584,0.0007965676,0.0002371978,0.000084656785,0.0001794813,0.00016910871,0.020788506],"genre_scores_gemma":[0.8652574,0.0021918584,0.12047596,0.00030692742,0.0003211205,0.00015842254,0.00024669553,0.000099646066,0.01094205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989421,0.00034351353,0.00007125185,0.00014390195,0.00030713523,0.00019223036],"domain_scores_gemma":[0.99369437,0.0040627834,0.0006190005,0.00050686445,0.0007955806,0.00032132075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010591313,0.0008303821,0.00049860217,0.0018875971,0.0011163333,0.001288161,0.0008629836,0.0012155251,0.001540958],"category_scores_gemma":[0.007926324,0.00032634274,0.0004336065,0.0022346824,0.0027232803,0.0028838878,0.0022285478,0.0014639663,0.00043207343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010247026,0.000026353156,0.0006118035,0.00009771106,0.000009346013,0.00024224252,0.0005282741,0.05052221,0.0036502937,0.91925275,0.001111167,0.02384534],"study_design_scores_gemma":[0.000027488859,0.000115441195,0.00027714804,0.00006244064,0.0000124729995,0.0003579779,0.0002372957,0.14922428,0.003977756,0.84118813,0.0044762054,0.000043458014],"about_ca_topic_score_codex":0.0010489938,"about_ca_topic_score_gemma":0.00088096753,"teacher_disagreement_score":0.0018875971,"about_ca_system_score_codex":0.0009894359,"about_ca_system_score_gemma":0.0006006769,"threshold_uncertainty_score":0.0071789026},"labels":[],"label_agreement":null},{"id":"W627349762","doi":"","title":"Network-on Chip Micro-Benchmarks","year":2008,"lang":"hu","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network on a chip; Workload; Computer architecture; Set (abstract data type); Embedded system; Chip; Architecture; Operating system; Programming language; Telecommunications","score_opus":0.029601559159328085,"score_gpt":0.22593328898024423,"score_spread":0.19633172982091615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W627349762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4180707,0.011880852,0.23348267,0.0017513023,0.00087851466,0.0035856327,0.038314793,0.010000522,0.28203502],"genre_scores_gemma":[0.7951361,0.004721507,0.12925586,0.0003916309,0.00006889378,0.00215707,0.030662622,0.00095004035,0.03665627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986765,0.00029018533,0.00009824434,0.00010183132,0.0006727081,0.00016050227],"domain_scores_gemma":[0.997454,0.00070486736,0.00013462102,0.00026282915,0.0013392066,0.00010443321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011583593,0.0007767888,0.0003063342,0.0008545886,0.00049182685,0.00066963123,0.0011765867,0.00033916917,0.006777897],"category_scores_gemma":[0.00320575,0.00013583827,0.00017005327,0.0024279717,0.00024384331,0.00045383547,0.0003505973,0.00040539712,0.0012647194],"study_design_candidate":"bench_or_experimental","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.0010244832,0.00068756286,0.008690778,0.0027159788,0.0001353614,0.00034760253,0.00015305234,0.4188505,0.043781605,0.045316584,0.1722331,0.30606335],"study_design_scores_gemma":[0.00019886477,0.0009672948,0.009497701,0.00031390422,0.00010398154,0.00034439197,0.0002724388,0.65897954,0.12804121,0.013794161,0.18740733,0.00007912686],"about_ca_topic_score_codex":0.020972336,"about_ca_topic_score_gemma":0.035349064,"teacher_disagreement_score":0.020972336,"about_ca_system_score_codex":0.0020932865,"about_ca_system_score_gemma":0.0016074704,"threshold_uncertainty_score":0.041700542},"labels":[],"label_agreement":null},{"id":"W6929089696","doi":"10.4230/lipics.isaac.2024.15","title":"On the Spanning and Routing Ratios of the Yao-Four Graph","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"Carleton University","funders":"","keywords":"Euclidean distance; Distance; Vertex (graph theory); Path graph; Spanner; Graph; Butterfly graph; Line graph; Euclidean geometry","score_opus":0.018773751488630048,"score_gpt":0.23073189276381517,"score_spread":0.2119581412751851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929089696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6071663,0.0070355744,0.3021852,0.0036625348,0.0002838392,0.00020148954,0.0011734196,0.0017083529,0.07658333],"genre_scores_gemma":[0.91048276,0.0022621069,0.07983772,0.00047776723,0.0002543685,0.00022431291,0.00082926877,0.00053245947,0.0050991834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974821,0.00091880164,0.00008463049,0.0004887629,0.0005543578,0.00047132382],"domain_scores_gemma":[0.9790467,0.015835421,0.0016266573,0.0016068692,0.0011349457,0.0007495354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032780922,0.0014646448,0.00096225704,0.003236377,0.0010971392,0.0024862825,0.0023201539,0.0012179246,0.0069867275],"category_scores_gemma":[0.0323489,0.0006454591,0.000815373,0.0023113615,0.0023406278,0.0059322217,0.0023467178,0.0026009926,0.0015458158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018175412,0.00029393286,0.006673081,0.00041947069,0.00014941618,0.0003503038,0.0006084671,0.23583819,0.015646428,0.544964,0.018444875,0.17479436],"study_design_scores_gemma":[0.00014033925,0.0004019049,0.0033134078,0.00013218969,0.00016279345,0.0007631187,0.00030642597,0.5692418,0.010656281,0.4057696,0.0090091955,0.00010286257],"about_ca_topic_score_codex":0.001953826,"about_ca_topic_score_gemma":0.0014084332,"teacher_disagreement_score":0.0069867275,"about_ca_system_score_codex":0.002388311,"about_ca_system_score_gemma":0.0011999987,"threshold_uncertainty_score":0.023372948},"labels":[],"label_agreement":null},{"id":"W6930849482","doi":"10.5281/zenodo.15045415","title":"pymc-devs/pytensor: rel-2.29.0","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Université de Montréal","funders":"","keywords":"Speedup; Broadcasting (networking); Argument (complex analysis); Process (computing); Transpose","score_opus":0.023902409759408234,"score_gpt":0.23274142975667667,"score_spread":0.20883901999726842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930849482","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004843163,0.00015096633,0.041211262,0.00026237106,0.00038153143,0.00010346516,0.015817199,0.918321,0.023267899],"genre_scores_gemma":[0.0071497317,0.00021099816,0.01977676,0.00065068377,0.000113715374,0.00035659477,0.034720782,0.88889277,0.048128042],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814856,0.00019347876,0.00013512354,0.00045405485,0.0007174096,0.00035140786],"domain_scores_gemma":[0.99517715,0.00091220863,0.00017997896,0.0018673962,0.0014211205,0.00044209888],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022578042,0.0046058693,0.0020605125,0.0017437123,0.0015050748,0.004781624,0.0076307515,0.0028167404,0.48265618],"category_scores_gemma":[0.011884146,0.0044902368,0.0031576857,0.0013192369,0.0012141324,0.0077627916,0.0061844466,0.0065083224,0.60146654],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00034530734,0.000051347142,0.00063554157,0.0004300404,0.000041374627,0.00012037483,0.00019441832,0.0005171037,0.0028645666,0.004001661,0.95816195,0.03263644],"study_design_scores_gemma":[0.00021047107,0.000038609553,0.0010969554,0.00023277458,0.00004048165,0.00027146944,0.00009022926,0.003497831,0.0210974,0.0055598104,0.9677069,0.00015714411],"about_ca_topic_score_codex":0.0065912176,"about_ca_topic_score_gemma":0.0040987614,"teacher_disagreement_score":0.48265618,"about_ca_system_score_codex":0.0023429862,"about_ca_system_score_gemma":0.0023040627,"threshold_uncertainty_score":0.73792815},"labels":[],"label_agreement":null},{"id":"W6930866297","doi":"10.5281/zenodo.12278324","title":"le quotidien pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sister; Gens; Newspaper; Order (exchange)","score_opus":0.03296839550204324,"score_gpt":0.23159742225619437,"score_spread":0.19862902675415112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930866297","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002199582,0.00043374902,0.0007012759,0.0010684694,0.0031667894,0.0001407142,0.002590141,0.0027669345,0.988912],"genre_scores_gemma":[0.00079503155,0.00026615217,0.0003089846,0.0005889226,0.0003693506,0.000035054018,0.00091079774,0.001105712,0.99561995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992113,0.000055081884,0.00003348014,0.000096629876,0.0005030556,0.00010043701],"domain_scores_gemma":[0.99716645,0.00036518264,0.00008189045,0.00036961434,0.0015183126,0.0004984809],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006159915,0.0010933012,0.0009772922,0.0018519969,0.00224692,0.00852743,0.0016648726,0.0022650666,0.93946534],"category_scores_gemma":[0.0049719503,0.000711978,0.00082412554,0.0016930351,0.00060290867,0.005483322,0.002578167,0.0031068232,0.90556794],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000019845018,0.000017719283,0.000026169031,0.00008087834,0.0000011693378,0.000033297565,0.00002535185,0.000021678507,0.0001942657,0.0011137578,0.9738938,0.024572223],"study_design_scores_gemma":[0.000005439084,0.00000857895,0.00008990658,0.000033815017,0.0000010151526,0.00004574373,0.000038396076,0.000020697453,0.00011354986,0.00026353565,0.99937433,0.0000050302774],"about_ca_topic_score_codex":0.0035444568,"about_ca_topic_score_gemma":0.008876514,"teacher_disagreement_score":0.060534656,"about_ca_system_score_codex":0.0015520103,"about_ca_system_score_gemma":0.0013032567,"threshold_uncertainty_score":0.086345315},"labels":[],"label_agreement":null},{"id":"W6931327791","doi":"10.5281/zenodo.7130677","title":"Uproot","year":2017,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Institute of Particle Physics","funders":"","keywords":"Python (programming language); Drop (telecommunication); Context (archaeology)","score_opus":0.036586601190061366,"score_gpt":0.24823792967806582,"score_spread":0.21165132848800444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931327791","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079482334,0.00026080201,0.04253519,0.0007918511,0.00083944434,0.00018730856,0.060399298,0.7881975,0.10599383],"genre_scores_gemma":[0.009690663,0.00044524425,0.038004857,0.0015695976,0.00029126837,0.0004125483,0.15710655,0.607105,0.18537433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976694,0.00024684262,0.000150986,0.00064005534,0.0009771106,0.00031547755],"domain_scores_gemma":[0.9949961,0.0006942174,0.00021091441,0.0021309038,0.0014917334,0.0004762703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023004124,0.002799095,0.0014375814,0.0027914443,0.0020817085,0.0058929096,0.0045394185,0.0024462594,0.5073207],"category_scores_gemma":[0.0105418805,0.0022411284,0.0022013318,0.0020779576,0.00095171964,0.0078018564,0.006588498,0.0045756316,0.62438554],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00010164511,0.000042403193,0.00041891745,0.00029643715,0.000020782412,0.00004801105,0.00011022871,0.00024591846,0.00080806756,0.005033651,0.9577825,0.035091437],"study_design_scores_gemma":[0.00004469378,0.000010762287,0.00045486423,0.00007111712,0.000012244391,0.00008420018,0.000040345785,0.0008783195,0.002149638,0.006378513,0.98983943,0.000035805013],"about_ca_topic_score_codex":0.003912342,"about_ca_topic_score_gemma":0.0055739037,"teacher_disagreement_score":0.5073207,"about_ca_system_score_codex":0.0016873796,"about_ca_system_score_gemma":0.002274074,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6931544040","doi":"10.5683/sp3/dgu5eq","title":"Enquête sur la population active, décembre 2014 [Canada] [Remanié 2025]","year":2023,"lang":"fr","type":"dataset","venue":"Borealis","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":true,"ca_institutions":"Statistics Canada","funders":"","keywords":"Population; Research methodology; Publics; Social interest","score_opus":0.023264415184353883,"score_gpt":0.25278587021125765,"score_spread":0.22952145502690377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931544040","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01277365,0.0053777867,0.0013011273,0.003951456,0.0005572353,0.00020116201,0.9489001,0.0003314002,0.026606148],"genre_scores_gemma":[0.110841945,0.014143881,0.005106123,0.0034410136,0.00030354143,0.000798673,0.7978045,0.00022403928,0.06733621],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981834,0.000107899905,0.00013857872,0.00022959999,0.0009934619,0.0003469608],"domain_scores_gemma":[0.99197805,0.00018790855,0.0002422736,0.000106031126,0.0069374465,0.0005482288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001980991,0.0008143426,0.0007403797,0.004338689,0.0019017544,0.002469343,0.0017454255,0.0005983684,0.010595279],"category_scores_gemma":[0.0065011275,0.0004482528,0.00094508176,0.011111938,0.00040771242,0.000722046,0.0012315924,0.0014797526,0.0025831428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019474117,0.000029704666,0.08555925,0.0013627623,0.00029378495,0.00008615699,0.0007425412,0.0015501804,0.00021089723,0.0032544348,0.8581342,0.048581313],"study_design_scores_gemma":[0.000079797624,0.00004085291,0.486183,0.0010073723,0.00019129114,0.000057458976,0.0014496039,0.0012446953,0.00040409106,0.00038989205,0.50886375,0.00008819046],"about_ca_topic_score_codex":0.9967629,"about_ca_topic_score_gemma":0.9960782,"teacher_disagreement_score":0.038338616,"about_ca_system_score_codex":0.038338616,"about_ca_system_score_gemma":0.07670418,"threshold_uncertainty_score":0.27816743},"labels":[],"label_agreement":null},{"id":"W6976401572","doi":"10.60692/jbyyd-spd49","title":"A dark siren measurement of the Hubble constant using gravitational wave events from the first three LIGO/Virgo observing runs and DELVE","year":2024,"lang":"en","type":"article","venue":"Greater South Information System","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 Toronto","funders":"","keywords":"Dark energy; Redshift; Galaxy; Gravitational wave; Hubble's law; Dark matter; COSMIC cancer database","score_opus":0.07240073792872416,"score_gpt":0.21194959816936643,"score_spread":0.13954886024064228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976401572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98964524,0.00006167754,0.0026677654,0.00003986849,0.000009419815,0.000012137086,0.0034171452,0.00016904282,0.0039777844],"genre_scores_gemma":[0.98942834,0.00002057367,0.0031740228,0.0000259336,0.0000134002385,0.000010346611,0.0066856313,0.000035075045,0.00060669874],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99969375,0.00004978408,0.000009971593,0.00010665884,0.0000766211,0.00006321112],"domain_scores_gemma":[0.9993542,0.00011966132,0.0001755802,0.00012573953,0.00008509147,0.00013977263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006309689,0.00032506,0.00020353193,0.0014936627,0.00020149232,0.0006000929,0.00029413574,0.00018303224,0.0012201559],"category_scores_gemma":[0.0009029516,0.00019008156,0.00021115488,0.00073995924,0.00018818604,0.00025115494,0.0008701021,0.00031044736,0.00029020954],"study_design_candidate":"observational","study_design_consensus":"observational","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.0006458619,0.000119777884,0.9458583,0.00004072518,0.00021258359,0.00018134403,0.00019044787,0.0039348793,0.015042596,0.0012695635,0.0022988801,0.03020509],"study_design_scores_gemma":[0.000029404899,0.000056684614,0.9767492,0.000011040084,0.00004099406,0.00010442435,0.000079768295,0.012882714,0.005399149,0.0003445412,0.0042771883,0.000024917183],"about_ca_topic_score_codex":0.00740931,"about_ca_topic_score_gemma":0.021915164,"teacher_disagreement_score":0.00740931,"about_ca_system_score_codex":0.00036435344,"about_ca_system_score_gemma":0.00012697969,"threshold_uncertainty_score":0.014732361},"labels":[],"label_agreement":null},{"id":"W7011663542","doi":"","title":"Modeling and evaluation of a hierarchical ring interconnect for system-on-chip multiprocessing","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiprocessing; SystemC; FIFO (computing and electronics); Interconnection; Key (lock); Scheme (mathematics); Deadlock; Software; Logic synthesis","score_opus":0.03777680280243921,"score_gpt":0.2854928699155054,"score_spread":0.24771606711306615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011663542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53634065,0.0010496653,0.41367796,0.00058656954,0.000096481745,0.00031327744,0.0005499847,0.0018800356,0.045505274],"genre_scores_gemma":[0.9634611,0.00024271093,0.02734391,0.00003135602,0.000008737723,0.00008479094,0.00010752971,0.00006682277,0.008653058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998386,0.000045521265,0.000005265676,0.000026583331,0.000052868276,0.000031124233],"domain_scores_gemma":[0.99973863,0.00010099364,0.000040288593,0.000027058752,0.00007582752,0.000017198965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038020717,0.00038638705,0.0003172631,0.00034919768,0.0003558331,0.000787693,0.0008906946,0.0007839361,0.0035591456],"category_scores_gemma":[0.0008707287,0.00025221173,0.00041594575,0.00028229557,0.00030855037,0.00059591036,0.000295855,0.00027245318,0.0005056421],"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.000026498567,0.000017755076,0.000590491,0.000026456068,0.000006373991,0.000041915926,0.000019594536,0.9917041,0.0033442026,0.0013487353,0.00017817046,0.0026956333],"study_design_scores_gemma":[0.000002062863,0.000033492335,0.00017185936,0.0000024764722,0.0000045070474,0.000006425238,0.000005786082,0.99860066,0.0007305764,0.00013977369,0.00030074336,0.0000016482329],"about_ca_topic_score_codex":0.012318729,"about_ca_topic_score_gemma":0.012252228,"teacher_disagreement_score":0.012318729,"about_ca_system_score_codex":0.0011999753,"about_ca_system_score_gemma":0.0011984931,"threshold_uncertainty_score":0.024494052},"labels":[],"label_agreement":null},{"id":"W7024201862","doi":"","title":"Propagation of a detonation in a converging conical channel","year":2017,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Interconnection Networks and 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":"McGill University","funders":"","keywords":"Detonation; Conical surface; Explosive material; Tube (container); Constant (computer programming); Shock wave; Argon","score_opus":0.020537923802427856,"score_gpt":0.25495223708333314,"score_spread":0.23441431328090528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024201862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903536,0.00008009349,0.0074714106,0.000026139494,0.000010638045,0.000026599415,0.00004522724,0.000073295276,0.0019130785],"genre_scores_gemma":[0.9944326,0.00008809948,0.0041292007,0.000011486563,0.00000381482,0.000013949201,0.000037184604,0.000008863346,0.0012747613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969566,0.00002774577,0.0000064017336,0.0000481598,0.000143096,0.000078905985],"domain_scores_gemma":[0.9993718,0.00025301843,0.00012353215,0.00004925217,0.00012769169,0.000074691314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029910918,0.00028410647,0.00040281782,0.00035164086,0.0005754001,0.0005490268,0.00045674652,0.00046584362,0.0012990835],"category_scores_gemma":[0.0007363349,0.00024847494,0.0001731336,0.00039783117,0.0008407648,0.00045366763,0.000704598,0.00054826104,0.0001659492],"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.00079898967,0.0001431585,0.0026763428,0.00010494717,0.000014919549,0.001317606,0.0005575448,0.023260234,0.95683897,0.0046628756,0.00029164169,0.0093327835],"study_design_scores_gemma":[0.0000568034,0.0015472585,0.006730191,0.000025788364,0.00002354742,0.00053271477,0.00036164094,0.13927099,0.8492006,0.0009045102,0.00127031,0.000075650125],"about_ca_topic_score_codex":0.0011900483,"about_ca_topic_score_gemma":0.00062212587,"teacher_disagreement_score":0.0012990835,"about_ca_system_score_codex":0.00040539115,"about_ca_system_score_gemma":0.00047707083,"threshold_uncertainty_score":0.004345894},"labels":[],"label_agreement":null},{"id":"W7025073637","doi":"","title":"Supporting self-management: intervention design for those with musculoskeletal conditions in the context of health literacy","year":2020,"lang":"en","type":"other","venue":"Keele Research Repository (Keele University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute for Health Research Applied Research Collaboration West; NIHR Nottingham Biomedical Research Centre; Research for Patient Benefit Programme; Versus Arthritis; Health and Medical Research Fund; National Institute for Health Research Collaboration for Leadership in Applied Health Research and Care Yorkshire and Humber; Economic and Social Research Council; Canadian Institutes of Health Research; Health Research Council of New Zealand; Patient Safety Translational Research Centre; NIHR Greater Manchester Patient Safety Translational Research Centre; Department of Health and Social Care; Medical Research Council; RACGP Foundation; Manchester Biomedical Research Centre; Michael Smith Health Research BC; University of Leeds; Health and Care Research Wales; BMA Foundation for Medical Research; NIHR School for Primary Care Research; Royal College of General Practitioners; Royal Australian College of General Practitioners; Food and Health Bureau; National Institute for Health and Care Research; Cancer Research UK; Wellcome Trust","keywords":"Context (archaeology); Health literacy; Intervention (counseling); Literacy; Psychological intervention; Digital health; Public health","score_opus":0.03821759363933908,"score_gpt":0.3396194471772212,"score_spread":0.3014018535378821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025073637","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8944971,0.00089512026,0.019732954,0.0061892965,0.0008291744,0.05877794,0.0006955293,0.0006291343,0.01775375],"genre_scores_gemma":[0.7544263,0.0013105136,0.11347355,0.0013848034,0.00014697175,0.12312849,0.0004777068,0.000053035623,0.0055986135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770504,0.0013634232,0.00019064652,0.00017913495,0.0001736343,0.00038816445],"domain_scores_gemma":[0.9951704,0.0023530724,0.00036638224,0.00019276742,0.00029347333,0.0016239141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062863026,0.0006354701,0.0010602095,0.0009682121,0.0015291274,0.0011356707,0.0016511204,0.0014725785,0.024030522],"category_scores_gemma":[0.011141849,0.00060120877,0.00088904554,0.00062590116,0.0006045313,0.0012658318,0.0024657135,0.0019166451,0.0012789048],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022721633,0.19999407,0.008034,0.006005333,0.00032226858,0.0003385485,0.012901585,0.0018344056,0.0028781218,0.0034561914,0.0135013005,0.72801256],"study_design_scores_gemma":[0.29548085,0.33719847,0.18278773,0.016614275,0.0041216407,0.0006815803,0.043926526,0.023420691,0.010501626,0.024113812,0.06048464,0.000668093],"about_ca_topic_score_codex":0.0016027243,"about_ca_topic_score_gemma":0.004289741,"teacher_disagreement_score":0.024030522,"about_ca_system_score_codex":0.0014140354,"about_ca_system_score_gemma":0.007486574,"threshold_uncertainty_score":0.080390155},"labels":[],"label_agreement":null},{"id":"W7028149934","doi":"","title":"The Effects of Christianization Among the Indigenous Communities of Kongo &amp; Lower Canada","year":2014,"lang":"en","type":"article","venue":"ScholarWorks - UNO (University of New Orleans)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Christianization; Indigenous; Christianity; Fifteenth; Period (music); Order (exchange)","score_opus":0.0050499954587979925,"score_gpt":0.1652430980246327,"score_spread":0.1601931025658347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028149934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99210656,0.00016503385,0.00000857358,0.0006836058,0.000013325821,0.000013449306,0.00004526436,0.0000019877723,0.0069622067],"genre_scores_gemma":[0.9968291,0.0002200527,0.000019079247,0.00015305662,0.0000035179949,0.000008506954,0.000025401747,0.0000028673878,0.0027383908],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979013,0.00041413598,0.000028692859,0.00012340238,0.00028317055,0.0012493515],"domain_scores_gemma":[0.99701655,0.0003374505,0.00028715344,0.0000922838,0.00082411047,0.0014424922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000897147,0.00031899856,0.0003608822,0.0011502081,0.026055265,0.0039511207,0.001399475,0.0006161019,0.005226444],"category_scores_gemma":[0.0030466313,0.00023167206,0.00023996261,0.0018221932,0.0069078775,0.0010091277,0.005113547,0.001822619,0.00019702395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000354661,0.00037903682,0.20515397,0.00010060128,0.00004674942,0.002173988,0.7578686,0.00013374118,0.0011954351,0.0044794735,0.004167997,0.02394572],"study_design_scores_gemma":[0.0000068085114,0.000044662745,0.15517583,0.000055993252,0.000011654531,0.00009083602,0.837406,0.00004722129,0.00014762572,0.00014434123,0.0068492093,0.000019831357],"about_ca_topic_score_codex":0.98259175,"about_ca_topic_score_gemma":0.99401397,"teacher_disagreement_score":0.045506388,"about_ca_system_score_codex":0.045506388,"about_ca_system_score_gemma":0.04246144,"threshold_uncertainty_score":0.3301735},"labels":[],"label_agreement":null},{"id":"W7030217835","doi":"","title":"METIS: a highly-robust fault-tolerant routing algorithm with a recursive-based path discovery scheme for 2d mesh network-on-chip-interconnected chip multi-processors","year":2014,"lang":"en","type":"dissertation","venue":"Ktisis at Cyprus University of Technology (Cyprus University of Technology)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Routing table; Router; Network packet; Equal-cost multi-path routing; Interconnection; Static routing; Link-state routing protocol; Routing (electronic design automation)","score_opus":0.009664328281117537,"score_gpt":0.19817879671920974,"score_spread":0.1885144684380922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030217835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025261024,0.00024686137,0.97123647,0.00015879034,0.000040900537,0.00008768842,0.00004961214,0.0012572921,0.0016613897],"genre_scores_gemma":[0.3453652,0.00018806076,0.6506593,0.00012075932,0.000025496465,0.00026004287,0.00025461693,0.00010528878,0.0030212225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998305,0.00003787729,0.000011722428,0.00003740703,0.000056934015,0.000025602452],"domain_scores_gemma":[0.999824,0.000055514785,0.00003820664,0.000031043,0.00003770319,0.00001354541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003041278,0.00042808804,0.00050561,0.0005489301,0.000540667,0.00040869287,0.0014738813,0.0006091897,0.0012331705],"category_scores_gemma":[0.00096366525,0.00023058716,0.00044727192,0.00042144032,0.0003786211,0.00069457747,0.000825615,0.00056081713,0.0002833566],"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.00037473085,0.00008206889,0.0014156998,0.00014362553,0.000089365996,0.00012072276,0.00027500713,0.63946724,0.037015926,0.0315224,0.005172632,0.28432053],"study_design_scores_gemma":[0.00002136283,0.000085636915,0.00013003526,0.000005463829,0.000009399954,0.000036871796,0.000015874355,0.9919592,0.0026989635,0.0027640993,0.0022644808,0.000008595154],"about_ca_topic_score_codex":0.0027358255,"about_ca_topic_score_gemma":0.00381946,"teacher_disagreement_score":0.0027358255,"about_ca_system_score_codex":0.0007057364,"about_ca_system_score_gemma":0.00061284547,"threshold_uncertainty_score":0.0054398775},"labels":[],"label_agreement":null},{"id":"W7034319707","doi":"","title":"3 Tesla MRI- Crohn disease activity score: correlation with Crohn Disease Activity Index (CDAI), endoscopic findings and biological markers.","year":2012,"lang":"en","type":"article","venue":"Electronic Theses and Dissertations Repository (University of Pisa)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correlation; Crohn's disease; Disease; Crohn disease; Stenosis; Ulcerative colitis","score_opus":0.009580254453194601,"score_gpt":0.20526857853546754,"score_spread":0.19568832408227294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034319707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952303,0.0011350162,0.0010667333,0.000069733294,0.000019974923,0.000051353272,0.0007320197,0.000044548386,0.0016504037],"genre_scores_gemma":[0.99672973,0.00019455665,0.0017672677,0.000026183689,0.000025827998,0.000036739733,0.0007765318,0.0000053112813,0.0004378153],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99972004,0.0001053993,0.000036498528,0.000049911658,0.00005925709,0.000028951683],"domain_scores_gemma":[0.99870694,0.00021476962,0.0005825638,0.000073552146,0.0001845225,0.00023769272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825221,0.0003994377,0.00034334927,0.00094404275,0.0001114598,0.00028292416,0.0001708995,0.00032383358,0.001924601],"category_scores_gemma":[0.0020814925,0.00012249399,0.00020423702,0.00055244076,0.00014429865,0.00025569857,0.00026217583,0.0002268086,0.00050411315],"study_design_candidate":"observational","study_design_consensus":"observational","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.00064417114,0.00006323808,0.9878898,0.00003598472,0.000097457094,0.00015581754,0.000032395154,0.00013564389,0.0022954857,0.000017316579,0.00035624328,0.008276453],"study_design_scores_gemma":[0.00003214645,0.0007125424,0.9952702,0.000007877,0.0000464593,0.0023736833,0.00003137831,0.00051336456,0.0005313171,0.000028274768,0.00044626178,0.000006611954],"about_ca_topic_score_codex":0.0005425269,"about_ca_topic_score_gemma":0.0011627926,"teacher_disagreement_score":0.001924601,"about_ca_system_score_codex":0.00014646382,"about_ca_system_score_gemma":0.00012811247,"threshold_uncertainty_score":0.006438434},"labels":[],"label_agreement":null},{"id":"W7034925249","doi":"","title":"Winckelmanns Idee der Schönheit und ihr Einfluss auf Walter Pater","year":2010,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Beauty; Hegelianism; Work (physics); Aesthetic experience","score_opus":0.0029523437912009607,"score_gpt":0.15756769586619235,"score_spread":0.15461535207499139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034925249","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120233,0.033301637,0.011244604,0.042035203,0.0025693648,0.00002803673,0.0000669483,0.000105002524,0.89652896],"genre_scores_gemma":[0.4016832,0.022807302,0.005725668,0.005537824,0.0012274394,0.000069882444,0.00005251543,0.00023725048,0.56265885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989361,0.0003572748,0.000022461049,0.00015997225,0.00038643533,0.00013766829],"domain_scores_gemma":[0.99971324,0.00013115701,0.000026945634,0.000030408391,0.000061512284,0.00003671655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010793174,0.00039532865,0.00019792096,0.00078846235,0.0036919618,0.003687774,0.0003204962,0.0010855321,0.0060900184],"category_scores_gemma":[0.0017248687,0.00027380988,0.00016915445,0.00067830423,0.00882596,0.0029654894,0.0015754978,0.003567506,0.0014668704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007805247,0.0000059781073,0.000043055556,0.000024034289,0.0000013301068,0.000060507708,0.0049215835,0.00018324482,0.00012354087,0.9494187,0.032106474,0.013103638],"study_design_scores_gemma":[0.000003600121,0.0000068619834,0.00015731607,0.00013981148,0.000002278594,0.00020078704,0.001652614,0.00021202647,0.0003726993,0.13174437,0.86549807,0.000009559411],"about_ca_topic_score_codex":0.012102079,"about_ca_topic_score_gemma":0.014967734,"teacher_disagreement_score":0.012102079,"about_ca_system_score_codex":0.0048030377,"about_ca_system_score_gemma":0.0026122972,"threshold_uncertainty_score":0.03484857},"labels":[],"label_agreement":null},{"id":"W7038604481","doi":"","title":"Hunger strike: Protester at Canadian embassy shifts tactics","year":2012,"lang":"en","type":"other","venue":"Chicago Tribune","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Field (mathematics); Perspective (graphical)","score_opus":0.01598116961317993,"score_gpt":0.22583122611856157,"score_spread":0.20985005650538163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038604481","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087281704,0.0016990759,0.0004621847,0.082792014,0.003145493,0.00010075417,0.0004909624,0.00023617953,0.8237917],"genre_scores_gemma":[0.31206647,0.0010988872,0.00024261321,0.018888064,0.0004029743,0.000039047052,0.0002561876,0.0001137741,0.666892],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977145,0.00008728218,0.000016841792,0.00010645214,0.00074403576,0.001330834],"domain_scores_gemma":[0.99838793,0.000110601075,0.000037501184,0.000041666768,0.0006091244,0.0008131746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086164253,0.00063195766,0.000288105,0.0014998548,0.03445807,0.009337426,0.0016227498,0.006400824,0.046078585],"category_scores_gemma":[0.0036855969,0.00036044343,0.00036810682,0.0019813634,0.0033345243,0.0016090439,0.0028025988,0.0063341362,0.0039006895],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009833978,0.00006178026,0.0045340927,0.000035493493,0.00002191116,0.0008961136,0.006495061,0.00048453928,0.00038405866,0.033490006,0.9249859,0.028512701],"study_design_scores_gemma":[0.000036293168,0.000034785167,0.010858787,0.00008666929,0.000019607995,0.00015255476,0.026953414,0.00043779027,0.00031543407,0.0023253758,0.9587308,0.000048568454],"about_ca_topic_score_codex":0.959613,"about_ca_topic_score_gemma":0.991282,"teacher_disagreement_score":0.047543373,"about_ca_system_score_codex":0.047543373,"about_ca_system_score_gemma":0.049306992,"threshold_uncertainty_score":0.34495294},"labels":[],"label_agreement":null},{"id":"W7084043775","doi":"10.6084/m9.figshare.c.8004122","title":"Methods for engaging vulnerable and marginalized children through community based participatory research: a scoping review","year":2025,"lang":"en","type":"other","venue":"Figshare","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 Alberta; University of Toronto","funders":"","keywords":"Participatory action research; Community-based participatory research; General partnership; Inclusion (mineral); Focus group; Community engagement; Consistency (knowledge bases); Ethnic group","score_opus":0.5016192028161891,"score_gpt":0.510009181568498,"score_spread":0.008389978752308846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084043775","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006845835,0.96824783,0.01006213,0.0056277993,0.0014295976,0.01004723,0.000372656,0.00006586497,0.0034622685],"genre_scores_gemma":[0.008557196,0.93720984,0.02880879,0.0018766497,0.00031461663,0.022351455,0.0003448752,0.000035423036,0.00050126796],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.82193416,0.11253503,0.036315214,0.0062342477,0.020805491,0.002175826],"domain_scores_gemma":[0.66400856,0.2719437,0.021861611,0.008608127,0.03159651,0.0019814682],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.15664543,0.0034546414,0.0076304404,0.03996493,0.0051878374,0.014473736,0.0064808843,0.007923002,0.0067814505],"category_scores_gemma":[0.30399117,0.002635666,0.010007956,0.029782228,0.0058724578,0.014870619,0.0115793375,0.006341481,0.0014801128],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","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.000106615946,0.00010690664,0.00084818597,0.64314985,0.0016603257,0.00021907552,0.0076384665,0.0006958963,0.00034806062,0.014420298,0.011294143,0.31951216],"study_design_scores_gemma":[0.00003521547,0.000056409248,0.00041341758,0.93307686,0.0013622122,0.00011785422,0.0024670465,0.00016823,0.00015337294,0.0032764007,0.058833558,0.000039571813],"about_ca_topic_score_codex":0.008928224,"about_ca_topic_score_gemma":0.018800534,"teacher_disagreement_score":0.8433546,"about_ca_system_score_codex":0.015226726,"about_ca_system_score_gemma":0.07530885,"threshold_uncertainty_score":0.8284301},"labels":[],"label_agreement":null},{"id":"W7096606346","doi":"","title":"Integration Of A Graph Formatter With Symmetry And Bisection Analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Interconnection; Line graph; Graph theory; Hypercube graph; Heuristic; Strength of a graph; Symmetry (geometry)","score_opus":0.00820018608699541,"score_gpt":0.22324766242109192,"score_spread":0.21504747633409652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096606346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007171301,0.000025341014,0.99515355,0.00004671486,0.000039364313,0.00004232573,0.000072847324,0.002019575,0.0018832239],"genre_scores_gemma":[0.023292013,0.000121348305,0.9726132,0.000054496657,0.000057315636,0.00013673244,0.0003917564,0.0010828027,0.0022503468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979169,0.0006823823,0.00024266043,0.00037791693,0.00068277126,0.000097422555],"domain_scores_gemma":[0.9954332,0.0016477212,0.00031389928,0.0015645879,0.00092609035,0.00011458216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002320931,0.0018666532,0.001318322,0.00442656,0.00092924415,0.0028256867,0.0026969342,0.0008723148,0.017343454],"category_scores_gemma":[0.0093480665,0.0008868111,0.0024532964,0.0033922119,0.0013719597,0.006095103,0.0025100245,0.0021662558,0.006268174],"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.00021677736,0.00013642502,0.00048119944,0.00040242565,0.00010147843,0.0003986528,0.00048648598,0.06602018,0.012338493,0.46073654,0.009543847,0.4491375],"study_design_scores_gemma":[0.000062085244,0.00018533018,0.00024686113,0.00012601004,0.00007842518,0.0004620527,0.00016037813,0.4346867,0.019145293,0.4867006,0.058048844,0.00009734794],"about_ca_topic_score_codex":0.0017657006,"about_ca_topic_score_gemma":0.0022471435,"teacher_disagreement_score":0.017343454,"about_ca_system_score_codex":0.0009237891,"about_ca_system_score_gemma":0.001124187,"threshold_uncertainty_score":0.058019638},"labels":[],"label_agreement":null},{"id":"W7097069938","doi":"","title":"CRC HANDBOOK ON ALGORITHMS AND THEORY OF COMPUTATION Mikhail Atallah, Editor Chapter 48 Parallel Computation: Models and Complexity Issues","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computation; Computational complexity theory; Foundation (evidence); Parallel algorithm; Model of computation; Science and engineering","score_opus":0.058146719659689754,"score_gpt":0.28892527081021996,"score_spread":0.2307785511505302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097069938","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007191964,0.45365405,0.13950579,0.048539903,0.031554352,0.00020845505,0.0020292976,0.0026606675,0.3211283],"genre_scores_gemma":[0.013411659,0.4308987,0.09628777,0.0118087735,0.028978864,0.0004719301,0.0025709677,0.0024367978,0.4131347],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981719,0.00022698696,0.00014337692,0.00029257793,0.0010750995,0.00009007416],"domain_scores_gemma":[0.99607676,0.0023954995,0.00012682746,0.00029141328,0.00095957285,0.00014994606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340043,0.0017389868,0.0016937105,0.0040025185,0.0012559723,0.0046993513,0.001851386,0.0019897514,0.041101497],"category_scores_gemma":[0.0062855347,0.0012582737,0.0012828588,0.00568187,0.0020884154,0.008227591,0.0013431387,0.005688539,0.029997583],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001973504,0.000014526527,0.000066344764,0.0005046601,0.000013836571,0.00003698842,0.0001379118,0.0011852108,0.0002583628,0.12570317,0.75601166,0.11604761],"study_design_scores_gemma":[0.000004884765,0.0000054858388,0.00007413606,0.00023109319,0.0000048255315,0.00011400756,0.000026891381,0.0007895624,0.00008237596,0.06491242,0.9337448,0.000009478372],"about_ca_topic_score_codex":0.0030396497,"about_ca_topic_score_gemma":0.0037625225,"teacher_disagreement_score":0.041101497,"about_ca_system_score_codex":0.0024207905,"about_ca_system_score_gemma":0.0036915268,"threshold_uncertainty_score":0.13749814},"labels":[],"label_agreement":null},{"id":"W7100324371","doi":"","title":"Composite-Star Transport Network with Disconnected Core Switches","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reliability (semiconductor); Core (optical fiber); Limiting; Relation (database); Transport network","score_opus":0.016906704473088858,"score_gpt":0.2247887462625796,"score_spread":0.20788204178949074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100324371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613039,0.00076615077,0.412321,0.0008609622,0.0003101235,0.00021797324,0.0010977922,0.0014491818,0.021672973],"genre_scores_gemma":[0.96283066,0.00024350148,0.027157985,0.000088068766,0.000043998472,0.00007161306,0.0005021237,0.000038854407,0.009023262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973196,0.00006645425,0.000018742352,0.00007074018,0.000054648033,0.000057396624],"domain_scores_gemma":[0.9989536,0.00027794816,0.00007650181,0.00016342409,0.00035324154,0.00017539453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005954414,0.0003539157,0.00054155436,0.00072872266,0.0010398434,0.0013552312,0.0012913247,0.0007183063,0.0045403796],"category_scores_gemma":[0.000919195,0.000268458,0.0003476168,0.00085260684,0.00054635276,0.0016533762,0.0011555392,0.0005180839,0.000842139],"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.005844658,0.00048090648,0.005698923,0.0005952061,0.00016788591,0.0020547432,0.00043083145,0.6304387,0.061060663,0.14755528,0.017530404,0.12814176],"study_design_scores_gemma":[0.00006793779,0.00029315878,0.0007684775,0.00001940482,0.00004416582,0.00026934876,0.00010787774,0.95952314,0.006935542,0.02606223,0.0058849617,0.000023771929],"about_ca_topic_score_codex":0.002280667,"about_ca_topic_score_gemma":0.0041993717,"teacher_disagreement_score":0.0045403796,"about_ca_system_score_codex":0.0013655091,"about_ca_system_score_gemma":0.0010540582,"threshold_uncertainty_score":0.015189111},"labels":[],"label_agreement":null},{"id":"W7100502139","doi":"","title":"Dalhousie University","year":2008,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Static routing; Policy-based routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Interconnection; Routing (electronic design automation); Multipath routing; Routing table","score_opus":0.018937236773915893,"score_gpt":0.18003725665435386,"score_spread":0.16110001988043796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100502139","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029339239,0.0039767735,0.0028530143,0.004161088,0.0015554915,0.00014657731,0.009444787,0.0014433142,0.973485],"genre_scores_gemma":[0.0056425524,0.0026177482,0.002814178,0.000567635,0.00006950677,0.00007235023,0.004093459,0.00040233502,0.9837203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837047,0.00011712809,0.00011708051,0.0005966103,0.0005832594,0.00021536517],"domain_scores_gemma":[0.99861765,0.0002382663,0.00007729946,0.00027103667,0.00052353716,0.00027220466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000714812,0.0021576036,0.0013787564,0.002369235,0.0030092401,0.009231076,0.0016185319,0.002188212,0.73359567],"category_scores_gemma":[0.002109743,0.0009206763,0.0010996604,0.002724068,0.0013969284,0.0033946193,0.004021485,0.002728468,0.47838983],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0005382959,0.00037887142,0.003492192,0.0012537856,0.00009092237,0.0020428125,0.00069744553,0.0033296503,0.005345273,0.10279285,0.4558721,0.42416582],"study_design_scores_gemma":[0.000023030705,0.000032733667,0.0011535689,0.00015273417,0.00000779429,0.00012233667,0.00018145675,0.0006139516,0.0007285792,0.0029310908,0.99402905,0.00002363666],"about_ca_topic_score_codex":0.05836878,"about_ca_topic_score_gemma":0.074094154,"teacher_disagreement_score":0.26640433,"about_ca_system_score_codex":0.005653994,"about_ca_system_score_gemma":0.0066027516,"threshold_uncertainty_score":0.37999344},"labels":[],"label_agreement":null},{"id":"W7109823275","doi":"10.61091/jcmcc128-24","title":"Fault-tolerant detection systems on the infinite king grid","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Detector; Set (abstract data type); Grid; Redundancy (engineering); Closed set","score_opus":0.01714667387071589,"score_gpt":0.2487349062608268,"score_spread":0.23158823239011092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109823275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16632201,0.00026278393,0.82007456,0.00073660014,0.000063733474,0.00008503386,0.0003517826,0.0011451007,0.010958519],"genre_scores_gemma":[0.9213161,0.00018255212,0.07193479,0.00013008209,0.000019984016,0.000116272815,0.00026777186,0.00009357353,0.0059389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896014,0.00023969288,0.0000677165,0.00028469609,0.00024589497,0.00020175832],"domain_scores_gemma":[0.9955329,0.0024504561,0.00046086597,0.0007929997,0.00046297256,0.00029984085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257897,0.0005470098,0.000965686,0.0006947284,0.00079602306,0.0015238828,0.0016888549,0.0007345753,0.0036033888],"category_scores_gemma":[0.006703638,0.0005033864,0.0004391471,0.0008840144,0.0013941447,0.003291751,0.002307248,0.0013114504,0.00067391107],"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.00031681955,0.000059140173,0.0013091704,0.00009287504,0.000030455181,0.00024732383,0.00020530728,0.7168032,0.0048242067,0.24551304,0.0030902317,0.027508205],"study_design_scores_gemma":[0.000025920224,0.000031261767,0.00018557567,0.000008156868,0.000006319782,0.00007596729,0.00007213135,0.87964916,0.0010706644,0.11739974,0.0014636383,0.0000114611],"about_ca_topic_score_codex":0.005553845,"about_ca_topic_score_gemma":0.0034013658,"teacher_disagreement_score":0.005553845,"about_ca_system_score_codex":0.001859284,"about_ca_system_score_gemma":0.00088926626,"threshold_uncertainty_score":0.013490081},"labels":[],"label_agreement":null},{"id":"W7133078808","doi":"","title":"Collective Communication Enabled Transformer Acceleration on Heterogeneous Clusters","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Toronto","funders":"University of Toronto","keywords":"Scalability; Field-programmable gate array; Interface (matter); Context (archaeology); Flexibility (engineering); Acceleration; Cluster (spacecraft); Mobile device","score_opus":0.04363108777359739,"score_gpt":0.3287014519072325,"score_spread":0.28507036413363507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133078808","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5662614,0.0005042517,0.3778022,0.00069151295,0.00029235202,0.00021090053,0.00021989715,0.013107123,0.040910203],"genre_scores_gemma":[0.93686956,0.000113283386,0.056455523,0.00008035041,0.00002806909,0.00008602806,0.00023365948,0.00035115905,0.0057823975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996935,0.000046762096,0.000007946793,0.000053403077,0.00011148418,0.00008694362],"domain_scores_gemma":[0.99968207,0.000062619256,0.000020519565,0.00009429013,0.00008062294,0.000059910966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028877077,0.00050745613,0.00032104942,0.00042693593,0.0005648386,0.0008516139,0.001337766,0.0003067141,0.0030374741],"category_scores_gemma":[0.0007787061,0.00021195771,0.00033614377,0.0004975961,0.00045406414,0.0009544939,0.0016032304,0.00071152457,0.00072334526],"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.0010358221,0.0002621995,0.0052315746,0.00020416942,0.00010310131,0.0010149132,0.0008741296,0.6003928,0.131168,0.056968797,0.025385423,0.17735907],"study_design_scores_gemma":[0.000086933695,0.00019338139,0.0010585216,0.000010147322,0.000021458089,0.00009914912,0.000149888,0.9463458,0.032319427,0.008099701,0.011588723,0.000026890819],"about_ca_topic_score_codex":0.0030042103,"about_ca_topic_score_gemma":0.003891899,"teacher_disagreement_score":0.0030374741,"about_ca_system_score_codex":0.00086855557,"about_ca_system_score_gemma":0.0006942297,"threshold_uncertainty_score":0.0101614},"labels":[],"label_agreement":null},{"id":"W7139803063","doi":"","title":"Prototyping a scalable massively-parallel supercomputer architecture with field programmable gate arrays","year":2001,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Supercomputer; Scalability; Field (mathematics); Architecture; Computer design; Rapid prototyping; Hybrid computer; Field-programmable gate array","score_opus":0.008528083715070864,"score_gpt":0.22964496787546743,"score_spread":0.22111688416039657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139803063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.647571,0.0009960225,0.29614154,0.0018013763,0.0006374978,0.00050729996,0.0005757147,0.009674693,0.042094886],"genre_scores_gemma":[0.74906534,0.00037476394,0.23869501,0.00017217321,0.000060884922,0.0002084534,0.0006887264,0.00019997222,0.010534645],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999811,0.000035875335,0.000008971939,0.000022602308,0.000073587114,0.000048063488],"domain_scores_gemma":[0.99965966,0.00008248642,0.000018714296,0.00005726738,0.00012214326,0.00005973852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029905073,0.0004127641,0.00027940745,0.00031473188,0.00046759692,0.00070476456,0.001438788,0.0004052022,0.0057338504],"category_scores_gemma":[0.0005834486,0.00023890818,0.00026284257,0.000323217,0.00023315565,0.0009749825,0.00047840123,0.0005669808,0.0009799205],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0012414643,0.00076543103,0.0033380562,0.00040640763,0.00017063023,0.001327934,0.0005048765,0.23496519,0.42086673,0.028293706,0.050020378,0.25809923],"study_design_scores_gemma":[0.0004451488,0.0012415582,0.0013112712,0.000040294908,0.000043853815,0.0002473016,0.000237629,0.83075225,0.12131398,0.010623947,0.033691965,0.000050773753],"about_ca_topic_score_codex":0.0017920135,"about_ca_topic_score_gemma":0.0033455435,"teacher_disagreement_score":0.0057338504,"about_ca_system_score_codex":0.00038487025,"about_ca_system_score_gemma":0.00062979764,"threshold_uncertainty_score":0.01918161},"labels":[],"label_agreement":null},{"id":"W7157512978","doi":"","title":"First CASI/UTIAS Workshop on Low-Cost Space System: University of Toronto","year":2001,"lang":"","type":"article","venue":"ScholarWorks - MoreheadState (Morehead State University)","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presentation (obstetrics); Space (punctuation); Space research","score_opus":0.017294757771516168,"score_gpt":0.212573554242803,"score_spread":0.19527879647128682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7157512978","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03673198,0.10076158,0.04304445,0.07158877,0.022529924,0.0005251174,0.007445835,0.003583678,0.7137886],"genre_scores_gemma":[0.081941806,0.024664879,0.005498082,0.00088296505,0.0018893494,0.000122056554,0.0026071689,0.0005021389,0.8818914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908483,0.00008158678,0.000016954344,0.000099062454,0.00043963583,0.00027795075],"domain_scores_gemma":[0.99899787,0.000078074205,0.00002739084,0.00004366571,0.0004904137,0.00036260142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012656425,0.0013427358,0.0007394672,0.0008041706,0.0026360408,0.0038988856,0.0010652452,0.0014273531,0.07737969],"category_scores_gemma":[0.00095112814,0.0005007603,0.0004206945,0.0017231881,0.0010855497,0.0016709022,0.001452483,0.001751672,0.015091306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00017937389,0.000025103383,0.00033992116,0.00020838098,0.000011791039,0.00012421596,0.0004104183,0.001465838,0.0014847768,0.010053227,0.94488543,0.040811367],"study_design_scores_gemma":[0.000023173878,0.000042559637,0.0013291253,0.0001152319,0.000017939947,0.000044536955,0.0003441971,0.0010196973,0.0014188609,0.0010598282,0.9945651,0.000019781219],"about_ca_topic_score_codex":0.25987676,"about_ca_topic_score_gemma":0.5232276,"teacher_disagreement_score":0.25987676,"about_ca_system_score_codex":0.011270239,"about_ca_system_score_gemma":0.010027875,"threshold_uncertainty_score":0.5167282},"labels":[],"label_agreement":null},{"id":"W7162085041","doi":"10.82308/24272","title":"Modeling and evaluation of a hierarchical ring interconnect for system-on-chip multiprocessing","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiprocessing; SystemC; FIFO (computing and electronics); Interconnection; Key (lock); Scheme (mathematics); Deadlock; Software; Logic synthesis","score_opus":0.04454326454150702,"score_gpt":0.31702059371539093,"score_spread":0.2724773291738839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162085041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44938642,0.0004722307,0.5302443,0.0002907598,0.000038680817,0.00020240837,0.00021119826,0.00084938726,0.018304612],"genre_scores_gemma":[0.9260972,0.00023367428,0.0694651,0.000021900863,0.00000897357,0.00013033161,0.00012325105,0.00007271778,0.0038468568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984646,0.00004873503,0.000006568076,0.00001533934,0.00006326721,0.000019593997],"domain_scores_gemma":[0.9997576,0.000113334034,0.00003263388,0.000027031072,0.000059901893,0.0000094721545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031290358,0.00028748432,0.00026724397,0.00020778977,0.00025967642,0.0005289617,0.00065985636,0.00040189383,0.0012002907],"category_scores_gemma":[0.00083098875,0.00018858821,0.00032270775,0.00016185232,0.00026729138,0.0004806808,0.0002573907,0.00028622683,0.00017455482],"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.000025361533,0.000015242125,0.0004353868,0.000028815855,0.000005198657,0.00002880522,0.000027922813,0.98558086,0.004504705,0.00555016,0.00013438774,0.0036632179],"study_design_scores_gemma":[0.0000021353535,0.000016803675,0.000073324285,0.0000013782435,0.0000029250077,0.0000045796182,0.0000036255685,0.9984818,0.00086813525,0.00025894717,0.00028519065,0.000001096882],"about_ca_topic_score_codex":0.0052695335,"about_ca_topic_score_gemma":0.005007252,"teacher_disagreement_score":0.0052695335,"about_ca_system_score_codex":0.0007966491,"about_ca_system_score_gemma":0.0009500761,"threshold_uncertainty_score":0.010477722},"labels":[],"label_agreement":null},{"id":"W786724073","doi":"10.1016/j.dam.2015.05.004","title":"On the complexity of the shortest-path broadcast problem","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Shortest path problem; Multiplicative function; Longest path problem; Mathematics; Combinatorics; Time complexity; Computer science; Discrete mathematics; Graph","score_opus":0.06746691470365561,"score_gpt":0.2504173971662269,"score_spread":0.18295048246257128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W786724073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3941509,0.009810385,0.42869392,0.040292162,0.0013218748,0.00043654937,0.005971835,0.0010560602,0.11826632],"genre_scores_gemma":[0.9125282,0.005361402,0.056641504,0.0014093167,0.0019147923,0.00044508855,0.0035312185,0.00058394857,0.017584559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621874,0.0012401907,0.00017769511,0.00061877473,0.0010565559,0.0006879902],"domain_scores_gemma":[0.93829554,0.055265047,0.0018691638,0.0018045517,0.0015209883,0.0012447458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029956475,0.0014307431,0.0031033973,0.0018512196,0.0021380212,0.006682588,0.0035741855,0.0031666472,0.016389236],"category_scores_gemma":[0.036043536,0.0010500432,0.0016525696,0.0036223482,0.0029399837,0.01549336,0.0036045602,0.006262868,0.0012160189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015878364,0.0004777727,0.00325317,0.0010212741,0.00024082322,0.00036476136,0.00076443155,0.3072306,0.0023611474,0.58600086,0.04231258,0.054384712],"study_design_scores_gemma":[0.00015316112,0.000046192403,0.00059565605,0.000048530514,0.000054061118,0.00010312448,0.00017780035,0.34163925,0.00037139934,0.65419716,0.0025815715,0.00003213409],"about_ca_topic_score_codex":0.006468339,"about_ca_topic_score_gemma":0.005085547,"teacher_disagreement_score":0.016389236,"about_ca_system_score_codex":0.0046921396,"about_ca_system_score_gemma":0.003536743,"threshold_uncertainty_score":0.054827392},"labels":[],"label_agreement":null},{"id":"W847534650","doi":"10.1184/r1/6468359","title":"Asymmetry-aware execution placement on manycore chips","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; VMware; Seagate Technology; NetApp; Samsung; International Science and Technology Center; Western Digital","keywords":"Computer science; Memory controller; Thread (computing); Linux kernel; Embedded system; Shared memory; Controller (irrigation); Distributed shared memory; Uniform memory access; Parallel computing; Memory management; Operating system; Semiconductor memory","score_opus":0.04005710349219343,"score_gpt":0.26135885830065,"score_spread":0.22130175480845654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W847534650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70283544,0.0008257335,0.28319666,0.00048365895,0.00015252482,0.00010688114,0.0001445655,0.0042156647,0.008038961],"genre_scores_gemma":[0.94419205,0.00007312477,0.054150827,0.00007475258,0.00000934479,0.000017828628,0.000076710734,0.000113534494,0.0012917622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.00020238009,0.000045659435,0.00010882348,0.00021516024,0.0001157351],"domain_scores_gemma":[0.9987142,0.000315757,0.00017761231,0.00042692802,0.00028670163,0.000078748424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070696726,0.0003405558,0.00030740554,0.00031520333,0.0003750798,0.0006649398,0.0010383773,0.00025745892,0.0018956655],"category_scores_gemma":[0.0024182114,0.0002272621,0.00011861378,0.00035753005,0.0002796841,0.000951643,0.000733662,0.00038646552,0.0003642364],"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.0013605243,0.00024573883,0.016777914,0.00029341076,0.0000913307,0.00059644756,0.00051815744,0.3779689,0.16478379,0.018390577,0.00903677,0.40993643],"study_design_scores_gemma":[0.000071786446,0.00037955187,0.004980993,0.00002241468,0.000044217995,0.00022870628,0.00018658828,0.88462454,0.09021951,0.010805408,0.008386658,0.000049638358],"about_ca_topic_score_codex":0.0014813895,"about_ca_topic_score_gemma":0.0041785776,"teacher_disagreement_score":0.0018956655,"about_ca_system_score_codex":0.0006830407,"about_ca_system_score_gemma":0.000754949,"threshold_uncertainty_score":0.006341636},"labels":[],"label_agreement":null},{"id":"W8862051","doi":"10.1016/s0002-9394(14)72114-2","title":"A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks","year":2006,"lang":"en","type":"article","venue":"American Journal of Ophthalmology","topic":"Interconnection Networks and 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":"Brock University","funders":"","keywords":"Hypercube; Neighbourhood (mathematics); Interconnection; Cayley graph; Broadcasting (networking); Node (physics); Computer science; Mathematics; Star (game theory); Permutation (music); Discrete mathematics; Computer network; Combinatorics; Graph; Topology (electrical circuits)","score_opus":0.018091686730328377,"score_gpt":0.2639532141318571,"score_spread":0.2458615274015287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W8862051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.157897,0.0014071584,0.8225174,0.00037993948,0.00035983988,0.00032304265,0.00023589583,0.0024659885,0.0144136865],"genre_scores_gemma":[0.8078385,0.00046072566,0.1817574,0.00008070575,0.00017156008,0.00030054103,0.00035688942,0.00012296069,0.008910748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918264,0.0002708754,0.00006800602,0.00009120681,0.00024836382,0.00013888133],"domain_scores_gemma":[0.99807894,0.00052776665,0.000119077784,0.0007037291,0.0004531031,0.000117435535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011240162,0.00038759084,0.00087636954,0.0010767545,0.0014205768,0.0009078446,0.0015026189,0.00068897335,0.002875835],"category_scores_gemma":[0.0030514027,0.00026788734,0.0003256003,0.0013085166,0.0006589084,0.0015487382,0.0015762984,0.00052457984,0.000633091],"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.0027014327,0.00020327303,0.0011631185,0.00043361893,0.000107942884,0.00034554538,0.00095092744,0.15693024,0.07726008,0.17325132,0.014830496,0.571822],"study_design_scores_gemma":[0.00045229713,0.00090704195,0.0010887629,0.0000826315,0.00018917932,0.00034305736,0.00019960634,0.88663703,0.016444622,0.0584428,0.035071407,0.00014144047],"about_ca_topic_score_codex":0.0037085037,"about_ca_topic_score_gemma":0.0062685297,"teacher_disagreement_score":0.0037085037,"about_ca_system_score_codex":0.0011928628,"about_ca_system_score_gemma":0.0008975352,"threshold_uncertainty_score":0.009620607},"labels":[],"label_agreement":null},{"id":"W96860797","doi":"","title":"On K-broadcasting in graphs","year":2006,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Vertex (graph theory); Graph; Computer science; Combinatorics; Network topology; Upper and lower bounds; Connectivity; Mathematics; Discrete mathematics; Computer network","score_opus":0.02373778545448986,"score_gpt":0.26864775329140494,"score_spread":0.2449099678369151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96860797","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03517142,0.010481604,0.8173685,0.0058002453,0.00065583724,0.00033690073,0.0012547955,0.00091130915,0.12801938],"genre_scores_gemma":[0.40068606,0.044926878,0.48736152,0.0037634668,0.0029195666,0.0014836635,0.0040079514,0.0012388678,0.053612027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851066,0.0004513812,0.000085262014,0.00034315503,0.00040901382,0.00020052968],"domain_scores_gemma":[0.9954211,0.0032957653,0.00024827576,0.0004657471,0.00036613533,0.0002030918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012681953,0.0018055515,0.0015058654,0.002278463,0.00213332,0.0031415157,0.0015619849,0.0014208502,0.008611296],"category_scores_gemma":[0.0059689884,0.0008429813,0.001332803,0.0061209532,0.0036908237,0.0070314314,0.0024597347,0.004451415,0.0029826844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099969664,0.00005688001,0.00023401604,0.00047621457,0.000039431765,0.00013072093,0.0004902176,0.048725333,0.0016254302,0.87286127,0.016369931,0.058890544],"study_design_scores_gemma":[0.000036781974,0.000035556666,0.00020770039,0.000091848495,0.00002618074,0.00013939863,0.00009601546,0.03363173,0.00067801966,0.9376463,0.027387915,0.000022565355],"about_ca_topic_score_codex":0.003636569,"about_ca_topic_score_gemma":0.0029998033,"teacher_disagreement_score":0.008611296,"about_ca_system_score_codex":0.0032831202,"about_ca_system_score_gemma":0.0012912836,"threshold_uncertainty_score":0.02880764},"labels":[],"label_agreement":null}]}